proposition: Lemma firstn_gen_clear_reset: forall g i, firstn_gen_clear g i -> firstn_gen_clear (reset_graph i g) (S i).
proof: Proof. intros. unfold firstn_gen_clear, graph_gen_clear in *. intros. assert (i0 < i \/ i0 = i)%nat by lia. destruct H1. - rewrite reset_nth_gen_diff by lia. apply H; assumption. - subst i0. unfold nth_gen. simpl. rewrite reset_nth_gen_info_same. simpl. reflexivity. 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