[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 1110 from proof refine-rename-overwrite-keep-parent-different (previous step)

m11 + 1 = fs[ri[inodekey(m7)]].size, n0 + (boolvar1 ⊃ 1;0) = fs[ri[inodekey(m7)]].nsubdirs, boolvar0 ↔ mkdentry(str0, fs[ri[dentrykey(m7, str0)]].ino).dentry?, ¬ fs[ri[inodekey(fs[ri[dentrykey(m7, str0)]].ino)]].directory ↔ ¬ fs[ri[inodekey(fs[ri[dentrykey(m7, str)]].ino)]].directory, new_ino = mkinode(m7, md1, true, fs[ri[inodekey(m7)]].nlink, n0 + (boolvar1 ⊃ 1;0), m11 + 1).ino, old_ino = mkinode(m7, md1, true, fs[ri[inodekey(m7)]].nlink, n0 + (boolvar1 ⊃ 1;0), m11 + 1).ino, old_ino = new_ino, fs[ri[dentrykey(m7, str0)]].dentry?, fs[ri[inodekey(m7)]].directory, fs[ri[inodekey(m7)]].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(fi), ri-inj(ri), ubifs-cons(fs, ri, orphans(fs, ri), fi, fo, log), ri[dentrykey(m7, str0)] ∈ fs, ri[inodekey(m7)] ∈ fs, inodekey(fs[ri[dentrykey(m7, str)]].ino) ∈ ri, inodekey(fs[ri[dentrykey(m7, str0)]].ino) ∈ ri, dentrykey(m7, str) ∈ ri, dentrykey(m7, str0) ∈ ri, inodekey(m7) ∈ ri, m10 = 0 → links(fs[ri[dentrykey(m7, str0)]].ino, fs, ri) = ∅ ++ dentrykey(m7, str0), boolvar3 → boolvar4, fs[ri[inodekey(fs[ri[dentrykey(m7, str0)]].ino)]].directory → abs-children(fs[ri[dentrykey(m7, str0)]].ino, fs, ri) = ∅, fs[ri[inodekey(fs[ri[dentrykey(m7, str0)]].ino)]].directory → dentrykeys(inodekey(fs[ri[dentrykey(m7, str0)]].ino), ri) = ∅, ∀ adr, adr0, adr1, adr2. adr ∈ fs ∨ adr0 ∈ fs ∨ adr1 ∈ fs ∨ adr2 ∈ fs ∨ adr = adr0 ∨ adr = adr1 ∨ adr = adr2 ∨ adr0 = adr1 ∨ adr0 = adr2 ∨ adr1 = adr2, fs[ri[inodekey(m7)]].nlink ≠ 0 ∨ m7 = ROOT_INO, links(m7, abs-dirs(fs, ri)) ≠ ∅ ∨ m7 = ROOT_INO, ¬ fs[ri[inodekey(fs[ri[dentrykey(m7, str)]].ino)]].directory ∧ ¬ boolvar1 ∧ m0 = fs[ri[inodekey(fs[ri[dentrykey(m7, str)]].ino)]].nlink ∧ m1 = fs[ri[inodekey(fs[ri[dentrykey(m7, str)]].ino)]].nsubdirs ∨ fs[ri[inodekey(fs[ri[dentrykey(m7, str)]].ino)]].directory ∧ boolvar1 ∧ m0 = fs[ri[inodekey(fs[ri[dentrykey(m7, str)]].ino)]].nlink ∧ m1 = fs[ri[inodekey(fs[ri[dentrykey(m7, str)]].ino)]].nsubdirs ∧ m2 = fs[ri[inodekey(fs[ri[dentrykey(m7, str)]].ino)]].size, ¬ fs[ri[inodekey(fs[ri[dentrykey(m7, str)]].ino)]].directory ∧ ¬ boolvar2 ∧ m10 + 1 = fs[ri[inodekey(fs[ri[dentrykey(m7, str0)]].ino)]].nlink ∧ m5 = fs[ri[inodekey(fs[ri[dentrykey(m7, str0)]].ino)]].nsubdirs ∨ fs[ri[inodekey(fs[ri[dentrykey(m7, str0)]].ino)]].directory ∧ boolvar2 ∧ m10 + 1 = fs[ri[inodekey(fs[ri[dentrykey(m7, str0)]].ino)]].nlink ∧ m5 = fs[ri[inodekey(fs[ri[dentrykey(m7, str0)]].ino)]].nsubdirs ∧ m6 = fs[ri[inodekey(fs[ri[dentrykey(m7, str0)]].ino)]].size, fs[ri[inodekey(fs[ri[dentrykey(m7, str)]].ino)]].directory ∧ m0 = fs[ri[inodekey(fs[ri[dentrykey(m7, str)]].ino)]].nlink ∧ m2 = fs[ri[inodekey(fs[ri[dentrykey(m7, str)]].ino)]].size ∧ m1 = fs[ri[inodekey(fs[ri[dentrykey(m7, str)]].ino)]].nsubdirs ∧ boolvar1 ∨ ¬ fs[ri[inodekey(fs[ri[dentrykey(m7, str)]].ino)]].directory ∧ m0 = fs[ri[inodekey(fs[ri[dentrykey(m7, str)]].ino)]].nlink ∧ m1 = 0 ∧ ¬ boolvar1, fs[ri[inodekey(fs[ri[dentrykey(m7, str0)]].ino)]].directory ∧ m10 + 1 = fs[ri[inodekey(fs[ri[dentrykey(m7, str0)]].ino)]].nlink ∧ m6 = fs[ri[inodekey(fs[ri[dentrykey(m7, str0)]].ino)]].size ∧ m5 = fs[ri[inodekey(fs[ri[dentrykey(m7, str0)]].ino)]].nsubdirs ∧ boolvar2 ∨ ¬ fs[ri[inodekey(fs[ri[dentrykey(m7, str)]].ino)]].directory ∧ m10 + 1 = fs[ri[inodekey(fs[ri[dentrykey(m7, str0)]].ino)]].nlink ∧ m5 = 0 ∧ ¬ boolvar2 ⊦ ⟨asynced := ?⟩ ((asynced → boolvar) ∧ ENOSPC = ENOSPC), fs[ri[dentrykey(m7, str0)]].ino = 0, fs[ri[dentrykey(m7, str0)]].ino = ROOT_INO, m7 = 0, mkdentry(str, fs[ri[dentrykey(m7, str)]].ino) = mkdentry(str0, fs[ri[dentrykey(m7, str0)]].ino), (fs[ri[dentrykey(m7, str0)]].dentry? ∧ ri[dentrykey(m7, str0)] ∈ fs ∧ dentrykey(m7, str0) ∈ ri) ∧ fs[ri[dentrykey(m7, str)]].dentry? ∧ ri[dentrykey(m7, str)] ∈ fs ∧ dentrykey(m7, str) ∈ ri, fs[ri[inodekey(m7)]].nlink = 0 ∧ m7 ≠ ROOT_INO

Heuristic symbolic execution applied rule assign right

And closed the goal!

Rule argument

Additional information

Used simplifier rules: ⊦ 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)