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

fs0[ri0[inodekey(m0)]].nlink = 0 ∧ m0 ≠ ROOT_INO ↔ inodekey(m0) ∈ ro, mkinode(m0, md, false, fs0[ri0[inodekey(m0)]].nlink, fs0[ri0[inodekey(m0)]].nsubdirs, m4) = mkinode(m, md0, boolvar0, m1, m2, m3), 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), ri0[inodekey(m0)] ∈ fs0, inodekey(m0) ∈ ri0, buf-opt.some? → # buf-opt.buf = VFS_PAGE_SIZE ⊦ ⟪aubifs_core_index_truncate# (inodekey(m0), min(n, m4), fi, ro, fo, fs0[adr1, truncnode(inodekey(m0), min(n, m4))] [adr2, inodenode(inodekey(m0), md, false, fs0[ri0[inodekey(m0)]].nlink, fs0[ri0[inodekey(m0)]].nsubdirs, n) ], (log0 + adr1 ') + adr2 ', boolvar ; ri); boolvar1 := false; inode := mkinode (m, inodenode(inodekey(m0), md, false, fs0[ri0[inodekey(m0)]].nlink, fs0[ri0[inodekey(m0)]].nsubdirs, n).meta, inodenode(inodekey(m0), md, false, fs0[ri0[inodekey(m0)]].nlink, fs0[ri0[inodekey(m0)]].nsubdirs, n).directory, inodenode(inodekey(m0), md, false, fs0[ri0[inodekey(m0)]].nlink, fs0[ri0[inodekey(m0)]].nsubdirs, n).nlink, inodenode(inodekey(m0), md, false, fs0[ri0[inodekey(m0)]].nlink, fs0[ri0[inodekey(m0)]].nsubdirs, n).nsubdirs, inodenode(inodekey(m0), md, false, fs0[ri0[inodekey(m0)]].nlink, fs0[ri0[inodekey(m0)]].nsubdirs, n).size); if boolvar1 then buf-opt := some(inodenode(inodekey(m0), md, false, fs0[ri0[inodekey(m0)]].nlink, fs0[ri0[inodekey(m0)]].nsubdirs, n).data)⟫ ( ubifs-cons (fs0[adr1, truncnode(inodekey(m0), min(n, m4))] [adr2, inodenode(inodekey(m0), md, false, fs0[ri0[inodekey(m0)]].nlink, fs0[ri0[inodekey(m0)]].nsubdirs, n) ], ri, ro, fi, fo, (log0 + adr1 ') + adr2 ') ∧ replay-cons-strong (fs0[adr1, truncnode(inodekey(m0), min(n, m4))] [adr2, inodenode(inodekey(m0), md, false, fs0[ri0[inodekey(m0)]].nlink, fs0[ri0[inodekey(m0)]].nsubdirs, n) ], ri, ro, fi, fo, (log0 + adr1 ') + adr2 ') ∧ file-node-cons (fs0[adr1, truncnode(inodekey(m0), min(n, m4))] [adr2, inodenode(inodekey(m0), md, false, fs0[ri0[inodekey(m0)]].nlink, fs0[ri0[inodekey(m0)]].nsubdirs, n) ], ri) ∧ orphans-cons (fs0[adr1, truncnode(inodekey(m0), min(n, m4))] [adr2, inodenode(inodekey(m0), md, false, fs0[ri0[inodekey(m0)]].nlink, fs0[ri0[inodekey(m0)]].nsubdirs, n) ], ri, ro)), adr1 = adr2, m0 = 0, fs0[ri0[inodekey(m0)]].directory, adr1 ∈ fs0, adr2 ∈ fs0, m4 ≤ n ∧ m4 % VFS_PAGE_SIZE ≠ 0

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Proof step 732:
fs0[ri0[inodekey(m)]].nlink = 0 ∧ m ≠ ROOT_INO ↔ inodekey(m) ∈ ro, ri = ri0[inodekey(m), adr2], adr1 ≠ adr2, m ≠ 0, fs0[ri0[inodekey(m)]].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(m)] ∈ fs0, inodekey(m) ∈ ri0, ¬ fs0[ri0[inodekey(m)]].directory, ¬ adr1 ∈ fs0, ¬ adr2 ∈ fs0, buf-opt.some? → # buf-opt.buf = VFS_PAGE_SIZE ⊦ ⟪aubifs_core_index_truncate# (inodekey(m), min(n, m3), fi, ro, fo, fs0[adr1, truncnode(inodekey(m), min(n, m3))] [adr2, inodenode(inodekey(m), md0, false, fs0[ri0[inodekey(m)]].nlink, fs0[ri0[inodekey(m)]].nsubdirs, n) ], (log0 + adr1 ') + adr2 ', boolvar ; ri); boolvar1 := false; inode := mkinode (m, inodenode(inodekey(m), md0, false, fs0[ri0[inodekey(m)]].nlink, fs0[ri0[inodekey(m)]].nsubdirs, n).meta, inodenode(inodekey(m), md0, false, fs0[ri0[inodekey(m)]].nlink, fs0[ri0[inodekey(m)]].nsubdirs, n).directory, inodenode(inodekey(m), md0, false, fs0[ri0[inodekey(m)]].nlink, fs0[ri0[inodekey(m)]].nsubdirs, n).nlink, inodenode(inodekey(m), md0, false, fs0[ri0[inodekey(m)]].nlink, fs0[ri0[inodekey(m)]].nsubdirs, n).nsubdirs, inodenode(inodekey(m), md0, false, fs0[ri0[inodekey(m)]].nlink, fs0[ri0[inodekey(m)]].nsubdirs, n).size); md := md0; m0 := m; if boolvar1 then buf-opt := some(inodenode(inodekey(m0), md, false, fs0[ri0[inodekey(m0)]].nlink, fs0[ri0[inodekey(m0)]].nsubdirs, n).data)⟫ ( ubifs-cons (fs0[adr1, truncnode(inodekey(m0), min(n, m3))] [adr2, inodenode(inodekey(m0), md, false, fs0[ri0[inodekey(m0)]].nlink, fs0[ri0[inodekey(m0)]].nsubdirs, n) ], ri, ro, fi, fo, (log0 + adr1 ') + adr2 ') ∧ replay-cons-strong (fs0[adr1, truncnode(inodekey(m0), min(n, m3))] [adr2, inodenode(inodekey(m0), md, false, fs0[ri0[inodekey(m0)]].nlink, fs0[ri0[inodekey(m0)]].nsubdirs, n) ], ri, ro, fi, fo, (log0 + adr1 ') + adr2 ') ∧ file-node-cons (fs0[adr1, truncnode(inodekey(m0), min(n, m3))] [adr2, inodenode(inodekey(m0), md, false, fs0[ri0[inodekey(m0)]].nlink, fs0[ri0[inodekey(m0)]].nsubdirs, n) ], ri) ∧ orphans-cons (fs0[adr1, truncnode(inodekey(m0), min(n, m3))] [adr2, inodenode(inodekey(m0), md, false, fs0[ri0[inodekey(m0)]].nlink, fs0[ri0[inodekey(m0)]].nsubdirs, n) ], ri, ro)), m3 ≤ n ∧ m3 % VFS_PAGE_SIZE ≠ 0

Rule argument

Additional information

Used simplifier rules: ⊦ mkinode(m, md, boolvar, m0, m1, m2) = mkinode(m3, md0, boolvar0, m4, m5, m6) ↔ m = m3 ∧ md = md0 ∧ (boolvar ↔ boolvar0) ∧ m0 = m4 ∧ m1 = m5 ∧ m2 = m6; (ws)