| listp(orl + qrl, vs, ps, owns) ∧ ¬ dups(orl + qrl) ∧ markedp(orl, ps) ∧ markedp(orl, vs) ∧ unmarkedp(qrl, ps) ∧ orl ≠ [] ∧ phead ∈ orl ∧ rvownerok(vretRefs, vrvHp, rvowns) ∧ allocrv(vretRefs, vrvHp) ∧ nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs) ∧ rvownerok(pretRefs, prvHp, rvowns) ∧ allocrv(pretRefs, prvHp) ∧ dom vrvHp = dom prvHp ∧ ( vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val)) ∧ (orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs)) ∧ (vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[(orl + qrl).last].next = null) ⊦ (∃ rl. orl + qrl + rl = orl + qrl) ∧ (∃ rl0. orl + rl0 = orl) ∧ vtail ∈ orl + qrl from vtail ∧ phead ∈ orl + qrl from phead ∧ vhead ∈ orl + qrl from vhead ∧ equalrl(orl + qrl, vs, ps, vs, ps) ∧ equalowns(vs, ps, owns, tid, vs, ps, owns) ∧ vretRefs(tid) = vretRefs(tid) ∧ (pretRefs(tid) = pretRefs(tid) ∨ vretRefs(tid) = pretRefs(tid)) ∧ rvownsrely(tid, rvowns, rvowns, vrvHp) ∧ rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs, vrvHp) ∧ dom vrvHp ⊆ dom vrvHp ∧ prvHpRely(vrvHp, prvHp, prvHp) ∧ noidRely(tid, orl + qrl, vs, orl + qrl, vs) ∧ nextnottidRely(tid, vhead, vs, vhead, vs) ∧ ownsRely(tid, owns, owns) |
dom vrvHp = dom prvHp, orl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, ¬ dups(orl + qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[(orl + qrl).last].next = null ⊦ (∃ rl. orl + qrl + rl = orl + qrl) ∧ (∃ rl0. orl + rl0 = orl) ∧ vtail ∈ orl + qrl from vtail ∧ phead ∈ orl + qrl from phead ∧ vhead ∈ orl + qrl from vhead ∧ equalrl(orl + qrl, vs, ps, vs, ps) ∧ equalowns(vs, ps, owns, tid, vs, ps, owns) ∧ vretRefs(tid) = vretRefs(tid) ∧ (pretRefs(tid) = pretRefs(tid) ∨ vretRefs(tid) = pretRefs(tid)) ∧ rvownsrely(tid, rvowns, rvowns, vrvHp) ∧ rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs, vrvHp) ∧ dom vrvHp ⊆ dom vrvHp ∧ prvHpRely(vrvHp, prvHp, prvHp) ∧ noidRely(tid, orl + qrl, vs, orl + qrl, vs) ∧ nextnottidRely(tid, vhead, vs, vhead, vs) ∧ ownsRely(tid, owns, owns)
| dom vrvHp = dom prvHp, orl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, ¬ dups(orl + qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[(orl + qrl).last].next = null ⊦ (∃ rl. orl + qrl + rl = orl + qrl) ∧ (∃ rl0. orl + rl0 = orl) ∧ vtail ∈ orl + qrl from vtail ∧ phead ∈ orl + qrl from phead ∧ vhead ∈ orl + qrl from vhead ∧ equalrl(orl + qrl, vs, ps, vs, ps) ∧ equalowns(vs, ps, owns, tid, vs, ps, owns) ∧ vretRefs(tid) = vretRefs(tid) ∧ (pretRefs(tid) = pretRefs(tid) ∨ vretRefs(tid) = pretRefs(tid)) ∧ rvownsrely(tid, rvowns, rvowns, vrvHp) ∧ rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs, vrvHp) ∧ dom vrvHp ⊆ dom vrvHp ∧ prvHpRely(vrvHp, prvHp, prvHp) ∧ noidRely(tid, orl + qrl, vs, orl + qrl, vs) ∧ nextnottidRely(tid, vhead, vs, vhead, vs) ∧ ownsRely(tid, owns, owns) |
dom vrvHp = dom prvHp, orl ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ vtail ∈ orl + qrl from vtail ∧ vhead ∈ orl + qrl from vhead
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] list-elem-in-app11: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ vs; (forward) from specification DMSQ list-elem-in-app12: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ ps; (forward) from specification DMSQ ⊦ ownsRely(tid, owns, owns); (s) ⊦ nextnottidRely(tid, vhead, vs, vhead, vs); (s) ⊦ noidRely(tid, rl, vs, rl, vs); (s) ⊦ prvHpRely(vrvHp, prvHp, prvHp); (s) ⊦ # s = # s0 → (s ⊆ s0 ↔ s = s0); (s) ⊦ rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs, vrvHp); (s) ⊦ rvownsrely(tid, rvowns, rvowns, vrvHp); (s) ⊦ equalowns(vs, ps, owns, tid, vs, ps, owns); (s) ⊦ equalrl(rl, vs, ps, vs, ps); (s) ⊦ r ∈ rl → r ∈ rl from r; (ss) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl; (s) ⊦ x = x + y ↔ y = []; (s) ⊦ # x = # z → (x + y = z + y0 ↔ x = z ∧ y = y0); (ws) ⊦ y ≠ [] → (x + y).last = y.last; (s)
| dom vrvHp = dom prvHp, orl ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ vtail ∈ orl + qrl from vtail ∧ vhead ∈ orl + qrl from vhead |
dom vrvHp = dom prvHp, vtail = (orl + qrl).last, orl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ vtail ∈ orl + qrl from vtail ∧ vhead ∈ orl + qrl from vhead
vs[qrl.last].deqID = None, vs[qrl.last].next = null, dom vrvHp = dom prvHp, vtail = (orl + qrl.butlast).last, orl ≠ [], qrl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ vtail ∈ orl + qrl from vtail ∧ vhead ∈ orl + qrl from vhead
| dom vrvHp = dom prvHp, vtail = (orl + qrl).last, orl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ vtail ∈ orl + qrl from vtail ∧ vhead ∈ orl + qrl from vhead |
dom vrvHp = dom prvHp, orl ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vhead ∈ orl + qrl from vhead, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦
Used simplifier rules: ⊦ a ∈ b ' ↔ a = b; (s) rl ≠ [] ⊦ ¬ dups(rl) → rl from rl.last = rl.last '; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ x + y = [] ↔ x = [] ∧ y = []; (as)
| dom vrvHp = dom prvHp, orl ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vhead ∈ orl + qrl from vhead, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ |
orl.last = vhead, dom vrvHp = dom prvHp, orl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vhead ∈ orl + qrl from vhead, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), qrl ≠ [] → unmarkedp(qrl.tail, vs) ⊦
orl.butlast.last = vhead, dom vrvHp = dom prvHp, orl.butlast ≠ [], orl ≠ [], phead ≠ orl.last, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), unmarkedp(qrl, vs), phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vhead ∈ orl + qrl from vhead, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val) ⊦
| orl.last = vhead, dom vrvHp = dom prvHp, orl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vhead ∈ orl + qrl from vhead, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), qrl ≠ [] → unmarkedp(qrl.tail, vs) ⊦ |
dom vrvHp = dom prvHp, orl ≠ [], qrl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), unmarkedp(qrl.tail, vs), phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ orl.last ∈ orl + qrl from orl.last, vs[orl.last].next ≠ null ∧ vs[vs[orl.last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[orl.last].next].deqID.tid)) = Claimed(vs[vs[orl.last].next].deqID.tid, vs[vs[orl.last].next].val) ⊦
Used simplifier rules: ⊦ a ∈ b ' ↔ a = b; (s) rl ≠ [] ⊦ ¬ dups(rl) → rl from rl.last = rl.last '; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ x + [] = x; (s) ⊦ ¬ dups([]); (s) ⊦ unmarkedp([], vs); (s)
| dom vrvHp = dom prvHp, orl ≠ [], qrl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), unmarkedp(qrl.tail, vs), phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ orl.last ∈ orl + qrl from orl.last, vs[orl.last].next ≠ null ∧ vs[vs[orl.last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[orl.last].next].deqID.tid)) = Claimed(vs[vs[orl.last].next].deqID.tid, vs[vs[orl.last].next].val) ⊦ |
dom vrvHp = dom prvHp, qrl = phead0 + qrl0, orl ≠ [], qrl ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl0, vs), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ orl.last ∈ orl + qrl from orl.last, vs[orl.last].next ≠ null ∧ vs[vs[orl.last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[orl.last].next].deqID.tid)) = Claimed(vs[vs[orl.last].next].deqID.tid, vs[vs[orl.last].next].val) ⊦
Used simplifier rules: ⊦ x ≠ [] → (head = x.head ∧ tail = x.tail ↔ x = head + tail); (elim) Used terms: qrl, head, qrl0
| dom vrvHp = dom prvHp, qrl = phead0 + qrl0, orl ≠ [], qrl ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl0, vs), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ orl.last ∈ orl + qrl from orl.last, vs[orl.last].next ≠ null ∧ vs[vs[orl.last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[orl.last].next].deqID.tid)) = Claimed(vs[vs[orl.last].next].deqID.tid, vs[vs[orl.last].next].val) ⊦ |
ps[phead0].deqID = None, dom vrvHp = dom prvHp, orl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + phead0 ' + qrl0, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + phead0 ' + qrl0, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl0, ps), unmarkedp(qrl0, vs), phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl0), ¬ dups(orl), ¬ dups(qrl0), ¬ phead0 ∈ qrl0, ¬ phead0 ∈ orl, ¬ orl.last ∈ orl + phead0 ' + qrl0 from orl.last, vs[orl.last].next ≠ null ∧ vs[vs[orl.last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[orl.last].next].deqID.tid)) = Claimed(vs[vs[orl.last].next].deqID.tid, vs[vs[orl.last].next].val) ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ a + x = a ' + x; (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (s) ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ a ' + x ≠ []; (s)
| ps[phead0].deqID = None, dom vrvHp = dom prvHp, orl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + phead0 ' + qrl0, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + phead0 ' + qrl0, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl0, ps), unmarkedp(qrl0, vs), phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl0), ¬ dups(orl), ¬ dups(qrl0), ¬ phead0 ∈ qrl0, ¬ phead0 ∈ orl, ¬ orl.last ∈ orl + phead0 ' + qrl0 from orl.last, vs[orl.last].next ≠ null ∧ vs[vs[orl.last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[orl.last].next].deqID.tid)) = Claimed(vs[vs[orl.last].next].deqID.tid, vs[vs[orl.last].next].val) ⊦ |
Used simplifier rules: ⊦ x + a ' ≠ []; (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ ¬ b ∈ x → (dups(x + b ') ↔ dups(x)); (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ r ' + rl from r = r ' + rl; (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: orl, phead1, y
| orl.butlast.last = vhead, dom vrvHp = dom prvHp, orl.butlast ≠ [], orl ≠ [], phead ≠ orl.last, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), unmarkedp(qrl, vs), phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vhead ∈ orl + qrl from vhead, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val) ⊦ |
dom vrvHp = dom prvHp, orl ≠ [], orl ≠ orl.head ', phead ≠ orl.last, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, vs), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ orl.butlast.last ∈ orl + qrl from orl.butlast.last, vs[orl.butlast.last].next ≠ null ∧ vs[vs[orl.butlast.last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[orl.butlast.last].next].deqID.tid)) = Claimed(vs[vs[orl.butlast.last].next].deqID.tid, vs[vs[orl.butlast.last].next].val) ⊦
Used simplifier rules: ⊦ x ≠ [] → (x.butlast = [] ↔ x = x.head '); (ss)
| dom vrvHp = dom prvHp, orl ≠ [], orl ≠ orl.head ', phead ≠ orl.last, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, vs), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ orl.butlast.last ∈ orl + qrl from orl.butlast.last, vs[orl.butlast.last].next ≠ null ∧ vs[vs[orl.butlast.last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[orl.butlast.last].next].deqID.tid)) = Claimed(vs[vs[orl.butlast.last].next].deqID.tid, vs[vs[orl.butlast.last].next].val) ⊦ |
dom vrvHp = dom prvHp, orl = phead0 + qrl0, orl ≠ [], orl ≠ phead0 ', phead ≠ orl.last, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), unmarkedp(qrl, vs), phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ orl.butlast.last ∈ orl + qrl from orl.butlast.last, vs[orl.butlast.last].next ≠ null ∧ vs[vs[orl.butlast.last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[orl.butlast.last].next].deqID.tid)) = Claimed(vs[vs[orl.butlast.last].next].deqID.tid, vs[vs[orl.butlast.last].next].val) ⊦
Used simplifier rules: ⊦ x ≠ [] → (head = x.head ∧ tail = x.tail ↔ x = head + tail); (elim) Used terms: orl, head, qrl0
| dom vrvHp = dom prvHp, orl = phead0 + qrl0, orl ≠ [], orl ≠ phead0 ', phead ≠ orl.last, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), unmarkedp(qrl, vs), phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ orl.butlast.last ∈ orl + qrl from orl.butlast.last, vs[orl.butlast.last].next ≠ null ∧ vs[vs[orl.butlast.last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[orl.butlast.last].next].deqID.tid)) = Claimed(vs[vs[orl.butlast.last].next].deqID.tid, vs[vs[orl.butlast.last].next].val) ⊦ |
dom vrvHp = dom prvHp, phead ≠ qrl0.last, qrl0 ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((phead0 ' + qrl0) + qrl, vs, ps, owns), markedp(qrl0, vs), markedp(qrl0, ps), nonullRetRefs((phead0 ' + qrl0) + qrl, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead0].deqID), some?(ps[phead0].deqID), unmarkedp(qrl, vs), unmarkedp(qrl, ps), phead ∈ vs, phead ∈ ps, ¬ dups(qrl0 + qrl), ¬ dups(qrl0), ¬ dups(qrl), ¬ phead0 ∈ qrl0, ¬ phead0 ∈ qrl, ¬ (phead0 ' + qrl0.butlast).last ∈ (phead0 ' + qrl0) + qrl from (phead0 ' + qrl0.butlast).last, vs[(phead0 ' + qrl0.butlast).last].next ≠ null ∧ vs[vs[(phead0 ' + qrl0.butlast).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(phead0 ' + qrl0.butlast).last].next].deqID.tid)) = Claimed(vs[vs[(phead0 ' + qrl0.butlast).last].next].deqID.tid, vs[vs[(phead0 ' + qrl0.butlast).last].next].val), phead = phead0 ∨ phead ∈ qrl0 ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ x ≠ [] → (a ' + x).butlast = a ' + x.butlast; (s) ⊦ a + x = a ' + x; (s) ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ x ≠ [] → (a ' + x).last = x.last; (s) ⊦ a ' = b ' + x ↔ a = b ∧ x = []; (ws) ⊦ a ' + x ≠ []; (s)
| dom vrvHp = dom prvHp, phead ≠ qrl0.last, qrl0 ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((phead0 ' + qrl0) + qrl, vs, ps, owns), markedp(qrl0, vs), markedp(qrl0, ps), nonullRetRefs((phead0 ' + qrl0) + qrl, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead0].deqID), some?(ps[phead0].deqID), unmarkedp(qrl, vs), unmarkedp(qrl, ps), phead ∈ vs, phead ∈ ps, ¬ dups(qrl0 + qrl), ¬ dups(qrl0), ¬ dups(qrl), ¬ phead0 ∈ qrl0, ¬ phead0 ∈ qrl, ¬ (phead0 ' + qrl0.butlast).last ∈ (phead0 ' + qrl0) + qrl from (phead0 ' + qrl0.butlast).last, vs[(phead0 ' + qrl0.butlast).last].next ≠ null ∧ vs[vs[(phead0 ' + qrl0.butlast).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(phead0 ' + qrl0.butlast).last].next].deqID.tid)) = Claimed(vs[vs[(phead0 ' + qrl0.butlast).last].next].deqID.tid, vs[vs[(phead0 ' + qrl0.butlast).last].next].val), phead = phead0 ∨ phead ∈ qrl0 ⊦ |
Used simplifier rules: ⊦ a ' + x ≠ []; (s) in-14: ⊦ a ' + x = y → a ∈ y; (forward) from specification list[reflist] in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ r ' + rl from r = r ' + rl; (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) ⊦ a ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s) ⊦ r0 ≠ r → r0 ' + rl from r = rl from r; (s) lapp-04: ⊦ a ' + x = y + b ' ∧ a ≠ b → x.last = b; (forward) from specification list-last[reflist] inapp-10: ⊦ a ' + x = y + b ' ∧ a ≠ b → a ∈ y ∧ b ∈ x; (forward) from specification list[reflist] bin-01: x ≠ [] ⊦ a ∈ x.butlast → a ∈ x; (forward) from specification list-last[reflist] ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ r ∈ rl → r ∈ rl from r; (ss) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ x + y = [] ↔ x = [] ∧ y = []; (as) ⊦ a ' ≠ []; (s) x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: phead0 ' + qrl0.butlast, phead1, y
| vs[qrl.last].deqID = None, vs[qrl.last].next = null, dom vrvHp = dom prvHp, vtail = (orl + qrl.butlast).last, orl ≠ [], qrl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ vtail ∈ orl + qrl from vtail ∧ vhead ∈ orl + qrl from vhead |
vs[qrl.last].deqID = None, vs[qrl.last].next = null, dom vrvHp = dom prvHp, orl ≠ [], qrl ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(qrl.tail, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ (orl + qrl.butlast).last ∈ orl + qrl from (orl + qrl.butlast).last ∧ vhead ∈ orl + qrl from vhead
| vs[qrl.last].deqID = None, vs[qrl.last].next = null, dom vrvHp = dom prvHp, orl ≠ [], qrl ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(qrl.tail, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ (orl + qrl.butlast).last ∈ orl + qrl from (orl + qrl.butlast).last ∧ vhead ∈ orl + qrl from vhead |
vs[qrl.last].deqID = None, vs[qrl.last].next = null, dom vrvHp = dom prvHp, qrl = vhead0 + orl0, orl ≠ [], qrl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ (orl + qrl.butlast).last ∈ orl + qrl from (orl + qrl.butlast).last ∧ vhead ∈ orl + qrl from vhead
Used simplifier rules: ⊦ x ≠ [] → (head = x.head ∧ tail = x.tail ↔ x = head + tail); (elim) Used terms: qrl, head, orl0
| vs[qrl.last].deqID = None, vs[qrl.last].next = null, dom vrvHp = dom prvHp, qrl = vhead0 + orl0, orl ≠ [], qrl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ (orl + qrl.butlast).last ∈ orl + qrl from (orl + qrl.butlast).last ∧ vhead ∈ orl + qrl from vhead |
vs[(vhead0 ' + orl0).last].deqID = None, ps[vhead0].deqID = None, vs[(vhead0 ' + orl0).last].next = null, dom vrvHp = dom prvHp, orl ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + vhead0 ' + orl0, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nonullRetRefs(orl + vhead0 ' + orl0, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl0, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ vhead0 ∈ orl, ¬ vhead0 ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vhead0].deqID = None ∧ unmarkedp(orl0, vs) ⊦ (orl + (vhead0 ' + orl0).butlast).last ∈ orl + vhead0 ' + orl0 from (orl + (vhead0 ' + orl0).butlast).last ∧ vhead ∈ orl + vhead0 ' + orl0 from vhead
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ a + x = a ' + x; (s) ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ a ' + x ≠ []; (s)
| vs[(vhead0 ' + orl0).last].deqID = None, ps[vhead0].deqID = None, vs[(vhead0 ' + orl0).last].next = null, dom vrvHp = dom prvHp, orl ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + vhead0 ' + orl0, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nonullRetRefs(orl + vhead0 ' + orl0, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl0, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ vhead0 ∈ orl, ¬ vhead0 ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vhead0].deqID = None ∧ unmarkedp(orl0, vs) ⊦ (orl + (vhead0 ' + orl0).butlast).last ∈ orl + vhead0 ' + orl0 from (orl + (vhead0 ' + orl0).butlast).last ∧ vhead ∈ orl + vhead0 ' + orl0 from vhead |
vhead0 ' + orl0 = orl1 + phead0 ', ps[vhead0].deqID = None, vs[phead0].deqID = None, vs[phead0].next = null, dom vrvHp = dom prvHp, vhead0 ' + orl0 ≠ [], orl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + vhead0 ' + orl0, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + vhead0 ' + orl0, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl0, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ vhead0 ∈ orl, ¬ vhead0 ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vhead0].deqID = None ∧ unmarkedp(orl0, vs) ⊦ (orl + orl1).last ∈ orl + vhead0 ' + orl0 from (orl + orl1).last ∧ vhead ∈ orl + vhead0 ' + orl0 from vhead
Used simplifier rules: ⊦ x + y = [] ↔ x = [] ∧ y = []; (as) ⊦ a ' ≠ []; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: vhead0 ' + orl0, phead0, y
| vhead0 ' + orl0 = orl1 + phead0 ', ps[vhead0].deqID = None, vs[phead0].deqID = None, vs[phead0].next = null, dom vrvHp = dom prvHp, vhead0 ' + orl0 ≠ [], orl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + vhead0 ' + orl0, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + vhead0 ' + orl0, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl0, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ vhead0 ∈ orl, ¬ vhead0 ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vhead0].deqID = None ∧ unmarkedp(orl0, vs) ⊦ (orl + orl1).last ∈ orl + vhead0 ' + orl0 from (orl + orl1).last ∧ vhead ∈ orl + vhead0 ' + orl0 from vhead |
vhead0 ' + orl0 = orl1 + phead0 ', ps[vhead0].deqID = None, vs[phead0].deqID = None, vs[phead0].next = null, dom vrvHp = dom prvHp, orl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + orl1 + phead0 ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + orl1 + phead0 ', vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl0, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl0), ¬ dups(orl), ¬ dups(orl + orl0), ¬ vhead0 ∈ orl0, ¬ vhead0 ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vhead0].deqID = None ∧ unmarkedp(orl0, vs), vhead0 ∈ orl1 ∨ vhead0 = phead0, phead0 = vhead0 ∨ phead0 ∈ orl0 ⊦ (orl + orl1).last ∈ orl + orl1 + phead0 ' from (orl + orl1).last ∧ vhead ∈ orl + orl1 + phead0 ' from vhead
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] in-14: ⊦ a ' + x = y → a ∈ y; (forward) from specification list[reflist] ⊦ a ' + x ≠ []; (s)
| vhead0 ' + orl0 = orl1 + phead0 ', ps[vhead0].deqID = None, vs[phead0].deqID = None, vs[phead0].next = null, dom vrvHp = dom prvHp, orl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + orl1 + phead0 ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + orl1 + phead0 ', vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl0, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl0), ¬ dups(orl), ¬ dups(orl + orl0), ¬ vhead0 ∈ orl0, ¬ vhead0 ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vhead0].deqID = None ∧ unmarkedp(orl0, vs), vhead0 ∈ orl1 ∨ vhead0 = phead0, phead0 = vhead0 ∨ phead0 ∈ orl0 ⊦ (orl + orl1).last ∈ orl + orl1 + phead0 ' from (orl + orl1).last ∧ vhead ∈ orl + orl1 + phead0 ' from vhead |
vhead0 ' + orl0 = orl1 + phead0 ', vs[phead0].deqID = None, ps[vhead0].deqID = None, orl.last = vhead, vs[phead0].next = null, dom vrvHp = dom prvHp, orl ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + orl1 + phead0 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nonullRetRefs(orl + orl1 + phead0 ', vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl0, ps), unmarkedp(orl0, vs), phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl0), ¬ dups(orl), ¬ dups(orl + orl0), ¬ vhead0 ∈ orl0, ¬ vhead0 ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead0 = vhead0 ∨ phead0 ∈ orl0, vhead0 ∈ orl1 ∨ vhead0 = phead0 ⊦ (orl + orl1).last ∈ orl + orl1 + phead0 ' from (orl + orl1).last ∧ vhead ∈ orl + orl1 + phead0 ' from vhead
vhead0 ' + orl0 = orl1 + phead0 ', vs[phead0].deqID = None, ps[vhead0].deqID = None, vs[vhead0].deqID = None, orl.butlast.last = vhead, vs[phead0].next = null, dom vrvHp = dom prvHp, orl.butlast ≠ [], orl ≠ [], phead ≠ orl.last, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + orl1 + phead0 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nonullRetRefs(orl + orl1 + phead0 ', vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl0, ps), unmarkedp(orl0, vs), phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl0), ¬ dups(orl), ¬ dups(orl + orl0), ¬ vhead0 ∈ orl0, ¬ vhead0 ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead0 = vhead0 ∨ phead0 ∈ orl0, vhead0 ∈ orl1 ∨ vhead0 = phead0 ⊦ (orl + orl1).last ∈ orl + orl1 + phead0 ' from (orl + orl1).last ∧ vhead ∈ orl + orl1 + phead0 ' from vhead
| vhead0 ' + orl0 = orl1 + phead0 ', vs[phead0].deqID = None, ps[vhead0].deqID = None, orl.last = vhead, vs[phead0].next = null, dom vrvHp = dom prvHp, orl ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + orl1 + phead0 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nonullRetRefs(orl + orl1 + phead0 ', vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl0, ps), unmarkedp(orl0, vs), phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl0), ¬ dups(orl), ¬ dups(orl + orl0), ¬ vhead0 ∈ orl0, ¬ vhead0 ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead0 = vhead0 ∨ phead0 ∈ orl0, vhead0 ∈ orl1 ∨ vhead0 = phead0 ⊦ (orl + orl1).last ∈ orl + orl1 + phead0 ' from (orl + orl1).last ∧ vhead ∈ orl + orl1 + phead0 ' from vhead |
vhead0 ' + orl0 = orl1 + phead0 ', ps[vhead0].deqID = None, vs[phead0].deqID = None, vs[phead0].next = null, dom vrvHp = dom prvHp, orl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + orl1 + phead0 ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + orl1 + phead0 ', vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl0, vs), unmarkedp(orl0, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl0), ¬ dups(orl), ¬ dups(orl + orl0), ¬ vhead0 ∈ orl0, ¬ vhead0 ∈ orl, vs[orl.last].next ≠ null ∧ vs[vs[orl.last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[orl.last].next].deqID.tid)) = Claimed(vs[vs[orl.last].next].deqID.tid, vs[vs[orl.last].next].val), vhead0 ∈ orl1 ∨ vhead0 = phead0, phead0 = vhead0 ∨ phead0 ∈ orl0 ⊦ (orl + orl1).last ∈ orl + orl1 + phead0 ' from (orl + orl1).last ∧ orl.last ∈ orl + orl1 + phead0 ' from orl.last
| vhead0 ' + orl0 = orl1 + phead0 ', ps[vhead0].deqID = None, vs[phead0].deqID = None, vs[phead0].next = null, dom vrvHp = dom prvHp, orl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + orl1 + phead0 ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + orl1 + phead0 ', vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl0, vs), unmarkedp(orl0, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl0), ¬ dups(orl), ¬ dups(orl + orl0), ¬ vhead0 ∈ orl0, ¬ vhead0 ∈ orl, vs[orl.last].next ≠ null ∧ vs[vs[orl.last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[orl.last].next].deqID.tid)) = Claimed(vs[vs[orl.last].next].deqID.tid, vs[vs[orl.last].next].val), vhead0 ∈ orl1 ∨ vhead0 = phead0, phead0 = vhead0 ∨ phead0 ∈ orl0 ⊦ (orl + orl1).last ∈ orl + orl1 + phead0 ' from (orl + orl1).last ∧ orl.last ∈ orl + orl1 + phead0 ' from orl.last |
vhead0 ' + orl0 = orl1 + phead0 ', vs[phead0].deqID = None, ps[vhead0].deqID = None, vs[phead0].next = null, dom vrvHp = dom prvHp, orl ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + orl1 + phead0 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nonullRetRefs(orl + orl1 + phead0 ', vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl0, ps), unmarkedp(orl0, vs), phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl0), ¬ dups(orl), ¬ dups(orl + orl0), ¬ (orl + orl1).last ∈ orl + orl1 + phead0 ' from (orl + orl1).last, ¬ vhead0 ∈ orl0, ¬ vhead0 ∈ orl, vs[orl.last].next ≠ null ∧ vs[vs[orl.last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[orl.last].next].deqID.tid)) = Claimed(vs[vs[orl.last].next].deqID.tid, vs[vs[orl.last].next].val), phead0 = vhead0 ∨ phead0 ∈ orl0, vhead0 ∈ orl1 ∨ vhead0 = phead0 ⊦
vhead0 ' + orl0 = orl1 + phead0 ', vs[phead0].deqID = None, ps[vhead0].deqID = None, vs[phead0].next = null, dom vrvHp = dom prvHp, orl ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + orl1 + phead0 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nonullRetRefs(orl + orl1 + phead0 ', vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl0, ps), unmarkedp(orl0, vs), phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl0), ¬ dups(orl), ¬ dups(orl + orl0), ¬ orl.last ∈ orl + orl1 + phead0 ' from orl.last, ¬ vhead0 ∈ orl0, ¬ vhead0 ∈ orl, vs[orl.last].next ≠ null ∧ vs[vs[orl.last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[orl.last].next].deqID.tid)) = Claimed(vs[vs[orl.last].next].deqID.tid, vs[vs[orl.last].next].val), phead0 = vhead0 ∨ phead0 ∈ orl0, vhead0 ∈ orl1 ∨ vhead0 = phead0 ⊦
| vhead0 ' + orl0 = orl1 + phead0 ', vs[phead0].deqID = None, ps[vhead0].deqID = None, vs[phead0].next = null, dom vrvHp = dom prvHp, orl ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + orl1 + phead0 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nonullRetRefs(orl + orl1 + phead0 ', vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl0, ps), unmarkedp(orl0, vs), phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl0), ¬ dups(orl), ¬ dups(orl + orl0), ¬ (orl + orl1).last ∈ orl + orl1 + phead0 ' from (orl + orl1).last, ¬ vhead0 ∈ orl0, ¬ vhead0 ∈ orl, vs[orl.last].next ≠ null ∧ vs[vs[orl.last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[orl.last].next].deqID.tid)) = Claimed(vs[vs[orl.last].next].deqID.tid, vs[vs[orl.last].next].val), phead0 = vhead0 ∨ phead0 ∈ orl0, vhead0 ∈ orl1 ∨ vhead0 = phead0 ⊦ |
Used simplifier rules: in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ r ∈ rl → r ∈ rl from r; (ss) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ x + y = [] ↔ x = [] ∧ y = []; (as) x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: orl + orl1, phead1, y
| vhead0 ' + orl0 = orl1 + phead0 ', vs[phead0].deqID = None, ps[vhead0].deqID = None, vs[phead0].next = null, dom vrvHp = dom prvHp, orl ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + orl1 + phead0 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nonullRetRefs(orl + orl1 + phead0 ', vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl0, ps), unmarkedp(orl0, vs), phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl0), ¬ dups(orl), ¬ dups(orl + orl0), ¬ orl.last ∈ orl + orl1 + phead0 ' from orl.last, ¬ vhead0 ∈ orl0, ¬ vhead0 ∈ orl, vs[orl.last].next ≠ null ∧ vs[vs[orl.last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[orl.last].next].deqID.tid)) = Claimed(vs[vs[orl.last].next].deqID.tid, vs[vs[orl.last].next].val), phead0 = vhead0 ∨ phead0 ∈ orl0, vhead0 ∈ orl1 ∨ vhead0 = phead0 ⊦ |
Used simplifier rules: ⊦ x + a ' ≠ []; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ dups(x + a ') ↔ a ∈ x ∨ dups(x); (ws) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ r ' + rl from r = r ' + rl; (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: orl, phead1, y
| vhead0 ' + orl0 = orl1 + phead0 ', vs[phead0].deqID = None, ps[vhead0].deqID = None, vs[vhead0].deqID = None, orl.butlast.last = vhead, vs[phead0].next = null, dom vrvHp = dom prvHp, orl.butlast ≠ [], orl ≠ [], phead ≠ orl.last, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + orl1 + phead0 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nonullRetRefs(orl + orl1 + phead0 ', vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl0, ps), unmarkedp(orl0, vs), phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl0), ¬ dups(orl), ¬ dups(orl + orl0), ¬ vhead0 ∈ orl0, ¬ vhead0 ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead0 = vhead0 ∨ phead0 ∈ orl0, vhead0 ∈ orl1 ∨ vhead0 = phead0 ⊦ (orl + orl1).last ∈ orl + orl1 + phead0 ' from (orl + orl1).last ∧ vhead ∈ orl + orl1 + phead0 ' from vhead |
vhead0 ' + orl0 = orl1 + phead0 ', vs[vhead0].deqID = None, ps[vhead0].deqID = None, vs[phead0].deqID = None, vs[phead0].next = null, dom vrvHp = dom prvHp, orl ≠ [], orl ≠ orl.head ', phead ≠ orl.last, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + orl1 + phead0 ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + orl1 + phead0 ', vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl0, vs), unmarkedp(orl0, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl0), ¬ dups(orl), ¬ dups(orl + orl0), ¬ vhead0 ∈ orl0, ¬ vhead0 ∈ orl, vs[orl.butlast.last].next ≠ null ∧ vs[vs[orl.butlast.last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[orl.butlast.last].next].deqID.tid)) = Claimed(vs[vs[orl.butlast.last].next].deqID.tid, vs[vs[orl.butlast.last].next].val), vhead0 ∈ orl1 ∨ vhead0 = phead0, phead0 = vhead0 ∨ phead0 ∈ orl0 ⊦ (orl + orl1).last ∈ orl + orl1 + phead0 ' from (orl + orl1).last ∧ orl.butlast.last ∈ orl + orl1 + phead0 ' from orl.butlast.last
Used simplifier rules: ⊦ x ≠ [] → (x.butlast = [] ↔ x = x.head '); (ss)
| vhead0 ' + orl0 = orl1 + phead0 ', vs[vhead0].deqID = None, ps[vhead0].deqID = None, vs[phead0].deqID = None, vs[phead0].next = null, dom vrvHp = dom prvHp, orl ≠ [], orl ≠ orl.head ', phead ≠ orl.last, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + orl1 + phead0 ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + orl1 + phead0 ', vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl0, vs), unmarkedp(orl0, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl0), ¬ dups(orl), ¬ dups(orl + orl0), ¬ vhead0 ∈ orl0, ¬ vhead0 ∈ orl, vs[orl.butlast.last].next ≠ null ∧ vs[vs[orl.butlast.last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[orl.butlast.last].next].deqID.tid)) = Claimed(vs[vs[orl.butlast.last].next].deqID.tid, vs[vs[orl.butlast.last].next].val), vhead0 ∈ orl1 ∨ vhead0 = phead0, phead0 = vhead0 ∨ phead0 ∈ orl0 ⊦ (orl + orl1).last ∈ orl + orl1 + phead0 ' from (orl + orl1).last ∧ orl.butlast.last ∈ orl + orl1 + phead0 ' from orl.butlast.last |
vhead0 ' + orl0 = orl1 + phead0 ', vs[phead0].deqID = None, ps[vhead0].deqID = None, vs[vhead0].deqID = None, vs[phead0].next = null, dom vrvHp = dom prvHp, orl = phead1 + orl2, orl ≠ [], orl ≠ phead1 ', phead ≠ orl.last, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + orl1 + phead0 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nonullRetRefs(orl + orl1 + phead0 ', vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl0, ps), unmarkedp(orl0, vs), phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl0), ¬ dups(orl), ¬ dups(orl + orl0), ¬ vhead0 ∈ orl0, ¬ vhead0 ∈ orl, vs[orl.butlast.last].next ≠ null ∧ vs[vs[orl.butlast.last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[orl.butlast.last].next].deqID.tid)) = Claimed(vs[vs[orl.butlast.last].next].deqID.tid, vs[vs[orl.butlast.last].next].val), phead0 = vhead0 ∨ phead0 ∈ orl0, vhead0 ∈ orl1 ∨ vhead0 = phead0 ⊦ (orl + orl1).last ∈ orl + orl1 + phead0 ' from (orl + orl1).last ∧ orl.butlast.last ∈ orl + orl1 + phead0 ' from orl.butlast.last
Used simplifier rules: ⊦ x ≠ [] → (head = x.head ∧ tail = x.tail ↔ x = head + tail); (elim) Used terms: orl, head, orl2
| vhead0 ' + orl0 = orl1 + phead0 ', vs[phead0].deqID = None, ps[vhead0].deqID = None, vs[vhead0].deqID = None, vs[phead0].next = null, dom vrvHp = dom prvHp, orl = phead1 + orl2, orl ≠ [], orl ≠ phead1 ', phead ≠ orl.last, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + orl1 + phead0 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nonullRetRefs(orl + orl1 + phead0 ', vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl0, ps), unmarkedp(orl0, vs), phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl0), ¬ dups(orl), ¬ dups(orl + orl0), ¬ vhead0 ∈ orl0, ¬ vhead0 ∈ orl, vs[orl.butlast.last].next ≠ null ∧ vs[vs[orl.butlast.last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[orl.butlast.last].next].deqID.tid)) = Claimed(vs[vs[orl.butlast.last].next].deqID.tid, vs[vs[orl.butlast.last].next].val), phead0 = vhead0 ∨ phead0 ∈ orl0, vhead0 ∈ orl1 ∨ vhead0 = phead0 ⊦ (orl + orl1).last ∈ orl + orl1 + phead0 ' from (orl + orl1).last ∧ orl.butlast.last ∈ orl + orl1 + phead0 ' from orl.butlast.last |
vhead0 ' + orl0 = orl1 + phead0 ', vs[vhead0].deqID = None, ps[vhead0].deqID = None, vs[phead0].deqID = None, vs[phead0].next = null, dom vrvHp = dom prvHp, orl2 ≠ [], phead ≠ orl2.last, vhead0 ≠ phead1, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((phead1 ' + orl2) + orl1 + phead0 ', vs, ps, owns), markedp(orl2, ps), markedp(orl2, vs), nonullRetRefs((phead1 ' + orl2) + orl1 + phead0 ', vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[phead1].deqID), some?(vs[phead1].deqID), unmarkedp(orl0, vs), unmarkedp(orl0, ps), phead ∈ ps, phead ∈ vs, ¬ dups(orl2 + orl0), ¬ dups(orl2), ¬ dups(orl0), ¬ phead1 ∈ orl2, ¬ phead1 ∈ orl0, ¬ vhead0 ∈ orl0, ¬ vhead0 ∈ orl2, vs[(phead1 ' + orl2.butlast).last].next ≠ null ∧ vs[vs[(phead1 ' + orl2.butlast).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(phead1 ' + orl2.butlast).last].next].deqID.tid)) = Claimed(vs[vs[(phead1 ' + orl2.butlast).last].next].deqID.tid, vs[vs[(phead1 ' + orl2.butlast).last].next].val), vhead0 ∈ orl1 ∨ vhead0 = phead0, phead0 = vhead0 ∨ phead0 ∈ orl0, phead = phead1 ∨ phead ∈ orl2 ⊦ (orl2 + orl1).last ∈ (phead1 ' + orl2) + orl1 + phead0 ' from (orl2 + orl1).last ∧ (phead1 ' + orl2.butlast).last ∈ (phead1 ' + orl2) + orl1 + phead0 ' from (phead1 ' + orl2.butlast).last
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ x ≠ [] → (a ' + x).butlast = a ' + x.butlast; (s) ⊦ a + x = a ' + x; (s) ⊦ y ≠ [] → (x + y + z).last = (y + z).last; (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (s) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ x ≠ [] → (a ' + x).last = x.last; (s) ⊦ a ' = b ' + x ↔ a = b ∧ x = []; (ws) ⊦ a ' + x ≠ []; (s)
| vhead0 ' + orl0 = orl1 + phead0 ', vs[vhead0].deqID = None, ps[vhead0].deqID = None, vs[phead0].deqID = None, vs[phead0].next = null, dom vrvHp = dom prvHp, orl2 ≠ [], phead ≠ orl2.last, vhead0 ≠ phead1, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((phead1 ' + orl2) + orl1 + phead0 ', vs, ps, owns), markedp(orl2, ps), markedp(orl2, vs), nonullRetRefs((phead1 ' + orl2) + orl1 + phead0 ', vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[phead1].deqID), some?(vs[phead1].deqID), unmarkedp(orl0, vs), unmarkedp(orl0, ps), phead ∈ ps, phead ∈ vs, ¬ dups(orl2 + orl0), ¬ dups(orl2), ¬ dups(orl0), ¬ phead1 ∈ orl2, ¬ phead1 ∈ orl0, ¬ vhead0 ∈ orl0, ¬ vhead0 ∈ orl2, vs[(phead1 ' + orl2.butlast).last].next ≠ null ∧ vs[vs[(phead1 ' + orl2.butlast).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(phead1 ' + orl2.butlast).last].next].deqID.tid)) = Claimed(vs[vs[(phead1 ' + orl2.butlast).last].next].deqID.tid, vs[vs[(phead1 ' + orl2.butlast).last].next].val), vhead0 ∈ orl1 ∨ vhead0 = phead0, phead0 = vhead0 ∨ phead0 ∈ orl0, phead = phead1 ∨ phead ∈ orl2 ⊦ (orl2 + orl1).last ∈ (phead1 ' + orl2) + orl1 + phead0 ' from (orl2 + orl1).last ∧ (phead1 ' + orl2.butlast).last ∈ (phead1 ' + orl2) + orl1 + phead0 ' from (phead1 ' + orl2.butlast).last |
⊦ y ≠ [] → (x + y).last = y.last
vhead0 ' + orl0 = orl1 + phead0 ', vs[phead0].deqID = None, ps[vhead0].deqID = None, vs[vhead0].deqID = None, vs[phead0].next = null, dom vrvHp = dom prvHp, orl1 = [], orl2 ≠ [], phead ≠ orl2.last, vhead0 ≠ phead1, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((phead1 ' + orl2) + orl1 + phead0 ', vs, ps, owns), markedp(orl2, vs), markedp(orl2, ps), nonullRetRefs((phead1 ' + orl2) + orl1 + phead0 ', vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead1].deqID), some?(ps[phead1].deqID), unmarkedp(orl0, ps), unmarkedp(orl0, vs), phead ∈ vs, phead ∈ ps, ¬ dups(orl2 + orl0), ¬ dups(orl2), ¬ dups(orl0), ¬ phead1 ∈ orl2, ¬ phead1 ∈ orl0, ¬ vhead0 ∈ orl0, ¬ vhead0 ∈ orl2, vs[(phead1 ' + orl2.butlast).last].next ≠ null ∧ vs[vs[(phead1 ' + orl2.butlast).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(phead1 ' + orl2.butlast).last].next].deqID.tid)) = Claimed(vs[vs[(phead1 ' + orl2.butlast).last].next].deqID.tid, vs[vs[(phead1 ' + orl2.butlast).last].next].val), phead = phead1 ∨ phead ∈ orl2, phead0 = vhead0 ∨ phead0 ∈ orl0, vhead0 ∈ orl1 ∨ vhead0 = phead0 ⊦ (orl2 + orl1).last ∈ (phead1 ' + orl2) + orl1 + phead0 ' from (orl2 + orl1).last ∧ (phead1 ' + orl2.butlast).last ∈ (phead1 ' + orl2) + orl1 + phead0 ' from (phead1 ' + orl2.butlast).last
vhead0 ' + orl0 = orl1 + phead0 ', vs[phead0].deqID = None, ps[vhead0].deqID = None, vs[vhead0].deqID = None, vs[phead0].next = null, dom vrvHp = dom prvHp, orl1 ≠ [], orl2 ≠ [], phead ≠ orl2.last, vhead0 ≠ phead1, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((phead1 ' + orl2) + orl1 + phead0 ', vs, ps, owns), markedp(orl2, vs), markedp(orl2, ps), nonullRetRefs((phead1 ' + orl2) + orl1 + phead0 ', vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead1].deqID), some?(ps[phead1].deqID), unmarkedp(orl0, ps), unmarkedp(orl0, vs), phead ∈ vs, phead ∈ ps, ¬ dups(orl2 + orl0), ¬ dups(orl2), ¬ dups(orl0), ¬ phead1 ∈ orl2, ¬ phead1 ∈ orl0, ¬ vhead0 ∈ orl0, ¬ vhead0 ∈ orl2, vs[(phead1 ' + orl2.butlast).last].next ≠ null ∧ vs[vs[(phead1 ' + orl2.butlast).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(phead1 ' + orl2.butlast).last].next].deqID.tid)) = Claimed(vs[vs[(phead1 ' + orl2.butlast).last].next].deqID.tid, vs[vs[(phead1 ' + orl2.butlast).last].next].val), phead = phead1 ∨ phead ∈ orl2, phead0 = vhead0 ∨ phead0 ∈ orl0, vhead0 ∈ orl1 ∨ vhead0 = phead0 ⊦ orl1.last ∈ (phead1 ' + orl2) + orl1 + phead0 ' from orl1.last ∧ (phead1 ' + orl2.butlast).last ∈ (phead1 ' + orl2) + orl1 + phead0 ' from (phead1 ' + orl2.butlast).last
Used terms: orl2, orl1
| ⊦ y ≠ [] → (x + y).last = y.last |
| vhead0 ' + orl0 = orl1 + phead0 ', vs[phead0].deqID = None, ps[vhead0].deqID = None, vs[vhead0].deqID = None, vs[phead0].next = null, dom vrvHp = dom prvHp, orl1 = [], orl2 ≠ [], phead ≠ orl2.last, vhead0 ≠ phead1, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((phead1 ' + orl2) + orl1 + phead0 ', vs, ps, owns), markedp(orl2, vs), markedp(orl2, ps), nonullRetRefs((phead1 ' + orl2) + orl1 + phead0 ', vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead1].deqID), some?(ps[phead1].deqID), unmarkedp(orl0, ps), unmarkedp(orl0, vs), phead ∈ vs, phead ∈ ps, ¬ dups(orl2 + orl0), ¬ dups(orl2), ¬ dups(orl0), ¬ phead1 ∈ orl2, ¬ phead1 ∈ orl0, ¬ vhead0 ∈ orl0, ¬ vhead0 ∈ orl2, vs[(phead1 ' + orl2.butlast).last].next ≠ null ∧ vs[vs[(phead1 ' + orl2.butlast).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(phead1 ' + orl2.butlast).last].next].deqID.tid)) = Claimed(vs[vs[(phead1 ' + orl2.butlast).last].next].deqID.tid, vs[vs[(phead1 ' + orl2.butlast).last].next].val), phead = phead1 ∨ phead ∈ orl2, phead0 = vhead0 ∨ phead0 ∈ orl0, vhead0 ∈ orl1 ∨ vhead0 = phead0 ⊦ (orl2 + orl1).last ∈ (phead1 ' + orl2) + orl1 + phead0 ' from (orl2 + orl1).last ∧ (phead1 ' + orl2.butlast).last ∈ (phead1 ' + orl2) + orl1 + phead0 ' from (phead1 ' + orl2.butlast).last |
ps[vhead0].deqID = None, vs[vhead0].deqID = None, vs[vhead0].next = null, dom vrvHp = dom prvHp, orl2 ≠ [], phead ≠ orl2.last, vhead0 ≠ phead1, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(phead1 ' + orl2 + vhead0 ', vs, ps, owns), markedp(orl2, vs), markedp(orl2, ps), nonullRetRefs(phead1 ' + orl2 + vhead0 ', vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead1].deqID), some?(ps[phead1].deqID), phead ∈ vs, phead ∈ ps, ¬ dups(orl2), ¬ vhead0 ∈ orl2, ¬ phead1 ∈ orl2, vs[(phead1 ' + orl2.butlast).last].next ≠ null ∧ vs[vs[(phead1 ' + orl2.butlast).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(phead1 ' + orl2.butlast).last].next].deqID.tid)) = Claimed(vs[vs[(phead1 ' + orl2.butlast).last].next].deqID.tid, vs[vs[(phead1 ' + orl2.butlast).last].next].val), phead = phead1 ∨ phead ∈ orl2 ⊦ orl2.last ∈ phead1 ' + orl2 + vhead0 ' from orl2.last ∧ (phead1 ' + orl2.butlast).last ∈ phead1 ' + orl2 + vhead0 ' from (phead1 ' + orl2.butlast).last
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ x + [] = x; (s) ⊦ ¬ dups([]); (s) ⊦ ¬ a ∈ []; (s) ⊦ unmarkedp([], vs); (s) ⊦ [] + x = x; (s) ⊦ a ' = b ' + x ↔ a = b ∧ x = []; (ws)
| ps[vhead0].deqID = None, vs[vhead0].deqID = None, vs[vhead0].next = null, dom vrvHp = dom prvHp, orl2 ≠ [], phead ≠ orl2.last, vhead0 ≠ phead1, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(phead1 ' + orl2 + vhead0 ', vs, ps, owns), markedp(orl2, vs), markedp(orl2, ps), nonullRetRefs(phead1 ' + orl2 + vhead0 ', vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead1].deqID), some?(ps[phead1].deqID), phead ∈ vs, phead ∈ ps, ¬ dups(orl2), ¬ vhead0 ∈ orl2, ¬ phead1 ∈ orl2, vs[(phead1 ' + orl2.butlast).last].next ≠ null ∧ vs[vs[(phead1 ' + orl2.butlast).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(phead1 ' + orl2.butlast).last].next].deqID.tid)) = Claimed(vs[vs[(phead1 ' + orl2.butlast).last].next].deqID.tid, vs[vs[(phead1 ' + orl2.butlast).last].next].val), phead = phead1 ∨ phead ∈ orl2 ⊦ orl2.last ∈ phead1 ' + orl2 + vhead0 ' from orl2.last ∧ (phead1 ' + orl2.butlast).last ∈ phead1 ' + orl2 + vhead0 ' from (phead1 ' + orl2.butlast).last |
vs[vhead0].deqID = None, ps[vhead0].deqID = None, vs[vhead0].next = null, dom vrvHp = dom prvHp, orl2 ≠ [], phead ≠ orl2.last, vhead0 ≠ phead1, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(phead1 ' + orl2 + vhead0 ', vs, ps, owns), markedp(orl2, ps), markedp(orl2, vs), nonullRetRefs(phead1 ' + orl2 + vhead0 ', vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[phead1].deqID), some?(vs[phead1].deqID), phead ∈ ps, phead ∈ vs, ¬ dups(orl2), ¬ orl2.last ∈ phead1 ' + orl2 + vhead0 ' from orl2.last, ¬ vhead0 ∈ orl2, ¬ phead1 ∈ orl2, vs[(phead1 ' + orl2.butlast).last].next ≠ null ∧ vs[vs[(phead1 ' + orl2.butlast).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(phead1 ' + orl2.butlast).last].next].deqID.tid)) = Claimed(vs[vs[(phead1 ' + orl2.butlast).last].next].deqID.tid, vs[vs[(phead1 ' + orl2.butlast).last].next].val), phead = phead1 ∨ phead ∈ orl2 ⊦
vs[vhead0].deqID = None, ps[vhead0].deqID = None, vs[vhead0].next = null, dom vrvHp = dom prvHp, orl2 ≠ [], phead ≠ orl2.last, vhead0 ≠ phead1, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(phead1 ' + orl2 + vhead0 ', vs, ps, owns), markedp(orl2, ps), markedp(orl2, vs), nonullRetRefs(phead1 ' + orl2 + vhead0 ', vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[phead1].deqID), some?(vs[phead1].deqID), phead ∈ ps, phead ∈ vs, ¬ dups(orl2), ¬ (phead1 ' + orl2.butlast).last ∈ phead1 ' + orl2 + vhead0 ' from (phead1 ' + orl2.butlast).last, ¬ vhead0 ∈ orl2, ¬ phead1 ∈ orl2, vs[(phead1 ' + orl2.butlast).last].next ≠ null ∧ vs[vs[(phead1 ' + orl2.butlast).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(phead1 ' + orl2.butlast).last].next].deqID.tid)) = Claimed(vs[vs[(phead1 ' + orl2.butlast).last].next].deqID.tid, vs[vs[(phead1 ' + orl2.butlast).last].next].val), phead = phead1 ∨ phead ∈ orl2 ⊦
| vs[vhead0].deqID = None, ps[vhead0].deqID = None, vs[vhead0].next = null, dom vrvHp = dom prvHp, orl2 ≠ [], phead ≠ orl2.last, vhead0 ≠ phead1, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(phead1 ' + orl2 + vhead0 ', vs, ps, owns), markedp(orl2, ps), markedp(orl2, vs), nonullRetRefs(phead1 ' + orl2 + vhead0 ', vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[phead1].deqID), some?(vs[phead1].deqID), phead ∈ ps, phead ∈ vs, ¬ dups(orl2), ¬ orl2.last ∈ phead1 ' + orl2 + vhead0 ' from orl2.last, ¬ vhead0 ∈ orl2, ¬ phead1 ∈ orl2, vs[(phead1 ' + orl2.butlast).last].next ≠ null ∧ vs[vs[(phead1 ' + orl2.butlast).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(phead1 ' + orl2.butlast).last].next].deqID.tid)) = Claimed(vs[vs[(phead1 ' + orl2.butlast).last].next].deqID.tid, vs[vs[(phead1 ' + orl2.butlast).last].next].val), phead = phead1 ∨ phead ∈ orl2 ⊦ |
Used simplifier rules: ⊦ x + a ' ≠ []; (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ dups(x + a ') ↔ a ∈ x ∨ dups(x); (ws) ⊦ r ∈ rl1 + r ' + rl2 from r; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: orl2, phead0, y
| vs[vhead0].deqID = None, ps[vhead0].deqID = None, vs[vhead0].next = null, dom vrvHp = dom prvHp, orl2 ≠ [], phead ≠ orl2.last, vhead0 ≠ phead1, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(phead1 ' + orl2 + vhead0 ', vs, ps, owns), markedp(orl2, ps), markedp(orl2, vs), nonullRetRefs(phead1 ' + orl2 + vhead0 ', vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[phead1].deqID), some?(vs[phead1].deqID), phead ∈ ps, phead ∈ vs, ¬ dups(orl2), ¬ (phead1 ' + orl2.butlast).last ∈ phead1 ' + orl2 + vhead0 ' from (phead1 ' + orl2.butlast).last, ¬ vhead0 ∈ orl2, ¬ phead1 ∈ orl2, vs[(phead1 ' + orl2.butlast).last].next ≠ null ∧ vs[vs[(phead1 ' + orl2.butlast).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(phead1 ' + orl2.butlast).last].next].deqID.tid)) = Claimed(vs[vs[(phead1 ' + orl2.butlast).last].next].deqID.tid, vs[vs[(phead1 ' + orl2.butlast).last].next].val), phead = phead1 ∨ phead ∈ orl2 ⊦ |
Used simplifier rules: ⊦ a ' + x ≠ []; (s) in-14: ⊦ a ' + x = y → a ∈ y; (forward) from specification list[reflist] in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ r ' + rl from r = r ' + rl; (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) ⊦ a ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s) ⊦ r0 ≠ r → r0 ' + rl from r = rl from r; (s) lapp-04: ⊦ a ' + x = y + b ' ∧ a ≠ b → x.last = b; (forward) from specification list-last[reflist] inapp-10: ⊦ a ' + x = y + b ' ∧ a ≠ b → a ∈ y ∧ b ∈ x; (forward) from specification list[reflist] bin-01: x ≠ [] ⊦ a ∈ x.butlast → a ∈ x; (forward) from specification list-last[reflist] ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ r ∈ rl → r ∈ rl from r; (ss) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ x + y = [] ↔ x = [] ∧ y = []; (as) ⊦ a ' ≠ []; (s) x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: phead1 ' + orl2.butlast, phead0, y
| vhead0 ' + orl0 = orl1 + phead0 ', vs[phead0].deqID = None, ps[vhead0].deqID = None, vs[vhead0].deqID = None, vs[phead0].next = null, dom vrvHp = dom prvHp, orl1 ≠ [], orl2 ≠ [], phead ≠ orl2.last, vhead0 ≠ phead1, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((phead1 ' + orl2) + orl1 + phead0 ', vs, ps, owns), markedp(orl2, vs), markedp(orl2, ps), nonullRetRefs((phead1 ' + orl2) + orl1 + phead0 ', vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead1].deqID), some?(ps[phead1].deqID), unmarkedp(orl0, ps), unmarkedp(orl0, vs), phead ∈ vs, phead ∈ ps, ¬ dups(orl2 + orl0), ¬ dups(orl2), ¬ dups(orl0), ¬ phead1 ∈ orl2, ¬ phead1 ∈ orl0, ¬ vhead0 ∈ orl0, ¬ vhead0 ∈ orl2, vs[(phead1 ' + orl2.butlast).last].next ≠ null ∧ vs[vs[(phead1 ' + orl2.butlast).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(phead1 ' + orl2.butlast).last].next].deqID.tid)) = Claimed(vs[vs[(phead1 ' + orl2.butlast).last].next].deqID.tid, vs[vs[(phead1 ' + orl2.butlast).last].next].val), phead = phead1 ∨ phead ∈ orl2, phead0 = vhead0 ∨ phead0 ∈ orl0, vhead0 ∈ orl1 ∨ vhead0 = phead0 ⊦ orl1.last ∈ (phead1 ' + orl2) + orl1 + phead0 ' from orl1.last ∧ (phead1 ' + orl2.butlast).last ∈ (phead1 ' + orl2) + orl1 + phead0 ' from (phead1 ' + orl2.butlast).last |
vhead0 ' + orl0 = orl1 + phead0 ', vs[phead0].deqID = None, ps[vhead0].deqID = None, vs[vhead0].deqID = None, vs[phead0].next = null, dom vrvHp = dom prvHp, orl1 ≠ [], orl2 ≠ [], phead ≠ orl2.last, vhead0 ≠ phead1, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((phead1 ' + orl2) + orl1 + phead0 ', vs, ps, owns), markedp(orl2, vs), markedp(orl2, ps), nonullRetRefs((phead1 ' + orl2) + orl1 + phead0 ', vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead1].deqID), some?(ps[phead1].deqID), unmarkedp(orl0, ps), unmarkedp(orl0, vs), vhead0 ∈ orl1, phead0 ∈ orl0, phead ∈ vs, phead ∈ ps, ¬ dups(orl0), ¬ dups(orl2), ¬ dups(orl2 + orl0), ¬ vhead0 ∈ orl2, ¬ vhead0 ∈ orl0, ¬ phead1 ∈ orl0, ¬ phead1 ∈ orl2, vs[(phead1 ' + orl2.butlast).last].next ≠ null ∧ vs[vs[(phead1 ' + orl2.butlast).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(phead1 ' + orl2.butlast).last].next].deqID.tid)) = Claimed(vs[vs[(phead1 ' + orl2.butlast).last].next].deqID.tid, vs[vs[(phead1 ' + orl2.butlast).last].next].val), phead = phead1 ∨ phead ∈ orl2 ⊦ orl1.last ∈ (phead1 ' + orl2) + orl1 + phead0 ' from orl1.last ∧ (phead1 ' + orl2.butlast).last ∈ (phead1 ' + orl2) + orl1 + phead0 ' from (phead1 ' + orl2.butlast).last
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] inapp-08: ⊦ a ' + x = y + b ' ∧ y ≠ [] → a ∈ y ∧ b ∈ x; (forward) from specification list[reflist]
| vhead0 ' + orl0 = orl1 + phead0 ', vs[phead0].deqID = None, ps[vhead0].deqID = None, vs[vhead0].deqID = None, vs[phead0].next = null, dom vrvHp = dom prvHp, orl1 ≠ [], orl2 ≠ [], phead ≠ orl2.last, vhead0 ≠ phead1, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((phead1 ' + orl2) + orl1 + phead0 ', vs, ps, owns), markedp(orl2, vs), markedp(orl2, ps), nonullRetRefs((phead1 ' + orl2) + orl1 + phead0 ', vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead1].deqID), some?(ps[phead1].deqID), unmarkedp(orl0, ps), unmarkedp(orl0, vs), vhead0 ∈ orl1, phead0 ∈ orl0, phead ∈ vs, phead ∈ ps, ¬ dups(orl0), ¬ dups(orl2), ¬ dups(orl2 + orl0), ¬ vhead0 ∈ orl2, ¬ vhead0 ∈ orl0, ¬ phead1 ∈ orl0, ¬ phead1 ∈ orl2, vs[(phead1 ' + orl2.butlast).last].next ≠ null ∧ vs[vs[(phead1 ' + orl2.butlast).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(phead1 ' + orl2.butlast).last].next].deqID.tid)) = Claimed(vs[vs[(phead1 ' + orl2.butlast).last].next].deqID.tid, vs[vs[(phead1 ' + orl2.butlast).last].next].val), phead = phead1 ∨ phead ∈ orl2 ⊦ orl1.last ∈ (phead1 ' + orl2) + orl1 + phead0 ' from orl1.last ∧ (phead1 ' + orl2.butlast).last ∈ (phead1 ' + orl2) + orl1 + phead0 ' from (phead1 ' + orl2.butlast).last |
vhead0 ' + orl0 = orl1 + phead0 ', vs[vhead0].deqID = None, ps[vhead0].deqID = None, vs[phead0].deqID = None, vs[phead0].next = null, dom vrvHp = dom prvHp, orl1 ≠ [], orl2 ≠ [], phead ≠ orl2.last, vhead0 ≠ phead1, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((phead1 ' + orl2) + orl1 + phead0 ', vs, ps, owns), markedp(orl2, ps), markedp(orl2, vs), nonullRetRefs((phead1 ' + orl2) + orl1 + phead0 ', vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[phead1].deqID), some?(vs[phead1].deqID), unmarkedp(orl0, vs), unmarkedp(orl0, ps), phead ∈ ps, phead ∈ vs, phead0 ∈ orl0, vhead0 ∈ orl1, ¬ dups(orl0), ¬ dups(orl2), ¬ dups(orl2 + orl0), ¬ orl1.last ∈ (phead1 ' + orl2) + orl1 + phead0 ' from orl1.last, ¬ vhead0 ∈ orl2, ¬ vhead0 ∈ orl0, ¬ phead1 ∈ orl0, ¬ phead1 ∈ orl2, vs[(phead1 ' + orl2.butlast).last].next ≠ null ∧ vs[vs[(phead1 ' + orl2.butlast).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(phead1 ' + orl2.butlast).last].next].deqID.tid)) = Claimed(vs[vs[(phead1 ' + orl2.butlast).last].next].deqID.tid, vs[vs[(phead1 ' + orl2.butlast).last].next].val), phead = phead1 ∨ phead ∈ orl2 ⊦
vhead0 ' + orl0 = orl1 + phead0 ', vs[vhead0].deqID = None, ps[vhead0].deqID = None, vs[phead0].deqID = None, vs[phead0].next = null, dom vrvHp = dom prvHp, orl1 ≠ [], orl2 ≠ [], phead ≠ orl2.last, vhead0 ≠ phead1, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((phead1 ' + orl2) + orl1 + phead0 ', vs, ps, owns), markedp(orl2, ps), markedp(orl2, vs), nonullRetRefs((phead1 ' + orl2) + orl1 + phead0 ', vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[phead1].deqID), some?(vs[phead1].deqID), unmarkedp(orl0, vs), unmarkedp(orl0, ps), phead ∈ ps, phead ∈ vs, phead0 ∈ orl0, vhead0 ∈ orl1, ¬ dups(orl0), ¬ dups(orl2), ¬ dups(orl2 + orl0), ¬ (phead1 ' + orl2.butlast).last ∈ (phead1 ' + orl2) + orl1 + phead0 ' from (phead1 ' + orl2.butlast).last, ¬ vhead0 ∈ orl2, ¬ vhead0 ∈ orl0, ¬ phead1 ∈ orl0, ¬ phead1 ∈ orl2, vs[(phead1 ' + orl2.butlast).last].next ≠ null ∧ vs[vs[(phead1 ' + orl2.butlast).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(phead1 ' + orl2.butlast).last].next].deqID.tid)) = Claimed(vs[vs[(phead1 ' + orl2.butlast).last].next].deqID.tid, vs[vs[(phead1 ' + orl2.butlast).last].next].val), phead = phead1 ∨ phead ∈ orl2 ⊦
| vhead0 ' + orl0 = orl1 + phead0 ', vs[vhead0].deqID = None, ps[vhead0].deqID = None, vs[phead0].deqID = None, vs[phead0].next = null, dom vrvHp = dom prvHp, orl1 ≠ [], orl2 ≠ [], phead ≠ orl2.last, vhead0 ≠ phead1, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((phead1 ' + orl2) + orl1 + phead0 ', vs, ps, owns), markedp(orl2, ps), markedp(orl2, vs), nonullRetRefs((phead1 ' + orl2) + orl1 + phead0 ', vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[phead1].deqID), some?(vs[phead1].deqID), unmarkedp(orl0, vs), unmarkedp(orl0, ps), phead ∈ ps, phead ∈ vs, phead0 ∈ orl0, vhead0 ∈ orl1, ¬ dups(orl0), ¬ dups(orl2), ¬ dups(orl2 + orl0), ¬ orl1.last ∈ (phead1 ' + orl2) + orl1 + phead0 ' from orl1.last, ¬ vhead0 ∈ orl2, ¬ vhead0 ∈ orl0, ¬ phead1 ∈ orl0, ¬ phead1 ∈ orl2, vs[(phead1 ' + orl2.butlast).last].next ≠ null ∧ vs[vs[(phead1 ' + orl2.butlast).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(phead1 ' + orl2.butlast).last].next].deqID.tid)) = Claimed(vs[vs[(phead1 ' + orl2.butlast).last].next].deqID.tid, vs[vs[(phead1 ' + orl2.butlast).last].next].val), phead = phead1 ∨ phead ∈ orl2 ⊦ |
Used simplifier rules: ⊦ x + a ' ≠ []; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ r ∈ rl1 + r ' + rl2 from r; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: orl1, phead2, y
| vhead0 ' + orl0 = orl1 + phead0 ', vs[vhead0].deqID = None, ps[vhead0].deqID = None, vs[phead0].deqID = None, vs[phead0].next = null, dom vrvHp = dom prvHp, orl1 ≠ [], orl2 ≠ [], phead ≠ orl2.last, vhead0 ≠ phead1, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((phead1 ' + orl2) + orl1 + phead0 ', vs, ps, owns), markedp(orl2, ps), markedp(orl2, vs), nonullRetRefs((phead1 ' + orl2) + orl1 + phead0 ', vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[phead1].deqID), some?(vs[phead1].deqID), unmarkedp(orl0, vs), unmarkedp(orl0, ps), phead ∈ ps, phead ∈ vs, phead0 ∈ orl0, vhead0 ∈ orl1, ¬ dups(orl0), ¬ dups(orl2), ¬ dups(orl2 + orl0), ¬ (phead1 ' + orl2.butlast).last ∈ (phead1 ' + orl2) + orl1 + phead0 ' from (phead1 ' + orl2.butlast).last, ¬ vhead0 ∈ orl2, ¬ vhead0 ∈ orl0, ¬ phead1 ∈ orl0, ¬ phead1 ∈ orl2, vs[(phead1 ' + orl2.butlast).last].next ≠ null ∧ vs[vs[(phead1 ' + orl2.butlast).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(phead1 ' + orl2.butlast).last].next].deqID.tid)) = Claimed(vs[vs[(phead1 ' + orl2.butlast).last].next].deqID.tid, vs[vs[(phead1 ' + orl2.butlast).last].next].val), phead = phead1 ∨ phead ∈ orl2 ⊦ |
Used simplifier rules: ⊦ a ' + x ≠ []; (s) in-14: ⊦ a ' + x = y → a ∈ y; (forward) from specification list[reflist] in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ r ' + rl from r = r ' + rl; (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) ⊦ a ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s) ⊦ r0 ≠ r → r0 ' + rl from r = rl from r; (s) lapp-04: ⊦ a ' + x = y + b ' ∧ a ≠ b → x.last = b; (forward) from specification list-last[reflist] inapp-10: ⊦ a ' + x = y + b ' ∧ a ≠ b → a ∈ y ∧ b ∈ x; (forward) from specification list[reflist] bin-01: x ≠ [] ⊦ a ∈ x.butlast → a ∈ x; (forward) from specification list-last[reflist] ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ r ∈ rl → r ∈ rl from r; (ss) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ x + y = [] ↔ x = [] ∧ y = []; (as) ⊦ a ' ≠ []; (s) x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: phead1 ' + orl2.butlast, phead2, y
The following image shows the proof tree of sequent calculus. The proved goal is at the bottom. You can click on the nodes to view additional rules. See here for details on colors in a proof tree.