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

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

Heuristic elimination applied rule insert elim lemma

And obtained the following new goals

Rule argument

spec: node name: elim-03 seq: ⊦ nd.inode? → ( ( ( ( (key = nd.key ∧ md = nd.meta) ∧ (boolvar ↔ nd.directory)) ∧ m = nd.nlink) ∧ m0 = nd.nsubdirs) ∧ m1 = nd.size ↔ nd = inodenode(key, md, boolvar, m, m0, m1)) subst: [nd, key, md, boolvar, m, m0, m1] → [fs0[ri0[inodekey(m)]], key, md, boolvar, m0, m1, m2]

Additional information

Used simplifier rules: ⊦ nd.inode? → ( ( ( ( (key = nd.key ∧ md = nd.meta) ∧ (boolvar ↔ nd.directory)) ∧ m = nd.nlink) ∧ m0 = nd.nsubdirs) ∧ m1 = nd.size ↔ nd = inodenode(key, md, boolvar, m, m0, m1)); (elim) Used terms: fs0[ri0[inodekey(m)]], key, md, boolvar, m0, m1, m2