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

⌊err0⌋ ⊦ ⟪apersistence_get_leb_size#(adr, istore0, istore, ginval, gstore0, gstore, nx, maxino, ginval0, pstate, syn; ; n); ginval := ginval0, ginval0 := ginval; if err0 = ESUCCESS then let ind = indexnode(mkbrarray(BRANCH_SIZE), true, 0) in let maxino1 = ind.flashsize in {if n < maxino1 then {debug#("btree: initial index node to large"); err0 := ENOSPC}; if err0 = ESUCCESS then apersistence_allocate_ind#(adr, istore, ginval0, gstore0, gstore, nx, maxino, ginval, syn; istore0, pstate; err0); if err0 = ESUCCESS then apersistence_add_ind#(ind, adr, istore, ginval0, gstore0, gstore, nx, maxino, ginval; adr0, istore0, pstate, syn; err0); if err0 = ESUCCESS then apersistence_set_iblock_refsize# (adr0.lnum, maxino1, adr, istore, ginval0, gstore0, gstore, nx, maxino, ginval, pstate, syn; istore0); if err0 = ESUCCESS then apersistence_sync#(adr, istore0, istore, ginval0, gstore0, gstore, nx, maxino, ginval; pstate, syn; err0); if err0 = ESUCCESS then let ns = ∅ in apersistence_commit# (adr0, maxino4, syn; ns, istore0, ginval0, gstore0, adr, istore, gstore, nx, maxino, ginval; pstate, err0)}⟫ ( ( err0 = ESUCCESS → syn ∧ (∃ ri, fi. btree-inv(null, adr, istore0, istore, 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(istore0) ∧ inv(istore) ∧ istore ⊑ istore0 ∧ remove-refsize0(istore) = istore ∧ (pstate.journal? → nx ≠ [] ∧ pstate.lnum = nx.last ∧ pstate.lnum ∈ gstore0) ∧ (pstate.index? → pstate.lnum ∈ istore0)) ∧ (err0 = ESUCCESS ∨ ⌊err0⌋ ) ∧ (err0 = ESUCCESS → btree-inv(null, adr, istore0, istore, zh, ∅, ∅) ∧ gstore0 = ∅ ∧ ginval0 = ∅ ∧ maxino = maxino4 ∧ nx = [] ∧ ginval = ∅))

Heuristic unfold applied rule call right

And obtained the following new goals

Proof step 262:
ginval = ginval1, ginval0 = ginval2, ⌊err0⌋ ⊦ ⟪n := LEB_SIZE; ginval2 := ginval1, ginval1 := ginval2; if err0 = ESUCCESS then let ind = indexnode(mkbrarray(BRANCH_SIZE), true, 0) in let maxino1 = ind.flashsize in {if n < maxino1 then {debug#("btree: initial index node to large"); err0 := ENOSPC}; if err0 = ESUCCESS then apersistence_allocate_ind#(adr, istore, ginval1, gstore0, gstore, nx, maxino, ginval2, syn; istore0, pstate; err0); if err0 = ESUCCESS then apersistence_add_ind#(ind, adr, istore, ginval1, gstore0, gstore, nx, maxino, ginval2; adr0, istore0, pstate, syn; err0); if err0 = ESUCCESS then apersistence_set_iblock_refsize# (adr0.lnum, maxino1, adr, istore, ginval1, gstore0, gstore, nx, maxino, ginval2, pstate, syn; istore0); if err0 = ESUCCESS then apersistence_sync#(adr, istore0, istore, ginval1, gstore0, gstore, nx, maxino, ginval2; pstate, syn; err0); if err0 = ESUCCESS then let ns = ∅ in apersistence_commit# (adr0, maxino4, syn; ns, istore0, ginval1, gstore0, adr, istore, gstore, nx, maxino, ginval2; pstate, err0)}⟫ ( ( err0 = ESUCCESS → syn ∧ (∃ ri, fi. btree-inv(null, adr, istore0, istore, zh, ri, fi)) ∧ inv(gstore0 \ ginval1) ∧ inv(gstore) ∧ elems nx ∩ ginval1 = ∅ ∧ ¬ dups(nx) ∧ dom gstore ∪ elems nx = dom gstore0 ∪ ginval1 ∧ remove-refsize0(gstore) = gstore ∧ inv(istore0) ∧ inv(istore) ∧ istore ⊑ istore0 ∧ remove-refsize0(istore) = istore ∧ (pstate.journal? → nx ≠ [] ∧ pstate.lnum = nx.last ∧ pstate.lnum ∈ gstore0) ∧ (pstate.index? → pstate.lnum ∈ istore0)) ∧ (err0 = ESUCCESS ∨ ⌊err0⌋ ) ∧ (err0 = ESUCCESS → btree-inv(null, adr, istore0, istore, zh, ∅, ∅) ∧ gstore0 = ∅ ∧ ginval1 = ∅ ∧ maxino = maxino4 ∧ nx = [] ∧ ginval2 = ∅))

Rule argument

pos: right 1

Additional information

Used simplifier rules: apersistence_get_leb_size# (ROOTADR, ISTORE, ISTORE0, GINVAL, GSTORE, GSTORE0, NL, MAXINO, OS, PSTATE, PSYNCED ; ; N ) {N := LEB_SIZE};