Proof step 509 from proof refine-rename-overwrite-keep-parent-identity (previous step)

Heuristic elimination applied rule insert elim lemma

And obtained the following new goals

• Proof step 510:

  fs[ri[dentrykey(m6, str)]] = dentrynode(key, m), dirs = abs-dirs(fs, ri), files = abs-files(fs, ri), new_dent_inode = mkinode(m, md, boolvar3, m0, m1, m2), new_inode = mkinode(m6, md1, true, fs[ri[inodekey(m6)]].nlink, fs[ri[inodekey(m6)]].nsubdirs, fs[ri[inodekey(m6)]].size), old_dent1 = mkdentry(str, m), old_dent2 = mkdentry(str, m), old_dent_inode = mkinode(m, md0, boolvar2, m3, m4, m5), old_inode = mkinode(m6, md1, true, fs[ri[inodekey(m6)]].nlink, fs[ri[inodekey(m6)]].nsubdirs, fs[ri[inodekey(m6)]].size), fs[ri[dentrykey(m6, str)]].dentry?, fs[ri[inodekey(m6)]].directory, fs[ri[inodekey(m6)]].inode?, orphans(fs, ri).inodes?, fo.inodes?, afs-cons(abs-dirs(fs, ri), abs-files(fs, ri)), file-node-cons(fs, ri), log-cons(log, fs), orphans-cons(fs, ri, orphans(fs, ri)), replay-cons-strong(fs, ri, orphans(fs, ri), fi, fo, log), ri-cons(ri, fs), ri-inj(ri), ri-inj(fi), ubifs-cons(fs, ri, orphans(fs, ri), fi, fo, log), inodekey(m6) ∈ ri, ri[inodekey(m6)] ∈ fs, inodekey(m) ∈ ri, ri[dentrykey(m6, str)] ∈ fs, dentrykey(m6, str) ∈ ri, 1 ≤ fs[ri[inodekey(m6)]].size, ⌊err0⌋ , boolvar2 → 1 ≤ fs[ri[inodekey(m6)]].nsubdirs, m0 = 1 → links(m, fs, ri) = ∅ ++ dentrykey(m6, str), boolvar4 → boolvar1, fs[ri[inodekey(m)]].directory → abs-children(m, fs, ri) = ∅, fs[ri[inodekey(m)]].directory → dentrykeys(inodekey(m), ri) = ∅, fs[ri[inodekey(m6)]].nlink ≠ 0 ∨ m6 = ROOT_INO, links(m6, abs-dirs(fs, ri)) ≠ ∅ ∨ m6 = ROOT_INO, ¬ fs[ri[inodekey(m)]].directory ∧ ¬ boolvar2 ∧ m3 = fs[ri[inodekey(m)]].nlink ∧ m4 = fs[ri[inodekey(m)]].nsubdirs ∨ fs[ri[inodekey(m)]].directory ∧ boolvar2 ∧ m3 = fs[ri[inodekey(m)]].nlink ∧ m4 = fs[ri[inodekey(m)]].nsubdirs ∧ m5 = fs[ri[inodekey(m)]].size, ¬ fs[ri[inodekey(m)]].directory ∧ ¬ boolvar3 ∧ m0 = fs[ri[inodekey(m)]].nlink ∧ m1 = fs[ri[inodekey(m)]].nsubdirs ∨ fs[ri[inodekey(m)]].directory ∧ boolvar3 ∧ m0 = fs[ri[inodekey(m)]].nlink ∧ m1 = fs[ri[inodekey(m)]].nsubdirs ∧ m2 = fs[ri[inodekey(m)]].size, fs[ri[inodekey(m)]].directory ∧ m3 = fs[ri[inodekey(m)]].nlink ∧ m5 = fs[ri[inodekey(m)]].size ∧ m4 = fs[ri[inodekey(m)]].nsubdirs ∧ boolvar2 ∨ ¬ fs[ri[inodekey(m)]].directory ∧ m3 = fs[ri[inodekey(m)]].nlink ∧ m4 = 0 ∧ ¬ boolvar2, fs[ri[inodekey(m)]].directory ∧ m0 = fs[ri[inodekey(m)]].nlink ∧ m2 = fs[ri[inodekey(m)]].size ∧ m1 = fs[ri[inodekey(m)]].nsubdirs ∧ boolvar3 ∨ ¬ fs[ri[inodekey(m)]].directory ∧ m0 = fs[ri[inodekey(m)]].nlink ∧ m1 = 0 ∧ ¬ boolvar3 ⊦ ⟨afs_rename#(; old_inode, new_inode, old_dent_inode, new_dent_inode, old_dent1, old_dent2, err1, dirs, files; boolvar4)⟩ ( dirs = abs-dirs(fs, ri) ∧ files = abs-files(fs, ri) ∧ (boolvar4 → boolvar0) ∧ mkinode(m6, md1, true, fs[ri[inodekey(m6)]].nlink, fs[ri[inodekey(m6)]].nsubdirs, fs[ri[inodekey(m6)]].size) = old_inode ∧ mkinode(m6, md1, true, fs[ri[inodekey(m6)]].nlink, fs[ri[inodekey(m6)]].nsubdirs, fs[ri[inodekey(m6)]].size) = new_inode ∧ mkinode(m, md0, boolvar2, m3, m4, m5) = old_dent_inode ∧ mkinode(m, md, boolvar3, m0, m1, m2) = new_dent_inode ∧ mkdentry(str, m) = old_dent1 ∧ mkdentry(str, m) = old_dent2 ∧ err0 = err1), fs[ri[inodekey(m6)]].size = 0, m = ROOT_INO, m = 0, m0 = 0, m6 = 0, fs[ri[inodekey(m6)]].nlink = 0 ∧ m6 ≠ ROOT_INO

Rule argument

Additional information

Used simplifier rules: ⊦ nd.dentry? → (key = nd.key ∧ m = nd.ino ↔ nd = dentrynode(key, m)); (elim) Used terms: fs[ri[dentrykey(m6, str)]], key, m