| zh[r] = mkznode(r0, zbrar, boolvar, boolvar0, m), ((btree(null, null, adr, height0, false, fi, nodes(istore0), as0, alladrs0, ok) * true))(zh), ((btree(null, r, adr, height, false, ri, nodes(istore), as, alladrs, ok) * true))(zh), refsize-cons(istore0, as0), refsize-cons(istore, as), adr ∈ istore, as0 ⊆ alladrs0, as0 ⊆ dom nodes(istore0), as ⊆ alladrs, as ⊆ dom nodes(istore), alladrs0 ⊆ dom nodes(istore), alladrs ⊆ dom nodes(istore), as0 ⊆ dom nodes(istore), istore0 ⊑ istore, ((btree(null, r, adr, height, false, ri, nodes(istore), as, alladrs, ok) * true))(zh) ∧ ((btree(null, null, adr, height0, false, fi, nodes(istore), as0, alladrs0, ok) * true))(zh) → height = height0 ∧ as = as0 ∧ ri = fi ∧ alladrs = alladrs0, r = null ∨ ¬ boolvar0 ⊦ ri = fi |
zh[r] = mkznode(r0, zbrar, boolvar, boolvar0, m), ((btree(null, r, adr, height, false, ri, nodes(istore), as, alladrs, ok) * true))(zh), ((btree(null, null, adr, height0, false, fi, nodes(istore0), as0, alladrs0, ok) * true))(zh), refsize-cons(istore, as), refsize-cons(istore0, as0), adr ∈ istore, as0 ⊆ dom nodes(istore), alladrs ⊆ dom nodes(istore), alladrs0 ⊆ dom nodes(istore), as ⊆ dom nodes(istore), as ⊆ alladrs, as0 ⊆ dom nodes(istore0), as0 ⊆ alladrs0, istore0 ⊑ istore, r = null ∨ ¬ boolvar0 ⊦ ri = fi, ((btree(null, null, adr, height0, false, fi, nodes(istore), as0, alladrs0, ok) * true))(zh)
Used simplifier rules: true-elim: ⊦ ((P1 * P2))(zh) → ((true * P2))(zh); from specification heap-sep[zheap]%sep-com: ⊦ P * P2 = P2 * P; from specification heap-sep[zheap]%sep-ass: ⊦ (P * P3) * P4 = P * P3 * P4; from specification heap-sep[zheap]