[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 22 from proof crash-neutral-link (previous step)

# links(m, dirs) = dirs[m].nlink, # links(entries0[str], dirs) = files[entries0[str]].nlink, files[entries0[str]] = mkfile(m1, md2, files[entries0[str]].nlink, content), dirs[m] = mkdir(dirs[m].size, md1, dirs[m].nlink, dirs[m].nsubdirs, entries), dirs[ino] = mkdir(m4, md3, # links(ino, dirs), m6, entries0), entries0[str] = dirs[ino0].entries[str], p_ino = m, afs-cons(dirs, files), ino ∈ dirs, str ∈ entries0, m ∈ dirs, entries0[str] ∈ files, ino0 ∈ dirs, str ∈ dirs[ino0].entries, links(ino, dirs) ≠ ∅ ∨ ino = ROOT_INO, links(m, dirs) ≠ ∅ ∨ m = ROOT_INO, links(ino0, dirs) ≠ ∅ ∨ ino0 = ROOT_INO ⊦ ⟨dirs1 := dirs[p_ino, dirs[p_ino].entries:= dirs[p_ino].entries[str0, mkdentry(str, entries0[str]).ino]]; dirs1[p_ino].size := dirs1[p_ino].size + 1; let ino = mkdentry(str, entries0[str]).ino in {files1 := files; files0 := files; afs_inc_nlink#(ino; dirs1, files)}; new_dent := mkdentry(str0, mkdentry(str, entries0[str]).ino); afs_inode_sync#(mkinode(m, md, true, # links(m, dirs), dirs[m].nsubdirs, dirs[m].size); dirs1, files); afs_inode_sync#(mkinode(entries0[str], md0, false, # links(entries0[str], dirs), 0, m3); dirs1, files); p_inode := (m ∈ dirs1 ⊃ mkinode(m, dirs1[m].meta, true, dirs1[m].nlink, dirs1[m].nsubdirs, dirs1[m].size) ;mkinode(m, files[m].meta, false, files[m].nlink, 0, files[m].size) ); c_inode := getinode(mkdentry(str, entries0[str]).ino, dirs1, files); err := ESUCCESS; asynced := ?⟩ (asynced ∧ dirs \ orphans(dirs, files0) = dirs1 \ orphans(dirs1, files) ∧ files1 \ orphans(dirs, files1) = files \ orphans(dirs1, files)), ⟨fail#(; ; err); asynced := ?⟩ asynced, str0 ∈ dirs[m].entries, str0 ∈ entries

Heuristic symbolic execution applied rule assign right

And obtained the following new goals

Proof step 23:
# links(entries0[str], dirs) = files[entries0[str]].nlink, # links(m, dirs) = dirs[m].nlink, entries0[str] = dirs[ino0].entries[str], dirs[ino] = mkdir(m4, md3, # links(ino, dirs), m6, entries0), dirs[m] = mkdir(dirs[m].size, md1, dirs[m].nlink, dirs[m].nsubdirs, entries), files[entries0[str]] = mkfile(m1, md2, files[entries0[str]].nlink, content), p_ino = m, mkdentry(str, entries0[str]).dentry?, afs-cons(dirs, files), str ∈ dirs[ino0].entries, ino0 ∈ dirs, entries0[str] ∈ files, m ∈ dirs, str ∈ entries0, ino ∈ dirs, links(ino0, dirs) ≠ ∅ ∨ ino0 = ROOT_INO, links(m, dirs) ≠ ∅ ∨ m = ROOT_INO, links(ino, dirs) ≠ ∅ ∨ ino = ROOT_INO ⊦ ⟨dirs1 := dirs[p_ino, dirs[p_ino].entries:= dirs[p_ino].entries[str0, mkdentry(str, entries0[str]).ino]] [p_ino, dirs[p_ino, dirs[p_ino].entries:= dirs[p_ino].entries[str0, mkdentry(str, entries0[str]).ino]][p_ino] .size:= (dirs[p_ino, dirs[p_ino].entries:= dirs[p_ino].entries[str0, mkdentry(str, entries0[str]).ino]][p_ino].size + 1) ]; let ino = mkdentry(str, entries0[str]).ino in {files1 := files; files0 := files; afs_inc_nlink#(ino; dirs1, files)}; new_dent := mkdentry(str0, mkdentry(str, entries0[str]).ino); afs_inode_sync#(mkinode(m, md, true, # links(m, dirs), dirs[m].nsubdirs, dirs[m].size); dirs1, files); afs_inode_sync#(mkinode(entries0[str], md0, false, # links(entries0[str], dirs), 0, m3); dirs1, files); p_inode := (m ∈ dirs1 ⊃ mkinode(m, dirs1[m].meta, true, dirs1[m].nlink, dirs1[m].nsubdirs, dirs1[m].size) ;mkinode(m, files[m].meta, false, files[m].nlink, 0, files[m].size) ); c_inode := getinode(mkdentry(str, entries0[str]).ino, dirs1, files); err := ESUCCESS; asynced := ?⟩ (asynced ∧ dirs \ orphans(dirs, files0) = dirs1 \ orphans(dirs1, files) ∧ files1 \ orphans(dirs, files1) = files \ orphans(dirs1, files)), ⟨fail#(; ; err); asynced := ?⟩ asynced, str0 ∈ entries, str0 ∈ dirs[m].entries

Rule argument

Additional information

Used simplifier rules: ⊦ mkdentry(str, m).dentry?; (s)