| # asar0 = # asar, # zbrar0 = BRANCH_SIZE, # asar = (n1 + n0) + 1, zbrar0[n0] = mkzbranch(key, adr2, r1), istore2[adr3] = istore[adr3], zh0[r1] = mkznode(r3, zbrar1, boolvar2, true, m2), err = ESUCCESS, pstate = index(m3), remove-refsize0(gstore1) = gstore1, remove-refsize0(istore0) = istore0, union(asar, 0, # asar) ∩ as0 = ∅, as ∩ as0 = ∅, elems nx ∩ ginval1 = ∅, dom gstore1 ∪ elems nx = dom gstore2 ∪ ginval1, asar[n0] ≠ asar0[n0], (( btree(r0, r1, adr2, height1, true, key-range(zbrar0, n0, # asar, ri), nodes(istore) | asar[n0], asar[n0], asar0[n0], ok) * (λ n. ⌜zbrar0[n].branch?⌝ ∧ btree (r0, zbrar0[n].child, zbrar0[n].adr, height1, true, key-range(zbrar0, n, # asar, ri), nodes(istore) | union(asar, 0, # asar), asar[n], asar0[n], ok) )⊗_ (0, n0 ) * (λ n. ⌜zbrar0[n].branch?⌝ ∧ btree (r0, zbrar0[n].child, zbrar0[n].adr, height1, true, key-range(zbrar0, n, # asar, ri), nodes(istore) | union(asar, 0, # asar), asar[n], asar0[n], ok) )⊗_ (1 + n0, n1 ) * r0 => mkznode(rp, zbrar0, false, true, # asar) * P) )(zh0), (( btree (rp, r0, adr3, height1 + 1, true, ri, nodes(istore) | union(asar, 0, # asar), union(asar, 0, # asar), union(asar0, 0, # asar) ++ adr3, ok) * P) )(zh0), n0 + 1 < BRANCH_SIZE, # asar < BRANCH_SIZE, n0 < BRANCH_SIZE, btree-sub-clean(r0, n0, zh0), disj(asar, 0, # asar), disj(asar0, 0, # asar), inv(istore), inv(gstore2 \ ginval1), inv(gstore1), inv(istore2), inv(istore0), refsize-cons(istore, as0 ∪ union(asar, 0, # asar)), refsize-cons(istore2, as0 ∪ as), sorted(zbrar0, 0, n1 + n0), r1 ∈ zh0, adr3 ∈ istore2, r0 ∈ zh1, m ∈ istore2, m3 ∈ istore, m ∈ istore, adr3 ∈ istore, union(asar, 0, # asar) ∩ dom nodes(istore2) ⊆ union(asar0, 0, # asar), as ⊆ union(asar0, 0, # asar), as0 ⊆ dom nodes(istore2), asar[n0] ⊆ asar0[n0], asar[n0] ⊆ dom nodes(istore) ∩ union(asar, 0, # asar), asar[n0] ⊆ dom nodes(istore), as0 ⊆ dom nodes(istore), union(asar, 0, # asar) ∩ dom nodes(istore2) ⊆ as, as ⊆ dom nodes(istore2), istore2 ⊑ istore, istore0 ⊑ istore2, istore0 ⊑ istore, ¬ dups(nx), ¬ adr3 ∈ union(asar0, 0, # asar), ¬ adr3 ∈ as, ¬ adr3 ∈ union(asar, 0, # asar), ¬ adr2 ∈ asar[n0], ¬ asar0[n0] ⊆ as0, ¬ asar0[n0] ⊆ dom nodes(istore), height1 = 0 → asar[n0] = ∅, ∀ n. n < # asar → asar0[n] ⊆ dom nodes(istore2), ∀ n. n < # asar → asar[n] ⊆ dom nodes(istore) ∩ union(asar, 0, # asar), ∀ n. ¬ n1 + n0 < n → asar[n] ⊆ dom nodes(istore2), ∀ n. ¬ n1 + n0 < n → asar[n] ⊆ dom nodes(istore), ∀ n. ¬ n1 + n0 < n → asar[n] ⊆ union(asar0, 0, # asar) ++ adr3, ∀ n. ¬ n1 + n0 < n → asar[n] ⊆ dom nodes(istore) ∩ union(asar, 0, # asar), ∀ n. n < # asar → asar[n] ⊆ union(asar0, 0, # asar) ++ adr3, ∀ height0, zh, r0, r, zbrar, boolvar, m0, adr0, adr1, istore1, istore, pstate, m, istore0, gstore0, nx, ginval, as, as0, gstore, rp, dirty, ri, alladrs, P, adr, ino, ns, err, bv. height0 < height1 +1 → zh[r0] = mkznode(r, zbrar, boolvar, true, m0) ∧ adr0 = adr1 ∧ istore1 = istore ∧ pstate = index(m) ∧ remove-refsize0(istore0) = istore0 ∧ remove-refsize0(gstore0) = gstore0 ∧ elems nx ∩ ginval = ∅ ∧ as ∩ as0 = ∅ ∧ dom gstore0 ∪ elems nx = dom gstore ∪ ginval ∧ ((btree(rp, r0, adr1, height0, dirty, ri, nodes(istore) | as, as, alladrs, ok) * P))(zh) ∧ inv(istore0) ∧ inv(istore) ∧ inv(gstore0) ∧ inv(gstore \ ginval) ∧ refsize-cons(istore, as0 ∪ as) ∧ m ∈ istore ∧ r0 ∈ zh ∧ as0 ⊆ dom nodes(istore) ∧ alladrs ⊆ dom nodes(istore) ∧ as ⊆ alladrs ∧ as ⊆ dom nodes(istore) ∧ istore0 ⊑ istore ∧ ¬ dups(nx) ∧ ¬ adr1 ∈ as ∧ (height0 = 0 → as = ∅) → ⟪btree_commit_rec#(r0, adr, istore0, ginval, gstore, gstore0, nx, ino, ns; adr1, err, zh, istore, pstate, bv)⟫ ( istore1 ⊑ istore ∧ (pstate.journal? → nx ≠ [] ∧ pstate.lnum = nx.last ∧ pstate.lnum ∈ gstore) ∧ (pstate.index? → pstate.lnum ∈ istore) ∧ (pstate = unbuffered → bv) ∧ inv(istore) ∧ istore0 ⊑ istore ∧ r0 ∈ zh ∧ (err = ESUCCESS → ¬ zh[r0].dirty ∧ pstate.index?) ∧ (∃ as1, alladrs1. refsize-cons(istore, as0 ∪ as1) ∧ as1 ∩ dom nodes(istore1) ⊆ as ∧ as1 ∩ as0 = ∅ ∧ alladrs1 ⊆ alladrs ∪ as1 ∧ ((btree(rp, r0, (err = ESUCCESS ⊃ adr1;adr0), height0, err ≠ ESUCCESS, ri, nodes(istore) | as1, as1, alladrs1, ok) * P))(zh))) ⊦ ⟪btree_commit_rec#(r1, adr1, istore0, ginval1, gstore2, gstore1, nx, maxino, ginval; adr2, err, zh0, istore, pstate, syn); n := n0; if err = ESUCCESS then zh0[r0].zbranches[n].adr := adr2; n := n + 1⟫ ( commit-inv (n, pstate, istore2, istore0, nx, gstore2, gstore1, ginval1, syn, err, rp, r0, adr3, height1 + 1, true, ri, istore, as, as0, union(asar0, 0, # asar) ++ adr3, P, zh0) ∧ ¬ n1 < zh0[r0].usedsize - n) |
Used simplifier rules: ⊦ m < n ↔ ¬ n ≤ m; (ss)%a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic%c: ⊦ m + n = n + m; from specification nat-basic% ⊦ n = n0 + n1 → (n ≤ n0 ↔ n1 = 0 ∧ n = n0); (s)% ⊦ m + 1 ≠ 0; (s)%btree-leaf-adr: ⊦ ((btree(rp, r, adr, 0, dirty, ri, iast, as, alladrs, nstat) * P) )(zh) → alladrs = {adr} ; (forward) from specification btree-inv%sep-ass: ⊦ (P * P3) * P4 = P * P3 * P4; from specification heap-sep[zheap]%sep-com: ⊦ P * P2 = P2 * P; from specification heap-sep[zheap]%btree-dirty-adr-notin: ⊦ r ∈ zh ∧ zh[r] = mkznode(rp0, zbrar, boolvar, true, height0) ∧ (( btree (rp, r, adr, height, dirty, ri, iast, as, alladrs, nstat) * P) )(zh) → ¬ adr ∈ as ∧ (height = 0 → as = ∅); (forward) from specification btree-inv%sub-trans: ⊦ as ⊆ as0 ∧ as0 ⊆ as1 → as ⊆ as1; (forward) from specification set-basic[node-store]%f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic%lf-01: ⊦ m < n ∧ n = n0 → m < n0; (forward) from specification nat-basic%sub-ntrans: ⊦ as ⊆ as0 ∧ ¬ as ⊆ as1 → ¬ as0 ⊆ as1; (forward) from specification set-basic[node-store]% ⊦ {adr} = ∅ ++ adr; (s)% ⊦ m < n → n ≠ 0; (s)% ⊦ m < n + 1 ↔ ¬ n < m; (s)% ⊦ ¬ m + n < m; (s)% ⊦ istore ⊑ istore0 → dom nodes(istore) ⊆ dom nodes(istore0); (ss)% ⊦ as ⊆ as0 → (as0 ⊆ as ↔ as = as0); (s) Used terms: n0