theory structures_proofs

lemma (in kernel_all_substitute) cap_notification_cap_get_capNtfnBadge_spec:
  "\<forall>s. \<Gamma> \<turnstile> \<lbrace>s. cap_get_tag \<acute>cap = scast cap_notification_cap\<rbrace>
       \<acute>ret__unsigned :== PROC cap_notification_cap_get_capNtfnBadge(\<acute>cap)
       \<lbrace>\<acute>ret__unsigned = cap_notification_cap_CL.capNtfnBadge_CL (cap_notification_cap_lift \<^bsup>s\<^esup>cap)\<rbrace>" apply(rule allI, rule conseqPre, vcg) apply (clarsimp simp:guard_simps) apply (simp add:cap_notification_cap_lift_def) apply (subst cap_lift_notification_cap) apply (simp add: o_def
                    cap_get_tag_def
                    cap_notification_cap_def
                    mask_def word_size shift_over_ao_dists) apply (subst cap_lift_notification_cap, simp)? apply (simp add: o_def
                   cap_get_tag_def
                   cap_notification_cap_def
                   mask_def word_size shift_over_ao_dists multi_shift_simps
                   word_bw_assocs word_oa_dist word_and_max_simps ucast_def
                   sign_extend_def' nth_is_and_neq_0) done

(* Proof state trace *)
proof (prove)
goal (1 subgoal):
 1. \<forall>s. \<Gamma>\<turnstile> \<lbrace>s. cap_get_tag \<acute>cap = SCAST(32 signed \<rightarrow> 32) cap_notification_cap\<rbrace> Call cap_notification_cap_get_capNtfnBadge_'proc \<lbrace>\<acute>ret__unsigned = capNtfnBadge_CL (cap_notification_cap_lift \<^bsup>s\<^esup>cap)\<rbrace> proof (prove)
goal (1 subgoal):
 1. \<And>s. \<lbrace>s. cap_get_tag \<acute>cap = SCAST(32 signed \<rightarrow> 32) cap_notification_cap\<rbrace> \<subseteq> \<lbrace>\<forall>v. 0 \<le>s 4 \<and> 4 <s 0x20 \<and> 1 <s 2 \<and> 0 \<le>s 1 \<and> ((if False then 1 else 0) \<noteq> 0 \<longrightarrow> 0 \<le>s 0x1F \<and> 0x1F <s 0x20 \<and> ((if (cap_C.words_C \<acute>cap.[unat 1] && 0xFFFFFFF0 >> unat 4) && (1 << unat 0x1F) \<noteq> 0 then 1 else 0) \<noteq> 0 \<longrightarrow> (cap_C.words_C \<acute>cap.[unat 1] && 0xFFFFFFF0 >> unat 4) || SCAST(32 signed \<rightarrow> 32) 0 = capNtfnBadge_CL (cap_notification_cap_lift \<^bsup>s\<^esup>cap)) \<and> ((if (cap_C.words_C \<acute>cap.[unat 1] && 0xFFFFFFF0 >> unat 4) && (1 << unat 0x1F) \<noteq> 0 then 1 else 0) = 0 \<longrightarrow> cap_C.words_C \<acute>cap.[unat 1] && 0xFFFFFFF0 >> unat 4 = capNtfnBadge_CL (cap_notification_cap_lift \<^bsup>s\<^esup>cap))) \<and> ((if False then 1 else 0) = 0 \<longrightarrow> cap_C.words_C \<acute>cap.[unat 1] && 0xFFFFFFF0 >> unat 4 = capNtfnBadge_CL (cap_notification_cap_lift \<^bsup>s\<^esup>cap))\<rbrace> proof (prove)
goal (1 subgoal):
 1. \<And>x. cap_get_tag (cap_' x) = SCAST(32 signed \<rightarrow> 32) cap_notification_cap \<Longrightarrow> cap_C.words_C (cap_' x).[Suc 0] && 0xFFFFFFF0 >> 4 = capNtfnBadge_CL (cap_notification_cap_lift (cap_' x)) proof (prove)
goal (1 subgoal):
 1. \<And>x. cap_get_tag (cap_' x) = SCAST(32 signed \<rightarrow> 32) cap_notification_cap \<Longrightarrow> cap_C.words_C (cap_' x).[Suc 0] && 0xFFFFFFF0 >> 4 = capNtfnBadge_CL (case cap_lift (cap_' x) of Some (Cap_notification_cap rec) \<Rightarrow> rec) proof (prove)
goal (2 subgoals):
 1. \<And>x. cap_get_tag (cap_' x) = SCAST(32 signed \<rightarrow> 32) cap_notification_cap \<Longrightarrow> cap_get_tag (cap_' x) = SCAST(32 signed \<rightarrow> 32) cap_notification_cap
 2. \<And>x. cap_get_tag (cap_' x) = SCAST(32 signed \<rightarrow> 32) cap_notification_cap \<Longrightarrow> cap_C.words_C (cap_' x).[Suc 0] && 0xFFFFFFF0 >> 4 = capNtfnBadge_CL (case Some (Cap_notification_cap \<lparr>capNtfnBadge_CL = (cap_C.words_C (cap_' x).[1] >> 4) && mask 28, capNtfnCanReceive_CL = (cap_C.words_C (cap_' x).[1] >> 1) && mask 1, capNtfnCanSend_CL = (cap_C.words_C (cap_' x).[1] >> 0) && mask 1, capNtfnPtr_CL = (cap_C.words_C (cap_' x).[0] << 0) && ~~ mask 4\<rparr>) of Some (Cap_notification_cap rec) \<Rightarrow> rec) proof (prove)
goal (1 subgoal):
 1. \<And>x. cap_get_tag (cap_' x) = SCAST(32 signed \<rightarrow> 32) cap_notification_cap \<Longrightarrow> cap_C.words_C (cap_' x).[Suc 0] && 0xFFFFFFF0 >> 4 = capNtfnBadge_CL (case Some (Cap_notification_cap \<lparr>capNtfnBadge_CL = (cap_C.words_C (cap_' x).[1] >> 4) && mask 28, capNtfnCanReceive_CL = (cap_C.words_C (cap_' x).[1] >> 1) && mask 1, capNtfnCanSend_CL = (cap_C.words_C (cap_' x).[1] >> 0) && mask 1, capNtfnPtr_CL = (cap_C.words_C (cap_' x).[0] << 0) && ~~ mask 4\<rparr>) of Some (Cap_notification_cap rec) \<Rightarrow> rec) proof (prove)
goal (1 subgoal):
 1. \<And>x. cap_get_tag (cap_' x) = SCAST(32 signed \<rightarrow> 32) cap_notification_cap \<Longrightarrow> cap_C.words_C (cap_' x).[Suc 0] && 0xFFFFFFF0 >> 4 = capNtfnBadge_CL (case Some (Cap_notification_cap \<lparr>capNtfnBadge_CL = (cap_C.words_C (cap_' x).[1] >> 4) && mask 28, capNtfnCanReceive_CL = (cap_C.words_C (cap_' x).[1] >> 1) && mask 1, capNtfnCanSend_CL = (cap_C.words_C (cap_' x).[1] >> 0) && mask 1, capNtfnPtr_CL = (cap_C.words_C (cap_' x).[0] << 0) && ~~ mask 4\<rparr>) of Some (Cap_notification_cap rec) \<Rightarrow> rec) proof (prove)
goal:
No subgoals!