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

m12 + 1 = fs[ri[inodekey(fs[ri[dentrykey(m4, str0)]].ino)]].nlink, m14 + 1 = fs[ri[inodekey(m9)]].size, boolvar0 ↔ mkdentry(str0, fs[ri[dentrykey(m4, str0)]].ino).dentry?, boolvar ↔ old_ino = new_ino ∧ mkdentry(str0, fs[ri[dentrykey(m4, str0)]].ino) = mkdentry(str, fs[ri[dentrykey(m9, str)]].ino), 0 = fs[ri[inodekey(fs[ri[dentrykey(m4, str0)]].ino)]].nsubdirs, 0 = fs[ri[inodekey(fs[ri[dentrykey(m9, str)]].ino)]].nsubdirs, 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(m9, str)]].ino).name) ], new_ino = mkinode(m4, md1, true, fs[ri[inodekey(m4)]].nlink, fs[ri[inodekey(m4)]].nsubdirs, fs[ri[inodekey(m4)]].size).ino, old_dent = mkdentry(str, fs[ri[dentrykey(m9, str)]].ino), old_ino = mkinode(m9, md2, true, fs[ri[inodekey(m9)]].nlink, fs[ri[inodekey(m9)]].nsubdirs, m14 + 1).ino, fs[ri[dentrykey(m9, str)]].dentry?, fs[ri[dentrykey(m4, str0)]].dentry?, fs[ri[inodekey(m9)]].directory, fs[ri[inodekey(m4)]].directory, fs[ri[inodekey(m4)]].inode?, fs[ri[inodekey(m9)]].inode?, fo.inodes?, orphans(fs, ri).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(fi), ri-inj(ri), ubifs-cons(fs, ri, orphans(fs, ri), fi, fo, log), dentrykey(m9, str) ∈ ri, ri[dentrykey(m9, str)] ∈ fs, ri[dentrykey(m4, str0)] ∈ fs, ri[inodekey(m4)] ∈ fs, ri[inodekey(m9)] ∈ fs, inodekey(fs[ri[dentrykey(m9, str)]].ino) ∈ ri, inodekey(fs[ri[dentrykey(m4, str0)]].ino) ∈ ri, dentrykey(m4, str0) ∈ ri, inodekey(m4) ∈ ri, inodekey(m9) ∈ ri, m12 = 0 → links(fs[ri[dentrykey(m4, str0)]].ino, fs, ri) = ∅ ++ dentrykey(m4, str0), boolvar2 → boolvar3, old_ino = new_ino → (fs[ri[dentrykey(m4, str0)]].dentry? ∧ ri[dentrykey(m4, str0)] ∈ fs ∧ dentrykey(m4, str0) ∈ ri) ∧ fs[ri[dentrykey(m9, str)]].dentry? ∧ ri[dentrykey(m9, str)] ∈ fs ∧ dentrykey(m9, 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(m4)]].trunc? ∨ fs[ri[inodekey(m4)]].inode?, links(m9, abs-dirs(fs, ri)) ≠ ∅ ∨ m9 = ROOT_INO, links(m4, abs-dirs(fs, ri)) ≠ ∅ ∨ m4 = ROOT_INO, fs[ri[inodekey(m9)]].nlink ≠ 0 ∨ m9 = ROOT_INO, fs[ri[inodekey(m4)]].nlink ≠ 0 ∨ m4 = ROOT_INO ⊦ ⟨asynced := ?⟩ ((asynced → boolvar1) ∧ ENOSPC = ENOSPC), ⟨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(m4, str0)]].ino).name] := old_dent.ino; new_dent := mkdentry(str0, fs[ri[dentrykey(m4, 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(m9, md2, true, fs[ri[inodekey(m9)]].nlink, fs[ri[inodekey(m9)]].nsubdirs, m14 + 1); dirs, files); afs_inode_sync#(mkinode(m4, md1, true, fs[ri[inodekey(m4)]].nlink, fs[ri[inodekey(m4)]].nsubdirs, fs[ri[inodekey(m4)]].size); dirs, files); new_child_inode := mkinode(fs[ri[dentrykey(m4, str0)]].ino, md0, false, m12 + 1, 0, m5); 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(m9, md2, true, fs[ri[inodekey(m9)]].nlink, fs[ri[inodekey(m9)]].nsubdirs, m14 + 1).ino, dirs, files); new_inode := getinode(mkinode(m4, md1, true, fs[ri[inodekey(m4)]].nlink, fs[ri[inodekey(m4)]].nsubdirs, fs[ri[inodekey(m4)]].size).ino, dirs, files); err := ESUCCESS; asynced := ?⟩ ( dirs = abs-dirs(fs, ri) ∧ files = abs-files(fs, ri) ∧ (asynced → boolvar1) ∧ mkinode(m9, md2, true, fs[ri[inodekey(m9)]].nlink, fs[ri[inodekey(m9)]].nsubdirs, m14 + 1) = old_inode ∧ mkinode(m4, md1, true, fs[ri[inodekey(m4)]].nlink, fs[ri[inodekey(m4)]].nsubdirs, fs[ri[inodekey(m4)]].size) = new_inode ∧ mkinode(fs[ri[dentrykey(m4, str0)]].ino, md0, false, m12 + 1, 0, m5) = new_child_inode ∧ mkdentry(str, fs[ri[dentrykey(m9, str)]].ino) = old_dent ∧ mkdentry(str0, fs[ri[dentrykey(m4, str0)]].ino) = new_dent ∧ ENOSPC = err), fs[ri[dentrykey(m4, str0)]].ino = ROOT_INO, fs[ri[dentrykey(m4, str0)]].ino = 0, m4 = 0, m9 = m4, m9 = 0, fs[ri[inodekey(fs[ri[dentrykey(m9, str)]].ino)]].directory, fs[ri[inodekey(fs[ri[dentrykey(m4, str0)]].ino)]].directory, fs[ri[inodekey(m4)]].nlink = 0 ∧ m4 ≠ ROOT_INO, fs[ri[inodekey(m9)]].nlink = 0 ∧ m9 ≠ ROOT_INO

Heuristic symbolic execution applied rule assign right

And closed the goal!

Rule argument

Additional information

Used simplifier rules: ⊦ mkinode(m, md, boolvar, m0, m1, m2).ino = m; (s)%⊦ inodekey(ino) ∈ ri ∧ fs[ri[inodekey(ino)]].directory → abs-dirs(fs, ri)[ino] = abs-dir(ino, fs, ri); (s)%⊦ abs-dir(ino, fs, ri) = mkdir (fs[ri[inodekey(ino)]].size, fs[ri[inodekey(ino)]].meta, fs[ri[inodekey(ino)]].nlink, fs[ri[inodekey(ino)]].nsubdirs, abs-children(ino, fs, ri)); (s)% ⊦ mkdir(m, md, m0, m1, entries).entries = entries; (s)% ⊦ mkdentry(str, m).name = str; (s)%⊦ mkdir(m, md, m0, m1, entries).entries:= entries0 = mkdir(m, md, m0, m1, entries0); (s)% ⊦ mkdentry(str, m).dentry?; (s)