[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 prepost-remove-nonend-blocks (previous step)

gstore2[n] = groupblock(gndx0, lax, m), ax1 = ax0, err = err0, gndx1 = [], inv(gstore2 \ ginval), inv(groupblock(gndx0, lax, m)), n ∈ gstore2, ⌊err0⌋ ∨ err0 = ESUCCESS ⊦ ⟪if err = ESUCCESS then {jvalid := false; while ¬ jvalid ∧ gndx ≠ [] do {/* (term-remove-nonend-blocks: invariant # gndx ≤ # ax ∧ inv(gstore2) wfbound (jvalid ⊃ 0;# gndx)) */; if gndx.last.end then jvalid := true else {ax := ax.butlast; gndx := gndx.butlast}}}⟫ ((err = ESUCCESS ∨ ⌊err⌋ ) ∧ (err = ESUCCESS → ax = ax0 + prefixn(valid-group-nodes(gndx0), lax).to-adr(n))), err = ESUCCESS, n ∈ ginval

Heuristic symbolic execution applied rule if negative right

And obtained the following new goals

Rule argument

pos: right 1

Additional information