proposition: Lemma gcc_add: forall g h gi sp i (Hs: 0 <= i < MAX_SPACES), number_of_vertices gi = O -> total_space sp = nth_gen_size (Z.to_nat i) -> garbage_collect_condition g h -> garbage_collect_condition (lgraph_add_new_gen g gi) (add_new_space h sp i Hs).
proof: Proof. intros. destruct H1 as [? [? [? ?]]]. split; [|split; [|split]]. - apply graph_unmarked_add; assumption. - apply no_backward_edge_add; assumption. - apply no_dangling_dst_add; assumption. - apply ti_size_spec_add; assumption. 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