proposition: Lemma update_update_rootpairs: forall rp v1 v2, (Zlength v1 >= Zlength rp)%Z -> (Zlength v2 >= Zlength rp)%Z -> update_rootpairs (update_rootpairs rp v1) v2 = update_rootpairs rp v2.
proof: Proof. induction rp as [ | [? ? ]]; destruct v1; destruct v2; simpl; intros; try list_solve. f_equal. apply IHrp; list_solve. 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