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

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

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Proof step 371:
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)

Rule argument

[emptyarg]

Additional information

[[CONCRETESIMPRULES : ([CSIMPNAMEDSEQ : javatype, , test-16, ⊦ ¬ is_classtype (mkarraytype(ty))], [CSIMPNAMEDFORWARD : int-abs, , forward-lels, ⊦ i ≤ j ∧ j < j0 → i < j0], [CSIMPNAMEDSEQ : store, javastore, At-same, ⊦ (st[rk, val][rk]) = val], [CSIMPNAMEDSEQ : javavalue, , inj-03, ⊦ refval(r) = refval(r0) ↔ r = r0], [CSIMPNAMEDSEQ : list, storekeys, Last, ⊦ sks + sk = sks + sk '], [CSIMPNAMEDSEQ : list, storekeys, c, ⊦ sk + sks = sk ' + sks])]]