proposition: Lemma make_header_mark_iff: forall g v, make_header g v = 0 <-> raw_mark (vlabel g v) = true.
proof: Proof. intros. unfold make_header. destruct (raw_mark (vlabel g v)). tauto. split; intros. 2: inversion H. exfalso. destruct (raw_tag_range (vlabel g v)) as [? _]. assert (0 <= Z.shiftl (raw_color (vlabel g v)) 8). { rewrite Z.shiftl_nonneg. apply (proj1 (raw_color_range (vlabel g v))). } assert (Z.shiftl (Zlength (raw_fields (vlabel g v))) 10 <= 0) by lia. clear -H2. assert (0 <= Z.shiftl (Zlength (raw_fields (vlabel g v))) 10) by (rewrite Z.shiftl_nonneg; apply Zlength_nonneg). assert (Z.shiftl (Zlength (raw_fields (vlabel g v))) 10 = 0) by lia. clear -H0. rewrite Z.shiftl_eq_0_iff in H0 by lia. pose proof (proj1 (raw_fields_range (vlabel g v))). lia. 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