[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 145 from proof refine-writepage (previous step)

# buf = VFS_PAGE_SIZE, fo.inodes?, orphans(fs, ri).inodes?, afs-cons(abs-dirs(fs, ri), abs-files(fs, ri)), file-node-cons(fs, ri), log-cons(log, fs), orphans-cons(fs, ri, orphans(fs, ri)), replay-cons-strong(fs, ri, orphans(fs, ri), fi, fo, log), ri-inj(fi), ri-inj(ri), ubifs-cons(fs, ri, orphans(fs, ri), fi, fo, log), inodekey(m) ∈ ri, ¬ fs[ri[inodekey(m)]].directory, asynced → boolvar2 ⊦ ⟪fail#(; ; err); adr := ?; boolvar := ?; ro0 := orphans(fs, ri); files := abs-files(fs, ri); dirs := abs-dirs(fs, ri); boolvar2 := boolvar; if err = ESUCCESS then aubifs_core_index_store#(datakey(m, pageno), adr, fi, orphans(fs, ri), fo, fs, log, boolvar2; ri)⟫ ⟨afs_writepage#(mkinode(m, md, boolvar1, m0, m1, m2), pageno, buf, dirs; err0, files; asynced)⟩ ( dirs = abs-dirs(fs, ri) ∧ files = abs-files(fs, ri) ∧ orphans(abs-dirs(fs, ri), abs-files(fs, ri)) = abs-keys(ro0) ∧ (asynced → boolvar2) ∧ err = err0)

Heuristic unfold applied rule call right

And obtained the following new goals

Proof step 146:
# buf = VFS_PAGE_SIZE, orphans(fs, ri).inodes?, fo.inodes?, afs-cons(abs-dirs(fs, ri), abs-files(fs, ri)), file-node-cons(fs, ri), log-cons(log, fs), orphans-cons(fs, ri, orphans(fs, ri)), replay-cons-strong(fs, ri, orphans(fs, ri), fi, fo, log), ri-inj(ri), ri-inj(fi), ubifs-cons(fs, ri, orphans(fs, ri), fi, fo, log), inodekey(m) ∈ ri, asynced → boolvar2 ⊦ ⟪choose err0 with ⌊err0⌋ in err := err0; adr := ?; boolvar := ?; ro0 := orphans(fs, ri); files := abs-files(fs, ri); dirs := abs-dirs(fs, ri); boolvar2 := boolvar; if err = ESUCCESS then aubifs_core_index_store#(datakey(m, pageno), adr, fi, orphans(fs, ri), fo, fs, log, boolvar2; ri)⟫ ⟨afs_writepage#(mkinode(m, md, boolvar1, m0, m1, m2), pageno, buf, dirs; err0, files; asynced)⟩ ( dirs = abs-dirs(fs, ri) ∧ files = abs-files(fs, ri) ∧ orphans(abs-dirs(fs, ri), abs-files(fs, ri)) = abs-keys(ro0) ∧ (asynced → boolvar2) ∧ err = err0), fs[ri[inodekey(m)]].directory

Rule argument

pos: right 1

Additional information

Used simplifier rules: fail#(; ; ERR){choose ERR0 with ⌊ERR0⌋ in ERR := ERR0};