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

# links(entries[str], cache_dirs) = m0 + 1, cache_dirs[m3] = mkdir(m9 + 1, md4, # links(m3, cache_dirs), m8, entries), ((cache_files ⊕ cache_pcache) ⊕ cache_icache)[entries[str]] = mkfile(m7, md2, m0 + 1, content0), cache_files[entries[str]] = mkfile(m2, md3, m0 + 1, content), dcache = cache_dcache, err = ESUCCESS, key = dentrykey(p_ino, name), name = str, p_ino = m3, afs-cons(cache_dirs, cache_files), afs-cons(cache_dirs, (cache_files ⊕ cache_pcache) ⊕ cache_icache), dcache-cons(cache_dcache, cache_dirs, cache_files), icache-cons(cache_icache, cache_dirs, cache_files), pcache-cons(cache_pcache, cache_dirs, cache_files), synced(cache_dirs, cache_icache, cache_pcache), str ∈ entries, m3 ∈ cache_dirs, entries[str] ∈ cache_files, cache_sync → synced(cache_files, cache_icache, cache_pcache), links(m3, cache_dirs) ≠ ∅ ∨ m3 = ROOT_INO ⊦ [dcache := dcache -- key] ( icache-cons (cache_icache[entries[str], mkientry(false, mkinode(entries[str], md0, false, m0, 0, m6))] [m3, mkientry(false, mkinode(m3, md1, true, # links(m3, cache_dirs), m8, m9)) ], cache_dirs[m3, mkdir(m9, md1, # links(m3, cache_dirs), m8, entries -- str)], cache_files[entries[str], mkfile(m6, md0, m0, content)]) ∧ dcache-cons (dcache, cache_dirs[m3, mkdir(m9, md1, # links(m3, cache_dirs), m8, entries -- str)], cache_files[entries[str], mkfile(m6, md0, m0, content)]) ∧ pcache-cons (cache_pcache, cache_dirs[m3, mkdir(m9, md1, # links(m3, cache_dirs), m8, entries -- str)], cache_files[entries[str], mkfile(m6, md0, m0, content)]) ∧ synced (cache_dirs[m3, mkdir(m9, md1, # links(m3, cache_dirs), m8, entries -- str)], cache_icache[entries[str], mkientry(false, mkinode(entries[str], md0, false, m0, 0, m6))] [m3, mkientry(false, mkinode(m3, md1, true, # links(m3, cache_dirs), m8, m9)) ], cache_pcache) ∧ ( cache_sync → synced (cache_files[entries[str], mkfile(m6, md0, m0, content)], cache_icache[entries[str], mkientry(false, mkinode(entries[str], md0, false, m0, 0, m6))] [m3, mkientry(false, mkinode(m3, md1, true, # links(m3, cache_dirs), m8, m9)) ], cache_pcache)) ∧ afs-cons (cache_dirs[m3, mkdir(m9, md1, # links(m3, cache_dirs), m8, entries -- str)], cache_files[entries[str], mkfile(m6, md0, m0, content)]) → ⟨dent0 := mkdentry(str, entries[str]); p_inode0 := mkinode(m3, md1, true, # links(m3, cache_dirs), m8, m9 + 1); p_inode1 := mkinode(entries[str], md0, false, # links(entries[str], cache_dirs), 0, m6); cache_dirs0 := cache_dirs; cache_dirs1 := cache_dirs; cache_dirs2 := cache_dirs; cache_dirs3 := cache_dirs; afs_files := (cache_files ⊕ cache_pcache) ⊕ cache_icache; cache_dirs0 := cache_dirs; afs_unlink#(; p_inode0, p_inode1, dent0, err0, cache_dirs, afs_files; afs_asynced)⟩ ( cache_dirs = cache_dirs2[m3, mkdir(m9, md1, # links(m3, cache_dirs2), m8, entries -- str)] ∧ afs_files = (cache_files[entries[str], mkfile(m6, md0, m0, content)] ⊕ cache_pcache) ⊕ cache_icache[entries[str], mkientry(false, mkinode(entries[str], md0, false, m0, 0, m6))] [m3, mkientry(false, mkinode(m3, md1, true, # links(m3, cache_dirs0), m8, m9)) ] ∧ (afs_asynced ↔ asynced0) ∧ (m3 ∈ cache_dirs2 ⊃ mkinode(m3, md1, true, # links(m3, cache_dirs2), m8, m9) ;mkinode (m3, (m3 = entries[str] ⊃ mkfile(m6, md0, m0, content);cache_files[m3]).meta, false, (m3 = entries[str] ⊃ mkfile(m6, md0, m0, content);cache_files[m3]).nlink, 0, (m3 = entries[str] ⊃ mkfile(m6, md0, m0, content);cache_files[m3]).size) ) = p_inode0 ∧ (entries[str] ∈ cache_dirs3 ⊃ mkinode (entries[str], (entries[str] = m3 ⊃ mkdir(m9, md1, # links(entries[str], cache_dirs3), m8, entries -- str);cache_dirs3[entries[str]]).meta, true, (entries[str] = m3 ⊃ mkdir(m9, md1, # links(entries[str], cache_dirs3), m8, entries -- str);cache_dirs3[entries[str]]).nlink, (entries[str] = m3 ⊃ mkdir(m9, md1, # links(entries[str], cache_dirs3), m8, entries -- str);cache_dirs3[entries[str]]).nsubdirs, (entries[str] = m3 ⊃ mkdir(m9, md1, # links(entries[str], cache_dirs3), m8, entries -- str);cache_dirs3[entries[str]]).size) ;mkinode(entries[str], md0, false, m0, 0, m6) ) = p_inode1 ∧ negdentry(str) = dent0 ∧ err = err0))

Heuristic symbolic execution applied rule assign right

And obtained the following new goals

Rule argument

Additional information