| ∃ refs2, refs1. refs0 = refs2 + refs1 ∧ # refs2 = # refs, st[r -- firstn(1 + # refs, sks0)] .refval = refs0[# refs], # refs + # refs1 = # refs2 + # refs0, # sks0 = 2 + # refs2 + # refs0, fits(r, sks0, st), validrefs(str, (r ' + refs0) + r2 ' + refs2 + r0 ', st[r -- _type] .type, st), validrefs(str, (r ' + refs) + refs0[# refs] ' + refs1 + r0 ', st[r -- _type] .type, st), # refs < # refs0 ⊦ r0 = jvmref, refs0[# refs] = r0, r2 = refs0[# refs], # refs = # refs0, refs0 = [], hasSharing(r, st), path∃(str, refs0[# refs], r2, st), path∃(str, r2, refs0[# refs], st) |
# refs1 = # refs3 + # refs2, # sks0 = 2 + # refs + # refs1, # refs4 = # refs, st[r -- firstn(1 + # refs, sks0)] .refval = (refs4 + refs3)[# refs], fits(r, sks0, st), validrefs(str, (r ' + refs4 + refs3) + r2 ' + refs2 + r0 ', st[r -- _type] .type, st), validrefs(str, (r ' + refs) + (refs4 + refs3)[# refs] ' + refs1 + r0 ', st[r -- _type] .type, st) ⊦ refs3 = [], refs4 + refs3 = [], r0 = jvmref, (refs4 + refs3)[# refs] = r0, r2 = (refs4 + refs3)[# refs], hasSharing(r, st), path∃(str, (refs4 + refs3)[# refs], r2, st), path∃(str, r2, (refs4 + refs3)[# refs], st)
[[CONCRETESIMPRULES : ([CSIMPSEQ : ⊦ m < m + n ↔ n ≠ 0], [CSIMPSEQ : ⊦ # refs = 0 ↔ refs = []], [CSIMPSEQ : ⊦ m = m + n ↔ n = 0], [CSIMPSEQ : ⊦ m < n → n ≠ 0], [CSIMPSEQ : ⊦ m + n = m + n0 ↔ n = n0], [CSIMPFORWARD : ⊦ m < n → n ≠ 0], [CSIMPFORWARD : ⊦ m < n ∧ m = n0 → n0 < n], [CSIMPSEQ : ⊦ m + n = n + m], [CSIMPSEQ : ⊦ (m + n0) + n1 = m + n0 + n1], [CSIMPSEQ : ⊦ (refs + refs0) + refs1 = refs + refs0 + refs1], [CSIMPSEQ : ⊦ # (refs + refs0) = # refs + # refs0])]]