[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 56 from proof refine-close (previous step)

# links(m, dirs) = 0, files[m] = mkfile(m1, md, 0, content), of0[fd] = mkfile(m, mode, m0), fs = abs-files(files), ofh = abs-of(of0), root.dir?, dom of0 < ino0, abs(root, ROOT_INO)(dirs), afs-cons(dirs, files -- m), afs-cons(dirs, files), fids-cons(root, abs-files(files), abs-of(of0)), of-cons(of0, dirs, files), of-cons(of0 -- fd, dirs, files -- m), m ∈ files, fd ∈ of0, psynced → asynced ⊦ ⟨err0 := ESUCCESS; if err0 = ESUCCESS then let fid = ofh[fd].fid in {ofh := ofh -- fd; if ¬ fid ∈ ofh.fids ∧ ¬ fid ∈ root.fids then fs := fs -- fid}⟩ (ofh = abs-of(of0 -- fd) ∧ fs = abs-files(files -- m) ∧ (psynced → asynced) ∧ ESUCCESS = err0), m = ROOT_INO, is-open(m, of0 -- fd)

Heuristic symbolic execution applied rule assign right

And obtained the following new goals

Proof step 57:
# links(m, dirs) = 0, of0[fd] = mkfile(m, mode, m0), files[m] = mkfile(m1, md, 0, content), err0 = ESUCCESS, fs = abs-files(files), ofh = abs-of(of0), root.dir?, dom of0 < ino0, abs(root, ROOT_INO)(dirs), afs-cons(dirs, files), afs-cons(dirs, files -- m), fids-cons(root, abs-files(files), abs-of(of0)), of-cons(of0 -- fd, dirs, files -- m), of-cons(of0, dirs, files), fd ∈ of0, m ∈ files, psynced → asynced ⊦ ⟨if err0 = ESUCCESS then let fid = ofh[fd].fid in {ofh := ofh -- fd; if ¬ fid ∈ ofh.fids ∧ ¬ fid ∈ root.fids then fs := fs -- fid}⟩ (ofh = abs-of(of0 -- fd) ∧ fs = abs-files(files -- m) ∧ (psynced → asynced) ∧ ESUCCESS = err0), m = ROOT_INO, is-open(m, of0 -- fd)

Proof step 56 from proof refine-close (previous step)

Heuristic symbolic execution applied rule assign right

And obtained the following new goals

Rule argument

Additional information