proposition: Lemma do_gen_roots_graph_compatible: forall g1 g2 roots1 roots2 from to, graph_has_gen g1 to -> copy_compatible g1 -> gen_unmarked g1 to -> from <> to -> roots_graph_compatible roots1 g1 -> do_generation_relation from to roots1 roots2 g1 g2 -> roots_graph_compatible roots2 g2.
proof: Proof. pose (H3 := True). intros. destruct H5 as [g3 [g4 [? [? ?]]]]. subst g2. apply rgc_reset. - destruct H6 as [n [? ?]]. eapply svwl_roots_graph_compatible in H6; eauto. + rewrite <- frr_graph_has_gen; eauto. + eapply frr_copy_compatible; eauto. + eapply frr_gen_unmarked; eauto. + eapply frr_roots_graph_compatible; eauto. - eapply frr_not_pointing; eauto. eapply frr_Zlength_roots; eauto. Qed.
imports: Coq.ZArith.ZArith Coq.Program.Basics 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 CertiGraph.lib.Coqlib CertiGraph.lib.EquivDec_ext CertiGraph.lib.List_ext CertiGraph.graph.graph_model CertiGraph.graph.graph_gen CertiGraph.graph.path_lemmas CertiGraph.graph.subgraph2 CertiGraph.graph.graph_relation CertiGraph.graph.graph_isomorphism CertiGraph.graph.reachable_ind CertiGraph.CertiGC.GCGraph