[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 84 from proof inv-link (previous step)

dirs0[ino1] = mkdir(m5, md2, # links(ino1, dirs0), m10, entries1), entries[str] = entries2[str], dirs0[ino0] = mkdir(m2, md1, # links(ino0, dirs0), m8, entries), entries0[str] = entries2[str], files0[entries2[str]] = mkfile(m0, md6, # links(entries2[str], dirs0), content0), dirs0[m11] = mkdir(m1, md5, # links(m11, dirs0), m14, entries3), dirs0[ino2] = mkdir(m4, md3, # links(ino2, dirs0), m6, entries0), entries1[str] = entries2[str], dirs0[ino3] = mkdir(m7, md4, # links(ino3, dirs0), m12, entries2), err = ESUCCESS, mkinode(entries1[str], md0, false, # links(entries1[str], dirs0), 0, m3) = mkinode(m, md, boolvar, m9, m13, m15), afs-cons(dirs0, files0), afs-cons (dirs0[m11, mkdir(m1 + 1, md7, # links(m11, dirs0), m14, entries3[str0, entries2[str]])], files0[entries2[str], mkfile(m3, md0, # links(entries2[str], dirs0) + 1, content0)]), dcache-cons(dcache, dirs0, files0), icache-cons(icache, dirs0, files0), pcache-cons(pcache, dirs0, files0), synced(dirs0, icache, pcache), str ∈ entries1, ino1 ∈ dirs0, str ∈ entries, ino0 ∈ dirs0, ino2 ∈ dirs0, str ∈ entries0, ino3 ∈ dirs0, str ∈ entries2, m11 ∈ dirs0, entries2[str] ∈ files0, asynced1 → synced(files0, icache, pcache), links(ino1, dirs0) ≠ ∅ ∨ ino1 = ROOT_INO, links(ino0, dirs0) ≠ ∅ ∨ ino0 = ROOT_INO, links(ino2, dirs0) ≠ ∅ ∨ ino2 = ROOT_INO, links(m11, dirs0) ≠ ∅ ∨ m11 = ROOT_INO, links(ino3, dirs0) ≠ ∅ ∨ ino3 = ROOT_INO ⊦ ⟪icache_set# (mkinode (m11, dirs0[m11, mkdir(m1 + 1, md7, # links(m11, dirs0), m14, entries3[str0, entries2[str]])][m11].meta, true, dirs0[m11, mkdir(m1 + 1, md7, # links(m11, dirs0), m14, entries3[str0, entries2[str]])][m11].nlink, dirs0[m11, mkdir(m1 + 1, md7, # links(m11, dirs0), m14, entries3[str0, entries2[str]])][m11].nsubdirs, dirs0[m11, mkdir(m1 + 1, md7, # links(m11, dirs0), m14, entries3[str0, entries2[str]])][m11].size), false ; err, icache); icache_set# (getinode (mkdentry(str, entries0[str]).ino, dirs0[m11, mkdir(m1 + 1, md7, # links(m11, dirs0), m14, entries3[str0, entries2[str]])], files0[entries2[str], mkfile(m0, md6, # links(entries2[str], dirs0) + 1, content0)] [entries1[str], files0[entries2[str], mkfile(m0, md6, # links(entries2[str], dirs0) + 1, content0)] [entries1[str], files0[entries2[str], mkfile(m0, md6, # links(entries2[str], dirs0) + 1, content0)][entries1[str]].size:= m15 ] [entries1[str] ] .meta:= md ]), false ; err, icache); dcache_set#(m11, mkdentry(str0, mkdentry(str, entries0[str]).ino).name, mkdentry(str0, mkdentry(str, entries0[str]).ino); err, dcache)⟫ ( icache-cons (icache, dirs0[m11, mkdir(m1 + 1, md7, # links(m11, dirs0), m14, entries3[str0, entries2[str]])], files0[entries2[str], mkfile(m0, md6, # links(entries2[str], dirs0) + 1, content0)] [entries1[str], mkfile(m3, md0, # links(entries2[str], dirs0) + 1, content0) ]) ∧ dcache-cons (dcache, dirs0[m11, mkdir(m1 + 1, md7, # links(m11, dirs0), m14, entries3[str0, entries2[str]])], files0[entries2[str], mkfile(m0, md6, # links(entries2[str], dirs0) + 1, content0)] [entries1[str], mkfile(m3, md0, # links(entries2[str], dirs0) + 1, content0) ]) ∧ pcache-cons (pcache, dirs0[m11, mkdir(m1 + 1, md7, # links(m11, dirs0), m14, entries3[str0, entries2[str]])], files0[entries2[str], mkfile(m0, md6, # links(entries2[str], dirs0) + 1, content0)] [entries1[str], mkfile(m3, md0, # links(entries2[str], dirs0) + 1, content0) ]) ∧ synced(dirs0[m11, mkdir(m1 + 1, md7, # links(m11, dirs0), m14, entries3[str0, entries2[str]])], icache, pcache) ∧ ( asynced1 → synced (files0[entries2[str], mkfile(m0, md6, # links(entries2[str], dirs0) + 1, content0)] [entries1[str], mkfile(m3, md0, # links(entries2[str], dirs0) + 1, content0) ], icache, pcache))), str0 ∈ entries3

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Proof step 85:
dirs0[ino1] = mkdir(m5, md2, # links(ino1, dirs0), m10, entries1), entries[str] = entries2[str], dirs0[ino0] = mkdir(m2, md1, # links(ino0, dirs0), m8, entries), entries0[str] = entries2[str], files0[entries2[str]] = mkfile(m0, md6, # links(entries2[str], dirs0), content0), dirs0[m11] = mkdir(m1, md5, # links(m11, dirs0), m14, entries3), dirs0[ino2] = mkdir(m4, md3, # links(ino2, dirs0), m6, entries0), entries1[str] = entries2[str], dirs0[ino3] = mkdir(m7, md4, # links(ino3, dirs0), m12, entries2), err = ESUCCESS, afs-cons(dirs0, files0), afs-cons (dirs0[m11, mkdir(m1 + 1, md7, # links(m11, dirs0), m14, entries3[str0, entries2[str]])], files0[entries2[str], mkfile(m15, md, # links(entries2[str], dirs0) + 1, content0)]), dcache-cons(dcache, dirs0, files0), icache-cons(icache, dirs0, files0), pcache-cons(pcache, dirs0, files0), synced(dirs0, icache, pcache), str ∈ entries1, ino1 ∈ dirs0, str ∈ entries, ino0 ∈ dirs0, ino2 ∈ dirs0, str ∈ entries0, ino3 ∈ dirs0, str ∈ entries2, m11 ∈ dirs0, entries2[str] ∈ files0, ¬ str0 ∈ entries3, asynced1 → synced(files0, icache, pcache), links(ino1, dirs0) ≠ ∅ ∨ ino1 = ROOT_INO, links(ino0, dirs0) ≠ ∅ ∨ ino0 = ROOT_INO, links(ino2, dirs0) ≠ ∅ ∨ ino2 = ROOT_INO, links(m11, dirs0) ≠ ∅ ∨ m11 = ROOT_INO, links(ino3, dirs0) ≠ ∅ ∨ ino3 = ROOT_INO ⊦ ⟪icache_set# (mkinode (m11, dirs0[m11, mkdir(m1 + 1, md7, # links(m11, dirs0), m14, entries3[str0, entries2[str]])][m11].meta, true, dirs0[m11, mkdir(m1 + 1, md7, # links(m11, dirs0), m14, entries3[str0, entries2[str]])][m11].nlink, dirs0[m11, mkdir(m1 + 1, md7, # links(m11, dirs0), m14, entries3[str0, entries2[str]])][m11].nsubdirs, dirs0[m11, mkdir(m1 + 1, md7, # links(m11, dirs0), m14, entries3[str0, entries2[str]])][m11].size), false ; err, icache); icache_set# (getinode (mkdentry(str, entries0[str]).ino, dirs0[m11, mkdir(m1 + 1, md7, # links(m11, dirs0), m14, entries3[str0, entries2[str]])], files0[entries2[str], mkfile(m0, md6, # links(entries2[str], dirs0) + 1, content0)] [entries1[str], files0[entries2[str], mkfile(m0, md6, # links(entries2[str], dirs0) + 1, content0)] [entries1[str], files0[entries2[str], mkfile(m0, md6, # links(entries2[str], dirs0) + 1, content0)][entries1[str]].size:= m15 ] [entries1[str] ] .meta:= md ]), false ; err, icache); dcache_set#(m11, mkdentry(str0, mkdentry(str, entries0[str]).ino).name, mkdentry(str0, mkdentry(str, entries0[str]).ino); err, dcache)⟫ ( icache-cons (icache, dirs0[m11, mkdir(m1 + 1, md7, # links(m11, dirs0), m14, entries3[str0, entries2[str]])], files0[entries2[str], mkfile(m0, md6, # links(entries2[str], dirs0) + 1, content0)] [entries1[str], mkfile(m15, md, # links(entries2[str], dirs0) + 1, content0) ]) ∧ dcache-cons (dcache, dirs0[m11, mkdir(m1 + 1, md7, # links(m11, dirs0), m14, entries3[str0, entries2[str]])], files0[entries2[str], mkfile(m0, md6, # links(entries2[str], dirs0) + 1, content0)] [entries1[str], mkfile(m15, md, # links(entries2[str], dirs0) + 1, content0) ]) ∧ pcache-cons (pcache, dirs0[m11, mkdir(m1 + 1, md7, # links(m11, dirs0), m14, entries3[str0, entries2[str]])], files0[entries2[str], mkfile(m0, md6, # links(entries2[str], dirs0) + 1, content0)] [entries1[str], mkfile(m15, md, # links(entries2[str], dirs0) + 1, content0) ]) ∧ synced(dirs0[m11, mkdir(m1 + 1, md7, # links(m11, dirs0), m14, entries3[str0, entries2[str]])], icache, pcache) ∧ ( asynced1 → synced (files0[entries2[str], mkfile(m0, md6, # links(entries2[str], dirs0) + 1, content0)] [entries1[str], mkfile(m15, md, # links(entries2[str], dirs0) + 1, content0) ], icache, pcache)))

Rule argument

Additional information

Used simplifier rules: ⊦ 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)