[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 16 from proof inv-commit (previous step)

zh[rp] = mkznode(r, zbrar, boolvar, true, m), pstate = unbuffered, remove-refsize0(istore1) = istore1, remove-refsize0(gstore1) = gstore1, elems nx ∩ ginval4 = ∅, dom remove-refsize0(gstore2) ∩ ginval4 = ∅, dom gstore1 ∪ elems nx = dom gstore2 ∪ ginval4, btree-inv(rp, adr3, istore2, istore1, zh, ri, fi), inv(istore1), inv(istore2), inv(gstore1), inv(gstore2 \ ginval4), rp ∈ zh, istore1 ⊑ istore2, ¬ dups(nx) ⊦ [apersistence_allocate_ind#(adr3, istore1, ginval4, gstore2, gstore1, nx, maxino0, ginval, true; istore2, pstate; err)] ( inv(istore2) ∧ istore1 ⊑ istore2 ∧ (pstate.journal? → nx ≠ [] ∧ pstate.lnum = nx.last ∧ pstate.lnum ∈ gstore2) ∧ (pstate.index? → pstate.lnum ∈ istore2) → ⟪syn0 := true; adr0 := adr3; adr := adr3; if err = ESUCCESS then btree_commit_rec#(rp, adr0, istore1, ginval4, gstore2, gstore1, nx, maxino0, ginval; adr, err, zh, istore2, pstate, syn0); syn := false; if err = ESUCCESS then {syn := true; apersistence_sync#(adr0, istore2, istore1, ginval4, gstore2, gstore1, nx, maxino0, ginval; pstate, syn0; err)}; if err = ESUCCESS then apersistence_commit# (adr, maxino1, syn0; ginval1, adr0, istore2, istore1, ginval4, gstore2, gstore1, nx, maxino0, ginval, pstate; err); if err = ESUCCESS then adr3 := adr else if syn then {zh[rp].dirty := true; let maxino = 0 in {apersistence_get_iblock_refsize# (adr.lnum, adr0, istore2, istore1, ginval4, gstore2, gstore1, nx, maxino0, ginval, pstate, syn0; ; maxino); apersistence_set_iblock_refsize# (adr.lnum, maxino - adr.size, adr0, istore1, ginval4, gstore2, gstore1, nx, maxino0, ginval, pstate, syn0; istore2)}}⟫ ( (∃ ri, fi. btree-inv(rp, adr0, istore2, istore1, zh, ri, fi)) ∧ inv(gstore2 \ ginval4) ∧ inv(gstore1) ∧ elems nx ∩ ginval4 = ∅ ∧ ¬ dups(nx) ∧ dom gstore1 ∪ elems nx = dom gstore2 ∪ ginval4 ∧ remove-refsize0(gstore1) = gstore1 ∧ inv(istore2) ∧ inv(istore1) ∧ istore1 ⊑ istore2 ∧ remove-refsize0(istore1) = istore1 ∧ (pstate.journal? → nx ≠ [] ∧ pstate.lnum = nx.last ∧ pstate.lnum ∈ gstore2) ∧ (pstate.index? → pstate.lnum ∈ istore2) ∧ (pstate = unbuffered → syn0)))

User applied rule call right

And obtained the following new goals

Proof step 17:
syn ↔ true, zh[rp] = mkznode(r, zbrar, boolvar, true, m), adr = adr3, ginval0 = ginval4, gstore = gstore1, gstore0 = gstore2, istore = istore2, istore0 = istore1, maxino = maxino0, pstate = unbuffered, remove-refsize0(gstore1) = gstore1, remove-refsize0(istore1) = istore1, dom remove-refsize0(gstore2) ∩ ginval4 = ∅, elems nx ∩ ginval4 = ∅, dom gstore1 ∪ elems nx = dom gstore2 ∪ ginval4, btree-inv(rp, adr3, istore2, istore1, zh, ri, fi), inv(gstore2 \ ginval4), inv(gstore1), inv(istore2), inv(istore1), rp ∈ zh, istore1 ⊑ istore2 ⊦ [if syn then {fail_or_success#(; ; err); if err = ESUCCESS then choose n with ¬ n ∈ istore in istore[n] := indexblock([], [], 0), pstate := index(n)} else abort] ( inv(istore) ∧ istore1 ⊑ istore ∧ (pstate.journal? → nx ≠ [] ∧ pstate.lnum = nx.last ∧ pstate.lnum ∈ gstore2) ∧ (pstate.index? → pstate.lnum ∈ istore) → ⟪syn0 := true; adr0 := adr3; adr := adr3; istore2 := istore; if err = ESUCCESS then btree_commit_rec#(rp, adr0, istore1, ginval4, gstore2, gstore1, nx, maxino0, ginval; adr, err, zh, istore2, pstate, syn0); syn := false; if err = ESUCCESS then {syn := true; apersistence_sync#(adr0, istore2, istore1, ginval4, gstore2, gstore1, nx, maxino0, ginval; pstate, syn0; err)}; if err = ESUCCESS then apersistence_commit# (adr, maxino1, syn0; ginval1, adr0, istore2, istore1, ginval4, gstore2, gstore1, nx, maxino0, ginval, pstate; err); if err = ESUCCESS then adr3 := adr else if syn then {zh[rp].dirty := true; let maxino = 0 in {apersistence_get_iblock_refsize# (adr.lnum, adr0, istore2, istore1, ginval4, gstore2, gstore1, nx, maxino0, ginval, pstate, syn0; ; maxino); apersistence_set_iblock_refsize# (adr.lnum, maxino - adr.size, adr0, istore1, ginval4, gstore2, gstore1, nx, maxino0, ginval, pstate, syn0; istore2)}}⟫ ( (∃ ri, fi. btree-inv(rp, adr0, istore2, istore1, zh, ri, fi)) ∧ inv(gstore2 \ ginval4) ∧ inv(gstore1) ∧ elems nx ∩ ginval4 = ∅ ∧ ¬ dups(nx) ∧ dom gstore1 ∪ elems nx = dom gstore2 ∪ ginval4 ∧ remove-refsize0(gstore1) = gstore1 ∧ inv(istore2) ∧ inv(istore1) ∧ istore1 ⊑ istore2 ∧ remove-refsize0(istore1) = istore1 ∧ (pstate.journal? → nx ≠ [] ∧ pstate.lnum = nx.last ∧ pstate.lnum ∈ gstore2) ∧ (pstate.index? → pstate.lnum ∈ istore2) ∧ (pstate = unbuffered → syn0))), dups(nx)

Rule argument

pos: right 1

Additional information

Used simplifier rules: apersistence_allocate_ind# (ROOTADR, ISTORE0, GINVAL, GSTORE, GSTORE0, NL, MAXINO, OS, PSYNCED ; ISTORE, PSTATE ; ERR ) {if PSYNCED then {fail_or_success#(; ; ERR); if ERR = ESUCCESS then choose N with ¬ N ∈ ISTORE in ISTORE[N] := indexblock([], [], 0), PSTATE := index(N)} else abort };