proposition: Lemma do_gen_gcc: forall g1 h1 roots1 g2 h2 roots2 i out, graph_heap_compatible g1 h1 -> roots_compatible g1 out roots1 -> outlier_compatible g1 out -> firstn_gen_clear g1 i -> graph_has_gen g1 (S i) -> heap_relation h1 h2 -> garbage_collect_condition g1 h1 -> do_generation_relation i (S i) roots1 roots2 g1 g2 -> garbage_collect_condition g2 h2.
proof: Proof. intros. destruct H5 as [? [? [? ?]]]. assert (gen_unmarked g1 (S i)) by (rewrite graph_gen_unmarked_iff in H5; apply H5). assert (no_dangling_dst g2). { eapply do_gen_no_dangling_dst; eauto. - apply graph_unmarked_copy_compatible; assumption. - apply H0. } split; [|split; [|split]]; auto. - eapply do_gen_graph_unmarked; eauto. - eapply do_gen_no_backward_edge; eauto. - eapply heap_relation_size_spec; eauto. 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