[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 25 from proof refine-remap (previous step)

avol = abs(avols0[default-volid]), m < # avols0[default-volid], ebm-cons(avols0), ebm-vol-inv(abs(avols0[default-volid])), default-volid ∈ avols0 ⊦ ⟨if m < # avol then {fail_or_success#(; ; err); if err = ESUCCESS then avol[m] := mapped(mkbuf(0)) else {skip or avol[m] := unmapped}} else abort⟩ (avol = abs(avols0[default-volid][m, mapped(emptyleb, 0)]) ∧ ESUCCESS = err)

Heuristic symbolic execution applied rule if positive right

And obtained the following new goals

Proof step 26:
avol = abs(avols0[default-volid]), m < # avols0[default-volid], ebm-cons(avols0), ebm-vol-inv(abs(avols0[default-volid])), default-volid ∈ avols0 ⊦ ⟨fail_or_success#(; ; err); if err = ESUCCESS then avol[m] := mapped(mkbuf(0)) else {skip or avol[m] := unmapped}⟩ (avol = abs(avols0[default-volid][m, mapped(emptyleb, 0)]) ∧ ESUCCESS = err)

Rule argument

pos: right 1

Additional information

Used simplifier rules: ⊦ # abs(evol) = # evol; (s)% ⊦ m < n ↔ ¬ n ≤ m; (ss)% ⊦ m < n → (n ≤ m ↔ false); (s)