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

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

Heuristic simplifier applied rule simplifier

And obtained the following new goals

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

Rule argument

[emptyarg]

Additional information

[[CONCRETESIMPRULES : ([CSIMPNAMEDFORWARD : int-abs, , forward-le-05, ⊦ i < j ∧ 0 ≤ i → 0 < j], [CSIMPNAMEDSEQ : list, storekeys, Last, ⊦ sks + sk = sks + sk '], [CSIMPNAMEDSEQ : list, storekeys, a, ⊦ (sks + sks0) + sks1 = sks + sks0 + sks1], [CSIMPNAMEDSEQ : list, storekeys, c, ⊦ sk + sks = sk ' + sks])]]