[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 30 from proof btree-clean-fwd-strong (previous step)

# zbrar0 = BRANCH_SIZE, # asar = m + 1, # asar0 = m + 1, union(asar, 0, m + 1) = alladrs0 -- adr, union(asar0, 0, m + 1) = alladrs0 -- adr, ((bnode(r, zbrar, 0, m + 1, m + 1, height0 + 1, false, ri1, iast1, alladrs1 -- adr, alladrs1 -- adr) * P1))(zh3), (( (λ n. ⌜zbrar0[n].branch?⌝ ∧ btree(r2, zbrar0[n].child, zbrar0[n].adr, height, false, key-range(zbrar0, n, m + 1, ri0), iast0, asar[n], asar0[n], ok) )⊗_ (0, m + 1 ) * P0) )(zh), m < BRANCH_SIZE, ((r2 => mkznode(rp0, zbrar0, false, false, m + 1)))(zh5), ((r => mkznode(rp1, zbrar, false, false, m + 1)))(zh4), disj(asar, 0, m + 1), disj(asar0, 0, m + 1), nsize(m + 1, nstat), sorted(zbrar0, 0, m), unmodified(adr, mkznode(rp1, zbrar, false, false, m + 1), iast1), unmodified(adr, mkznode(rp0, zbrar0, false, false, m + 1), iast0), adr ∈ iast1, adr ∈ alladrs1, adr ∈ iast0, adr ∈ alladrs0, alladrs1 ⊆ dom iast1, alladrs0 ⊆ dom iast0, iast0 ⊆ iast1, zh5 ⊥ zh, zh4 ⊥ zh3, (r0 = null ⊃ P0(zh0);r2 = r0 ∧ zh5 ∪ zh = zh0), (r1 = null ⊃ P1(zh1);r = r1 ∧ zh4 ∪ zh3 = zh1), ∀ rp1, r1, adr, height1, ri1, iast1, alladrs1, nstat, P1, zh1, rp0, r0, ri0, iast0, alladrs0, P0, zh0. ((btree(rp1, r1, adr, height1, false, ri1, iast1, alladrs1, alladrs1, nstat) * P1))(zh1) ∧ ((btree(rp0, r0, adr, height, false, ri0, iast0, alladrs0, alladrs0, nstat) * P0))(zh0) ∧ alladrs1 ⊆ dom iast1 ∧ alladrs0 ⊆ dom iast0 ∧ iast0 ⊆ iast1 → height = height1 ∧ ri0 = ri1 ∧ alladrs0 = alladrs1 ⊦ # alladrs1 = 0, # alladrs0 = 0, alladrs0 = ∅, alladrs1 = ∅, height = height0 ∧ ri0 = ri1 ∧ alladrs0 = alladrs1

User applied rule insert rewrite lemma

And obtained the following new goals

Proof step 31:
⊦ bnode(rp, zbrar, m, len, nused, height + 1, dirty, ri, iast, as, alladrs) = ( ⌜m + len ≤ nused ∧ nused ≤ # zbrar ∧ # zbrar = BRANCH_SIZE⌝ ∧ ⌜nused ≠ 0 ∧ sorted(zbrar, 0, nused - 1)⌝ ∧ _∃ (λ asar. _∃ (λ asar0. ⌜ # asar = nused ∧ disj(asar, 0, nused) ∧ union(asar, m, len) = as ∧ # asar0 = nused ∧ disj(asar0, 0, nused) ∧ union(asar0, m, len) = alladrs ⌝ ∧ (λ n. ⌜zbrar[n].branch?⌝ ∧ btree(rp, zbrar[n].child, zbrar[n].adr, height, dirty, key-range(zbrar, n, nused, ri), iast, asar[n], asar0[n], ok) )⊗_ (m, len ))))
Proof step 32:
# asar0 = m + 1, # asar = m + 1, # zbrar0 = BRANCH_SIZE, union(asar0, 0, m + 1) = alladrs0 -- adr, union(asar, 0, m + 1) = alladrs0 -- adr, (( (λ n. ⌜zbrar0[n].branch?⌝ ∧ btree(r2, zbrar0[n].child, zbrar0[n].adr, height, false, key-range(zbrar0, n, m + 1, ri0), iast0, asar[n], asar0[n], ok) )⊗_ (0, m + 1 ) * P0) )(zh), (( ( ⌜0 + m + 1 ≤ m + 1 ∧ m + 1 ≤ # zbrar ∧ # zbrar = BRANCH_SIZE⌝ ∧ ⌜m + 1 ≠ 0 ∧ sorted(zbrar, 0, m + 1 - 1)⌝ ∧ _∃ (λ asar. _∃ (λ asar0. ⌜ # asar = m + 1 ∧ disj(asar, 0, m + 1) ∧ union(asar, 0, m + 1) = alladrs1 -- adr ∧ # asar0 = m + 1 ∧ disj(asar0, 0, m + 1) ∧ union(asar0, 0, m + 1) = alladrs1 -- adr ⌝ ∧ (λ n. ⌜zbrar[n].branch?⌝ ∧ btree(r, zbrar[n].child, zbrar[n].adr, height0, false, key-range(zbrar, n, m + 1, ri1), iast1, asar[n], asar0[n], ok) )⊗_ (0, m + 1 )))) * P1) )(zh3), m < BRANCH_SIZE, ((r => mkznode(rp1, zbrar, false, false, m + 1)))(zh4), ((r2 => mkznode(rp0, zbrar0, false, false, m + 1)))(zh5), disj(asar0, 0, m + 1), disj(asar, 0, m + 1), nsize(m + 1, nstat), sorted(zbrar0, 0, m), unmodified(adr, mkznode(rp0, zbrar0, false, false, m + 1), iast0), unmodified(adr, mkznode(rp1, zbrar, false, false, m + 1), iast1), adr ∈ alladrs0, adr ∈ iast0, adr ∈ alladrs1, adr ∈ iast1, iast0 ⊆ iast1, alladrs0 ⊆ dom iast0, alladrs1 ⊆ dom iast1, zh4 ⊥ zh3, zh5 ⊥ zh, (r1 = null ⊃ P1(zh1);r = r1 ∧ zh4 ∪ zh3 = zh1), (r0 = null ⊃ P0(zh0);r2 = r0 ∧ zh5 ∪ zh = zh0), ∀ rp1, r1, adr, height1, ri1, iast1, alladrs1, nstat, P1, zh1, rp0, r0, ri0, iast0, alladrs0, P0, zh0. ((btree(rp1, r1, adr, height1, false, ri1, iast1, alladrs1, alladrs1, nstat) * P1))(zh1) ∧ ((btree(rp0, r0, adr, height, false, ri0, iast0, alladrs0, alladrs0, nstat) * P0))(zh0) ∧ alladrs1 ⊆ dom iast1 ∧ alladrs0 ⊆ dom iast0 ∧ iast0 ⊆ iast1 → height = height1 ∧ ri0 = ri1 ∧ alladrs0 = alladrs1 ⊦ # alladrs0 = 0, # alladrs1 = 0, alladrs0 = ∅, alladrs1 = ∅, height = height0 ∧ ri0 = ri1 ∧ alladrs0 = alladrs1

Rule argument

spec: <toplevel> name: bnode seq: ⊦ bnode (rp, zbrar, m, len, nused, height + 1, dirty, ri, iast, as, alladrs) = ( ⌜ m + len ≤ nused ∧ nused ≤ # zbrar ∧ # zbrar = BRANCH_SIZE ⌝ ∧ ⌜nused ≠ 0 ∧ sorted(zbrar, 0, nused - 1)⌝ ∧ _∃ (λ asar. _∃ (λ asar0. ⌜ # asar = nused ∧ disj(asar, 0, nused) ∧ union(asar, m, len) = as ∧ # asar0 = nused ∧ disj(asar0, 0, nused) ∧ union(asar0, m, len) = alladrs ⌝ ∧ (λ n. ⌜zbrar[n].branch?⌝ ∧ btree (rp, zbrar[n].child, zbrar[n].adr, height, dirty, key-range(zbrar, n, nused, ri), iast, asar[n], asar0[n], ok) )⊗_ (m, len )))) subst: [alladrs, as, iast, ri, dirty, height, nused, len, m, zbrar, rp] → [alladrs1 -- adr, alladrs1 -- adr, iast1, ri1, false, height0, m + 1, m + 1, 0, zbrar, r] flags: <all paths>

Additional information

Used terms: alladrs1 -- adr, alladrs1 -- adr, iast1, ri1, false, height0, m + 1, m + 1, 0, zbrar, r