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

# pebs0 = n0 + m1, # pebs = n0 + m1, err = ESUCCESS, err = err0, m = m1, m1 < # pebs, mtd-cons(pebs0), mtd-cons(pebs), ubi-io-initial(subarray(pebs, 0, m1)), err = ESUCCESS → m1 < # pebs, ⌊err0⌋ ∨ err0 = ESUCCESS ⊦ ⟪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), n0 = 0, pebs[m1].bad

Heuristic simplifier applied rule simplifier

And obtained the following new goals

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

Rule argument

Additional information

Used simplifier rules: c: ⊦ m + n = n + m; from specification nat-basic%a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic% ⊦ m < m + n ↔ n ≠ 0; (s)% ⊦ ¬ ⌊ESUCCESS⌋ ; (s)