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

fs0[ri0[inodekey(m0)]].nlink = 0 ∧ m0 ≠ ROOT_INO ↔ inodekey(m0) ∈ ro, fs = fs0[adr1, truncnode(inodekey(m0), m4)][adr2, inodenode(inodekey(m0), md0, false, fs0[ri0[inodekey(m0)]].nlink, fs0[ri0[inodekey(m0)]].nsubdirs, n0)], key = inodekey(m0), ks = datakeys(key, n, ri), log = (log0 + adr1 ') + adr2 ', n = m4, ri = ri0[inodekey(m0), adr2], fs0[ri0[inodekey(m0)]].inode?, ro.inodes?, fo.inodes?, file-node-cons(fs0, ri0), log-cons(log0, fs0), orphans-cons(fs0, ri0, ro), replay-cons-strong(fs0, ri0, ro, fi, fo, log0), ri-cons(ri0, fs0), ri-inj(ri0), ri-inj(fi), ubifs-cons(fs0, ri0, ro, fi, fo, log0), inodekey(m0) ∈ ri0, ri0[inodekey(m0)] ∈ fs0, m4 ≤ n0 ⊦ ⟪inode := mkinode (m0, inodenode(inodekey(m0), md0, false, fs0[ri0[inodekey(m0)]].nlink, fs0[ri0[inodekey(m0)]].nsubdirs, n0).meta, inodenode(inodekey(m0), md0, false, fs0[ri0[inodekey(m0)]].nlink, fs0[ri0[inodekey(m0)]].nsubdirs, n0).directory, inodenode(inodekey(m0), md0, false, fs0[ri0[inodekey(m0)]].nlink, fs0[ri0[inodekey(m0)]].nsubdirs, n0).nlink, inodenode(inodekey(m0), md0, false, fs0[ri0[inodekey(m0)]].nlink, fs0[ri0[inodekey(m0)]].nsubdirs, n0).nsubdirs, inodenode(inodekey(m0), md0, false, fs0[ri0[inodekey(m0)]].nlink, fs0[ri0[inodekey(m0)]].nsubdirs, n0).size); md := md0; m := m0; if false then buf-opt := some(inodenode(inodekey(m), md, false, fs0[ri0[inodekey(m)]].nlink, fs0[ri0[inodekey(m)]].nsubdirs, n0).data)⟫ ( ubifs-cons (fs0[adr1, truncnode(inodekey(m), m4)] [adr2, inodenode(inodekey(m), md, false, fs0[ri0[inodekey(m)]].nlink, fs0[ri0[inodekey(m)]].nsubdirs, n0) ], ri \ ks, ro, fi, fo, (log0 + adr1 ') + adr2 ') ∧ replay-cons-strong (fs0[adr1, truncnode(inodekey(m), m4)] [adr2, inodenode(inodekey(m), md, false, fs0[ri0[inodekey(m)]].nlink, fs0[ri0[inodekey(m)]].nsubdirs, n0) ], ri \ ks, ro, fi, fo, (log0 + adr1 ') + adr2 ') ∧ file-node-cons (fs0[adr1, truncnode(inodekey(m), m4)] [adr2, inodenode(inodekey(m), md, false, fs0[ri0[inodekey(m)]].nlink, fs0[ri0[inodekey(m)]].nsubdirs, n0) ], ri \ ks) ∧ orphans-cons (fs0[adr1, truncnode(inodekey(m), m4)] [adr2, inodenode(inodekey(m), md, false, fs0[ri0[inodekey(m)]].nlink, fs0[ri0[inodekey(m)]].nsubdirs, n0) ], ri \ ks, ro)), m4 % VFS_PAGE_SIZE = 0, adr1 = adr2, m0 = 0, fs0[ri0[inodekey(m0)]].directory, buf-opt.some?, adr2 ∈ fs0, adr1 ∈ fs0, datakey(m0, m4 / VFS_PAGE_SIZE) ∈ ri0

Heuristic symbolic execution applied rule assign right

And obtained the following new goals

Proof step 584:
fs0[ri0[inodekey(m0)]].nlink = 0 ∧ m0 ≠ ROOT_INO ↔ inodekey(m0) ∈ ro, fs = fs0[adr1, truncnode(inodekey(m0), m4)][adr2, inodenode(inodekey(m0), md0, false, fs0[ri0[inodekey(m0)]].nlink, fs0[ri0[inodekey(m0)]].nsubdirs, n0)], key = inodekey(m0), ks = datakeys(key, n, ri), log = (log0 + adr1 ') + adr2 ', n = m4, ri = ri0[inodekey(m0), adr2], inodenode(inodekey(m0), md0, false, fs0[ri0[inodekey(m0)]].nlink, fs0[ri0[inodekey(m0)]].nsubdirs, n0).inode?, fs0[ri0[inodekey(m0)]].inode?, fo.inodes?, ro.inodes?, file-node-cons(fs0, ri0), log-cons(log0, fs0), orphans-cons(fs0, ri0, ro), replay-cons-strong(fs0, ri0, ro, fi, fo, log0), ri-cons(ri0, fs0), ri-inj(fi), ri-inj(ri0), ubifs-cons(fs0, ri0, ro, fi, fo, log0), ri0[inodekey(m0)] ∈ fs0, inodekey(m0) ∈ ri0, m4 ≤ n0, inodenode(inodekey(m0), md0, false, fs0[ri0[inodekey(m0)]].nlink, fs0[ri0[inodekey(m0)]].nsubdirs, n0).trunc? ∨ inodenode(inodekey(m0), md0, false, fs0[ri0[inodekey(m0)]].nlink, fs0[ri0[inodekey(m0)]].nsubdirs, n0).inode? ⊦ ⟪md := md0; m := m0; if false then buf-opt := some(inodenode(inodekey(m), md, false, fs0[ri0[inodekey(m)]].nlink, fs0[ri0[inodekey(m)]].nsubdirs, n0).data)⟫ ( ubifs-cons (fs0[adr1, truncnode(inodekey(m), m4)] [adr2, inodenode(inodekey(m), md, false, fs0[ri0[inodekey(m)]].nlink, fs0[ri0[inodekey(m)]].nsubdirs, n0) ], ri \ ks, ro, fi, fo, (log0 + adr1 ') + adr2 ') ∧ replay-cons-strong (fs0[adr1, truncnode(inodekey(m), m4)] [adr2, inodenode(inodekey(m), md, false, fs0[ri0[inodekey(m)]].nlink, fs0[ri0[inodekey(m)]].nsubdirs, n0) ], ri \ ks, ro, fi, fo, (log0 + adr1 ') + adr2 ') ∧ file-node-cons (fs0[adr1, truncnode(inodekey(m), m4)] [adr2, inodenode(inodekey(m), md, false, fs0[ri0[inodekey(m)]].nlink, fs0[ri0[inodekey(m)]].nsubdirs, n0) ], ri \ ks) ∧ orphans-cons (fs0[adr1, truncnode(inodekey(m), m4)] [adr2, inodenode(inodekey(m), md, false, fs0[ri0[inodekey(m)]].nlink, fs0[ri0[inodekey(m)]].nsubdirs, n0) ], ri \ ks, ro)), m4 % VFS_PAGE_SIZE = 0, adr1 = adr2, m0 = 0, fs0[ri0[inodekey(m0)]].directory, buf-opt.some?, datakey(m0, m4 / VFS_PAGE_SIZE) ∈ ri0, adr1 ∈ fs0, adr2 ∈ fs0

Rule argument

Additional information

Used simplifier rules: inode-ubifs-cons: ⊦ inodekey(ino) ∈ ri ∧ ri[inodekey(ino)] ∈ fs ∧ ubifs-cons(fs, ri, ro, fi, fo, log) → fs[ri[inodekey(ino)]].inode?;% ⊦ inodenode(key, md, boolvar, m, m0, m1).inode?; (s)% ⊦ key ∈ ri ∧ ri-cons(ri, fs) → ri[key] ∈ fs; (ss)% ⊦ ¬ inodenode(key, md, boolvar, m, m0, m1).trunc?; (s)