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

# buf = VFS_PAGE_SIZE, nd = datanode(datakey(m, pageno), buf), fo.inodes?, ro.inodes?, file-node-cons(fs, ri), log-cons(log, fs), orphans-cons(fs, ri, ro), replay-cons-strong(fs, ri, ro, fi, fo, log), ri-inj(fi), ri-inj(ri), ubifs-cons(fs, ri, ro, fi, fo, log), inodekey(m) ∈ ri ⊦ ⟪if ri-cons(ri, fs) ∧ node-cons(nd.key, nd) then { choose adr1 with new(adr1 ', fs) ∧ ¬ dups(adr1 ') in {adr := adr1; fs[adr] := nd, log := log + adr, err := ESUCCESS} ifnone err := ENOSPC or {fail#(; ; err); adr := ?}; boolvar := ?} else abort; if err = ESUCCESS then aubifs_core_index_store#(datakey(m, pageno), adr, fi, ro, fo, fs, log, boolvar; ri)⟫ (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)), fs[ri[inodekey(m)]].directory

Heuristic symbolic execution applied rule if positive right

And obtained the following new goals

Proof step 15:
# buf = VFS_PAGE_SIZE, nd = datanode(datakey(m, pageno), buf), ro.inodes?, fo.inodes?, file-node-cons(fs, ri), log-cons(log, fs), orphans-cons(fs, ri, ro), replay-cons-strong(fs, ri, ro, fi, fo, log), ri-inj(ri), ri-inj(fi), ubifs-cons(fs, ri, ro, fi, fo, log), inodekey(m) ∈ ri ⊦ ⟪ choose adr1 with new(adr1 ', fs) ∧ ¬ dups(adr1 ') in {adr := adr1; fs[adr] := nd, log := log + adr, err := ESUCCESS} ifnone err := ENOSPC or {fail#(; ; err); adr := ?}; boolvar := ?; if err = ESUCCESS then aubifs_core_index_store#(datakey(m, pageno), adr, fi, ro, fo, fs, log, boolvar; ri)⟫ (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)), fs[ri[inodekey(m)]].directory

Rule argument

pos: right 1

Additional information

Used simplifier rules: ⊦ ubifs-cons(fs, ri, ro, fi, fo, log) → ri-cons(ri, fs); (ss)% ⊦ datanode(key, buf).key = key; (s)% ⊦ node-cons(key0, datanode(key1, buf)) ↔ key0.data?; (s)% ⊦ datakey(m, m0).data?; (s)