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

asynced3 ↔ false, asynced0 ↔ true, ¬ asynced, err = ESUCCESS, inode = mkinode(m, md, boolvar, m0, m1, m2), afs-cons(dirs, files), dcache-cons(dcache, dirs, files), icache-cons(icache, dirs, files), pcache-cons(pcache, dirs, files), synced(dirs, icache, pcache), asynced → synced(files, icache, pcache), m ∈ dirs ∧ m0 = dirs[m].nlink ∧ m2 = dirs[m].size ∧ m1 = dirs[m].nsubdirs ∧ boolvar ∨ m ∈ files ∧ m0 = files[m].nlink ∧ m1 = 0 ∧ ¬ boolvar ⊦ ⟪icache_get#(inode.ino, icache; asynced3, inode1, err); if err = ESUCCESS ∧ asynced3 then {inode1.meta := inode.meta; if ¬ inode.directory then inode1.size := inode.size; icache_set#(inode1, asynced0; err, icache)} else if asynced0 then err := EFAIL⟫ ( icache-cons(icache, dirs, files) ∧ dcache-cons(dcache, dirs, files) ∧ pcache-cons(pcache, dirs, files) ∧ synced(dirs, icache, pcache) ∧ (asynced → synced(files, icache, pcache)) ∧ afs-cons(dirs, files)), inode.directory

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Proof step 427:
¬ asynced3, err = ESUCCESS, afs-cons(dirs, files), dcache-cons(dcache, dirs, files), icache-cons(icache, dirs, files), pcache-cons(pcache, dirs, files), synced(dirs, icache, pcache), m ∈ files ⊦ ⟪icache_get#(m, icache; asynced3, inode1, err); if err = ESUCCESS ∧ asynced3 then {inode1.meta := md; inode1.size := m2; icache_set#(inode1, true; err, icache)} else if true then err := EFAIL⟫ (icache-cons(icache, dirs, files) ∧ synced(dirs, icache, pcache))

Rule argument

Additional information

Used simplifier rules: ⊦ mkinode(m, md, boolvar, m0, m1, m2).size = m2; (s)% ⊦ mkinode(m, md, boolvar, m0, m1, m2).meta = md; (s)% ⊦ mkinode(m, md, boolvar, m0, m1, m2).ino = m; (s)% ⊦ mkinode(m, md, boolvar, m0, m1, m2).directory ↔ boolvar; (s)