proposition: Lemma space_start_isptr_iff: forall (g: LGraph) (h: heap) i, graph_heap_compatible g h -> 0 <= i < Zlength (spaces h) -> graph_has_gen g (Z.to_nat i) <-> isptr (space_start (Znth i (spaces h))).
proof: Proof. intros. split; intros. - eapply space_start_isptr; eauto. - destruct (graph_has_gen_dec g (Z.to_nat i)). 1: assumption. exfalso. eapply space_start_isnull in n; eauto. rewrite n in H1. inversion H1. 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