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

pebs[m3] = mkpeb(buf1, m1, false), m3 < # pebs, mtd-cons(pebs), n0 + n ≤ # buf, m2 + n ≤ PEB_SIZE, ⌊err0⌋ ∨ err0 = ESUCCESS ⊦ ⟪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, err0 = ESUCCESS

Heuristic symbolic execution applied rule choose right

And obtained the following new goals

Proof step 15:
# buf1 = # buf, pebs[m3] = mkpeb(buf0, m1, false), m3 < # pebs, mtd-cons(pebs), range=(buf1, 0, buf, 0, n0), range=(buf1, n0 + n, buf, n0 + n, # buf - n0 + n), m2 + n ≤ PEB_SIZE, n0 + n ≤ # buf, ⌊err0⌋ ∨ err0 = ESUCCESS ⊦ ⟪buf := buf1⟫ true, err0 = ESUCCESS
Proof step 16:
pebs[m3] = mkpeb(buf1, m1, false), m3 < # pebs, mtd-cons(pebs), m2 + n ≤ PEB_SIZE, n0 + n ≤ # buf, ⌊err0⌋ ∨ err0 = ESUCCESS ⊦ err0 = ESUCCESS, ∃ buf1. # buf1 = # buf ∧ range=(buf1, 0, buf, 0, n0) ∧ range=(buf1, n0 + n, buf, n0 + n, # buf - n0 + n)
Proof step 19:
pebs[m3] = mkpeb(buf1, m1, false), m3 < # pebs, mtd-cons(pebs), m2 + n ≤ PEB_SIZE, n0 + n ≤ # buf, ⌊err0⌋ ∨ err0 = ESUCCESS ⊦ err0 = ESUCCESS, ∀ buf1. # buf1 = # buf → range=(buf1, 0, buf, 0, n0) → # buf ≥ n0 + n

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

Heuristic symbolic execution applied rule choose right

And obtained the following new goals

Rule argument

Additional information