[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 272 from proof refine-rename-dir-negdentry (previous step)

# links(ino, cache_dirs) = # links (ino, cache_dirs[m9, mkdir(m8, md6, # links(m9, cache_dirs), m18, entries1 -- str)] [m16, mkdir(m2 + 1, md5, # links(m16, cache_dirs), m5 + 1, entries[str0, entries1[str]]) ]), cache_files[ino] = mkfile(m20, md8, # links(ino, cache_dirs), content), cache_icache[m9, mkientry(false, mkinode(m9, md6, true, # links(m9, cache_dirs), m18, m8))] [m16, mkientry(false, mkinode(m16, md5, true, # links(m16, cache_dirs), m5 + 1, m2 + 1)) ] [ino ] = mkientry(boolvar, mkinode(m, md, false, m11, m12, m19)), cache_dirs[m9] = mkdir(m8 + 1, md1, # links(m9, cache_dirs), m18 + 1, entries1), cache_dirs[m16] = mkdir(m2, md4, # links(m16, cache_dirs), m5, entries), cache_dirs[entries1[str]] = mkdir(m3, md3, # links(entries1[str], cache_dirs), m7, entries0), (∅)[ino] = mkientry(boolvar1, mkinode(m21, md9, boolvar0, m22, m23, m24)), afs-cons (cache_dirs[m9, mkdir(m8, md6, # links(m9, cache_dirs), m18, entries1 -- str)] [m16, mkdir(m2 + 1, md5, # links(m16, cache_dirs), m5 + 1, entries[str0, entries1[str]]) ], cache_files), afs-cons(cache_dirs, (cache_files ⊕ cache_pcache) ⊕ cache_icache), afs-cons(cache_dirs, cache_files), dcache-cons(cache_dcache, cache_dirs, cache_files), dcache-cons ((cache_dcache -- dentrykey(m9, str))[dentrykey(m16, str0), mkdentry(str0, entries1[str])], cache_dirs[m9, mkdir(m8, md6, # links(m9, cache_dirs), m18, entries1 -- str)] [m16, mkdir(m2 + 1, md5, # links(m16, cache_dirs), m5 + 1, entries[str0, entries1[str]]) ], cache_files), icache-cons(cache_icache, cache_dirs, cache_files), icache-cons (cache_icache[m9, mkientry(false, mkinode(m9, md6, true, # links(m9, cache_dirs), m18, m8))] [m16, mkientry(false, mkinode(m16, md5, true, # links(m16, cache_dirs), m5 + 1, m2 + 1)) ], cache_dirs[m9, mkdir(m8, md6, # links(m9, cache_dirs), m18, entries1 -- str)] [m16, mkdir(m2 + 1, md5, # links(m16, cache_dirs), m5 + 1, entries[str0, entries1[str]]) ], cache_files), pcache-cons(cache_pcache, cache_dirs, cache_files), pcache-cons (cache_pcache, cache_dirs[m9, mkdir(m8, md6, # links(m9, cache_dirs), m18, entries1 -- str)] [m16, mkdir(m2 + 1, md5, # links(m16, cache_dirs), m5 + 1, entries[str0, entries1[str]]) ], cache_files), synced (cache_dirs[m9, mkdir(m8, md6, # links(m9, cache_dirs), m18, entries1 -- str)] [m16, mkdir(m2 + 1, md5, # links(m16, cache_dirs), m5 + 1, entries[str0, entries1[str]]) ], cache_icache[m9, mkientry(false, mkinode(m9, md6, true, # links(m9, cache_dirs), m18, m8))] [m16, mkientry(false, mkinode(m16, md5, true, # links(m16, cache_dirs), m5 + 1, m2 + 1)) ], cache_pcache), synced(cache_dirs, cache_icache, cache_pcache), ino ∈ cache_icache[m9, mkientry(false, mkinode(m9, md6, true, # links(m9, cache_dirs), m18, m8))] [m16, mkientry(false, mkinode(m16, md5, true, # links(m16, cache_dirs), m5 + 1, m2 + 1)) ], m9 ∈ cache_dirs, str ∈ entries1, m16 ∈ cache_dirs, entries1[str] ∈ cache_dirs, ino ∈ cache_files, cache_sync → synced(cache_files, cache_icache, cache_pcache), cache_sync → synced (cache_files, cache_icache[m9, mkientry(false, mkinode(m9, md6, true, # links(m9, cache_dirs), m18, m8))] [m16, mkientry(false, mkinode(m16, md5, true, # links(m16, cache_dirs), m5 + 1, m2 + 1)) ], cache_pcache), links(m16, cache_dirs) ≠ ∅ ∨ m16 = ROOT_INO, links(m9, cache_dirs) ≠ ∅ ∨ m9 = ROOT_INO ⊦ m16 = m9, ino ∈ cache_icache, str0 ∈ entries, m20 = m19 ∧ md8 = md ∧ # links(ino, cache_dirs) = m11

Heuristic use patterns applied rule insert rewrite lemma

And obtained the following new goals

Rule argument

spec: store, inst: icache name: At-other seq: ⊦ ino ≠ ino0 → icache[ino0, ie][ino] = icache[ino] subst: [ino, ino0, icache, ie] → [ino, m16, cache_icache [m9, mkientry (false, mkinode (m9, md6, true, # links(m9, cache_dirs), m18, m8)) ], mkientry (false, mkinode (m16, md5, true, # links(m16, cache_dirs), m5 + 1, m2 + 1))] flags: <all paths>

Additional information

Used simplifier rules: ⊦ ino ≠ ino0 → (ino ∈ icache[ino0, ie] ↔ ino ∈ icache); (s)% ⊦ ino ∈ icache[ino0, ie] ↔ ino = ino0 ∨ ino ∈ icache; (ws)% ⊦ ino = ino0 → icache[ino0, ie][ino] = ie; (s)%⊦ mkientry(boolvar, inode) = mkientry(boolvar0, inode0) ↔ (boolvar ↔ boolvar0) ∧ inode = inode0; (ws)%⊦ mkinode(m, md, boolvar, m0, m1, m2) = mkinode(m3, md0, boolvar0, m4, m5, m6) ↔ m = m3 ∧ md = md0 ∧ (boolvar ↔ boolvar0) ∧ m0 = m4 ∧ m1 = m5 ∧ m2 = m6; (ws)% ⊦ icache[ino, ie][ino] = ie; (s) Used terms: ino, m16, cache_icache [m9, mkientry (false, mkinode(m9, md6, true, # links(m9, cache_dirs), m18, m8)) ], mkientry (false, mkinode(m16, md5, true, # links(m16, cache_dirs), m5 + 1, m2 + 1))