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

istore = (∅)[n, indexblock(indexnode(mkbrarray(BRANCH_SIZE), true, 0) ', @(maxino, indexnode(mkbrarray(BRANCH_SIZE), true, 0).flashsize) ', 0)], inv((∅)[n, indexblock([], [], 0)]), inv((∅)[n, indexblock(indexnode(mkbrarray(BRANCH_SIZE), true, 0) ', @(maxino, indexnode(mkbrarray(BRANCH_SIZE), true, 0).flashsize) ', 0)]), indexnode(mkbrarray(BRANCH_SIZE), true, 0).flashsize ≤ LEB_SIZE ⊦ [apersistence_set_iblock_refsize# (index(n).lnum, indexnode(mkbrarray(BRANCH_SIZE), true, 0).flashsize, adr1, ∅, ∅, ∅, ∅, [], maxino4, ∅, index(n), syn; istore)] ( inv(istore) ∧ n ∈ istore → ⟪pstate := index(n); nx := []; maxino1 := maxino4; istore0 := ∅; gstore0 := ∅; gstore := ∅; ginval0 := ∅; ginval := ∅; err := ESUCCESS; if err = ESUCCESS then apersistence_sync#(adr1, istore, istore0, ginval0, gstore0, gstore, nx, maxino1, ginval; pstate, syn; err); if err = ESUCCESS then let ns = ∅ in apersistence_commit# (@(index(n).lnum, maxino, indexnode(mkbrarray(BRANCH_SIZE), true, 0).flashsize), maxino4, syn ; ns, istore, ginval0, gstore0, adr1, istore0, gstore, nx, maxino1, ginval ; pstate, err)⟫ ( ( err = 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)) ∧ (err = ESUCCESS ∨ ⌊err⌋ ) ∧ ( err = ESUCCESS → btree-inv(null, adr1, istore, istore0, zh, ∅, ∅) ∧ gstore0 = ∅ ∧ ginval0 = ∅ ∧ maxino1 = maxino4 ∧ nx = [] ∧ ginval = ∅)))

Heuristic unfold applied rule call right

And obtained the following new goals

Proof step 109:
adr = adr1, ginval = ∅, ginval0 = ∅, gstore = ∅, gstore0 = ∅, istore = (∅)[n0, indexblock(indexnode(mkbrarray(BRANCH_SIZE), true, 0) ', @(maxino2, indexnode(mkbrarray(BRANCH_SIZE), true, 0).flashsize) ', 0)], istore0 = ∅, maxino = maxino4, maxino0 = index(n0).lnum, n = indexnode(mkbrarray(BRANCH_SIZE), true, 0).flashsize, nx = [], pstate = index(n0), inv((∅)[n0, indexblock(indexnode(mkbrarray(BRANCH_SIZE), true, 0) ', @(maxino2, indexnode(mkbrarray(BRANCH_SIZE), true, 0).flashsize) ', 0)]), inv((∅)[n0, indexblock([], [], 0)]), indexnode(mkbrarray(BRANCH_SIZE), true, 0).flashsize ≤ LEB_SIZE, index(n0).index? ∨ index(n0).journal? ⊦ [if maxino0 ∈ istore then istore[maxino0].ref-size := n else abort] ( inv(istore) ∧ n0 ∈ istore → ⟪pstate := index(n0); nx := []; maxino1 := maxino4; istore0 := ∅; gstore0 := ∅; gstore := ∅; ginval0 := ∅; ginval := ∅; err := ESUCCESS; if err = ESUCCESS then apersistence_sync#(adr1, istore, istore0, ginval0, gstore0, gstore, nx, maxino1, ginval; pstate, syn; err); if err = ESUCCESS then let ns = ∅ in apersistence_commit# (@(index(n0).lnum, maxino2, indexnode(mkbrarray(BRANCH_SIZE), true, 0).flashsize), maxino4, syn ; ns, istore, ginval0, gstore0, adr1, istore0, gstore, nx, maxino1, ginval ; pstate, err)⟫ ( ( err = 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)) ∧ (err = ESUCCESS ∨ ⌊err⌋ ) ∧ ( err = ESUCCESS → btree-inv(null, adr1, istore, istore0, zh, ∅, ∅) ∧ gstore0 = ∅ ∧ ginval0 = ∅ ∧ maxino1 = maxino4 ∧ nx = [] ∧ ginval = ∅)))

Rule argument

pos: right 1

Additional information

Used simplifier rules: apersistence_set_iblock_refsize# (LNUM, N, ROOTADR, ISTORE0, GINVAL, GSTORE, GSTORE0, NL, MAXINO, OS, PSTATE, PSYNCED ; ISTORE ) {if LNUM ∈ ISTORE then ISTORE[LNUM].ref-size := N else abort};