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

m14 + 1 = fs[ri[inodekey(fs[ri[dentrykey(m7, str0)]].ino)]].nlink, m13 + 1 = fs[ri[inodekey(m11)]].size, m16 + 1 = fs[ri[inodekey(m11)]].nsubdirs, boolvar0 ↔ mkdentry(str0, fs[ri[dentrykey(m7, str0)]].ino).dentry?, boolvar ↔ old_ino = new_ino ∧ mkdentry(str0, fs[ri[dentrykey(m7, str0)]].ino) = mkdentry(str, fs[ri[dentrykey(m11, str)]].ino), abs-children(fs[ri[dentrykey(m7, str0)]].ino, fs, ri) = ∅, dentrykeys(inodekey(fs[ri[dentrykey(m7, str0)]].ino), ri) = ∅, dirs = abs-dirs(fs, ri) [old_ino, abs-dirs(fs, ri)[old_ino].entries:= (abs-dirs(fs, ri)[old_ino].entries -- mkdentry(str, fs[ri[dentrykey(m11, str)]].ino).name) ], new_ino = mkinode(m7, md1, true, fs[ri[inodekey(m7)]].nlink, fs[ri[inodekey(m7)]].nsubdirs, fs[ri[inodekey(m7)]].size).ino, old_ino = mkinode(m11, md2, true, fs[ri[inodekey(m11)]].nlink, m16 + 1, m13 + 1).ino, fs[ri[dentrykey(m7, str0)]].dentry?, fs[ri[dentrykey(m11, str)]].dentry?, fs[ri[inodekey(fs[ri[dentrykey(m11, str)]].ino)]].directory, fs[ri[inodekey(m7)]].directory, fs[ri[inodekey(fs[ri[dentrykey(m7, str0)]].ino)]].directory, fs[ri[inodekey(m11)]].directory, fs[ri[inodekey(m7)]].inode?, fs[ri[inodekey(m11)]].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), ri[dentrykey(m7, str0)] ∈ fs, ri[inodekey(m7)] ∈ fs, ri[inodekey(m11)] ∈ fs, inodekey(m11) ∈ ri, inodekey(m7) ∈ ri, dentrykey(m7, str0) ∈ ri, inodekey(fs[ri[dentrykey(m7, str0)]].ino) ∈ ri, inodekey(fs[ri[dentrykey(m11, str)]].ino) ∈ ri, ri[dentrykey(m11, str)] ∈ fs, dentrykey(m11, str) ∈ ri, m14 = 0 → links(fs[ri[dentrykey(m7, str0)]].ino, fs, ri) = ∅ ++ dentrykey(m7, str0), boolvar2 → boolvar3, old_ino = new_ino → (fs[ri[dentrykey(m7, str0)]].dentry? ∧ ri[dentrykey(m7, str0)] ∈ fs ∧ dentrykey(m7, str0) ∈ ri) ∧ fs[ri[dentrykey(m11, str)]].dentry? ∧ ri[dentrykey(m11, str)] ∈ fs ∧ dentrykey(m11, str) ∈ ri, ∀ adr, adr0, adr1, adr2, adr3. adr ∈ fs ∨ adr0 ∈ fs ∨ adr1 ∈ fs ∨ adr2 ∈ fs ∨ adr3 ∈ fs ∨ adr = adr0 ∨ adr = adr1 ∨ adr = adr2 ∨ adr = adr3 ∨ adr0 = adr1 ∨ adr0 = adr2 ∨ adr0 = adr3 ∨ adr1 = adr2 ∨ adr1 = adr3 ∨ adr2 = adr3, fs[ri[inodekey(m7)]].trunc? ∨ fs[ri[inodekey(m7)]].inode?, links(m7, abs-dirs(fs, ri)) ≠ ∅ ∨ m7 = ROOT_INO, links(m11, abs-dirs(fs, ri)) ≠ ∅ ∨ m11 = ROOT_INO, fs[ri[inodekey(m7)]].nlink ≠ 0 ∨ m7 = ROOT_INO, fs[ri[inodekey(m11)]].nlink ≠ 0 ∨ m11 = ROOT_INO ⊦ ⟨old_dent := mkdentry(str, fs[ri[dentrykey(m11, str)]].ino); if ¬ boolvar then {dirs[old_ino].size := dirs[old_ino].size - 1; if old_dent.ino ∈ dirs then dirs[old_ino].nsubdirs := dirs[old_ino].nsubdirs - 1}; dirs[new_ino].entries[mkdentry(str0, fs[ri[dentrykey(m7, str0)]].ino).name] := old_dent.ino; new_dent := mkdentry(str0, fs[ri[dentrykey(m7, str0)]].ino); files := abs-files(fs, ri); if boolvar0 ∧ ¬ boolvar then let ino = new_dent.ino in afs_drop_nlink#(ino; dirs, files); if ¬ boolvar0 then {dirs[new_ino].size := dirs[new_ino].size + 1; if old_dent.ino ∈ dirs then dirs[new_ino].nsubdirs := dirs[new_ino].nsubdirs + 1}; new_dent := mkdentry(new_dent.name, old_dent.ino); old_dent := negdentry(old_dent.name); afs_inode_sync#(mkinode(m11, md2, true, fs[ri[inodekey(m11)]].nlink, m16 + 1, m13 + 1); dirs, files); afs_inode_sync#(mkinode(m7, md1, true, fs[ri[inodekey(m7)]].nlink, fs[ri[inodekey(m7)]].nsubdirs, fs[ri[inodekey(m7)]].size); dirs, files); new_child_inode := mkinode (fs[ri[dentrykey(m7, str0)]].ino, md0, true, m14 + 1, fs[ri[inodekey(fs[ri[dentrykey(m7, str0)]].ino)]].nsubdirs, fs[ri[inodekey(fs[ri[dentrykey(m7, str0)]].ino)]].size); if boolvar0 then {afs_inode_sync#(new_child_inode; dirs, files); new_child_inode := (new_child_inode.ino ∈ dirs ⊃ mkinode (new_child_inode.ino, dirs[new_child_inode.ino].meta, true, dirs[new_child_inode.ino].nlink, dirs[new_child_inode.ino].nsubdirs, dirs[new_child_inode.ino].size) ;mkinode (new_child_inode.ino, files[new_child_inode.ino].meta, false, files[new_child_inode.ino].nlink, 0, files[new_child_inode.ino].size) )}; old_inode := getinode(mkinode(m11, md2, true, fs[ri[inodekey(m11)]].nlink, m16 + 1, m13 + 1).ino, dirs, files); new_inode := getinode(mkinode(m7, md1, true, fs[ri[inodekey(m7)]].nlink, fs[ri[inodekey(m7)]].nsubdirs, fs[ri[inodekey(m7)]].size).ino, dirs, files); err := ESUCCESS; asynced := ?⟩ ( dirs = abs-dirs(fs, ri) ∧ files = abs-files(fs, ri) ∧ (asynced → boolvar1) ∧ mkinode(m11, md2, true, fs[ri[inodekey(m11)]].nlink, m16 + 1, m13 + 1) = old_inode ∧ mkinode(m7, md1, true, fs[ri[inodekey(m7)]].nlink, fs[ri[inodekey(m7)]].nsubdirs, fs[ri[inodekey(m7)]].size) = new_inode ∧ mkinode (fs[ri[dentrykey(m7, str0)]].ino, md0, true, m14 + 1, fs[ri[inodekey(fs[ri[dentrykey(m7, str0)]].ino)]].nsubdirs, fs[ri[inodekey(fs[ri[dentrykey(m7, str0)]].ino)]].size) = new_child_inode ∧ mkdentry(str, fs[ri[dentrykey(m11, str)]].ino) = old_dent ∧ mkdentry(str0, fs[ri[dentrykey(m7, str0)]].ino) = new_dent ∧ ENOSPC = err), ⟨err := ENOSPC; asynced := ?⟩ ((asynced → boolvar1) ∧ ENOSPC = err), fs[ri[dentrykey(m7, str0)]].ino = ROOT_INO, fs[ri[dentrykey(m7, str0)]].ino = 0, m11 = m7, m11 = 0, m7 = 0, fs[ri[inodekey(m11)]].nlink = 0 ∧ m11 ≠ ROOT_INO, fs[ri[inodekey(m7)]].nlink = 0 ∧ m7 ≠ ROOT_INO

Heuristic symbolic execution applied rule assign right

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ mkinode(m, md, boolvar, m0, m1, m2).ino = m; (s)%⊦ dentrykey(ino, str) ∈ ri ∧ ri[dentrykey(ino, str)] ∈ fs ∧ ubifs-cons(fs, ri, ro, fi, fo, log) → fs[ri[dentrykey(ino, str)]].dentry?; (ss)% ⊦ key ∈ ri ∧ ri-cons(ri, fs) → ri[key] ∈ fs; (ss)