[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 18 from proof validrefs-junkrefs (previous step)

is_array(refs .last, st) ∧ 0 ≤ i ∧ i < st[refs .last -- _length] .intval ∧ is_referencevalue(st[refs .last -- i ']) ∧ r0 = st[refs .last -- i '] .refval ∧ ¬ st[st[refs .last -- i '] .refval -- _type] .type ≤ st[refs .last -- _type] .type .type, r1 ' + refs1 = refs + r0 ' + refs0, st[r -- mkfs(class, ty1, fieldvar) '] = refval(r1), validrefs(str, r ' + refs, ty, st), validrefs(str, refs, ty1, st), mkfs(class, ty1, fieldvar) ' ∈ instfields(st[r -- _type] .type .class), is_obj(str, r, st), st[r -- _type] .type ≤ ty, junkrefs(str, r1 ' + refs1, ty1, st), r1 ∈ refs, is_valid_ref(str, r0, st), ∀ str0, ty0, st0. junkrefs(str0, r1 ' + refs1, ty0, st0) → (∃ refs, r0, refs0. r1 ' + refs1 = refs + r0 ' + refs0 ∧ validrefs(str0, refs, ty0, st0) ∧ r0 ≠ jvmref ∧ ( ¬ is_valid_ref(str0, r0, st0) ∨ refs = [] ∧ ¬ st0[r0 -- _type] .type ≤ ty0 ∨ refs ≠ [] ∧ ( is_obj(refs .last, st0) ∧ (∃ fs. fs ' ∈ instfields(st0[refs .last -- _type] .type .class) ∧ is_referencevalue(st0[refs .last -- fs ']) ∧ r0 = st0[refs .last -- fs '] .refval ∧ ¬ st0[st0[refs .last -- fs '] .refval -- _type] .type ≤ fs .type) ∨ is_array(refs .last, st0) ∧ (∃ i. 0 ≤ i ∧ i < st0[refs .last -- _length] .intval ∧ is_referencevalue(st0[refs .last -- i ']) ∧ r0 = st0[refs .last -- i '] .refval ∧ ¬ st0[st0[refs .last -- i '] .refval -- _type] .type ≤ st0[refs .last -- _type] .type .type)))) ⊦ refs = [], r0 = jvmref, r = jvmref, is_obj(refs .last, st) ∧ (∃ fs. fs ' ∈ instfields(st[refs .last -- _type] .type .class) ∧ is_referencevalue(st[refs .last -- fs ']) ∧ r0 = st[refs .last -- fs '] .refval ∧ ¬ st[st[refs .last -- fs '] .refval -- _type] .type ≤ fs .type), is_array(refs .last, st) ∧ (∃ i0. ¬ i0 < 0 ∧ ¬ st[refs .last -- _length] .intval ≤ i0 ∧ is_referencevalue(st[refs .last -- i0 ']) ∧ r0 = st[refs .last -- i0 '] .refval ∧ ¬ st[st[refs .last -- i0 '] .refval -- _type] .type ≤ st[refs .last -- _type] .type .type)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Proof step 17:
st[r -- mkfs(class, ty1, fieldvar) '] = refval(r1), r1 ' + refs1 = refs + st[refs .last -- i '] .refval ' + refs0, 0 < st[refs .last -- _length] .intval, 0 ≤ i, is_valid_ref(str, st[refs .last -- i '] .refval, st), r1 ∈ refs, junkrefs(str, r1 ' + refs1, ty1, st), st[r -- _type] .type ≤ ty, is_obj(str, r, st), mkfs(class, ty1, fieldvar) ' ∈ instfields(st[r -- _type] .type .class), validrefs(str, refs, ty1, st), validrefs(str, r ' + refs, ty, st), is_referencevalue(st[refs .last -- i ']), i < st[refs .last -- _length] .intval, is_array(refs .last, st), ∀ str0, ty0, st0. junkrefs(str0, r1 ' + refs1, ty0, st0) → (∃ refs, r0, refs0. r1 ' + refs1 = refs + r0 ' + refs0 ∧ validrefs(str0, refs, ty0, st0) ∧ r0 ≠ jvmref ∧ ( ¬ is_valid_ref(str0, r0, st0) ∨ refs = [] ∧ ¬ st0[r0 -- _type] .type ≤ ty0 ∨ refs ≠ [] ∧ ( is_obj(refs .last, st0) ∧ (∃ fs. fs ' ∈ instfields(st0[refs .last -- _type] .type .class) ∧ is_referencevalue(st0[refs .last -- fs ']) ∧ r0 = st0[refs .last -- fs '] .refval ∧ ¬ st0[st0[refs .last -- fs '] .refval -- _type] .type ≤ fs .type) ∨ is_array(refs .last, st0) ∧ (∃ i. 0 ≤ i ∧ i < st0[refs .last -- _length] .intval ∧ is_referencevalue(st0[refs .last -- i ']) ∧ r0 = st0[refs .last -- i '] .refval ∧ ¬ st0[st0[refs .last -- i '] .refval -- _type] .type ≤ st0[refs .last -- _type] .type .type)))) ⊦ r = jvmref, st[refs .last -- i '] .refval = jvmref, refs = [], st[st[refs .last -- i '] .refval -- _type] .type ≤ st[refs .last -- _type] .type .type, ∃ i0. ¬ i0 < 0 ∧ ¬ st[refs .last -- _length] .intval ≤ i0 ∧ is_referencevalue(st[refs .last -- i0 ']) ∧ st[refs .last -- i '] .refval = st[refs .last -- i0 '] .refval ∧ ¬ st[st[refs .last -- i0 '] .refval -- _type] .type ≤ st[refs .last -- _type] .type .type

Rule argument

[emptyarg]

Additional information

[[CONCRETESIMPRULES : ([CSIMPSEQ : ⊦ r ∈ refs → r ∈ refs + refs0], [CSIMPFORWARD : ⊦ i ≤ j ∧ 0 ≤ i → 0 ≤ j], [CSIMPFORWARD : ⊦ i < j ∧ 0 ≤ i → 0 < j], [CSIMPSEQ : ⊦ (refs + refs0) + refs1 = refs + refs0 + refs1], [CSIMPFORWARD : ⊦ r ' + refs = refs0 → r ∈ refs0], [CSIMPSEQ : ⊦ is_array(r, st) → ¬ is_obj(r, st)])]]