[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 515 from proof refine-rename-file-dentry (previous step)

asynced ↔ false, cache_dirs[m2] = mkdir(m6, md3, # links(m2, cache_dirs), m5, entries), cache_files[entries[str0]] = mkfile(m1, md, # links(entries[str0], cache_dirs), content), ((cache_files ⊕ cache_pcache) ⊕ cache_icache)[entries[str0]] = mkfile(m8, md4, # links(entries[str0], cache_dirs), content0), err = ESUCCESS, icache = cache_icache[m2, mkientry(false, mkinode(m2, md5, true, # links(m2, cache_dirs), m5, m6))], inode = mkinode(m2, md5, true, # links(m2, cache_dirs), m5, m6), new_child_inode = (entries[str0] ∈ cache_dirs ⊃ mkinode (entries[str0], cache_dirs[m2, mkdir(m6, md5, # links(m2, cache_dirs), m5, entries)][entries[str0]].meta, true, cache_dirs[m2, mkdir(m6, md5, # links(m2, cache_dirs), m5, entries)][entries[str0]].nlink, cache_dirs[m2, mkdir(m6, md5, # links(m2, cache_dirs), m5, entries)][entries[str0]].nsubdirs, cache_dirs[m2, mkdir(m6, md5, # links(m2, cache_dirs), m5, entries)][entries[str0]].size) ;mkinode (entries[str0], cache_files [entries[str0], cache_files [entries[str0], cache_files[entries[str0]].size:= mkinode(entries[str0], md1, false, # links(entries[str0], cache_dirs), 0, m10).size ] [entries[str0] ] .meta:= mkinode(entries[str0], md1, false, # links(entries[str0], cache_dirs), 0, m10).meta ] [entries[str0] ] .meta, false, cache_files [entries[str0], cache_files [entries[str0], cache_files[entries[str0]].size:= mkinode(entries[str0], md1, false, # links(entries[str0], cache_dirs), 0, m10).size ] [entries[str0] ] .meta:= mkinode(entries[str0], md1, false, # links(entries[str0], cache_dirs), 0, m10).meta ] [entries[str0] ] .nlink, 0, cache_files [entries[str0], cache_files [entries[str0], cache_files[entries[str0]].size:= mkinode(entries[str0], md1, false, # links(entries[str0], cache_dirs), 0, m10).size ] [entries[str0] ] .meta:= mkinode(entries[str0], md1, false, # links(entries[str0], cache_dirs), 0, m10).meta ] [entries[str0] ] .size) ), str = str0, 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), synced(cache_dirs, cache_icache, cache_pcache), m2 ∈ cache_dirs, entries[str0] ∈ cache_files, str0 ∈ entries, cache_sync → synced(cache_files, cache_icache, cache_pcache), (entries[str0] ∈ cache_dirs ⊃ str0 ∈ entries ∧ str0 ∈ entries ∧ str0 ∈ entries ∧ str0 ∈ entries ∧ str0 ∈ entries ; str0 ∈ entries ∧ ( (str0 ∈ entries ∧ ((str0 ∈ entries ∧ str0 ∈ entries ∧ str0 ∈ entries ∧ str0 ∈ entries) ∧ str0 ∈ entries) ∧ str0 ∈ entries ∧ str0 ∈ entries) ∧ str0 ∈ entries) ∧ ( (str0 ∈ entries ∧ ((str0 ∈ entries ∧ str0 ∈ entries ∧ str0 ∈ entries ∧ str0 ∈ entries) ∧ str0 ∈ entries) ∧ str0 ∈ entries ∧ str0 ∈ entries) ∧ str0 ∈ entries) ∧ (str0 ∈ entries ∧ ((str0 ∈ entries ∧ str0 ∈ entries ∧ str0 ∈ entries ∧ str0 ∈ entries) ∧ str0 ∈ entries) ∧ str0 ∈ entries ∧ str0 ∈ entries) ∧ str0 ∈ entries ), links(m2, cache_dirs) ≠ ∅ ∨ m2 = ROOT_INO ⊦ [entries0 := entries; cache_icache0 := icache[inode.ino, mkientry(asynced, inode)]; if mkdentry(str, entries0[str]).dentry? then icache_set#(new_child_inode, false; err, cache_icache0); dcache_delete#(m2, mkdentry(str0, entries[str0]).name; err, cache_dcache); dcache_set# (m2, mkdentry(mkdentry(str0, entries[str0]).name, mkdentry(str0, entries[str0]).ino).name, mkdentry(mkdentry(str0, entries[str0]).name, mkdentry(str0, entries[str0]).ino) ; err, cache_dcache)] ( icache-cons (cache_icache0, cache_dirs[m2, mkdir(m6, md5, # links(m2, cache_dirs), m5, entries)], cache_files[entries[str0], (cache_files[entries[str0]].size:= m10).meta:= md1]) ∧ dcache-cons (cache_dcache, cache_dirs[m2, mkdir(m6, md5, # links(m2, cache_dirs), m5, entries)], cache_files[entries[str0], (cache_files[entries[str0]].size:= m10).meta:= md1]) ∧ pcache-cons (cache_pcache, cache_dirs[m2, mkdir(m6, md5, # links(m2, cache_dirs), m5, entries)], cache_files[entries[str0], (cache_files[entries[str0]].size:= m10).meta:= md1]) ∧ afs-cons (cache_dirs[m2, mkdir(m6, md5, # links(m2, cache_dirs), m5, entries)], cache_files[entries[str0], (cache_files[entries[str0]].size:= m10).meta:= md1]) ∧ synced(cache_dirs[m2, mkdir(m6, md5, # links(m2, cache_dirs), m5, entries)], cache_icache0, cache_pcache) ∧ (cache_sync → synced(cache_files[entries[str0], (cache_files[entries[str0]].size:= m10).meta:= md1], cache_icache0, cache_pcache)) → ⟨new_dent0 := mkdentry(str, entries0[str]); old_dent0 := mkdentry(str0, entries[str0]); new_parent_inode0 := mkinode(m2, md5, true, # links(m2, cache_dirs), m5, m6); old_parent_inode0 := mkinode(m2, md5, true, # links(m2, cache_dirs), m5, m6); new_child_inode0 := mkinode(entries0[str], md1, false, # links(entries0[str], cache_dirs), 0, m10); old_child_inode0 := mkinode(entries[str0], md2, false, # links(entries[str0], cache_dirs), 0, m13); cache_dirs0 := cache_dirs; cache_dirs1 := cache_dirs; cache_dirs2 := cache_dirs; cache_dirs3 := cache_dirs; afs_files := (cache_files ⊕ cache_pcache) ⊕ cache_icache; afs_rename# (; old_parent_inode0, new_parent_inode0, old_child_inode0, new_child_inode0, old_dent0, new_dent0, err0, cache_dirs, afs_files; afs_asynced)⟩ ( (m2 ∈ cache_dirs3 ⊃ mkinode(m2, md5, true, # links(m2, cache_dirs3), m5, m6) ;mkinode (m2, (m2 = entries[str0] ⊃ (cache_files[entries[str0]].size:= m10).meta:= md1;cache_files[m2]).meta, false, (m2 = entries[str0] ⊃ (cache_files[entries[str0]].size:= m10).meta:= md1;cache_files[m2]).nlink, 0, (m2 = entries[str0] ⊃ (cache_files[entries[str0]].size:= m10).meta:= md1;cache_files[m2]).size) ) = old_parent_inode0 ∧ (m2 ∈ cache_dirs3 ⊃ mkinode(m2, md5, true, # links(m2, cache_dirs3), m5, m6) ;mkinode (m2, (m2 = entries[str0] ⊃ (cache_files[entries[str0]].size:= m10).meta:= md1;cache_files[m2]).meta, false, (m2 = entries[str0] ⊃ (cache_files[entries[str0]].size:= m10).meta:= md1;cache_files[m2]).nlink, 0, (m2 = entries[str0] ⊃ (cache_files[entries[str0]].size:= m10).meta:= md1;cache_files[m2]).size) ) = new_parent_inode0 ∧ mkinode(entries[str0], md2, false, # links(entries[str0], cache_dirs0), 0, m13) = old_child_inode0 ∧ new_child_inode = new_child_inode0 ∧ negdentry(str0) = old_dent0 ∧ mkdentry(str0, entries[str0]) = new_dent0 ∧ err = err0 ∧ cache_dirs = cache_dirs3[m2, mkdir(m6, md5, # links(m2, cache_dirs3), m5, entries)] ∧ afs_files = (cache_files[entries[str0], (cache_files[entries[str0]].size:= m10).meta:= md1] ⊕ cache_pcache) ⊕ cache_icache0 ∧ (afs_asynced ↔ asynced0))), entries[str0] ∈ cache_dirs

Heuristic symbolic execution applied rule assign right

And obtained the following new goals

Rule argument

Additional information