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

# wlar = # apebs0, apebs0[vtblpnum2] = mkpeb(aehdr, avhdr, buf0, m, false), vtblpnum2 ≠ # apebs0, vtblpnum2 < # apebs0, ubi-io-initial(apebs0), ∀ n3. n3 < # apebs0 → (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_write_vidhdr#(vtblpnum2, avidhdr(VTBL_VOLID, VTBL_LNUM, 0, 0, 0); apebs0; err0); vtblpnum1 := LEB_SIZE; if err0 = ESUCCESS then if vtblpnum1 < ENCODED_NAT_SIZE then err0 := ENOSPC else let buf = mkbuf(vtblpnum1), vtbl = ∅ in {encode_vtbl#(; vtbl, buf; err0); if err0 = ESUCCESS then aubi_io_write_data#(vtblpnum2, 0, 0, vtblpnum1, buf; apebs0; err0)}; vols := ∅; wlar[vtblpnum2] := wl-entry(wlar[vtblpnum2].ec, used); q := []; sqnum := 1; bflipset := ∅⟫ ( ( err0 = ESUCCESS → # apebs0 = # wlar ∧ unique-sqns(apebs0) ∧ valid-global-sqn(apebs0, sqnum) ∧ valid-wl(apebs0, wlar) ∧ valid-eraseq(q) ∧ valid-eraseq(wlar, q) ∧ valid-eraseq(apebs0, q) ∧ ¬ VTBL_VOLID ∈ vols ∧ bflipset-cons(bflipset, wlar) ∧ valid-ebatbl(apebs0, wlar, vols, vtblpnum2) ∧ valid-vtbl(apebs0, vols, wlar, vtblpnum2) ∧ vtblpnum1 = LEB_SIZE ∧ ubi-io-inv(apebs0)) ∧ (err0 = ESUCCESS ∨ ⌊err0⌋ ) ∧ (err0 = ESUCCESS → vols = ∅))

User applied rule insert program lemma

And obtained the following new goals

Rule argument

spec: aubi-io-asm name: inv-write-vidhdr seq: ubi-io-inv(apebs), ubi-io-write-vidhdr-pre(n, avhdr, apebs) ⊦ ⟪aubi_io_write_vidhdr#(n, avhdr; apebs; err)⟫ ubi-io-inv(apebs) subst: [avhdr, n, apebs, err] → [avidhdr(VTBL_VOLID, VTBL_LNUM, 0, 0, 0), vtblpnum2, apebs0, err0] flags: <all paths>

Additional information