[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 95 from proof eq-io-evict (previous step)

⟨let ino = inode.ino in if ino ∈ dirs then if dirs[ino].nlink = 0 then dirs := dirs -- ino else if files[ino].nlink = 0 then files := files -- ino⟩ (ESUCCESS = err0 ∧ dirs = dirs0 ∧ files = files0), asynced ↔ asynced0, dirs1[m] = mkdir(m5, md1, m6, m7, entries), files1[m] = mkfile(m3, md0, m4, content), dirs = dirs1, files = files1, inode = mkinode(m, md, boolvar, m0, m1, m2), pre-evict(inode, dirs, files) ⊦ (m ∈ dirs1 ∧ m0 = m6 ∧ m2 = m5 ∧ m1 = m7 ∧ boolvar ∨ m ∈ files1 ∧ m0 = m4 ∧ m1 = 0 ∧ ¬ boolvar) ∧ m ≠ ROOT_INO

Heuristic symbolic execution applied rule let left

And obtained the following new goals

Proof step 96:
⟨if ino ∈ dirs then if dirs[ino].nlink = 0 then dirs := dirs -- ino else if files[ino].nlink = 0 then files := files -- ino⟩ (ESUCCESS = err0 ∧ dirs = dirs0 ∧ files = files0), asynced ↔ asynced0, files1[m] = mkfile(m3, md0, m4, content), dirs1[m] = mkdir(m5, md1, m6, m7, entries), dirs = dirs1, files = files1, ino = inode.ino, inode = mkinode(m, md, boolvar, m0, m1, m2), pre-evict(inode, dirs, files) ⊦ (m ∈ dirs1 ∧ m0 = m6 ∧ m2 = m5 ∧ m1 = m7 ∧ boolvar ∨ m ∈ files1 ∧ m0 = m4 ∧ m1 = 0 ∧ ¬ boolvar) ∧ m ≠ ROOT_INO

Proof step 95 from proof eq-io-evict (previous step)

Heuristic symbolic execution applied rule let left

And obtained the following new goals

Rule argument

Additional information