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

# apebs0 = n0 + vtblpnum0, # wlar = n0 + vtblpnum0, apebs0[vtblpnum0] = mkpeb(aehdr1, avhdr0, buf0, m0, false), apebs0[vtblpnum2] = mkpeb(aehdr0, avhdr, buf, m, boolvar), n0 ≠ 0, ubi-io-initial(apebs0), vtblpnum2 ≤ n0 + vtblpnum0, vtblpnum2 ≠ n0 + vtblpnum0 → ¬ boolvar, ∀ n3. n3 < vtblpnum0 → (apebs0[n3].bad → wlar[n3] = wl-entry(0, erroneous)) ∧ (¬ apebs0[n3].bad → apebs0[n3].echdr.valid? ∧ wlar[n3] = wl-entry(apebs0[n3].echdr.ec, free) ∧ apebs0[n3].vidhdr = empty) ⊦ ⟪aubi_io_read_echdr#(vtblpnum0, apebs0; aehdr; bitflips, err); n := # apebs0; if err = ESUCCESS ∧ vtblpnum2 = n then vtblpnum2 := vtblpnum0; if err = ESUCCESS ∧ aehdr.valid? then wlar[vtblpnum0] := wl-entry(aehdr.ec, free); vtblpnum0 := vtblpnum0 + 1⟫ ( vtblpnum0 ≤ # apebs0 ∧ n = # apebs0 ∧ # wlar = # apebs0 ∧ (err = ESUCCESS ∨ ⌊err⌋ ) ∧ ( err = ESUCCESS → vtblpnum2 ≤ # apebs0 ∧ (∀ n3. n3 < vtblpnum0 → (apebs0[n3].bad → wlar[n3] = wl-entry(0, erroneous)) ∧ (¬ apebs0[n3].bad → apebs0[n3].echdr.valid? ∧ wlar[n3] = wl-entry(apebs0[n3].echdr.ec, free) ∧ apebs0[n3].vidhdr = empty)) ∧ (vtblpnum2 ≠ # apebs0 → ¬ apebs0[vtblpnum2].bad)) ∧ # apebs0 < n0 + vtblpnum0)

Heuristic nonrecursive calls applied rule call right

And obtained the following new goals

Proof step 52:
# wlar = n0 + vtblpnum0, # apebs0 = n0 + vtblpnum0, apebs0[vtblpnum2] = mkpeb(aehdr0, avhdr, buf, m, boolvar), apebs0[vtblpnum0] = mkpeb(aehdr1, avhdr0, buf0, m0, false), apebs = apebs0, vtblpnum = vtblpnum0, ubi-io-initial(apebs0), vtblpnum2 ≤ n0 + vtblpnum0, vtblpnum2 ≠ n0 + vtblpnum0 → ¬ boolvar, ∀ n3. n3 < vtblpnum0 → (apebs0[n3].bad → wlar[n3] = wl-entry(0, erroneous)) ∧ (¬ apebs0[n3].bad → apebs0[n3].echdr.valid? ∧ wlar[n3] = wl-entry(apebs0[n3].echdr.ec, free) ∧ apebs0[n3].vidhdr = empty) ⊦ ⟪if ubi-io-read-echdr-pre(vtblpnum, apebs) then {fail_or_success#(; ; err); bitflips := ?; if err = ESUCCESS then aehdr := apebs[vtblpnum].echdr else aehdr := ?} else abort; n := # apebs0; if err = ESUCCESS ∧ vtblpnum2 = n then vtblpnum2 := vtblpnum0; if err = ESUCCESS ∧ aehdr.valid? then wlar[vtblpnum0] := wl-entry(aehdr.ec, free); vtblpnum0 := vtblpnum0 + 1⟫ ( vtblpnum0 ≤ # apebs0 ∧ n = # apebs0 ∧ # wlar = # apebs0 ∧ (err = ESUCCESS ∨ ⌊err⌋ ) ∧ ( err = ESUCCESS → vtblpnum2 ≤ # apebs0 ∧ (∀ n3. n3 < vtblpnum0 → (apebs0[n3].bad → wlar[n3] = wl-entry(0, erroneous)) ∧ (¬ apebs0[n3].bad → apebs0[n3].echdr.valid? ∧ wlar[n3] = wl-entry(apebs0[n3].echdr.ec, free) ∧ apebs0[n3].vidhdr = empty)) ∧ (vtblpnum2 ≠ # apebs0 → ¬ apebs0[vtblpnum2].bad)) ∧ # apebs0 < n0 + vtblpnum0), n0 = 0

Rule argument

pos: right 1

Additional information

Used simplifier rules: aubi_io_read_echdr#(PNUM, APEBS; AEHDR; BITFLIPS, ERR) {if ubi-io-read-echdr-pre(PNUM, APEBS) then {fail_or_success#(; ; ERR); BITFLIPS := ?; if ERR = ESUCCESS then AEHDR := APEBS[PNUM].echdr else AEHDR := ?} else abort };