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

st[r -- mkfs(class, ty1, fieldvar) '] = refval(r1), r1 ' + refs1 = refs + r0 ' + refs0, 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), ¬ is_valid_ref(str, r0, st) ∨ is_obj(refs .last, st) ∧ mkfs(class0, ty2, fieldvar0) ' ∈ instfields(st[refs .last -- _type] .type .class) ∧ is_referencevalue(st[refs .last -- mkfs(class0, ty2, fieldvar0) ']) ∧ r0 = st[refs .last -- mkfs(class0, ty2, fieldvar0) '] .refval ∧ ¬ st[st[refs .last -- mkfs(class0, ty2, fieldvar0) '] .refval -- _type] .type ≤ ty2 ∨ 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, ∀ 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 = [], r = jvmref, r0 = jvmref, ∃ fs. fs ' ∈ instfields(st[r -- _type] .type .class) ∧ is_referencevalue(st[r -- fs ']) ∧ refs .first = st[r -- fs '] .refval ∧ validrefs(str, refs, fs .type, st)

Heuristic elimination applied rule insert elim lemma

And obtained the following new goals

Proof step 27:
refs = r2 + refs2, st[r -- mkfs(class, ty1, fieldvar) '] = refval(r1), r1 ' + refs1 = refs + r0 ' + refs0, 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), ¬ is_valid_ref(str, r0, st) ∨ is_obj(refs .last, st) ∧ mkfs(class0, ty2, fieldvar0) ' ∈ instfields(st[refs .last -- _type] .type .class) ∧ is_referencevalue(st[refs .last -- mkfs(class0, ty2, fieldvar0) ']) ∧ r0 = st[refs .last -- mkfs(class0, ty2, fieldvar0) '] .refval ∧ ¬ st[st[refs .last -- mkfs(class0, ty2, fieldvar0) '] .refval -- _type] .type ≤ ty2 ∨ 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, ∀ 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 = [], r = jvmref, r0 = jvmref, ∃ fs. fs ' ∈ instfields(st[r -- _type] .type .class) ∧ is_referencevalue(st[r -- fs ']) ∧ r2 = st[r -- fs '] .refval ∧ validrefs(str, refs, fs .type, st)

Rule argument

[speclemmaarg: refs ≠ [] ,r = refs .first ∧ refs0 = refs .rest ↔ refs = r + refs0 ,[refs, r, refs0] → [refs, r2, refs2] ,T ,list-data ,references-olista ,elim-list-c ]

Additional information

[[CONCRETESIMPRULES : ([CSIMPELIM : refs ≠ [] ⊦ r = refs .first ∧ refs0 = refs .rest ↔ refs = r + refs0])], [EXTRATERMS : (refs, r2, refs2)]]