proposition: Lemma fta_compatible_reset: forall g rootpairs r gen, rootpairs_compatible g rootpairs r -> rootpairs_compatible (reset_graph gen g) rootpairs r.
proof: Proof. intros. unfold rootpairs_compatible in *. rewrite <- H. clear H. induction r; simpl; f_equal; auto. clear. destruct a; simpl; auto. apply vertex_address_reset. 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