[Imprint][Data Privacy Statement][E-Mail]

View long theorem info. View the proof. Back to main index. View the specification. View theorem base summary, View theorem base listing, the used properties by spec, the dependency list, the symbol table,

Proof step 29 from proof refine-add-gnds (previous step)

gstore1 = gstore0[maxino, groupblock(gndlist0 + gndlist, lax0 + lax1, m, m0 + gndlist.flashsize, m1, false)], gstore0[maxino] = groupblock(gndlist0, lax0, m, m0, m1, false), remove-refsize0(istore0) = istore0, remove-refsize0(gstore2) = gstore2, dom gstore2 ∪ elems nx0 = dom gstore0 ∪ ginval0, elems nx0 ∩ ginval0 = ∅, # lax1 = # gndlist, m ≤ # gndlist0 + # gndlist, m ≤ n, n ≤ # gndlist0 + # gndlist, btree-inv (rp, adr, gstore0[maxino, groupblock(gndlist0 + gndlist, lax0 + lax1, n, m0 + gndlist.flashsize, m1, false)] \ ginval0, istore, istore0, zh, ri1, fi3, ld2), inv(groupblock(gndlist0 + gndlist, lax0 + lax1, n, m0 + gndlist.flashsize, m1, false)), flushed(gstore0[maxino, groupblock(gndlist0 + gndlist, lax0 + lax1, n, m0 + gndlist.flashsize, m1, false)] \ (ginval0 ∪ elems nx0)), gstore2 \ ginval0 lpt= gstore0 \ elems nx0, inv(groupblock(gndlist0, lax0, m, m0, m1, false)), maxino ∈ nx0, btree-inv(rp, adr, gstore0 \ ginval0, istore, istore0, zh, ri0, fi2, ld1), maxino ∈ gstore0, istore0 ⊑ istore, flushed(istore0), inv(istore0), inv(istore), btree-inv(rp, adr, gstore0 \ ginval0, istore, istore0, zh, ri, fi1, ld0), ri-inj(fi0), ri-inj(fi), flushed(gstore0 \ (ginval0 ∪ elems nx0)), inv(gstore2), inv(gstore0 \ ginval0), btree-inv(rp, adr, gstore0 \ ginval0, istore, istore0, zh, fi, fi0, ld), m0 + gndlist.flashsize ≤ LEB_SIZE, inv-flashsize(gndlist, lax1), ¬ maxino ∈ ginval0, ¬ dups(nx0), ¬ dups(lax1) ⊦ (⌊ESUCCESS⌋ ∨ ESUCCESS = ESUCCESS) ∧ ¬ dups(lax0 + lax1) ∧ # lax1 ≤ # gndlist ∧ inv-flashsize(prefixn(# lax1, gndlist), lax1) ∧ (ESUCCESS = ESUCCESS ↔ # lax1 = # gndlist) ∧ ⟨ax := lax1.to-adr(maxino), err := ESUCCESS; gstore0[maxino].gndlist := gstore0[maxino].gndlist + prefixn(# lax1, gndlist); gstore0[maxino].ladrlist := gstore0[maxino].ladrlist + lax1; if err = ESUCCESS then gstore0[maxino].size := gstore0[maxino].size + gndlist.flashsize else {gstore0[maxino].size := LEB_SIZE; gstore0[maxino].failed := true; ax := ?}⟩ ⟨choose n with gstore0[maxino].flushindex ≤ n ∧ n ≤ # gstore0[maxino].gndlist in gstore0[maxino].flushindex := n⟩ ( gstore0 = gstore1[maxino, gstore1[maxino].flushindex:= n] ∧ btree-inv(rp, adr, gstore1[maxino, gstore1[maxino].flushindex:= n] \ ginval0, istore, istore0, zh, fi, fi0, ld) ∧ lax1.to-adr(maxino) = ax ∧ ESUCCESS = err)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Proof step 30:
# lax1 = # gndlist, elems nx0 ∩ ginval0 = ∅, dom gstore2 ∪ elems nx0 = dom gstore0 ∪ ginval0, remove-refsize0(gstore2) = gstore2, remove-refsize0(istore0) = istore0, gstore0[maxino] = groupblock(gndlist0, lax0, m, m0, m1, false), gstore1 = gstore0[maxino, groupblock(gndlist0 + gndlist, lax0 + lax1, m, m0 + gndlist.flashsize, m1, false)], inv-flashsize(gndlist, lax1), m0 + gndlist.flashsize ≤ LEB_SIZE, btree-inv(rp, adr, gstore0 \ ginval0, istore, istore0, zh, fi, fi0, ld), inv(gstore0 \ ginval0), inv(gstore2), flushed(gstore0 \ (ginval0 ∪ elems nx0)), ri-inj(fi), ri-inj(fi0), btree-inv(rp, adr, gstore0 \ ginval0, istore, istore0, zh, ri, fi1, ld0), inv(istore), inv(istore0), flushed(istore0), istore0 ⊑ istore, maxino ∈ gstore0, btree-inv(rp, adr, gstore0 \ ginval0, istore, istore0, zh, ri0, fi2, ld1), maxino ∈ nx0, inv(groupblock(gndlist0, lax0, m, m0, m1, false)), gstore2 \ ginval0 lpt= gstore0 \ elems nx0, flushed(gstore0[maxino, groupblock(gndlist0 + gndlist, lax0 + lax1, n, m0 + gndlist.flashsize, m1, false)] \ (ginval0 ∪ elems nx0)), inv(groupblock(gndlist0 + gndlist, lax0 + lax1, n, m0 + gndlist.flashsize, m1, false)), btree-inv (rp, adr, gstore0[maxino, groupblock(gndlist0 + gndlist, lax0 + lax1, n, m0 + gndlist.flashsize, m1, false)] \ ginval0, istore, istore0, zh, ri1, fi3, ld2), n ≤ # gndlist0 + # gndlist, m ≤ n, m ≤ # gndlist0 + # gndlist, ¬ dups(lax1), ¬ dups(nx0), ¬ maxino ∈ ginval0 ⊦ ⟨ax := lax1.to-adr(maxino), err := ESUCCESS⟩ ⟨gstore0[maxino].gndlist := gstore0[maxino].gndlist + gndlist; gstore0[maxino].ladrlist := gstore0[maxino].ladrlist + lax1; if err = ESUCCESS then gstore0[maxino].size := gstore0[maxino].size + gndlist.flashsize else {gstore0[maxino].size := LEB_SIZE; gstore0[maxino].failed := true; ax := ?}⟩ ⟨choose n with gstore0[maxino].flushindex ≤ n ∧ n ≤ # gstore0[maxino].gndlist in gstore0[maxino].flushindex := n⟩ ( gstore0 = gstore1[maxino, gstore1[maxino].flushindex:= n] ∧ btree-inv(rp, adr, gstore1[maxino, gstore1[maxino].flushindex:= n] \ ginval0, istore, istore0, zh, fi, fi0, ld) ∧ lax1.to-adr(maxino) = ax ∧ ESUCCESS = err)

Rule argument

Additional information

Used simplifier rules: prefixn-full: ⊦ prefixn(# gndlist, gndlist) = gndlist; from specification list-prefixn[group-store]%ler: ⊦ m ≤ m; from specification nat%prefixn-fulln: # gndlist ≤ m ⊦ prefixn(m, gndlist) = gndlist; from specification list-prefixn[group-store]%irreflexivity: ⊦ ¬ n < n; from specification oelem[nat-set]%lels-01: ⊦ ¬ m ≤ n ↔ n < m; from specification nat%inv-nodups: ⊦ inv(groupblock(gndlist, lax, m0, m1, m2, boolvar)) → ¬ dups(lax); from specification ablock-store-inv[group-store]%esuccess: ⊦ ¬ ⌊ESUCCESS⌋ ; from specification error-class