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

boolvar ↔ boolvar2, fs0[ri0[dentrykey(m3, str)]] = dentrynode(key1, m), fs0[ri0[inodekey(m3)]] = inodenode(key0, md1, true, m4, m5, m6), adr = adr3, fs = fs0[adr1, dentrynode(dentrykey(m3, str), 0)][adr2, dentrynode(dentrykey(m3, str0), m)][adr3, inodenode(inodekey(m3), md0, true, m4, m5, m6)], key = inodekey(m3), log = ((log0 + adr1 ') + adr2 ') + adr3 ', ri = (ri0 -- dentrykey(m3, str))[dentrykey(m3, str0), adr2], ro = orphans(fs0, ri0), orphans(fs0, ri0).inodes?, fo.inodes?, afs-cons(abs-dirs(fs0, ri0), abs-files(fs0, ri0)), file-node-cons(fs0, ri0), key-cons(key, fs[adr]), log-cons(log0, fs0), orphans-cons(fs0, ri0, orphans(fs0, ri0)), replay-cons-strong(fs0, ri0, orphans(fs0, ri0), fi, fo, log0), ri-inj(ri0), ri-inj(fi), ubifs-cons(fs0, ri0, orphans(fs0, ri0), fi, fo, log0), adr ∈ fs, inodekey(m) ∈ ri0, dentrykey(m3, str) ∈ ri0, inodekey(m3) ∈ ri0, ri0[inodekey(m3)] ∈ fs0, ri0[dentrykey(m3, str)] ∈ fs0, 1 ≤ m6, ¬ adr ∈ ri → adr ∈ fs → adr ∈ fs, boolvar1 → 1 ≤ m5, boolvar3 → boolvar0, m4 ≠ 0 ∨ m3 = ROOT_INO, links(m3, abs-dirs(fs0, ri0)) ≠ ∅ ∨ m3 = ROOT_INO, ¬ 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, 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 ⊦ [ri[key] := adr; new_dent := mkdentry(str0, mkdentry(str, m).ino); old_dent := negdentry(str); old_parent_inode := mkinode (m3, inodenode(inodekey(m3), md0, true, m4, m5, m6).meta, inodenode(inodekey(m3), md0, true, m4, m5, m6).directory, inodenode(inodekey(m3), md0, true, m4, m5, m6).nlink, inodenode(inodekey(m3), md0, true, m4, m5, m6).nsubdirs, inodenode(inodekey(m3), md0, true, m4, m5, m6).size)] ( ubifs-cons (fs0[adr1, dentrynode(dentrykey(m3, str), 0)][adr2, dentrynode(dentrykey(m3, str0), m)] [adr3, inodenode(inodekey(m3), md0, true, m4, m5, m6) ], ri, orphans(fs0, ri0), fi, fo, ((log0 + adr1 ') + adr2 ') + adr3 ') ∧ 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) ], ri, orphans(fs0, ri0), fi, fo, ((log0 + adr1 ') + adr2 ') + adr3 ') ∧ 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) ], ri) ∧ orphans-cons (fs0[adr1, dentrynode(dentrykey(m3, str), 0)][adr2, dentrynode(dentrykey(m3, str0), m)] [adr3, inodenode(inodekey(m3), md0, true, m4, m5, m6) ], ri, orphans(fs0, ri0)) ∧ ri-inj(ri) ∧ 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) ]) ∧ m3 ≠ 0 → ⟪new_parent_inode := old_parent_inode⟫ ⟨old_dent_inode0 := mkinode(m, md, boolvar1, m0, m1, m2); new_dent_inode0 := new_dent_inode; old_dent0 := mkdentry(str, m); old_dent1 := negdentry(str0); old_inode := mkinode(m3, md0, true, m4, m5, m6); old_dent_inode := mkinode(m, md, boolvar1, m0, m1, m2); new_inode := mkinode(m3, md0, true, m4, m5, m6); files := abs-files(fs0, ri0); dirs := abs-dirs(fs0, ri0); 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) ], ri) ∧ 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) ], ri) ∧ 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) ], ri), abs-files (fs0[adr1, dentrynode(dentrykey(m3, str), 0)][adr2, dentrynode(dentrykey(m3, str0), m)] [adr3, inodenode(inodekey(m3), md0, true, m4, m5, m6) ], ri)) = abs-keys(orphans(fs0, ri0)) ∧ (boolvar3 → boolvar2) ∧ old_parent_inode = old_inode ∧ new_parent_inode = new_inode ∧ old_dent_inode0 = old_dent_inode ∧ new_dent_inode0 = new_dent_inode ∧ old_dent = old_dent0 ∧ new_dent = old_dent1 ∧ ESUCCESS = err0)), adr1 = adr2, adr1 = adr3, adr2 = adr3, m6 = 0, adr2 ∈ ri0 -- dentrykey(m3, str), adr3 ∈ fs0, adr2 ∈ fs0, adr1 ∈ fs0, dentrykey(m3, str0) ∈ ri0, adr ∈ ri, m4 = 0 ∧ m3 ≠ ROOT_INO

Heuristic symbolic execution applied rule assign right

And obtained the following new goals

Rule argument

Additional information