[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 61 from proof refine-add-gnds (previous step)

gstore1 = gstore[maxino, groupblock(gndlist0 + prefixn(# lax1, gndlist), lax0 + lax1, m, LEB_SIZE, m1, true)], gstore[maxino] = groupblock(gndlist0, lax0, m, m0, m1, false), remove-refsize0(istore0) = istore0, remove-refsize0(gstore2) = gstore2, dom gstore2 ∪ elems nx0 = dom gstore ∪ ginval0, elems nx0 ∩ ginval0 = ∅, gndlist ≠ [], # lax1 ≠ # gndlist, m ≤ # gndlist0 + # lax1, m ≤ n, n ≤ # gndlist0 + # lax1, btree-inv (rp, adr, gstore[maxino, groupblock(gndlist0 + prefixn(# lax1, gndlist), lax0 + lax1, n, LEB_SIZE, m1, true)] \ ginval0, istore, istore0, zh, ri1, fi3, ld2), inv(groupblock(gndlist0 + prefixn(# lax1, gndlist), lax0 + lax1, n, LEB_SIZE, m1, true)), flushed(gstore[maxino, groupblock(gndlist0 + prefixn(# lax1, gndlist), lax0 + lax1, n, LEB_SIZE, m1, true)] \ (ginval0 ∪ elems nx0)), gstore2 \ ginval0 lpt= gstore \ elems nx0, ⌊err1⌋ , inv(groupblock(gndlist0, lax0, m, m0, m1, false)), maxino ∈ nx0, btree-inv(rp, adr, gstore \ ginval0, istore, istore0, zh, ri0, fi2, ld1), maxino ∈ gstore, istore0 ⊑ istore, flushed(istore0), inv(istore0), inv(istore), btree-inv(rp, adr, gstore \ ginval0, istore, istore0, zh, ri, fi1, ld0), ri-inj(fi0), ri-inj(fi), flushed(gstore \ (ginval0 ∪ elems nx0)), inv(gstore2), inv(gstore \ ginval0), btree-inv(rp, adr, gstore \ ginval0, istore, istore0, zh, fi, fi0, ld), m0 + gndlist.flashsize ≤ LEB_SIZE, # lax1 < # gndlist, inv-flashsize(prefixn(# lax1, gndlist), lax1), ¬ maxino ∈ ginval0, ¬ dups(nx0), ¬ dups(lax1), ax = lax1.to-adr(maxino), err = err1, gstore3 = gstore[maxino, gstore[maxino].gndlist:= (gstore[maxino].gndlist + prefixn(# lax1, gndlist))] [maxino, gstore[maxino, gstore[maxino].gndlist:= (gstore[maxino].gndlist + prefixn(# lax1, gndlist))][maxino] .ladrlist:= (gstore[maxino, gstore[maxino].gndlist:= (gstore[maxino].gndlist + prefixn(# lax1, gndlist))][maxino].ladrlist + lax1) ], gstore0 = gstore3[maxino, gstore3[maxino].size:= LEB_SIZE][maxino, gstore3[maxino, gstore3[maxino].size:= LEB_SIZE][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) ∧ ax2 = ax ∧ err1 = err)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Proof step 62:
elems nx0 ∩ ginval0 = ∅, dom gstore2 ∪ elems nx0 = dom gstore ∪ ginval0, remove-refsize0(gstore2) = gstore2, remove-refsize0(istore0) = istore0, gstore[maxino] = groupblock(gndlist0, lax0, m, m0, m1, false), gstore1 = gstore[maxino, groupblock(gndlist0 + prefixn(# lax1, gndlist), lax0 + lax1, m, LEB_SIZE, m1, true)], gstore0 = gstore[maxino, groupblock(gndlist0 + prefixn(# lax1, gndlist), lax0 + lax1, m, LEB_SIZE, m1, true)], # lax1 ≠ # gndlist, gndlist ≠ [], maxino ∈ gstore, inv-flashsize(prefixn(# lax1, gndlist), lax1), # lax1 < # gndlist, m0 + gndlist.flashsize ≤ LEB_SIZE, btree-inv(rp, adr, gstore \ ginval0, istore, istore0, zh, fi, fi0, ld), inv(gstore \ ginval0), inv(gstore2), flushed(gstore \ (ginval0 ∪ elems nx0)), ri-inj(fi), ri-inj(fi0), btree-inv(rp, adr, gstore \ ginval0, istore, istore0, zh, ri, fi1, ld0), inv(istore), inv(istore0), flushed(istore0), istore0 ⊑ istore, btree-inv(rp, adr, gstore \ ginval0, istore, istore0, zh, ri0, fi2, ld1), maxino ∈ nx0, inv(groupblock(gndlist0, lax0, m, m0, m1, false)), ⌊err1⌋ , gstore2 \ ginval0 lpt= gstore \ elems nx0, flushed(gstore[maxino, groupblock(gndlist0 + prefixn(# lax1, gndlist), lax0 + lax1, n, LEB_SIZE, m1, true)] \ (ginval0 ∪ elems nx0)), inv(groupblock(gndlist0 + prefixn(# lax1, gndlist), lax0 + lax1, n, LEB_SIZE, m1, true)), btree-inv (rp, adr, gstore[maxino, groupblock(gndlist0 + prefixn(# lax1, gndlist), lax0 + lax1, n, LEB_SIZE, m1, true)] \ ginval0, istore, istore0, zh, ri1, fi3, ld2), n ≤ # gndlist0 + # lax1, m ≤ n, m ≤ # gndlist0 + # lax1, ¬ dups(lax1), ¬ dups(nx0), ¬ maxino ∈ ginval0 ⊦ ∃ 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) ∧ ax2 = ax)

Rule argument

Additional information

Used simplifier rules: upd-11: ⊦ groupblock(gndlist, lax, m, m0, m1, boolvar).failed:= boolvar0 = groupblock(gndlist, lax, m, m0, m1, boolvar0); from specification ablock[group-store]%upd-07: ⊦ groupblock(gndlist, lax, m, m0, m1, boolvar).size:= m3 = groupblock(gndlist, lax, m, m3, m1, boolvar); from specification ablock[group-store]%upd-05: ⊦ groupblock(gndlist, lax, m, m0, m1, boolvar).ladrlist:= lax0 = groupblock(gndlist, lax0, m, m0, m1, boolvar); from specification ablock[group-store]%sel-05: ⊦ groupblock(gndlist, lax, m, m0, m1, boolvar).ladrlist = lax; from specification ablock[group-store]%upd-04: ⊦ groupblock(gndlist, lax, m, m0, m1, boolvar).gndlist:= gndlist0 = groupblock(gndlist0, lax, m, m0, m1, boolvar); from specification ablock[group-store]%sel-04: ⊦ groupblock(gndlist, lax, m, m0, m1, boolvar).gndlist = gndlist; from specification ablock[group-store]%fwd-in-log-in-gstore: ⊦ n ∈ nx ∧ ginval ∩ elems nx = ∅ ∧ dom gstore0 ∪ elems nx = dom gstore ∪ ginval → n ∈ gstore; (forward) from specification apersistence-base%unc: ⊦ ns ∪ ns0 = ns0 ∪ ns; from specification set-union[nat-set]%una: ⊦ (ns ∪ ns0) ∪ ns1 = ns ∪ ns0 ∪ ns1; from specification set-union[nat-set]%int-c: ⊦ ns ∩ ns0 = ns0 ∩ ns; from specification set-union[nat-set]%int-a: ⊦ (ns ∩ ns0) ∩ ns1 = ns ∩ ns0 ∩ ns1; from specification set-union[nat-set]%insins: ⊦ gstore[n, gblock][n, gblock0] = gstore[n, gblock0]; from specification store[group-store-ablock-store-nat-store]%updsel-28: ⊦ (gblock.gndlist:= gndlist).ladrlist = gblock.ladrlist; from specification ablock[group-store]%At-same: ⊦ gstore[n, gblock][n] = gblock; from specification store[group-store-ablock-store-nat-store]