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

# links(ino, cache_dirs) = # links (ino, cache_dirs[m6, (m6 = entries3[str] ⊃ mkdir(m5, md2, m3, m7, entries);mkdir(m0, md6, # links(m6, cache_dirs), m1, entries3 -- str)).meta:= md] [entries3[str], mkdir(m, md0, m8, m9, entries1) ]), (m6 = entries3[str] ⊃ mkdir(m5, md0, m3, m7, entries);mkdir(m0, md, # links(m6, cache_dirs), m1, entries3 -- str)) = mkdir(m4, md3, m14, m15, entries0), (entries3[str] = m6 ⊃ mkdir(m0, md6, # links(entries3[str], cache_dirs), m1, entries3 -- str) ;mkdir(m2, md1, # links(entries3[str], cache_dirs), m13, ∅) ) = mkdir(m5, md2, m3 + 1, m7, entries), (entries3[str] = m6 ⊃ mkdir(m5, md, m3, m7, entries);mkdir(m5, md2, m3, m7, entries)) = mkdir(m, md4, m8, m9, entries1), (∅)[ino] = mkientry(boolvar1, mkinode(m18, md8, boolvar0, m19, m20, m21)), cache_dirs[m6] = mkdir(m0 + 1, md6, # links(m6, cache_dirs), m1 + 1, entries3), cache_dirs[entries3[str]] = mkdir(m2, md1, # links(entries3[str], cache_dirs), m13, ∅), cache_icache[entries3[str], mkientry(false, mkinode(entries3[str], md0, true, m8, m9, m))] [m6, mkientry(false, mkinode(m6, md3, true, m14, m15, m4)) ] [ino ] = mkientry(boolvar, mkinode(m10, md5, false, m11, m12, m16)), cache_files[ino] = mkfile(m17, md7, # links(ino, cache_dirs), content), afs-cons(cache_dirs, (cache_files ⊕ cache_pcache) ⊕ cache_icache), afs-cons(cache_dirs, cache_files), afs-cons (cache_dirs[m6, (m6 = entries3[str] ⊃ mkdir(m5, md2, m3, m7, entries);mkdir(m0, md6, # links(m6, cache_dirs), m1, entries3 -- str)).meta:= md] [entries3[str], mkdir(m, md0, m8, m9, entries1) ], cache_files), dcache-cons(cache_dcache, cache_dirs, cache_files), dcache-cons (cache_dcache -- dentrykey(m6, str), cache_dirs[m6, (m6 = entries3[str] ⊃ mkdir(m5, md2, m3, m7, entries);mkdir(m0, md6, # links(m6, cache_dirs), m1, entries3 -- str)).meta:= md] [entries3[str], mkdir(m, md0, m8, m9, entries1) ], cache_files), icache-cons(cache_icache, cache_dirs, cache_files), icache-cons (cache_icache[entries3[str], mkientry(false, mkinode(entries3[str], md0, true, m8, m9, m))][m6, mkientry(false, mkinode(m6, md3, true, m14, m15, m4))], cache_dirs[m6, (m6 = entries3[str] ⊃ mkdir(m5, md2, m3, m7, entries);mkdir(m0, md6, # links(m6, cache_dirs), m1, entries3 -- str)).meta:= md] [entries3[str], mkdir(m, md0, m8, m9, entries1) ], cache_files), pcache-cons(cache_pcache, cache_dirs, cache_files), pcache-cons (cache_pcache, cache_dirs[m6, (m6 = entries3[str] ⊃ mkdir(m5, md2, m3, m7, entries);mkdir(m0, md6, # links(m6, cache_dirs), m1, entries3 -- str)).meta:= md] [entries3[str], mkdir(m, md0, m8, m9, entries1) ], cache_files), synced (cache_dirs[m6, (m6 = entries3[str] ⊃ mkdir(m5, md2, m3, m7, entries);mkdir(m0, md6, # links(m6, cache_dirs), m1, entries3 -- str)).meta:= md] [entries3[str], mkdir(m, md0, m8, m9, entries1) ], cache_icache[entries3[str], mkientry(false, mkinode(entries3[str], md0, true, m8, m9, m))][m6, mkientry(false, mkinode(m6, md3, true, m14, m15, m4))], cache_pcache), synced(cache_dirs, cache_icache, cache_pcache), ino ∈ cache_files, str ∈ entries3, entries3[str] ∈ cache_dirs, m6 ∈ cache_dirs, ino ∈ cache_icache[entries3[str], mkientry(false, mkinode(entries3[str], md0, true, m8, m9, m))] [m6, mkientry(false, mkinode(m6, md3, true, m14, m15, m4)) ], cache_sync → synced(cache_files, cache_icache, cache_pcache), cache_sync → synced (cache_files, cache_icache[entries3[str], mkientry(false, mkinode(entries3[str], md0, true, m8, m9, m))] [m6, mkientry(false, mkinode(m6, md3, true, m14, m15, m4)) ], cache_pcache), links(m6, cache_dirs) ≠ ∅ ∨ m6 = ROOT_INO ⊦ entries3[str] = ROOT_INO, ino ∈ cache_icache, m17 = m16 ∧ md7 = md5 ∧ # 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, m6, cache_icache [entries3[str], mkientry (false, mkinode(entries3[str], md0, true, m8, m9, m)) ], mkientry(false, mkinode(m6, md3, true, m14, m15, m4))] 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)%⊦ mkdir(m, md, m0, m1, entries) = mkdir(m2, md0, m3, m4, entries0) ↔ m = m2 ∧ md = md0 ∧ m0 = m3 ∧ m1 = m4 ∧ entries = entries0; (ws)%⊦ mkdir(m, md, m0, m1, entries).meta:= md0 = mkdir(m, md0, m0, m1, entries); (s)%⊦ 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, m6, cache_icache [entries3[str], mkientry(false, mkinode(entries3[str], md0, true, m8, m9, m)) ], mkientry(false, mkinode(m6, md3, true, m14, m15, m4))