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

fi0 = ∅ ⊦ ⟪aubifs_core_index_store#(inodekey(ROOT_INO), adr1, ∅, ∅, ∅, (∅)[adr1, inodenode(inodekey(ROOT_INO), md, true, 0, 0, 0)], adr1 ', boolvar; fi0); ro := ∅; log := adr1 '; fs := (∅)[adr1, inodenode(inodekey(ROOT_INO), md, true, 0, 0, 0)]; fo := ∅; fi := ∅; err := ESUCCESS; if err = ESUCCESS then aubifs_core_journal_sync#(fi0, fi, ro, fo, fs, log; ; boolvar, err)⟫ ( err = ESUCCESS → boolvar ∧ ubifs-cons(fs, fi0, ro, fi, fo, log) ∧ replay-cons-strong(fs, fi0, ro, fi, fo, log) ∧ file-node-cons(fs, fi0) ∧ orphans-cons(fs, fi0, ro) ∧ ri-inj(fi))

Heuristic unfold applied rule call right

And obtained the following new goals

Proof step 32:
adr = adr1, fi = ∅, fi0 = ∅, fo = ∅, fs = (∅)[adr1, inodenode(inodekey(ROOT_INO), md, true, 0, 0, 0)], key = inodekey(ROOT_INO), log = adr1 ', ri = fi0, ro = ∅ ⊦ ⟪if ¬ adr ∈ ri ∧ adr ∈ fs ∧ key-cons(key, fs[adr]) then ri[key] := adr else abort; ro := ∅; log := adr1 '; fs := (∅)[adr1, inodenode(inodekey(ROOT_INO), md, true, 0, 0, 0)]; fo := ∅; fi := ∅; err := ESUCCESS; fi0 := ri; if err = ESUCCESS then aubifs_core_journal_sync#(fi0, fi, ro, fo, fs, log; ; boolvar, err)⟫ ( err = ESUCCESS → boolvar ∧ ubifs-cons(fs, fi0, ro, fi, fo, log) ∧ replay-cons-strong(fs, fi0, ro, fi, fo, log) ∧ file-node-cons(fs, fi0) ∧ orphans-cons(fs, fi0, ro) ∧ ri-inj(fi))

Rule argument

pos: right 1

Additional information

Used simplifier rules: aubifs_core_index_store#(KEY, ADR, FI, RO, FO, FS, LOG, CSYNCED; RI) {if ¬ ADR ∈ RI ∧ ADR ∈ FS ∧ key-cons(KEY, FS[ADR]) then RI[KEY] := ADR else abort };