[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 11 from proof crash-neutral-read (previous step)

m2 < # avols[v], ebm-cons(avols0), ebm-cons(avols), v ∈ avols, n0 + n ≤ # buf, m1 + n ≤ LEB_SIZE, avols ⊆ avols0 ⊦ ⟨if EIO = ESUCCESS then if ¬ avols[v][m2].mapped? then buf := fill(buf, empty, n0, n) else buf := copy(avols[v][m2].data, m1, buf, n0, n) else choose buf1 with # buf1 = # buf ∧ range=(buf1, 0, buf, 0, n0) ∧ range=(buf1, n0 + n, buf, n0 + n, # buf - n0 + n) in buf := buf1⟩ true

Heuristic symbolic execution applied rule if negative right

And obtained the following new goals

Proof step 12:
m2 < # avols[v], ebm-cons(avols), ebm-cons(avols0), v ∈ avols, m1 + n ≤ LEB_SIZE, n0 + n ≤ # buf, avols ⊆ avols0 ⊦ ⟨choose buf1 with # buf1 = # buf ∧ range=(buf1, 0, buf, 0, n0) ∧ range=(buf1, n0 + n, buf, n0 + n, # buf - n0 + n) in buf := buf1⟩ true

Rule argument

pos: right 1

Additional information

Used simplifier rules: ⊦ ESUCCESS ≠ EIO; (s)