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

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

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: at-fs: ⊦ fs[adr0, nd][adr1] = (adr0 = adr1 ⊃ nd;fs[adr1]);% ⊦ log-cons(log, fs) ∧ adr ∈ log → node-cons(fs[adr].key, fs[adr]); (ss)% ⊦ adr ∈ fs ∧ ¬ adr0 ∈ fs → fs[adr0, nd][adr] = fs[adr]; (s)% ⊦ log-cons(log, fs) ∧ adr ∈ log → adr ∈ fs; (ss)%⊦ log-cons(log, fs) → ( log-cons(log0, fs0) ↔ (∀ adr. (adr ∈ log → adr ∈ fs ∧ node-cons(fs[adr].key, fs[adr])) → adr ∈ log0 → adr ∈ fs0 ∧ node-cons(fs0[adr].key, fs0[adr]))); (ss)% ⊦ dentrykey(m, str).dentry?; (s)% ⊦ node-cons(key0, dentrynode(key1, ino)) ↔ key0.dentry?; (s)%a: ⊦ (ax + ax0) + ax1 = ax + ax0 + ax1; from specification list[address-list-set]% ⊦ inodekey(m).ino = m; (s)% ⊦ inodekey(m).inode?; (s)%⊦ node-cons(key0, inodenode(key1, md, boolvar, n, n0, m)) ↔ key0.inode? ∧ key0.ino ≠ 0; (s)% ⊦ inodenode(key, md, boolvar, m, m0, m1).key = key; (s)% ⊦ adr ∈ fs[adr1, nd] ↔ adr = adr1 ∨ adr ∈ fs; (s)% ⊦ log-cons(adr ', fs) ↔ adr ∈ fs ∧ node-cons(fs[adr].key, fs[adr]); (s)% ⊦ log-cons(log0 + log1, fs) ↔ log-cons(log0, fs) ∧ log-cons(log1, fs); (s)% ⊦ adr ≠ adr0 → (adr ∈ fs[adr0, nd] ↔ adr ∈ fs); (s)% ⊦ dentrynode(key, m).key = key; (s)