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

fs0[ri0[inodekey(m)]].nlink = 0 ∧ m ≠ ROOT_INO ↔ inodekey(m) ∈ ro, replay(log0, fs0, fi, fo) = ri0 ⊖ ro, fs0[ri0[inodekey(m)]].inode?, fo.inodes?, ro.inodes?, file-node-cons(fs0, ri0), log-cons(log0, fs0), orphans-cons(fs0, ri0, ro), replay-safe(log0, fs0, fi ⊖ fo), ri-cons(ri0, fs0), ri-inj(fi), ri-inj(ri0), ubifs-cons(fs0, ri0, ro, fi, fo, log0), inodekey(m) ∈ ri0, ri0[inodekey(m)] ∈ fs0, buf-opt.some? → # buf-opt.buf = VFS_PAGE_SIZE ⊦ adr1 = adr2, m = 0, fs0[ri0[inodekey(m)]].directory, adr1 ∈ fs0, adr2 ∈ fs0, replay-safe (log0, fs0[adr1, truncnode(inodekey(m), min(n0, m3))] [adr2, inodenode(inodekey(m), md0, false, fs0[ri0[inodekey(m)]].nlink, fs0[ri0[inodekey(m)]].nsubdirs, n0) ], fi ⊖ fo) ∧ ¬ adr1 ∈ replay-log (log0, fs0[adr1, truncnode(inodekey(m), min(n0, m3))] [adr2, inodenode(inodekey(m), md0, false, fs0[ri0[inodekey(m)]].nlink, fs0[ri0[inodekey(m)]].nsubdirs, n0) ], fi ⊖ fo) ∧ ¬ adr2 ∈ replay-log (log0, fs0[adr1, truncnode(inodekey(m), min(n0, m3))] [adr2, inodenode(inodekey(m), md0, false, fs0[ri0[inodekey(m)]].nlink, fs0[ri0[inodekey(m)]].nsubdirs, n0) ], fi ⊖ fo) \ datakeys (inodekey(m), min(n0, m3), replay-log (log0, fs0[adr1, truncnode(inodekey(m), min(n0, m3))] [adr2, inodenode(inodekey(m), md0, false, fs0[ri0[inodekey(m)]].nlink, fs0[ri0[inodekey(m)]].nsubdirs, n0) ], fi ⊖ fo)) ∧ (fs0[ri0[inodekey(m)]].nlink ≠ 0 ∨ m = ROOT_INO ⊃ ( replay-log (log0, fs0[adr1, truncnode(inodekey(m), min(n0, m3))] [adr2, inodenode(inodekey(m), md0, false, fs0[ri0[inodekey(m)]].nlink, fs0[ri0[inodekey(m)]].nsubdirs, n0) ], fi ⊖ fo) \ datakeys (inodekey(m), min(n0, m3), replay-log (log0, fs0[adr1, truncnode(inodekey(m), min(n0, m3))] [adr2, inodenode(inodekey(m), md0, false, fs0[ri0[inodekey(m)]].nlink, fs0[ri0[inodekey(m)]].nsubdirs, n0) ], fi ⊖ fo)) )[inodekey(m), adr2 ] ; ( replay-log (log0, fs0[adr1, truncnode(inodekey(m), min(n0, m3))] [adr2, inodenode(inodekey(m), md0, false, fs0[ri0[inodekey(m)]].nlink, fs0[ri0[inodekey(m)]].nsubdirs, n0) ], fi ⊖ fo) \ datakeys (inodekey(m), min(n0, m3), replay-log (log0, fs0[adr1, truncnode(inodekey(m), min(n0, m3))] [adr2, inodenode(inodekey(m), md0, false, fs0[ri0[inodekey(m)]].nlink, fs0[ri0[inodekey(m)]].nsubdirs, n0) ], fi ⊖ fo))) ⊖ inodekey(m) ) = (ri0[inodekey(m), adr2] \ datakeys(inodekey(m), min(n0, m3), ri0[inodekey(m), adr2])) ⊖ ro, m3 ≤ n0 ∧ m3 % VFS_PAGE_SIZE ≠ 0

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Proof step 771:
fs0[ri0[inodekey(m)]].nlink = 0 ∧ m ≠ ROOT_INO ↔ inodekey(m) ∈ ro, replay-log(log0, fs0, fi ⊖ fo) = ri0 ⊖ ro, fs0[ri0[inodekey(m)]].inode?, ro.inodes?, fo.inodes?, file-node-cons(fs0, ri0), log-cons(log0, fs0), orphans-cons(fs0, ri0, ro), replay-safe(log0, fs0, fi ⊖ fo), 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, buf-opt.some? → # buf-opt.buf = VFS_PAGE_SIZE ⊦ adr1 = adr2, m = 0, fs0[ri0[inodekey(m)]].directory, adr2 ∈ fs0, adr1 ∈ fs0, m3 ≤ n0 ∧ m3 % VFS_PAGE_SIZE ≠ 0, replay-safe (log0, fs0[adr1, truncnode(inodekey(m), min(n0, m3))] [adr2, inodenode(inodekey(m), md0, false, fs0[ri0[inodekey(m)]].nlink, fs0[ri0[inodekey(m)]].nsubdirs, n0) ], fi ⊖ fo) ∧ ¬ adr1 ∈ replay-log (log0, fs0[adr1, truncnode(inodekey(m), min(n0, m3))] [adr2, inodenode(inodekey(m), md0, false, fs0[ri0[inodekey(m)]].nlink, fs0[ri0[inodekey(m)]].nsubdirs, n0) ], fi ⊖ fo) ∧ ¬ adr2 ∈ replay-log (log0, fs0[adr1, truncnode(inodekey(m), min(n0, m3))] [adr2, inodenode(inodekey(m), md0, false, fs0[ri0[inodekey(m)]].nlink, fs0[ri0[inodekey(m)]].nsubdirs, n0) ], fi ⊖ fo) \ datakeys (inodekey(m), min(n0, m3), replay-log (log0, fs0[adr1, truncnode(inodekey(m), min(n0, m3))] [adr2, inodenode(inodekey(m), md0, false, fs0[ri0[inodekey(m)]].nlink, fs0[ri0[inodekey(m)]].nsubdirs, n0) ], fi ⊖ fo)) ∧ (fs0[ri0[inodekey(m)]].nlink ≠ 0 ∨ m = ROOT_INO ⊃ ( replay-log (log0, fs0[adr1, truncnode(inodekey(m), min(n0, m3))] [adr2, inodenode(inodekey(m), md0, false, fs0[ri0[inodekey(m)]].nlink, fs0[ri0[inodekey(m)]].nsubdirs, n0) ], fi ⊖ fo) \ datakeys (inodekey(m), min(n0, m3), replay-log (log0, fs0[adr1, truncnode(inodekey(m), min(n0, m3))] [adr2, inodenode(inodekey(m), md0, false, fs0[ri0[inodekey(m)]].nlink, fs0[ri0[inodekey(m)]].nsubdirs, n0) ], fi ⊖ fo)) )[inodekey(m), adr2 ] ; ( replay-log (log0, fs0[adr1, truncnode(inodekey(m), min(n0, m3))] [adr2, inodenode(inodekey(m), md0, false, fs0[ri0[inodekey(m)]].nlink, fs0[ri0[inodekey(m)]].nsubdirs, n0) ], fi ⊖ fo) \ datakeys (inodekey(m), min(n0, m3), replay-log (log0, fs0[adr1, truncnode(inodekey(m), min(n0, m3))] [adr2, inodenode(inodekey(m), md0, false, fs0[ri0[inodekey(m)]].nlink, fs0[ri0[inodekey(m)]].nsubdirs, n0) ], fi ⊖ fo))) ⊖ inodekey(m) ) = (ri0[inodekey(m), adr2] \ datakeys(inodekey(m), min(n0, m3), ri0[inodekey(m), adr2])) ⊖ ro

Rule argument

Additional information

Used simplifier rules: ⊦ replay(log, fs, fi, fo) = replay-log(log, fs, fi ⊖ fo); (s)