proposition: Lemma fta_compatible_add: forall g rootpairs gi roots, rootpairs_compatible g rootpairs roots -> roots_graph_compatible roots g -> rootpairs_compatible (lgraph_add_new_gen g gi) rootpairs roots.
proof: Proof. intros. unfold rootpairs_compatible in *. simpl. rewrite <- H. clear H. apply map_ext_in. intros. destruct a; [destruct s|]; simpl; try reflexivity. apply ang_vertex_address_old. red in H0. rewrite Forall_forall in H0. apply H0. rewrite <- filter_sum_right_In_iff. 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