| ⊦ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ DMSQLInv(gs, lsf(tid), pcf(tid)) ∧ (r ∈ gs.vs ∧ r ∈ gs.ps ∧ r ≠ null) ∧ gs0 = ( (gs.ps:= gs.ps[r, gs.ps[r].deqID:= gs.vs[r].deqID]) .orl:= (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[r].deqID ≠ None ⊃ gs.orl + gs.qrl.head;gs.orl)) .qrl:= (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[r].deqID ≠ None ⊃ gs.qrl.tail;gs.qrl) → listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns) ∧ ¬ dups(gs0.orl + gs0.qrl) ∧ markedp(gs0.orl, gs0.ps) ∧ markedp(gs0.orl, gs0.vs) ∧ unmarkedp(gs0.qrl, gs0.ps) ∧ gs0.orl ≠ [] ∧ gs0.phead ∈ gs0.orl ∧ rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns) ∧ allocrv(gs0.vretRefs, gs0.vrvHp) ∧ nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs) ∧ rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns) ∧ allocrv(gs0.pretRefs, gs0.prvHp) ∧ dom gs0.vrvHp = dom gs0.prvHp ∧ ( gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val)) ∧ ( gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs)) ∧ ( gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null) |
dom gs.vrvHp = dom gs.prvHp, gs0 = ( (gs.ps:= gs.ps[r, gs.ps[r].deqID:= gs.vs[r].deqID]) .orl:= (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[r].deqID ≠ None ⊃ gs.orl + gs.qrl.head;gs.orl)) .qrl:= (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[r].deqID ≠ None ⊃ gs.qrl.tail;gs.qrl), gs.orl ≠ [], r ≠ null, DMSQLInv(gs, lsf(tid), pcf(tid)), allocrv(gs.vretRefs, gs.vrvHp), allocrv(gs.pretRefs, gs.prvHp), listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns), markedp(gs.orl, gs.ps), markedp(gs.orl, gs.vs), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.orl, r ∈ gs.vs, r ∈ gs.ps, ¬ dups(gs.orl + gs.qrl), gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val), gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs), gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null ⊦ listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns) ∧ ¬ dups(gs0.orl + gs0.qrl) ∧ markedp(gs0.orl, gs0.ps) ∧ markedp(gs0.orl, gs0.vs) ∧ unmarkedp(gs0.qrl, gs0.ps) ∧ gs0.orl ≠ [] ∧ gs0.phead ∈ gs0.orl ∧ rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns) ∧ allocrv(gs0.vretRefs, gs0.vrvHp) ∧ nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs) ∧ rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns) ∧ allocrv(gs0.pretRefs, gs0.prvHp) ∧ dom gs0.vrvHp = dom gs0.prvHp ∧ ( gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val)) ∧ ( gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs)) ∧ ( gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null)
| dom gs.vrvHp = dom gs.prvHp, gs0 = ( (gs.ps:= gs.ps[r, gs.ps[r].deqID:= gs.vs[r].deqID]) .orl:= (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[r].deqID ≠ None ⊃ gs.orl + gs.qrl.head;gs.orl)) .qrl:= (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[r].deqID ≠ None ⊃ gs.qrl.tail;gs.qrl), gs.orl ≠ [], r ≠ null, DMSQLInv(gs, lsf(tid), pcf(tid)), allocrv(gs.vretRefs, gs.vrvHp), allocrv(gs.pretRefs, gs.prvHp), listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns), markedp(gs.orl, gs.ps), markedp(gs.orl, gs.vs), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.orl, r ∈ gs.vs, r ∈ gs.ps, ¬ dups(gs.orl + gs.qrl), gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val), gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs), gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null ⊦ listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns) ∧ ¬ dups(gs0.orl + gs0.qrl) ∧ markedp(gs0.orl, gs0.ps) ∧ markedp(gs0.orl, gs0.vs) ∧ unmarkedp(gs0.qrl, gs0.ps) ∧ gs0.orl ≠ [] ∧ gs0.phead ∈ gs0.orl ∧ rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns) ∧ allocrv(gs0.vretRefs, gs0.vrvHp) ∧ nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs) ∧ rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns) ∧ allocrv(gs0.pretRefs, gs0.prvHp) ∧ dom gs0.vrvHp = dom gs0.prvHp ∧ ( gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val)) ∧ ( gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs)) ∧ ( gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null) |
dom gs.vrvHp = dom gs.prvHp, gs.orl ≠ [], r ≠ null, DMSQLInv(gs, lsf(tid), pcf(tid)), allocrv(gs.pretRefs, gs.prvHp), allocrv(gs.vretRefs, gs.vrvHp), listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns), markedp(gs.orl, gs.vs), markedp(gs.orl, gs.ps), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), r ∈ gs.ps, r ∈ gs.vs, gs.phead ∈ gs.orl, gs.phead ∈ gs.vs, gs.phead ∈ gs.ps, ¬ dups(gs.orl + gs.qrl), ¬ dups(gs.orl), ¬ dups(gs.qrl), gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val), gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs), gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[gs.qrl.last].next = null ⊦ listp ( (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[gs.qrl.head].deqID ≠ None ⊃ gs.orl + gs.qrl.head ';gs.orl) + (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[gs.qrl.head].deqID ≠ None ⊃ gs.qrl.tail;gs.qrl), gs.vs, gs.ps[r, gs.ps[r].deqID:= gs.vs[r].deqID], gs.owns) ∧ ¬ dups ( (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[gs.qrl.head].deqID ≠ None ⊃ gs.orl + gs.qrl.head ';gs.orl) + (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[gs.qrl.head].deqID ≠ None ⊃ gs.qrl.tail;gs.qrl)) ∧ markedp ((gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[gs.qrl.head].deqID ≠ None ⊃ gs.orl + gs.qrl.head ';gs.orl), gs.ps[r, gs.ps[r].deqID:= gs.vs[r].deqID]) ∧ markedp((gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[gs.qrl.head].deqID ≠ None ⊃ gs.orl + gs.qrl.head ';gs.orl), gs.vs) ∧ unmarkedp((gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[gs.qrl.head].deqID ≠ None ⊃ gs.qrl.tail;gs.qrl), gs.ps[r, gs.ps[r].deqID:= gs.vs[r].deqID]) ∧ (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[gs.qrl.head].deqID ≠ None ⊃ gs.orl + gs.qrl.head ';gs.orl) ≠ [] ∧ gs.phead ∈ (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[gs.qrl.head].deqID ≠ None ⊃ gs.orl + gs.qrl.head ';gs.orl) ∧ nonullRetRefs ( (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[gs.qrl.head].deqID ≠ None ⊃ gs.orl + gs.qrl.head ';gs.orl) + (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[gs.qrl.head].deqID ≠ None ⊃ gs.qrl.tail;gs.qrl), gs.vs, gs.vretRefs, gs.pretRefs) ∧ ( (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[gs.qrl.head].deqID ≠ None ⊃ gs.orl + gs.qrl.head ';gs.orl).last = gs.vhead ∧ ( (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[gs.qrl.head].deqID ≠ None ⊃ gs.qrl.tail;gs.qrl) ≠ [] → unmarkedp((gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[gs.qrl.head].deqID ≠ None ⊃ gs.qrl.tail;gs.qrl).tail, gs.vs)) ∨ (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[gs.qrl.head].deqID ≠ None ⊃ gs.orl + gs.qrl.head ';gs.orl).butlast ≠ [] ∧ (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[gs.qrl.head].deqID ≠ None ⊃ gs.orl + gs.qrl.head ';gs.orl).butlast.last = gs.vhead ∧ gs.phead ≠ (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[gs.qrl.head].deqID ≠ None ⊃ gs.orl + gs.qrl.head ';gs.orl).last ∧ unmarkedp((gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[gs.qrl.head].deqID ≠ None ⊃ gs.qrl.tail;gs.qrl), gs.vs)) ∧ ( gs.vtail = ( (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[gs.qrl.head].deqID ≠ None ⊃ gs.orl + gs.qrl.head ';gs.orl) + (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[gs.qrl.head].deqID ≠ None ⊃ gs.qrl.tail;gs.qrl) ).last ∨ (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[gs.qrl.head].deqID ≠ None ⊃ gs.qrl.tail;gs.qrl) ≠ [] ∧ gs.vtail = ( (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[gs.qrl.head].deqID ≠ None ⊃ gs.orl + gs.qrl.head ';gs.orl) + (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[gs.qrl.head].deqID ≠ None ⊃ gs.qrl.tail;gs.qrl).butlast ).last ∧ gs.vs[(gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[gs.qrl.head].deqID ≠ None ⊃ gs.qrl.tail;gs.qrl).last].deqID = None ∧ gs.vs[(gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[gs.qrl.head].deqID ≠ None ⊃ gs.qrl.tail;gs.qrl).last].next = null)
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 ⊦ y ≠ [] → (x + y).last = y.last; (s) ⊦ (gs.qrl:= qrl).qrl = qrl; (s) ⊦ x + a = x + a '; (s) ⊦ (gs.orl:= qrl0).orl = qrl0; (s) ⊦ (gs.qrl:= qrl).orl = gs.orl; (s) ⊦ (gs.ps:= ps).vs = gs.vs; (s) ⊦ (gs.orl:= qrl0).vs = gs.vs; (s) ⊦ (gs.qrl:= qrl).vs = gs.vs; (s) ⊦ (gs.ps:= ps).vtail = gs.vtail; (s) ⊦ (gs.orl:= qrl0).vtail = gs.vtail; (s) ⊦ (gs.qrl:= qrl).vtail = gs.vtail; (s) ⊦ (gs.ps:= ps).phead = gs.phead; (s) ⊦ (gs.orl:= qrl0).phead = gs.phead; (s) ⊦ (gs.qrl:= qrl).phead = gs.phead; (s) ⊦ (gs.ps:= ps).vhead = gs.vhead; (s) ⊦ (gs.orl:= qrl0).vhead = gs.vhead; (s) ⊦ (gs.qrl:= qrl).vhead = gs.vhead; (s) ⊦ (gs.ps:= ps).rvowns = gs.rvowns; (s) ⊦ (gs.orl:= qrl0).rvowns = gs.rvowns; (s) ⊦ (gs.qrl:= qrl).rvowns = gs.rvowns; (s) ⊦ (gs.ps:= ps).vretRefs = gs.vretRefs; (s) ⊦ (gs.orl:= qrl0).vretRefs = gs.vretRefs; (s) ⊦ (gs.qrl:= qrl).vretRefs = gs.vretRefs; (s) ⊦ (gs.ps:= ps).prvHp = gs.prvHp; (s) ⊦ (gs.orl:= qrl0).prvHp = gs.prvHp; (s) ⊦ (gs.qrl:= qrl).prvHp = gs.prvHp; (s) ⊦ (gs.ps:= ps).vrvHp = gs.vrvHp; (s) ⊦ (gs.orl:= qrl0).vrvHp = gs.vrvHp; (s) ⊦ (gs.qrl:= qrl).vrvHp = gs.vrvHp; (s) ⊦ (gs.ps:= ps).pretRefs = gs.pretRefs; (s) ⊦ (gs.orl:= qrl0).pretRefs = gs.pretRefs; (s) ⊦ (gs.qrl:= qrl).pretRefs = gs.pretRefs; (s) ⊦ (gs.ps:= ps).ps = ps; (s) ⊦ (gs.orl:= qrl0).ps = gs.ps; (s) ⊦ (gs.qrl:= qrl).ps = gs.ps; (s) ⊦ (gs.ps:= ps).owns = gs.owns; (s) ⊦ (gs.orl:= qrl0).owns = gs.owns; (s) ⊦ (gs.qrl:= qrl).owns = gs.owns; (s)
| dom gs.vrvHp = dom gs.prvHp, gs.orl ≠ [], r ≠ null, DMSQLInv(gs, lsf(tid), pcf(tid)), allocrv(gs.pretRefs, gs.prvHp), allocrv(gs.vretRefs, gs.vrvHp), listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns), markedp(gs.orl, gs.vs), markedp(gs.orl, gs.ps), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), r ∈ gs.ps, r ∈ gs.vs, gs.phead ∈ gs.orl, gs.phead ∈ gs.vs, gs.phead ∈ gs.ps, ¬ dups(gs.orl + gs.qrl), ¬ dups(gs.orl), ¬ dups(gs.qrl), gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val), gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs), gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[gs.qrl.last].next = null ⊦ listp ( (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[gs.qrl.head].deqID ≠ None ⊃ gs.orl + gs.qrl.head ';gs.orl) + (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[gs.qrl.head].deqID ≠ None ⊃ gs.qrl.tail;gs.qrl), gs.vs, gs.ps[r, gs.ps[r].deqID:= gs.vs[r].deqID], gs.owns) ∧ ¬ dups ( (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[gs.qrl.head].deqID ≠ None ⊃ gs.orl + gs.qrl.head ';gs.orl) + (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[gs.qrl.head].deqID ≠ None ⊃ gs.qrl.tail;gs.qrl)) ∧ markedp ((gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[gs.qrl.head].deqID ≠ None ⊃ gs.orl + gs.qrl.head ';gs.orl), gs.ps[r, gs.ps[r].deqID:= gs.vs[r].deqID]) ∧ markedp((gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[gs.qrl.head].deqID ≠ None ⊃ gs.orl + gs.qrl.head ';gs.orl), gs.vs) ∧ unmarkedp((gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[gs.qrl.head].deqID ≠ None ⊃ gs.qrl.tail;gs.qrl), gs.ps[r, gs.ps[r].deqID:= gs.vs[r].deqID]) ∧ (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[gs.qrl.head].deqID ≠ None ⊃ gs.orl + gs.qrl.head ';gs.orl) ≠ [] ∧ gs.phead ∈ (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[gs.qrl.head].deqID ≠ None ⊃ gs.orl + gs.qrl.head ';gs.orl) ∧ nonullRetRefs ( (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[gs.qrl.head].deqID ≠ None ⊃ gs.orl + gs.qrl.head ';gs.orl) + (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[gs.qrl.head].deqID ≠ None ⊃ gs.qrl.tail;gs.qrl), gs.vs, gs.vretRefs, gs.pretRefs) ∧ ( (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[gs.qrl.head].deqID ≠ None ⊃ gs.orl + gs.qrl.head ';gs.orl).last = gs.vhead ∧ ( (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[gs.qrl.head].deqID ≠ None ⊃ gs.qrl.tail;gs.qrl) ≠ [] → unmarkedp((gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[gs.qrl.head].deqID ≠ None ⊃ gs.qrl.tail;gs.qrl).tail, gs.vs)) ∨ (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[gs.qrl.head].deqID ≠ None ⊃ gs.orl + gs.qrl.head ';gs.orl).butlast ≠ [] ∧ (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[gs.qrl.head].deqID ≠ None ⊃ gs.orl + gs.qrl.head ';gs.orl).butlast.last = gs.vhead ∧ gs.phead ≠ (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[gs.qrl.head].deqID ≠ None ⊃ gs.orl + gs.qrl.head ';gs.orl).last ∧ unmarkedp((gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[gs.qrl.head].deqID ≠ None ⊃ gs.qrl.tail;gs.qrl), gs.vs)) ∧ ( gs.vtail = ( (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[gs.qrl.head].deqID ≠ None ⊃ gs.orl + gs.qrl.head ';gs.orl) + (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[gs.qrl.head].deqID ≠ None ⊃ gs.qrl.tail;gs.qrl) ).last ∨ (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[gs.qrl.head].deqID ≠ None ⊃ gs.qrl.tail;gs.qrl) ≠ [] ∧ gs.vtail = ( (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[gs.qrl.head].deqID ≠ None ⊃ gs.orl + gs.qrl.head ';gs.orl) + (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[gs.qrl.head].deqID ≠ None ⊃ gs.qrl.tail;gs.qrl).butlast ).last ∧ gs.vs[(gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[gs.qrl.head].deqID ≠ None ⊃ gs.qrl.tail;gs.qrl).last].deqID = None ∧ gs.vs[(gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[gs.qrl.head].deqID ≠ None ⊃ gs.qrl.tail;gs.qrl).last].next = null) |
dom vrvHp = dom prvHp, gs = mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), orl ≠ [], r ≠ null, DMSQLInv(gs, lsf(tid), pcf(tid)), 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, r ∈ vs, r ∈ 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), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ listp ( (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ orl + qrl.head ';orl) + (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ qrl.tail;qrl), vs, ps[r, ps[r].deqID:= vs[r].deqID], owns) ∧ ¬ dups ( (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ orl + qrl.head ';orl) + (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ qrl.tail;qrl)) ∧ markedp((qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ orl + qrl.head ';orl), ps[r, ps[r].deqID:= vs[r].deqID]) ∧ markedp((qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ orl + qrl.head ';orl), vs) ∧ unmarkedp((qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ qrl.tail;qrl), ps[r, ps[r].deqID:= vs[r].deqID]) ∧ (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ orl + qrl.head ';orl) ≠ [] ∧ phead ∈ (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ orl + qrl.head ';orl) ∧ nonullRetRefs ( (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ orl + qrl.head ';orl) + (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ qrl.tail;qrl), vs, vretRefs, pretRefs) ∧ ( (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ orl + qrl.head ';orl).last = vhead ∧ ( (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ qrl.tail;qrl) ≠ [] → unmarkedp((qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ qrl.tail;qrl).tail, vs)) ∨ (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ orl + qrl.head ';orl).butlast ≠ [] ∧ (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ orl + qrl.head ';orl).butlast.last = vhead ∧ phead ≠ (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ orl + qrl.head ';orl).last ∧ unmarkedp((qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ qrl.tail;qrl), vs)) ∧ ( vtail = ( (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ orl + qrl.head ';orl) + (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ qrl.tail;qrl) ).last ∨ (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ qrl.tail;qrl) ≠ [] ∧ vtail = ( (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ orl + qrl.head ';orl) + (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ qrl.tail;qrl).butlast ).last ∧ vs[(qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ qrl.tail;qrl).last].deqID = None ∧ vs[(qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ qrl.tail;qrl).last].next = null)
Used simplifier rules: ⊦ ( ( ( ( ( ( ( ( ( ((ps = gs.ps ∧ vs = gs.vs) ∧ phead = gs.phead) ∧ vhead = gs.vhead) ∧ vtail = gs.vtail) ∧ vretRefs = gs.vretRefs) ∧ pretRefs = gs.pretRefs) ∧ vrvHp = gs.vrvHp) ∧ prvHp = gs.prvHp) ∧ qrl = gs.qrl) ∧ orl = gs.orl) ∧ owns = gs.owns) ∧ rvowns = gs.rvowns ↔ gs = mkgs (ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns); (elim) Used terms: qrl, ps, phead, vrvHp, vretRefs, vhead, vtail, gs, owns, rvowns, orl, prvHp, pretRefs, vs
| dom vrvHp = dom prvHp, gs = mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), orl ≠ [], r ≠ null, DMSQLInv(gs, lsf(tid), pcf(tid)), 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, r ∈ vs, r ∈ 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), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ listp ( (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ orl + qrl.head ';orl) + (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ qrl.tail;qrl), vs, ps[r, ps[r].deqID:= vs[r].deqID], owns) ∧ ¬ dups ( (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ orl + qrl.head ';orl) + (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ qrl.tail;qrl)) ∧ markedp((qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ orl + qrl.head ';orl), ps[r, ps[r].deqID:= vs[r].deqID]) ∧ markedp((qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ orl + qrl.head ';orl), vs) ∧ unmarkedp((qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ qrl.tail;qrl), ps[r, ps[r].deqID:= vs[r].deqID]) ∧ (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ orl + qrl.head ';orl) ≠ [] ∧ phead ∈ (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ orl + qrl.head ';orl) ∧ nonullRetRefs ( (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ orl + qrl.head ';orl) + (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ qrl.tail;qrl), vs, vretRefs, pretRefs) ∧ ( (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ orl + qrl.head ';orl).last = vhead ∧ ( (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ qrl.tail;qrl) ≠ [] → unmarkedp((qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ qrl.tail;qrl).tail, vs)) ∨ (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ orl + qrl.head ';orl).butlast ≠ [] ∧ (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ orl + qrl.head ';orl).butlast.last = vhead ∧ phead ≠ (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ orl + qrl.head ';orl).last ∧ unmarkedp((qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ qrl.tail;qrl), vs)) ∧ ( vtail = ( (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ orl + qrl.head ';orl) + (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ qrl.tail;qrl) ).last ∨ (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ qrl.tail;qrl) ≠ [] ∧ vtail = ( (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ orl + qrl.head ';orl) + (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ qrl.tail;qrl).butlast ).last ∧ vs[(qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ qrl.tail;qrl).last].deqID = None ∧ vs[(qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ qrl.tail;qrl).last].next = null) |
dom vrvHp = dom prvHp, orl ≠ [], r ≠ null, DMSQLInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid), pcf(tid)), 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), r ∈ ps, r ∈ vs, 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 ⊦ listp ( (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ orl + qrl.head ';orl) + (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ qrl.tail;qrl), vs, ps[r, ps[r].deqID:= vs[r].deqID], owns) ∧ ¬ dups ( (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ orl + qrl.head ';orl) + (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ qrl.tail;qrl)) ∧ markedp((qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ orl + qrl.head ';orl), ps[r, ps[r].deqID:= vs[r].deqID]) ∧ markedp((qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ orl + qrl.head ';orl), vs) ∧ unmarkedp((qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ qrl.tail;qrl), ps[r, ps[r].deqID:= vs[r].deqID]) ∧ (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ orl + qrl.head ';orl) ≠ [] ∧ phead ∈ (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ orl + qrl.head ';orl) ∧ nonullRetRefs ( (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ orl + qrl.head ';orl) + (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ qrl.tail;qrl), vs, vretRefs, pretRefs) ∧ ( (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ orl + qrl.head ';orl).last = vhead ∧ ( (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ qrl.tail;qrl) ≠ [] → unmarkedp((qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ qrl.tail;qrl).tail, vs)) ∨ (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ orl + qrl.head ';orl).butlast ≠ [] ∧ (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ orl + qrl.head ';orl).butlast.last = vhead ∧ phead ≠ (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ orl + qrl.head ';orl).last ∧ unmarkedp((qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ qrl.tail;qrl), vs)) ∧ ( vtail = ( (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ orl + qrl.head ';orl) + (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ qrl.tail;qrl) ).last ∨ (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ qrl.tail;qrl) ≠ [] ∧ vtail = ( (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ orl + qrl.head ';orl) + (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ qrl.tail;qrl).butlast ).last ∧ vs[(qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ qrl.tail;qrl).last].deqID = None ∧ vs[(qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ qrl.tail;qrl).last].next = null)
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
| dom vrvHp = dom prvHp, orl ≠ [], r ≠ null, DMSQLInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid), pcf(tid)), 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), r ∈ ps, r ∈ vs, 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 ⊦ listp ( (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ orl + qrl.head ';orl) + (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ qrl.tail;qrl), vs, ps[r, ps[r].deqID:= vs[r].deqID], owns) ∧ ¬ dups ( (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ orl + qrl.head ';orl) + (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ qrl.tail;qrl)) ∧ markedp((qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ orl + qrl.head ';orl), ps[r, ps[r].deqID:= vs[r].deqID]) ∧ markedp((qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ orl + qrl.head ';orl), vs) ∧ unmarkedp((qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ qrl.tail;qrl), ps[r, ps[r].deqID:= vs[r].deqID]) ∧ (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ orl + qrl.head ';orl) ≠ [] ∧ phead ∈ (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ orl + qrl.head ';orl) ∧ nonullRetRefs ( (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ orl + qrl.head ';orl) + (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ qrl.tail;qrl), vs, vretRefs, pretRefs) ∧ ( (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ orl + qrl.head ';orl).last = vhead ∧ ( (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ qrl.tail;qrl) ≠ [] → unmarkedp((qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ qrl.tail;qrl).tail, vs)) ∨ (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ orl + qrl.head ';orl).butlast ≠ [] ∧ (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ orl + qrl.head ';orl).butlast.last = vhead ∧ phead ≠ (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ orl + qrl.head ';orl).last ∧ unmarkedp((qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ qrl.tail;qrl), vs)) ∧ ( vtail = ( (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ orl + qrl.head ';orl) + (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ qrl.tail;qrl) ).last ∨ (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ qrl.tail;qrl) ≠ [] ∧ vtail = ( (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ orl + qrl.head ';orl) + (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ qrl.tail;qrl).butlast ).last ∧ vs[(qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ qrl.tail;qrl).last].deqID = None ∧ vs[(qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ qrl.tail;qrl).last].next = null) |
dom vrvHp = dom prvHp, r = qrl.head, vs[qrl.head].deqID ≠ None, orl ≠ [], qrl ≠ [], r ≠ null, DMSQLInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid), pcf(tid)), 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, r ∈ vs, r ∈ 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), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ listp ( (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ orl + qrl.head ';orl) + (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ qrl.tail;qrl), vs, ps[r, ps[r].deqID:= vs[r].deqID], owns) ∧ ¬ dups ( (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ orl + qrl.head ';orl) + (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ qrl.tail;qrl)) ∧ markedp((qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ orl + qrl.head ';orl), ps[r, ps[r].deqID:= vs[r].deqID]) ∧ markedp((qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ orl + qrl.head ';orl), vs) ∧ unmarkedp((qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ qrl.tail;qrl), ps[r, ps[r].deqID:= vs[r].deqID]) ∧ (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ orl + qrl.head ';orl) ≠ [] ∧ phead ∈ (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ orl + qrl.head ';orl) ∧ nonullRetRefs ( (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ orl + qrl.head ';orl) + (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ qrl.tail;qrl), vs, vretRefs, pretRefs) ∧ ( (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ orl + qrl.head ';orl).last = vhead ∧ ( (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ qrl.tail;qrl) ≠ [] → unmarkedp((qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ qrl.tail;qrl).tail, vs)) ∨ (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ orl + qrl.head ';orl).butlast ≠ [] ∧ (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ orl + qrl.head ';orl).butlast.last = vhead ∧ phead ≠ (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ orl + qrl.head ';orl).last ∧ unmarkedp((qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ qrl.tail;qrl), vs)) ∧ ( vtail = ( (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ orl + qrl.head ';orl) + (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ qrl.tail;qrl) ).last ∨ (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ qrl.tail;qrl) ≠ [] ∧ vtail = ( (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ orl + qrl.head ';orl) + (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ qrl.tail;qrl).butlast ).last ∧ vs[(qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ qrl.tail;qrl).last].deqID = None ∧ vs[(qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ qrl.tail;qrl).last].next = null)
dom vrvHp = dom prvHp, orl ≠ [], r ≠ null, DMSQLInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid), pcf(tid)), 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, r ∈ vs, r ∈ 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), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ listp ( (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ orl + qrl.head ';orl) + (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ qrl.tail;qrl), vs, ps[r, ps[r].deqID:= vs[r].deqID], owns) ∧ ¬ dups ( (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ orl + qrl.head ';orl) + (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ qrl.tail;qrl)) ∧ markedp((qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ orl + qrl.head ';orl), ps[r, ps[r].deqID:= vs[r].deqID]) ∧ markedp((qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ orl + qrl.head ';orl), vs) ∧ unmarkedp((qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ qrl.tail;qrl), ps[r, ps[r].deqID:= vs[r].deqID]) ∧ (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ orl + qrl.head ';orl) ≠ [] ∧ phead ∈ (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ orl + qrl.head ';orl) ∧ nonullRetRefs ( (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ orl + qrl.head ';orl) + (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ qrl.tail;qrl), vs, vretRefs, pretRefs) ∧ ( (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ orl + qrl.head ';orl).last = vhead ∧ ( (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ qrl.tail;qrl) ≠ [] → unmarkedp((qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ qrl.tail;qrl).tail, vs)) ∨ (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ orl + qrl.head ';orl).butlast ≠ [] ∧ (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ orl + qrl.head ';orl).butlast.last = vhead ∧ phead ≠ (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ orl + qrl.head ';orl).last ∧ unmarkedp((qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ qrl.tail;qrl), vs)) ∧ ( vtail = ( (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ orl + qrl.head ';orl) + (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ qrl.tail;qrl) ).last ∨ (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ qrl.tail;qrl) ≠ [] ∧ vtail = ( (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ orl + qrl.head ';orl) + (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ qrl.tail;qrl).butlast ).last ∧ vs[(qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ qrl.tail;qrl).last].deqID = None ∧ vs[(qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ qrl.tail;qrl).last].next = null), qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None
Used formulas: qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None
| dom vrvHp = dom prvHp, r = qrl.head, vs[qrl.head].deqID ≠ None, orl ≠ [], qrl ≠ [], r ≠ null, DMSQLInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid), pcf(tid)), 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, r ∈ vs, r ∈ 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), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ listp ( (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ orl + qrl.head ';orl) + (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ qrl.tail;qrl), vs, ps[r, ps[r].deqID:= vs[r].deqID], owns) ∧ ¬ dups ( (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ orl + qrl.head ';orl) + (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ qrl.tail;qrl)) ∧ markedp((qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ orl + qrl.head ';orl), ps[r, ps[r].deqID:= vs[r].deqID]) ∧ markedp((qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ orl + qrl.head ';orl), vs) ∧ unmarkedp((qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ qrl.tail;qrl), ps[r, ps[r].deqID:= vs[r].deqID]) ∧ (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ orl + qrl.head ';orl) ≠ [] ∧ phead ∈ (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ orl + qrl.head ';orl) ∧ nonullRetRefs ( (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ orl + qrl.head ';orl) + (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ qrl.tail;qrl), vs, vretRefs, pretRefs) ∧ ( (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ orl + qrl.head ';orl).last = vhead ∧ ( (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ qrl.tail;qrl) ≠ [] → unmarkedp((qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ qrl.tail;qrl).tail, vs)) ∨ (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ orl + qrl.head ';orl).butlast ≠ [] ∧ (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ orl + qrl.head ';orl).butlast.last = vhead ∧ phead ≠ (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ orl + qrl.head ';orl).last ∧ unmarkedp((qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ qrl.tail;qrl), vs)) ∧ ( vtail = ( (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ orl + qrl.head ';orl) + (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ qrl.tail;qrl) ).last ∨ (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ qrl.tail;qrl) ≠ [] ∧ vtail = ( (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ orl + qrl.head ';orl) + (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ qrl.tail;qrl).butlast ).last ∧ vs[(qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ qrl.tail;qrl).last].deqID = None ∧ vs[(qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ qrl.tail;qrl).last].next = null) |
dom vrvHp = dom prvHp, vs[qrl.head].deqID ≠ None, qrl.head ≠ null, orl ≠ [], qrl ≠ [], DMSQLInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid), pcf(tid)), 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), qrl.head ∈ ps, qrl.head ∈ vs, 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), vtail = qrl.last ∨ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ listp(orl + qrl, vs, ps[qrl.head, ps[qrl.head].deqID:= vs[qrl.head].deqID], owns) ∧ markedp(orl, ps[qrl.head, ps[qrl.head].deqID:= vs[qrl.head].deqID]) ∧ some?(vs[qrl.head].deqID) ∧ unmarkedp(qrl.tail, ps[qrl.head, ps[qrl.head].deqID:= vs[qrl.head].deqID]) ∧ (qrl.head = vhead ∧ (qrl.tail ≠ [] → unmarkedp(qrl.tail.tail, vs)) ∨ orl.last = vhead ∧ phead ≠ qrl.head ∧ unmarkedp(qrl.tail, vs)) ∧ (vtail = qrl.last ∨ qrl.tail ≠ [] ∧ vtail = (qrl.head ' + qrl.tail.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null)
Used simplifier rules: ⊦ x ≠ [] ∧ x.tail ≠ [] → x.tail.last = x.last; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ (x + a ' + y).last = (a ' + y).last; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) ⊦ x ≠ [] → x.head ' + x.tail = x; (s) ⊦ (x + a ').last = a; (s) ⊦ (x + a ').butlast = x; (s) ⊦ a ∈ x → a ∈ x + y; (s) ⊦ x + a ' ≠ []; (s) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s) ⊦ (nd.deqID:= opttid).deqID = opttid; (s) ⊦ a = b → st[b, d][a] = d; (s)
| dom vrvHp = dom prvHp, vs[qrl.head].deqID ≠ None, qrl.head ≠ null, orl ≠ [], qrl ≠ [], DMSQLInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid), pcf(tid)), 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), qrl.head ∈ ps, qrl.head ∈ vs, 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), vtail = qrl.last ∨ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ listp(orl + qrl, vs, ps[qrl.head, ps[qrl.head].deqID:= vs[qrl.head].deqID], owns) ∧ markedp(orl, ps[qrl.head, ps[qrl.head].deqID:= vs[qrl.head].deqID]) ∧ some?(vs[qrl.head].deqID) ∧ unmarkedp(qrl.tail, ps[qrl.head, ps[qrl.head].deqID:= vs[qrl.head].deqID]) ∧ (qrl.head = vhead ∧ (qrl.tail ≠ [] → unmarkedp(qrl.tail.tail, vs)) ∨ orl.last = vhead ∧ phead ≠ qrl.head ∧ unmarkedp(qrl.tail, vs)) ∧ (vtail = qrl.last ∨ qrl.tail ≠ [] ∧ vtail = (qrl.head ' + qrl.tail.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null) |
dom vrvHp = dom prvHp, qrl = vtail0 + orl0, vs[vtail0].deqID ≠ None, orl ≠ [], qrl ≠ [], vtail0 ≠ null, DMSQLInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid), pcf(tid)), 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, vtail0 ∈ vs, vtail0 ∈ 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), vtail = qrl.last ∨ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ listp(orl + qrl, vs, ps[vtail0, ps[vtail0].deqID:= vs[vtail0].deqID], owns) ∧ markedp(orl, ps[vtail0, ps[vtail0].deqID:= vs[vtail0].deqID]) ∧ some?(vs[vtail0].deqID) ∧ unmarkedp(orl0, ps[vtail0, ps[vtail0].deqID:= vs[vtail0].deqID]) ∧ (vtail0 = vhead ∧ (orl0 ≠ [] → unmarkedp(orl0.tail, vs)) ∨ orl.last = vhead ∧ phead ≠ vtail0 ∧ unmarkedp(orl0, vs)) ∧ (vtail = qrl.last ∨ orl0 ≠ [] ∧ vtail = (vtail0 ' + orl0.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null)
Used simplifier rules: ⊦ x ≠ [] → (head = x.head ∧ tail = x.tail ↔ x = head + tail); (elim) Used terms: qrl, head, orl0
| dom vrvHp = dom prvHp, qrl = vtail0 + orl0, vs[vtail0].deqID ≠ None, orl ≠ [], qrl ≠ [], vtail0 ≠ null, DMSQLInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid), pcf(tid)), 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, vtail0 ∈ vs, vtail0 ∈ 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), vtail = qrl.last ∨ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ listp(orl + qrl, vs, ps[vtail0, ps[vtail0].deqID:= vs[vtail0].deqID], owns) ∧ markedp(orl, ps[vtail0, ps[vtail0].deqID:= vs[vtail0].deqID]) ∧ some?(vs[vtail0].deqID) ∧ unmarkedp(orl0, ps[vtail0, ps[vtail0].deqID:= vs[vtail0].deqID]) ∧ (vtail0 = vhead ∧ (orl0 ≠ [] → unmarkedp(orl0.tail, vs)) ∨ orl.last = vhead ∧ phead ≠ vtail0 ∧ unmarkedp(orl0, vs)) ∧ (vtail = qrl.last ∨ orl0 ≠ [] ∧ vtail = (vtail0 ' + orl0.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null) |
ps[vtail0].deqID = None, dom vrvHp = dom prvHp, vs[vtail0].deqID ≠ None, orl ≠ [], vtail0 ≠ null, DMSQLInv(mkgs(ps, vs, phead, orl.last, vtail, vretRefs, pretRefs, vrvHp, prvHp, vtail0 ' + orl0, orl, owns, rvowns), lsf(tid), pcf(tid)), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + vtail0 ' + orl0, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + vtail0 ' + orl0, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl0, vs), unmarkedp(orl0, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, vtail0 ∈ vs, vtail0 ∈ ps, ¬ dups(orl0), ¬ dups(orl), ¬ dups(orl + orl0), ¬ vtail0 ∈ orl0, ¬ vtail0 ∈ 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), vtail = (vtail0 ' + orl0).last ∨ vtail = (orl + (vtail0 ' + orl0).butlast).last ∧ vs[(vtail0 ' + orl0).last].deqID = None ∧ vs[(vtail0 ' + orl0).last].next = null ⊦ listp(orl + vtail0 ' + orl0, vs, ps[vtail0, ps[vtail0].deqID:= vs[vtail0].deqID], owns) ∧ some?(vs[vtail0].deqID) ∧ (vtail = (vtail0 ' + orl0).last ∨ orl0 ≠ [] ∧ vtail = (vtail0 ' + orl0.butlast).last ∧ vs[orl0.last].deqID = None ∧ vs[orl0.last].next = null)
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).last = x.last; (s) ⊦ a + x = a ' + x; (s) ⊦ ¬ node ∈ rl → (unmarkedp(rl, vs[node, nd]) ↔ unmarkedp(rl, vs)); (s) ⊦ ¬ node ∈ rl → (markedp(rl, vs[node, nd]) ↔ markedp(rl, vs)); (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)
| ps[vtail0].deqID = None, dom vrvHp = dom prvHp, vs[vtail0].deqID ≠ None, orl ≠ [], vtail0 ≠ null, DMSQLInv(mkgs(ps, vs, phead, orl.last, vtail, vretRefs, pretRefs, vrvHp, prvHp, vtail0 ' + orl0, orl, owns, rvowns), lsf(tid), pcf(tid)), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + vtail0 ' + orl0, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + vtail0 ' + orl0, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl0, vs), unmarkedp(orl0, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, vtail0 ∈ vs, vtail0 ∈ ps, ¬ dups(orl0), ¬ dups(orl), ¬ dups(orl + orl0), ¬ vtail0 ∈ orl0, ¬ vtail0 ∈ 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), vtail = (vtail0 ' + orl0).last ∨ vtail = (orl + (vtail0 ' + orl0).butlast).last ∧ vs[(vtail0 ' + orl0).last].deqID = None ∧ vs[(vtail0 ' + orl0).last].next = null ⊦ listp(orl + vtail0 ' + orl0, vs, ps[vtail0, ps[vtail0].deqID:= vs[vtail0].deqID], owns) ∧ some?(vs[vtail0].deqID) ∧ (vtail = (vtail0 ' + orl0).last ∨ orl0 ≠ [] ∧ vtail = (vtail0 ' + orl0.butlast).last ∧ vs[orl0.last].deqID = None ∧ vs[orl0.last].next = null) |
⊦ listp(rl + rl0, vs, ps, owns) → (listp(rl0, vs, ps, owns) ↔ rl0 ≠ [])
ps[vtail0].deqID = None, dom vrvHp = dom prvHp, vs[vtail0].deqID ≠ None, orl ≠ [], vtail0 ≠ null, DMSQLInv(mkgs(ps, vs, phead, orl.last, vtail, vretRefs, pretRefs, vrvHp, prvHp, vtail0 ' + orl0, orl, owns, rvowns), lsf(tid), pcf(tid)), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + vtail0 ' + orl0, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nonullRetRefs(orl + vtail0 ' + orl0, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl0, ps), unmarkedp(orl0, vs), vtail0 ∈ ps, vtail0 ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl0), ¬ dups(orl), ¬ dups(orl + orl0), ¬ vtail0 ∈ orl0, ¬ vtail0 ∈ 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), listp(orl + vtail0 ' + orl0, vs, ps, owns) → (listp(vtail0 ' + orl0, vs, ps, owns) ↔ vtail0 ' + orl0 ≠ []), vtail = (vtail0 ' + orl0).last ∨ vtail = (orl + (vtail0 ' + orl0).butlast).last ∧ vs[(vtail0 ' + orl0).last].deqID = None ∧ vs[(vtail0 ' + orl0).last].next = null ⊦ listp(orl + vtail0 ' + orl0, vs, ps[vtail0, ps[vtail0].deqID:= vs[vtail0].deqID], owns) ∧ some?(vs[vtail0].deqID) ∧ (vtail = (vtail0 ' + orl0).last ∨ orl0 ≠ [] ∧ vtail = (vtail0 ' + orl0.butlast).last ∧ vs[orl0.last].deqID = None ∧ vs[orl0.last].next = null)
Used terms: ps, orl, owns, vtail0 ' + orl0, vs
| ⊦ listp(rl + rl0, vs, ps, owns) → (listp(rl0, vs, ps, owns) ↔ rl0 ≠ []) |
| ps[vtail0].deqID = None, dom vrvHp = dom prvHp, vs[vtail0].deqID ≠ None, orl ≠ [], vtail0 ≠ null, DMSQLInv(mkgs(ps, vs, phead, orl.last, vtail, vretRefs, pretRefs, vrvHp, prvHp, vtail0 ' + orl0, orl, owns, rvowns), lsf(tid), pcf(tid)), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + vtail0 ' + orl0, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nonullRetRefs(orl + vtail0 ' + orl0, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl0, ps), unmarkedp(orl0, vs), vtail0 ∈ ps, vtail0 ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl0), ¬ dups(orl), ¬ dups(orl + orl0), ¬ vtail0 ∈ orl0, ¬ vtail0 ∈ 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), listp(orl + vtail0 ' + orl0, vs, ps, owns) → (listp(vtail0 ' + orl0, vs, ps, owns) ↔ vtail0 ' + orl0 ≠ []), vtail = (vtail0 ' + orl0).last ∨ vtail = (orl + (vtail0 ' + orl0).butlast).last ∧ vs[(vtail0 ' + orl0).last].deqID = None ∧ vs[(vtail0 ' + orl0).last].next = null ⊦ listp(orl + vtail0 ' + orl0, vs, ps[vtail0, ps[vtail0].deqID:= vs[vtail0].deqID], owns) ∧ some?(vs[vtail0].deqID) ∧ (vtail = (vtail0 ' + orl0).last ∨ orl0 ≠ [] ∧ vtail = (vtail0 ' + orl0.butlast).last ∧ vs[orl0.last].deqID = None ∧ vs[orl0.last].next = null) |
ps[vtail0].deqID = None, dom vrvHp = dom prvHp, vs[vtail0].deqID ≠ None, orl ≠ [], vtail0 ≠ null, DMSQLInv(mkgs(ps, vs, phead, orl.last, vtail, vretRefs, pretRefs, vrvHp, prvHp, vtail0 ' + orl0, orl, owns, rvowns), lsf(tid), pcf(tid)), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + vtail0 ' + orl0, vs, ps, owns), listp(vtail0 ' + orl0, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + vtail0 ' + orl0, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl0, vs), unmarkedp(orl0, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, vtail0 ∈ vs, vtail0 ∈ ps, ¬ dups(orl0), ¬ dups(orl), ¬ dups(orl + orl0), ¬ vtail0 ∈ orl0, ¬ vtail0 ∈ 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), vtail = (vtail0 ' + orl0).last ∨ vtail = (orl + (vtail0 ' + orl0).butlast).last ∧ vs[(vtail0 ' + orl0).last].deqID = None ∧ vs[(vtail0 ' + orl0).last].next = null ⊦ listp(orl + vtail0 ' + orl0, vs, ps[vtail0, ps[vtail0].deqID:= vs[vtail0].deqID], owns) ∧ some?(vs[vtail0].deqID) ∧ (vtail = (vtail0 ' + orl0).last ∨ orl0 ≠ [] ∧ vtail = (vtail0 ' + orl0.butlast).last ∧ vs[orl0.last].deqID = None ∧ vs[orl0.last].next = null)
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ' + x ≠ []; (s)
| ps[vtail0].deqID = None, dom vrvHp = dom prvHp, vs[vtail0].deqID ≠ None, orl ≠ [], vtail0 ≠ null, DMSQLInv(mkgs(ps, vs, phead, orl.last, vtail, vretRefs, pretRefs, vrvHp, prvHp, vtail0 ' + orl0, orl, owns, rvowns), lsf(tid), pcf(tid)), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + vtail0 ' + orl0, vs, ps, owns), listp(vtail0 ' + orl0, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + vtail0 ' + orl0, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl0, vs), unmarkedp(orl0, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, vtail0 ∈ vs, vtail0 ∈ ps, ¬ dups(orl0), ¬ dups(orl), ¬ dups(orl + orl0), ¬ vtail0 ∈ orl0, ¬ vtail0 ∈ 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), vtail = (vtail0 ' + orl0).last ∨ vtail = (orl + (vtail0 ' + orl0).butlast).last ∧ vs[(vtail0 ' + orl0).last].deqID = None ∧ vs[(vtail0 ' + orl0).last].next = null ⊦ listp(orl + vtail0 ' + orl0, vs, ps[vtail0, ps[vtail0].deqID:= vs[vtail0].deqID], owns) ∧ some?(vs[vtail0].deqID) ∧ (vtail = (vtail0 ' + orl0).last ∨ orl0 ≠ [] ∧ vtail = (vtail0 ' + orl0.butlast).last ∧ vs[orl0.last].deqID = None ∧ vs[orl0.last].next = null) |
ps[vtail0].deqID = None, Some(tid0) = vs[vtail0].deqID, dom vrvHp = dom prvHp, vs[vtail0].deqID ≠ None, orl ≠ [], vtail0 ≠ null, DMSQLInv(mkgs(ps, vs, phead, orl.last, vtail, vretRefs, pretRefs, vrvHp, prvHp, vtail0 ' + orl0, orl, owns, rvowns), lsf(tid), pcf(tid)), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(vtail0 ' + orl0, vs, ps, owns), listp(orl + vtail0 ' + orl0, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nonullRetRefs(orl + vtail0 ' + orl0, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl0, ps), unmarkedp(orl0, vs), vtail0 ∈ ps, vtail0 ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl0), ¬ dups(orl), ¬ dups(orl + orl0), ¬ vtail0 ∈ orl0, ¬ vtail0 ∈ 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), vtail = (vtail0 ' + orl0).last ∨ vtail = (orl + (vtail0 ' + orl0).butlast).last ∧ vs[(vtail0 ' + orl0).last].deqID = None ∧ vs[(vtail0 ' + orl0).last].next = null ⊦ listp(orl + vtail0 ' + orl0, vs, ps[vtail0, ps[vtail0].deqID:= vs[vtail0].deqID], owns) ∧ some?(vs[vtail0].deqID) ∧ (vtail = (vtail0 ' + orl0).last ∨ orl0 ≠ [] ∧ vtail = (vtail0 ' + orl0.butlast).last ∧ vs[orl0.last].deqID = None ∧ vs[orl0.last].next = null)
ps[vtail0].deqID = None, Weak(tid0) = vs[vtail0].deqID, dom vrvHp = dom prvHp, vs[vtail0].deqID ≠ None, orl ≠ [], vtail0 ≠ null, DMSQLInv(mkgs(ps, vs, phead, orl.last, vtail, vretRefs, pretRefs, vrvHp, prvHp, vtail0 ' + orl0, orl, owns, rvowns), lsf(tid), pcf(tid)), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(vtail0 ' + orl0, vs, ps, owns), listp(orl + vtail0 ' + orl0, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nonullRetRefs(orl + vtail0 ' + orl0, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl0, ps), unmarkedp(orl0, vs), vtail0 ∈ ps, vtail0 ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl0), ¬ dups(orl), ¬ dups(orl + orl0), ¬ vtail0 ∈ orl0, ¬ vtail0 ∈ 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), vtail = (vtail0 ' + orl0).last ∨ vtail = (orl + (vtail0 ' + orl0).butlast).last ∧ vs[(vtail0 ' + orl0).last].deqID = None ∧ vs[(vtail0 ' + orl0).last].next = null ⊦ listp(orl + vtail0 ' + orl0, vs, ps[vtail0, ps[vtail0].deqID:= vs[vtail0].deqID], owns) ∧ some?(vs[vtail0].deqID) ∧ (vtail = (vtail0 ' + orl0).last ∨ orl0 ≠ [] ∧ vtail = (vtail0 ' + orl0.butlast).last ∧ vs[orl0.last].deqID = None ∧ vs[orl0.last].next = null)
Used simplifier rules: OptTid freely generated by None, Some, Weak;;
| ps[vtail0].deqID = None, Some(tid0) = vs[vtail0].deqID, dom vrvHp = dom prvHp, vs[vtail0].deqID ≠ None, orl ≠ [], vtail0 ≠ null, DMSQLInv(mkgs(ps, vs, phead, orl.last, vtail, vretRefs, pretRefs, vrvHp, prvHp, vtail0 ' + orl0, orl, owns, rvowns), lsf(tid), pcf(tid)), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(vtail0 ' + orl0, vs, ps, owns), listp(orl + vtail0 ' + orl0, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nonullRetRefs(orl + vtail0 ' + orl0, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl0, ps), unmarkedp(orl0, vs), vtail0 ∈ ps, vtail0 ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl0), ¬ dups(orl), ¬ dups(orl + orl0), ¬ vtail0 ∈ orl0, ¬ vtail0 ∈ 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), vtail = (vtail0 ' + orl0).last ∨ vtail = (orl + (vtail0 ' + orl0).butlast).last ∧ vs[(vtail0 ' + orl0).last].deqID = None ∧ vs[(vtail0 ' + orl0).last].next = null ⊦ listp(orl + vtail0 ' + orl0, vs, ps[vtail0, ps[vtail0].deqID:= vs[vtail0].deqID], owns) ∧ some?(vs[vtail0].deqID) ∧ (vtail = (vtail0 ' + orl0).last ∨ orl0 ≠ [] ∧ vtail = (vtail0 ' + orl0.butlast).last ∧ vs[orl0.last].deqID = None ∧ vs[orl0.last].next = null) |
vs[(vtail0 ' + orl0).last].deqID = None, ps[vtail0].deqID = None, vs[(vtail0 ' + orl0).last].next = null, Some(tid0) = vs[vtail0].deqID, dom vrvHp = dom prvHp, (orl + (vtail0 ' + orl0).butlast).last ≠ (vtail0 ' + orl0).last, orl ≠ [], vtail0 ≠ null, DMSQLInv (mkgs(ps, vs, phead, orl.last, (orl + (vtail0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, vtail0 ' + orl0, orl, owns, rvowns), lsf(tid), pcf(tid)), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + vtail0 ' + orl0, vs, ps, owns), listp(vtail0 ' + orl0, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + vtail0 ' + orl0, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl0, vs), unmarkedp(orl0, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, vtail0 ∈ vs, vtail0 ∈ ps, ¬ dups(orl0), ¬ dups(orl), ¬ dups(orl + orl0), ¬ vtail0 ∈ orl0, ¬ vtail0 ∈ 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) ⊦ orl0 ≠ [] ∧ vs[orl0.last].deqID = None ∧ vs[orl0.last].next = null
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ (x + a ' + y).last = (a ' + y).last; (s) ⊦ x ≠ [] → (a ' + x).butlast = a ' + x.butlast; (s) ⊦ some?(Some(tid)); (s) ⊦ None ≠ Some(tid); (s) ⊦ listp(rl, vs, ps, owns) ∧ vs[r].deqID = Some(tid) → listp(rl, vs, ps[r, ps[r].deqID:= vs[r].deqID], owns); (ss)
| vs[(vtail0 ' + orl0).last].deqID = None, ps[vtail0].deqID = None, vs[(vtail0 ' + orl0).last].next = null, Some(tid0) = vs[vtail0].deqID, dom vrvHp = dom prvHp, (orl + (vtail0 ' + orl0).butlast).last ≠ (vtail0 ' + orl0).last, orl ≠ [], vtail0 ≠ null, DMSQLInv (mkgs(ps, vs, phead, orl.last, (orl + (vtail0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, vtail0 ' + orl0, orl, owns, rvowns), lsf(tid), pcf(tid)), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + vtail0 ' + orl0, vs, ps, owns), listp(vtail0 ' + orl0, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + vtail0 ' + orl0, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl0, vs), unmarkedp(orl0, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, vtail0 ∈ vs, vtail0 ∈ ps, ¬ dups(orl0), ¬ dups(orl), ¬ dups(orl + orl0), ¬ vtail0 ∈ orl0, ¬ vtail0 ∈ 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) ⊦ orl0 ≠ [] ∧ vs[orl0.last].deqID = None ∧ vs[orl0.last].next = null |
⊦ y ≠ [] → (x + y).last = y.last
Used simplifier rules: ⊦ x ≠ [] → (a ' + x).butlast = a ' + x.butlast; (s) ⊦ (x + a ' + y).last = (a ' + y).last; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a '.last = a; (s) ⊦ unmarkedp([], vs); (s) ⊦ listp(r ', vs, ps, owns) ↔ owns(r) = None ∧ r ∈ vs ∧ r ∈ ps ∧ r ≠ null ∧ ¬ weak?(vs[r].deqID) ∧ (ps[r].deqID = vs[r].deqID ∨ ps[r].deqID = None) ∧ ps[r].val = vs[r].val ∧ ps[r].next = null ∧ ( vs[r].next ≠ null → vs[r].next ∈ vs ∧ vs[r].next ∈ ps ∧ ps[vs[r].next] = vs[vs[r].next] ∧ ps[vs[r].next].deqID = None ∧ ps[vs[r].next].next = null ∧ weak?(owns(vs[r].next))); (s) ⊦ a '.butlast = []; (s) ⊦ ¬ dups([]); (s) ⊦ x + [] = x; (s) ⊦ ¬ a ∈ []; (s) ⊦ None ≠ Some(tid); (s) Used terms: vtail0 ', orl0
| ⊦ y ≠ [] → (x + y).last = y.last |
| ps[vtail0].deqID = None, Weak(tid0) = vs[vtail0].deqID, dom vrvHp = dom prvHp, vs[vtail0].deqID ≠ None, orl ≠ [], vtail0 ≠ null, DMSQLInv(mkgs(ps, vs, phead, orl.last, vtail, vretRefs, pretRefs, vrvHp, prvHp, vtail0 ' + orl0, orl, owns, rvowns), lsf(tid), pcf(tid)), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(vtail0 ' + orl0, vs, ps, owns), listp(orl + vtail0 ' + orl0, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nonullRetRefs(orl + vtail0 ' + orl0, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl0, ps), unmarkedp(orl0, vs), vtail0 ∈ ps, vtail0 ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl0), ¬ dups(orl), ¬ dups(orl + orl0), ¬ vtail0 ∈ orl0, ¬ vtail0 ∈ 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), vtail = (vtail0 ' + orl0).last ∨ vtail = (orl + (vtail0 ' + orl0).butlast).last ∧ vs[(vtail0 ' + orl0).last].deqID = None ∧ vs[(vtail0 ' + orl0).last].next = null ⊦ listp(orl + vtail0 ' + orl0, vs, ps[vtail0, ps[vtail0].deqID:= vs[vtail0].deqID], owns) ∧ some?(vs[vtail0].deqID) ∧ (vtail = (vtail0 ' + orl0).last ∨ orl0 ≠ [] ∧ vtail = (vtail0 ' + orl0.butlast).last ∧ vs[orl0.last].deqID = None ∧ vs[orl0.last].next = null) |
ps[vtail0].deqID = None, Weak(tid0) = vs[vtail0].deqID, dom vrvHp = dom prvHp, orl ≠ [], vtail0 ≠ null, DMSQLInv(mkgs(ps, vs, phead, orl.last, vtail, vretRefs, pretRefs, vrvHp, prvHp, vtail0 ' + orl0, orl, owns, rvowns), lsf(tid), pcf(tid)), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(vtail0 ' + orl0, vs, ps, owns), listp(orl + vtail0 ' + orl0, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nonullRetRefs(orl + vtail0 ' + orl0, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl0, ps), unmarkedp(orl0, vs), vtail0 ∈ ps, vtail0 ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ vtail0 ∈ orl, ¬ vtail0 ∈ orl0, 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), vtail = (vtail0 ' + orl0).last ∨ vtail = (orl + (vtail0 ' + orl0).butlast).last ∧ vs[(vtail0 ' + orl0).last].deqID = None ∧ vs[(vtail0 ' + orl0).last].next = null ⊦
Used simplifier rules: ⊦ ¬ some?(Weak(tid)); (s) ⊦ None ≠ Weak(tid); (s)
| ps[vtail0].deqID = None, Weak(tid0) = vs[vtail0].deqID, dom vrvHp = dom prvHp, orl ≠ [], vtail0 ≠ null, DMSQLInv(mkgs(ps, vs, phead, orl.last, vtail, vretRefs, pretRefs, vrvHp, prvHp, vtail0 ' + orl0, orl, owns, rvowns), lsf(tid), pcf(tid)), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(vtail0 ' + orl0, vs, ps, owns), listp(orl + vtail0 ' + orl0, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nonullRetRefs(orl + vtail0 ' + orl0, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl0, ps), unmarkedp(orl0, vs), vtail0 ∈ ps, vtail0 ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ vtail0 ∈ orl, ¬ vtail0 ∈ orl0, 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), vtail = (vtail0 ' + orl0).last ∨ vtail = (orl + (vtail0 ' + orl0).butlast).last ∧ vs[(vtail0 ' + orl0).last].deqID = None ∧ vs[(vtail0 ' + orl0).last].next = null ⊦ |
Used simplifier rules: reflist freely generated by [], +;; ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) ⊦ listp(r ' + r0 ' + rl, vs, ps, owns) ↔ owns(r) = None ∧ r ∈ vs ∧ r ∈ ps ∧ r ≠ null ∧ ¬ weak?(vs[r].deqID) ∧ (ps[r].deqID = vs[r].deqID ∨ ps[r].deqID = None) ∧ ps[r].val = vs[r].val ∧ ps[r].next = vs[r].next ∧ ps[r].next = r0 ∧ listp(r0 ' + rl, vs, ps, owns); (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) ⊦ (a ' + b ' + x).butlast = a ' + (b ' + x).butlast; (s) ⊦ (x + a ' + y).last = (a ' + y).last; (s) ⊦ a + x = a ' + x; (s) ⊦ (b ' + a ' + x).last = (a ' + x).last; (s) listp-twoin: ⊦ listp(rl + r ' + r0 ' + rl0, vs, ps, owns) → ps[r].next = r0; (forward) from specification DMSQ a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ weak?(Weak(tid)); (s) ⊦ unmarkedp([], vs); (s) ⊦ listp(r ', vs, ps, owns) ↔ owns(r) = None ∧ r ∈ vs ∧ r ∈ ps ∧ r ≠ null ∧ ¬ weak?(vs[r].deqID) ∧ (ps[r].deqID = vs[r].deqID ∨ ps[r].deqID = None) ∧ ps[r].val = vs[r].val ∧ ps[r].next = null ∧ ( vs[r].next ≠ null → vs[r].next ∈ vs ∧ vs[r].next ∈ ps ∧ ps[vs[r].next] = vs[vs[r].next] ∧ ps[vs[r].next].deqID = None ∧ ps[vs[r].next].next = null ∧ weak?(owns(vs[r].next))); (s) ⊦ ¬ dups([]); (s) ⊦ ¬ a ∈ []; (s) ⊦ a '.butlast = []; (s) ⊦ x + [] = x; (s) ⊦ a '.last = a; (s)
| dom vrvHp = dom prvHp, orl ≠ [], r ≠ null, DMSQLInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid), pcf(tid)), 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, r ∈ vs, r ∈ 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), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ listp ( (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ orl + qrl.head ';orl) + (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ qrl.tail;qrl), vs, ps[r, ps[r].deqID:= vs[r].deqID], owns) ∧ ¬ dups ( (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ orl + qrl.head ';orl) + (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ qrl.tail;qrl)) ∧ markedp((qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ orl + qrl.head ';orl), ps[r, ps[r].deqID:= vs[r].deqID]) ∧ markedp((qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ orl + qrl.head ';orl), vs) ∧ unmarkedp((qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ qrl.tail;qrl), ps[r, ps[r].deqID:= vs[r].deqID]) ∧ (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ orl + qrl.head ';orl) ≠ [] ∧ phead ∈ (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ orl + qrl.head ';orl) ∧ nonullRetRefs ( (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ orl + qrl.head ';orl) + (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ qrl.tail;qrl), vs, vretRefs, pretRefs) ∧ ( (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ orl + qrl.head ';orl).last = vhead ∧ ( (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ qrl.tail;qrl) ≠ [] → unmarkedp((qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ qrl.tail;qrl).tail, vs)) ∨ (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ orl + qrl.head ';orl).butlast ≠ [] ∧ (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ orl + qrl.head ';orl).butlast.last = vhead ∧ phead ≠ (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ orl + qrl.head ';orl).last ∧ unmarkedp((qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ qrl.tail;qrl), vs)) ∧ ( vtail = ( (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ orl + qrl.head ';orl) + (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ qrl.tail;qrl) ).last ∨ (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ qrl.tail;qrl) ≠ [] ∧ vtail = ( (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ orl + qrl.head ';orl) + (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ qrl.tail;qrl).butlast ).last ∧ vs[(qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ qrl.tail;qrl).last].deqID = None ∧ vs[(qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ qrl.tail;qrl).last].next = null), qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None |
dom vrvHp = dom prvHp, orl ≠ [], r ≠ null, DMSQLInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid), pcf(tid)), 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), r ∈ ps, r ∈ vs, 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 ⊦ qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None, listp(orl + qrl, vs, ps[r, ps[r].deqID:= vs[r].deqID], owns) ∧ markedp(orl, ps[r, ps[r].deqID:= vs[r].deqID]) ∧ unmarkedp(qrl, ps[r, ps[r].deqID:= vs[r].deqID])
| dom vrvHp = dom prvHp, orl ≠ [], r ≠ null, DMSQLInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid), pcf(tid)), 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), r ∈ ps, r ∈ vs, 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 ⊦ qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None, listp(orl + qrl, vs, ps[r, ps[r].deqID:= vs[r].deqID], owns) ∧ markedp(orl, ps[r, ps[r].deqID:= vs[r].deqID]) ∧ unmarkedp(qrl, ps[r, ps[r].deqID:= vs[r].deqID]) |
⊦ ¬ node ∈ rl ∧ rl ≠ [] ∧ node ≠ vs[rl.last].next → (listp(rl, vs, ps[node, nd], owns) ↔ listp(rl, vs, ps, owns))
dom vrvHp = dom prvHp, orl ≠ [], r ≠ null, DMSQLInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid), pcf(tid)), 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, r ∈ vs, r ∈ 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), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ listp(orl + qrl, vs, ps[r, ps[r].deqID:= vs[r].deqID], owns) ∧ markedp(orl, ps[r, ps[r].deqID:= vs[r].deqID]) ∧ unmarkedp(qrl, ps[r, ps[r].deqID:= vs[r].deqID]), qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None, ¬ r ∈ orl + qrl ∧ orl + qrl ≠ [] ∧ r ≠ vs[(orl + qrl).last].next
Used simplifier rules: ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ ¬ node ∈ rl → (markedp(rl, vs[node, nd]) ↔ markedp(rl, vs)); (s) ⊦ ¬ node ∈ rl → (unmarkedp(rl, vs[node, nd]) ↔ unmarkedp(rl, vs)); (s) Used terms: ps, orl + qrl, r, ps[r].deqID:= vs[r].deqID, owns, vs
| ⊦ ¬ node ∈ rl ∧ rl ≠ [] ∧ node ≠ vs[rl.last].next → (listp(rl, vs, ps[node, nd], owns) ↔ listp(rl, vs, ps, owns)) |
| dom vrvHp = dom prvHp, orl ≠ [], r ≠ null, DMSQLInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid), pcf(tid)), 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, r ∈ vs, r ∈ 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), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ listp(orl + qrl, vs, ps[r, ps[r].deqID:= vs[r].deqID], owns) ∧ markedp(orl, ps[r, ps[r].deqID:= vs[r].deqID]) ∧ unmarkedp(qrl, ps[r, ps[r].deqID:= vs[r].deqID]), qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None, ¬ r ∈ orl + qrl ∧ orl + qrl ≠ [] ∧ r ≠ vs[(orl + qrl).last].next |
dom vrvHp = dom prvHp, orl + qrl ≠ [], orl ≠ [], r ≠ null, DMSQLInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid), pcf(tid)), 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, r ∈ vs, r ∈ ps, ¬ dups(qrl), ¬ dups(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), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ listp(orl + qrl, vs, ps[r, ps[r].deqID:= vs[r].deqID], owns) ∧ markedp(orl, ps[r, ps[r].deqID:= vs[r].deqID]) ∧ unmarkedp(qrl, ps[r, ps[r].deqID:= vs[r].deqID]), qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None, r ≠ vs[(orl + qrl).last].next ∧ ¬ r ∈ qrl ∧ ¬ r ∈ orl
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ x + y = [] ↔ x = [] ∧ y = []; (as) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s)
| dom vrvHp = dom prvHp, orl + qrl ≠ [], orl ≠ [], r ≠ null, DMSQLInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid), pcf(tid)), 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, r ∈ vs, r ∈ ps, ¬ dups(qrl), ¬ dups(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), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ listp(orl + qrl, vs, ps[r, ps[r].deqID:= vs[r].deqID], owns) ∧ markedp(orl, ps[r, ps[r].deqID:= vs[r].deqID]) ∧ unmarkedp(qrl, ps[r, ps[r].deqID:= vs[r].deqID]), qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None, r ≠ vs[(orl + qrl).last].next ∧ ¬ r ∈ qrl ∧ ¬ r ∈ orl |
dom vrvHp = dom prvHp, orl + qrl ≠ [], ps[r, ps[r].deqID:= vs[r].deqID] ≠ ps, orl ≠ [], r ≠ null, DMSQLInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid), pcf(tid)), 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), r ∈ ps, r ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(qrl), ¬ dups(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[qrl.last].next = null ⊦ r ≠ vs[(orl + qrl).last].next ∧ ¬ r ∈ qrl ∧ ¬ r ∈ orl, qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None, listp(orl + qrl, vs, ps[r, ps[r].deqID:= vs[r].deqID], owns) ∧ markedp(orl, ps[r, ps[r].deqID:= vs[r].deqID]) ∧ unmarkedp(qrl, ps[r, ps[r].deqID:= vs[r].deqID])
Used formulas: ps[r, ps[r].deqID:= vs[r].deqID] = ps
| dom vrvHp = dom prvHp, orl + qrl ≠ [], ps[r, ps[r].deqID:= vs[r].deqID] ≠ ps, orl ≠ [], r ≠ null, DMSQLInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid), pcf(tid)), 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), r ∈ ps, r ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(qrl), ¬ dups(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[qrl.last].next = null ⊦ r ≠ vs[(orl + qrl).last].next ∧ ¬ r ∈ qrl ∧ ¬ r ∈ orl, qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None, listp(orl + qrl, vs, ps[r, ps[r].deqID:= vs[r].deqID], owns) ∧ markedp(orl, ps[r, ps[r].deqID:= vs[r].deqID]) ∧ unmarkedp(qrl, ps[r, ps[r].deqID:= vs[r].deqID]) |
⊦ st1 = st2 ↔ (∀ a. (a ∈ st1 ↔ a ∈ st2) ∧ st1[a] = st2[a])
dom vrvHp = dom prvHp, orl + qrl ≠ [], orl ≠ [], r ≠ null, DMSQLInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid), pcf(tid)), 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, r ∈ vs, r ∈ ps, ¬ dups(qrl), ¬ dups(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), ∃ r0. ¬((r0 ∈ ps[r, ps[r].deqID:= vs[r].deqID] ↔ r0 ∈ ps) ∧ ps[r, ps[r].deqID:= vs[r].deqID][r0] = ps[r0]), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ listp(orl + qrl, vs, ps[r, ps[r].deqID:= vs[r].deqID], owns) ∧ markedp(orl, ps[r, ps[r].deqID:= vs[r].deqID]) ∧ unmarkedp(qrl, ps[r, ps[r].deqID:= vs[r].deqID]), qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None, r ≠ vs[(orl + qrl).last].next ∧ ¬ r ∈ qrl ∧ ¬ r ∈ orl
Used terms: ps[r, ps[r].deqID:= vs[r].deqID], ps
| ⊦ st1 = st2 ↔ (∀ a. (a ∈ st1 ↔ a ∈ st2) ∧ st1[a] = st2[a]) |
| dom vrvHp = dom prvHp, orl + qrl ≠ [], orl ≠ [], r ≠ null, DMSQLInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid), pcf(tid)), 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, r ∈ vs, r ∈ ps, ¬ dups(qrl), ¬ dups(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), ∃ r0. ¬((r0 ∈ ps[r, ps[r].deqID:= vs[r].deqID] ↔ r0 ∈ ps) ∧ ps[r, ps[r].deqID:= vs[r].deqID][r0] = ps[r0]), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ listp(orl + qrl, vs, ps[r, ps[r].deqID:= vs[r].deqID], owns) ∧ markedp(orl, ps[r, ps[r].deqID:= vs[r].deqID]) ∧ unmarkedp(qrl, ps[r, ps[r].deqID:= vs[r].deqID]), qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None, r ≠ vs[(orl + qrl).last].next ∧ ¬ r ∈ qrl ∧ ¬ r ∈ orl |
dom vrvHp = dom prvHp, orl + qrl ≠ [], orl ≠ [], r ≠ null, DMSQLInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid), pcf(tid)), 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), r ∈ ps, r ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(qrl), ¬ dups(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[qrl.last].next = null ⊦ r ≠ vs[(orl + qrl).last].next ∧ ¬ r ∈ qrl ∧ ¬ r ∈ orl, qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None, listp(orl + qrl, vs, ps[r, ps[r].deqID:= vs[r].deqID], owns) ∧ markedp(orl, ps[r, ps[r].deqID:= vs[r].deqID]) ∧ unmarkedp(qrl, ps[r, ps[r].deqID:= vs[r].deqID]), (r0 ∈ ps → r0 ∈ ps[r, ps[r].deqID:= vs[r].deqID]) ∧ ps[r, ps[r].deqID:= vs[r].deqID][r0] = ps[r0]
Used simplifier rules: ⊦ a ∈ st[b, d] ↔ a = b ∨ a ∈ st; (ws)
| dom vrvHp = dom prvHp, orl + qrl ≠ [], orl ≠ [], r ≠ null, DMSQLInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid), pcf(tid)), 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), r ∈ ps, r ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(qrl), ¬ dups(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[qrl.last].next = null ⊦ r ≠ vs[(orl + qrl).last].next ∧ ¬ r ∈ qrl ∧ ¬ r ∈ orl, qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None, listp(orl + qrl, vs, ps[r, ps[r].deqID:= vs[r].deqID], owns) ∧ markedp(orl, ps[r, ps[r].deqID:= vs[r].deqID]) ∧ unmarkedp(qrl, ps[r, ps[r].deqID:= vs[r].deqID]), (r0 ∈ ps → r0 ∈ ps[r, ps[r].deqID:= vs[r].deqID]) ∧ ps[r, ps[r].deqID:= vs[r].deqID][r0] = ps[r0] |
⊦ a ≠ b → st[b, d][a] = st[a]
dom vrvHp = dom prvHp, r0 = r, orl + qrl ≠ [], orl ≠ [], r ≠ null, DMSQLInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid), pcf(tid)), 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, r ∈ vs, r ∈ ps, ¬ dups(qrl), ¬ dups(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), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ (r0 ∈ ps → r0 ∈ ps[r, ps[r].deqID:= vs[r].deqID]) ∧ ps[r, ps[r].deqID:= vs[r].deqID][r0] = ps[r0], listp(orl + qrl, vs, ps[r, ps[r].deqID:= vs[r].deqID], owns) ∧ markedp(orl, ps[r, ps[r].deqID:= vs[r].deqID]) ∧ unmarkedp(qrl, ps[r, ps[r].deqID:= vs[r].deqID]), qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None, r ≠ vs[(orl + qrl).last].next ∧ ¬ r ∈ qrl ∧ ¬ r ∈ orl
Used simplifier rules: ⊦ a ≠ b → (a ∈ st[b, d] ↔ a ∈ st); (s) Used terms: ps, r, ps[r].deqID:= vs[r].deqID, r0
| ⊦ a ≠ b → st[b, d][a] = st[a] |
| dom vrvHp = dom prvHp, r0 = r, orl + qrl ≠ [], orl ≠ [], r ≠ null, DMSQLInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid), pcf(tid)), 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, r ∈ vs, r ∈ ps, ¬ dups(qrl), ¬ dups(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), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ (r0 ∈ ps → r0 ∈ ps[r, ps[r].deqID:= vs[r].deqID]) ∧ ps[r, ps[r].deqID:= vs[r].deqID][r0] = ps[r0], listp(orl + qrl, vs, ps[r, ps[r].deqID:= vs[r].deqID], owns) ∧ markedp(orl, ps[r, ps[r].deqID:= vs[r].deqID]) ∧ unmarkedp(qrl, ps[r, ps[r].deqID:= vs[r].deqID]), qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None, r ≠ vs[(orl + qrl).last].next ∧ ¬ r ∈ qrl ∧ ¬ r ∈ orl |
dom vrvHp = dom prvHp, orl + qrl ≠ [], ps[r].deqID:= vs[r].deqID ≠ ps[r], orl ≠ [], r ≠ null, DMSQLInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid), pcf(tid)), 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), r ∈ ps, r ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(qrl), ¬ dups(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[qrl.last].next = null ⊦ r ≠ vs[(orl + qrl).last].next ∧ ¬ r ∈ qrl ∧ ¬ r ∈ orl, qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None, listp(orl + qrl, vs, ps[r, ps[r].deqID:= vs[r].deqID], owns) ∧ markedp(orl, ps[r, ps[r].deqID:= vs[r].deqID]) ∧ unmarkedp(qrl, ps[r, ps[r].deqID:= vs[r].deqID])
Used simplifier rules: ⊦ a = b → st[b, d][a] = d; (s) ⊦ a ∈ st[a, d]; (s)
| dom vrvHp = dom prvHp, orl + qrl ≠ [], ps[r].deqID:= vs[r].deqID ≠ ps[r], orl ≠ [], r ≠ null, DMSQLInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid), pcf(tid)), 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), r ∈ ps, r ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(qrl), ¬ dups(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[qrl.last].next = null ⊦ r ≠ vs[(orl + qrl).last].next ∧ ¬ r ∈ qrl ∧ ¬ r ∈ orl, qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None, listp(orl + qrl, vs, ps[r, ps[r].deqID:= vs[r].deqID], owns) ∧ markedp(orl, ps[r, ps[r].deqID:= vs[r].deqID]) ∧ unmarkedp(qrl, ps[r, ps[r].deqID:= vs[r].deqID]) |
dom vrvHp = dom prvHp, mk(val, opttid, nxt) = ps[r], opttid0 = vs[r].deqID, orl + qrl ≠ [], mk(val, opttid0, nxt) ≠ ps[r], orl ≠ [], r ≠ null, DMSQLInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid), pcf(tid)), 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, r ∈ vs, r ∈ ps, ¬ dups(qrl), ¬ dups(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), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ listp(orl + qrl, vs, ps[r, mk(val, opttid0, nxt)], owns) ∧ markedp(orl, ps[r, mk(val, opttid0, nxt)]) ∧ unmarkedp(qrl, ps[r, mk(val, opttid0, nxt)]), qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None, r ≠ vs[(orl + qrl).last].next ∧ ¬ r ∈ qrl ∧ ¬ r ∈ orl
| dom vrvHp = dom prvHp, mk(val, opttid, nxt) = ps[r], opttid0 = vs[r].deqID, orl + qrl ≠ [], mk(val, opttid0, nxt) ≠ ps[r], orl ≠ [], r ≠ null, DMSQLInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid), pcf(tid)), 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, r ∈ vs, r ∈ ps, ¬ dups(qrl), ¬ dups(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), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ listp(orl + qrl, vs, ps[r, mk(val, opttid0, nxt)], owns) ∧ markedp(orl, ps[r, mk(val, opttid0, nxt)]) ∧ unmarkedp(qrl, ps[r, mk(val, opttid0, nxt)]), qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None, r ≠ vs[(orl + qrl).last].next ∧ ¬ r ∈ qrl ∧ ¬ r ∈ orl |
dom vrvHp = dom prvHp, mk(val, opttid, nxt) = ps[r], orl + qrl ≠ [], vs[r].deqID ≠ opttid, orl ≠ [], r ≠ null, DMSQLInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid), pcf(tid)), 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, r ∈ vs, r ∈ 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), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ listp(orl + qrl, vs, ps[r, mk(val, vs[r].deqID, nxt)], owns) ∧ (r ∈ orl → some?(vs[r].deqID)) ∧ unmarkedp(qrl, ps[r, mk(val, vs[r].deqID, nxt)]), qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None, r ≠ vs[(orl + qrl).last].next ∧ ¬ r ∈ qrl ∧ ¬ r ∈ orl
Used simplifier rules: ⊦ mk(val, opttid, nxt) = mk(val0, opttid0, nxt0) ↔ val = val0 ∧ opttid = opttid0 ∧ nxt = nxt0; (ws) ⊦ markedp(rl, vs) → (markedp(rl, vs[r, mk(val, opttid, nxt)]) ↔ r ∈ rl → some?(opttid)); (s)
| dom vrvHp = dom prvHp, mk(val, opttid, nxt) = ps[r], orl + qrl ≠ [], vs[r].deqID ≠ opttid, orl ≠ [], r ≠ null, DMSQLInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid), pcf(tid)), 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, r ∈ vs, r ∈ 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), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ listp(orl + qrl, vs, ps[r, mk(val, vs[r].deqID, nxt)], owns) ∧ (r ∈ orl → some?(vs[r].deqID)) ∧ unmarkedp(qrl, ps[r, mk(val, vs[r].deqID, nxt)]), qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None, r ≠ vs[(orl + qrl).last].next ∧ ¬ r ∈ qrl ∧ ¬ r ∈ orl |
dom vrvHp = dom prvHp, mk(val, opttid, nxt) = ps[r], orl + qrl ≠ [], vs[r].deqID ≠ opttid, orl ≠ [], r ≠ null, DMSQLInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid), pcf(tid)), 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), r ∈ ps, r ∈ vs, 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 ⊦ r ≠ vs[(orl + qrl).last].next ∧ ¬ r ∈ qrl ∧ ¬ r ∈ orl, qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None, listp(orl + qrl, vs, ps[r, mk(val, vs[r].deqID, nxt)], owns) ∧ (r ∈ orl → some?(vs[r].deqID)) ∧ unmarkedp(qrl, ps[r, mk(val, vs[r].deqID, nxt)]), ¬ r ∈ qrl ∧ ¬ r ∈ orl
Used simplifier rules: ⊦ ¬ node ∈ rl → (unmarkedp(rl, vs[node, nd]) ↔ unmarkedp(rl, vs)); (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] listp-nextoflast: ⊦ listp(rl, vs, ps, owns) ∧ vs[rl.last].next ≠ null → vs[rl.last].next ∈ vs ∧ vs[rl.last].next ∈ ps ∧ ps[vs[rl.last].next] = vs[vs[rl.last].next] ∧ ps[vs[rl.last].next].deqID = None ∧ ps[vs[rl.last].next].next = null ∧ weak?(owns(vs[rl.last].next)); (forward) from specification DMSQ ⊦ mk(val, opttid, nxt).deqID = opttid; (s) Used formulas: ¬ r ∈ qrl ∧ ¬ r ∈ orl
| dom vrvHp = dom prvHp, mk(val, opttid, nxt) = ps[r], orl + qrl ≠ [], vs[r].deqID ≠ opttid, orl ≠ [], r ≠ null, DMSQLInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid), pcf(tid)), 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), r ∈ ps, r ∈ vs, 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 ⊦ r ≠ vs[(orl + qrl).last].next ∧ ¬ r ∈ qrl ∧ ¬ r ∈ orl, qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None, listp(orl + qrl, vs, ps[r, mk(val, vs[r].deqID, nxt)], owns) ∧ (r ∈ orl → some?(vs[r].deqID)) ∧ unmarkedp(qrl, ps[r, mk(val, vs[r].deqID, nxt)]), ¬ r ∈ qrl ∧ ¬ r ∈ orl |
dom vrvHp = dom prvHp, mk(val, opttid, nxt) = ps[r], orl + qrl ≠ [], vs[r].deqID ≠ opttid, orl ≠ [], r ≠ null, DMSQLInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid), pcf(tid)), 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, r ∈ vs, r ∈ ps, r ∈ 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), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ ¬ r ∈ qrl ∧ ¬ r ∈ orl, listp(orl + qrl, vs, ps[r, mk(val, vs[r].deqID, nxt)], owns) ∧ (r ∈ orl → some?(vs[r].deqID)) ∧ unmarkedp(qrl, ps[r, mk(val, vs[r].deqID, nxt)]), qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None, r ≠ vs[(orl + qrl).last].next ∧ ¬ r ∈ qrl ∧ ¬ r ∈ orl
dom vrvHp = dom prvHp, mk(val, opttid, nxt) = ps[r], orl + qrl ≠ [], vs[r].deqID ≠ opttid, orl ≠ [], r ≠ null, DMSQLInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid), pcf(tid)), 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, r ∈ vs, r ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ r ∈ 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), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ ¬ r ∈ qrl ∧ ¬ r ∈ orl, listp(orl + qrl, vs, ps[r, mk(val, vs[r].deqID, nxt)], owns) ∧ (r ∈ orl → some?(vs[r].deqID)) ∧ unmarkedp(qrl, ps[r, mk(val, vs[r].deqID, nxt)]), qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None, r ≠ vs[(orl + qrl).last].next ∧ ¬ r ∈ qrl ∧ ¬ r ∈ orl
Used formulas: r ∈ orl
| dom vrvHp = dom prvHp, mk(val, opttid, nxt) = ps[r], orl + qrl ≠ [], vs[r].deqID ≠ opttid, orl ≠ [], r ≠ null, DMSQLInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid), pcf(tid)), 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, r ∈ vs, r ∈ ps, r ∈ 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), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ ¬ r ∈ qrl ∧ ¬ r ∈ orl, listp(orl + qrl, vs, ps[r, mk(val, vs[r].deqID, nxt)], owns) ∧ (r ∈ orl → some?(vs[r].deqID)) ∧ unmarkedp(qrl, ps[r, mk(val, vs[r].deqID, nxt)]), qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None, r ≠ vs[(orl + qrl).last].next ∧ ¬ r ∈ qrl ∧ ¬ r ∈ orl |
dom vrvHp = dom prvHp, mk(val, opttid, nxt) = ps[r], orl + qrl ≠ [], vs[r].deqID ≠ opttid, opttid ≠ None, orl ≠ [], r ≠ null, DMSQLInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid), pcf(tid)), 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), r ∈ orl, phead ∈ orl, phead ∈ vs, phead ∈ ps, r ∈ vs, r ∈ 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 ⊦ qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None, listp(orl + qrl, vs, ps[r, mk(val, vs[r].deqID, nxt)], owns) ∧ some?(vs[r].deqID) ∧ unmarkedp(qrl, ps[r, mk(val, vs[r].deqID, nxt)])
Used simplifier rules: marked-elem-f: ⊦ markedp(rl, vs) ∧ r ∈ rl ∧ vs[r] = mk(val, opttid, nxt) → opttid ≠ None; (forward) from specification DMSQ a: ⊦ (x + y) + z = x + y + z; from specification list[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
| dom vrvHp = dom prvHp, mk(val, opttid, nxt) = ps[r], orl + qrl ≠ [], vs[r].deqID ≠ opttid, opttid ≠ None, orl ≠ [], r ≠ null, DMSQLInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid), pcf(tid)), 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), r ∈ orl, phead ∈ orl, phead ∈ vs, phead ∈ ps, r ∈ vs, r ∈ 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 ⊦ qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None, listp(orl + qrl, vs, ps[r, mk(val, vs[r].deqID, nxt)], owns) ∧ some?(vs[r].deqID) ∧ unmarkedp(qrl, ps[r, mk(val, vs[r].deqID, nxt)]) |
⊦ listp(rl + rl0, vs, ps, owns) ∧ r ∈ rl → (∃ rl1, rl2. rl = rl1 + r ' + rl2 ∧ listp(r ' + rl2 + rl0, vs, ps, owns))
dom vrvHp = dom prvHp, mk(val, opttid, nxt) = ps[r], orl + qrl ≠ [], vs[r].deqID ≠ opttid, opttid ≠ None, orl ≠ [], r ≠ null, DMSQLInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid), pcf(tid)), 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), r ∈ ps, r ∈ vs, phead ∈ ps, phead ∈ vs, phead ∈ orl, r ∈ 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), listp(orl + qrl, vs, ps, owns) ∧ r ∈ orl → (∃ rl1, rl2. orl = rl1 + r ' + rl2 ∧ listp(r ' + rl2 + qrl, vs, ps, owns)), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ listp(orl + qrl, vs, ps[r, mk(val, vs[r].deqID, nxt)], owns) ∧ some?(vs[r].deqID) ∧ unmarkedp(qrl, ps[r, mk(val, vs[r].deqID, nxt)]), qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None
Used terms: ps, orl, owns, r, qrl, vs
| ⊦ listp(rl + rl0, vs, ps, owns) ∧ r ∈ rl → (∃ rl1, rl2. rl = rl1 + r ' + rl2 ∧ listp(r ' + rl2 + rl0, vs, ps, owns)) |
| dom vrvHp = dom prvHp, mk(val, opttid, nxt) = ps[r], orl + qrl ≠ [], vs[r].deqID ≠ opttid, opttid ≠ None, orl ≠ [], r ≠ null, DMSQLInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid), pcf(tid)), 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), r ∈ ps, r ∈ vs, phead ∈ ps, phead ∈ vs, phead ∈ orl, r ∈ 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), listp(orl + qrl, vs, ps, owns) ∧ r ∈ orl → (∃ rl1, rl2. orl = rl1 + r ' + rl2 ∧ listp(r ' + rl2 + qrl, vs, ps, owns)), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ listp(orl + qrl, vs, ps[r, mk(val, vs[r].deqID, nxt)], owns) ∧ some?(vs[r].deqID) ∧ unmarkedp(qrl, ps[r, mk(val, vs[r].deqID, nxt)]), qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None |
dom vrvHp = dom prvHp, mk(val, opttid, nxt) = ps[r], vs[r].deqID ≠ opttid, opttid ≠ None, r ≠ null, DMSQLInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, rl1 + r ' + rl2, owns, rvowns), lsf(tid), pcf(tid)), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((rl1 + r ' + rl2) + qrl, vs, ps, owns), listp(r ' + rl2 + qrl, vs, ps, owns), markedp(rl1, ps), markedp(rl2, vs), markedp(rl1, vs), markedp(rl2, ps), nonullRetRefs((rl1 + r ' + rl2) + qrl, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[r].deqID), some?(opttid), unmarkedp(qrl, ps), phead ∈ vs, phead ∈ ps, r ∈ vs, r ∈ ps, ¬ dups(rl1 + rl2), ¬ dups(rl2 + qrl), ¬ dups(rl1), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl2), ¬ dups(qrl), ¬ listp((rl1 + r ' + rl2) + qrl, vs, ps[r, mk(val, vs[r].deqID, nxt)], owns), ¬ r ∈ qrl, ¬ r ∈ rl2, ¬ r ∈ rl1, 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), (r ' + rl2).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ rl1 + (r ' + rl2).butlast ≠ [] ∧ (rl1 + (r ' + rl2).butlast).last = vhead ∧ phead ≠ (r ' + rl2).last ∧ unmarkedp(qrl, vs), vtail = (r ' + rl2 + qrl).last ∨ qrl ≠ [] ∧ vtail = (r ' + rl2 + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead ∈ rl1 ∨ phead = r ∨ phead ∈ rl2 ⊦ qrl ≠ [] ∧ r = qrl.head
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] ⊦ mk(val, opttid, nxt).deqID = opttid; (s) ⊦ some?(opttid) → opttid ≠ None; (as) ⊦ ¬ node ∈ rl → (unmarkedp(rl, vs[node, nd]) ↔ unmarkedp(rl, vs)); (s) ⊦ (x + a ' + y).last = (a ' + y).last; (s) ⊦ (x + a ' + y).butlast = x + (a ' + y).butlast; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s) ⊦ x + a ' + y ≠ []; (s) ⊦ x = y + a ' + z → a ∈ x; (s)
| dom vrvHp = dom prvHp, mk(val, opttid, nxt) = ps[r], vs[r].deqID ≠ opttid, opttid ≠ None, r ≠ null, DMSQLInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, rl1 + r ' + rl2, owns, rvowns), lsf(tid), pcf(tid)), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((rl1 + r ' + rl2) + qrl, vs, ps, owns), listp(r ' + rl2 + qrl, vs, ps, owns), markedp(rl1, ps), markedp(rl2, vs), markedp(rl1, vs), markedp(rl2, ps), nonullRetRefs((rl1 + r ' + rl2) + qrl, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[r].deqID), some?(opttid), unmarkedp(qrl, ps), phead ∈ vs, phead ∈ ps, r ∈ vs, r ∈ ps, ¬ dups(rl1 + rl2), ¬ dups(rl2 + qrl), ¬ dups(rl1), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl2), ¬ dups(qrl), ¬ listp((rl1 + r ' + rl2) + qrl, vs, ps[r, mk(val, vs[r].deqID, nxt)], owns), ¬ r ∈ qrl, ¬ r ∈ rl2, ¬ r ∈ rl1, 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), (r ' + rl2).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ rl1 + (r ' + rl2).butlast ≠ [] ∧ (rl1 + (r ' + rl2).butlast).last = vhead ∧ phead ≠ (r ' + rl2).last ∧ unmarkedp(qrl, vs), vtail = (r ' + rl2 + qrl).last ∨ qrl ≠ [] ∧ vtail = (r ' + rl2 + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead ∈ rl1 ∨ phead = r ∨ phead ∈ rl2 ⊦ qrl ≠ [] ∧ r = qrl.head |
dom vrvHp = dom prvHp, mk(val, opttid, nxt) = ps[r], rl2 = [], vs[r].deqID ≠ opttid, opttid ≠ None, r ≠ null, DMSQLInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, rl1 + r ' + rl2, owns, rvowns), lsf(tid), pcf(tid)), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(r ' + rl2 + qrl, vs, ps, owns), listp((rl1 + r ' + rl2) + qrl, vs, ps, owns), markedp(rl2, ps), markedp(rl1, vs), markedp(rl2, vs), markedp(rl1, ps), nonullRetRefs((rl1 + r ' + rl2) + qrl, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(opttid), some?(vs[r].deqID), unmarkedp(qrl, ps), r ∈ ps, r ∈ vs, phead ∈ ps, phead ∈ vs, ¬ dups(rl1 + rl2), ¬ dups(rl2 + qrl), ¬ dups(rl1), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl2), ¬ dups(qrl), ¬ listp((rl1 + r ' + rl2) + qrl, vs, ps[r, mk(val, vs[r].deqID, nxt)], owns), ¬ r ∈ qrl, ¬ r ∈ rl2, ¬ r ∈ rl1, 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), phead ∈ rl1 ∨ phead = r ∨ phead ∈ rl2, vtail = (r ' + rl2 + qrl).last ∨ qrl ≠ [] ∧ vtail = (r ' + rl2 + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, (r ' + rl2).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ rl1 + (r ' + rl2).butlast ≠ [] ∧ (rl1 + (r ' + rl2).butlast).last = vhead ∧ phead ≠ (r ' + rl2).last ∧ unmarkedp(qrl, vs) ⊦ qrl ≠ [] ∧ r = qrl.head
Used simplifier rules: reflist freely generated by [], +;; ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ listp(r ' + r0 ' + rl, vs, ps, owns) ↔ owns(r) = None ∧ r ∈ vs ∧ r ∈ ps ∧ r ≠ null ∧ ¬ weak?(vs[r].deqID) ∧ (ps[r].deqID = vs[r].deqID ∨ ps[r].deqID = None) ∧ ps[r].val = vs[r].val ∧ ps[r].next = vs[r].next ∧ ps[r].next = r0 ∧ listp(r0 ' + rl, vs, ps, owns); (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) ⊦ x + a ' + y ≠ []; (s) ⊦ (a ' + b ' + x).butlast = a ' + (b ' + x).butlast; (s) ⊦ (x + a ' + y).last = (a ' + y).last; (s) ⊦ (b ' + a ' + x).last = (a ' + x).last; (s) ⊦ a + x = a ' + x; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) listp-twoin: ⊦ listp(rl + r ' + r0 ' + rl0, vs, ps, owns) → ps[r].next = r0; (forward) from specification DMSQ a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ mk(val, opttid, nxt).next = nxt; (s) ⊦ mk(val, opttid, nxt).val = val; (s) ⊦ mk(val, opttid, nxt).deqID = opttid; (s) ⊦ some?(opttid) → opttid ≠ None; (as)
| dom vrvHp = dom prvHp, mk(val, opttid, nxt) = ps[r], rl2 = [], vs[r].deqID ≠ opttid, opttid ≠ None, r ≠ null, DMSQLInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, rl1 + r ' + rl2, owns, rvowns), lsf(tid), pcf(tid)), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(r ' + rl2 + qrl, vs, ps, owns), listp((rl1 + r ' + rl2) + qrl, vs, ps, owns), markedp(rl2, ps), markedp(rl1, vs), markedp(rl2, vs), markedp(rl1, ps), nonullRetRefs((rl1 + r ' + rl2) + qrl, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(opttid), some?(vs[r].deqID), unmarkedp(qrl, ps), r ∈ ps, r ∈ vs, phead ∈ ps, phead ∈ vs, ¬ dups(rl1 + rl2), ¬ dups(rl2 + qrl), ¬ dups(rl1), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl2), ¬ dups(qrl), ¬ listp((rl1 + r ' + rl2) + qrl, vs, ps[r, mk(val, vs[r].deqID, nxt)], owns), ¬ r ∈ qrl, ¬ r ∈ rl2, ¬ r ∈ rl1, 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), phead ∈ rl1 ∨ phead = r ∨ phead ∈ rl2, vtail = (r ' + rl2 + qrl).last ∨ qrl ≠ [] ∧ vtail = (r ' + rl2 + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, (r ' + rl2).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ rl1 + (r ' + rl2).butlast ≠ [] ∧ (rl1 + (r ' + rl2).butlast).last = vhead ∧ phead ≠ (r ' + rl2).last ∧ unmarkedp(qrl, vs) ⊦ qrl ≠ [] ∧ r = qrl.head |
dom vrvHp = dom prvHp, mk(val, opttid, nxt) = ps[r], vs[r].deqID ≠ opttid, opttid ≠ None, r ≠ null, DMSQLInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, rl1 + r ', owns, rvowns), lsf(tid), pcf(tid)), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(rl1 + r ' + qrl, vs, ps, owns), listp(r ' + qrl, vs, ps, owns), markedp(rl1, ps), markedp(rl1, vs), nonullRetRefs(rl1 + r ' + qrl, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[r].deqID), some?(opttid), unmarkedp(qrl, ps), phead ∈ vs, phead ∈ ps, r ∈ vs, r ∈ ps, ¬ dups(rl1 + qrl), ¬ dups(rl1), ¬ dups(qrl), ¬ listp(rl1 + r ' + qrl, vs, ps[r, mk(val, vs[r].deqID, nxt)], owns), ¬ r ∈ qrl, ¬ r ∈ rl1, 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), r = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ rl1 ≠ [] ∧ rl1.last = vhead ∧ phead ≠ r ∧ unmarkedp(qrl, vs), vtail = (r ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (r ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead ∈ rl1 ∨ phead = r ⊦ qrl ≠ [] ∧ r = qrl.head
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 ∈ []; (s) ⊦ [] + x = x; (s) ⊦ a '.last = a; (s) ⊦ x + [] = x; (s) ⊦ a '.butlast = []; (s) ⊦ ¬ dups([]); (s) ⊦ markedp([], vs); (s)
| dom vrvHp = dom prvHp, mk(val, opttid, nxt) = ps[r], vs[r].deqID ≠ opttid, opttid ≠ None, r ≠ null, DMSQLInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, rl1 + r ', owns, rvowns), lsf(tid), pcf(tid)), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(rl1 + r ' + qrl, vs, ps, owns), listp(r ' + qrl, vs, ps, owns), markedp(rl1, ps), markedp(rl1, vs), nonullRetRefs(rl1 + r ' + qrl, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[r].deqID), some?(opttid), unmarkedp(qrl, ps), phead ∈ vs, phead ∈ ps, r ∈ vs, r ∈ ps, ¬ dups(rl1 + qrl), ¬ dups(rl1), ¬ dups(qrl), ¬ listp(rl1 + r ' + qrl, vs, ps[r, mk(val, vs[r].deqID, nxt)], owns), ¬ r ∈ qrl, ¬ r ∈ rl1, 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), r = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ rl1 ≠ [] ∧ rl1.last = vhead ∧ phead ≠ r ∧ unmarkedp(qrl, vs), vtail = (r ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (r ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead ∈ rl1 ∨ phead = r ⊦ qrl ≠ [] ∧ r = qrl.head |
dom vrvHp = dom prvHp, mk(val, opttid, nxt) = ps[r], r = vhead, vs[r].deqID ≠ opttid, opttid ≠ None, r ≠ null, DMSQLInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, rl1 + r ', owns, rvowns), lsf(tid), pcf(tid)), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(r ' + qrl, vs, ps, owns), listp(rl1 + r ' + qrl, vs, ps, owns), markedp(rl1, vs), markedp(rl1, ps), nonullRetRefs(rl1 + r ' + qrl, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(opttid), some?(vs[r].deqID), unmarkedp(qrl, ps), r ∈ ps, r ∈ vs, phead ∈ ps, phead ∈ vs, ¬ dups(rl1 + qrl), ¬ dups(rl1), ¬ dups(qrl), ¬ listp(rl1 + r ' + qrl, vs, ps[r, mk(val, vs[r].deqID, nxt)], owns), ¬ r ∈ qrl, ¬ r ∈ rl1, 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), phead ∈ rl1 ∨ phead = r, vtail = (r ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (r ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ qrl ≠ [] ∧ r = qrl.head
rl1.last = vhead, dom vrvHp = dom prvHp, mk(val, opttid, nxt) = ps[r], vs[r].deqID ≠ opttid, opttid ≠ None, phead ≠ r, r ≠ null, rl1 ≠ [], DMSQLInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, rl1 + r ', owns, rvowns), lsf(tid), pcf(tid)), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(r ' + qrl, vs, ps, owns), listp(rl1 + r ' + qrl, vs, ps, owns), markedp(rl1, vs), markedp(rl1, ps), nonullRetRefs(rl1 + r ' + qrl, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(opttid), some?(vs[r].deqID), unmarkedp(qrl, ps), unmarkedp(qrl, vs), r ∈ ps, r ∈ vs, phead ∈ ps, phead ∈ vs, ¬ dups(rl1 + qrl), ¬ dups(rl1), ¬ dups(qrl), ¬ listp(rl1 + r ' + qrl, vs, ps[r, mk(val, vs[r].deqID, nxt)], owns), ¬ r ∈ qrl, ¬ r ∈ rl1, 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), phead ∈ rl1 ∨ phead = r, vtail = (r ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (r ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ qrl ≠ [] ∧ r = qrl.head
| dom vrvHp = dom prvHp, mk(val, opttid, nxt) = ps[r], r = vhead, vs[r].deqID ≠ opttid, opttid ≠ None, r ≠ null, DMSQLInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, rl1 + r ', owns, rvowns), lsf(tid), pcf(tid)), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(r ' + qrl, vs, ps, owns), listp(rl1 + r ' + qrl, vs, ps, owns), markedp(rl1, vs), markedp(rl1, ps), nonullRetRefs(rl1 + r ' + qrl, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(opttid), some?(vs[r].deqID), unmarkedp(qrl, ps), r ∈ ps, r ∈ vs, phead ∈ ps, phead ∈ vs, ¬ dups(rl1 + qrl), ¬ dups(rl1), ¬ dups(qrl), ¬ listp(rl1 + r ' + qrl, vs, ps[r, mk(val, vs[r].deqID, nxt)], owns), ¬ r ∈ qrl, ¬ r ∈ rl1, 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), phead ∈ rl1 ∨ phead = r, vtail = (r ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (r ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ qrl ≠ [] ∧ r = qrl.head |
dom vrvHp = dom prvHp, mk(val, opttid, nxt) = ps[vhead], vs[vhead].deqID ≠ opttid, opttid ≠ None, vhead ≠ null, DMSQLInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, rl1 + vhead ', owns, rvowns), lsf(tid), pcf(tid)), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(rl1 + vhead ' + qrl, vs, ps, owns), listp(vhead ' + qrl, vs, ps, owns), markedp(rl1, ps), markedp(rl1, vs), nonullRetRefs(rl1 + vhead ' + qrl, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vhead].deqID), some?(opttid), unmarkedp(qrl, ps), phead ∈ vs, phead ∈ ps, vhead ∈ vs, vhead ∈ ps, ¬ dups(rl1 + qrl), ¬ dups(rl1), ¬ dups(qrl), ¬ listp(rl1 + vhead ' + qrl, vs, ps[vhead, mk(val, vs[vhead].deqID, nxt)], owns), ¬ vhead ∈ qrl, ¬ vhead ∈ rl1, qrl ≠ [] → unmarkedp(qrl.tail, vs), 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), vtail = (vhead ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vhead ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead ∈ rl1 ∨ phead = vhead ⊦ qrl ≠ [] ∧ vhead = qrl.head
| dom vrvHp = dom prvHp, mk(val, opttid, nxt) = ps[vhead], vs[vhead].deqID ≠ opttid, opttid ≠ None, vhead ≠ null, DMSQLInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, rl1 + vhead ', owns, rvowns), lsf(tid), pcf(tid)), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(rl1 + vhead ' + qrl, vs, ps, owns), listp(vhead ' + qrl, vs, ps, owns), markedp(rl1, ps), markedp(rl1, vs), nonullRetRefs(rl1 + vhead ' + qrl, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vhead].deqID), some?(opttid), unmarkedp(qrl, ps), phead ∈ vs, phead ∈ ps, vhead ∈ vs, vhead ∈ ps, ¬ dups(rl1 + qrl), ¬ dups(rl1), ¬ dups(qrl), ¬ listp(rl1 + vhead ' + qrl, vs, ps[vhead, mk(val, vs[vhead].deqID, nxt)], owns), ¬ vhead ∈ qrl, ¬ vhead ∈ rl1, qrl ≠ [] → unmarkedp(qrl.tail, vs), 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), vtail = (vhead ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vhead ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead ∈ rl1 ∨ phead = vhead ⊦ qrl ≠ [] ∧ vhead = qrl.head |
Used simplifier rules: reflist freely generated by [], +;; ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) ⊦ listp(r ' + r0 ' + rl, vs, ps, owns) ↔ owns(r) = None ∧ r ∈ vs ∧ r ∈ ps ∧ r ≠ null ∧ ¬ weak?(vs[r].deqID) ∧ (ps[r].deqID = vs[r].deqID ∨ ps[r].deqID = None) ∧ ps[r].val = vs[r].val ∧ ps[r].next = vs[r].next ∧ ps[r].next = r0 ∧ listp(r0 ' + rl, vs, ps, owns); (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) ⊦ (b ' + a ' + x).last = (a ' + x).last; (s) ⊦ (a ' + x).tail = x; (s) ⊦ a ' + x ≠ []; (s) ⊦ a + x = a ' + x; (s) ⊦ (a ' + x).head = a; (s) listp-twoin: ⊦ listp(rl + r ' + r0 ' + rl0, vs, ps, owns) → ps[r].next = r0; (forward) from specification DMSQ a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ mk(val, opttid, nxt).next = nxt; (s) ⊦ mk(val, opttid, nxt).val = val; (s) ⊦ mk(val, opttid, nxt).deqID = opttid; (s) ⊦ some?(opttid) → opttid ≠ None; (as) ⊦ unmarkedp([], vs); (s) ⊦ listp(r ', vs, ps, owns) ↔ owns(r) = None ∧ r ∈ vs ∧ r ∈ ps ∧ r ≠ null ∧ ¬ weak?(vs[r].deqID) ∧ (ps[r].deqID = vs[r].deqID ∨ ps[r].deqID = None) ∧ ps[r].val = vs[r].val ∧ ps[r].next = null ∧ ( vs[r].next ≠ null → vs[r].next ∈ vs ∧ vs[r].next ∈ ps ∧ ps[vs[r].next] = vs[vs[r].next] ∧ ps[vs[r].next].deqID = None ∧ ps[vs[r].next].next = null ∧ weak?(owns(vs[r].next))); (s) ⊦ ¬ dups([]); (s) ⊦ ¬ a ∈ []; (s) ⊦ x + [] = x; (s) ⊦ a '.last = a; (s)
| rl1.last = vhead, dom vrvHp = dom prvHp, mk(val, opttid, nxt) = ps[r], vs[r].deqID ≠ opttid, opttid ≠ None, phead ≠ r, r ≠ null, rl1 ≠ [], DMSQLInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, rl1 + r ', owns, rvowns), lsf(tid), pcf(tid)), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(r ' + qrl, vs, ps, owns), listp(rl1 + r ' + qrl, vs, ps, owns), markedp(rl1, vs), markedp(rl1, ps), nonullRetRefs(rl1 + r ' + qrl, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(opttid), some?(vs[r].deqID), unmarkedp(qrl, ps), unmarkedp(qrl, vs), r ∈ ps, r ∈ vs, phead ∈ ps, phead ∈ vs, ¬ dups(rl1 + qrl), ¬ dups(rl1), ¬ dups(qrl), ¬ listp(rl1 + r ' + qrl, vs, ps[r, mk(val, vs[r].deqID, nxt)], owns), ¬ r ∈ qrl, ¬ r ∈ rl1, 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), phead ∈ rl1 ∨ phead = r, vtail = (r ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (r ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ qrl ≠ [] ∧ r = qrl.head |
dom vrvHp = dom prvHp, mk(val, opttid, nxt) = ps[r], vs[r].deqID ≠ opttid, opttid ≠ None, phead ≠ r, r ≠ null, rl1 ≠ [], DMSQLInv(mkgs(ps, vs, phead, rl1.last, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, rl1 + r ', owns, rvowns), lsf(tid), pcf(tid)), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(rl1 + r ' + qrl, vs, ps, owns), listp(r ' + qrl, vs, ps, owns), markedp(rl1, ps), markedp(rl1, vs), nonullRetRefs(rl1 + r ' + qrl, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[r].deqID), some?(opttid), unmarkedp(qrl, vs), unmarkedp(qrl, ps), phead ∈ vs, phead ∈ ps, r ∈ vs, r ∈ ps, phead ∈ rl1, ¬ dups(rl1 + qrl), ¬ dups(rl1), ¬ dups(qrl), ¬ listp(rl1 + r ' + qrl, vs, ps[r, mk(val, vs[r].deqID, nxt)], owns), ¬ r ∈ qrl, ¬ r ∈ rl1, vs[rl1.last].next ≠ null ∧ vs[vs[rl1.last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[rl1.last].next].deqID.tid)) = Claimed(vs[vs[rl1.last].next].deqID.tid, vs[vs[rl1.last].next].val), vtail = (r ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (r ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ qrl ≠ [] ∧ r = qrl.head
| dom vrvHp = dom prvHp, mk(val, opttid, nxt) = ps[r], vs[r].deqID ≠ opttid, opttid ≠ None, phead ≠ r, r ≠ null, rl1 ≠ [], DMSQLInv(mkgs(ps, vs, phead, rl1.last, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, rl1 + r ', owns, rvowns), lsf(tid), pcf(tid)), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(rl1 + r ' + qrl, vs, ps, owns), listp(r ' + qrl, vs, ps, owns), markedp(rl1, ps), markedp(rl1, vs), nonullRetRefs(rl1 + r ' + qrl, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[r].deqID), some?(opttid), unmarkedp(qrl, vs), unmarkedp(qrl, ps), phead ∈ vs, phead ∈ ps, r ∈ vs, r ∈ ps, phead ∈ rl1, ¬ dups(rl1 + qrl), ¬ dups(rl1), ¬ dups(qrl), ¬ listp(rl1 + r ' + qrl, vs, ps[r, mk(val, vs[r].deqID, nxt)], owns), ¬ r ∈ qrl, ¬ r ∈ rl1, vs[rl1.last].next ≠ null ∧ vs[vs[rl1.last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[rl1.last].next].deqID.tid)) = Claimed(vs[vs[rl1.last].next].deqID.tid, vs[vs[rl1.last].next].val), vtail = (r ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (r ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ qrl ≠ [] ∧ r = qrl.head |
Used simplifier rules: reflist freely generated by [], +;; ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) ⊦ listp(r ' + r0 ' + rl, vs, ps, owns) ↔ owns(r) = None ∧ r ∈ vs ∧ r ∈ ps ∧ r ≠ null ∧ ¬ weak?(vs[r].deqID) ∧ (ps[r].deqID = vs[r].deqID ∨ ps[r].deqID = None) ∧ ps[r].val = vs[r].val ∧ ps[r].next = vs[r].next ∧ ps[r].next = r0 ∧ listp(r0 ' + rl, vs, ps, owns); (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) ⊦ (b ' + a ' + x).last = (a ' + x).last; (s) ⊦ a ' + x ≠ []; (s) ⊦ a + x = a ' + x; (s) ⊦ (a ' + x).head = a; (s) listp-twoin: ⊦ listp(rl + r ' + r0 ' + rl0, vs, ps, owns) → ps[r].next = r0; (forward) from specification DMSQ a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ mk(val, opttid, nxt).next = nxt; (s) ⊦ mk(val, opttid, nxt).val = val; (s) ⊦ mk(val, opttid, nxt).deqID = opttid; (s) ⊦ some?(opttid) → opttid ≠ None; (as) ⊦ unmarkedp([], vs); (s) ⊦ listp(r ', vs, ps, owns) ↔ owns(r) = None ∧ r ∈ vs ∧ r ∈ ps ∧ r ≠ null ∧ ¬ weak?(vs[r].deqID) ∧ (ps[r].deqID = vs[r].deqID ∨ ps[r].deqID = None) ∧ ps[r].val = vs[r].val ∧ ps[r].next = null ∧ ( vs[r].next ≠ null → vs[r].next ∈ vs ∧ vs[r].next ∈ ps ∧ ps[vs[r].next] = vs[vs[r].next] ∧ ps[vs[r].next].deqID = None ∧ ps[vs[r].next].next = null ∧ weak?(owns(vs[r].next))); (s) ⊦ ¬ dups([]); (s) ⊦ ¬ a ∈ []; (s) ⊦ x + [] = x; (s) ⊦ a '.last = a; (s)
| dom vrvHp = dom prvHp, mk(val, opttid, nxt) = ps[r], orl + qrl ≠ [], vs[r].deqID ≠ opttid, orl ≠ [], r ≠ null, DMSQLInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid), pcf(tid)), 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, r ∈ vs, r ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ r ∈ 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), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ ¬ r ∈ qrl ∧ ¬ r ∈ orl, listp(orl + qrl, vs, ps[r, mk(val, vs[r].deqID, nxt)], owns) ∧ (r ∈ orl → some?(vs[r].deqID)) ∧ unmarkedp(qrl, ps[r, mk(val, vs[r].deqID, nxt)]), qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None, r ≠ vs[(orl + qrl).last].next ∧ ¬ r ∈ qrl ∧ ¬ r ∈ orl |
dom vrvHp = dom prvHp, mk(val, opttid, nxt) = ps[r], orl + qrl ≠ [], vs[r].deqID ≠ opttid, orl ≠ [], qrl ≠ [], r ≠ null, DMSQLInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid), pcf(tid)), 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), r ∈ qrl, phead ∈ ps, phead ∈ vs, phead ∈ orl, r ∈ vs, r ∈ ps, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ r ∈ 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), vtail = qrl.last ∨ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ unmarkedp(qrl.tail, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ listp(orl + qrl, vs, ps[r, mk(val, vs[r].deqID, nxt)], owns) ∧ unmarkedp(qrl, ps[r, mk(val, vs[r].deqID, nxt)]), vs[qrl.head].deqID ≠ None ∧ r = qrl.head
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ y ≠ [] → (x + y).last = y.last; (s) ⊦ ¬ a ∈ []; (s) ⊦ x + [] = x; (s) ⊦ unmarkedp([], vs); (s) list-elem-in-app21: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ qrl → node ∈ vs; (forward) from specification DMSQ list-elem-in-app22: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ qrl → node ∈ ps; (forward) from specification DMSQ
| dom vrvHp = dom prvHp, mk(val, opttid, nxt) = ps[r], orl + qrl ≠ [], vs[r].deqID ≠ opttid, orl ≠ [], qrl ≠ [], r ≠ null, DMSQLInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid), pcf(tid)), 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), r ∈ qrl, phead ∈ ps, phead ∈ vs, phead ∈ orl, r ∈ vs, r ∈ ps, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ r ∈ 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), vtail = qrl.last ∨ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ unmarkedp(qrl.tail, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ listp(orl + qrl, vs, ps[r, mk(val, vs[r].deqID, nxt)], owns) ∧ unmarkedp(qrl, ps[r, mk(val, vs[r].deqID, nxt)]), vs[qrl.head].deqID ≠ None ∧ r = qrl.head |
dom vrvHp = dom prvHp, mk(val, opttid, nxt) = ps[r], qrl = vtail0 + qrl0, orl + qrl ≠ [], vs[r].deqID ≠ opttid, orl ≠ [], qrl ≠ [], r ≠ null, DMSQLInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid), pcf(tid)), 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), r ∈ ps, r ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, r ∈ qrl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ r ∈ 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(qrl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = qrl.last ∨ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ vs[vtail0].deqID ≠ None ∧ r = vtail0, listp(orl + qrl, vs, ps[r, mk(val, vs[r].deqID, nxt)], owns) ∧ unmarkedp(qrl, ps[r, mk(val, vs[r].deqID, nxt)])
Used simplifier rules: ⊦ x ≠ [] → (head = x.head ∧ tail = x.tail ↔ x = head + tail); (elim) Used terms: qrl, head, qrl0
| dom vrvHp = dom prvHp, mk(val, opttid, nxt) = ps[r], qrl = vtail0 + qrl0, orl + qrl ≠ [], vs[r].deqID ≠ opttid, orl ≠ [], qrl ≠ [], r ≠ null, DMSQLInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid), pcf(tid)), 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), r ∈ ps, r ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, r ∈ qrl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ r ∈ 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(qrl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = qrl.last ∨ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ vs[vtail0].deqID ≠ None ∧ r = vtail0, listp(orl + qrl, vs, ps[r, mk(val, vs[r].deqID, nxt)], owns) ∧ unmarkedp(qrl, ps[r, mk(val, vs[r].deqID, nxt)]) |
ps[vtail0].deqID = None, dom vrvHp = dom prvHp, mk(val, opttid, nxt) = ps[r], vs[r].deqID ≠ opttid, orl ≠ [], r ≠ null, DMSQLInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, vtail0 ' + qrl0, orl, owns, rvowns), lsf(tid), pcf(tid)), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + vtail0 ' + qrl0, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + vtail0 ' + qrl0, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl0, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, r ∈ vs, r ∈ ps, ¬ dups(orl + qrl0), ¬ dups(orl), ¬ dups(qrl0), ¬ r ∈ orl, ¬ vtail0 ∈ qrl0, ¬ vtail0 ∈ 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), r = vtail0 ∨ r ∈ qrl0, vtail = (vtail0 ' + qrl0).last ∨ vtail = (orl + (vtail0 ' + qrl0).butlast).last ∧ vs[(vtail0 ' + qrl0).last].deqID = None ∧ vs[(vtail0 ' + qrl0).last].next = null, orl.last = vhead ∧ unmarkedp(qrl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None ∧ unmarkedp(qrl0, vs) ⊦ vs[vtail0].deqID ≠ None ∧ r = vtail0, listp(orl + vtail0 ' + qrl0, vs, ps[r, mk(val, vs[r].deqID, nxt)], owns) ∧ ps[r, mk(val, vs[r].deqID, nxt)][vtail0].deqID = None ∧ unmarkedp(qrl0, ps[r, mk(val, vs[r].deqID, nxt)])
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] ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ 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) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a ' + x ≠ []; (s) ⊦ x + a ' + y ≠ []; (s)
| ps[vtail0].deqID = None, dom vrvHp = dom prvHp, mk(val, opttid, nxt) = ps[r], vs[r].deqID ≠ opttid, orl ≠ [], r ≠ null, DMSQLInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, vtail0 ' + qrl0, orl, owns, rvowns), lsf(tid), pcf(tid)), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + vtail0 ' + qrl0, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + vtail0 ' + qrl0, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl0, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, r ∈ vs, r ∈ ps, ¬ dups(orl + qrl0), ¬ dups(orl), ¬ dups(qrl0), ¬ r ∈ orl, ¬ vtail0 ∈ qrl0, ¬ vtail0 ∈ 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), r = vtail0 ∨ r ∈ qrl0, vtail = (vtail0 ' + qrl0).last ∨ vtail = (orl + (vtail0 ' + qrl0).butlast).last ∧ vs[(vtail0 ' + qrl0).last].deqID = None ∧ vs[(vtail0 ' + qrl0).last].next = null, orl.last = vhead ∧ unmarkedp(qrl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None ∧ unmarkedp(qrl0, vs) ⊦ vs[vtail0].deqID ≠ None ∧ r = vtail0, listp(orl + vtail0 ' + qrl0, vs, ps[r, mk(val, vs[r].deqID, nxt)], owns) ∧ ps[r, mk(val, vs[r].deqID, nxt)][vtail0].deqID = None ∧ unmarkedp(qrl0, ps[r, mk(val, vs[r].deqID, nxt)]) |
⊦ listp(rl, vs, ps, owns) ∧ r ∈ rl → (∃ rl1, rl2. rl = rl1 + r ' + rl2 ∧ listp(r ' + rl2, vs, ps, owns))
ps[vtail0].deqID = None, dom vrvHp = dom prvHp, mk(val, opttid, nxt) = ps[r], vs[r].deqID ≠ opttid, orl ≠ [], r ≠ null, DMSQLInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, vtail0 ' + qrl0, orl, owns, rvowns), lsf(tid), pcf(tid)), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + vtail0 ' + qrl0, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nonullRetRefs(orl + vtail0 ' + qrl0, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl0, ps), r ∈ ps, r ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl0), ¬ dups(orl), ¬ dups(qrl0), ¬ r ∈ orl, ¬ vtail0 ∈ qrl0, ¬ vtail0 ∈ 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), listp(orl + vtail0 ' + qrl0, vs, ps, owns) ∧ r ∈ orl + vtail0 ' + qrl0 → (∃ rl1, rl2. orl + vtail0 ' + qrl0 = rl1 + r ' + rl2 ∧ listp(r ' + rl2, vs, ps, owns)), orl.last = vhead ∧ unmarkedp(qrl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None ∧ unmarkedp(qrl0, vs), vtail = (vtail0 ' + qrl0).last ∨ vtail = (orl + (vtail0 ' + qrl0).butlast).last ∧ vs[(vtail0 ' + qrl0).last].deqID = None ∧ vs[(vtail0 ' + qrl0).last].next = null, r = vtail0 ∨ r ∈ qrl0 ⊦ listp(orl + vtail0 ' + qrl0, vs, ps[r, mk(val, vs[r].deqID, nxt)], owns) ∧ ps[r, mk(val, vs[r].deqID, nxt)][vtail0].deqID = None ∧ unmarkedp(qrl0, ps[r, mk(val, vs[r].deqID, nxt)]), vs[vtail0].deqID ≠ None ∧ r = vtail0
Used terms: ps, orl + vtail0 ' + qrl0, owns, r, vs
| ⊦ listp(rl, vs, ps, owns) ∧ r ∈ rl → (∃ rl1, rl2. rl = rl1 + r ' + rl2 ∧ listp(r ' + rl2, vs, ps, owns)) |
| ps[vtail0].deqID = None, dom vrvHp = dom prvHp, mk(val, opttid, nxt) = ps[r], vs[r].deqID ≠ opttid, orl ≠ [], r ≠ null, DMSQLInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, vtail0 ' + qrl0, orl, owns, rvowns), lsf(tid), pcf(tid)), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + vtail0 ' + qrl0, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nonullRetRefs(orl + vtail0 ' + qrl0, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl0, ps), r ∈ ps, r ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl0), ¬ dups(orl), ¬ dups(qrl0), ¬ r ∈ orl, ¬ vtail0 ∈ qrl0, ¬ vtail0 ∈ 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), listp(orl + vtail0 ' + qrl0, vs, ps, owns) ∧ r ∈ orl + vtail0 ' + qrl0 → (∃ rl1, rl2. orl + vtail0 ' + qrl0 = rl1 + r ' + rl2 ∧ listp(r ' + rl2, vs, ps, owns)), orl.last = vhead ∧ unmarkedp(qrl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None ∧ unmarkedp(qrl0, vs), vtail = (vtail0 ' + qrl0).last ∨ vtail = (orl + (vtail0 ' + qrl0).butlast).last ∧ vs[(vtail0 ' + qrl0).last].deqID = None ∧ vs[(vtail0 ' + qrl0).last].next = null, r = vtail0 ∨ r ∈ qrl0 ⊦ listp(orl + vtail0 ' + qrl0, vs, ps[r, mk(val, vs[r].deqID, nxt)], owns) ∧ ps[r, mk(val, vs[r].deqID, nxt)][vtail0].deqID = None ∧ unmarkedp(qrl0, ps[r, mk(val, vs[r].deqID, nxt)]), vs[vtail0].deqID ≠ None ∧ r = vtail0 |
orl + vtail0 ' + qrl0 = rl1 + r ' + rl2, ps[vtail0].deqID = None, dom vrvHp = dom prvHp, mk(val, opttid, nxt) = ps[r], vs[r].deqID ≠ opttid, orl ≠ [], r ≠ null, DMSQLInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, vtail0 ' + qrl0, orl, owns, rvowns), lsf(tid), pcf(tid)), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl1 + r ' + rl2, vs, ps, owns), listp(r ' + rl2, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(rl1 + r ' + rl2, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl0, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, r ∈ vs, r ∈ ps, ¬ dups(orl + qrl0), ¬ dups(orl), ¬ dups(qrl0), ¬ r ∈ orl, ¬ vtail0 ∈ qrl0, ¬ vtail0 ∈ 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), r = vtail0 ∨ r ∈ qrl0, vtail = (vtail0 ' + qrl0).last ∨ vtail = (orl + (vtail0 ' + qrl0).butlast).last ∧ vs[(vtail0 ' + qrl0).last].deqID = None ∧ vs[(vtail0 ' + qrl0).last].next = null, orl.last = vhead ∧ unmarkedp(qrl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None ∧ unmarkedp(qrl0, vs) ⊦ vs[vtail0].deqID ≠ None ∧ r = vtail0, listp(rl1 + r ' + rl2, vs, ps[r, mk(val, vs[r].deqID, nxt)], owns) ∧ ps[r, mk(val, vs[r].deqID, nxt)][vtail0].deqID = None ∧ unmarkedp(qrl0, ps[r, mk(val, vs[r].deqID, nxt)])
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s)
| orl + vtail0 ' + qrl0 = rl1 + r ' + rl2, ps[vtail0].deqID = None, dom vrvHp = dom prvHp, mk(val, opttid, nxt) = ps[r], vs[r].deqID ≠ opttid, orl ≠ [], r ≠ null, DMSQLInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, vtail0 ' + qrl0, orl, owns, rvowns), lsf(tid), pcf(tid)), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl1 + r ' + rl2, vs, ps, owns), listp(r ' + rl2, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(rl1 + r ' + rl2, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl0, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, r ∈ vs, r ∈ ps, ¬ dups(orl + qrl0), ¬ dups(orl), ¬ dups(qrl0), ¬ r ∈ orl, ¬ vtail0 ∈ qrl0, ¬ vtail0 ∈ 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), r = vtail0 ∨ r ∈ qrl0, vtail = (vtail0 ' + qrl0).last ∨ vtail = (orl + (vtail0 ' + qrl0).butlast).last ∧ vs[(vtail0 ' + qrl0).last].deqID = None ∧ vs[(vtail0 ' + qrl0).last].next = null, orl.last = vhead ∧ unmarkedp(qrl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None ∧ unmarkedp(qrl0, vs) ⊦ vs[vtail0].deqID ≠ None ∧ r = vtail0, listp(rl1 + r ' + rl2, vs, ps[r, mk(val, vs[r].deqID, nxt)], owns) ∧ ps[r, mk(val, vs[r].deqID, nxt)][vtail0].deqID = None ∧ unmarkedp(qrl0, ps[r, mk(val, vs[r].deqID, nxt)]) |
orl + vtail0 ' + qrl0 = rl1 + r ' + rl2, ps[vtail0].deqID = None, dom vrvHp = dom prvHp, mk(val, opttid, nxt) = ps[r], rl2 = vtail1 + rl, vs[r].deqID ≠ opttid, orl ≠ [], r ≠ null, DMSQLInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, vtail0 ' + qrl0, orl, owns, rvowns), lsf(tid), pcf(tid)), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(r ' + rl2, vs, ps, owns), listp(rl1 + r ' + rl2, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nonullRetRefs(rl1 + r ' + rl2, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl0, ps), r ∈ ps, r ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl0), ¬ dups(orl), ¬ dups(qrl0), ¬ r ∈ orl, ¬ vtail0 ∈ qrl0, ¬ vtail0 ∈ 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(qrl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None ∧ unmarkedp(qrl0, vs), vtail = (vtail0 ' + qrl0).last ∨ vtail = (orl + (vtail0 ' + qrl0).butlast).last ∧ vs[(vtail0 ' + qrl0).last].deqID = None ∧ vs[(vtail0 ' + qrl0).last].next = null, r = vtail0 ∨ r ∈ qrl0 ⊦ listp(rl1 + r ' + rl2, vs, ps[r, mk(val, vs[r].deqID, nxt)], owns) ∧ ps[r, mk(val, vs[r].deqID, nxt)][vtail0].deqID = None ∧ unmarkedp(qrl0, ps[r, mk(val, vs[r].deqID, nxt)]), vs[vtail0].deqID ≠ None ∧ r = vtail0
Used simplifier rules: reflist freely generated by [], +;; ⊦ listp(r ', vs, ps, owns) ↔ owns(r) = None ∧ r ∈ vs ∧ r ∈ ps ∧ r ≠ null ∧ ¬ weak?(vs[r].deqID) ∧ (ps[r].deqID = vs[r].deqID ∨ ps[r].deqID = None) ∧ ps[r].val = vs[r].val ∧ ps[r].next = null ∧ ( vs[r].next ≠ null → vs[r].next ∈ vs ∧ vs[r].next ∈ ps ∧ ps[vs[r].next] = vs[vs[r].next] ∧ ps[vs[r].next].deqID = None ∧ ps[vs[r].next].next = null ∧ weak?(owns(vs[r].next))); (s) ⊦ x + [] = x; (s) in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] ⊦ mk(val, opttid, nxt).next = nxt; (s) ⊦ mk(val, opttid, nxt).val = val; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ mk(val, opttid, nxt).deqID = opttid; (s) ⊦ a ∈ x → (b ' + x).last = x.last; (s) ⊦ a ≠ b → st[b, d][a] = st[a]; (s) in-16: ⊦ x + a ' = y + b ' + z ∧ a ≠ b → a ∈ z; (forward) from specification list[reflist] inex: ⊦ x + a ' = y + b ' + z ∧ a ≠ b → (∃ z0. z = z0 + a '); (forward) from specification list[reflist] ⊦ # y = # y0 → (x + y = z + y0 ↔ x = z ∧ y = y0); (ws) ⊦ dups(x + a ') ↔ a ∈ x ∨ dups(x); (ws) ⊦ ¬ b ∈ x → (dups(x + b ') ↔ dups(x)); (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist]
| orl + vtail0 ' + qrl0 = rl1 + r ' + rl2, ps[vtail0].deqID = None, dom vrvHp = dom prvHp, mk(val, opttid, nxt) = ps[r], rl2 = vtail1 + rl, vs[r].deqID ≠ opttid, orl ≠ [], r ≠ null, DMSQLInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, vtail0 ' + qrl0, orl, owns, rvowns), lsf(tid), pcf(tid)), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(r ' + rl2, vs, ps, owns), listp(rl1 + r ' + rl2, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nonullRetRefs(rl1 + r ' + rl2, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl0, ps), r ∈ ps, r ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl0), ¬ dups(orl), ¬ dups(qrl0), ¬ r ∈ orl, ¬ vtail0 ∈ qrl0, ¬ vtail0 ∈ 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(qrl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None ∧ unmarkedp(qrl0, vs), vtail = (vtail0 ' + qrl0).last ∨ vtail = (orl + (vtail0 ' + qrl0).butlast).last ∧ vs[(vtail0 ' + qrl0).last].deqID = None ∧ vs[(vtail0 ' + qrl0).last].next = null, r = vtail0 ∨ r ∈ qrl0 ⊦ listp(rl1 + r ' + rl2, vs, ps[r, mk(val, vs[r].deqID, nxt)], owns) ∧ ps[r, mk(val, vs[r].deqID, nxt)][vtail0].deqID = None ∧ unmarkedp(qrl0, ps[r, mk(val, vs[r].deqID, nxt)]), vs[vtail0].deqID ≠ None ∧ r = vtail0 |
orl + vtail0 ' + qrl0 = rl1 + r ' + vs[r].next ' + rl, ps[vtail0].deqID = None, dom vrvHp = dom prvHp, mk(vs[r].val, None, vs[r].next) = ps[r], owns(r) = None, vs[r].deqID ≠ None, orl ≠ [], r ≠ null, r ≠ vtail0, DMSQLInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, vtail0 ' + qrl0, orl, owns, rvowns), lsf(tid), pcf(tid)), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + vtail0 ' + qrl0, vs, ps, owns), listp(vs[r].next ' + rl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + vtail0 ' + qrl0, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl0, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, r ∈ vs, r ∈ ps, r ∈ qrl0, ¬ dups(orl + qrl0), ¬ dups(orl), ¬ dups(qrl0), ¬ weak?(vs[r].deqID), ¬ r ∈ orl, ¬ vtail0 ∈ qrl0, ¬ vtail0 ∈ 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(qrl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None ∧ unmarkedp(qrl0, vs), vtail = qrl0.last ∨ vtail = (orl + (vtail0 ' + qrl0).butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null ⊦ listp(orl + vtail0 ' + qrl0, vs, ps[r, mk(vs[r].val, vs[r].deqID, vs[r].next)], owns) ∧ unmarkedp(qrl0, ps[r, mk(vs[r].val, vs[r].deqID, vs[r].next)])
Used simplifier rules: ⊦ a ≠ b → st[b, d][a] = st[a]; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ∈ x → (b ' + x).last = x.last; (s) ⊦ mk(val, opttid, nxt).deqID = opttid; (s) ⊦ mk(val, opttid, nxt).val = val; (s) ⊦ mk(val, opttid, nxt).next = nxt; (s) ⊦ a + x = a ' + x; (s) ⊦ listp(r ' + r0 ' + rl, vs, ps, owns) ↔ owns(r) = None ∧ r ∈ vs ∧ r ∈ ps ∧ r ≠ null ∧ ¬ weak?(vs[r].deqID) ∧ (ps[r].deqID = vs[r].deqID ∨ ps[r].deqID = None) ∧ ps[r].val = vs[r].val ∧ ps[r].next = vs[r].next ∧ ps[r].next = r0 ∧ listp(r0 ' + rl, vs, ps, owns); (s)
| orl + vtail0 ' + qrl0 = rl1 + r ' + vs[r].next ' + rl, ps[vtail0].deqID = None, dom vrvHp = dom prvHp, mk(vs[r].val, None, vs[r].next) = ps[r], owns(r) = None, vs[r].deqID ≠ None, orl ≠ [], r ≠ null, r ≠ vtail0, DMSQLInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, vtail0 ' + qrl0, orl, owns, rvowns), lsf(tid), pcf(tid)), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + vtail0 ' + qrl0, vs, ps, owns), listp(vs[r].next ' + rl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + vtail0 ' + qrl0, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl0, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, r ∈ vs, r ∈ ps, r ∈ qrl0, ¬ dups(orl + qrl0), ¬ dups(orl), ¬ dups(qrl0), ¬ weak?(vs[r].deqID), ¬ r ∈ orl, ¬ vtail0 ∈ qrl0, ¬ vtail0 ∈ 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(qrl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None ∧ unmarkedp(qrl0, vs), vtail = qrl0.last ∨ vtail = (orl + (vtail0 ' + qrl0).butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null ⊦ listp(orl + vtail0 ' + qrl0, vs, ps[r, mk(vs[r].val, vs[r].deqID, vs[r].next)], owns) ∧ unmarkedp(qrl0, ps[r, mk(vs[r].val, vs[r].deqID, vs[r].next)]) |
orl + vtail0 ' + qrl0 = rl1 + r ' + vs[r].next ' + rl, ps[vtail0].deqID = None, dom vrvHp = dom prvHp, mk(vs[r].val, None, vs[r].next) = ps[r], owns(r) = None, vs[r].deqID ≠ None, ps[r, mk(vs[r].val, vs[r].deqID, vs[r].next)] ≠ ps, orl ≠ [], r ≠ null, r ≠ vtail0, DMSQLInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, vtail0 ' + qrl0, orl, owns, rvowns), lsf(tid), pcf(tid)), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(vs[r].next ' + rl, vs, ps, owns), listp(orl + vtail0 ' + qrl0, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nonullRetRefs(orl + vtail0 ' + qrl0, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl0, ps), r ∈ qrl0, r ∈ ps, r ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl0), ¬ dups(orl), ¬ dups(qrl0), ¬ weak?(vs[r].deqID), ¬ r ∈ orl, ¬ vtail0 ∈ qrl0, ¬ vtail0 ∈ 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), vtail = qrl0.last ∨ vtail = (orl + (vtail0 ' + qrl0).butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, orl.last = vhead ∧ unmarkedp(qrl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None ∧ unmarkedp(qrl0, vs) ⊦ listp(orl + vtail0 ' + qrl0, vs, ps[r, mk(vs[r].val, vs[r].deqID, vs[r].next)], owns) ∧ unmarkedp(qrl0, ps[r, mk(vs[r].val, vs[r].deqID, vs[r].next)])
Used formulas: ps[r, mk(vs[r].val, vs[r].deqID, vs[r].next)] = ps
| orl + vtail0 ' + qrl0 = rl1 + r ' + vs[r].next ' + rl, ps[vtail0].deqID = None, dom vrvHp = dom prvHp, mk(vs[r].val, None, vs[r].next) = ps[r], owns(r) = None, vs[r].deqID ≠ None, ps[r, mk(vs[r].val, vs[r].deqID, vs[r].next)] ≠ ps, orl ≠ [], r ≠ null, r ≠ vtail0, DMSQLInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, vtail0 ' + qrl0, orl, owns, rvowns), lsf(tid), pcf(tid)), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(vs[r].next ' + rl, vs, ps, owns), listp(orl + vtail0 ' + qrl0, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nonullRetRefs(orl + vtail0 ' + qrl0, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl0, ps), r ∈ qrl0, r ∈ ps, r ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl0), ¬ dups(orl), ¬ dups(qrl0), ¬ weak?(vs[r].deqID), ¬ r ∈ orl, ¬ vtail0 ∈ qrl0, ¬ vtail0 ∈ 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), vtail = qrl0.last ∨ vtail = (orl + (vtail0 ' + qrl0).butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, orl.last = vhead ∧ unmarkedp(qrl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None ∧ unmarkedp(qrl0, vs) ⊦ listp(orl + vtail0 ' + qrl0, vs, ps[r, mk(vs[r].val, vs[r].deqID, vs[r].next)], owns) ∧ unmarkedp(qrl0, ps[r, mk(vs[r].val, vs[r].deqID, vs[r].next)]) |
⊦ st1 = st2 ↔ (∀ a. (a ∈ st1 ↔ a ∈ st2) ∧ st1[a] = st2[a])
orl + vtail0 ' + qrl0 = rl1 + r ' + vs[r].next ' + rl, ps[vtail0].deqID = None, dom vrvHp = dom prvHp, mk(vs[r].val, None, vs[r].next) = ps[r], owns(r) = None, vs[r].deqID ≠ None, orl ≠ [], r ≠ null, r ≠ vtail0, DMSQLInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, vtail0 ' + qrl0, orl, owns, rvowns), lsf(tid), pcf(tid)), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + vtail0 ' + qrl0, vs, ps, owns), listp(vs[r].next ' + rl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + vtail0 ' + qrl0, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl0, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, r ∈ vs, r ∈ ps, r ∈ qrl0, ¬ dups(orl + qrl0), ¬ dups(orl), ¬ dups(qrl0), ¬ weak?(vs[r].deqID), ¬ r ∈ orl, ¬ vtail0 ∈ qrl0, ¬ vtail0 ∈ 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), ∃ r0. ¬((r0 ∈ ps[r, mk(vs[r].val, vs[r].deqID, vs[r].next)] ↔ r0 ∈ ps) ∧ ps[r, mk(vs[r].val, vs[r].deqID, vs[r].next)][r0] = ps[r0]), orl.last = vhead ∧ unmarkedp(qrl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None ∧ unmarkedp(qrl0, vs), vtail = qrl0.last ∨ vtail = (orl + (vtail0 ' + qrl0).butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null ⊦ listp(orl + vtail0 ' + qrl0, vs, ps[r, mk(vs[r].val, vs[r].deqID, vs[r].next)], owns) ∧ unmarkedp(qrl0, ps[r, mk(vs[r].val, vs[r].deqID, vs[r].next)])
Used terms: ps[r, mk(vs[r].val, vs[r].deqID, vs[r].next)], ps
| ⊦ st1 = st2 ↔ (∀ a. (a ∈ st1 ↔ a ∈ st2) ∧ st1[a] = st2[a]) |
| orl + vtail0 ' + qrl0 = rl1 + r ' + vs[r].next ' + rl, ps[vtail0].deqID = None, dom vrvHp = dom prvHp, mk(vs[r].val, None, vs[r].next) = ps[r], owns(r) = None, vs[r].deqID ≠ None, orl ≠ [], r ≠ null, r ≠ vtail0, DMSQLInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, vtail0 ' + qrl0, orl, owns, rvowns), lsf(tid), pcf(tid)), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + vtail0 ' + qrl0, vs, ps, owns), listp(vs[r].next ' + rl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + vtail0 ' + qrl0, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl0, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, r ∈ vs, r ∈ ps, r ∈ qrl0, ¬ dups(orl + qrl0), ¬ dups(orl), ¬ dups(qrl0), ¬ weak?(vs[r].deqID), ¬ r ∈ orl, ¬ vtail0 ∈ qrl0, ¬ vtail0 ∈ 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), ∃ r0. ¬((r0 ∈ ps[r, mk(vs[r].val, vs[r].deqID, vs[r].next)] ↔ r0 ∈ ps) ∧ ps[r, mk(vs[r].val, vs[r].deqID, vs[r].next)][r0] = ps[r0]), orl.last = vhead ∧ unmarkedp(qrl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None ∧ unmarkedp(qrl0, vs), vtail = qrl0.last ∨ vtail = (orl + (vtail0 ' + qrl0).butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null ⊦ listp(orl + vtail0 ' + qrl0, vs, ps[r, mk(vs[r].val, vs[r].deqID, vs[r].next)], owns) ∧ unmarkedp(qrl0, ps[r, mk(vs[r].val, vs[r].deqID, vs[r].next)]) |
orl + vtail0 ' + qrl0 = rl1 + r ' + vs[r].next ' + rl, ps[vtail0].deqID = None, dom vrvHp = dom prvHp, mk(vs[r].val, None, vs[r].next) = ps[r], owns(r) = None, vs[r].deqID ≠ None, orl ≠ [], r ≠ null, r ≠ vtail0, DMSQLInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, vtail0 ' + qrl0, orl, owns, rvowns), lsf(tid), pcf(tid)), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(vs[r].next ' + rl, vs, ps, owns), listp(orl + vtail0 ' + qrl0, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nonullRetRefs(orl + vtail0 ' + qrl0, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl0, ps), r ∈ qrl0, r ∈ ps, r ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl0), ¬ dups(orl), ¬ dups(qrl0), ¬ weak?(vs[r].deqID), ¬ r ∈ orl, ¬ vtail0 ∈ qrl0, ¬ vtail0 ∈ 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), vtail = qrl0.last ∨ vtail = (orl + (vtail0 ' + qrl0).butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, orl.last = vhead ∧ unmarkedp(qrl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None ∧ unmarkedp(qrl0, vs) ⊦ listp(orl + vtail0 ' + qrl0, vs, ps[r, mk(vs[r].val, vs[r].deqID, vs[r].next)], owns) ∧ unmarkedp(qrl0, ps[r, mk(vs[r].val, vs[r].deqID, vs[r].next)]), (r0 ∈ ps → r0 ∈ ps[r, mk(vs[r].val, vs[r].deqID, vs[r].next)]) ∧ ps[r, mk(vs[r].val, vs[r].deqID, vs[r].next)][r0] = ps[r0]
Used simplifier rules: ⊦ a ∈ st[b, d] ↔ a = b ∨ a ∈ st; (ws)
| orl + vtail0 ' + qrl0 = rl1 + r ' + vs[r].next ' + rl, ps[vtail0].deqID = None, dom vrvHp = dom prvHp, mk(vs[r].val, None, vs[r].next) = ps[r], owns(r) = None, vs[r].deqID ≠ None, orl ≠ [], r ≠ null, r ≠ vtail0, DMSQLInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, vtail0 ' + qrl0, orl, owns, rvowns), lsf(tid), pcf(tid)), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(vs[r].next ' + rl, vs, ps, owns), listp(orl + vtail0 ' + qrl0, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nonullRetRefs(orl + vtail0 ' + qrl0, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl0, ps), r ∈ qrl0, r ∈ ps, r ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl0), ¬ dups(orl), ¬ dups(qrl0), ¬ weak?(vs[r].deqID), ¬ r ∈ orl, ¬ vtail0 ∈ qrl0, ¬ vtail0 ∈ 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), vtail = qrl0.last ∨ vtail = (orl + (vtail0 ' + qrl0).butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, orl.last = vhead ∧ unmarkedp(qrl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None ∧ unmarkedp(qrl0, vs) ⊦ listp(orl + vtail0 ' + qrl0, vs, ps[r, mk(vs[r].val, vs[r].deqID, vs[r].next)], owns) ∧ unmarkedp(qrl0, ps[r, mk(vs[r].val, vs[r].deqID, vs[r].next)]), (r0 ∈ ps → r0 ∈ ps[r, mk(vs[r].val, vs[r].deqID, vs[r].next)]) ∧ ps[r, mk(vs[r].val, vs[r].deqID, vs[r].next)][r0] = ps[r0] |
⊦ a ≠ b → st[b, d][a] = st[a]
orl + vtail0 ' + qrl0 = rl1 + r ' + vs[r].next ' + rl, ps[vtail0].deqID = None, dom vrvHp = dom prvHp, mk(vs[r].val, None, vs[r].next) = ps[r], owns(r) = None, r0 = r, vs[r].deqID ≠ None, orl ≠ [], r ≠ null, r ≠ vtail0, DMSQLInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, vtail0 ' + qrl0, orl, owns, rvowns), lsf(tid), pcf(tid)), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + vtail0 ' + qrl0, vs, ps, owns), listp(vs[r].next ' + rl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + vtail0 ' + qrl0, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl0, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, r ∈ vs, r ∈ ps, r ∈ qrl0, ¬ dups(orl + qrl0), ¬ dups(orl), ¬ dups(qrl0), ¬ weak?(vs[r].deqID), ¬ r ∈ orl, ¬ vtail0 ∈ qrl0, ¬ vtail0 ∈ 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(qrl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None ∧ unmarkedp(qrl0, vs), vtail = qrl0.last ∨ vtail = (orl + (vtail0 ' + qrl0).butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null ⊦ (r0 ∈ ps → r0 ∈ ps[r, mk(vs[r].val, vs[r].deqID, vs[r].next)]) ∧ ps[r, mk(vs[r].val, vs[r].deqID, vs[r].next)][r0] = ps[r0], listp(orl + vtail0 ' + qrl0, vs, ps[r, mk(vs[r].val, vs[r].deqID, vs[r].next)], owns) ∧ unmarkedp(qrl0, ps[r, mk(vs[r].val, vs[r].deqID, vs[r].next)])
Used simplifier rules: ⊦ a ≠ b → (a ∈ st[b, d] ↔ a ∈ st); (s) Used terms: ps, r, mk(vs[r].val, vs[r].deqID, vs[r].next), r0
| ⊦ a ≠ b → st[b, d][a] = st[a] |
| orl + vtail0 ' + qrl0 = rl1 + r ' + vs[r].next ' + rl, ps[vtail0].deqID = None, dom vrvHp = dom prvHp, mk(vs[r].val, None, vs[r].next) = ps[r], owns(r) = None, r0 = r, vs[r].deqID ≠ None, orl ≠ [], r ≠ null, r ≠ vtail0, DMSQLInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, vtail0 ' + qrl0, orl, owns, rvowns), lsf(tid), pcf(tid)), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + vtail0 ' + qrl0, vs, ps, owns), listp(vs[r].next ' + rl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + vtail0 ' + qrl0, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl0, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, r ∈ vs, r ∈ ps, r ∈ qrl0, ¬ dups(orl + qrl0), ¬ dups(orl), ¬ dups(qrl0), ¬ weak?(vs[r].deqID), ¬ r ∈ orl, ¬ vtail0 ∈ qrl0, ¬ vtail0 ∈ 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(qrl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None ∧ unmarkedp(qrl0, vs), vtail = qrl0.last ∨ vtail = (orl + (vtail0 ' + qrl0).butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null ⊦ (r0 ∈ ps → r0 ∈ ps[r, mk(vs[r].val, vs[r].deqID, vs[r].next)]) ∧ ps[r, mk(vs[r].val, vs[r].deqID, vs[r].next)][r0] = ps[r0], listp(orl + vtail0 ' + qrl0, vs, ps[r, mk(vs[r].val, vs[r].deqID, vs[r].next)], owns) ∧ unmarkedp(qrl0, ps[r, mk(vs[r].val, vs[r].deqID, vs[r].next)]) |
orl + vtail0 ' + qrl0 = rl1 + r ' + vs[r].next ' + rl, ps[vtail0].deqID = None, dom vrvHp = dom prvHp, mk(vs[r].val, None, vs[r].next) = ps[r], owns(r) = None, vs[r].deqID ≠ None, orl ≠ [], r ≠ vtail0, r ≠ null, DMSQLInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, vtail0 ' + qrl0, orl, owns, rvowns), lsf(tid), pcf(tid)), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + vtail0 ' + qrl0, vs, ps, owns), listp(vs[r].next ' + rl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + vtail0 ' + qrl0, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl0, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, r ∈ vs, r ∈ ps, r ∈ qrl0, ¬ dups(qrl0), ¬ dups(orl), ¬ dups(orl + qrl0), ¬ weak?(vs[r].deqID), ¬ vtail0 ∈ orl, ¬ vtail0 ∈ qrl0, ¬ r ∈ 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(qrl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None ∧ unmarkedp(qrl0, vs), vtail = qrl0.last ∨ vtail = (orl + (vtail0 ' + qrl0).butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null ⊦ listp(orl + vtail0 ' + qrl0, vs, ps[r, mk(vs[r].val, vs[r].deqID, vs[r].next)], owns) ∧ unmarkedp(qrl0, ps[r, mk(vs[r].val, vs[r].deqID, vs[r].next)])
Used simplifier rules: ⊦ mk(val, opttid, nxt) = mk(val0, opttid0, nxt0) ↔ val = val0 ∧ opttid = opttid0 ∧ nxt = nxt0; (ws) ⊦ a = b → st[b, d][a] = d; (s) ⊦ a ∈ st[a, d]; (s)
| orl + vtail0 ' + qrl0 = rl1 + r ' + vs[r].next ' + rl, ps[vtail0].deqID = None, dom vrvHp = dom prvHp, mk(vs[r].val, None, vs[r].next) = ps[r], owns(r) = None, vs[r].deqID ≠ None, orl ≠ [], r ≠ vtail0, r ≠ null, DMSQLInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, vtail0 ' + qrl0, orl, owns, rvowns), lsf(tid), pcf(tid)), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + vtail0 ' + qrl0, vs, ps, owns), listp(vs[r].next ' + rl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + vtail0 ' + qrl0, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl0, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, r ∈ vs, r ∈ ps, r ∈ qrl0, ¬ dups(qrl0), ¬ dups(orl), ¬ dups(orl + qrl0), ¬ weak?(vs[r].deqID), ¬ vtail0 ∈ orl, ¬ vtail0 ∈ qrl0, ¬ r ∈ 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(qrl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None ∧ unmarkedp(qrl0, vs), vtail = qrl0.last ∨ vtail = (orl + (vtail0 ' + qrl0).butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null ⊦ listp(orl + vtail0 ' + qrl0, vs, ps[r, mk(vs[r].val, vs[r].deqID, vs[r].next)], owns) ∧ unmarkedp(qrl0, ps[r, mk(vs[r].val, vs[r].deqID, vs[r].next)]) |
orl + vtail0 ' + qrl0 = rl1 + r ' + vs[r].next ' + rl, ps[vtail0].deqID = None, dom vrvHp = dom prvHp, mk(vs[r].val, None, vs[r].next) = ps[r], orl = rl0 + vhead0 ', owns(r) = None, vs[r].deqID ≠ None, orl ≠ [], r ≠ vtail0, r ≠ null, DMSQLInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, vtail0 ' + qrl0, orl, owns, rvowns), lsf(tid), pcf(tid)), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(vs[r].next ' + rl, vs, ps, owns), listp(orl + vtail0 ' + qrl0, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nonullRetRefs(orl + vtail0 ' + qrl0, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl0, ps), r ∈ qrl0, r ∈ ps, r ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(qrl0), ¬ dups(orl), ¬ dups(orl + qrl0), ¬ weak?(vs[r].deqID), ¬ vtail0 ∈ orl, ¬ vtail0 ∈ qrl0, ¬ r ∈ 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), vtail = qrl0.last ∨ vtail = (orl + (vtail0 ' + qrl0).butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, vhead0 = vhead ∧ unmarkedp(qrl0, vs) ∨ rl0 ≠ [] ∧ rl0.last = vhead ∧ phead ≠ vhead0 ∧ vs[vtail0].deqID = None ∧ unmarkedp(qrl0, vs) ⊦ listp(orl + vtail0 ' + qrl0, vs, ps[r, mk(vs[r].val, vs[r].deqID, vs[r].next)], owns) ∧ unmarkedp(qrl0, ps[r, mk(vs[r].val, vs[r].deqID, vs[r].next)])
Used simplifier rules: x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: orl, vhead0, y
| orl + vtail0 ' + qrl0 = rl1 + r ' + vs[r].next ' + rl, ps[vtail0].deqID = None, dom vrvHp = dom prvHp, mk(vs[r].val, None, vs[r].next) = ps[r], orl = rl0 + vhead0 ', owns(r) = None, vs[r].deqID ≠ None, orl ≠ [], r ≠ vtail0, r ≠ null, DMSQLInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, vtail0 ' + qrl0, orl, owns, rvowns), lsf(tid), pcf(tid)), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(vs[r].next ' + rl, vs, ps, owns), listp(orl + vtail0 ' + qrl0, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nonullRetRefs(orl + vtail0 ' + qrl0, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl0, ps), r ∈ qrl0, r ∈ ps, r ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(qrl0), ¬ dups(orl), ¬ dups(orl + qrl0), ¬ weak?(vs[r].deqID), ¬ vtail0 ∈ orl, ¬ vtail0 ∈ qrl0, ¬ r ∈ 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), vtail = qrl0.last ∨ vtail = (orl + (vtail0 ' + qrl0).butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, vhead0 = vhead ∧ unmarkedp(qrl0, vs) ∨ rl0 ≠ [] ∧ rl0.last = vhead ∧ phead ≠ vhead0 ∧ vs[vtail0].deqID = None ∧ unmarkedp(qrl0, vs) ⊦ listp(orl + vtail0 ' + qrl0, vs, ps[r, mk(vs[r].val, vs[r].deqID, vs[r].next)], owns) ∧ unmarkedp(qrl0, ps[r, mk(vs[r].val, vs[r].deqID, vs[r].next)]) |
(rl0 + vhead0 ') + ps[vhead0].next ' + qrl0 = rl1 + r ' + vs[r].next ' + rl, ps[ps[vhead0].next].deqID = None, dom vrvHp = dom prvHp, mk(vs[r].val, None, vs[r].next) = ps[r], owns(r) = None, vs[r].deqID ≠ None, ps[vhead0].next ≠ vhead0, r ≠ null, r ≠ ps[vhead0].next, DMSQLInv (mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, ps[vhead0].next ' + qrl0, rl0 + vhead0 ', owns, rvowns), lsf(tid), pcf(tid)), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(vs[r].next ' + rl, vs, ps, owns), listp((rl0 + vhead0 ') + ps[vhead0].next ' + qrl0, vs, ps, owns), markedp(rl0, vs), markedp(rl0, ps), nonullRetRefs((rl0 + vhead0 ') + ps[vhead0].next ' + qrl0, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vhead0].deqID), some?(ps[vhead0].deqID), unmarkedp(qrl0, ps), r ∈ qrl0, r ∈ ps, r ∈ vs, phead ∈ vs, phead ∈ ps, ¬ dups(qrl0), ¬ dups(rl0), ¬ dups(rl0 + qrl0), ¬ weak?(vs[r].deqID), ¬ r ∈ rl0, ¬ ps[vhead0].next ∈ qrl0, ¬ ps[vhead0].next ∈ rl0, ¬ vhead0 ∈ qrl0, ¬ vhead0 ∈ rl0, 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), vtail = qrl0.last ∨ vtail = (vhead0 ' + (ps[vhead0].next ' + qrl0).butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, phead ∈ rl0 ∨ phead = vhead0, vhead0 = vhead ∧ unmarkedp(qrl0, vs) ∨ rl0 ≠ [] ∧ rl0.last = vhead ∧ phead ≠ vhead0 ∧ vs[ps[vhead0].next].deqID = None ∧ unmarkedp(qrl0, vs) ⊦ listp((rl0 + vhead0 ') + ps[vhead0].next ' + qrl0, vs, ps[r, mk(vs[r].val, vs[r].deqID, vs[r].next)], owns) ∧ unmarkedp(qrl0, ps[r, mk(vs[r].val, vs[r].deqID, vs[r].next)])
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] listp-twoin: ⊦ listp(rl + r ' + r0 ' + rl0, vs, ps, owns) → ps[r].next = r0; (forward) from specification DMSQ a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ (x + a ' + y).last = (a ' + y).last; (s) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ dups(x + a ') ↔ a ∈ x ∨ dups(x); (ws) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s) ⊦ x + a ' ≠ []; (s)
| (rl0 + vhead0 ') + ps[vhead0].next ' + qrl0 = rl1 + r ' + vs[r].next ' + rl, ps[ps[vhead0].next].deqID = None, dom vrvHp = dom prvHp, mk(vs[r].val, None, vs[r].next) = ps[r], owns(r) = None, vs[r].deqID ≠ None, ps[vhead0].next ≠ vhead0, r ≠ null, r ≠ ps[vhead0].next, DMSQLInv (mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, ps[vhead0].next ' + qrl0, rl0 + vhead0 ', owns, rvowns), lsf(tid), pcf(tid)), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(vs[r].next ' + rl, vs, ps, owns), listp((rl0 + vhead0 ') + ps[vhead0].next ' + qrl0, vs, ps, owns), markedp(rl0, vs), markedp(rl0, ps), nonullRetRefs((rl0 + vhead0 ') + ps[vhead0].next ' + qrl0, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vhead0].deqID), some?(ps[vhead0].deqID), unmarkedp(qrl0, ps), r ∈ qrl0, r ∈ ps, r ∈ vs, phead ∈ vs, phead ∈ ps, ¬ dups(qrl0), ¬ dups(rl0), ¬ dups(rl0 + qrl0), ¬ weak?(vs[r].deqID), ¬ r ∈ rl0, ¬ ps[vhead0].next ∈ qrl0, ¬ ps[vhead0].next ∈ rl0, ¬ vhead0 ∈ qrl0, ¬ vhead0 ∈ rl0, 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), vtail = qrl0.last ∨ vtail = (vhead0 ' + (ps[vhead0].next ' + qrl0).butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, phead ∈ rl0 ∨ phead = vhead0, vhead0 = vhead ∧ unmarkedp(qrl0, vs) ∨ rl0 ≠ [] ∧ rl0.last = vhead ∧ phead ≠ vhead0 ∧ vs[ps[vhead0].next].deqID = None ∧ unmarkedp(qrl0, vs) ⊦ listp((rl0 + vhead0 ') + ps[vhead0].next ' + qrl0, vs, ps[r, mk(vs[r].val, vs[r].deqID, vs[r].next)], owns) ∧ unmarkedp(qrl0, ps[r, mk(vs[r].val, vs[r].deqID, vs[r].next)]) |
(rl0 + vhead0 ') + ps[vhead0].next ' + qrl0 = rl1 + r ' + vs[r].next ' + rl, ps[ps[vhead0].next].deqID = None, dom vrvHp = dom prvHp, mk(vs[r].val, None, vs[r].next) = ps[r], owns(r) = None, vhead0 = vhead, vs[r].deqID ≠ None, ps[vhead0].next ≠ vhead0, r ≠ null, r ≠ ps[vhead0].next, DMSQLInv (mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, ps[vhead0].next ' + qrl0, rl0 + vhead0 ', owns, rvowns), lsf(tid), pcf(tid)), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((rl0 + vhead0 ') + ps[vhead0].next ' + qrl0, vs, ps, owns), listp(vs[r].next ' + rl, vs, ps, owns), markedp(rl0, ps), markedp(rl0, vs), nonullRetRefs((rl0 + vhead0 ') + ps[vhead0].next ' + qrl0, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vhead0].deqID), some?(vs[vhead0].deqID), unmarkedp(qrl0, ps), unmarkedp(qrl0, vs), phead ∈ ps, phead ∈ vs, r ∈ vs, r ∈ ps, r ∈ qrl0, ¬ dups(qrl0), ¬ dups(rl0), ¬ dups(rl0 + qrl0), ¬ weak?(vs[r].deqID), ¬ r ∈ rl0, ¬ ps[vhead0].next ∈ qrl0, ¬ ps[vhead0].next ∈ rl0, ¬ vhead0 ∈ qrl0, ¬ vhead0 ∈ rl0, 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), phead ∈ rl0 ∨ phead = vhead0, vtail = qrl0.last ∨ vtail = (vhead0 ' + (ps[vhead0].next ' + qrl0).butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null ⊦ listp((rl0 + vhead0 ') + ps[vhead0].next ' + qrl0, vs, ps[r, mk(vs[r].val, vs[r].deqID, vs[r].next)], owns) ∧ unmarkedp(qrl0, ps[r, mk(vs[r].val, vs[r].deqID, vs[r].next)])
(rl0 + vhead0 ') + ps[vhead0].next ' + qrl0 = rl1 + r ' + vs[r].next ' + rl, ps[ps[vhead0].next].deqID = None, vs[ps[vhead0].next].deqID = None, rl0.last = vhead, dom vrvHp = dom prvHp, mk(vs[r].val, None, vs[r].next) = ps[r], owns(r) = None, vs[r].deqID ≠ None, ps[vhead0].next ≠ vhead0, phead ≠ vhead0, r ≠ null, r ≠ ps[vhead0].next, rl0 ≠ [], DMSQLInv (mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, ps[vhead0].next ' + qrl0, rl0 + vhead0 ', owns, rvowns), lsf(tid), pcf(tid)), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((rl0 + vhead0 ') + ps[vhead0].next ' + qrl0, vs, ps, owns), listp(vs[r].next ' + rl, vs, ps, owns), markedp(rl0, ps), markedp(rl0, vs), nonullRetRefs((rl0 + vhead0 ') + ps[vhead0].next ' + qrl0, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vhead0].deqID), some?(vs[vhead0].deqID), unmarkedp(qrl0, ps), unmarkedp(qrl0, vs), phead ∈ ps, phead ∈ vs, r ∈ vs, r ∈ ps, r ∈ qrl0, ¬ dups(qrl0), ¬ dups(rl0), ¬ dups(rl0 + qrl0), ¬ weak?(vs[r].deqID), ¬ r ∈ rl0, ¬ ps[vhead0].next ∈ qrl0, ¬ ps[vhead0].next ∈ rl0, ¬ vhead0 ∈ qrl0, ¬ vhead0 ∈ rl0, 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), phead ∈ rl0 ∨ phead = vhead0, vtail = qrl0.last ∨ vtail = (vhead0 ' + (ps[vhead0].next ' + qrl0).butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null ⊦ listp((rl0 + vhead0 ') + ps[vhead0].next ' + qrl0, vs, ps[r, mk(vs[r].val, vs[r].deqID, vs[r].next)], owns) ∧ unmarkedp(qrl0, ps[r, mk(vs[r].val, vs[r].deqID, vs[r].next)])
| (rl0 + vhead0 ') + ps[vhead0].next ' + qrl0 = rl1 + r ' + vs[r].next ' + rl, ps[ps[vhead0].next].deqID = None, dom vrvHp = dom prvHp, mk(vs[r].val, None, vs[r].next) = ps[r], owns(r) = None, vhead0 = vhead, vs[r].deqID ≠ None, ps[vhead0].next ≠ vhead0, r ≠ null, r ≠ ps[vhead0].next, DMSQLInv (mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, ps[vhead0].next ' + qrl0, rl0 + vhead0 ', owns, rvowns), lsf(tid), pcf(tid)), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((rl0 + vhead0 ') + ps[vhead0].next ' + qrl0, vs, ps, owns), listp(vs[r].next ' + rl, vs, ps, owns), markedp(rl0, ps), markedp(rl0, vs), nonullRetRefs((rl0 + vhead0 ') + ps[vhead0].next ' + qrl0, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vhead0].deqID), some?(vs[vhead0].deqID), unmarkedp(qrl0, ps), unmarkedp(qrl0, vs), phead ∈ ps, phead ∈ vs, r ∈ vs, r ∈ ps, r ∈ qrl0, ¬ dups(qrl0), ¬ dups(rl0), ¬ dups(rl0 + qrl0), ¬ weak?(vs[r].deqID), ¬ r ∈ rl0, ¬ ps[vhead0].next ∈ qrl0, ¬ ps[vhead0].next ∈ rl0, ¬ vhead0 ∈ qrl0, ¬ vhead0 ∈ rl0, 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), phead ∈ rl0 ∨ phead = vhead0, vtail = qrl0.last ∨ vtail = (vhead0 ' + (ps[vhead0].next ' + qrl0).butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null ⊦ listp((rl0 + vhead0 ') + ps[vhead0].next ' + qrl0, vs, ps[r, mk(vs[r].val, vs[r].deqID, vs[r].next)], owns) ∧ unmarkedp(qrl0, ps[r, mk(vs[r].val, vs[r].deqID, vs[r].next)]) |
(rl0 + vhead ') + ps[vhead].next ' + qrl0 = rl1 + r ' + vs[r].next ' + rl, ps[ps[vhead].next].deqID = None, dom vrvHp = dom prvHp, mk(vs[r].val, None, vs[r].next) = ps[r], owns(r) = None, vs[r].deqID ≠ None, ps[vhead].next ≠ vhead, r ≠ null, r ≠ ps[vhead].next, DMSQLInv (mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, ps[vhead].next ' + qrl0, rl0 + vhead ', owns, rvowns), lsf(tid), pcf(tid)), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(vs[r].next ' + rl, vs, ps, owns), listp((rl0 + vhead ') + ps[vhead].next ' + qrl0, vs, ps, owns), markedp(rl0, vs), markedp(rl0, ps), nonullRetRefs((rl0 + vhead ') + ps[vhead].next ' + qrl0, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vhead].deqID), some?(ps[vhead].deqID), unmarkedp(qrl0, vs), unmarkedp(qrl0, ps), r ∈ qrl0, r ∈ ps, r ∈ vs, phead ∈ vs, phead ∈ ps, ¬ dups(qrl0), ¬ dups(rl0), ¬ dups(rl0 + qrl0), ¬ weak?(vs[r].deqID), ¬ r ∈ rl0, ¬ ps[vhead].next ∈ qrl0, ¬ ps[vhead].next ∈ rl0, ¬ vhead ∈ qrl0, ¬ vhead ∈ rl0, 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), vtail = qrl0.last ∨ vtail = (vhead ' + (ps[vhead].next ' + qrl0).butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, phead ∈ rl0 ∨ phead = vhead ⊦ listp((rl0 + vhead ') + ps[vhead].next ' + qrl0, vs, ps[r, mk(vs[r].val, vs[r].deqID, vs[r].next)], owns) ∧ unmarkedp(qrl0, ps[r, mk(vs[r].val, vs[r].deqID, vs[r].next)])
| (rl0 + vhead ') + ps[vhead].next ' + qrl0 = rl1 + r ' + vs[r].next ' + rl, ps[ps[vhead].next].deqID = None, dom vrvHp = dom prvHp, mk(vs[r].val, None, vs[r].next) = ps[r], owns(r) = None, vs[r].deqID ≠ None, ps[vhead].next ≠ vhead, r ≠ null, r ≠ ps[vhead].next, DMSQLInv (mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, ps[vhead].next ' + qrl0, rl0 + vhead ', owns, rvowns), lsf(tid), pcf(tid)), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(vs[r].next ' + rl, vs, ps, owns), listp((rl0 + vhead ') + ps[vhead].next ' + qrl0, vs, ps, owns), markedp(rl0, vs), markedp(rl0, ps), nonullRetRefs((rl0 + vhead ') + ps[vhead].next ' + qrl0, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vhead].deqID), some?(ps[vhead].deqID), unmarkedp(qrl0, vs), unmarkedp(qrl0, ps), r ∈ qrl0, r ∈ ps, r ∈ vs, phead ∈ vs, phead ∈ ps, ¬ dups(qrl0), ¬ dups(rl0), ¬ dups(rl0 + qrl0), ¬ weak?(vs[r].deqID), ¬ r ∈ rl0, ¬ ps[vhead].next ∈ qrl0, ¬ ps[vhead].next ∈ rl0, ¬ vhead ∈ qrl0, ¬ vhead ∈ rl0, 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), vtail = qrl0.last ∨ vtail = (vhead ' + (ps[vhead].next ' + qrl0).butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, phead ∈ rl0 ∨ phead = vhead ⊦ listp((rl0 + vhead ') + ps[vhead].next ' + qrl0, vs, ps[r, mk(vs[r].val, vs[r].deqID, vs[r].next)], owns) ∧ unmarkedp(qrl0, ps[r, mk(vs[r].val, vs[r].deqID, vs[r].next)]) |
⊦ unmarkedp(rl, vs) ↔ (∀ r. r ∈ rl → vs[r].deqID = None)
(rl0 + vhead ') + ps[vhead].next ' + qrl0 = rl1 + r ' + vs[r].next ' + rl, ps[ps[vhead].next].deqID = None, dom vrvHp = dom prvHp, mk(vs[r].val, None, vs[r].next) = ps[r], owns(r) = None, vs[r].deqID ≠ None, ps[vhead].next ≠ vhead, r ≠ null, r ≠ ps[vhead].next, DMSQLInv (mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, ps[vhead].next ' + qrl0, rl0 + vhead ', owns, rvowns), lsf(tid), pcf(tid)), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((rl0 + vhead ') + ps[vhead].next ' + qrl0, vs, ps, owns), listp(vs[r].next ' + rl, vs, ps, owns), markedp(rl0, ps), markedp(rl0, vs), nonullRetRefs((rl0 + vhead ') + ps[vhead].next ' + qrl0, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vhead].deqID), some?(vs[vhead].deqID), unmarkedp(qrl0, ps), phead ∈ ps, phead ∈ vs, r ∈ vs, r ∈ ps, r ∈ qrl0, ¬ dups(qrl0), ¬ dups(rl0), ¬ dups(rl0 + qrl0), ¬ weak?(vs[r].deqID), ¬ r ∈ rl0, ¬ ps[vhead].next ∈ qrl0, ¬ ps[vhead].next ∈ rl0, ¬ vhead ∈ qrl0, ¬ vhead ∈ rl0, 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), ∀ r. r ∈ qrl0 → vs[r].deqID = None, phead ∈ rl0 ∨ phead = vhead, vtail = qrl0.last ∨ vtail = (vhead ' + (ps[vhead].next ' + qrl0).butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null ⊦ listp((rl0 + vhead ') + ps[vhead].next ' + qrl0, vs, ps[r, mk(vs[r].val, vs[r].deqID, vs[r].next)], owns) ∧ unmarkedp(qrl0, ps[r, mk(vs[r].val, vs[r].deqID, vs[r].next)])
Used terms: qrl0, vs
| ⊦ unmarkedp(rl, vs) ↔ (∀ r. r ∈ rl → vs[r].deqID = None) |
| (rl0 + vhead ') + ps[vhead].next ' + qrl0 = rl1 + r ' + vs[r].next ' + rl, ps[ps[vhead].next].deqID = None, dom vrvHp = dom prvHp, mk(vs[r].val, None, vs[r].next) = ps[r], owns(r) = None, vs[r].deqID ≠ None, ps[vhead].next ≠ vhead, r ≠ null, r ≠ ps[vhead].next, DMSQLInv (mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, ps[vhead].next ' + qrl0, rl0 + vhead ', owns, rvowns), lsf(tid), pcf(tid)), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((rl0 + vhead ') + ps[vhead].next ' + qrl0, vs, ps, owns), listp(vs[r].next ' + rl, vs, ps, owns), markedp(rl0, ps), markedp(rl0, vs), nonullRetRefs((rl0 + vhead ') + ps[vhead].next ' + qrl0, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vhead].deqID), some?(vs[vhead].deqID), unmarkedp(qrl0, ps), phead ∈ ps, phead ∈ vs, r ∈ vs, r ∈ ps, r ∈ qrl0, ¬ dups(qrl0), ¬ dups(rl0), ¬ dups(rl0 + qrl0), ¬ weak?(vs[r].deqID), ¬ r ∈ rl0, ¬ ps[vhead].next ∈ qrl0, ¬ ps[vhead].next ∈ rl0, ¬ vhead ∈ qrl0, ¬ vhead ∈ rl0, 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), ∀ r. r ∈ qrl0 → vs[r].deqID = None, phead ∈ rl0 ∨ phead = vhead, vtail = qrl0.last ∨ vtail = (vhead ' + (ps[vhead].next ' + qrl0).butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null ⊦ listp((rl0 + vhead ') + ps[vhead].next ' + qrl0, vs, ps[r, mk(vs[r].val, vs[r].deqID, vs[r].next)], owns) ∧ unmarkedp(qrl0, ps[r, mk(vs[r].val, vs[r].deqID, vs[r].next)]) |
Used terms: r
| (rl0 + vhead0 ') + ps[vhead0].next ' + qrl0 = rl1 + r ' + vs[r].next ' + rl, ps[ps[vhead0].next].deqID = None, vs[ps[vhead0].next].deqID = None, rl0.last = vhead, dom vrvHp = dom prvHp, mk(vs[r].val, None, vs[r].next) = ps[r], owns(r) = None, vs[r].deqID ≠ None, ps[vhead0].next ≠ vhead0, phead ≠ vhead0, r ≠ null, r ≠ ps[vhead0].next, rl0 ≠ [], DMSQLInv (mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, ps[vhead0].next ' + qrl0, rl0 + vhead0 ', owns, rvowns), lsf(tid), pcf(tid)), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((rl0 + vhead0 ') + ps[vhead0].next ' + qrl0, vs, ps, owns), listp(vs[r].next ' + rl, vs, ps, owns), markedp(rl0, ps), markedp(rl0, vs), nonullRetRefs((rl0 + vhead0 ') + ps[vhead0].next ' + qrl0, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vhead0].deqID), some?(vs[vhead0].deqID), unmarkedp(qrl0, ps), unmarkedp(qrl0, vs), phead ∈ ps, phead ∈ vs, r ∈ vs, r ∈ ps, r ∈ qrl0, ¬ dups(qrl0), ¬ dups(rl0), ¬ dups(rl0 + qrl0), ¬ weak?(vs[r].deqID), ¬ r ∈ rl0, ¬ ps[vhead0].next ∈ qrl0, ¬ ps[vhead0].next ∈ rl0, ¬ vhead0 ∈ qrl0, ¬ vhead0 ∈ rl0, 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), phead ∈ rl0 ∨ phead = vhead0, vtail = qrl0.last ∨ vtail = (vhead0 ' + (ps[vhead0].next ' + qrl0).butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null ⊦ listp((rl0 + vhead0 ') + ps[vhead0].next ' + qrl0, vs, ps[r, mk(vs[r].val, vs[r].deqID, vs[r].next)], owns) ∧ unmarkedp(qrl0, ps[r, mk(vs[r].val, vs[r].deqID, vs[r].next)]) |
(rl0 + vhead0 ') + ps[vhead0].next ' + qrl0 = rl1 + r ' + vs[r].next ' + rl, vs[ps[vhead0].next].deqID = None, ps[ps[vhead0].next].deqID = None, dom vrvHp = dom prvHp, mk(vs[r].val, None, vs[r].next) = ps[r], owns(r) = None, vs[r].deqID ≠ None, ps[vhead0].next ≠ vhead0, phead ≠ vhead0, r ≠ null, r ≠ ps[vhead0].next, rl0 ≠ [], DMSQLInv (mkgs(ps, vs, phead, rl0.last, vtail, vretRefs, pretRefs, vrvHp, prvHp, ps[vhead0].next ' + qrl0, rl0 + vhead0 ', owns, rvowns), lsf(tid), pcf(tid)), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(vs[r].next ' + rl, vs, ps, owns), listp((rl0 + vhead0 ') + ps[vhead0].next ' + qrl0, vs, ps, owns), markedp(rl0, vs), markedp(rl0, ps), nonullRetRefs((rl0 + vhead0 ') + ps[vhead0].next ' + qrl0, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vhead0].deqID), some?(ps[vhead0].deqID), unmarkedp(qrl0, vs), unmarkedp(qrl0, ps), r ∈ qrl0, r ∈ ps, r ∈ vs, phead ∈ vs, phead ∈ ps, phead ∈ rl0, ¬ dups(qrl0), ¬ dups(rl0), ¬ dups(rl0 + qrl0), ¬ weak?(vs[r].deqID), ¬ r ∈ rl0, ¬ ps[vhead0].next ∈ qrl0, ¬ ps[vhead0].next ∈ rl0, ¬ vhead0 ∈ qrl0, ¬ vhead0 ∈ rl0, vs[rl0.last].next ≠ null ∧ vs[vs[rl0.last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[rl0.last].next].deqID.tid)) = Claimed(vs[vs[rl0.last].next].deqID.tid, vs[vs[rl0.last].next].val), vtail = qrl0.last ∨ vtail = (vhead0 ' + (ps[vhead0].next ' + qrl0).butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null ⊦ listp((rl0 + vhead0 ') + ps[vhead0].next ' + qrl0, vs, ps[r, mk(vs[r].val, vs[r].deqID, vs[r].next)], owns) ∧ unmarkedp(qrl0, ps[r, mk(vs[r].val, vs[r].deqID, vs[r].next)])
| (rl0 + vhead0 ') + ps[vhead0].next ' + qrl0 = rl1 + r ' + vs[r].next ' + rl, vs[ps[vhead0].next].deqID = None, ps[ps[vhead0].next].deqID = None, dom vrvHp = dom prvHp, mk(vs[r].val, None, vs[r].next) = ps[r], owns(r) = None, vs[r].deqID ≠ None, ps[vhead0].next ≠ vhead0, phead ≠ vhead0, r ≠ null, r ≠ ps[vhead0].next, rl0 ≠ [], DMSQLInv (mkgs(ps, vs, phead, rl0.last, vtail, vretRefs, pretRefs, vrvHp, prvHp, ps[vhead0].next ' + qrl0, rl0 + vhead0 ', owns, rvowns), lsf(tid), pcf(tid)), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(vs[r].next ' + rl, vs, ps, owns), listp((rl0 + vhead0 ') + ps[vhead0].next ' + qrl0, vs, ps, owns), markedp(rl0, vs), markedp(rl0, ps), nonullRetRefs((rl0 + vhead0 ') + ps[vhead0].next ' + qrl0, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vhead0].deqID), some?(ps[vhead0].deqID), unmarkedp(qrl0, vs), unmarkedp(qrl0, ps), r ∈ qrl0, r ∈ ps, r ∈ vs, phead ∈ vs, phead ∈ ps, phead ∈ rl0, ¬ dups(qrl0), ¬ dups(rl0), ¬ dups(rl0 + qrl0), ¬ weak?(vs[r].deqID), ¬ r ∈ rl0, ¬ ps[vhead0].next ∈ qrl0, ¬ ps[vhead0].next ∈ rl0, ¬ vhead0 ∈ qrl0, ¬ vhead0 ∈ rl0, vs[rl0.last].next ≠ null ∧ vs[vs[rl0.last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[rl0.last].next].deqID.tid)) = Claimed(vs[vs[rl0.last].next].deqID.tid, vs[vs[rl0.last].next].val), vtail = qrl0.last ∨ vtail = (vhead0 ' + (ps[vhead0].next ' + qrl0).butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null ⊦ listp((rl0 + vhead0 ') + ps[vhead0].next ' + qrl0, vs, ps[r, mk(vs[r].val, vs[r].deqID, vs[r].next)], owns) ∧ unmarkedp(qrl0, ps[r, mk(vs[r].val, vs[r].deqID, vs[r].next)]) |
⊦ unmarkedp(rl, vs) ↔ (∀ r. r ∈ rl → vs[r].deqID = None)
(rl0 + vhead0 ') + ps[vhead0].next ' + qrl0 = rl1 + r ' + vs[r].next ' + rl, ps[ps[vhead0].next].deqID = None, vs[ps[vhead0].next].deqID = None, dom vrvHp = dom prvHp, mk(vs[r].val, None, vs[r].next) = ps[r], owns(r) = None, vs[r].deqID ≠ None, ps[vhead0].next ≠ vhead0, phead ≠ vhead0, r ≠ null, r ≠ ps[vhead0].next, rl0 ≠ [], DMSQLInv (mkgs(ps, vs, phead, rl0.last, vtail, vretRefs, pretRefs, vrvHp, prvHp, ps[vhead0].next ' + qrl0, rl0 + vhead0 ', owns, rvowns), lsf(tid), pcf(tid)), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((rl0 + vhead0 ') + ps[vhead0].next ' + qrl0, vs, ps, owns), listp(vs[r].next ' + rl, vs, ps, owns), markedp(rl0, ps), markedp(rl0, vs), nonullRetRefs((rl0 + vhead0 ') + ps[vhead0].next ' + qrl0, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vhead0].deqID), some?(vs[vhead0].deqID), unmarkedp(qrl0, ps), phead ∈ rl0, phead ∈ ps, phead ∈ vs, r ∈ vs, r ∈ ps, r ∈ qrl0, ¬ dups(qrl0), ¬ dups(rl0), ¬ dups(rl0 + qrl0), ¬ weak?(vs[r].deqID), ¬ r ∈ rl0, ¬ ps[vhead0].next ∈ qrl0, ¬ ps[vhead0].next ∈ rl0, ¬ vhead0 ∈ qrl0, ¬ vhead0 ∈ rl0, vs[rl0.last].next ≠ null ∧ vs[vs[rl0.last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[rl0.last].next].deqID.tid)) = Claimed(vs[vs[rl0.last].next].deqID.tid, vs[vs[rl0.last].next].val), ∀ r. r ∈ qrl0 → vs[r].deqID = None, vtail = qrl0.last ∨ vtail = (vhead0 ' + (ps[vhead0].next ' + qrl0).butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null ⊦ listp((rl0 + vhead0 ') + ps[vhead0].next ' + qrl0, vs, ps[r, mk(vs[r].val, vs[r].deqID, vs[r].next)], owns) ∧ unmarkedp(qrl0, ps[r, mk(vs[r].val, vs[r].deqID, vs[r].next)])
Used terms: qrl0, vs
| ⊦ unmarkedp(rl, vs) ↔ (∀ r. r ∈ rl → vs[r].deqID = None) |
| (rl0 + vhead0 ') + ps[vhead0].next ' + qrl0 = rl1 + r ' + vs[r].next ' + rl, ps[ps[vhead0].next].deqID = None, vs[ps[vhead0].next].deqID = None, dom vrvHp = dom prvHp, mk(vs[r].val, None, vs[r].next) = ps[r], owns(r) = None, vs[r].deqID ≠ None, ps[vhead0].next ≠ vhead0, phead ≠ vhead0, r ≠ null, r ≠ ps[vhead0].next, rl0 ≠ [], DMSQLInv (mkgs(ps, vs, phead, rl0.last, vtail, vretRefs, pretRefs, vrvHp, prvHp, ps[vhead0].next ' + qrl0, rl0 + vhead0 ', owns, rvowns), lsf(tid), pcf(tid)), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((rl0 + vhead0 ') + ps[vhead0].next ' + qrl0, vs, ps, owns), listp(vs[r].next ' + rl, vs, ps, owns), markedp(rl0, ps), markedp(rl0, vs), nonullRetRefs((rl0 + vhead0 ') + ps[vhead0].next ' + qrl0, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vhead0].deqID), some?(vs[vhead0].deqID), unmarkedp(qrl0, ps), phead ∈ rl0, phead ∈ ps, phead ∈ vs, r ∈ vs, r ∈ ps, r ∈ qrl0, ¬ dups(qrl0), ¬ dups(rl0), ¬ dups(rl0 + qrl0), ¬ weak?(vs[r].deqID), ¬ r ∈ rl0, ¬ ps[vhead0].next ∈ qrl0, ¬ ps[vhead0].next ∈ rl0, ¬ vhead0 ∈ qrl0, ¬ vhead0 ∈ rl0, vs[rl0.last].next ≠ null ∧ vs[vs[rl0.last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[rl0.last].next].deqID.tid)) = Claimed(vs[vs[rl0.last].next].deqID.tid, vs[vs[rl0.last].next].val), ∀ r. r ∈ qrl0 → vs[r].deqID = None, vtail = qrl0.last ∨ vtail = (vhead0 ' + (ps[vhead0].next ' + qrl0).butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null ⊦ listp((rl0 + vhead0 ') + ps[vhead0].next ' + qrl0, vs, ps[r, mk(vs[r].val, vs[r].deqID, vs[r].next)], owns) ∧ unmarkedp(qrl0, ps[r, mk(vs[r].val, vs[r].deqID, vs[r].next)]) |
Used terms: r
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.