theory CSpaceInv_AI

lemma set_cap_pred_tcb [wp]:
 "\<lbrace>pred_tcb_at proj P t\<rbrace> set_cap c p \<lbrace>\<lambda>rv. pred_tcb_at proj P t\<rbrace>" apply (simp add: set_cap_def set_object_def split_def) apply (wp get_object_wp | wpc)+ apply (auto simp: pred_tcb_at_def obj_at_def tcb_to_itcb_def) done

(* Proof state trace *)
proof (prove)
goal (1 subgoal):
 1. \<lbrace>pred_tcb_at proj P t\<rbrace> set_cap c p \<lbrace>\<lambda>rv. pred_tcb_at proj P t\<rbrace> proof (prove)
goal (1 subgoal):
 1. \<lbrace>pred_tcb_at proj P t\<rbrace> do obj <- get_object (fst p);
obj' <- case obj of CNode sz cn \<Rightarrow> if snd p \<in> dom cn \<and> well_formed_cnode_n sz cn then return $ CNode sz $ cn(snd p \<mapsto> c) else fail | TCB tcb \<Rightarrow> if snd p = tcb_cnode_index 0 then return $ TCB $ tcb\<lparr>tcb_ctable := c\<rparr> else if snd p = tcb_cnode_index 1 then return $ TCB $ tcb\<lparr>tcb_vtable := c\<rparr> else if snd p = tcb_cnode_index 2 then return $ TCB $ tcb\<lparr>tcb_reply := c\<rparr> else if snd p = tcb_cnode_index 3 then return $ TCB $ tcb\<lparr>tcb_caller := c\<rparr> else if snd p = tcb_cnode_index 4 then return $ TCB $ tcb\<lparr>tcb_ipcframe := c\<rparr> else fail | _ \<Rightarrow> fail;
kobj <- get_object (fst p);
y <- assert (a_type kobj = a_type obj');
s <- get;
put (s\<lparr>kheap := (kheap s)(fst p \<mapsto> obj')\<rparr>)
od \<lbrace>\<lambda>rv. pred_tcb_at proj P t\<rbrace> proof (prove)
goal (1 subgoal):
 1. \<And>s. pred_tcb_at proj P t s \<Longrightarrow> \<forall>ko. ko_at ko (fst p) s \<longrightarrow> (\<forall>x xa. ko = CNode x xa \<longrightarrow> (snd p \<in> dom xa \<and> well_formed_cnode_n x xa \<longrightarrow> (\<forall>ko. ko_at ko (fst p) s \<longrightarrow> a_type ko = a_type (CNode x $ xa(snd p \<mapsto> c)) \<longrightarrow> pred_tcb_at proj P t (s\<lparr>kheap := (kheap s)(fst p \<mapsto> CNode x $ xa(snd p \<mapsto> c))\<rparr>))) \<and> (\<not> (snd p \<in> dom xa \<and> well_formed_cnode_n x xa) \<longrightarrow> True)) \<and> (\<forall>x. ko = TCB x \<longrightarrow> (snd p = tcb_cnode_index 0 \<longrightarrow> (\<forall>ko. ko_at ko (fst p) s \<longrightarrow> a_type ko = a_type (TCB $ x\<lparr>tcb_ctable := c\<rparr>) \<longrightarrow> pred_tcb_at proj P t (s\<lparr>kheap := (kheap s)(fst p \<mapsto> TCB $ x\<lparr>tcb_ctable := c\<rparr>)\<rparr>))) \<and> (snd p \<noteq> tcb_cnode_index 0 \<longrightarrow> (snd p = tcb_cnode_index 1 \<longrightarrow> (\<forall>ko. ko_at ko (fst p) s \<longrightarrow> a_type ko = a_type (TCB $ x\<lparr>tcb_vtable := c\<rparr>) \<longrightarrow> pred_tcb_at proj P t (s\<lparr>kheap := (kheap s)(fst p \<mapsto> TCB $ x\<lparr>tcb_vtable := c\<rparr>)\<rparr>))) \<and> (snd p \<noteq> tcb_cnode_index 1 \<longrightarrow> (snd p = tcb_cnode_index 2 \<longrightarrow> (\<forall>ko. ko_at ko (fst p) s \<longrightarrow> a_type ko = a_type (TCB $ x\<lparr>tcb_reply := c\<rparr>) \<longrightarrow> pred_tcb_at proj P t (s\<lparr>kheap := (kheap s)(fst p \<mapsto> TCB $ x\<lparr>tcb_reply := c\<rparr>)\<rparr>))) \<and> (snd p \<noteq> tcb_cnode_index 2 \<longrightarrow> (snd p = tcb_cnode_index 3 \<longrightarrow> (\<forall>ko. ko_at ko (fst p) s \<longrightarrow> a_type ko = a_type (TCB $ x\<lparr>tcb_caller := c\<rparr>) \<longrightarrow> pred_tcb_at proj P t (s\<lparr>kheap := (kheap s)(fst p \<mapsto> TCB $ x\<lparr>tcb_caller := c\<rparr>)\<rparr>))) \<and> (snd p \<noteq> tcb_cnode_index 3 \<longrightarrow> (snd p = tcb_cnode_index 4 \<longrightarrow> (\<forall>ko. ko_at ko (fst p) s \<longrightarrow> a_type ko = a_type (TCB $ x\<lparr>tcb_ipcframe := c\<rparr>) \<longrightarrow> pred_tcb_at proj P t (s\<lparr>kheap := (kheap s)(fst p \<mapsto> TCB $ x\<lparr>tcb_ipcframe := c\<rparr>)\<rparr>))) \<and> (snd p \<noteq> tcb_cnode_index 4 \<longrightarrow> True)))))) \<and> (\<forall>x. ko = Endpoint x \<longrightarrow> True) \<and> (\<forall>x. ko = Notification x \<longrightarrow> True) \<and> (\<forall>x. ko = ArchObj x \<longrightarrow> True) proof (prove)
goal:
No subgoals!