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

fs0[ri0[inodekey(m1)]].size = m + 1, 1 = fs0[ri0[inodekey(m0)]].nlink, fs0[ri0[dentrykey(m1, str)]] = dentrynode(key, m0), links(m0, fs0, ri0) = ∅ ++ dentrykey(m1, str), replay-log(log0, fs0, fi ⊖ fo) = ri0 ⊖ ro, fs0[ri0[dentrykey(m1, str)]].dentry?, fs0[ri0[inodekey(m1)]].directory, fs0[ri0[inodekey(m1)]].inode?, 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), 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(m1)] ∈ fs0, inodekey(m1) ∈ ri0, ri0[inodekey(m0)] ∈ fs0, inodekey(m0) ∈ ri0, ri0[dentrykey(m1, str)] ∈ fs0, dentrykey(m1, str) ∈ ri0, fs0[ri0[inodekey(m1)]].nlink ≠ 0 ∨ m1 = ROOT_INO ⊦ adr1 = adr3, adr1 = adr2, adr2 = adr3, m0 = 0, m0 = ROOT_INO, m1 = 0, fs0[ri0[inodekey(m0)]].directory, inodekey(m1) ∈ ro, inodekey(m0) ∈ ro, adr1 ∈ fs0, adr2 ∈ fs0, adr3 ∈ fs0, replay-safe (log0, fs0[adr1, inodenode(inodekey(m1), md0, true, fs0[ri0[inodekey(m1)]].nlink, fs0[ri0[inodekey(m1)]].nsubdirs, m)] [adr2, dentrynode(dentrykey(m1, str), 0) ] [adr3, inodenode(inodekey(m0), md, false, 0, fs0[ri0[inodekey(m0)]].nsubdirs, m2) ], fi ⊖ fo) ∧ ¬ adr1 ∈ replay-log (log0, fs0[adr1, inodenode(inodekey(m1), md0, true, fs0[ri0[inodekey(m1)]].nlink, fs0[ri0[inodekey(m1)]].nsubdirs, m)] [adr2, dentrynode(dentrykey(m1, str), 0) ] [adr3, inodenode(inodekey(m0), md, false, 0, fs0[ri0[inodekey(m0)]].nsubdirs, m2) ], fi ⊖ fo) ∧ ¬ adr2 ∈ replay-log (log0, fs0[adr1, inodenode(inodekey(m1), md0, true, fs0[ri0[inodekey(m1)]].nlink, fs0[ri0[inodekey(m1)]].nsubdirs, m)] [adr2, dentrynode(dentrykey(m1, str), 0) ] [adr3, inodenode(inodekey(m0), md, false, 0, fs0[ri0[inodekey(m0)]].nsubdirs, m2) ], fi ⊖ fo) [inodekey(m1), adr1 ] ∧ ¬ adr3 ∈ replay-log (log0, fs0[adr1, inodenode(inodekey(m1), md0, true, fs0[ri0[inodekey(m1)]].nlink, fs0[ri0[inodekey(m1)]].nsubdirs, m)] [adr2, dentrynode(dentrykey(m1, str), 0) ] [adr3, inodenode(inodekey(m0), md, false, 0, fs0[ri0[inodekey(m0)]].nsubdirs, m2) ], fi ⊖ fo) [inodekey(m1), adr1 ] -- dentrykey(m1, str) ∧ ( replay-log (log0, fs0[adr1, inodenode(inodekey(m1), md0, true, fs0[ri0[inodekey(m1)]].nlink, fs0[ri0[inodekey(m1)]].nsubdirs, m)] [adr2, dentrynode(dentrykey(m1, str), 0) ] [adr3, inodenode(inodekey(m0), md, false, 0, fs0[ri0[inodekey(m0)]].nsubdirs, m2) ], fi ⊖ fo) [inodekey(m1), adr1 ] -- dentrykey(m1, str)) ⊖ inodekey(m0) = (ri0[inodekey(m1), adr1] -- dentrykey(m1, str))[inodekey(m0), adr3] ⊖ (ro ++ inodekey(m0))

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Proof step 98:
fs0[ri0[inodekey(m1)]].size = m + 1, 1 = fs0[ri0[inodekey(m0)]].nlink, fs0[ri0[dentrykey(m1, str)]] = dentrynode(key, m0), links(m0, fs0, ri0) = ∅ ++ dentrykey(m1, str), replay-log(log0, fs0, fi ⊖ fo) = ri0 ⊖ ro, fs0[ri0[inodekey(m1)]].directory, fs0[ri0[inodekey(m0)]].inode?, fs0[ri0[inodekey(m1)]].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), replay-safe(log0, fs0, fi ⊖ fo), ri-cons(ri0, fs0), ri-inj(fi), ri-inj(ri0), ubifs-cons(fs0, ri0, ro, fi, fo, log0), dentrykey(m1, str) ∈ ri0, ri0[dentrykey(m1, str)] ∈ fs0, inodekey(m0) ∈ ri0, ri0[inodekey(m0)] ∈ fs0, inodekey(m1) ∈ ri0, ri0[inodekey(m1)] ∈ fs0, fs0[ri0[inodekey(m1)]].nlink ≠ 0 ∨ m1 = ROOT_INO ⊦ adr1 = adr2, adr1 = adr3, adr2 = adr3, m0 = ROOT_INO, m0 = 0, m1 = 0, fs0[ri0[inodekey(m0)]].directory, adr3 ∈ fs0, adr2 ∈ fs0, adr1 ∈ fs0, inodekey(m0) ∈ ro, inodekey(m1) ∈ ro, replay-safe (log0, fs0[adr1, inodenode(inodekey(m1), md0, true, fs0[ri0[inodekey(m1)]].nlink, fs0[ri0[inodekey(m1)]].nsubdirs, m)] [adr2, dentrynode(dentrykey(m1, str), 0) ] [adr3, inodenode(inodekey(m0), md, false, 0, fs0[ri0[inodekey(m0)]].nsubdirs, m2) ], fi ⊖ fo) ∧ ¬ adr1 ∈ replay-log (log0, fs0[adr1, inodenode(inodekey(m1), md0, true, fs0[ri0[inodekey(m1)]].nlink, fs0[ri0[inodekey(m1)]].nsubdirs, m)] [adr2, dentrynode(dentrykey(m1, str), 0) ] [adr3, inodenode(inodekey(m0), md, false, 0, fs0[ri0[inodekey(m0)]].nsubdirs, m2) ], fi ⊖ fo) ∧ ¬ adr2 ∈ replay-log (log0, fs0[adr1, inodenode(inodekey(m1), md0, true, fs0[ri0[inodekey(m1)]].nlink, fs0[ri0[inodekey(m1)]].nsubdirs, m)] [adr2, dentrynode(dentrykey(m1, str), 0) ] [adr3, inodenode(inodekey(m0), md, false, 0, fs0[ri0[inodekey(m0)]].nsubdirs, m2) ], fi ⊖ fo) [inodekey(m1), adr1 ] ∧ ¬ adr3 ∈ replay-log (log0, fs0[adr1, inodenode(inodekey(m1), md0, true, fs0[ri0[inodekey(m1)]].nlink, fs0[ri0[inodekey(m1)]].nsubdirs, m)] [adr2, dentrynode(dentrykey(m1, str), 0) ] [adr3, inodenode(inodekey(m0), md, false, 0, fs0[ri0[inodekey(m0)]].nsubdirs, m2) ], fi ⊖ fo) [inodekey(m1), adr1 ] -- dentrykey(m1, str) ∧ ( replay-log (log0, fs0[adr1, inodenode(inodekey(m1), md0, true, fs0[ri0[inodekey(m1)]].nlink, fs0[ri0[inodekey(m1)]].nsubdirs, m)] [adr2, dentrynode(dentrykey(m1, str), 0) ] [adr3, inodenode(inodekey(m0), md, false, 0, fs0[ri0[inodekey(m0)]].nsubdirs, m2) ], fi ⊖ fo) [inodekey(m1), adr1 ] -- dentrykey(m1, str)) ⊖ inodekey(m0) = (ri0[inodekey(m1), adr1] -- dentrykey(m1, str))[inodekey(m0), adr3] ⊖ (ro ++ inodekey(m0))

Rule argument

Additional information

Used simplifier rules: ⊦ #(∅ ++ key) = 1; (s)% ⊦ dentrynode(key, m).dentry?; (s)%one-size: ⊦ ks = ∅ ++ key → # ks = 1; (forward) from specification set-basic[node-index]