[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 808 from proof refine-rename-overwrite-reparent-dir (previous step)

(m5 = m7 ⊃ mkdir(m3, md3, m1, m2, abs-children(m7, fs0, ri0)[str0, m]) ;(m5 = m11 ⊃ mkdir(m13, md4, m4, m16, abs-children(m11, fs0, ri0) -- str);mkdir(m8, md0, m14 + 1, m6, ∅)) ) = mkdir(m10, md7, m9 + 1, m15, entries0), fs0[ri0[inodekey(m)]] = inodenode(key, md6, true, fs0[ri0[inodekey(m)]].nlink, fs0[ri0[inodekey(m)]].nsubdirs, fs0[ri0[inodekey(m)]].size), fs0[ri0[inodekey(m11)]] = inodenode(key2, md4, true, m4, m16 + 1, m13 + 1), fs0[ri0[dentrykey(m7, str0)]] = dentrynode(key0, m5), fs0[ri0[dentrykey(m11, str)]] = dentrynode(key4, m), fs0[ri0[inodekey(m7)]] = inodenode(key1, md3, true, m1, m2, m3), fs0[ri0[inodekey(m5)]] = inodenode(key5, md0, true, m14 + 1, m6, m8), abs-children(m5, fs0, ri0) = ∅, dentrykeys(inodekey(m5), ri0) = ∅, dirs = abs-dirs(fs0, ri0)[m5, mkdir(m10, md7, m9, m15, entries0)] [m11, (m11 = m5 ⊃ mkdir(m10, md7, m9, m15, entries0);mkdir(m13, md4, m4, m16, abs-children(m11, fs0, ri0) -- str)).meta:= md2 ] [m7, (m7 = m5 ⊃ mkdir(m10, md7, m9, m15, entries0);mkdir(m3, md3, m1, m2, abs-children(m7, fs0, ri0)[str0, m])).meta:= md1 ], files = abs-files(fs0, ri0), adr1 ≠ adr2, adr1 ≠ adr3, adr1 ≠ adr4, adr1 ≠ adr5, adr2 ≠ adr3, adr2 ≠ adr4, adr2 ≠ adr5, adr3 ≠ adr4, adr3 ≠ adr5, adr4 ≠ adr5, m11 ≠ m7, m11 ≠ 0, m14 ≠ 0, m5 ≠ ROOT_INO, m5 ≠ 0, m7 ≠ 0, fs0[ri0[inodekey(m)]].directory, 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(m11, str), 0)][adr2, dentrynode(dentrykey(m7, str0), m)][adr3, inodenode(inodekey(m11), md2, true, m4, m16, m13)] [adr4, inodenode(inodekey(m7), md1, true, m1, m2, m3) ] [adr5, inodenode(inodekey(m5), md, true, m14, m6, m8) ], (ri0 -- dentrykey(m11, str))[dentrykey(m7, str0), adr2][inodekey(m11), adr3][inodekey(m7), adr4][inodekey(m5), adr5]), log-cons (log0, fs0[adr1, dentrynode(dentrykey(m11, str), 0)][adr2, dentrynode(dentrykey(m7, str0), m)][adr3, inodenode(inodekey(m11), md2, true, m4, m16, m13)] [adr4, inodenode(inodekey(m7), md1, true, m1, m2, m3) ] [adr5, inodenode(inodekey(m5), md, true, m14, m6, m8) ]), log-cons(log0, fs0), orphans-cons(fs0, ri0, orphans(fs0, ri0)), orphans-cons (fs0[adr1, dentrynode(dentrykey(m11, str), 0)][adr2, dentrynode(dentrykey(m7, str0), m)][adr3, inodenode(inodekey(m11), md2, true, m4, m16, m13)] [adr4, inodenode(inodekey(m7), md1, true, m1, m2, m3) ] [adr5, inodenode(inodekey(m5), md, true, m14, m6, m8) ], (ri0 -- dentrykey(m11, str))[dentrykey(m7, str0), adr2][inodekey(m11), adr3][inodekey(m7), adr4][inodekey(m5), adr5], orphans(fs0, ri0)), replay-cons-strong (fs0[adr1, dentrynode(dentrykey(m11, str), 0)][adr2, dentrynode(dentrykey(m7, str0), m)][adr3, inodenode(inodekey(m11), md2, true, m4, m16, m13)] [adr4, inodenode(inodekey(m7), md1, true, m1, m2, m3) ] [adr5, inodenode(inodekey(m5), md, true, m14, m6, m8) ], (ri0 -- dentrykey(m11, str))[dentrykey(m7, str0), adr2][inodekey(m11), adr3][inodekey(m7), adr4][inodekey(m5), adr5], orphans(fs0, ri0), fi, fo, ((((log0 + adr1 ') + adr2 ') + adr3 ') + adr4 ') + adr5 '), replay-cons-strong(fs0, ri0, orphans(fs0, ri0), fi, fo, log0), ri-cons(ri0, fs0), ri-inj((ri0 -- dentrykey(m11, str))[dentrykey(m7, str0), adr2][inodekey(m11), adr3][inodekey(m7), adr4][inodekey(m5), adr5]), ri-inj(fi), ri-inj(ri0), ubifs-cons (fs0[adr1, dentrynode(dentrykey(m11, str), 0)][adr2, dentrynode(dentrykey(m7, str0), m)][adr3, inodenode(inodekey(m11), md2, true, m4, m16, m13)] [adr4, inodenode(inodekey(m7), md1, true, m1, m2, m3) ] [adr5, inodenode(inodekey(m5), md, true, m14, m6, m8) ], (ri0 -- dentrykey(m11, str))[dentrykey(m7, str0), adr2][inodekey(m11), adr3][inodekey(m7), adr4][inodekey(m5), adr5], orphans(fs0, ri0), fi, fo, ((((log0 + adr1 ') + adr2 ') + adr3 ') + adr4 ') + adr5 '), ubifs-cons(fs0, ri0, orphans(fs0, ri0), fi, fo, log0), ri0[dentrykey(m11, str)] ∈ fs0, ri0[inodekey(m11)] ∈ fs0, ri0[inodekey(m7)] ∈ fs0, ri0[dentrykey(m7, str0)] ∈ fs0, inodekey(m11) ∈ ri0, inodekey(m7) ∈ ri0, dentrykey(m11, str) ∈ ri0, dentrykey(m7, str0) ∈ ri0, ri0[inodekey(m)] ∈ fs0, inodekey(m) ∈ ri0, ri0[inodekey(m5)] ∈ fs0, inodekey(m5) ∈ ri0, ¬ adr4 ∈ (ri0 -- dentrykey(m11, str))[dentrykey(m7, str0), adr2][inodekey(m11), adr3], ¬ adr2 ∈ ri0 -- dentrykey(m11, str), ¬ adr5 ∈ fs0, ¬ adr4 ∈ fs0, ¬ adr3 ∈ fs0, ¬ adr2 ∈ fs0, ¬ adr1 ∈ fs0, ¬ adr3 ∈ (ri0 -- dentrykey(m11, str))[dentrykey(m7, str0), adr2], ¬ adr5 ∈ (ri0 -- dentrykey(m11, str))[dentrykey(m7, str0), adr2][inodekey(m11), adr3][inodekey(m7), adr4], boolvar2 → boolvar3, m4 ≠ 0 ∨ m11 = ROOT_INO, m1 ≠ 0 ∨ m7 = ROOT_INO, links(m11, abs-dirs(fs0, ri0)) ≠ ∅ ∨ m11 = ROOT_INO, links(m7, abs-dirs(fs0, ri0)) ≠ ∅ ∨ m7 = ROOT_INO ⊦ ⟨afs_inode_sync#(mkinode(m5, md, true, m14 + 1, m6, m8); dirs, files); new_child_inode := (m5 ∈ dirs ⊃ mkinode(m5, dirs[m5].meta, true, dirs[m5].nlink, dirs[m5].nsubdirs, dirs[m5].size) ;mkinode(m5, files[m5].meta, false, files[m5].nlink, 0, files[m5].size) ); old_inode := (m11 ∈ dirs ⊃ mkinode(m11, dirs[m11].meta, true, dirs[m11].nlink, dirs[m11].nsubdirs, dirs[m11].size) ;mkinode(m11, files[m11].meta, false, files[m11].nlink, 0, files[m11].size) ); new_inode := (m7 ∈ dirs ⊃ mkinode(m7, dirs[m7].meta, true, dirs[m7].nlink, dirs[m7].nsubdirs, dirs[m7].size) ;mkinode(m7, files[m7].meta, false, files[m7].nlink, 0, files[m7].size) ); err := ESUCCESS; asynced := ?⟩ ( afs-cons(dirs, files) → dirs = abs-dirs (fs0[adr1, dentrynode(dentrykey(m11, str), 0)][adr2, dentrynode(dentrykey(m7, str0), m)] [adr3, inodenode(inodekey(m11), md2, true, m4, m16, m13) ] [adr4, inodenode(inodekey(m7), md1, true, m1, m2, m3) ] [adr5, inodenode(inodekey(m5), md, true, m14, m6, m8) ], (ri0 -- dentrykey(m11, str))[dentrykey(m7, str0), adr2][inodekey(m11), adr3][inodekey(m7), adr4][inodekey(m5), adr5]) ∧ files = abs-files (fs0[adr1, dentrynode(dentrykey(m11, str), 0)][adr2, dentrynode(dentrykey(m7, str0), m)] [adr3, inodenode(inodekey(m11), md2, true, m4, m16, m13) ] [adr4, inodenode(inodekey(m7), md1, true, m1, m2, m3) ] [adr5, inodenode(inodekey(m5), md, true, m14, m6, m8) ], (ri0 -- dentrykey(m11, str))[dentrykey(m7, str0), adr2][inodekey(m11), adr3][inodekey(m7), adr4][inodekey(m5), adr5]) ∧ orphans (fs0[adr1, dentrynode(dentrykey(m11, str), 0)][adr2, dentrynode(dentrykey(m7, str0), m)] [adr3, inodenode(inodekey(m11), md2, true, m4, m16, m13) ] [adr4, inodenode(inodekey(m7), md1, true, m1, m2, m3) ] [adr5, inodenode(inodekey(m5), md, true, m14, m6, m8) ], (ri0 -- dentrykey(m11, str))[dentrykey(m7, str0), adr2][inodekey(m11), adr3][inodekey(m7), adr4][inodekey(m5), adr5]) = orphans(fs0, ri0) ∧ (asynced → boolvar1) ∧ mkinode(m11, md2, true, m4, m16, m13) = old_inode ∧ mkinode(m7, md1, true, m1, m2, m3) = new_inode ∧ mkinode(m5, md, true, m14, m6, m8) = new_child_inode ∧ ESUCCESS = err), m1 = 0 ∧ m7 ≠ ROOT_INO, m4 = 0 ∧ m11 ≠ ROOT_INO

Heuristic unfold applied rule call right

And obtained the following new goals

Rule argument

pos: right 1

Additional information

Used simplifier rules: afs_inode_sync#(INODE; DIRS, FILES) {let INO = INODE.ino in if INO ∈ FILES then {FILES[INO].size := INODE.size; FILES[INO].meta := INODE.meta} else if INO ∈ DIRS then DIRS[INO].meta := INODE.meta };