[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 94 from proof replayone-prog (previous step)

boolvar1 ↔ boolvar0, boolvar ↔ boolvar0, fs[adr] = dentrynode(dentrykey(ino, str), 0), err = ESUCCESS, key = dentrykey(ino, str), nd = fs[adr], ri = ri1 -- key, ri0 = ri1, adr ∈ fs ⊦ ⟪if nd.data? then {let key = inodekey(nd.key.ino) in aubifs_core_index_contains#(key, ri, fi, ro, fo, fs, log, boolvar0; boolvar; err); if err = ESUCCESS ∧ boolvar then aubifs_core_index_store#(nd.key, adr, fi, ro, fo, fs, log, boolvar0; ri)}; if nd.trunc? then aubifs_core_index_truncate#(nd.key, nd.size, fi, ro, fo, fs, log, boolvar0; ri)⟫ ((err = ESUCCESS ∨ ⌊err⌋ ) ∧ (err = ESUCCESS → ri = replay-one(adr, fs[adr], ri0))), adr ∈ ri1

Heuristic symbolic execution applied rule if negative right

And obtained the following new goals

Proof step 95:
boolvar ↔ boolvar0, boolvar1 ↔ boolvar0, fs[adr] = dentrynode(dentrykey(ino, str), 0), err = ESUCCESS, key = dentrykey(ino, str), nd = fs[adr], ri = ri1 -- key, ri0 = ri1, adr ∈ fs ⊦ ⟪skip; if nd.trunc? then aubifs_core_index_truncate#(nd.key, nd.size, fi, ro, fo, fs, log, boolvar0; ri)⟫ ((err = ESUCCESS ∨ ⌊err⌋ ) ∧ (err = ESUCCESS → ri = replay-one(adr, fs[adr], ri0))), adr ∈ ri1

Rule argument

pos: right 1

Additional information

Used simplifier rules: ⊦ ¬ dentrynode(key, m).data?; (s)