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

fs0[ri0[inodekey(key0.ino)]].nlink = 0 ∧ key0.ino ≠ ROOT_INO ↔ inodekey(key0.ino) ∈ ro, fs0[ri0[inodekey(key0.ino)]].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), ri0[inodekey(key0.ino)] ∈ fs0, ri0[key0] ∈ fs0, key0 ∈ ri0, inodekey(key0.ino) ∈ ri0, ro ⊆ dom ri0, buf-opt.some? → # buf-opt.buf = VFS_PAGE_SIZE, key0.data? → fs0[ri0[key0]].data? ∧ # fs0[ri0[key0]].data = VFS_PAGE_SIZE, ¬ key0.data? ∨ ¬ min(n0, m3) ≤ key0.part * VFS_PAGE_SIZE ⊦ key0.ino = 0, adr1 = adr2, inodekey(key0.ino) = key0, key0.dentry?, fs0[ri0[inodekey(key0.ino)]].directory, key0.inode?, adr2 ∈ fs0, adr1 ∈ fs0, ( (key0.data? ∧ min(n0, m3) ≤ key0.part * VFS_PAGE_SIZE ⊃ (∅)[key0];ri0[key0]) = adr2 ∨ (key0.data? ∧ min(n0, m3) ≤ key0.part * VFS_PAGE_SIZE ⊃ (∅)[key0];ri0[key0]) = adr1 ∨ (key0.data? ∧ min(n0, m3) ≤ key0.part * VFS_PAGE_SIZE ⊃ (∅)[key0];ri0[key0]) ∈ fs0) ∧ (adr2 = (key0.data? ∧ min(n0, m3) ≤ key0.part * VFS_PAGE_SIZE ⊃ (∅)[key0];ri0[key0]) ⊃ inodenode(inodekey(key0.ino), md0, false, fs0[ri0[inodekey(key0.ino)]].nlink, fs0[ri0[inodekey(key0.ino)]].nsubdirs, n0) ;(adr1 = (key0.data? ∧ min(n0, m3) ≤ key0.part * VFS_PAGE_SIZE ⊃ (∅)[key0];ri0[key0]) ⊃ truncnode(inodekey(key0.ino), min(n0, m3)) ;fs0[(key0.data? ∧ min(n0, m3) ≤ key0.part * VFS_PAGE_SIZE ⊃ (∅)[key0];ri0[key0])] ) ) .key = key0 ∧ ( key0.data? → (adr2 = (min(n0, m3) ≤ key0.part * VFS_PAGE_SIZE ⊃ (∅)[key0];ri0[key0]) ⊃ inodenode(inodekey(key0.ino), md0, false, fs0[ri0[inodekey(key0.ino)]].nlink, fs0[ri0[inodekey(key0.ino)]].nsubdirs, n0) ;(adr1 = (min(n0, m3) ≤ key0.part * VFS_PAGE_SIZE ⊃ (∅)[key0];ri0[key0]) ⊃ truncnode(inodekey(key0.ino), min(n0, m3)) ;fs0[(min(n0, m3) ≤ key0.part * VFS_PAGE_SIZE ⊃ (∅)[key0];ri0[key0])] ) ) .data? ∧ # (adr2 = (min(n0, m3) ≤ key0.part * VFS_PAGE_SIZE ⊃ (∅)[key0];ri0[key0]) ⊃ inodenode(inodekey(key0.ino), md0, false, fs0[ri0[inodekey(key0.ino)]].nlink, fs0[ri0[inodekey(key0.ino)]].nsubdirs, n0) ;(adr1 = (min(n0, m3) ≤ key0.part * VFS_PAGE_SIZE ⊃ (∅)[key0];ri0[key0]) ⊃ truncnode(inodekey(key0.ino), min(n0, m3)) ;fs0[(min(n0, m3) ≤ key0.part * VFS_PAGE_SIZE ⊃ (∅)[key0];ri0[key0])] ) ) .data = VFS_PAGE_SIZE), m3 ≤ n0 ∧ m3 % VFS_PAGE_SIZE ≠ 0

Heuristic nonsplitting cut applied rule cut formula

And closed the goal!

Rule argument

fma: key0.data?

Additional information

Used simplifier rules: elim-data: ⊦ key.data? ↔ (∃ ino, n. key = datakey(ino, n));%data-ubifs-cons: ⊦ datakey(ino, n) ∈ ri ∧ ri[datakey(ino, n)] ∈ fs ∧ ubifs-cons(fs, ri, ro, fi, fo, log) → fs[ri[datakey(ino, n)]].data?;% ⊦ key ∈ ri ∧ ri-cons(ri, fs) → ri[key] ∈ fs; (ss)% ⊦ ri-cons(ri, fs) ∧ key ∈ ri → fs[ri[key]].key = key; (s)% ⊦ datakey(m, m0).ino = m; (s)% ⊦ inodekey(m) ≠ datakey(m0, m1); (s)% ⊦ ¬ datakey(m, m0).dentry?; (s)% ⊦ ¬ datakey(m, m0).inode?; (s)% ⊦ datakey(m, m0).data?; (s)%⊦ datakey(m, n) ∈ ri ∧ ubifs-cons(fs, ri, ro, fi, fo, log) → # fs[ri[datakey(m, n)]].data = VFS_PAGE_SIZE; (s)% ⊦ datakey(m, m0).part = m0; (s)% ⊦ m ≤ n ↔ ¬ n < m; (ss)% ⊦ m < n → (n ≤ m ↔ false); (s) Used formulas: key0.data?