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

# lpt1 = # avol, # lpt0 = # avol, # buf0 = gndx0.flashsize, # gndx0 = # lax0, (elems nx ∪ dom gstore0) ++ n = dom gstore1 ∪ ginval, lpt1[n] = mklp(m, # buf1, LP_GROUP_NODES, m3), gstore1[n] = groupblock(gndx1, lax1, m), avol[n] = mapped(buf1), ax = ([]).to-adr(pstate.lnum), err0 = err1, gstore = gstore1[pstate.lnum, gstore1[pstate.lnum].gndlist:= gstore1[pstate.lnum].gndlist] [pstate.lnum, gstore1[pstate.lnum, gstore1[pstate.lnum].gndlist:= gstore1[pstate.lnum].gndlist][pstate.lnum] .ladrlist:= gstore1[pstate.lnum, gstore1[pstate.lnum].gndlist:= gstore1[pstate.lnum].gndlist][pstate.lnum].ladrlist ], keyset(gch) = gc-heap(lpt1, nx + n '), pstate = journal(n), remove-refsize0(istore1) = istore1, remove-refsize0(gstore0) = gstore0, ginval ∩ elems nx = ∅, n < # avol, ginval < # avol, abs-gstore(avol, lpt1, gstore1, ginval), abs-istore(avol, lpt1, istore2), abs-nodes(buf0, # buf1, gndx0, lax0, false), awbuf-inv(avol, buffered(n)), bin-heap-inv(gch, lpt1), buf-ro-rw-mode(false, buffered(n), lpt1, avol), bufs-log-only(buffered(n), nx + n ', lpt1), flash-lpt-cons(lpt0, istore1, gstore0), freelist-cons(lpt1, freelist), inv(istore1), inv(istore2), inv(gstore0), inv(gstore1 \ ginval), inv(groupblock(gndx1, lax1, m)), log-group-block(nx + n ', lpt1), lpt-free-unref(lpt1), lpt-free-unref(lpt0), lpt-leb-size(lpt1), lpt-leb-size(lpt0), lpt-ram-flash(lpt1, lpt0, nx + n '), n ∈ gstore1, pstate.lnum ∈ gstore1[pstate.lnum, gstore1[pstate.lnum].gndlist:= gstore1[pstate.lnum].gndlist], pstate.lnum ∈ gstore1, # buf1 + gndx0.flashsize ≤ LEB_SIZE, istore1 ⊑ istore2, ⌊err1⌋ , isbuf1 → synced(avol), pstate.index? ∨ pstate.journal? ⊦ ⟨if err0 ≠ ESUCCESS then ax := ?, pstate := readonly; isbuf1 := ?⟩ ( abs-gstore(avol, lpt1[n, mklp(m, LEB_SIZE, LP_GROUP_NODES, m3)], gstore, ginval) ∧ (isbuf1 → synced(avol)) ∧ pstate = readonly ∧ lax0.to-adr(n) = ax ∧ err1 = err0), gndx0 = [], lax0 = [], dups(nx), n ∈ nx, n ∈ ginval

Heuristic symbolic execution applied rule if positive right

And obtained the following new goals

Proof step 293:
# gndx0 = # lax0, # buf0 = gndx0.flashsize, # lpt0 = # avol, # lpt1 = # avol, (elems nx ∪ dom gstore0) ++ n = dom gstore1 ∪ ginval, avol[n] = mapped(buf1), gstore1[n] = groupblock(gndx1, lax1, m), lpt1[n] = mklp(m, # buf1, LP_GROUP_NODES, m3), ax = ([]).to-adr(pstate.lnum), err0 = err1, gstore = gstore1[pstate.lnum, gstore1[pstate.lnum].gndlist:= gstore1[pstate.lnum].gndlist] [pstate.lnum, gstore1[pstate.lnum, gstore1[pstate.lnum].gndlist:= gstore1[pstate.lnum].gndlist][pstate.lnum] .ladrlist:= gstore1[pstate.lnum, gstore1[pstate.lnum].gndlist:= gstore1[pstate.lnum].gndlist][pstate.lnum].ladrlist ], keyset(gch) = gc-heap(lpt1, nx + n '), pstate = journal(n), remove-refsize0(gstore0) = gstore0, remove-refsize0(istore1) = istore1, ginval ∩ elems nx = ∅, ginval < # avol, n < # avol, abs-gstore(avol, lpt1, gstore1, ginval), abs-istore(avol, lpt1, istore2), abs-nodes(buf0, # buf1, gndx0, lax0, false), awbuf-inv(avol, buffered(n)), bin-heap-inv(gch, lpt1), buf-ro-rw-mode(false, buffered(n), lpt1, avol), bufs-log-only(buffered(n), nx + n ', lpt1), flash-lpt-cons(lpt0, istore1, gstore0), freelist-cons(lpt1, freelist), inv(groupblock(gndx1, lax1, m)), inv(gstore1 \ ginval), inv(gstore0), inv(istore2), inv(istore1), log-group-block(nx + n ', lpt1), lpt-free-unref(lpt0), lpt-free-unref(lpt1), lpt-leb-size(lpt0), lpt-leb-size(lpt1), lpt-ram-flash(lpt1, lpt0, nx + n '), pstate.lnum ∈ gstore1, pstate.lnum ∈ gstore1[pstate.lnum, gstore1[pstate.lnum].gndlist:= gstore1[pstate.lnum].gndlist], n ∈ gstore1, # buf1 + gndx0.flashsize ≤ LEB_SIZE, istore1 ⊑ istore2, ⌊err1⌋ , isbuf1 → synced(avol), pstate.index? ∨ pstate.journal? ⊦ ⟨ax := ?, pstate := readonly; isbuf1 := ?⟩ ( abs-gstore(avol, lpt1[n, mklp(m, LEB_SIZE, LP_GROUP_NODES, m3)], gstore, ginval) ∧ (isbuf1 → synced(avol)) ∧ pstate = readonly ∧ lax0.to-adr(n) = ax ∧ err1 = err0), gndx0 = [], lax0 = [], dups(nx), n ∈ ginval, n ∈ nx

Rule argument

pos: right 1

Additional information

Used simplifier rules: ⊦ ⌊err⌋ → err ≠ ESUCCESS; (s)