[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 10 from proof inv-read (previous step)

err0 = ESUCCESS, m2 < # avols[v], ebm-cons(avols), v ∈ avols, m1 + n ≤ LEB_SIZE, n0 + n ≤ # buf, ⌊err0⌋ ∨ err0 = ESUCCESS ⊦ ⟪if ¬ avols[v][m2].mapped? then buf := fill(buf, empty, n0, n) else buf := copy(avols[v][m2].data, m1, buf, n0, n)⟫ true

Heuristic conditional right split applied rule if right

And obtained the following new goals

Proof step 11:
err0 = ESUCCESS, m2 < # avols[v], ebm-cons(avols), v ∈ avols, n0 + n ≤ # buf, m1 + n ≤ LEB_SIZE, ⌊err0⌋ ∨ err0 = ESUCCESS ⊦ ⟪buf := fill(buf, empty, n0, n)⟫ true, avols[v][m2].mapped?
Proof step 12:
err0 = ESUCCESS, avols[v][m2].mapped?, m2 < # avols[v], ebm-cons(avols), v ∈ avols, n0 + n ≤ # buf, m1 + n ≤ LEB_SIZE, ⌊err0⌋ ∨ err0 = ESUCCESS ⊦ ⟪buf := copy(avols[v][m2].data, m1, buf, n0, n)⟫ true
Proof step 15:
err0 = ESUCCESS, m2 < # avols[v], ebm-cons(avols), v ∈ avols, n0 + n ≤ # buf, m1 + n ≤ LEB_SIZE, ⌊err0⌋ ∨ err0 = ESUCCESS ⊦ m2 < # avols[v] ∧ v ∈ avols

Rule argument

pos: right 1

Proof step 10 from proof inv-read (previous step)

Heuristic conditional right split applied rule if right

And obtained the following new goals

Rule argument

Additional information