proposition: Lemma iter_up_acc: forall (S: ST.t) (acc: Acc ST.widen_order S) (S': ST.t), ST.ble S' S = false -> Acc ST.widen_order (ST.widen S S').
proof: Proof. intros. eapply Acc_inv; eauto. exists S'. auto. Defined.
imports: Coq(ZArith Psatz Bool String List FMaps) Coq(FunctionalExtensionality) CDF(Sequences IMP)