[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 63 from proof inv-rename-file-negdentry (previous step)

# links(entries1[str], dirs0) = files[entries1[str]].nlink, # links(m0, dirs0) = dirs0[m0].nlink, # links(m, dirs0) = dirs0[m].nlink, entries1[str] = dirs0[m].entries[str], dirs0[m] = mkdir(dirs0[m].size, md2, dirs0[m].nlink, dirs0[m].nsubdirs, entries1), files[entries1[str]] = mkfile(m1, md4, files[entries1[str]].nlink, content), dirs0[m0] = mkdir(dirs0[m0].size, md5, dirs0[m0].nlink, dirs0[m0].nsubdirs, entries0), dirs = dirs0[m, (dirs0[m].entries:= (dirs0[m].entries -- str)).size:= (dirs0[m].size - 1)] [m0, ( (m0 = m ⊃ (dirs0[m].entries:= (dirs0[m].entries -- str)).size:= (dirs0[m].size - 1);dirs0[m0]) .entries:= (m0 = m ⊃ (dirs0[m].entries:= (dirs0[m].entries -- str)).size:= (dirs0[m].size - 1);dirs0[m0]).entries[str0, entries1[str]]) .size:= ((m0 = m ⊃ (dirs0[m].entries:= (dirs0[m].entries -- str)).size:= (dirs0[m].size - 1);dirs0[m0]).size + 1) ], dirs0[m].size ≠ 0, afs-cons(dirs0, files), dcache-cons(dcache, dirs0, files), icache-cons(icache, dirs0, files), pcache-cons(pcache, dirs0, files), synced(dirs0, icache, pcache), str ∈ dirs0[m].entries, str ∈ entries1, m ∈ dirs0, entries1[str] ∈ files, m0 ∈ dirs0, 1 ≤ dirs0[m].size, ¬ str0 ∈ entries0, ¬ entries1[str] ∈ dirs0, ¬ str0 ∈ dirs0[m0].entries, asynced2 → synced(files, icache, pcache), m0 = m → md1 = md0, links(m, dirs0) ≠ ∅ ∨ m = ROOT_INO, links(m0, dirs0) ≠ ∅ ∨ m0 = ROOT_INO ⊦ [afs_inode_sync#(mkinode(m, md0, true, dirs0[m].nlink, dirs0[m].nsubdirs, dirs0[m].size); dirs, files); afs_inode_sync#(mkinode(m0, md1, true, # links(m0, dirs0), dirs0[m0].nsubdirs, dirs0[m0].size); dirs, files); skip; old_parent_inode := (m ∈ dirs ⊃ mkinode(m, dirs[m].meta, true, dirs[m].nlink, dirs[m].nsubdirs, dirs[m].size) ;mkinode(m, files[m].meta, false, files[m].nlink, 0, files[m].size) ); new_parent_inode := (m0 ∈ dirs ⊃ mkinode(m0, dirs[m0].meta, true, dirs[m0].nlink, dirs[m0].nsubdirs, dirs[m0].size) ;mkinode(m0, files[m0].meta, false, files[m0].nlink, 0, files[m0].size) ); err := ESUCCESS; asynced := ?] ( afs-cons(dirs, files) → ⟪if err = ESUCCESS then let asynced = false in {icache_set#(old_parent_inode, asynced; err, icache); icache_set#(new_parent_inode, asynced; err, icache); skip; dcache_delete#(old_parent_inode.ino, mkdentry(str, entries1[str]).name; err, dcache); dcache_set# (new_parent_inode.ino, mkdentry(str0, mkdentry(str, entries1[str]).ino).name, mkdentry(str0, mkdentry(str, entries1[str]).ino) ; err, dcache)}⟫ ( icache-cons(icache, dirs, files) ∧ dcache-cons(dcache, dirs, files) ∧ pcache-cons(pcache, dirs, files) ∧ synced(dirs, icache, pcache) ∧ (asynced2 → synced(files, icache, pcache))))

Heuristic elimination applied rule insert elim lemma

And obtained the following new goals

Proof step 64:
# links(m, dirs0) = dirs0[m].nlink, # links(m0, dirs0) = dirs0[m0].nlink, # links(entries1[str], dirs0) = files[entries1[str]].nlink, dirs0[m].size = m2 + 1, dirs0[m0] = mkdir(dirs0[m0].size, md5, dirs0[m0].nlink, dirs0[m0].nsubdirs, entries0), files[entries1[str]] = mkfile(m1, md4, files[entries1[str]].nlink, content), dirs0[m] = mkdir(dirs0[m].size, md2, dirs0[m].nlink, dirs0[m].nsubdirs, entries1), entries1[str] = dirs0[m].entries[str], dirs = dirs0[m, (dirs0[m].entries:= (dirs0[m].entries -- str)).size:= m2] [m0, ( (m0 = m ⊃ (dirs0[m].entries:= (dirs0[m].entries -- str)).size:= m2;dirs0[m0]) .entries:= (m0 = m ⊃ (dirs0[m].entries:= (dirs0[m].entries -- str)).size:= m2;dirs0[m0]).entries[str0, entries1[str]]) .size:= ((m0 = m ⊃ (dirs0[m].entries:= (dirs0[m].entries -- str)).size:= m2;dirs0[m0]).size + 1) ], afs-cons(dirs0, files), dcache-cons(dcache, dirs0, files), icache-cons(icache, dirs0, files), pcache-cons(pcache, dirs0, files), synced(dirs0, icache, pcache), m0 ∈ dirs0, entries1[str] ∈ files, m ∈ dirs0, str ∈ entries1, str ∈ dirs0[m].entries, 1 ≤ dirs0[m].size, m0 = m → md1 = md0, asynced2 → synced(files, icache, pcache), links(m0, dirs0) ≠ ∅ ∨ m0 = ROOT_INO, links(m, dirs0) ≠ ∅ ∨ m = ROOT_INO ⊦ [afs_inode_sync#(mkinode(m, md0, true, dirs0[m].nlink, dirs0[m].nsubdirs, dirs0[m].size); dirs, files); afs_inode_sync#(mkinode(m0, md1, true, # links(m0, dirs0), dirs0[m0].nsubdirs, dirs0[m0].size); dirs, files); skip; old_parent_inode := (m ∈ dirs ⊃ mkinode(m, dirs[m].meta, true, dirs[m].nlink, dirs[m].nsubdirs, dirs[m].size) ;mkinode(m, files[m].meta, false, files[m].nlink, 0, files[m].size) ); new_parent_inode := (m0 ∈ dirs ⊃ mkinode(m0, dirs[m0].meta, true, dirs[m0].nlink, dirs[m0].nsubdirs, dirs[m0].size) ;mkinode(m0, files[m0].meta, false, files[m0].nlink, 0, files[m0].size) ); err := ESUCCESS; asynced := ?] ( afs-cons(dirs, files) → ⟪if err = ESUCCESS then let asynced = false in {icache_set#(old_parent_inode, asynced; err, icache); icache_set#(new_parent_inode, asynced; err, icache); skip; dcache_delete#(old_parent_inode.ino, mkdentry(str, entries1[str]).name; err, dcache); dcache_set# (new_parent_inode.ino, mkdentry(str0, mkdentry(str, entries1[str]).ino).name, mkdentry(str0, mkdentry(str, entries1[str]).ino) ; err, dcache)}⟫ ( icache-cons(icache, dirs, files) ∧ dcache-cons(dcache, dirs, files) ∧ pcache-cons(pcache, dirs, files) ∧ synced(dirs, icache, pcache) ∧ (asynced2 → synced(files, icache, pcache)))), dirs0[m].size = 0, str0 ∈ entries0, entries1[str] ∈ dirs0, str0 ∈ dirs0[m0].entries

Rule argument

spec: nat name: elim-pred-c seq: n ≠ 0 ⊦ m = n - 1 ↔ n = m + 1 subst: [n, m] → [dirs0[m].size, m2]

Additional information

Used simplifier rules: n ≠ 0 ⊦ m = n - 1 ↔ n = m + 1; (elim) Used terms: dirs0[m].size, m2