[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 71 from proof refine-rename-new-keep-parent (previous step)

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

Additional information