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

asynced2 ↔ false, afs_dirs = cache_dirs, afs_files = (cache_files ⊕ cache_pcache) ⊕ cache_icache, dirs = cache_dirs, err = ESUCCESS, err1 = err0, files = files0[inode.ino, files0[inode.ino].meta:= inode.meta] [inode.ino, files0[inode.ino, files0[inode.ino].meta:= inode.meta][inode.ino].size:= inode.size ], files0 = cache_files, inode = mkinode(m, md, boolvar, m0, m1, m2), inode0 = mkinode(m, md, boolvar, m0, m1, m2), afs-cons(cache_dirs, (cache_files ⊕ cache_pcache) ⊕ cache_icache), afs-cons(cache_dirs, cache_files), dcache-cons(cache_dcache, cache_dirs, cache_files), icache-cons(cache_icache, cache_dirs, cache_files), pcache-cons(cache_pcache, cache_dirs, cache_files), pre-write-inode(inode, dirs, files0), synced(cache_dirs, cache_icache, cache_pcache), cache_sync → synced(cache_files, cache_icache, cache_pcache), cache_sync ∨ boolvar, m ∈ cache_dirs ∧ m0 = cache_dirs[m].nlink ∧ m2 = cache_dirs[m].size ∧ m1 = cache_dirs[m].nsubdirs ∧ boolvar ∨ m ∈ cache_files ∧ m0 = cache_files[m].nlink ∧ m1 = 0 ∧ ¬ boolvar, m ∈ cache_dirs ∧ m0 = cache_dirs[m].nlink ∧ m2 = cache_dirs[m].size ∧ m1 = cache_dirs[m].nsubdirs ∧ boolvar ∨ m ∈ cache_files ∧ m0 = ((cache_files ⊕ cache_pcache) ⊕ cache_icache)[m].nlink ∧ m1 = 0 ∧ ¬ boolvar ⊦ ⟪if err = ESUCCESS then icache_get#(inode0.ino, cache_icache; asynced2, inode, err); if err = ESUCCESS ∧ asynced2 then {inode.meta := inode0.meta; if ¬ inode0.directory then inode.size := inode0.size; icache_set#(inode, false; err, cache_icache)} else if false then err := EFAIL⟫ ⟨afs_write_inode#(mkinode(m, md, boolvar, m0, m1, m2); err0, afs_dirs, afs_files; afs_asynced)⟩ (afs_dirs = dirs ∧ afs_files = (files ⊕ cache_pcache) ⊕ cache_icache ∧ (afs_asynced ↔ asynced) ∧ err = err0), inode.directory

Heuristic symbolic execution applied rule if positive right

And obtained the following new goals

Rule argument

pos: right 1

Additional information