[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 709 from proof inv-rename-overwrite-keep-parent (previous step)

boolvar1 ↔ boolvar, ¬ fs[ri[inodekey(fs[ri[dentrykey(m, str0)]].ino)]].directory ↔ ¬ fs[ri[inodekey(fs[ri[dentrykey(m, str)]].ino)]].directory, new_child_inode = mkinode (fs[ri[dentrykey(m, str0)]].ino, md1, boolvar2, fs[ri[inodekey(fs[ri[dentrykey(m, str0)]].ino)]].nlink, fs[ri[inodekey(fs[ri[dentrykey(m, str0)]].ino)]].nsubdirs, m6), new_dent = mkdentry(str0, fs[ri[dentrykey(m, str0)]].ino), old_child_inode = mkinode (fs[ri[dentrykey(m, str)]].ino, md0, boolvar, fs[ri[inodekey(fs[ri[dentrykey(m, str)]].ino)]].nlink, fs[ri[inodekey(fs[ri[dentrykey(m, str)]].ino)]].nsubdirs, m3), old_dent = mkdentry(str, fs[ri[dentrykey(m, str)]].ino), parent_inode = mkinode(m, md, true, fs[ri[inodekey(m)]].nlink, fs[ri[inodekey(m)]].nsubdirs, fs[ri[inodekey(m)]].size), fs[ri[dentrykey(m, str)]].dentry?, fs[ri[inodekey(m)]].directory, fs[ri[inodekey(fs[ri[dentrykey(m, str)]].ino)]].inode?, ro.inodes?, fo.inodes?, file-node-cons(fs, ri), log-cons(log, fs), orphans-cons(fs, ri, ro), replay-cons-strong(fs, ri, ro, fi, fo, log), ri-inj(ri), ri-inj(fi), ubifs-cons(fs, ri, ro, fi, fo, log), ri[inodekey(fs[ri[dentrykey(m, str)]].ino)] ∈ fs, ri[dentrykey(m, str)] ∈ fs, inodekey(m) ∈ ri, inodekey(fs[ri[dentrykey(m, str0)]].ino) ∈ ri, dentrykey(m, str0) ∈ ri, inodekey(fs[ri[dentrykey(m, str)]].ino) ∈ ri, dentrykey(m, str) ∈ ri, 1 ≤ fs[ri[inodekey(m)]].size, fs[ri[inodekey(fs[ri[dentrykey(m, str0)]].ino)]].directory → dentrykeys(inodekey(fs[ri[dentrykey(m, str0)]].ino), ri) = ∅, fs[ri[inodekey(fs[ri[dentrykey(m, str0)]].ino)]].nlink = 1 → links(fs[ri[dentrykey(m, str0)]].ino, fs, ri) = ∅ ++ dentrykey(m, str0), boolvar → 1 ≤ fs[ri[inodekey(m)]].nsubdirs, ¬ fs[ri[inodekey(fs[ri[dentrykey(m, str)]].ino)]].directory ∧ ¬ boolvar2 ∨ fs[ri[inodekey(fs[ri[dentrykey(m, str0)]].ino)]].directory ∧ boolvar2 ∧ m6 = fs[ri[inodekey(fs[ri[dentrykey(m, str0)]].ino)]].size, ¬ fs[ri[inodekey(fs[ri[dentrykey(m, str)]].ino)]].directory ∧ ¬ boolvar ∨ fs[ri[inodekey(fs[ri[dentrykey(m, str)]].ino)]].directory ∧ boolvar ∧ m3 = fs[ri[inodekey(fs[ri[dentrykey(m, str)]].ino)]].size, fs[ri[inodekey(m)]].nlink ≠ 0 ∨ m = ROOT_INO ⊦ fs[ri[dentrykey(m, str0)]].ino = ROOT_INO, fs[ri[inodekey(fs[ri[dentrykey(m, str0)]].ino)]].nlink = 0, fs[ri[inodekey(m)]].size = 0, inodekey(m) ∈ ro, pre-rename-overwrite-keep-parent(parent_inode, old_dent, old_child_inode, new_dent, new_child_inode, fs, ri, ro) ∧ (boolvar1 ↔ old_child_inode.directory)

Heuristic simplifier applied rule simplifier

And closed the goal!

Rule argument

Additional information

Used simplifier rules: ⊦ n ≥ m ↔ m ≤ n; (s)% ⊦ {key} = ∅ ++ key; (s)% ⊦ mkinode(m, md, boolvar, m0, m1, m2).size = m2; (s)%⊦ valid-dir-inode(inode, fs, ri) ↔ valid-dir-ino(inode.ino, fs, ri) ∧ (inode.directory ↔ fs[ri[inodekey(inode.ino)]].directory) ∧ inode.nlink = fs[ri[inodekey(inode.ino)]].nlink ∧ inode.nsubdirs = fs[ri[inodekey(inode.ino)]].nsubdirs ∧ inode.size = fs[ri[inodekey(inode.ino)]].size; (s)% ⊦ mkinode(m, md, boolvar, m0, m1, m2).nsubdirs = m1; (s)% ⊦ mkinode(m, md, boolvar, m0, m1, m2).nlink = m0; (s)% ⊦ mkinode(m, md, boolvar, m0, m1, m2).directory ↔ boolvar; (s)%⊦ valid-file-ino(ino, fs, ri) ↔ inodekey(ino) ∈ ri ∧ ¬ fs[ri[inodekey(ino)]].directory; (s)%⊦ valid-file-inode(inode, fs, ri) ↔ valid-file-ino(inode.ino, fs, ri) ∧ (inode.directory ↔ fs[ri[inodekey(inode.ino)]].directory) ∧ inode.nlink = fs[ri[inodekey(inode.ino)]].nlink ∧ inode.nsubdirs = fs[ri[inodekey(inode.ino)]].nsubdirs; (s)%⊦ valid-wb-inode(inode, fs, ri) ↔ valid-file-inode(inode, fs, ri) ∨ valid-dir-inode(inode, fs, ri); (s)% ⊦ mkdentry(str, m).name = str; (s)% ⊦ valid-ino(ino, fs, ri) ↔ inodekey(ino) ∈ ri; (s)% ⊦ mkdentry(str, m).ino = m; (s)%⊦ dentrykey(ino, str) ∈ ri ∧ ubifs-cons(fs, ri, ro, fi, fo, log) → fs[ri[inodekey(ino)]].directory; (ss)%⊦ valid-dir-ino(ino, fs, ri) ↔ inodekey(ino) ∈ ri ∧ fs[ri[inodekey(ino)]].directory; (s)%⊦ valid-parent-ino(ino, fs, ri, ro) ↔ ( valid-dir-ino(ino, fs, ri) ∧ (fs[ri[inodekey(ino)]].nlink ≠ 0 ∨ ino = ROOT_INO)) ∧ ¬ inodekey(ino) ∈ ro; (s)% ⊦ mkdentry(str, m).dentry?; (s)%⊦ valid-dentry(ino, dent, fs, ri, ro) ↔ dent.dentry? ∧ valid-parent-ino(ino, fs, ri, ro) ∧ valid-ino(dent.ino, fs, ri) ∧ dentrykey(ino, dent.name) ∈ ri ∧ fs[ri[dentrykey(ino, dent.name)]].ino = dent.ino; (s)% ⊦ mkinode(m, md, boolvar, m0, m1, m2).ino = m; (s)%⊦ pre-rename-overwrite-keep-parent (parent_inode, old_dent, old_child_inode, new_dent, new_child_inode, fs, ri, ro) ↔ valid-dentry(parent_inode.ino, new_dent, fs, ri, ro) ∧ valid-wb-inode(new_child_inode, fs, ri) ∧ new_child_inode.ino = new_dent.ino ∧ ( valid-file-ino(new_dent.ino, fs, ri) ↔ valid-file-ino(old_dent.ino, fs, ri)) ∧ ( valid-dir-ino(new_dent.ino, fs, ri) → new_dent.ino ≠ ROOT_INO ∧ dentrykeys(inodekey(new_dent.ino), ri) = ∅) ∧ new_child_inode.ino ≠ ROOT_INO ∧ new_child_inode.nlink ≠ 0 ∧ ( new_child_inode.nlink = 1 → links(new_child_inode.ino, fs, ri) = {dentrykey(parent_inode.ino, new_dent.name)} ) ∧ valid-dentry(parent_inode.ino, old_dent, fs, ri, ro) ∧ valid-dir-inode(parent_inode, fs, ri) ∧ valid-wb-inode(old_child_inode, fs, ri) ∧ old_child_inode.ino = old_dent.ino ∧ parent_inode.size ≥ 1 ∧ (old_child_inode.directory → parent_inode.nsubdirs ≥ 1); (s)