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

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

User applied rule insert rewrite lemma

And obtained the following new goals

Proof step 177:
⊦ 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 180:
¬ validreflist(str, mkjavavalues(r ' + r2 '), mkclasstype(`java.lang.Object' .class), st), (st[r -- i ', refval(r2)][r0 -- i ']) = refval(r3), (st[r -- i ', refval(r2)][r2 -- sks]) = refval(r0), st[r2 -- sks] = refval(r), st[r2 -- sks1] = refval(r1), st[r -- _type] .type = mkarraytype(ty), (st[r -- i ', refval(r2)][r3 -- sks0]) = refval(r1), fits(r3, sks0, st[r -- i ', refval(r2)]), fits(r2, sks, st), 0 ≤ i, i < st[r -- _length] .intval, fits(r2, sks1, st), is_referencevalue(st[r -- i ', refval(r2)][r -- (i ' ' + sks1)]), 0 < st[r -- _length] .intval, validref(str, r2, ty, st), disjoint(str, r ' + r2 ', st), is_referencevalue(st[r -- i ', refval(r2)][r0 -- (i ' ' + sks0)]), is_arraytype(st[r0 -- _type] .type) → i < st[r0 -- _length] .intval ⊦ r0 = jvmref, sks1 = sks + i ' ' + sks0, r2 = jvmref, r1 = jvmref, r = r2, r = jvmref, sks = [], is_classtype(st[r0 -- _type] .type), hasSharing(r, st), hasSharing(r2, st), junkref(str, r, st), ∃ sks3, sks4. sks = sks3 + i ' ' + sks4 ∧ st[r2 -- sks3] .refval = r ∧ (∀ sks2. sks2 + i ' ' ⊑ sks3 → st[r2 -- sks2] .refval ≠ st[r2 -- sks3] .refval), ∃ sks2. ¬ (sks2 + i ' ' ⊑ sks → st[r2 -- sks2] .refval ≠ r), ∃ sks2, sks0. sks1 = sks2 + i ' ' + sks0 ∧ st[r2 -- sks2] .refval = r ∧ (∀ sks3. sks3 + i ' ' ⊑ sks2 → st[r2 -- sks3] .refval ≠ st[r2 -- sks2] .refval)
Proof step 183:
validreflist(str, mkjavavalues(r ' + r2 '), mkclasstype(`java.lang.Object' .class), st), (st[r -- i ', refval(r2)][r0 -- i ']) = refval(r3), (st[r -- i ', refval(r2)][r2 -- sks]) = refval(r0), st[r2 -- sks] = refval(r), st[r2 -- sks1] = refval(r1), st[r -- _type] .type = mkarraytype(ty), (st[r -- i ', refval(r2)][r3 -- sks0]) = refval(r1), fits(r3, sks0, st[r -- i ', refval(r2)]), fits(r2, sks, st), 0 ≤ i, i < st[r -- _length] .intval, fits(r2, sks1, st), is_referencevalue(st[r -- i ', refval(r2)][r -- (i ' ' + sks1)]), 0 < st[r -- _length] .intval, validref(str, r2, ty, st), ∀ r1, sks1, r0, sks2. ¬ ( r1 ∈ r ' + r2 ' ∧ r0 ∈ r ' + r2 ' ∧ r1 ≠ r0 ∧ fits(r1, sks1, st) ∧ fits(r0, sks2, st) ∧ st[r1 -- sks1] = st[r0 -- sks2] ∧ st[r1 -- sks1] .refval ≠ jvmref), is_referencevalue(st[r -- i ', refval(r2)][r0 -- (i ' ' + sks0)]), is_arraytype(st[r0 -- _type] .type) → i < st[r0 -- _length] .intval ⊦ r0 = jvmref, sks1 = sks + i ' ' + sks0, r2 = jvmref, r1 = jvmref, r = r2, r = jvmref, sks = [], is_classtype(st[r0 -- _type] .type), hasSharing(r, st), hasSharing(r2, st), junkref(str, r, st), ∃ sks3, sks4. sks = sks3 + i ' ' + sks4 ∧ st[r2 -- sks3] .refval = r ∧ (∀ sks2. sks2 + i ' ' ⊑ sks3 → st[r2 -- sks2] .refval ≠ st[r2 -- sks3] .refval), ∃ sks2. ¬ (sks2 + i ' ' ⊑ sks → st[r2 -- sks2] .refval ≠ r), ∃ sks2, sks0. sks1 = sks2 + i ' ' + sks0 ∧ st[r2 -- sks2] .refval = r ∧ (∀ sks3. sks3 + i ' ' ⊑ sks2 → st[r2 -- sks3] .refval ≠ st[r2 -- sks2] .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 ' + r2 ', str] add preconditions?: F is rewrite lemma?: T current spec?: T rotate lemma?: F replace all?: T paths: ((0, 0, 14)) dummy: () ]

Additional information

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