proposition: Lemma Int64_eq_false: forall x y : int64, Int64.eq x y = false -> x <> y.
proof: Proof. intros. destruct x, y. unfold Int64.eq in H. simpl in H. destruct (zeq intval intval0). 1: inversion H. intro. inversion H0. easy. 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