[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 14 from proof term-remove-nonend-blocks (previous step)

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

Heuristic symbolic execution applied rule if positive right

And obtained the following new goals

Proof step 15:
ax = ax0 + gstore2[n].ladrlist.to-adr(n), err = ESUCCESS, err = err0, gndx = gndx0 + gstore2[n].gndlist, gndx0 = [], inv(gstore2), n ∈ gstore2, ⌊err0⌋ ∨ err0 = ESUCCESS ⊦ ⟪jvalid := false; log := ax; while ¬ jvalid ∧ gndx ≠ [] do {/* (term-remove-nonend-blocks: invariant # gndx ≤ # log ∧ inv(gstore2) wfbound (jvalid ⊃ 0;# gndx)) */; if gndx.last.end then jvalid := true else {log := log.butlast; gndx := gndx.butlast}}⟫ true, n ∈ ginval

Rule argument

pos: right 1

Proof step 14 from proof term-remove-nonend-blocks (previous step)

Heuristic symbolic execution applied rule if positive right

And obtained the following new goals

Rule argument

Additional information