proposition: Lemma MSS_eq_unsigned: Int.unsigned (Int.shl (Int.repr 1) (Int.repr 29)) = Z.shiftl 1 29.
proof: Proof. rewrite Int.shl_mul_two_p. rewrite (Int.unsigned_repr 29) by (compute; split; discriminate). rewrite mul_repr. rewrite Zbits.Zshiftl_mul_two_p by lia. rewrite !Z.mul_1_l, Int.unsigned_repr; [lia | compute; split; intro S; discriminate]. Qed.
imports: Coq.ZArith.ZArith Coq.Program.Basics Coq.micromega.Lia compcert.lib.Integers compcert.common.Values VST.veric.base VST.veric.Clight_lemmas VST.veric.val_lemmas VST.veric.shares VST.msl.seplog VST.msl.shares VST.zlist.sublist VST.floyd.coqlib3 VST.floyd.functional_base VST.floyd.data_at_rec_lemmas VST.zlist.list_solver CertiGraph.lib.EquivDec_ext CertiGraph.lib.List_ext CertiGraph.graph.graph_model CertiGraph.graph.graph_gen