[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 90 from proof refine-rename-overwrite-keep-parent-identity (previous step)

fs0[ri0[dentrykey(m6, str)]] = dentrynode(key1, m), fs0[ri0[inodekey(m6)]] = inodenode(key0, md2, true, m7, m8, m9), dirs = abs-dirs(fs0, ri0), files = abs-files(fs0, ri0), new_dent_inode = mkinode(m, md, boolvar3, m0, m1, m2), new_inode = mkinode(m6, md1, true, m7, m8, m9), 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, m7, m8, m9), adr1 ≠ adr4, adr1 ≠ adr3, adr1 ≠ adr2, adr2 ≠ adr4, adr2 ≠ adr3, adr3 ≠ adr4, m ≠ 0, m ≠ ROOT_INO, m0 ≠ 0, m6 ≠ 0, m9 ≠ 0, fo.inodes?, orphans(fs0, ri0).inodes?, afs-cons(abs-dirs(fs0, ri0), abs-files(fs0, ri0)), file-node-cons(fs0, ri0), file-node-cons (fs0[adr1, dentrynode(dentrykey(m6, str), 0)][adr2, dentrynode(dentrykey(m6, str), m)][adr3, inodenode(inodekey(m6), md1, true, m7, m8, m9)] [adr4, inodenode(inodekey(m), md, boolvar3, m0, m1, m2) ], ri0[dentrykey(m6, str), adr2][inodekey(m6), adr3][inodekey(m), adr4]), log-cons(log0, fs0), log-cons (log0, fs0[adr1, dentrynode(dentrykey(m6, str), 0)][adr2, dentrynode(dentrykey(m6, str), m)][adr3, inodenode(inodekey(m6), md1, true, m7, m8, m9)] [adr4, inodenode(inodekey(m), md, boolvar3, m0, m1, m2) ]), orphans-cons(fs0, ri0, orphans(fs0, ri0)), orphans-cons (fs0[adr1, dentrynode(dentrykey(m6, str), 0)][adr2, dentrynode(dentrykey(m6, str), m)][adr3, inodenode(inodekey(m6), md1, true, m7, m8, m9)] [adr4, inodenode(inodekey(m), md, boolvar3, m0, m1, m2) ], ri0[dentrykey(m6, str), adr2][inodekey(m6), adr3][inodekey(m), adr4], orphans(fs0, ri0)), replay-cons-strong(fs0, ri0, orphans(fs0, ri0), fi, fo, log0), replay-cons-strong (fs0[adr1, dentrynode(dentrykey(m6, str), 0)][adr2, dentrynode(dentrykey(m6, str), m)][adr3, inodenode(inodekey(m6), md1, true, m7, m8, m9)] [adr4, inodenode(inodekey(m), md, boolvar3, m0, m1, m2) ], ri0[dentrykey(m6, str), adr2][inodekey(m6), adr3][inodekey(m), adr4], orphans(fs0, ri0), fi, fo, (((log0 + adr1 ') + adr2 ') + adr3 ') + adr4 '), ri-cons(ri0, fs0), ri-inj(fi), ri-inj(ri0), ri-inj(ri0[dentrykey(m6, str), adr2][inodekey(m6), adr3][inodekey(m), adr4]), ubifs-cons(fs0, ri0, orphans(fs0, ri0), fi, fo, log0), ubifs-cons (fs0[adr1, dentrynode(dentrykey(m6, str), 0)][adr2, dentrynode(dentrykey(m6, str), m)][adr3, inodenode(inodekey(m6), md1, true, m7, m8, m9)] [adr4, inodenode(inodekey(m), md, boolvar3, m0, m1, m2) ], ri0[dentrykey(m6, str), adr2][inodekey(m6), adr3][inodekey(m), adr4], orphans(fs0, ri0), fi, fo, (((log0 + adr1 ') + adr2 ') + adr3 ') + adr4 '), dentrykey(m6, str) ∈ ri0, inodekey(m) ∈ ri0, inodekey(m6) ∈ ri0, ri0[dentrykey(m6, str)] ∈ fs0, ri0[inodekey(m6)] ∈ fs0, 1 ≤ m9, ¬ adr1 ∈ fs0, ¬ adr2 ∈ fs0, ¬ adr3 ∈ fs0, ¬ adr4 ∈ fs0, ¬ adr2 ∈ ri0 -- dentrykey(m6, str), fs0[ri0[inodekey(m)]].directory → dentrykeys(inodekey(m), ri0) = ∅, fs0[ri0[inodekey(m)]].directory → abs-children(m, fs0, ri0) = ∅, boolvar4 → boolvar1, m0 = 1 → links(m, fs0, ri0) = ∅ ++ dentrykey(m6, str), boolvar2 → 1 ≤ m8, fs0[ri0[inodekey(m)]].directory ∧ m0 = fs0[ri0[inodekey(m)]].nlink ∧ m2 = fs0[ri0[inodekey(m)]].size ∧ m1 = fs0[ri0[inodekey(m)]].nsubdirs ∧ boolvar3 ∨ ¬ fs0[ri0[inodekey(m)]].directory ∧ m0 = fs0[ri0[inodekey(m)]].nlink ∧ m1 = 0 ∧ ¬ boolvar3, fs0[ri0[inodekey(m)]].directory ∧ m3 = fs0[ri0[inodekey(m)]].nlink ∧ m5 = fs0[ri0[inodekey(m)]].size ∧ m4 = fs0[ri0[inodekey(m)]].nsubdirs ∧ boolvar2 ∨ ¬ fs0[ri0[inodekey(m)]].directory ∧ m3 = fs0[ri0[inodekey(m)]].nlink ∧ m4 = 0 ∧ ¬ boolvar2, ¬ fs0[ri0[inodekey(m)]].directory ∧ ¬ boolvar3 ∧ m0 = fs0[ri0[inodekey(m)]].nlink ∧ m1 = fs0[ri0[inodekey(m)]].nsubdirs ∨ fs0[ri0[inodekey(m)]].directory ∧ boolvar3 ∧ m0 = fs0[ri0[inodekey(m)]].nlink ∧ m1 = fs0[ri0[inodekey(m)]].nsubdirs ∧ m2 = fs0[ri0[inodekey(m)]].size, ¬ fs0[ri0[inodekey(m)]].directory ∧ ¬ boolvar2 ∧ m3 = fs0[ri0[inodekey(m)]].nlink ∧ m4 = fs0[ri0[inodekey(m)]].nsubdirs ∨ fs0[ri0[inodekey(m)]].directory ∧ boolvar2 ∧ m3 = fs0[ri0[inodekey(m)]].nlink ∧ m4 = fs0[ri0[inodekey(m)]].nsubdirs ∧ m5 = fs0[ri0[inodekey(m)]].size, links(m6, abs-dirs(fs0, ri0)) ≠ ∅ ∨ m6 = ROOT_INO, m7 ≠ 0 ∨ m6 = ROOT_INO ⊦ ⟨afs_rename#(; old_inode, new_inode, old_dent_inode, new_dent_inode, old_dent1, old_dent2, err0, dirs, files; boolvar4)⟩ ( dirs = abs-dirs (fs0[adr1, dentrynode(dentrykey(m6, str), 0)][adr2, dentrynode(dentrykey(m6, str), m)][adr3, inodenode(inodekey(m6), md1, true, m7, m8, m9)] [adr4, inodenode(inodekey(m), md, boolvar3, m0, m1, m2) ], ri0[dentrykey(m6, str), adr2][inodekey(m6), adr3][inodekey(m), adr4]) ∧ files = abs-files (fs0[adr1, dentrynode(dentrykey(m6, str), 0)][adr2, dentrynode(dentrykey(m6, str), m)][adr3, inodenode(inodekey(m6), md1, true, m7, m8, m9)] [adr4, inodenode(inodekey(m), md, boolvar3, m0, m1, m2) ], ri0[dentrykey(m6, str), adr2][inodekey(m6), adr3][inodekey(m), adr4]) ∧ orphans (abs-dirs (fs0[adr1, dentrynode(dentrykey(m6, str), 0)][adr2, dentrynode(dentrykey(m6, str), m)] [adr3, inodenode(inodekey(m6), md1, true, m7, m8, m9) ] [adr4, inodenode(inodekey(m), md, boolvar3, m0, m1, m2) ], ri0[dentrykey(m6, str), adr2][inodekey(m6), adr3][inodekey(m), adr4]), abs-files (fs0[adr1, dentrynode(dentrykey(m6, str), 0)][adr2, dentrynode(dentrykey(m6, str), m)] [adr3, inodenode(inodekey(m6), md1, true, m7, m8, m9) ] [adr4, inodenode(inodekey(m), md, boolvar3, m0, m1, m2) ], ri0[dentrykey(m6, str), adr2][inodekey(m6), adr3][inodekey(m), adr4])) = abs-keys(orphans(fs0, ri0)) ∧ (boolvar4 → boolvar0) ∧ mkinode(m6, md1, true, m7, m8, m9) = old_inode ∧ mkinode(m6, md1, true, m7, m8, m9) = new_inode ∧ mkinode(m, md0, boolvar2, m3, m4, m5) = old_dent_inode ∧ mkinode(m, md, boolvar3, m0, m1, m2) = new_dent_inode ∧ negdentry(str) = old_dent1 ∧ mkdentry(str, m) = old_dent2 ∧ ESUCCESS = err0), m7 = 0 ∧ m6 ≠ ROOT_INO

User applied rule insert program lemma

And obtained the following new goals

Rule argument

spec: afs-asm name: inv-renam seq: afs-cons(dirs, files), pre-rename (old_parent_inode, old_dent, old_child_inode, new_parent_inode, new_dent, new_child_inode, dirs, files) ⊦ ⟪afs_rename# (; old_parent_inode, new_parent_inode, old_child_inode, new_child_inode, old_dent, new_dent, err, dirs, files ; asynced)⟫ afs-cons(dirs, files) subst: [files, dirs, err, new_dent, old_dent, new_child_inode, old_child_inode, new_parent_inode, old_parent_inode, asynced] → [files, dirs, err0, old_dent2, old_dent1, new_dent_inode, old_dent_inode, new_inode, old_inode, boolvar4] flags: List([[1,0,0]])

Additional information