[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 371 from proof hasSharing-put-index-refval (previous step)

st[r -- sks1] = refval(r2), (st[r2 -- i ', refval(r4)][r4 -- sks3]) = refval(r1), st[r2 -- _type] .type = mkarraytype(ty), (st[r2 -- i ', refval(r4)][r4 -- (sks + i ' ' + sks0)]) = refval(r1), st[r4 -- sks] = refval(r2), 0 < st[r2 -- _length] .intval, is_referencevalue(st[r2 -- i ', refval(r4)][r2 -- (i ' ' + sks3)]), 0 ≤ i, i < st[r2 -- _length] .intval, fits(r4, sks3, st[r2 -- i ', refval(r4)]), fits(r, sks1, st), disjoint(str, r ' + r4 ', st), validref(str, r4, ty, st), is_referencevalue(st[r2 -- i ', refval(r4)][r2 -- (i ' ' + sks + i ' ' + sks0)]), fits(r4, sks, st), fits(r4, sks0, st[r2 -- i ', refval(r4)]) ⊦ r4 = jvmref, sks1 = [], r2 = jvmref, r = r4, r1 = jvmref, sks + i ' ' + sks0 = sks3, junkref(str, r, st), hasSharing(r4, st), hasSharing(r, st), ∃ sks0, sks4. sks1 = sks0 + i ' ' + sks4 ∧ st[r -- sks0] .refval = r2 ∧ (∀ sks5. sks5 + i ' ' ⊑ sks0 → st[r -- sks5] .refval ≠ st[r -- sks0] .refval), ∃ sks4. ¬ (sks4 + i ' ' ⊑ sks1 → st[r -- sks4] .refval ≠ r2), ∃ sks0, sks2. sks1 = sks0 + i ' ' + sks2 ∧ st[r -- sks0] .refval = r2 ∧ (∀ sks4. sks4 + i ' ' ⊑ sks0 → st[r -- sks4] .refval ≠ st[r -- sks0] .refval), ∃ sks2. ¬ (sks2 + i ' ' ⊑ sks1 → st[r -- sks2] .refval ≠ r2), ∃ sks4. ¬ (sks4 + i ' ' ⊑ sks → st[r4 -- sks4] .refval ≠ r2), ∃ sks4, sks5. sks = sks4 + i ' ' + sks5 ∧ st[r4 -- sks4] .refval = r2 ∧ (∀ sks2. sks2 + i ' ' ⊑ sks4 → st[r4 -- sks2] .refval ≠ st[r4 -- sks4] .refval)

User applied rule insert rewrite lemma

And obtained the following new goals

Proof step 361:
⊦ validreflist(str, mkjavavalues(refs), mkclasstype(`java.lang.Object' .class), st) → ( disjoint(str, refs, st) ↔ ¬ (∃ r1, sks1, r2, sks2. r1 ∈ refs ∧ r2 ∈ refs ∧ r1 ≠ r2 ∧ fits(r1, sks1, st) ∧ fits(r2, sks2, st) ∧ st[r1 -- sks1] = st[r2 -- sks2] ∧ st[r1 -- sks1] .refval ≠ jvmref))
Proof step 368:
¬ validreflist(str, mkjavavalues(r ' + r4 '), mkclasstype(`java.lang.Object' .class), st), st[r -- sks1] = refval(r2), (st[r2 -- i ', refval(r4)][r4 -- sks3]) = refval(r1), st[r2 -- _type] .type = mkarraytype(ty), (st[r2 -- i ', refval(r4)][r4 -- (sks + i ' ' + sks0)]) = refval(r1), st[r4 -- sks] = refval(r2), 0 < st[r2 -- _length] .intval, is_referencevalue(st[r2 -- i ', refval(r4)][r2 -- (i ' ' + sks3)]), 0 ≤ i, i < st[r2 -- _length] .intval, fits(r4, sks3, st[r2 -- i ', refval(r4)]), fits(r, sks1, st), disjoint(str, r ' + r4 ', st), validref(str, r4, ty, st), is_referencevalue(st[r2 -- i ', refval(r4)][r2 -- (i ' ' + sks + i ' ' + sks0)]), fits(r4, sks, st), fits(r4, sks0, st[r2 -- i ', refval(r4)]) ⊦ r4 = jvmref, sks1 = [], r2 = jvmref, r = r4, r1 = jvmref, sks + i ' ' + sks0 = sks3, junkref(str, r, st), hasSharing(r4, st), hasSharing(r, st), ∃ sks0, sks4. sks1 = sks0 + i ' ' + sks4 ∧ st[r -- sks0] .refval = r2 ∧ (∀ sks5. sks5 + i ' ' ⊑ sks0 → st[r -- sks5] .refval ≠ st[r -- sks0] .refval), ∃ sks4. ¬ (sks4 + i ' ' ⊑ sks1 → st[r -- sks4] .refval ≠ r2), ∃ sks0, sks2. sks1 = sks0 + i ' ' + sks2 ∧ st[r -- sks0] .refval = r2 ∧ (∀ sks4. sks4 + i ' ' ⊑ sks0 → st[r -- sks4] .refval ≠ st[r -- sks0] .refval), ∃ sks2. ¬ (sks2 + i ' ' ⊑ sks1 → st[r -- sks2] .refval ≠ r2), ∃ sks4. ¬ (sks4 + i ' ' ⊑ sks → st[r4 -- sks4] .refval ≠ r2), ∃ sks4, sks5. sks = sks4 + i ' ' + sks5 ∧ st[r4 -- sks4] .refval = r2 ∧ (∀ sks2. sks2 + i ' ' ⊑ sks4 → st[r4 -- sks2] .refval ≠ st[r4 -- sks4] .refval)
Proof step 370:
validreflist(str, mkjavavalues(r ' + r4 '), mkclasstype(`java.lang.Object' .class), st), st[r -- sks1] = refval(r2), (st[r2 -- i ', refval(r4)][r4 -- sks3]) = refval(r1), st[r2 -- _type] .type = mkarraytype(ty), (st[r2 -- i ', refval(r4)][r4 -- (sks + i ' ' + sks0)]) = refval(r1), st[r4 -- sks] = refval(r2), 0 < st[r2 -- _length] .intval, is_referencevalue(st[r2 -- i ', refval(r4)][r2 -- (i ' ' + sks3)]), 0 ≤ i, i < st[r2 -- _length] .intval, fits(r4, sks3, st[r2 -- i ', refval(r4)]), fits(r, sks1, st), ∀ r1, sks1, r2, sks2. ¬ ( r1 ∈ r ' + r4 ' ∧ r2 ∈ r ' + r4 ' ∧ r1 ≠ r2 ∧ fits(r1, sks1, st) ∧ fits(r2, sks2, st) ∧ st[r1 -- sks1] = st[r2 -- sks2] ∧ st[r1 -- sks1] .refval ≠ jvmref), validref(str, r4, ty, st), is_referencevalue(st[r2 -- i ', refval(r4)][r2 -- (i ' ' + sks + i ' ' + sks0)]), fits(r4, sks, st), fits(r4, sks0, st[r2 -- i ', refval(r4)]) ⊦ r4 = jvmref, sks1 = [], r2 = jvmref, r = r4, r1 = jvmref, sks + i ' ' + sks0 = sks3, junkref(str, r, st), hasSharing(r4, st), hasSharing(r, st), ∃ sks0, sks4. sks1 = sks0 + i ' ' + sks4 ∧ st[r -- sks0] .refval = r2 ∧ (∀ sks5. sks5 + i ' ' ⊑ sks0 → st[r -- sks5] .refval ≠ st[r -- sks0] .refval), ∃ sks4. ¬ (sks4 + i ' ' ⊑ sks1 → st[r -- sks4] .refval ≠ r2), ∃ sks0, sks2. sks1 = sks0 + i ' ' + sks2 ∧ st[r -- sks0] .refval = r2 ∧ (∀ sks4. sks4 + i ' ' ⊑ sks0 → st[r -- sks4] .refval ≠ st[r -- sks0] .refval), ∃ sks2. ¬ (sks2 + i ' ' ⊑ sks1 → st[r -- sks2] .refval ≠ r2), ∃ sks4. ¬ (sks4 + i ' ' ⊑ sks → st[r4 -- sks4] .refval ≠ r2), ∃ sks4, sks5. sks = sks4 + i ' ' + sks5 ∧ st[r4 -- sks4] .refval = r2 ∧ (∀ sks2. sks2 + i ' ' ⊑ sks4 → st[r4 -- sks2] .refval ≠ st[r4 -- sks4] .refval)

Rule argument

[x0lemmaarg: spec-name: instance-name: lemma-name: disjoint-def-fits antecedent: succedent: validreflist (str, mkjavavalues(refs), mkclasstype(`java.lang.Object' .class), st) → ( disjoint(str, refs, st) ↔ ¬ (∃ r1, sks1, r2, sks2. r1 ∈ refs ∧ r2 ∈ refs ∧ r1 ≠ r2 ∧ fits(r1, sks1, st) ∧ fits(r2, sks2, st) ∧ st[r1 -- sks1] = st[r2 -- sks2] ∧ st[r1 -- sks1] .refval ≠ jvmref)) substlist: [st, refs, str] → [st, r ' + r4 ', str] add preconditions?: F is rewrite lemma?: T current spec?: T rotate lemma?: F replace all?: T paths: ((0, 0, 11)) dummy: () ]

Additional information

[[CONCRETESIMPRULES : ()], [EXTRATERMS : (st, r ' + r4 ', str)]]