proposition: Lemma forward_loop_add_tail: forall from to depth l x g1 g2 g3 roots, forward_loop from to depth l g1 g2 -> forward_relation from to depth (forward_p2forward_t (inr x) roots g2) g2 g3 -> forward_loop from to depth (l +:: (inr x)) g1 g3.
proof: Proof. intros. revert x g1 g2 g3 H H0. induction l; intros. - simpl. inversion H. subst. apply fl_cons with g3. 2: constructor. apply H0. - inversion H. subst. clear H. simpl app. apply fl_cons with g4. 1: assumption. apply IHl with g2; 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