proposition: Lemma svfl_no_dangling_dst: forall from to v l g1 g2, graph_has_v g1 v -> raw_mark (vlabel g1 v) = false -> (raw_tag (vlabel g1 v) < NO_SCAN_TAG)%Z -> vgeneration v <> from -> copy_compatible g1 -> graph_has_gen g1 to -> from <> to -> scan_vertex_for_loop from to v l g1 g2 -> (forall i, In i l -> i < length (raw_fields (vlabel g1 v))) -> no_dangling_dst g1 -> no_dangling_dst g2.
proof: Proof. do 4 intro. induction l; intros; inversion H6; subst. 1: assumption. cut (no_dangling_dst g3). - intros. apply (IHl g3); auto. + eapply fr_graph_has_v; eauto. + erewrite <- fr_raw_mark; eauto. + erewrite <- fr_raw_tag; eauto. + eapply (fr_copy_compatible O from to); eauto. + erewrite <- fr_graph_has_gen; eauto. + intros. erewrite <- fr_raw_fields; eauto. apply H7. right; assumption. - eapply fr_O_no_dangling_dst; eauto. + simpl. intuition auto with *. rewrite Zlength_correct. apply inj_lt. apply H7. left; reflexivity. + simpl. constructor. 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