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

# buf = VFS_PAGE_SIZE, boolvar0 ↔ boolvar, inode = mkinode(m, md, boolvar1, m0, m1, m2), 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 pre-writepage(inode, pageno, buf, fs, ri) then choose boolvar, key, adr, nd with boolvar in let ino = inode.ino in {key := datakey(ino, pageno); nd := datanode(key, buf); aubifs_core_journal_add1#(nd, ri, fi, ro, fo; adr, fs, log; boolvar0, err); if err = ESUCCESS then aubifs_core_index_store#(key, adr, fi, ro, fo, fs, log, boolvar0; ri) else if ¬ boolvar then aubifs_core_index_remove#(key, fi, ro, fo, fs, log, boolvar0; ri)} else abort⟫ (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 7:
# buf = VFS_PAGE_SIZE, boolvar0 ↔ boolvar, inode = mkinode(m, md, boolvar1, m0, m1, m2), 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 boolvar, key, adr, nd with boolvar in let ino = inode.ino in {key := datakey(ino, pageno); nd := datanode(key, buf); aubifs_core_journal_add1#(nd, ri, fi, ro, fo; adr, fs, log; boolvar0, err); if err = ESUCCESS then aubifs_core_index_store#(key, adr, fi, ro, fo, fs, log, boolvar0; ri) else if ¬ boolvar then aubifs_core_index_remove#(key, fi, ro, fo, fs, log, boolvar0; 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: ⊦ pre-writepage(inode, n, buf, fs, ri) ↔ valid-file-ino(inode.ino, fs, ri) ∧ # buf = VFS_PAGE_SIZE; (s)% ⊦ mkinode(m, md, boolvar, m0, m1, m2).ino = m; (s)%⊦ valid-file-ino(ino, fs, ri) ↔ inodekey(ino) ∈ ri ∧ ¬ fs[ri[inodekey(ino)]].directory; (s)