proposition: Lemma svfl_no_edge2from: forall from to v 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 -> no_dangling_dst g1 -> from <> to -> graph_has_gen g1 to -> scan_vertex_for_loop from to v (nat_inc_list (length (raw_fields (vlabel g1 v)))) g1 g2 -> forall e, In e (get_edges g2 v) -> vgeneration (dst g2 e) <> from.
proof: Proof. intros ? ? ? ? ? ? ? SCAN; intros. unfold get_edges in H7. rewrite <- filter_sum_right_In_iff in H7. apply In_Znth in H7. destruct H7 as [i [? ?]]. rewrite <- (Z2Nat.id i) in H8 by lia. eapply svfl_dst_changed; eauto. - intros. rewrite nat_inc_list_In_iff in H9. assumption. - apply nat_inc_list_NoDup. - rewrite nat_inc_list_In_iff. rewrite make_fields_eq_length in H7. erewrite svfl_raw_fields; eauto. rewrite <- ZtoNat_Zlength. apply Z2Nat.inj_lt; lia. 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