[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 63 from proof program+leftmost (previous step)

r ≠ null, (r => mknode(r0, a0, r1) * tr(r0, t0) * tr(r1, t1) * P)(H) ⊦ 〈let r1 = H[r] .left in { H0 := H, r0 := r ; if r1 = null then { a1 := H0[r0] .val ; r0 := H0[r0] .right } else let r = r0, r2 = H0[r1] .left in { while r2 ≠ null do { r := r1 ; r1 := r2 ; r2 := H0[r1] .left } ; a1 := H0[r1] .val ; r2 := H0[r1] .right ; H0[r] .left := r2 } }〉 ((tr(r0, (t0 = leaf ⊃ t1; branch(t0 .butleftmost, a0, t1))) * P * true)(H0) ∧ a1 = ((t0 = leaf ⊃ a0; t0 .leftmost)))

Heuristic symbolic execution applied rule vardecls right

And obtained the following new goals

Proof step 62:
r ≠ null, (r => mknode(r0, a0, r1) * tr(r0, t0) * tr(r1, t1) * P)(H), r2 = H[r] .left ⊦ 〈H0 := H, r0 := r〉〈if r2 = null then { a1 := H0[r0] .val ; r0 := H0[r0] .right } else let r = r0, r0 = H0[r2] .left in { while r0 ≠ null do { r := r2 ; r2 := r0 ; r0 := H0[r2] .left } ; a1 := H0[r2] .val ; r0 := H0[r2] .right ; H0[r] .left := r0 }〉 ((tr(r0, (t0 = leaf ⊃ t1; branch(t0 .butleftmost, a0, t1))) * P * true)(H0) ∧ a1 = ((t0 = leaf ⊃ a0; t0 .leftmost)))

Rule argument

[emptyarg]

Additional information

[[CONCRETESIMPRULES : ()]]