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

fs[ri[inodekey(m)]].directory, fo.inodes?, ro.inodes?, file-node-cons(fs, ri), log-cons(log, fs), orphans-cons(fs, ri, ro), replay-cons-strong(fs, ri, ro, fi, fo, log), ri-inj(fi), ri-inj(ri), ubifs-cons(fs, ri, ro, fi, fo, log), inodekey(m) ∈ ri ⊦ ⟪aubifs_core_index_entries#(inodekey(m), ri, fi, ro, fo, fs, log, boolvar; strings; err)⟫ true

User applied rule call right

And obtained the following new goals

Proof step 11:
key = inodekey(m), fs[ri[inodekey(m)]].directory, ro.inodes?, fo.inodes?, file-node-cons(fs, ri), log-cons(log, fs), orphans-cons(fs, ri, ro), replay-cons-strong(fs, ri, ro, fi, fo, log), ri-inj(ri), ri-inj(fi), ubifs-cons(fs, ri, ro, fi, fo, log), inodekey(m) ∈ ri ⊦ ⟪fail_or_success#(; ; err); if err = ESUCCESS then strings := dentries(key, ri) else strings := ?⟫ true

Rule argument

pos: right 1

Additional information

Used simplifier rules: aubifs_core_index_entries# (KEY, RI, FI, RO, FO, FS, LOG, CSYNCED; NAMES; ERR) {fail_or_success#(; ; ERR); if ERR = ESUCCESS then NAMES := dentries(KEY, RI) else NAMES := ? };