[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 325 from proof refine-link (previous step)

fs[ri[dentrykey(ino1, str)]].ino = fs[ri[dentrykey(ino0, str)]].ino, fs[ri[dentrykey(ino2, str)]].ino = fs[ri[dentrykey(ino0, str)]].ino, 0 = fs[ri[inodekey(fs[ri[dentrykey(ino0, str)]].ino)]].nsubdirs, c_inode = mkinode(fs[ri[dentrykey(ino0, str)]].ino, md0, false, fs[ri[inodekey(fs[ri[dentrykey(ino0, str)]].ino)]].nlink, 0, m6), err = err0, files = abs-files(fs, ri), ino = fs[ri[dentrykey(ino0, str)]].ino, m0 = fs[ri[inodekey(m)]].nlink, m1 = fs[ri[inodekey(m)]].nsubdirs, m2 = fs[ri[inodekey(m)]].size, m3 = fs[ri[dentrykey(ino0, str)]].ino, m4 = fs[ri[inodekey(fs[ri[dentrykey(ino0, str)]].ino)]].nlink, new_dent = negdentry(str0), p_inode = mkinode(m, md, true, fs[ri[inodekey(m)]].nlink, fs[ri[inodekey(m)]].nsubdirs, fs[ri[inodekey(m)]].size), ro = orphans(fs, ri), fs[ri[dentrykey(ino0, str)]].dentry?, fs[ri[inodekey(ino0)]].directory, fs[ri[inodekey(m)]].directory, fs[ri[inodekey(ino1)]].directory, fs[ri[inodekey(ino2)]].directory, fs[ri[inodekey(m)]].inode?, fs[ri[inodekey(fs[ri[dentrykey(ino0, str)]].ino)]].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), inodekey(m) ∈ ri, ri[inodekey(m)] ∈ fs, inodekey(fs[ri[dentrykey(ino0, str)]].ino) ∈ ri, ri[inodekey(fs[ri[dentrykey(ino0, str)]].ino)] ∈ fs, inodekey(ino0) ∈ ri, dentrykey(ino1, str) ∈ ri, inodekey(ino1) ∈ ri, inodekey(ino2) ∈ ri, dentrykey(ino2, str) ∈ ri, ri[dentrykey(ino0, str)] ∈ fs, dentrykey(ino0, str) ∈ ri, ⌊err0⌋ , asynced → boolvar0, fs[ri[inodekey(m)]].trunc? ∨ fs[ri[inodekey(m)]].inode?, links(fs[ri[dentrykey(ino0, str)]].ino, abs-dirs(fs, ri)) ≠ ∅ ∨ fs[ri[dentrykey(ino0, str)]].ino = ROOT_INO, links(m, abs-dirs(fs, ri)) ≠ ∅ ∨ m = ROOT_INO, links(ino0, abs-dirs(fs, ri)) ≠ ∅ ∨ ino0 = ROOT_INO, fs[ri[inodekey(m)]].nlink ≠ 0 ∨ m = ROOT_INO, fs[ri[inodekey(ino1)]].nlink ≠ 0 ∨ ino1 = ROOT_INO, fs[ri[inodekey(ino2)]].nlink ≠ 0 ∨ ino2 = ROOT_INO, fs[ri[inodekey(fs[ri[dentrykey(ino0, str)]].ino)]].nlink ≠ 0 ∨ fs[ri[dentrykey(ino0, str)]].ino = ROOT_INO ⊦ [dirs := abs-dirs(fs, ri); if err = ESUCCESS then {aubifs_core_index_store#(inodekey(p_inode.ino), adr4, fi, ro, fo, fs, log, boolvar; ri); aubifs_core_index_store#(dentrykey(m, str0), adr0, fi, ro, fo, fs, log, boolvar; ri); aubifs_core_index_store#(inodekey(m3), adr, fi, ro, fo, fs, log, boolvar; ri); new_dent := mkdentry(new_dent.name, ino); p_inode := mkinode (p_inode.ino, inodenode(inodekey(m), md, true, m0, m1, m2 + 1).meta, inodenode(inodekey(m), md, true, m0, m1, m2 + 1).directory, inodenode(inodekey(m), md, true, m0, m1, m2 + 1).nlink, inodenode(inodekey(m), md, true, m0, m1, m2 + 1).nsubdirs, inodenode(inodekey(m), md, true, m0, m1, m2 + 1).size); c_inode := mkinode (ino, inodenode(inodekey(m3), md0, false, m4 + 1, 0, m6).meta, inodenode(inodekey(m3), md0, false, m4 + 1, 0, m6).directory, inodenode(inodekey(m3), md0, false, m4 + 1, 0, m6).nlink, inodenode(inodekey(m3), md0, false, m4 + 1, 0, m6).nsubdirs, inodenode(inodekey(m3), md0, false, m4 + 1, 0, m6).size)}] ( ubifs-cons(fs, ri, ro, fi, fo, log) ∧ replay-cons-strong(fs, ri, ro, fi, fo, log) ∧ file-node-cons(fs, ri) ∧ orphans-cons(fs, ri, ro) ∧ ri-inj(ri) → ⟨old_dent0 := negdentry(str0); p_inode0 := mkinode(m, md, true, m0, m1, m2); p_inode1 := mkinode(m3, md0, false, m4, 0, m6); afs_link#(mkdentry(str, m3); p_inode0, p_inode1, old_dent0, err1, dirs, files; asynced)⟩ ( dirs = abs-dirs(fs, ri) ∧ files = abs-files(fs, ri) ∧ orphans(abs-dirs(fs, ri), abs-files(fs, ri)) = abs-keys(ro) ∧ (asynced → boolvar) ∧ p_inode = p_inode0 ∧ c_inode = p_inode1 ∧ new_dent = old_dent0 ∧ err = err1)), fs[ri[dentrykey(ino0, str)]].ino = 0, m = 0, fs[ri[inodekey(fs[ri[dentrykey(ino0, str)]].ino)]].directory, dentrykey(m, str0) ∈ ri, fs[ri[inodekey(ino1)]].nlink = 0 ∧ ino1 ≠ ROOT_INO, fs[ri[inodekey(m)]].nlink = 0 ∧ m ≠ ROOT_INO, fs[ri[inodekey(fs[ri[dentrykey(ino0, str)]].ino)]].nlink = 0 ∧ fs[ri[dentrykey(ino0, str)]].ino ≠ ROOT_INO

Heuristic symbolic execution applied rule assign right

And obtained the following new goals

Rule argument

Additional information