[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 195 from proof afs-cons-rename-file-negdentry (previous step)

dirs[m0] = mkdir(m3, md4, # links(m0, dirs), m6, entries0), files[entries1[str]] = mkfile(m2, md, # links(entries1[str], dirs), content0), dirs[m] = mkdir(m1, md2, # links(m, dirs), m4, entries1), afs-cons(dirs, files), m0 ∈ dirs, entries1[str] ∈ files, m ∈ dirs, str ∈ entries1, m0 = m → md1 = md0, links(m0, dirs) ≠ ∅ ∨ m0 = ROOT_INO, links(m, dirs) ≠ ∅ ∨ m = ROOT_INO ⊦ ⟪choose err0 with ⌊err0⌋ in err := err0; asynced := ?⟫ true, str0 ∈ entries0

Heuristic symbolic execution applied rule choose right

And obtained the following new goals

Proof step 196:
dirs[m] = mkdir(m1, md2, # links(m, dirs), m4, entries1), files[entries1[str]] = mkfile(m2, md, # links(entries1[str], dirs), content0), dirs[m0] = mkdir(m3, md4, # links(m0, dirs), m6, entries0), afs-cons(dirs, files), str ∈ entries1, m ∈ dirs, entries1[str] ∈ files, m0 ∈ dirs, ⌊err0⌋ , m0 = m → md1 = md0, links(m, dirs) ≠ ∅ ∨ m = ROOT_INO, links(m0, dirs) ≠ ∅ ∨ m0 = ROOT_INO ⊦ ⟪err := err0; asynced := ?⟫ true, str0 ∈ entries0
Proof step 198:
dirs[m] = mkdir(m1, md2, # links(m, dirs), m4, entries1), files[entries1[str]] = mkfile(m2, md, # links(entries1[str], dirs), content0), dirs[m0] = mkdir(m3, md4, # links(m0, dirs), m6, entries0), afs-cons(dirs, files), str ∈ entries1, m ∈ dirs, entries1[str] ∈ files, m0 ∈ dirs, m0 = m → md1 = md0, links(m, dirs) ≠ ∅ ∨ m = ROOT_INO, links(m0, dirs) ≠ ∅ ∨ m0 = ROOT_INO ⊦ str0 ∈ entries0, ∃ err0. ⌊err0⌋

Proof step 195 from proof afs-cons-rename-file-negdentry (previous step)

Heuristic symbolic execution applied rule choose right

And obtained the following new goals

Rule argument

Additional information