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

fs[ri[inodekey(m6)]].directory, 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), dentrykey(m6, str) ∈ ri, inodekey(fs[ri[dentrykey(m6, str)]].ino) ∈ ri, inodekey(m6) ∈ ri, 1 ≤ fs[ri[inodekey(m6)]].size, fs[ri[inodekey(fs[ri[dentrykey(m6, str)]].ino)]].directory → dentrykeys(inodekey(fs[ri[dentrykey(m6, str)]].ino), ri) = ∅, fs[ri[inodekey(fs[ri[dentrykey(m6, str)]].ino)]].directory → abs-children(fs[ri[dentrykey(m6, str)]].ino, fs, ri) = ∅, boolvar4 → boolvar1, m0 = 1 → links(fs[ri[dentrykey(m6, str)]].ino, fs, ri) = ∅ ++ dentrykey(m6, str), boolvar2 → 1 ≤ fs[ri[inodekey(m6)]].nsubdirs, ∀ 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(fs[ri[dentrykey(m6, str)]].ino)]].directory ∧ m0 = fs[ri[inodekey(fs[ri[dentrykey(m6, str)]].ino)]].nlink ∧ m2 = fs[ri[inodekey(fs[ri[dentrykey(m6, str)]].ino)]].size ∧ m1 = fs[ri[inodekey(fs[ri[dentrykey(m6, str)]].ino)]].nsubdirs ∧ boolvar3 ∨ ¬ fs[ri[inodekey(fs[ri[dentrykey(m6, str)]].ino)]].directory ∧ m0 = fs[ri[inodekey(fs[ri[dentrykey(m6, str)]].ino)]].nlink ∧ m1 = 0 ∧ ¬ boolvar3, fs[ri[inodekey(fs[ri[dentrykey(m6, str)]].ino)]].directory ∧ m3 = fs[ri[inodekey(fs[ri[dentrykey(m6, str)]].ino)]].nlink ∧ m5 = fs[ri[inodekey(fs[ri[dentrykey(m6, str)]].ino)]].size ∧ m4 = fs[ri[inodekey(fs[ri[dentrykey(m6, str)]].ino)]].nsubdirs ∧ boolvar2 ∨ ¬ fs[ri[inodekey(fs[ri[dentrykey(m6, str)]].ino)]].directory ∧ m3 = fs[ri[inodekey(fs[ri[dentrykey(m6, str)]].ino)]].nlink ∧ m4 = 0 ∧ ¬ boolvar2, ¬ fs[ri[inodekey(fs[ri[dentrykey(m6, str)]].ino)]].directory ∧ ¬ boolvar3 ∧ m0 = fs[ri[inodekey(fs[ri[dentrykey(m6, str)]].ino)]].nlink ∧ m1 = fs[ri[inodekey(fs[ri[dentrykey(m6, str)]].ino)]].nsubdirs ∨ fs[ri[inodekey(fs[ri[dentrykey(m6, str)]].ino)]].directory ∧ boolvar3 ∧ m0 = fs[ri[inodekey(fs[ri[dentrykey(m6, str)]].ino)]].nlink ∧ m1 = fs[ri[inodekey(fs[ri[dentrykey(m6, str)]].ino)]].nsubdirs ∧ m2 = fs[ri[inodekey(fs[ri[dentrykey(m6, str)]].ino)]].size, ¬ fs[ri[inodekey(fs[ri[dentrykey(m6, str)]].ino)]].directory ∧ ¬ boolvar2 ∧ m3 = fs[ri[inodekey(fs[ri[dentrykey(m6, str)]].ino)]].nlink ∧ m4 = fs[ri[inodekey(fs[ri[dentrykey(m6, str)]].ino)]].nsubdirs ∨ fs[ri[inodekey(fs[ri[dentrykey(m6, str)]].ino)]].directory ∧ boolvar2 ∧ m3 = fs[ri[inodekey(fs[ri[dentrykey(m6, str)]].ino)]].nlink ∧ m4 = fs[ri[inodekey(fs[ri[dentrykey(m6, str)]].ino)]].nsubdirs ∧ m5 = fs[ri[inodekey(fs[ri[dentrykey(m6, str)]].ino)]].size, links(m6, abs-dirs(fs, ri)) ≠ ∅ ∨ m6 = ROOT_INO, fs[ri[inodekey(m6)]].nlink ≠ 0 ∨ m6 = ROOT_INO ⊦ ⟨asynced := ?⟩ ((asynced → boolvar0) ∧ ENOSPC = ENOSPC), fs[ri[dentrykey(m6, str)]].ino = 0, fs[ri[dentrykey(m6, str)]].ino = ROOT_INO, fs[ri[inodekey(m6)]].size = 0, m0 = 0, m6 = 0, (fs[ri[dentrykey(m6, str)]].dentry? ∧ ri[dentrykey(m6, str)] ∈ fs ∧ dentrykey(m6, str) ∈ ri) ∧ ( (fs[ri[inodekey(m6)]].inode? ∧ ri[inodekey(m6)] ∈ fs ∧ inodekey(m6) ∈ ri) ∧ (fs[ri[inodekey(m6)]].inode? ∧ ri[inodekey(m6)] ∈ fs ∧ inodekey(m6) ∈ ri) ∧ (fs[ri[inodekey(m6)]].trunc? ∨ fs[ri[inodekey(m6)]].inode?) ∧ ri[inodekey(m6)] ∈ fs ∧ inodekey(m6) ∈ ri) ∧ (fs[ri[inodekey(m6)]].inode? ∧ ri[inodekey(m6)] ∈ fs ∧ inodekey(m6) ∈ ri) ∧ (fs[ri[inodekey(m6)]].inode? ∧ ri[inodekey(m6)] ∈ fs ∧ inodekey(m6) ∈ ri) ∧ (fs[ri[inodekey(m6)]].trunc? ∨ fs[ri[inodekey(m6)]].inode?) ∧ ri[inodekey(m6)] ∈ fs ∧ inodekey(m6) ∈ ri, fs[ri[inodekey(m6)]].nlink = 0 ∧ m6 ≠ 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)%⊦ inodekey(ino) ∈ ri ∧ ri[inodekey(ino)] ∈ fs ∧ ubifs-cons(fs, ri, ro, fi, fo, log) → fs[ri[inodekey(ino)]].inode?; (ss)