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

err = ESUCCESS, err = err0, ⌊err0⌋ ∨ err0 = ESUCCESS ⊦ ⟪ri := ∅, fs := ∅, fi := ∅, fo := ∅, ro := ∅, log := [], boolvar := true; if err = ESUCCESS then let key = inodekey(ROOT_INO), adr = ? in let nd = inodenode(key, md, true, 0, 0, 0) in {aubifs_core_journal_add1#(nd, ri, fi, ro, fo; adr, fs, log; boolvar, err); if err = ESUCCESS then aubifs_core_index_store#(key, adr, fi, ro, fo, fs, log, boolvar; ri); if err = ESUCCESS then aubifs_core_journal_sync#(ri, fi, ro, fo, fs, log; ; boolvar, err)}⟫ ( err = ESUCCESS → boolvar ∧ ubifs-cons(fs, ri, ro, fi, fo, log) ∧ replay-cons-strong(fs, ri, ro, fi, fo, log) ∧ file-node-cons(fs, ri) ∧ orphans-cons(fs, ri, ro) ∧ ri-inj(fi))

Heuristic symbolic execution applied rule assign right

And obtained the following new goals

Proof step 13:
boolvar ↔ true, err = err0, err = ESUCCESS, fi = ∅, fo = ∅, fs = ∅, log = [], ri = ∅, ro = ∅, ⌊err0⌋ ∨ err0 = ESUCCESS ⊦ ⟪if err = ESUCCESS then let key = inodekey(ROOT_INO), adr = ? in let nd = inodenode(key, md, true, 0, 0, 0) in {aubifs_core_journal_add1#(nd, ri, fi, ro, fo; adr, fs, log; boolvar, err); if err = ESUCCESS then aubifs_core_index_store#(key, adr, fi, ro, fo, fs, log, boolvar; ri); if err = ESUCCESS then aubifs_core_journal_sync#(ri, fi, ro, fo, fs, log; ; boolvar, err)}⟫ ( err = ESUCCESS → boolvar ∧ ubifs-cons(fs, ri, ro, fi, fo, log) ∧ replay-cons-strong(fs, ri, ro, fi, fo, log) ∧ file-node-cons(fs, ri) ∧ orphans-cons(fs, ri, ro) ∧ ri-inj(fi))

Proof step 12 from proof inv-format (previous step)

Heuristic symbolic execution applied rule assign right

And obtained the following new goals

Rule argument

Additional information