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

# pebs0 = n0 + m1, # pebs = n0 + m1, err = err0, m = m1, mtd-cons(pebs0), mtd-cons(pebs), ubi-io-initial(subarray(pebs, 0, m1)), ⌊err0⌋ ∨ err0 = ESUCCESS ⊦ ⟪if err = ESUCCESS ∧ ¬ isbad then let aehdr = ?, bitflips = ? in {ubi_io_read_echdr#(m, EB_PAGE_SIZE, pebs; aehdr; bitflips, err); let n = (err = ESUCCESS ∧ aehdr.valid? ⊃ aehdr.ec + 1;0) in {mtd_asm_erase#(m; pebs; err); if err = ESUCCESS then ubi_io_write_echdr#(m, aechdr(n), EB_PAGE_SIZE; pebs; err)}}; m := m + 1⟫ ( m ≤ # pebs0 ∧ # pebs0 = # pebs ∧ mtd-cons(pebs) ∧ (err = ESUCCESS → ubi-io-initial(subarray(pebs, 0, m))) ∧ (err = ESUCCESS ∨ ⌊err⌋ ) ∧ # pebs0 < n0 + m), err = ESUCCESS, n0 = 0

Heuristic symbolic execution applied rule if negative right

And obtained the following new goals

Rule argument

pos: right 1

Additional information