proposition: Lemma raw_fields_head_cons: forall rvb, exists r l, raw_fields rvb = r :: l /\ raw_fields_head rvb = r.
proof: Proof. intros. destruct rvb eqn:? . simpl. unfold raw_fields_head; simpl. destruct raw_fields0. - exfalso. clear Heqr. rewrite Zlength_nil in raw_fields_range0. lia. - exists r, raw_fields0. split; reflexivity. 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