| adr0 = adr1, adr2 = adr, adr3 = adr5, adr4 = @(pstate0.lnum, maxino, ind.flashsize), err0 = err, err1 = err0, ginval = ∅, ginval0 = ∅, ginval1 = ∅, ginval2 = ∅, gstore = ∅, gstore0 = ∅, gstore1 = ∅, gstore2 = ∅, ind = indexnode(mkbrarray(BRANCH_SIZE), true, 0), istore = (∅)[n, indexblock([], [], 0)], istore0 = ∅, istore1 = ∅, maxino0 = maxino4, maxino1 = maxino4, nx = [], nx0 = [], pstate = readonly, pstate0 = index(n), syn0, inv(istore), inv((∅)[n, indexblock([], [], 0)]), indexnode(mkbrarray(BRANCH_SIZE), true, 0).flashsize ≤ LEB_SIZE, pstate.index? → pstate.lnum ∈ istore, pstate = unbuffered → syn, pstate0.index? ∨ pstate0.journal?, ¬ @(pstate0.lnum, maxino, ind.flashsize) ∈ istore ∧ err = ESUCCESS ∨ ⌊err⌋ ⊦ ⟪if err1 = ESUCCESS then apersistence_sync#(adr1, istore, istore0, ginval0, gstore0, gstore, nx, maxino1, ginval; pstate, syn; err1); if err1 = ESUCCESS then let ns = ∅ in apersistence_commit#(adr2, maxino4, syn; ns, istore, ginval0, gstore0, adr1, istore0, gstore, nx, maxino1, ginval; pstate, err1)⟫ ( ( err1 = ESUCCESS → syn ∧ (∃ ri, fi. btree-inv(null, adr1, istore, istore0, zh, ri, fi)) ∧ inv(gstore0 \ ginval0) ∧ inv(gstore) ∧ elems nx ∩ ginval0 = ∅ ∧ ¬ dups(nx) ∧ dom gstore ∪ elems nx = dom gstore0 ∪ ginval0 ∧ remove-refsize0(gstore) = gstore ∧ inv(istore) ∧ inv(istore0) ∧ istore0 ⊑ istore ∧ remove-refsize0(istore0) = istore0 ∧ (pstate.journal? → nx ≠ [] ∧ pstate.lnum = nx.last ∧ pstate.lnum ∈ gstore0) ∧ (pstate.index? → pstate.lnum ∈ istore)) ∧ (err1 = ESUCCESS ∨ ⌊err1⌋ ) ∧ (err1 = ESUCCESS → btree-inv(null, adr1, istore, istore0, zh, ∅, ∅) ∧ gstore0 = ∅ ∧ ginval0 = ∅ ∧ maxino1 = maxino4 ∧ nx = [] ∧ ginval = ∅)), err0 = ESUCCESS, pstate.journal? |
adr0 = adr1, adr2 = adr, adr3 = adr5, adr4 = @(pstate0.lnum, maxino, ind.flashsize), err0 = err, err1 = err0, ginval = ∅, ginval0 = ∅, ginval1 = ∅, ginval2 = ∅, gstore = ∅, gstore0 = ∅, gstore1 = ∅, gstore2 = ∅, ind = indexnode(mkbrarray(BRANCH_SIZE), true, 0), istore = (∅)[n, indexblock([], [], 0)], istore0 = ∅, istore1 = ∅, maxino0 = maxino4, maxino1 = maxino4, nx = [], nx0 = [], pstate = readonly, pstate0 = index(n), syn0, inv((∅)[n, indexblock([], [], 0)]), inv(istore), indexnode(mkbrarray(BRANCH_SIZE), true, 0).flashsize ≤ LEB_SIZE, pstate = unbuffered → syn, pstate.index? → pstate.lnum ∈ istore, ¬ @(pstate0.lnum, maxino, ind.flashsize) ∈ istore ∧ err = ESUCCESS ∨ ⌊err⌋ , pstate0.index? ∨ pstate0.journal? ⊦ ⟪skip; if err1 = ESUCCESS then let ns = ∅ in apersistence_commit#(adr2, maxino4, syn; ns, istore, ginval0, gstore0, adr1, istore0, gstore, nx, maxino1, ginval; pstate, err1)⟫ ( ( err1 = ESUCCESS → syn ∧ (∃ ri, fi. btree-inv(null, adr1, istore, istore0, zh, ri, fi)) ∧ inv(gstore0 \ ginval0) ∧ inv(gstore) ∧ elems nx ∩ ginval0 = ∅ ∧ ¬ dups(nx) ∧ dom gstore ∪ elems nx = dom gstore0 ∪ ginval0 ∧ remove-refsize0(gstore) = gstore ∧ inv(istore) ∧ inv(istore0) ∧ istore0 ⊑ istore ∧ remove-refsize0(istore0) = istore0 ∧ (pstate.journal? → nx ≠ [] ∧ pstate.lnum = nx.last ∧ pstate.lnum ∈ gstore0) ∧ (pstate.index? → pstate.lnum ∈ istore)) ∧ (err1 = ESUCCESS ∨ ⌊err1⌋ ) ∧ (err1 = ESUCCESS → btree-inv(null, adr1, istore, istore0, zh, ∅, ∅) ∧ gstore0 = ∅ ∧ ginval0 = ∅ ∧ maxino1 = maxino4 ∧ nx = [] ∧ ginval = ∅)), err0 = ESUCCESS, pstate.journal?