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

jvalid ↔ false, ax = ax0 + gstore2[n].ladrlist.to-adr(n), err = ESUCCESS, err = err0, gndx = gndx0 + gstore2[n].gndlist, gndx0 = [], log = ax, inv(gstore2), n ∈ gstore2, ⌊err0⌋ ∨ err0 = ESUCCESS ⊦ ⟪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 annotation applied rule annotation right

And obtained the following new goals

Proof step 18:
jvalid ↔ false, ax = ax0 + gstore2[n].ladrlist.to-adr(n), err = err0, err = ESUCCESS, gndx = gndx0 + gstore2[n].gndlist, gndx0 = [], log = ax, inv(gstore2), n ∈ gstore2, ⌊err0⌋ ∨ err0 = ESUCCESS ⊦ n ∈ ginval, # gndx ≤ # log ∧ inv(gstore2)
Proof step 23:
jvalid1 ↔ false, jvalid ↔ jvalid0, ax = ax0 + gstore2[n].ladrlist.to-adr(n), err = err0, err = ESUCCESS, gndx = gndx1, gndx0 = [], gndx2 = gndx0 + gstore2[n].gndlist, ¬ jvalid, log0 = ax, inv(gstore2), n ∈ gstore2, # gndx ≤ # log, ⌊err0⌋ ∨ err0 = ESUCCESS ⊦ ⟪if gndx.last.end then jvalid := true else {log := log.butlast; gndx := gndx.butlast}⟫ ((# gndx ≤ # log ∧ inv(gstore2)) ∧ (jvalid ⊃ 0;# gndx) < (jvalid0 ⊃ 0;# gndx1)), gndx = [], n ∈ ginval

Rule argument

rule: invariant right arg: bound: (jvalid ⊃ 0;# gndx) inv: # gndx ≤ # log ∧ inv(gstore2) fmapos: right 1 pos: right 1

Additional information

Used formulas: # gndx ≤ # log ∧ inv(gstore2), (jvalid ⊃ 0;# gndx) = (jvalid ⊃ 0;# gndx)