| ⊦ ( gs.owns(ls.node) = Some(ls.tid) ∧ ( 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)) ∧ (ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ ¬ ls.success ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ pre(gs, ls, E2, a) ∧ pcstepf(gs, ls, E2, a) = E3 → gstepf(gs, ls, E2, a).owns(lstepf(gs, ls, E2, a).node) = Some(lstepf(gs, ls, E2, a).tid) ∧ ( listp(gstepf(gs, ls, E2, a).orl + gstepf(gs, ls, E2, a).qrl, gstepf(gs, ls, E2, a).vs, gstepf(gs, ls, E2, a).ps, gstepf(gs, ls, E2, a).owns) ∧ ¬ dups(gstepf(gs, ls, E2, a).orl + gstepf(gs, ls, E2, a).qrl) ∧ markedp(gstepf(gs, ls, E2, a).orl, gstepf(gs, ls, E2, a).ps) ∧ markedp(gstepf(gs, ls, E2, a).orl, gstepf(gs, ls, E2, a).vs) ∧ unmarkedp(gstepf(gs, ls, E2, a).qrl, gstepf(gs, ls, E2, a).ps) ∧ gstepf(gs, ls, E2, a).orl ≠ [] ∧ gstepf(gs, ls, E2, a).phead ∈ gstepf(gs, ls, E2, a).orl ∧ rvownerok(gstepf(gs, ls, E2, a).vretRefs, gstepf(gs, ls, E2, a).vrvHp, gstepf(gs, ls, E2, a).rvowns) ∧ allocrv(gstepf(gs, ls, E2, a).vretRefs, gstepf(gs, ls, E2, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, E2, a).orl + gstepf(gs, ls, E2, a).qrl, gstepf(gs, ls, E2, a).vs, gstepf(gs, ls, E2, a).vretRefs, gstepf(gs, ls, E2, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, E2, a).pretRefs, gstepf(gs, ls, E2, a).prvHp, gstepf(gs, ls, E2, a).rvowns) ∧ allocrv(gstepf(gs, ls, E2, a).pretRefs, gstepf(gs, ls, E2, a).prvHp) ∧ dom gstepf(gs, ls, E2, a).vrvHp = dom gstepf(gs, ls, E2, a).prvHp ∧ ( gstepf(gs, ls, E2, a).vs[gstepf(gs, ls, E2, a).vhead].next ≠ null ∧ gstepf(gs, ls, E2, a).vs[gstepf(gs, ls, E2, a).vs[gstepf(gs, ls, E2, a).vhead].next].deqID ≠ None → gstepf(gs, ls, E2, a).rvowns (gstepf(gs, ls, E2, a).vretRefs(gstepf(gs, ls, E2, a).vs[gstepf(gs, ls, E2, a).vs[gstepf(gs, ls, E2, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, E2, a).vs[gstepf(gs, ls, E2, a).vs[gstepf(gs, ls, E2, a).vhead].next].deqID.tid, gstepf(gs, ls, E2, a).vs[gstepf(gs, ls, E2, a).vs[gstepf(gs, ls, E2, a).vhead].next].val)) ∧ ( gstepf(gs, ls, E2, a).orl.last = gstepf(gs, ls, E2, a).vhead ∧ (gstepf(gs, ls, E2, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, E2, a).qrl.tail, gstepf(gs, ls, E2, a).vs)) ∨ gstepf(gs, ls, E2, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, E2, a).orl.butlast.last = gstepf(gs, ls, E2, a).vhead ∧ gstepf(gs, ls, E2, a).phead ≠ gstepf(gs, ls, E2, a).orl.last ∧ unmarkedp(gstepf(gs, ls, E2, a).qrl, gstepf(gs, ls, E2, a).vs)) ∧ ( gstepf(gs, ls, E2, a).vtail = (gstepf(gs, ls, E2, a).orl + gstepf(gs, ls, E2, a).qrl).last ∨ gstepf(gs, ls, E2, a).qrl ≠ [] ∧ gstepf(gs, ls, E2, a).vtail = (gstepf(gs, ls, E2, a).orl + gstepf(gs, ls, E2, a).qrl.butlast).last ∧ gstepf(gs, ls, E2, a).vs[gstepf(gs, ls, E2, a).qrl.last].deqID = None ∧ gstepf(gs, ls, E2, a).vs[(gstepf(gs, ls, E2, a).orl + gstepf(gs, ls, E2, a).qrl).last].next = null)) ∧ ( lstepf(gs, ls, E2, a).node ∈ gstepf(gs, ls, E2, a).ps ∧ lstepf(gs, ls, E2, a).node ∈ gstepf(gs, ls, E2, a).vs ∧ lstepf(gs, ls, E2, a).node ≠ null ∧ ¬ lstepf(gs, ls, E2, a).node ∈ gstepf(gs, ls, E2, a).orl ∧ ¬ lstepf(gs, ls, E2, a).node ∈ gstepf(gs, ls, E2, a).qrl) ∧ gstepf(gs, ls, E2, a).vs[lstepf(gs, ls, E2, a).node] = mk(lstepf(gs, ls, E2, a).value, None, null) ∧ ¬ lstepf(gs, ls, E2, a).success ∧ nextnottid(lstepf(gs, ls, E2, a).tid, gstepf(gs, ls, E2, a).vhead, gstepf(gs, ls, E2, a).vs) ∧ noid(lstepf(gs, ls, E2, a).tid, gstepf(gs, ls, E2, a).orl + gstepf(gs, ls, E2, a).qrl, gstepf(gs, ls, E2, a).vhead, gstepf(gs, ls, E2, a).vs) ∧ oneowns(lstepf(gs, ls, E2, a).tid, lstepf(gs, ls, E2, a).node, gstepf(gs, ls, E2, a).owns, gstepf(gs, ls, E2, a).vs, gstepf(gs, ls, E2, a).ps) |
gs.owns(ls.node) = Some(ls.tid), dom gs.vrvHp = dom gs.prvHp, pcstepf(gs, ls, E2, a) = E3, ls.node ≠ null, gs.orl ≠ [], 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), nextnottid(ls.tid, gs.vhead, gs.vs), noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps), pre(gs, ls, E2, a), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.orl, ls.node ∈ gs.ps, ls.node ∈ gs.vs, ¬ ls.success, ¬ dups(gs.orl + gs.qrl), ¬ ls.node ∈ gs.qrl, ¬ ls.node ∈ gs.orl, 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 ⊦ gstepf(gs, ls, E2, a).owns(lstepf(gs, ls, E2, a).node) = Some(lstepf(gs, ls, E2, a).tid) ∧ ( listp(gstepf(gs, ls, E2, a).orl + gstepf(gs, ls, E2, a).qrl, gstepf(gs, ls, E2, a).vs, gstepf(gs, ls, E2, a).ps, gstepf(gs, ls, E2, a).owns) ∧ ¬ dups(gstepf(gs, ls, E2, a).orl + gstepf(gs, ls, E2, a).qrl) ∧ markedp(gstepf(gs, ls, E2, a).orl, gstepf(gs, ls, E2, a).ps) ∧ markedp(gstepf(gs, ls, E2, a).orl, gstepf(gs, ls, E2, a).vs) ∧ unmarkedp(gstepf(gs, ls, E2, a).qrl, gstepf(gs, ls, E2, a).ps) ∧ gstepf(gs, ls, E2, a).orl ≠ [] ∧ gstepf(gs, ls, E2, a).phead ∈ gstepf(gs, ls, E2, a).orl ∧ rvownerok(gstepf(gs, ls, E2, a).vretRefs, gstepf(gs, ls, E2, a).vrvHp, gstepf(gs, ls, E2, a).rvowns) ∧ allocrv(gstepf(gs, ls, E2, a).vretRefs, gstepf(gs, ls, E2, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, E2, a).orl + gstepf(gs, ls, E2, a).qrl, gstepf(gs, ls, E2, a).vs, gstepf(gs, ls, E2, a).vretRefs, gstepf(gs, ls, E2, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, E2, a).pretRefs, gstepf(gs, ls, E2, a).prvHp, gstepf(gs, ls, E2, a).rvowns) ∧ allocrv(gstepf(gs, ls, E2, a).pretRefs, gstepf(gs, ls, E2, a).prvHp) ∧ dom gstepf(gs, ls, E2, a).vrvHp = dom gstepf(gs, ls, E2, a).prvHp ∧ ( gstepf(gs, ls, E2, a).vs[gstepf(gs, ls, E2, a).vhead].next ≠ null ∧ gstepf(gs, ls, E2, a).vs[gstepf(gs, ls, E2, a).vs[gstepf(gs, ls, E2, a).vhead].next].deqID ≠ None → gstepf(gs, ls, E2, a).rvowns (gstepf(gs, ls, E2, a).vretRefs(gstepf(gs, ls, E2, a).vs[gstepf(gs, ls, E2, a).vs[gstepf(gs, ls, E2, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, E2, a).vs[gstepf(gs, ls, E2, a).vs[gstepf(gs, ls, E2, a).vhead].next].deqID.tid, gstepf(gs, ls, E2, a).vs[gstepf(gs, ls, E2, a).vs[gstepf(gs, ls, E2, a).vhead].next].val)) ∧ ( gstepf(gs, ls, E2, a).orl.last = gstepf(gs, ls, E2, a).vhead ∧ (gstepf(gs, ls, E2, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, E2, a).qrl.tail, gstepf(gs, ls, E2, a).vs)) ∨ gstepf(gs, ls, E2, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, E2, a).orl.butlast.last = gstepf(gs, ls, E2, a).vhead ∧ gstepf(gs, ls, E2, a).phead ≠ gstepf(gs, ls, E2, a).orl.last ∧ unmarkedp(gstepf(gs, ls, E2, a).qrl, gstepf(gs, ls, E2, a).vs)) ∧ ( gstepf(gs, ls, E2, a).vtail = (gstepf(gs, ls, E2, a).orl + gstepf(gs, ls, E2, a).qrl).last ∨ gstepf(gs, ls, E2, a).qrl ≠ [] ∧ gstepf(gs, ls, E2, a).vtail = (gstepf(gs, ls, E2, a).orl + gstepf(gs, ls, E2, a).qrl.butlast).last ∧ gstepf(gs, ls, E2, a).vs[gstepf(gs, ls, E2, a).qrl.last].deqID = None ∧ gstepf(gs, ls, E2, a).vs[(gstepf(gs, ls, E2, a).orl + gstepf(gs, ls, E2, a).qrl).last].next = null)) ∧ ( lstepf(gs, ls, E2, a).node ∈ gstepf(gs, ls, E2, a).ps ∧ lstepf(gs, ls, E2, a).node ∈ gstepf(gs, ls, E2, a).vs ∧ lstepf(gs, ls, E2, a).node ≠ null ∧ ¬ lstepf(gs, ls, E2, a).node ∈ gstepf(gs, ls, E2, a).orl ∧ ¬ lstepf(gs, ls, E2, a).node ∈ gstepf(gs, ls, E2, a).qrl) ∧ gstepf(gs, ls, E2, a).vs[lstepf(gs, ls, E2, a).node] = mk(lstepf(gs, ls, E2, a).value, None, null) ∧ ¬ lstepf(gs, ls, E2, a).success ∧ nextnottid(lstepf(gs, ls, E2, a).tid, gstepf(gs, ls, E2, a).vhead, gstepf(gs, ls, E2, a).vs) ∧ noid(lstepf(gs, ls, E2, a).tid, gstepf(gs, ls, E2, a).orl + gstepf(gs, ls, E2, a).qrl, gstepf(gs, ls, E2, a).vhead, gstepf(gs, ls, E2, a).vs) ∧ oneowns(lstepf(gs, ls, E2, a).tid, lstepf(gs, ls, E2, a).node, gstepf(gs, ls, E2, a).owns, gstepf(gs, ls, E2, a).vs, gstepf(gs, ls, E2, a).ps)
| gs.owns(ls.node) = Some(ls.tid), dom gs.vrvHp = dom gs.prvHp, pcstepf(gs, ls, E2, a) = E3, ls.node ≠ null, gs.orl ≠ [], 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), nextnottid(ls.tid, gs.vhead, gs.vs), noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps), pre(gs, ls, E2, a), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.orl, ls.node ∈ gs.ps, ls.node ∈ gs.vs, ¬ ls.success, ¬ dups(gs.orl + gs.qrl), ¬ ls.node ∈ gs.qrl, ¬ ls.node ∈ gs.orl, 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 ⊦ gstepf(gs, ls, E2, a).owns(lstepf(gs, ls, E2, a).node) = Some(lstepf(gs, ls, E2, a).tid) ∧ ( listp(gstepf(gs, ls, E2, a).orl + gstepf(gs, ls, E2, a).qrl, gstepf(gs, ls, E2, a).vs, gstepf(gs, ls, E2, a).ps, gstepf(gs, ls, E2, a).owns) ∧ ¬ dups(gstepf(gs, ls, E2, a).orl + gstepf(gs, ls, E2, a).qrl) ∧ markedp(gstepf(gs, ls, E2, a).orl, gstepf(gs, ls, E2, a).ps) ∧ markedp(gstepf(gs, ls, E2, a).orl, gstepf(gs, ls, E2, a).vs) ∧ unmarkedp(gstepf(gs, ls, E2, a).qrl, gstepf(gs, ls, E2, a).ps) ∧ gstepf(gs, ls, E2, a).orl ≠ [] ∧ gstepf(gs, ls, E2, a).phead ∈ gstepf(gs, ls, E2, a).orl ∧ rvownerok(gstepf(gs, ls, E2, a).vretRefs, gstepf(gs, ls, E2, a).vrvHp, gstepf(gs, ls, E2, a).rvowns) ∧ allocrv(gstepf(gs, ls, E2, a).vretRefs, gstepf(gs, ls, E2, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, E2, a).orl + gstepf(gs, ls, E2, a).qrl, gstepf(gs, ls, E2, a).vs, gstepf(gs, ls, E2, a).vretRefs, gstepf(gs, ls, E2, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, E2, a).pretRefs, gstepf(gs, ls, E2, a).prvHp, gstepf(gs, ls, E2, a).rvowns) ∧ allocrv(gstepf(gs, ls, E2, a).pretRefs, gstepf(gs, ls, E2, a).prvHp) ∧ dom gstepf(gs, ls, E2, a).vrvHp = dom gstepf(gs, ls, E2, a).prvHp ∧ ( gstepf(gs, ls, E2, a).vs[gstepf(gs, ls, E2, a).vhead].next ≠ null ∧ gstepf(gs, ls, E2, a).vs[gstepf(gs, ls, E2, a).vs[gstepf(gs, ls, E2, a).vhead].next].deqID ≠ None → gstepf(gs, ls, E2, a).rvowns (gstepf(gs, ls, E2, a).vretRefs(gstepf(gs, ls, E2, a).vs[gstepf(gs, ls, E2, a).vs[gstepf(gs, ls, E2, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, E2, a).vs[gstepf(gs, ls, E2, a).vs[gstepf(gs, ls, E2, a).vhead].next].deqID.tid, gstepf(gs, ls, E2, a).vs[gstepf(gs, ls, E2, a).vs[gstepf(gs, ls, E2, a).vhead].next].val)) ∧ ( gstepf(gs, ls, E2, a).orl.last = gstepf(gs, ls, E2, a).vhead ∧ (gstepf(gs, ls, E2, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, E2, a).qrl.tail, gstepf(gs, ls, E2, a).vs)) ∨ gstepf(gs, ls, E2, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, E2, a).orl.butlast.last = gstepf(gs, ls, E2, a).vhead ∧ gstepf(gs, ls, E2, a).phead ≠ gstepf(gs, ls, E2, a).orl.last ∧ unmarkedp(gstepf(gs, ls, E2, a).qrl, gstepf(gs, ls, E2, a).vs)) ∧ ( gstepf(gs, ls, E2, a).vtail = (gstepf(gs, ls, E2, a).orl + gstepf(gs, ls, E2, a).qrl).last ∨ gstepf(gs, ls, E2, a).qrl ≠ [] ∧ gstepf(gs, ls, E2, a).vtail = (gstepf(gs, ls, E2, a).orl + gstepf(gs, ls, E2, a).qrl.butlast).last ∧ gstepf(gs, ls, E2, a).vs[gstepf(gs, ls, E2, a).qrl.last].deqID = None ∧ gstepf(gs, ls, E2, a).vs[(gstepf(gs, ls, E2, a).orl + gstepf(gs, ls, E2, a).qrl).last].next = null)) ∧ ( lstepf(gs, ls, E2, a).node ∈ gstepf(gs, ls, E2, a).ps ∧ lstepf(gs, ls, E2, a).node ∈ gstepf(gs, ls, E2, a).vs ∧ lstepf(gs, ls, E2, a).node ≠ null ∧ ¬ lstepf(gs, ls, E2, a).node ∈ gstepf(gs, ls, E2, a).orl ∧ ¬ lstepf(gs, ls, E2, a).node ∈ gstepf(gs, ls, E2, a).qrl) ∧ gstepf(gs, ls, E2, a).vs[lstepf(gs, ls, E2, a).node] = mk(lstepf(gs, ls, E2, a).value, None, null) ∧ ¬ lstepf(gs, ls, E2, a).success ∧ nextnottid(lstepf(gs, ls, E2, a).tid, gstepf(gs, ls, E2, a).vhead, gstepf(gs, ls, E2, a).vs) ∧ noid(lstepf(gs, ls, E2, a).tid, gstepf(gs, ls, E2, a).orl + gstepf(gs, ls, E2, a).qrl, gstepf(gs, ls, E2, a).vhead, gstepf(gs, ls, E2, a).vs) ∧ oneowns(lstepf(gs, ls, E2, a).tid, lstepf(gs, ls, E2, a).node, gstepf(gs, ls, E2, a).owns, gstepf(gs, ls, E2, a).vs, gstepf(gs, ls, E2, a).ps) |
gs.owns(ls.node) = Some(ls.tid), dom gs.vrvHp = dom gs.prvHp, ls.node ≠ null, gs.orl ≠ [], 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), nextnottid(ls.tid, gs.vhead, gs.vs), noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.ps, gs.phead ∈ gs.vs, gs.phead ∈ gs.orl, ls.node ∈ gs.ps, ls.node ∈ gs.vs, ¬ ls.success, ¬ dups(gs.qrl), ¬ dups(gs.orl), ¬ dups(gs.orl + gs.qrl), ¬ ls.node ∈ gs.orl, ¬ ls.node ∈ 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.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, 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) ⊦ nonullRetRefs(gs.orl + gs.qrl, gs.vs[ls.node, mk(ls.value, None, null)], gs.vretRefs, gs.pretRefs) ∧ ( gs.vs[ls.node, mk(ls.value, None, null)][gs.vhead].next ≠ null ∧ gs.vs[ls.node, mk(ls.value, None, null)][gs.vs[ls.node, mk(ls.value, None, null)][gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[ls.node, mk(ls.value, None, null)][gs.vs[ls.node, mk(ls.value, None, null)][gs.vhead].next].deqID.tid)) = Claimed (gs.vs[ls.node, mk(ls.value, None, null)][gs.vs[ls.node, mk(ls.value, None, null)][gs.vhead].next].deqID.tid, gs.vs[ls.node, mk(ls.value, None, null)][gs.vs[ls.node, mk(ls.value, None, null)][gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs[ls.node, mk(ls.value, None, null)])) ∨ 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[ls.node, mk(ls.value, None, null)][gs.qrl.last].deqID = None ∧ gs.vs[ls.node, mk(ls.value, None, null)][gs.qrl.last].next = null) ∧ nextnottid(ls.tid, gs.vhead, gs.vs[ls.node, mk(ls.value, None, null)]) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs[ls.node, mk(ls.value, None, null)]) ∧ oneowns(ls.tid, ls.node, gs.owns, gs.vs[ls.node, mk(ls.value, None, null)], gs.ps)
Used simplifier rules: ⊦ (gs.vs:= ps0).ps = gs.ps; (s) ⊦ gstepf(gs, ls, E2, τ) = gs.vs:= gs.vs[ls.node, mk(ls.value, None, null)]; (s) ⊦ (gs.vs:= ps0).vs = ps0; (s) ⊦ (gs.vs:= ps0).owns = gs.owns; (s) ⊦ lstepf(gs, ls, E2, τ) = ls; (s) ⊦ (gs.vs:= ps0).vhead = gs.vhead; (s) ⊦ (gs.vs:= ps0).qrl = gs.qrl; (s) ⊦ (gs.vs:= ps0).orl = gs.orl; (s) ⊦ 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) ⊦ (gs.vs:= ps0).vtail = gs.vtail; (s) ⊦ ¬ node ∈ rl → (unmarkedp(rl, vs[node, nd]) ↔ unmarkedp(rl, vs)); (s) ⊦ (gs.vs:= ps0).phead = gs.phead; (s) ⊦ (gs.vs:= ps0).rvowns = gs.rvowns; (s) ⊦ (gs.vs:= ps0).vretRefs = gs.vretRefs; (s) ⊦ (gs.vs:= ps0).prvHp = gs.prvHp; (s) ⊦ (gs.vs:= ps0).vrvHp = gs.vrvHp; (s) ⊦ (gs.vs:= ps0).pretRefs = gs.pretRefs; (s) ⊦ markedp(rl, vs) → (markedp(rl, vs[r, mk(val, opttid, nxt)]) ↔ r ∈ rl → some?(opttid)); (s) ⊦ owns(node) = Some(tid) → (listp(rl, vs[node, nd], ps, owns) ↔ listp(rl, vs, ps, owns)); (s) 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] fw-some-oneowns: ⊦ oneowns(tid, r0, owns, vs, ps) ∧ owns(r) = Some(tid) ∧ r ∈ ps ∧ r ∈ vs → r = r0; (forward) from specification DMSQ 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) ⊦ pre(gs, ls, E2, a) ↔ a = τ; (s) ⊦ pcstepf(gs, ls, E2, a) = E3; (s)
| gs.owns(ls.node) = Some(ls.tid), dom gs.vrvHp = dom gs.prvHp, ls.node ≠ null, gs.orl ≠ [], 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), nextnottid(ls.tid, gs.vhead, gs.vs), noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.ps, gs.phead ∈ gs.vs, gs.phead ∈ gs.orl, ls.node ∈ gs.ps, ls.node ∈ gs.vs, ¬ ls.success, ¬ dups(gs.qrl), ¬ dups(gs.orl), ¬ dups(gs.orl + gs.qrl), ¬ ls.node ∈ gs.orl, ¬ ls.node ∈ 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.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, 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) ⊦ nonullRetRefs(gs.orl + gs.qrl, gs.vs[ls.node, mk(ls.value, None, null)], gs.vretRefs, gs.pretRefs) ∧ ( gs.vs[ls.node, mk(ls.value, None, null)][gs.vhead].next ≠ null ∧ gs.vs[ls.node, mk(ls.value, None, null)][gs.vs[ls.node, mk(ls.value, None, null)][gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[ls.node, mk(ls.value, None, null)][gs.vs[ls.node, mk(ls.value, None, null)][gs.vhead].next].deqID.tid)) = Claimed (gs.vs[ls.node, mk(ls.value, None, null)][gs.vs[ls.node, mk(ls.value, None, null)][gs.vhead].next].deqID.tid, gs.vs[ls.node, mk(ls.value, None, null)][gs.vs[ls.node, mk(ls.value, None, null)][gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs[ls.node, mk(ls.value, None, null)])) ∨ 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[ls.node, mk(ls.value, None, null)][gs.qrl.last].deqID = None ∧ gs.vs[ls.node, mk(ls.value, None, null)][gs.qrl.last].next = null) ∧ nextnottid(ls.tid, gs.vhead, gs.vs[ls.node, mk(ls.value, None, null)]) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs[ls.node, mk(ls.value, None, null)]) ∧ oneowns(ls.tid, ls.node, gs.owns, gs.vs[ls.node, mk(ls.value, None, null)], gs.ps) |
dom vrvHp = dom prvHp, gs = mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), owns(ls.node) = Some(ls.tid), ls.node ≠ null, orl ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(ls.tid, vhead, vs), noid(ls.tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(ls.tid, ls.node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), ls.node ∈ vs, ls.node ∈ ps, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ ls.success, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ ls.node ∈ orl, ¬ ls.node ∈ 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 ⊦ nonullRetRefs(orl + qrl, vs[ls.node, mk(ls.value, None, null)], vretRefs, pretRefs) ∧ ( vs[ls.node, mk(ls.value, None, null)][vhead].next ≠ null ∧ vs[ls.node, mk(ls.value, None, null)][vs[ls.node, mk(ls.value, None, null)][vhead].next].deqID ≠ None → rvowns(vretRefs(vs[ls.node, mk(ls.value, None, null)][vs[ls.node, mk(ls.value, None, null)][vhead].next].deqID.tid)) = Claimed (vs[ls.node, mk(ls.value, None, null)][vs[ls.node, mk(ls.value, None, null)][vhead].next].deqID.tid, vs[ls.node, mk(ls.value, None, null)][vs[ls.node, mk(ls.value, None, null)][vhead].next].val)) ∧ ( orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs[ls.node, mk(ls.value, None, null)])) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs)) ∧ ( vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[ls.node, mk(ls.value, None, null)][qrl.last].deqID = None ∧ vs[ls.node, mk(ls.value, None, null)][qrl.last].next = null) ∧ nextnottid(ls.tid, vhead, vs[ls.node, mk(ls.value, None, null)]) ∧ noid(ls.tid, orl + qrl, vhead, vs[ls.node, mk(ls.value, None, null)]) ∧ oneowns(ls.tid, ls.node, owns, vs[ls.node, mk(ls.value, None, null)], ps)
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), owns(ls.node) = Some(ls.tid), ls.node ≠ null, orl ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(ls.tid, vhead, vs), noid(ls.tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(ls.tid, ls.node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), ls.node ∈ vs, ls.node ∈ ps, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ ls.success, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ ls.node ∈ orl, ¬ ls.node ∈ 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 ⊦ nonullRetRefs(orl + qrl, vs[ls.node, mk(ls.value, None, null)], vretRefs, pretRefs) ∧ ( vs[ls.node, mk(ls.value, None, null)][vhead].next ≠ null ∧ vs[ls.node, mk(ls.value, None, null)][vs[ls.node, mk(ls.value, None, null)][vhead].next].deqID ≠ None → rvowns(vretRefs(vs[ls.node, mk(ls.value, None, null)][vs[ls.node, mk(ls.value, None, null)][vhead].next].deqID.tid)) = Claimed (vs[ls.node, mk(ls.value, None, null)][vs[ls.node, mk(ls.value, None, null)][vhead].next].deqID.tid, vs[ls.node, mk(ls.value, None, null)][vs[ls.node, mk(ls.value, None, null)][vhead].next].val)) ∧ ( orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs[ls.node, mk(ls.value, None, null)])) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs)) ∧ ( vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[ls.node, mk(ls.value, None, null)][qrl.last].deqID = None ∧ vs[ls.node, mk(ls.value, None, null)][qrl.last].next = null) ∧ nextnottid(ls.tid, vhead, vs[ls.node, mk(ls.value, None, null)]) ∧ noid(ls.tid, orl + qrl, vhead, vs[ls.node, mk(ls.value, None, null)]) ∧ oneowns(ls.tid, ls.node, owns, vs[ls.node, mk(ls.value, None, null)], ps) |
dom vrvHp = dom prvHp, owns(ls.node) = Some(ls.tid), ls.node ≠ null, orl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(ls.tid, vhead, vs), noid(ls.tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(ls.tid, ls.node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, ls.node ∈ ps, ls.node ∈ vs, phead ∈ vs, phead ∈ ps, ¬ ls.success, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ ls.node ∈ orl, ¬ ls.node ∈ 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) ⊦ nonullRetRefs(orl + qrl, vs[ls.node, mk(ls.value, None, null)], vretRefs, pretRefs) ∧ ( vs[ls.node, mk(ls.value, None, null)][vhead].next ≠ null ∧ vs[ls.node, mk(ls.value, None, null)][vs[ls.node, mk(ls.value, None, null)][vhead].next].deqID ≠ None → rvowns(vretRefs(vs[ls.node, mk(ls.value, None, null)][vs[ls.node, mk(ls.value, None, null)][vhead].next].deqID.tid)) = Claimed (vs[ls.node, mk(ls.value, None, null)][vs[ls.node, mk(ls.value, None, null)][vhead].next].deqID.tid, vs[ls.node, mk(ls.value, None, null)][vs[ls.node, mk(ls.value, None, null)][vhead].next].val)) ∧ ( orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs[ls.node, mk(ls.value, None, null)])) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs)) ∧ ( vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[ls.node, mk(ls.value, None, null)][qrl.last].deqID = None ∧ vs[ls.node, mk(ls.value, None, null)][qrl.last].next = null) ∧ nextnottid(ls.tid, vhead, vs[ls.node, mk(ls.value, None, null)]) ∧ noid(ls.tid, orl + qrl, vhead, vs[ls.node, mk(ls.value, None, null)]) ∧ oneowns(ls.tid, ls.node, owns, vs[ls.node, mk(ls.value, None, null)], ps)
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, owns(ls.node) = Some(ls.tid), ls.node ≠ null, orl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(ls.tid, vhead, vs), noid(ls.tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(ls.tid, ls.node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, ls.node ∈ ps, ls.node ∈ vs, phead ∈ vs, phead ∈ ps, ¬ ls.success, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ ls.node ∈ orl, ¬ ls.node ∈ 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) ⊦ nonullRetRefs(orl + qrl, vs[ls.node, mk(ls.value, None, null)], vretRefs, pretRefs) ∧ ( vs[ls.node, mk(ls.value, None, null)][vhead].next ≠ null ∧ vs[ls.node, mk(ls.value, None, null)][vs[ls.node, mk(ls.value, None, null)][vhead].next].deqID ≠ None → rvowns(vretRefs(vs[ls.node, mk(ls.value, None, null)][vs[ls.node, mk(ls.value, None, null)][vhead].next].deqID.tid)) = Claimed (vs[ls.node, mk(ls.value, None, null)][vs[ls.node, mk(ls.value, None, null)][vhead].next].deqID.tid, vs[ls.node, mk(ls.value, None, null)][vs[ls.node, mk(ls.value, None, null)][vhead].next].val)) ∧ ( orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs[ls.node, mk(ls.value, None, null)])) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs)) ∧ ( vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[ls.node, mk(ls.value, None, null)][qrl.last].deqID = None ∧ vs[ls.node, mk(ls.value, None, null)][qrl.last].next = null) ∧ nextnottid(ls.tid, vhead, vs[ls.node, mk(ls.value, None, null)]) ∧ noid(ls.tid, orl + qrl, vhead, vs[ls.node, mk(ls.value, None, null)]) ∧ oneowns(ls.tid, ls.node, owns, vs[ls.node, mk(ls.value, None, null)], ps) |
dom vrvHp = dom prvHp, ls = mkls(tid, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr), owns(node) = Some(tid), ¬ success, node ≠ null, orl ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ node ∈ orl, ¬ node ∈ 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 ⊦ nonullRetRefs(orl + qrl, vs[node, mk(value, None, null)], vretRefs, pretRefs) ∧ ( vs[node, mk(value, None, null)][vhead].next ≠ null ∧ vs[node, mk(value, None, null)][vs[node, mk(value, None, null)][vhead].next].deqID ≠ None → rvowns(vretRefs(vs[node, mk(value, None, null)][vs[node, mk(value, None, null)][vhead].next].deqID.tid)) = Claimed (vs[node, mk(value, None, null)][vs[node, mk(value, None, null)][vhead].next].deqID.tid, vs[node, mk(value, None, null)][vs[node, mk(value, None, null)][vhead].next].val)) ∧ ( orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs[node, mk(value, None, null)])) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs)) ∧ ( vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[node, mk(value, None, null)][qrl.last].deqID = None ∧ vs[node, mk(value, None, null)][qrl.last].next = null) ∧ nextnottid(tid, vhead, vs[node, mk(value, None, null)]) ∧ noid(tid, orl + qrl, vhead, vs[node, mk(value, None, null)]) ∧ oneowns(tid, node, owns, vs[node, mk(value, None, null)], ps)
Used simplifier rules: ⊦ ( ( ( ( ( ( ( ( ( ( (tid = ls.tid ∧ value = ls.value) ∧ optval = ls.optval) ∧ node = ls.node) ∧ nd = ls.nd) ∧ (success ↔ ls.success)) ∧ lst = ls.lst) ∧ nxt = ls.nxt) ∧ rvref = ls.rvref) ∧ optval0 = ls.optval0) ∧ first = ls.first) ∧ othertid = ls.othertid) ∧ addr = ls.addr ↔ ls = mkls (tid, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr); (elim) Used terms: value, nxt, optval, node, nd, ls, addr, tid, lst, first, rvref, othertid, success, optval
| dom vrvHp = dom prvHp, ls = mkls(tid, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr), owns(node) = Some(tid), ¬ success, node ≠ null, orl ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ node ∈ orl, ¬ node ∈ 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 ⊦ nonullRetRefs(orl + qrl, vs[node, mk(value, None, null)], vretRefs, pretRefs) ∧ ( vs[node, mk(value, None, null)][vhead].next ≠ null ∧ vs[node, mk(value, None, null)][vs[node, mk(value, None, null)][vhead].next].deqID ≠ None → rvowns(vretRefs(vs[node, mk(value, None, null)][vs[node, mk(value, None, null)][vhead].next].deqID.tid)) = Claimed (vs[node, mk(value, None, null)][vs[node, mk(value, None, null)][vhead].next].deqID.tid, vs[node, mk(value, None, null)][vs[node, mk(value, None, null)][vhead].next].val)) ∧ ( orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs[node, mk(value, None, null)])) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs)) ∧ ( vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[node, mk(value, None, null)][qrl.last].deqID = None ∧ vs[node, mk(value, None, null)][qrl.last].next = null) ∧ nextnottid(tid, vhead, vs[node, mk(value, None, null)]) ∧ noid(tid, orl + qrl, vhead, vs[node, mk(value, None, null)]) ∧ oneowns(tid, node, owns, vs[node, mk(value, None, null)], ps) |
dom vrvHp = dom prvHp, owns(node) = Some(tid), node ≠ null, orl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ node ∈ orl, ¬ node ∈ 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) ⊦ nonullRetRefs(orl + qrl, vs[node, mk(value, None, null)], vretRefs, pretRefs) ∧ ( vs[node, mk(value, None, null)][vhead].next ≠ null ∧ vs[node, mk(value, None, null)][vs[node, mk(value, None, null)][vhead].next].deqID ≠ None → rvowns(vretRefs(vs[node, mk(value, None, null)][vs[node, mk(value, None, null)][vhead].next].deqID.tid)) = Claimed (vs[node, mk(value, None, null)][vs[node, mk(value, None, null)][vhead].next].deqID.tid, vs[node, mk(value, None, null)][vs[node, mk(value, None, null)][vhead].next].val)) ∧ ( orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs[node, mk(value, None, null)])) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs)) ∧ ( vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[node, mk(value, None, null)][qrl.last].deqID = None ∧ vs[node, mk(value, None, null)][qrl.last].next = null) ∧ nextnottid(tid, vhead, vs[node, mk(value, None, null)]) ∧ noid(tid, orl + qrl, vhead, vs[node, mk(value, None, null)]) ∧ oneowns(tid, node, owns, vs[node, mk(value, None, null)], ps)
| dom vrvHp = dom prvHp, owns(node) = Some(tid), node ≠ null, orl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ node ∈ orl, ¬ node ∈ 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) ⊦ nonullRetRefs(orl + qrl, vs[node, mk(value, None, null)], vretRefs, pretRefs) ∧ ( vs[node, mk(value, None, null)][vhead].next ≠ null ∧ vs[node, mk(value, None, null)][vs[node, mk(value, None, null)][vhead].next].deqID ≠ None → rvowns(vretRefs(vs[node, mk(value, None, null)][vs[node, mk(value, None, null)][vhead].next].deqID.tid)) = Claimed (vs[node, mk(value, None, null)][vs[node, mk(value, None, null)][vhead].next].deqID.tid, vs[node, mk(value, None, null)][vs[node, mk(value, None, null)][vhead].next].val)) ∧ ( orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs[node, mk(value, None, null)])) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs)) ∧ ( vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[node, mk(value, None, null)][qrl.last].deqID = None ∧ vs[node, mk(value, None, null)][qrl.last].next = null) ∧ nextnottid(tid, vhead, vs[node, mk(value, None, null)]) ∧ noid(tid, orl + qrl, vhead, vs[node, mk(value, None, null)]) ∧ oneowns(tid, node, owns, vs[node, mk(value, None, null)], ps) |
dom vrvHp = dom prvHp, orl = qrl0 + vtail0 ', owns(node) = Some(tid), node ≠ null, orl ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ node ∈ orl, ¬ node ∈ 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), vtail0 = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ qrl0 ≠ [] ∧ qrl0.last = vhead ∧ phead ≠ vtail0 ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ nonullRetRefs(orl + qrl, vs[node, mk(value, None, null)], vretRefs, pretRefs) ∧ ( vs[node, mk(value, None, null)][vhead].next ≠ null ∧ vs[node, mk(value, None, null)][vs[node, mk(value, None, null)][vhead].next].deqID ≠ None → rvowns(vretRefs(vs[node, mk(value, None, null)][vs[node, mk(value, None, null)][vhead].next].deqID.tid)) = Claimed (vs[node, mk(value, None, null)][vs[node, mk(value, None, null)][vhead].next].deqID.tid, vs[node, mk(value, None, null)][vs[node, mk(value, None, null)][vhead].next].val)) ∧ ( vtail0 = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs[node, mk(value, None, null)])) ∨ qrl0 ≠ [] ∧ qrl0.last = vhead ∧ phead ≠ vtail0 ∧ unmarkedp(qrl, vs)) ∧ ( vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[node, mk(value, None, null)][qrl.last].deqID = None ∧ vs[node, mk(value, None, null)][qrl.last].next = null) ∧ nextnottid(tid, vhead, vs[node, mk(value, None, null)]) ∧ noid(tid, orl + qrl, vhead, vs[node, mk(value, None, null)]) ∧ oneowns(tid, node, owns, vs[node, mk(value, None, null)], ps)
Used simplifier rules: x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: orl, vtail0, y
| dom vrvHp = dom prvHp, orl = qrl0 + vtail0 ', owns(node) = Some(tid), node ≠ null, orl ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ node ∈ orl, ¬ node ∈ 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), vtail0 = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ qrl0 ≠ [] ∧ qrl0.last = vhead ∧ phead ≠ vtail0 ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ nonullRetRefs(orl + qrl, vs[node, mk(value, None, null)], vretRefs, pretRefs) ∧ ( vs[node, mk(value, None, null)][vhead].next ≠ null ∧ vs[node, mk(value, None, null)][vs[node, mk(value, None, null)][vhead].next].deqID ≠ None → rvowns(vretRefs(vs[node, mk(value, None, null)][vs[node, mk(value, None, null)][vhead].next].deqID.tid)) = Claimed (vs[node, mk(value, None, null)][vs[node, mk(value, None, null)][vhead].next].deqID.tid, vs[node, mk(value, None, null)][vs[node, mk(value, None, null)][vhead].next].val)) ∧ ( vtail0 = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs[node, mk(value, None, null)])) ∨ qrl0 ≠ [] ∧ qrl0.last = vhead ∧ phead ≠ vtail0 ∧ unmarkedp(qrl, vs)) ∧ ( vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[node, mk(value, None, null)][qrl.last].deqID = None ∧ vs[node, mk(value, None, null)][qrl.last].next = null) ∧ nextnottid(tid, vhead, vs[node, mk(value, None, null)]) ∧ noid(tid, orl + qrl, vhead, vs[node, mk(value, None, null)]) ∧ oneowns(tid, node, owns, vs[node, mk(value, None, null)], ps) |
dom vrvHp = dom prvHp, owns(node) = Some(tid), node ≠ null, node ≠ vtail0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((qrl0 + vtail0 ') + qrl, vs, ps, owns), markedp(qrl0, ps), markedp(qrl0, vs), nextnottid(tid, vhead, vs), noid(tid, (qrl0 + vtail0 ') + qrl, vhead, vs), nonullRetRefs((qrl0 + vtail0 ') + qrl, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vtail0].deqID), some?(vs[vtail0].deqID), unmarkedp(qrl, ps), node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, ¬ dups(qrl0 + qrl), ¬ dups(qrl0), ¬ dups(qrl), ¬ node ∈ qrl, ¬ vtail0 ∈ qrl0, ¬ vtail0 ∈ qrl, ¬ node ∈ qrl0, 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), vtail0 = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ qrl0 ≠ [] ∧ qrl0.last = vhead ∧ phead ≠ vtail0 ∧ unmarkedp(qrl, vs), phead ∈ qrl0 ∨ phead = vtail0, vtail = (vtail0 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vtail0 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ nonullRetRefs((qrl0 + vtail0 ') + qrl, vs[node, mk(value, None, null)], vretRefs, pretRefs) ∧ ( vs[node, mk(value, None, null)][vhead].next ≠ null ∧ vs[node, mk(value, None, null)][vs[node, mk(value, None, null)][vhead].next].deqID ≠ None → rvowns(vretRefs(vs[node, mk(value, None, null)][vs[node, mk(value, None, null)][vhead].next].deqID.tid)) = Claimed (vs[node, mk(value, None, null)][vs[node, mk(value, None, null)][vhead].next].deqID.tid, vs[node, mk(value, None, null)][vs[node, mk(value, None, null)][vhead].next].val)) ∧ ( vtail0 = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs[node, mk(value, None, null)])) ∨ qrl0 ≠ [] ∧ qrl0.last = vhead ∧ phead ≠ vtail0 ∧ unmarkedp(qrl, vs)) ∧ ( vtail = (vtail0 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vtail0 ' + qrl.butlast).last ∧ vs[node, mk(value, None, null)][qrl.last].deqID = None ∧ vs[node, mk(value, None, null)][qrl.last].next = null) ∧ nextnottid(tid, vhead, vs[node, mk(value, None, null)]) ∧ noid(tid, (qrl0 + vtail0 ') + qrl, vhead, vs[node, mk(value, None, null)]) ∧ oneowns(tid, node, owns, vs[node, mk(value, None, null)], ps)
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 ' + y).last = (a ' + y).last; (s) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ ¬ b ∈ x → (dups(x + b ') ↔ dups(x)); (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s) ⊦ x + a ' ≠ []; (s)
| dom vrvHp = dom prvHp, owns(node) = Some(tid), node ≠ null, node ≠ vtail0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((qrl0 + vtail0 ') + qrl, vs, ps, owns), markedp(qrl0, ps), markedp(qrl0, vs), nextnottid(tid, vhead, vs), noid(tid, (qrl0 + vtail0 ') + qrl, vhead, vs), nonullRetRefs((qrl0 + vtail0 ') + qrl, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vtail0].deqID), some?(vs[vtail0].deqID), unmarkedp(qrl, ps), node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, ¬ dups(qrl0 + qrl), ¬ dups(qrl0), ¬ dups(qrl), ¬ node ∈ qrl, ¬ vtail0 ∈ qrl0, ¬ vtail0 ∈ qrl, ¬ node ∈ qrl0, 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), vtail0 = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ qrl0 ≠ [] ∧ qrl0.last = vhead ∧ phead ≠ vtail0 ∧ unmarkedp(qrl, vs), phead ∈ qrl0 ∨ phead = vtail0, vtail = (vtail0 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vtail0 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ nonullRetRefs((qrl0 + vtail0 ') + qrl, vs[node, mk(value, None, null)], vretRefs, pretRefs) ∧ ( vs[node, mk(value, None, null)][vhead].next ≠ null ∧ vs[node, mk(value, None, null)][vs[node, mk(value, None, null)][vhead].next].deqID ≠ None → rvowns(vretRefs(vs[node, mk(value, None, null)][vs[node, mk(value, None, null)][vhead].next].deqID.tid)) = Claimed (vs[node, mk(value, None, null)][vs[node, mk(value, None, null)][vhead].next].deqID.tid, vs[node, mk(value, None, null)][vs[node, mk(value, None, null)][vhead].next].val)) ∧ ( vtail0 = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs[node, mk(value, None, null)])) ∨ qrl0 ≠ [] ∧ qrl0.last = vhead ∧ phead ≠ vtail0 ∧ unmarkedp(qrl, vs)) ∧ ( vtail = (vtail0 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vtail0 ' + qrl.butlast).last ∧ vs[node, mk(value, None, null)][qrl.last].deqID = None ∧ vs[node, mk(value, None, null)][qrl.last].next = null) ∧ nextnottid(tid, vhead, vs[node, mk(value, None, null)]) ∧ noid(tid, (qrl0 + vtail0 ') + qrl, vhead, vs[node, mk(value, None, null)]) ∧ oneowns(tid, node, owns, vs[node, mk(value, None, null)], ps) |
⊦ a ≠ b → st[b, d][a] = st[a]
dom vrvHp = dom prvHp, owns(node) = Some(tid), node ≠ null, node ≠ vtail0, vhead ≠ node, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((qrl0 + vtail0 ') + qrl, vs, ps, owns), markedp(qrl0, vs), markedp(qrl0, ps), nextnottid(tid, vhead, vs), noid(tid, (qrl0 + vtail0 ') + qrl, vhead, vs), nonullRetRefs((qrl0 + vtail0 ') + qrl, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vtail0].deqID), some?(ps[vtail0].deqID), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, ¬ dups(qrl0 + qrl), ¬ dups(qrl0), ¬ dups(qrl), ¬ node ∈ qrl, ¬ vtail0 ∈ qrl0, ¬ vtail0 ∈ qrl, ¬ node ∈ qrl0, 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 = (vtail0 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vtail0 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead ∈ qrl0 ∨ phead = vtail0, vtail0 = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ qrl0 ≠ [] ∧ qrl0.last = vhead ∧ phead ≠ vtail0 ∧ unmarkedp(qrl, vs) ⊦ nonullRetRefs((qrl0 + vtail0 ') + qrl, vs[node, mk(value, None, null)], vretRefs, pretRefs) ∧ ( vs[vhead].next ≠ null ∧ vs[node, mk(value, None, null)][vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[node, mk(value, None, null)][vs[vhead].next].deqID.tid)) = Claimed(vs[node, mk(value, None, null)][vs[vhead].next].deqID.tid, vs[node, mk(value, None, null)][vs[vhead].next].val)) ∧ ( vtail0 = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs[node, mk(value, None, null)])) ∨ qrl0 ≠ [] ∧ qrl0.last = vhead ∧ phead ≠ vtail0 ∧ unmarkedp(qrl, vs)) ∧ ( vtail = (vtail0 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vtail0 ' + qrl.butlast).last ∧ vs[node, mk(value, None, null)][qrl.last].deqID = None ∧ vs[node, mk(value, None, null)][qrl.last].next = null) ∧ nextnottid(tid, vhead, vs[node, mk(value, None, null)]) ∧ noid(tid, (qrl0 + vtail0 ') + qrl, vhead, vs[node, mk(value, None, null)]) ∧ oneowns(tid, node, owns, vs[node, mk(value, None, null)], ps)
Used simplifier rules: ⊦ x.last = a ∧ x ≠ [] → a ∈ x; (s) Used terms: vs, node, mk(value, None, null), vhead
| ⊦ a ≠ b → st[b, d][a] = st[a] |
| dom vrvHp = dom prvHp, owns(node) = Some(tid), node ≠ null, node ≠ vtail0, vhead ≠ node, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((qrl0 + vtail0 ') + qrl, vs, ps, owns), markedp(qrl0, vs), markedp(qrl0, ps), nextnottid(tid, vhead, vs), noid(tid, (qrl0 + vtail0 ') + qrl, vhead, vs), nonullRetRefs((qrl0 + vtail0 ') + qrl, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vtail0].deqID), some?(ps[vtail0].deqID), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, ¬ dups(qrl0 + qrl), ¬ dups(qrl0), ¬ dups(qrl), ¬ node ∈ qrl, ¬ vtail0 ∈ qrl0, ¬ vtail0 ∈ qrl, ¬ node ∈ qrl0, 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 = (vtail0 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vtail0 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead ∈ qrl0 ∨ phead = vtail0, vtail0 = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ qrl0 ≠ [] ∧ qrl0.last = vhead ∧ phead ≠ vtail0 ∧ unmarkedp(qrl, vs) ⊦ nonullRetRefs((qrl0 + vtail0 ') + qrl, vs[node, mk(value, None, null)], vretRefs, pretRefs) ∧ ( vs[vhead].next ≠ null ∧ vs[node, mk(value, None, null)][vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[node, mk(value, None, null)][vs[vhead].next].deqID.tid)) = Claimed(vs[node, mk(value, None, null)][vs[vhead].next].deqID.tid, vs[node, mk(value, None, null)][vs[vhead].next].val)) ∧ ( vtail0 = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs[node, mk(value, None, null)])) ∨ qrl0 ≠ [] ∧ qrl0.last = vhead ∧ phead ≠ vtail0 ∧ unmarkedp(qrl, vs)) ∧ ( vtail = (vtail0 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vtail0 ' + qrl.butlast).last ∧ vs[node, mk(value, None, null)][qrl.last].deqID = None ∧ vs[node, mk(value, None, null)][qrl.last].next = null) ∧ nextnottid(tid, vhead, vs[node, mk(value, None, null)]) ∧ noid(tid, (qrl0 + vtail0 ') + qrl, vhead, vs[node, mk(value, None, null)]) ∧ oneowns(tid, node, owns, vs[node, mk(value, None, null)], ps) |
dom vrvHp = dom prvHp, owns(node) = Some(tid), node ≠ null, node ≠ vtail0, vhead ≠ node, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((qrl0 + vtail0 ') + qrl, vs, ps, owns), markedp(qrl0, ps), markedp(qrl0, vs), nextnottid(tid, vhead, vs), noid(tid, (qrl0 + vtail0 ') + qrl, vhead, vs), nonullRetRefs((qrl0 + vtail0 ') + qrl, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vtail0].deqID), some?(vs[vtail0].deqID), unmarkedp(qrl, ps), node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, ¬ dups(qrl0 + qrl), ¬ dups(qrl0), ¬ dups(qrl), ¬ nonullRetRefs((qrl0 + vtail0 ') + qrl, vs[node, mk(value, None, null)], vretRefs, pretRefs), ¬ node ∈ qrl, ¬ vtail0 ∈ qrl0, ¬ vtail0 ∈ qrl, ¬ node ∈ qrl0, 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), vtail0 = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ qrl0 ≠ [] ∧ qrl0.last = vhead ∧ phead ≠ vtail0 ∧ unmarkedp(qrl, vs), phead ∈ qrl0 ∨ phead = vtail0, vtail = (vtail0 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vtail0 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦
dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[node, mk(value, None, null)][vs[vhead].next].deqID ≠ None, vs[vhead].next ≠ null, node ≠ null, node ≠ vtail0, rvowns(vretRefs(vs[node, mk(value, None, null)][vs[vhead].next].deqID.tid)) ≠ Claimed(vs[node, mk(value, None, null)][vs[vhead].next].deqID.tid, vs[node, mk(value, None, null)][vs[vhead].next].val), vhead ≠ node, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((qrl0 + vtail0 ') + qrl, vs, ps, owns), markedp(qrl0, ps), markedp(qrl0, vs), nextnottid(tid, vhead, vs), noid(tid, (qrl0 + vtail0 ') + qrl, vhead, vs), nonullRetRefs((qrl0 + vtail0 ') + qrl, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vtail0].deqID), some?(vs[vtail0].deqID), unmarkedp(qrl, ps), node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, ¬ dups(qrl0 + qrl), ¬ dups(qrl0), ¬ dups(qrl), ¬ node ∈ qrl, ¬ vtail0 ∈ qrl0, ¬ vtail0 ∈ qrl, ¬ node ∈ qrl0, 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), vtail0 = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ qrl0 ≠ [] ∧ qrl0.last = vhead ∧ phead ≠ vtail0 ∧ unmarkedp(qrl, vs), phead ∈ qrl0 ∨ phead = vtail0, vtail = (vtail0 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vtail0 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦
dom vrvHp = dom prvHp, owns(node) = Some(tid), node ≠ null, node ≠ vtail0, vhead ≠ node, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((qrl0 + vtail0 ') + qrl, vs, ps, owns), markedp(qrl0, ps), markedp(qrl0, vs), nextnottid(tid, vhead, vs), noid(tid, (qrl0 + vtail0 ') + qrl, vhead, vs), nonullRetRefs((qrl0 + vtail0 ') + qrl, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vtail0].deqID), some?(vs[vtail0].deqID), unmarkedp(qrl, ps), node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, ¬ dups(qrl0 + qrl), ¬ dups(qrl0), ¬ dups(qrl), ¬ node ∈ qrl, ¬ vtail0 ∈ qrl0, ¬ vtail0 ∈ qrl, ¬ node ∈ qrl0, 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), vtail0 = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ qrl0 ≠ [] ∧ qrl0.last = vhead ∧ phead ≠ vtail0 ∧ unmarkedp(qrl, vs), phead ∈ qrl0 ∨ phead = vtail0, vtail = (vtail0 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vtail0 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ vtail0 = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs[node, mk(value, None, null)])), qrl0 ≠ [] ∧ qrl0.last = vhead ∧ phead ≠ vtail0 ∧ unmarkedp(qrl, vs)
dom vrvHp = dom prvHp, owns(node) = Some(tid), node ≠ null, node ≠ vtail0, vhead ≠ node, vtail ≠ (vtail0 ' + qrl).last, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((qrl0 + vtail0 ') + qrl, vs, ps, owns), markedp(qrl0, ps), markedp(qrl0, vs), nextnottid(tid, vhead, vs), noid(tid, (qrl0 + vtail0 ') + qrl, vhead, vs), nonullRetRefs((qrl0 + vtail0 ') + qrl, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vtail0].deqID), some?(vs[vtail0].deqID), unmarkedp(qrl, ps), node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, ¬ dups(qrl0 + qrl), ¬ dups(qrl0), ¬ dups(qrl), ¬ node ∈ qrl, ¬ vtail0 ∈ qrl0, ¬ vtail0 ∈ qrl, ¬ node ∈ qrl0, 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), vtail0 = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ qrl0 ≠ [] ∧ qrl0.last = vhead ∧ phead ≠ vtail0 ∧ unmarkedp(qrl, vs), phead ∈ qrl0 ∨ phead = vtail0, vtail = (vtail0 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vtail0 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ qrl ≠ [] ∧ vtail = (vtail0 ' + qrl.butlast).last ∧ vs[node, mk(value, None, null)][qrl.last].deqID = None ∧ vs[node, mk(value, None, null)][qrl.last].next = null
dom vrvHp = dom prvHp, owns(node) = Some(tid), node ≠ null, node ≠ vtail0, vhead ≠ node, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((qrl0 + vtail0 ') + qrl, vs, ps, owns), markedp(qrl0, ps), markedp(qrl0, vs), nextnottid(tid, vhead, vs), noid(tid, (qrl0 + vtail0 ') + qrl, vhead, vs), nonullRetRefs((qrl0 + vtail0 ') + qrl, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vtail0].deqID), some?(vs[vtail0].deqID), unmarkedp(qrl, ps), node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, ¬ dups(qrl0 + qrl), ¬ dups(qrl0), ¬ dups(qrl), ¬ nextnottid(tid, vhead, vs[node, mk(value, None, null)]), ¬ node ∈ qrl, ¬ vtail0 ∈ qrl0, ¬ vtail0 ∈ qrl, ¬ node ∈ qrl0, 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), vtail0 = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ qrl0 ≠ [] ∧ qrl0.last = vhead ∧ phead ≠ vtail0 ∧ unmarkedp(qrl, vs), phead ∈ qrl0 ∨ phead = vtail0, vtail = (vtail0 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vtail0 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦
dom vrvHp = dom prvHp, owns(node) = Some(tid), node ≠ null, node ≠ vtail0, vhead ≠ node, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((qrl0 + vtail0 ') + qrl, vs, ps, owns), markedp(qrl0, ps), markedp(qrl0, vs), nextnottid(tid, vhead, vs), noid(tid, (qrl0 + vtail0 ') + qrl, vhead, vs), nonullRetRefs((qrl0 + vtail0 ') + qrl, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vtail0].deqID), some?(vs[vtail0].deqID), unmarkedp(qrl, ps), node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, ¬ dups(qrl0 + qrl), ¬ dups(qrl0), ¬ dups(qrl), ¬ noid(tid, (qrl0 + vtail0 ') + qrl, vhead, vs[node, mk(value, None, null)]), ¬ node ∈ qrl, ¬ vtail0 ∈ qrl0, ¬ vtail0 ∈ qrl, ¬ node ∈ qrl0, 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), vtail0 = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ qrl0 ≠ [] ∧ qrl0.last = vhead ∧ phead ≠ vtail0 ∧ unmarkedp(qrl, vs), phead ∈ qrl0 ∨ phead = vtail0, vtail = (vtail0 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vtail0 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦
dom vrvHp = dom prvHp, owns(node) = Some(tid), node ≠ null, node ≠ vtail0, vhead ≠ node, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((qrl0 + vtail0 ') + qrl, vs, ps, owns), markedp(qrl0, ps), markedp(qrl0, vs), nextnottid(tid, vhead, vs), noid(tid, (qrl0 + vtail0 ') + qrl, vhead, vs), nonullRetRefs((qrl0 + vtail0 ') + qrl, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vtail0].deqID), some?(vs[vtail0].deqID), unmarkedp(qrl, ps), node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, ¬ dups(qrl0 + qrl), ¬ dups(qrl0), ¬ dups(qrl), ¬ oneowns(tid, node, owns, vs[node, mk(value, None, null)], ps), ¬ node ∈ qrl, ¬ vtail0 ∈ qrl0, ¬ vtail0 ∈ qrl, ¬ node ∈ qrl0, 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), vtail0 = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ qrl0 ≠ [] ∧ qrl0.last = vhead ∧ phead ≠ vtail0 ∧ unmarkedp(qrl, vs), phead ∈ qrl0 ∨ phead = vtail0, vtail = (vtail0 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vtail0 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦
| dom vrvHp = dom prvHp, owns(node) = Some(tid), node ≠ null, node ≠ vtail0, vhead ≠ node, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((qrl0 + vtail0 ') + qrl, vs, ps, owns), markedp(qrl0, ps), markedp(qrl0, vs), nextnottid(tid, vhead, vs), noid(tid, (qrl0 + vtail0 ') + qrl, vhead, vs), nonullRetRefs((qrl0 + vtail0 ') + qrl, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vtail0].deqID), some?(vs[vtail0].deqID), unmarkedp(qrl, ps), node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, ¬ dups(qrl0 + qrl), ¬ dups(qrl0), ¬ dups(qrl), ¬ nonullRetRefs((qrl0 + vtail0 ') + qrl, vs[node, mk(value, None, null)], vretRefs, pretRefs), ¬ node ∈ qrl, ¬ vtail0 ∈ qrl0, ¬ vtail0 ∈ qrl, ¬ node ∈ qrl0, 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), vtail0 = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ qrl0 ≠ [] ∧ qrl0.last = vhead ∧ phead ≠ vtail0 ∧ unmarkedp(qrl, vs), phead ∈ qrl0 ∨ phead = vtail0, vtail = (vtail0 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vtail0 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ |
dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[node, mk(value, None, null)][r].deqID ≠ None, node ≠ null, node ≠ vtail0, r ≠ (qrl0 + vtail0 ').head, vhead ≠ node, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((qrl0 + vtail0 ') + qrl, vs, ps, owns), markedp(qrl0, vs), markedp(qrl0, ps), nextnottid(tid, vhead, vs), noid(tid, (qrl0 + vtail0 ') + qrl, vhead, vs), nonullRetRefs((qrl0 + vtail0 ') + qrl, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vtail0].deqID), some?(ps[vtail0].deqID), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, ¬ dups(qrl0 + qrl), ¬ dups(qrl0), ¬ dups(qrl), ¬ node ∈ qrl, ¬ vtail0 ∈ qrl0, ¬ vtail0 ∈ qrl, ¬ node ∈ qrl0, 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), vs[r].deqID ≠ None → vretRefs(vs[r].deqID.tid) ≠ null ∧ pretRefs(vs[r].deqID.tid) ≠ null, vtail = (vtail0 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vtail0 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead ∈ qrl0 ∨ phead = vtail0, vtail0 = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ qrl0 ≠ [] ∧ qrl0.last = vhead ∧ phead ≠ vtail0 ∧ unmarkedp(qrl, vs), r ∈ qrl0 ∨ r = vtail0 ∨ r ∈ qrl ⊦ vretRefs(vs[node, mk(value, None, null)][r].deqID.tid) ≠ null ∧ pretRefs(vs[node, mk(value, None, null)][r].deqID.tid) ≠ null
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ (x + a ' + y).head = (x + a ').head; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ nonullRetRefs(rl, vs, vretRefs, pretRefs) → ( nonullRetRefs(rl0, vs0, vretRefs0, pretRefs0) ↔ (∀ r. ( r ∈ rl ∧ r ≠ rl.head ∧ vs[r].deqID ≠ None → vretRefs(vs[r].deqID.tid) ≠ null ∧ pretRefs(vs[r].deqID.tid) ≠ null) → r ∈ rl0 ∧ r ≠ rl0.head ∧ vs0[r].deqID ≠ None → vretRefs0(vs0[r].deqID.tid) ≠ null ∧ pretRefs0(vs0[r].deqID.tid) ≠ null)); (ss)
| dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[node, mk(value, None, null)][r].deqID ≠ None, node ≠ null, node ≠ vtail0, r ≠ (qrl0 + vtail0 ').head, vhead ≠ node, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((qrl0 + vtail0 ') + qrl, vs, ps, owns), markedp(qrl0, vs), markedp(qrl0, ps), nextnottid(tid, vhead, vs), noid(tid, (qrl0 + vtail0 ') + qrl, vhead, vs), nonullRetRefs((qrl0 + vtail0 ') + qrl, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vtail0].deqID), some?(ps[vtail0].deqID), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, ¬ dups(qrl0 + qrl), ¬ dups(qrl0), ¬ dups(qrl), ¬ node ∈ qrl, ¬ vtail0 ∈ qrl0, ¬ vtail0 ∈ qrl, ¬ node ∈ qrl0, 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), vs[r].deqID ≠ None → vretRefs(vs[r].deqID.tid) ≠ null ∧ pretRefs(vs[r].deqID.tid) ≠ null, vtail = (vtail0 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vtail0 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead ∈ qrl0 ∨ phead = vtail0, vtail0 = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ qrl0 ≠ [] ∧ qrl0.last = vhead ∧ phead ≠ vtail0 ∧ unmarkedp(qrl, vs), r ∈ qrl0 ∨ r = vtail0 ∨ r ∈ qrl ⊦ vretRefs(vs[node, mk(value, None, null)][r].deqID.tid) ≠ null ∧ pretRefs(vs[node, mk(value, None, null)][r].deqID.tid) ≠ null |
qrl0 + vtail0 ' = phead0 + qrl1, dom vrvHp = dom prvHp, owns(node) = Some(tid), qrl0 + vtail0 ' ≠ [], vs[node, mk(value, None, null)][r].deqID ≠ None, node ≠ null, node ≠ vtail0, r ≠ phead0, vhead ≠ node, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((qrl0 + vtail0 ') + qrl, vs, ps, owns), markedp(qrl0, ps), markedp(qrl0, vs), nextnottid(tid, vhead, vs), noid(tid, (qrl0 + vtail0 ') + qrl, vhead, vs), nonullRetRefs((qrl0 + vtail0 ') + qrl, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vtail0].deqID), some?(vs[vtail0].deqID), unmarkedp(qrl, ps), node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, ¬ dups(qrl0 + qrl), ¬ dups(qrl0), ¬ dups(qrl), ¬ node ∈ qrl, ¬ vtail0 ∈ qrl0, ¬ vtail0 ∈ qrl, ¬ node ∈ qrl0, vs[r].deqID ≠ None → vretRefs(vs[r].deqID.tid) ≠ null ∧ pretRefs(vs[r].deqID.tid) ≠ null, 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 ∈ qrl0 ∨ r = vtail0 ∨ r ∈ qrl, vtail0 = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ qrl0 ≠ [] ∧ qrl0.last = vhead ∧ phead ≠ vtail0 ∧ unmarkedp(qrl, vs), phead ∈ qrl0 ∨ phead = vtail0, vtail = (vtail0 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vtail0 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ vretRefs(vs[node, mk(value, None, null)][r].deqID.tid) ≠ null ∧ pretRefs(vs[node, mk(value, None, null)][r].deqID.tid) ≠ null
Used simplifier rules: ⊦ x + y = [] ↔ x = [] ∧ y = []; (as) ⊦ a ' ≠ []; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] x ≠ [] ⊦ a = x.head ∧ y = x.tail ↔ x = a + y; (elim) Used terms: qrl0 + vtail0 ', phead0, y
| qrl0 + vtail0 ' = phead0 + qrl1, dom vrvHp = dom prvHp, owns(node) = Some(tid), qrl0 + vtail0 ' ≠ [], vs[node, mk(value, None, null)][r].deqID ≠ None, node ≠ null, node ≠ vtail0, r ≠ phead0, vhead ≠ node, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((qrl0 + vtail0 ') + qrl, vs, ps, owns), markedp(qrl0, ps), markedp(qrl0, vs), nextnottid(tid, vhead, vs), noid(tid, (qrl0 + vtail0 ') + qrl, vhead, vs), nonullRetRefs((qrl0 + vtail0 ') + qrl, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vtail0].deqID), some?(vs[vtail0].deqID), unmarkedp(qrl, ps), node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, ¬ dups(qrl0 + qrl), ¬ dups(qrl0), ¬ dups(qrl), ¬ node ∈ qrl, ¬ vtail0 ∈ qrl0, ¬ vtail0 ∈ qrl, ¬ node ∈ qrl0, vs[r].deqID ≠ None → vretRefs(vs[r].deqID.tid) ≠ null ∧ pretRefs(vs[r].deqID.tid) ≠ null, 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 ∈ qrl0 ∨ r = vtail0 ∨ r ∈ qrl, vtail0 = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ qrl0 ≠ [] ∧ qrl0.last = vhead ∧ phead ≠ vtail0 ∧ unmarkedp(qrl, vs), phead ∈ qrl0 ∨ phead = vtail0, vtail = (vtail0 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vtail0 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ vretRefs(vs[node, mk(value, None, null)][r].deqID.tid) ≠ null ∧ pretRefs(vs[node, mk(value, None, null)][r].deqID.tid) ≠ null |
qrl0 + vtail0 ' = phead0 ' + qrl1, dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[node, mk(value, None, null)][r].deqID ≠ None, node ≠ vtail0, node ≠ null, r ≠ phead0, vhead ≠ node, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((phead0 ' + qrl1) + qrl, vs, ps, owns), markedp(qrl0, ps), markedp(qrl0, vs), nextnottid(tid, vhead, vs), noid(tid, (phead0 ' + qrl1) + qrl, vhead, vs), nonullRetRefs((phead0 ' + qrl1) + qrl, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vtail0].deqID), some?(vs[vtail0].deqID), unmarkedp(qrl, ps), node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, ¬ dups(qrl), ¬ dups(qrl0), ¬ dups(qrl0 + qrl), ¬ node ∈ qrl0, ¬ vtail0 ∈ qrl, ¬ vtail0 ∈ qrl0, ¬ node ∈ qrl, vs[r].deqID ≠ None → vretRefs(vs[r].deqID.tid) ≠ null ∧ pretRefs(vs[r].deqID.tid) ≠ null, 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 ∈ qrl0 ∨ r = vtail0 ∨ r ∈ qrl, vtail0 = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ qrl0 ≠ [] ∧ qrl0.last = vhead ∧ phead ≠ vtail0 ∧ unmarkedp(qrl, vs), phead ∈ qrl0 ∨ phead = vtail0, vtail = (vtail0 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vtail0 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail0 = phead0 ∨ vtail0 ∈ qrl1, phead0 ∈ qrl0 ∨ phead0 = vtail0 ⊦ vretRefs(vs[node, mk(value, None, null)][r].deqID.tid) ≠ null ∧ pretRefs(vs[node, mk(value, None, null)][r].deqID.tid) ≠ null
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) in-14: ⊦ a ' + x = y → a ∈ y; (forward) from specification list[reflist] in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] ⊦ x + a ' ≠ []; (s) ⊦ a + x = a ' + x; (s)
| qrl0 + vtail0 ' = phead0 ' + qrl1, dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[node, mk(value, None, null)][r].deqID ≠ None, node ≠ vtail0, node ≠ null, r ≠ phead0, vhead ≠ node, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((phead0 ' + qrl1) + qrl, vs, ps, owns), markedp(qrl0, ps), markedp(qrl0, vs), nextnottid(tid, vhead, vs), noid(tid, (phead0 ' + qrl1) + qrl, vhead, vs), nonullRetRefs((phead0 ' + qrl1) + qrl, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vtail0].deqID), some?(vs[vtail0].deqID), unmarkedp(qrl, ps), node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, ¬ dups(qrl), ¬ dups(qrl0), ¬ dups(qrl0 + qrl), ¬ node ∈ qrl0, ¬ vtail0 ∈ qrl, ¬ vtail0 ∈ qrl0, ¬ node ∈ qrl, vs[r].deqID ≠ None → vretRefs(vs[r].deqID.tid) ≠ null ∧ pretRefs(vs[r].deqID.tid) ≠ null, 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 ∈ qrl0 ∨ r = vtail0 ∨ r ∈ qrl, vtail0 = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ qrl0 ≠ [] ∧ qrl0.last = vhead ∧ phead ≠ vtail0 ∧ unmarkedp(qrl, vs), phead ∈ qrl0 ∨ phead = vtail0, vtail = (vtail0 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vtail0 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail0 = phead0 ∨ vtail0 ∈ qrl1, phead0 ∈ qrl0 ∨ phead0 = vtail0 ⊦ vretRefs(vs[node, mk(value, None, null)][r].deqID.tid) ≠ null ∧ pretRefs(vs[node, mk(value, None, null)][r].deqID.tid) ≠ null |
⊦ a ≠ b → st[b, d][a] = st[a]
Used simplifier rules: ⊦ a = b → st[b, d][a] = d; (s) ⊦ mk(val, opttid, nxt).deqID = opttid; (s) Used terms: vs, node, mk(value, None, null), r
| ⊦ a ≠ b → st[b, d][a] = st[a] |
| dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[node, mk(value, None, null)][vs[vhead].next].deqID ≠ None, vs[vhead].next ≠ null, node ≠ null, node ≠ vtail0, rvowns(vretRefs(vs[node, mk(value, None, null)][vs[vhead].next].deqID.tid)) ≠ Claimed(vs[node, mk(value, None, null)][vs[vhead].next].deqID.tid, vs[node, mk(value, None, null)][vs[vhead].next].val), vhead ≠ node, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((qrl0 + vtail0 ') + qrl, vs, ps, owns), markedp(qrl0, ps), markedp(qrl0, vs), nextnottid(tid, vhead, vs), noid(tid, (qrl0 + vtail0 ') + qrl, vhead, vs), nonullRetRefs((qrl0 + vtail0 ') + qrl, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vtail0].deqID), some?(vs[vtail0].deqID), unmarkedp(qrl, ps), node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, ¬ dups(qrl0 + qrl), ¬ dups(qrl0), ¬ dups(qrl), ¬ node ∈ qrl, ¬ vtail0 ∈ qrl0, ¬ vtail0 ∈ qrl, ¬ node ∈ qrl0, 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), vtail0 = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ qrl0 ≠ [] ∧ qrl0.last = vhead ∧ phead ≠ vtail0 ∧ unmarkedp(qrl, vs), phead ∈ qrl0 ∨ phead = vtail0, vtail = (vtail0 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vtail0 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ |
dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[node, mk(value, None, null)][vs[vhead].next].deqID ≠ None, vs[vhead].next ≠ null, node ≠ null, node ≠ vtail0, rvowns(vretRefs(vs[node, mk(value, None, null)][vs[vhead].next].deqID.tid)) ≠ Claimed(vs[node, mk(value, None, null)][vs[vhead].next].deqID.tid, vs[node, mk(value, None, null)][vs[vhead].next].val), vhead ≠ node, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((qrl0 + vtail0 ') + qrl, vs, ps, owns), markedp(qrl0, vs), markedp(qrl0, ps), nextnottid(tid, vhead, vs), noid(tid, (qrl0 + vtail0 ') + qrl, vhead, vs), nonullRetRefs((qrl0 + vtail0 ') + qrl, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vtail0].deqID), some?(ps[vtail0].deqID), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, ¬ dups(qrl0 + qrl), ¬ dups(qrl0), ¬ dups(qrl), ¬ node ∈ qrl, ¬ vtail0 ∈ qrl0, ¬ vtail0 ∈ qrl, ¬ node ∈ qrl0, 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 = (vtail0 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vtail0 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead ∈ qrl0 ∨ phead = vtail0, vtail0 = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ qrl0 ≠ [] ∧ qrl0.last = vhead ∧ phead ≠ vtail0 ∧ unmarkedp(qrl, vs) ⊦
| dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[node, mk(value, None, null)][vs[vhead].next].deqID ≠ None, vs[vhead].next ≠ null, node ≠ null, node ≠ vtail0, rvowns(vretRefs(vs[node, mk(value, None, null)][vs[vhead].next].deqID.tid)) ≠ Claimed(vs[node, mk(value, None, null)][vs[vhead].next].deqID.tid, vs[node, mk(value, None, null)][vs[vhead].next].val), vhead ≠ node, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((qrl0 + vtail0 ') + qrl, vs, ps, owns), markedp(qrl0, vs), markedp(qrl0, ps), nextnottid(tid, vhead, vs), noid(tid, (qrl0 + vtail0 ') + qrl, vhead, vs), nonullRetRefs((qrl0 + vtail0 ') + qrl, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vtail0].deqID), some?(ps[vtail0].deqID), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, ¬ dups(qrl0 + qrl), ¬ dups(qrl0), ¬ dups(qrl), ¬ node ∈ qrl, ¬ vtail0 ∈ qrl0, ¬ vtail0 ∈ qrl, ¬ node ∈ qrl0, 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 = (vtail0 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vtail0 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead ∈ qrl0 ∨ phead = vtail0, vtail0 = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ qrl0 ≠ [] ∧ qrl0.last = vhead ∧ phead ≠ vtail0 ∧ unmarkedp(qrl, vs) ⊦ |
⊦ a ≠ b → st[b, d][a] = st[a]
Used simplifier rules: ⊦ a = b → st[b, d][a] = d; (s) ⊦ mk(val, opttid, nxt).deqID = opttid; (s) Used terms: vs, node, mk(value, None, null), vs[vhead].next
| ⊦ a ≠ b → st[b, d][a] = st[a] |
| dom vrvHp = dom prvHp, owns(node) = Some(tid), node ≠ null, node ≠ vtail0, vhead ≠ node, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((qrl0 + vtail0 ') + qrl, vs, ps, owns), markedp(qrl0, ps), markedp(qrl0, vs), nextnottid(tid, vhead, vs), noid(tid, (qrl0 + vtail0 ') + qrl, vhead, vs), nonullRetRefs((qrl0 + vtail0 ') + qrl, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vtail0].deqID), some?(vs[vtail0].deqID), unmarkedp(qrl, ps), node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, ¬ dups(qrl0 + qrl), ¬ dups(qrl0), ¬ dups(qrl), ¬ node ∈ qrl, ¬ vtail0 ∈ qrl0, ¬ vtail0 ∈ qrl, ¬ node ∈ qrl0, 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), vtail0 = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ qrl0 ≠ [] ∧ qrl0.last = vhead ∧ phead ≠ vtail0 ∧ unmarkedp(qrl, vs), phead ∈ qrl0 ∨ phead = vtail0, vtail = (vtail0 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vtail0 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ vtail0 = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs[node, mk(value, None, null)])), qrl0 ≠ [] ∧ qrl0.last = vhead ∧ phead ≠ vtail0 ∧ unmarkedp(qrl, vs) |
dom vrvHp = dom prvHp, owns(node) = Some(tid), node ≠ vhead, node ≠ null, qrl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((qrl0 + vhead ') + qrl, vs, ps, owns), markedp(qrl0, ps), markedp(qrl0, vs), nextnottid(tid, vhead, vs), noid(tid, (qrl0 + vhead ') + qrl, vhead, vs), nonullRetRefs((qrl0 + vhead ') + qrl, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vhead].deqID), some?(vs[vhead].deqID), unmarkedp(qrl.tail, vs), unmarkedp(qrl, ps), node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, ¬ dups(qrl), ¬ dups(qrl0), ¬ dups(qrl0 + qrl), ¬ unmarkedp(qrl.tail, vs[node, mk(value, None, null)]), ¬ node ∈ qrl0, ¬ vhead ∈ qrl, ¬ vhead ∈ qrl0, ¬ node ∈ 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), phead ∈ qrl0 ∨ phead = vhead, vtail = qrl.last ∨ vtail = (vhead ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ qrl0 ≠ [] ∧ qrl0.last = vhead ∧ phead ≠ qrl0.last ∧ unmarkedp(qrl, vs)
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ x ≠ [] → (a ' + x).last = x.last; (s)
| dom vrvHp = dom prvHp, owns(node) = Some(tid), node ≠ vhead, node ≠ null, qrl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((qrl0 + vhead ') + qrl, vs, ps, owns), markedp(qrl0, ps), markedp(qrl0, vs), nextnottid(tid, vhead, vs), noid(tid, (qrl0 + vhead ') + qrl, vhead, vs), nonullRetRefs((qrl0 + vhead ') + qrl, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vhead].deqID), some?(vs[vhead].deqID), unmarkedp(qrl.tail, vs), unmarkedp(qrl, ps), node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, ¬ dups(qrl), ¬ dups(qrl0), ¬ dups(qrl0 + qrl), ¬ unmarkedp(qrl.tail, vs[node, mk(value, None, null)]), ¬ node ∈ qrl0, ¬ vhead ∈ qrl, ¬ vhead ∈ qrl0, ¬ node ∈ 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), phead ∈ qrl0 ∨ phead = vhead, vtail = qrl.last ∨ vtail = (vhead ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ qrl0 ≠ [] ∧ qrl0.last = vhead ∧ phead ≠ qrl0.last ∧ unmarkedp(qrl, vs) |
Used simplifier rules: ⊦ a ' + x ≠ []; (s) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ a + x = a ' + x; (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ ¬ node ∈ rl → (unmarkedp(rl, vs[node, nd]) ↔ unmarkedp(rl, vs)); (s) ⊦ x ≠ [] → (head = x.head ∧ tail = x.tail ↔ x = head + tail); (elim) Used terms: qrl, head, tail
| dom vrvHp = dom prvHp, owns(node) = Some(tid), node ≠ null, node ≠ vtail0, vhead ≠ node, vtail ≠ (vtail0 ' + qrl).last, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((qrl0 + vtail0 ') + qrl, vs, ps, owns), markedp(qrl0, ps), markedp(qrl0, vs), nextnottid(tid, vhead, vs), noid(tid, (qrl0 + vtail0 ') + qrl, vhead, vs), nonullRetRefs((qrl0 + vtail0 ') + qrl, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vtail0].deqID), some?(vs[vtail0].deqID), unmarkedp(qrl, ps), node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, ¬ dups(qrl0 + qrl), ¬ dups(qrl0), ¬ dups(qrl), ¬ node ∈ qrl, ¬ vtail0 ∈ qrl0, ¬ vtail0 ∈ qrl, ¬ node ∈ qrl0, 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), vtail0 = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ qrl0 ≠ [] ∧ qrl0.last = vhead ∧ phead ≠ vtail0 ∧ unmarkedp(qrl, vs), phead ∈ qrl0 ∨ phead = vtail0, vtail = (vtail0 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vtail0 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ qrl ≠ [] ∧ vtail = (vtail0 ' + qrl.butlast).last ∧ vs[node, mk(value, None, null)][qrl.last].deqID = None ∧ vs[node, mk(value, None, null)][qrl.last].next = null |
vs[qrl.last].deqID = None, vs[qrl.last].next = null, dom vrvHp = dom prvHp, owns(node) = Some(tid), (vtail0 ' + qrl.butlast).last ≠ qrl.last, node ≠ vtail0, node ≠ null, qrl ≠ [], vhead ≠ node, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((qrl0 + vtail0 ') + qrl, vs, ps, owns), markedp(qrl0, ps), markedp(qrl0, vs), nextnottid(tid, vhead, vs), noid(tid, (qrl0 + vtail0 ') + qrl, vhead, vs), nonullRetRefs((qrl0 + vtail0 ') + qrl, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vtail0].deqID), some?(vs[vtail0].deqID), unmarkedp(qrl, ps), node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, ¬ dups(qrl), ¬ dups(qrl0), ¬ dups(qrl0 + qrl), ¬ node ∈ qrl0, ¬ vtail0 ∈ qrl, ¬ vtail0 ∈ qrl0, ¬ node ∈ 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), vtail0 = vhead ∧ unmarkedp(qrl.tail, vs) ∨ qrl0 ≠ [] ∧ qrl0.last = vhead ∧ phead ≠ vtail0 ∧ unmarkedp(qrl, vs), phead ∈ qrl0 ∨ phead = vtail0 ⊦ vs[node, mk(value, None, null)][qrl.last].deqID = None ∧ vs[node, mk(value, None, null)][qrl.last].next = null
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ x ≠ [] → (a ' + x).last = x.last; (s)
| vs[qrl.last].deqID = None, vs[qrl.last].next = null, dom vrvHp = dom prvHp, owns(node) = Some(tid), (vtail0 ' + qrl.butlast).last ≠ qrl.last, node ≠ vtail0, node ≠ null, qrl ≠ [], vhead ≠ node, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((qrl0 + vtail0 ') + qrl, vs, ps, owns), markedp(qrl0, ps), markedp(qrl0, vs), nextnottid(tid, vhead, vs), noid(tid, (qrl0 + vtail0 ') + qrl, vhead, vs), nonullRetRefs((qrl0 + vtail0 ') + qrl, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vtail0].deqID), some?(vs[vtail0].deqID), unmarkedp(qrl, ps), node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, ¬ dups(qrl), ¬ dups(qrl0), ¬ dups(qrl0 + qrl), ¬ node ∈ qrl0, ¬ vtail0 ∈ qrl, ¬ vtail0 ∈ qrl0, ¬ node ∈ 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), vtail0 = vhead ∧ unmarkedp(qrl.tail, vs) ∨ qrl0 ≠ [] ∧ qrl0.last = vhead ∧ phead ≠ vtail0 ∧ unmarkedp(qrl, vs), phead ∈ qrl0 ∨ phead = vtail0 ⊦ vs[node, mk(value, None, null)][qrl.last].deqID = None ∧ vs[node, mk(value, None, null)][qrl.last].next = null |
vs[qrl.last].deqID = None, vs[qrl.last].next = null, dom vrvHp = dom prvHp, owns(node) = Some(tid), qrl = phead0 + qrl1, (vtail0 ' + qrl.butlast).last ≠ qrl.last, node ≠ vtail0, node ≠ null, qrl ≠ [], vhead ≠ node, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((qrl0 + vtail0 ') + qrl, vs, ps, owns), markedp(qrl0, vs), markedp(qrl0, ps), nextnottid(tid, vhead, vs), noid(tid, (qrl0 + vtail0 ') + qrl, vhead, vs), nonullRetRefs((qrl0 + vtail0 ') + qrl, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vtail0].deqID), some?(ps[vtail0].deqID), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, ¬ dups(qrl), ¬ dups(qrl0), ¬ dups(qrl0 + qrl), ¬ node ∈ qrl0, ¬ vtail0 ∈ qrl, ¬ vtail0 ∈ qrl0, ¬ node ∈ 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), phead ∈ qrl0 ∨ phead = vtail0, vtail0 = vhead ∧ unmarkedp(qrl1, vs) ∨ qrl0 ≠ [] ∧ qrl0.last = vhead ∧ phead ≠ vtail0 ∧ unmarkedp(qrl, vs) ⊦ vs[node, mk(value, None, null)][qrl.last].deqID = None ∧ vs[node, mk(value, None, null)][qrl.last].next = null
Used simplifier rules: ⊦ x ≠ [] → (head = x.head ∧ tail = x.tail ↔ x = head + tail); (elim) Used terms: qrl, head, tail
| vs[qrl.last].deqID = None, vs[qrl.last].next = null, dom vrvHp = dom prvHp, owns(node) = Some(tid), qrl = phead0 + qrl1, (vtail0 ' + qrl.butlast).last ≠ qrl.last, node ≠ vtail0, node ≠ null, qrl ≠ [], vhead ≠ node, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((qrl0 + vtail0 ') + qrl, vs, ps, owns), markedp(qrl0, vs), markedp(qrl0, ps), nextnottid(tid, vhead, vs), noid(tid, (qrl0 + vtail0 ') + qrl, vhead, vs), nonullRetRefs((qrl0 + vtail0 ') + qrl, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vtail0].deqID), some?(ps[vtail0].deqID), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, ¬ dups(qrl), ¬ dups(qrl0), ¬ dups(qrl0 + qrl), ¬ node ∈ qrl0, ¬ vtail0 ∈ qrl, ¬ vtail0 ∈ qrl0, ¬ node ∈ 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), phead ∈ qrl0 ∨ phead = vtail0, vtail0 = vhead ∧ unmarkedp(qrl1, vs) ∨ qrl0 ≠ [] ∧ qrl0.last = vhead ∧ phead ≠ vtail0 ∧ unmarkedp(qrl, vs) ⊦ vs[node, mk(value, None, null)][qrl.last].deqID = None ∧ vs[node, mk(value, None, null)][qrl.last].next = null |
ps[ps[vtail0].next].deqID = None, vs[(ps[vtail0].next ' + qrl1).last].deqID = None, vs[(ps[vtail0].next ' + qrl1).last].next = null, dom vrvHp = dom prvHp, owns(node) = Some(tid), (vtail0 ' + (ps[vtail0].next ' + qrl1).butlast).last ≠ (ps[vtail0].next ' + qrl1).last, node ≠ ps[vtail0].next, node ≠ null, node ≠ vtail0, vhead ≠ node, vtail0 ≠ ps[vtail0].next, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(qrl0 + vtail0 ' + ps[vtail0].next ' + qrl1, vs, ps, owns), markedp(qrl0, vs), markedp(qrl0, ps), nextnottid(tid, vhead, vs), noid(tid, qrl0 + vtail0 ' + ps[vtail0].next ' + qrl1, vhead, vs), nonullRetRefs(qrl0 + vtail0 ' + ps[vtail0].next ' + qrl1, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vtail0].deqID), some?(ps[vtail0].deqID), unmarkedp(qrl1, ps), phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, ¬ dups(qrl1), ¬ dups(qrl0), ¬ dups(qrl0 + qrl1), ¬ node ∈ qrl1, ¬ vtail0 ∈ qrl0, ¬ vtail0 ∈ qrl1, ¬ node ∈ qrl0, ¬ ps[vtail0].next ∈ qrl0, ¬ ps[vtail0].next ∈ qrl1, 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), vtail0 = vhead ∧ unmarkedp(qrl1, vs) ∨ qrl0 ≠ [] ∧ qrl0.last = vhead ∧ phead ≠ vtail0 ∧ vs[ps[vtail0].next].deqID = None ∧ unmarkedp(qrl1, vs), phead ∈ qrl0 ∨ phead = vtail0 ⊦ vs[node, mk(value, None, null)][(ps[vtail0].next ' + qrl1).last].deqID = None ∧ vs[node, mk(value, None, null)][(ps[vtail0].next ' + qrl1).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] listp-twoin: ⊦ listp(rl + r ' + r0 ' + rl0, vs, ps, owns) → ps[r].next = r0; (forward) from specification DMSQ ⊦ a + x = a ' + x; (s) ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (s) ⊦ a ' + x ≠ []; (s)
| ps[ps[vtail0].next].deqID = None, vs[(ps[vtail0].next ' + qrl1).last].deqID = None, vs[(ps[vtail0].next ' + qrl1).last].next = null, dom vrvHp = dom prvHp, owns(node) = Some(tid), (vtail0 ' + (ps[vtail0].next ' + qrl1).butlast).last ≠ (ps[vtail0].next ' + qrl1).last, node ≠ ps[vtail0].next, node ≠ null, node ≠ vtail0, vhead ≠ node, vtail0 ≠ ps[vtail0].next, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(qrl0 + vtail0 ' + ps[vtail0].next ' + qrl1, vs, ps, owns), markedp(qrl0, vs), markedp(qrl0, ps), nextnottid(tid, vhead, vs), noid(tid, qrl0 + vtail0 ' + ps[vtail0].next ' + qrl1, vhead, vs), nonullRetRefs(qrl0 + vtail0 ' + ps[vtail0].next ' + qrl1, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vtail0].deqID), some?(ps[vtail0].deqID), unmarkedp(qrl1, ps), phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, ¬ dups(qrl1), ¬ dups(qrl0), ¬ dups(qrl0 + qrl1), ¬ node ∈ qrl1, ¬ vtail0 ∈ qrl0, ¬ vtail0 ∈ qrl1, ¬ node ∈ qrl0, ¬ ps[vtail0].next ∈ qrl0, ¬ ps[vtail0].next ∈ qrl1, 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), vtail0 = vhead ∧ unmarkedp(qrl1, vs) ∨ qrl0 ≠ [] ∧ qrl0.last = vhead ∧ phead ≠ vtail0 ∧ vs[ps[vtail0].next].deqID = None ∧ unmarkedp(qrl1, vs), phead ∈ qrl0 ∨ phead = vtail0 ⊦ vs[node, mk(value, None, null)][(ps[vtail0].next ' + qrl1).last].deqID = None ∧ vs[node, mk(value, None, null)][(ps[vtail0].next ' + qrl1).last].next = null |
⊦ y ≠ [] → (x + y).butlast = x + y.butlast
vs[(ps[vtail0].next ' + qrl1).last].deqID = None, ps[ps[vtail0].next].deqID = None, vs[(ps[vtail0].next ' + qrl1).last].next = null, dom vrvHp = dom prvHp, owns(node) = Some(tid), (vtail0 ' + ps[vtail0].next ' + qrl1.butlast).last ≠ (ps[vtail0].next ' + qrl1).last, node ≠ ps[vtail0].next, node ≠ null, node ≠ vtail0, qrl1 ≠ [], vhead ≠ node, vtail0 ≠ ps[vtail0].next, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(qrl0 + vtail0 ' + ps[vtail0].next ' + qrl1, vs, ps, owns), markedp(qrl0, ps), markedp(qrl0, vs), nextnottid(tid, vhead, vs), noid(tid, qrl0 + vtail0 ' + ps[vtail0].next ' + qrl1, vhead, vs), nonullRetRefs(qrl0 + vtail0 ' + ps[vtail0].next ' + qrl1, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vtail0].deqID), some?(vs[vtail0].deqID), unmarkedp(qrl1, ps), node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, ¬ dups(qrl1), ¬ dups(qrl0), ¬ dups(qrl0 + qrl1), ¬ node ∈ qrl1, ¬ vtail0 ∈ qrl0, ¬ vtail0 ∈ qrl1, ¬ node ∈ qrl0, ¬ ps[vtail0].next ∈ qrl0, ¬ ps[vtail0].next ∈ qrl1, 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 ∈ qrl0 ∨ phead = vtail0, vtail0 = vhead ∧ unmarkedp(qrl1, vs) ∨ qrl0 ≠ [] ∧ qrl0.last = vhead ∧ phead ≠ vtail0 ∧ vs[ps[vtail0].next].deqID = None ∧ unmarkedp(qrl1, vs) ⊦ vs[node, mk(value, None, null)][(ps[vtail0].next ' + qrl1).last].deqID = None ∧ vs[node, mk(value, None, null)][(ps[vtail0].next ' + qrl1).last].next = null
Used simplifier rules: ⊦ a '.butlast = []; (s) ⊦ ¬ dups([]); (s) ⊦ ¬ a ∈ []; (s) ⊦ unmarkedp([], vs); (s) ⊦ x + [] = x; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a '.last = a; (s) ⊦ a ≠ b → st[b, d][a] = st[a]; (s) Used terms: ps[vtail0].next ', qrl1
| ⊦ y ≠ [] → (x + y).butlast = x + y.butlast |
| vs[(ps[vtail0].next ' + qrl1).last].deqID = None, ps[ps[vtail0].next].deqID = None, vs[(ps[vtail0].next ' + qrl1).last].next = null, dom vrvHp = dom prvHp, owns(node) = Some(tid), (vtail0 ' + ps[vtail0].next ' + qrl1.butlast).last ≠ (ps[vtail0].next ' + qrl1).last, node ≠ ps[vtail0].next, node ≠ null, node ≠ vtail0, qrl1 ≠ [], vhead ≠ node, vtail0 ≠ ps[vtail0].next, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(qrl0 + vtail0 ' + ps[vtail0].next ' + qrl1, vs, ps, owns), markedp(qrl0, ps), markedp(qrl0, vs), nextnottid(tid, vhead, vs), noid(tid, qrl0 + vtail0 ' + ps[vtail0].next ' + qrl1, vhead, vs), nonullRetRefs(qrl0 + vtail0 ' + ps[vtail0].next ' + qrl1, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vtail0].deqID), some?(vs[vtail0].deqID), unmarkedp(qrl1, ps), node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, ¬ dups(qrl1), ¬ dups(qrl0), ¬ dups(qrl0 + qrl1), ¬ node ∈ qrl1, ¬ vtail0 ∈ qrl0, ¬ vtail0 ∈ qrl1, ¬ node ∈ qrl0, ¬ ps[vtail0].next ∈ qrl0, ¬ ps[vtail0].next ∈ qrl1, 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 ∈ qrl0 ∨ phead = vtail0, vtail0 = vhead ∧ unmarkedp(qrl1, vs) ∨ qrl0 ≠ [] ∧ qrl0.last = vhead ∧ phead ≠ vtail0 ∧ vs[ps[vtail0].next].deqID = None ∧ unmarkedp(qrl1, vs) ⊦ vs[node, mk(value, None, null)][(ps[vtail0].next ' + qrl1).last].deqID = None ∧ vs[node, mk(value, None, null)][(ps[vtail0].next ' + qrl1).last].next = null |
ps[ps[vtail0].next].deqID = None, vs[qrl1.last].deqID = None, vs[qrl1.last].next = null, dom vrvHp = dom prvHp, owns(node) = Some(tid), (ps[vtail0].next ' + qrl1.butlast).last ≠ qrl1.last, node ≠ ps[vtail0].next, node ≠ null, node ≠ vtail0, qrl1 ≠ [], vhead ≠ node, vtail0 ≠ ps[vtail0].next, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(qrl0 + vtail0 ' + ps[vtail0].next ' + qrl1, vs, ps, owns), markedp(qrl0, vs), markedp(qrl0, ps), nextnottid(tid, vhead, vs), noid(tid, qrl0 + vtail0 ' + ps[vtail0].next ' + qrl1, vhead, vs), nonullRetRefs(qrl0 + vtail0 ' + ps[vtail0].next ' + qrl1, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vtail0].deqID), some?(ps[vtail0].deqID), unmarkedp(qrl1, ps), phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, ¬ dups(qrl1), ¬ dups(qrl0), ¬ dups(qrl0 + qrl1), ¬ node ∈ qrl1, ¬ vtail0 ∈ qrl0, ¬ vtail0 ∈ qrl1, ¬ node ∈ qrl0, ¬ ps[vtail0].next ∈ qrl0, ¬ ps[vtail0].next ∈ qrl1, 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), vtail0 = vhead ∧ unmarkedp(qrl1, vs) ∨ qrl0 ≠ [] ∧ qrl0.last = vhead ∧ phead ≠ vtail0 ∧ vs[ps[vtail0].next].deqID = None ∧ unmarkedp(qrl1, vs), phead ∈ qrl0 ∨ phead = vtail0 ⊦ vs[node, mk(value, None, null)][qrl1.last].deqID = None ∧ vs[node, mk(value, None, null)][qrl1.last].next = null
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ x ≠ [] → (a ' + x).last = x.last; (s) ⊦ (b ' + a ' + x).last = (a ' + x).last; (s)
| ps[ps[vtail0].next].deqID = None, vs[qrl1.last].deqID = None, vs[qrl1.last].next = null, dom vrvHp = dom prvHp, owns(node) = Some(tid), (ps[vtail0].next ' + qrl1.butlast).last ≠ qrl1.last, node ≠ ps[vtail0].next, node ≠ null, node ≠ vtail0, qrl1 ≠ [], vhead ≠ node, vtail0 ≠ ps[vtail0].next, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(qrl0 + vtail0 ' + ps[vtail0].next ' + qrl1, vs, ps, owns), markedp(qrl0, vs), markedp(qrl0, ps), nextnottid(tid, vhead, vs), noid(tid, qrl0 + vtail0 ' + ps[vtail0].next ' + qrl1, vhead, vs), nonullRetRefs(qrl0 + vtail0 ' + ps[vtail0].next ' + qrl1, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vtail0].deqID), some?(ps[vtail0].deqID), unmarkedp(qrl1, ps), phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, ¬ dups(qrl1), ¬ dups(qrl0), ¬ dups(qrl0 + qrl1), ¬ node ∈ qrl1, ¬ vtail0 ∈ qrl0, ¬ vtail0 ∈ qrl1, ¬ node ∈ qrl0, ¬ ps[vtail0].next ∈ qrl0, ¬ ps[vtail0].next ∈ qrl1, 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), vtail0 = vhead ∧ unmarkedp(qrl1, vs) ∨ qrl0 ≠ [] ∧ qrl0.last = vhead ∧ phead ≠ vtail0 ∧ vs[ps[vtail0].next].deqID = None ∧ unmarkedp(qrl1, vs), phead ∈ qrl0 ∨ phead = vtail0 ⊦ vs[node, mk(value, None, null)][qrl1.last].deqID = None ∧ vs[node, mk(value, None, null)][qrl1.last].next = null |
Used simplifier rules: ⊦ x + a ' ≠ []; (s) ⊦ dups(x + a ') ↔ a ∈ x ∨ dups(x); (ws) ⊦ 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] ⊦ a ≠ b → st[b, d][a] = st[a]; (s) x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: qrl1, phead0, y
| dom vrvHp = dom prvHp, owns(node) = Some(tid), node ≠ null, node ≠ vtail0, vhead ≠ node, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((qrl0 + vtail0 ') + qrl, vs, ps, owns), markedp(qrl0, ps), markedp(qrl0, vs), nextnottid(tid, vhead, vs), noid(tid, (qrl0 + vtail0 ') + qrl, vhead, vs), nonullRetRefs((qrl0 + vtail0 ') + qrl, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vtail0].deqID), some?(vs[vtail0].deqID), unmarkedp(qrl, ps), node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, ¬ dups(qrl0 + qrl), ¬ dups(qrl0), ¬ dups(qrl), ¬ nextnottid(tid, vhead, vs[node, mk(value, None, null)]), ¬ node ∈ qrl, ¬ vtail0 ∈ qrl0, ¬ vtail0 ∈ qrl, ¬ node ∈ qrl0, 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), vtail0 = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ qrl0 ≠ [] ∧ qrl0.last = vhead ∧ phead ≠ vtail0 ∧ unmarkedp(qrl, vs), phead ∈ qrl0 ∨ phead = vtail0, vtail = (vtail0 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vtail0 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ |
⊦ nextnottid(tid, vhead, vs) ↔ vs[vhead].next ≠ null → vs[vs[vhead].next].deqID ≠ Some(tid)
vs[node, mk(value, None, null)][vs[node, mk(value, None, null)][vhead].next].deqID = Some(tid), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[node, mk(value, None, null)][vhead].next ≠ null, node ≠ null, node ≠ vtail0, vhead ≠ node, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((qrl0 + vtail0 ') + qrl, vs, ps, owns), markedp(qrl0, vs), markedp(qrl0, ps), nextnottid(tid, vhead, vs), noid(tid, (qrl0 + vtail0 ') + qrl, vhead, vs), nonullRetRefs((qrl0 + vtail0 ') + qrl, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vtail0].deqID), some?(ps[vtail0].deqID), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, ¬ dups(qrl0 + qrl), ¬ dups(qrl0), ¬ dups(qrl), ¬ node ∈ qrl, ¬ vtail0 ∈ qrl0, ¬ vtail0 ∈ qrl, ¬ node ∈ qrl0, 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 = (vtail0 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vtail0 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead ∈ qrl0 ∨ phead = vtail0, vtail0 = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ qrl0 ≠ [] ∧ qrl0.last = vhead ∧ phead ≠ vtail0 ∧ unmarkedp(qrl, vs) ⊦
Used terms: tid, vhead, vs[node, mk(value, None, null)]
| ⊦ nextnottid(tid, vhead, vs) ↔ vs[vhead].next ≠ null → vs[vs[vhead].next].deqID ≠ Some(tid) |
| vs[node, mk(value, None, null)][vs[node, mk(value, None, null)][vhead].next].deqID = Some(tid), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[node, mk(value, None, null)][vhead].next ≠ null, node ≠ null, node ≠ vtail0, vhead ≠ node, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((qrl0 + vtail0 ') + qrl, vs, ps, owns), markedp(qrl0, vs), markedp(qrl0, ps), nextnottid(tid, vhead, vs), noid(tid, (qrl0 + vtail0 ') + qrl, vhead, vs), nonullRetRefs((qrl0 + vtail0 ') + qrl, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vtail0].deqID), some?(ps[vtail0].deqID), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, ¬ dups(qrl0 + qrl), ¬ dups(qrl0), ¬ dups(qrl), ¬ node ∈ qrl, ¬ vtail0 ∈ qrl0, ¬ vtail0 ∈ qrl, ¬ node ∈ qrl0, 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 = (vtail0 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vtail0 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead ∈ qrl0 ∨ phead = vtail0, vtail0 = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ qrl0 ≠ [] ∧ qrl0.last = vhead ∧ phead ≠ vtail0 ∧ unmarkedp(qrl, vs) ⊦ |
vs[node, mk(value, None, null)][vs[vhead].next].deqID = Some(tid), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[vhead].next ≠ null, node ≠ null, node ≠ vtail0, vhead ≠ node, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((qrl0 + vtail0 ') + qrl, vs, ps, owns), markedp(qrl0, ps), markedp(qrl0, vs), nextnottid(tid, vhead, vs), noid(tid, (qrl0 + vtail0 ') + qrl, vhead, vs), nonullRetRefs((qrl0 + vtail0 ') + qrl, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vtail0].deqID), some?(vs[vtail0].deqID), unmarkedp(qrl, ps), node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, ¬ dups(qrl0 + qrl), ¬ dups(qrl0), ¬ dups(qrl), ¬ node ∈ qrl, ¬ vtail0 ∈ qrl0, ¬ vtail0 ∈ qrl, ¬ node ∈ qrl0, 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), vtail0 = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ qrl0 ≠ [] ∧ qrl0.last = vhead ∧ phead ≠ vtail0 ∧ unmarkedp(qrl, vs), phead ∈ qrl0 ∨ phead = vtail0, vtail = (vtail0 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vtail0 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦
Used simplifier rules: ⊦ a ≠ b → st[b, d][a] = st[a]; (s)
| vs[node, mk(value, None, null)][vs[vhead].next].deqID = Some(tid), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[vhead].next ≠ null, node ≠ null, node ≠ vtail0, vhead ≠ node, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((qrl0 + vtail0 ') + qrl, vs, ps, owns), markedp(qrl0, ps), markedp(qrl0, vs), nextnottid(tid, vhead, vs), noid(tid, (qrl0 + vtail0 ') + qrl, vhead, vs), nonullRetRefs((qrl0 + vtail0 ') + qrl, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vtail0].deqID), some?(vs[vtail0].deqID), unmarkedp(qrl, ps), node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, ¬ dups(qrl0 + qrl), ¬ dups(qrl0), ¬ dups(qrl), ¬ node ∈ qrl, ¬ vtail0 ∈ qrl0, ¬ vtail0 ∈ qrl, ¬ node ∈ qrl0, 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), vtail0 = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ qrl0 ≠ [] ∧ qrl0.last = vhead ∧ phead ≠ vtail0 ∧ unmarkedp(qrl, vs), phead ∈ qrl0 ∨ phead = vtail0, vtail = (vtail0 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vtail0 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ |
⊦ nextnottid(tid, vhead, vs) ↔ vs[vhead].next ≠ null → vs[vs[vhead].next].deqID ≠ Some(tid)
vs[node, mk(value, None, null)][vs[vhead].next].deqID = Some(tid), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[vhead].next ≠ null, node ≠ null, node ≠ vtail0, vhead ≠ node, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((qrl0 + vtail0 ') + qrl, vs, ps, owns), markedp(qrl0, vs), markedp(qrl0, ps), noid(tid, (qrl0 + vtail0 ') + qrl, vhead, vs), nonullRetRefs((qrl0 + vtail0 ') + qrl, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vtail0].deqID), some?(ps[vtail0].deqID), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, ¬ dups(qrl0 + qrl), ¬ dups(qrl0), ¬ dups(qrl), ¬ node ∈ qrl, ¬ vtail0 ∈ qrl0, ¬ vtail0 ∈ qrl, ¬ node ∈ qrl0, 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), vs[vhead].next ≠ null → vs[vs[vhead].next].deqID ≠ Some(tid), vtail = (vtail0 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vtail0 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead ∈ qrl0 ∨ phead = vtail0, vtail0 = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ qrl0 ≠ [] ∧ qrl0.last = vhead ∧ phead ≠ vtail0 ∧ unmarkedp(qrl, vs) ⊦
Used terms: tid, vhead, vs
| ⊦ nextnottid(tid, vhead, vs) ↔ vs[vhead].next ≠ null → vs[vs[vhead].next].deqID ≠ Some(tid) |
| vs[node, mk(value, None, null)][vs[vhead].next].deqID = Some(tid), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[vhead].next ≠ null, node ≠ null, node ≠ vtail0, vhead ≠ node, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((qrl0 + vtail0 ') + qrl, vs, ps, owns), markedp(qrl0, vs), markedp(qrl0, ps), noid(tid, (qrl0 + vtail0 ') + qrl, vhead, vs), nonullRetRefs((qrl0 + vtail0 ') + qrl, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vtail0].deqID), some?(ps[vtail0].deqID), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, ¬ dups(qrl0 + qrl), ¬ dups(qrl0), ¬ dups(qrl), ¬ node ∈ qrl, ¬ vtail0 ∈ qrl0, ¬ vtail0 ∈ qrl, ¬ node ∈ qrl0, 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), vs[vhead].next ≠ null → vs[vs[vhead].next].deqID ≠ Some(tid), vtail = (vtail0 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vtail0 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead ∈ qrl0 ∨ phead = vtail0, vtail0 = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ qrl0 ≠ [] ∧ qrl0.last = vhead ∧ phead ≠ vtail0 ∧ unmarkedp(qrl, vs) ⊦ |
vs[node, mk(value, None, null)][vs[vhead].next].deqID = Some(tid), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[vs[vhead].next].deqID ≠ Some(tid), vs[vhead].next ≠ null, node ≠ null, node ≠ vtail0, vhead ≠ node, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((qrl0 + vtail0 ') + qrl, vs, ps, owns), markedp(qrl0, ps), markedp(qrl0, vs), noid(tid, (qrl0 + vtail0 ') + qrl, vhead, vs), nonullRetRefs((qrl0 + vtail0 ') + qrl, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vtail0].deqID), some?(vs[vtail0].deqID), unmarkedp(qrl, ps), node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, ¬ dups(qrl0 + qrl), ¬ dups(qrl0), ¬ dups(qrl), ¬ node ∈ qrl, ¬ vtail0 ∈ qrl0, ¬ vtail0 ∈ qrl, ¬ node ∈ qrl0, 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), vtail0 = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ qrl0 ≠ [] ∧ qrl0.last = vhead ∧ phead ≠ vtail0 ∧ unmarkedp(qrl, vs), phead ∈ qrl0 ∨ phead = vtail0, vtail = (vtail0 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vtail0 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦
| vs[node, mk(value, None, null)][vs[vhead].next].deqID = Some(tid), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[vs[vhead].next].deqID ≠ Some(tid), vs[vhead].next ≠ null, node ≠ null, node ≠ vtail0, vhead ≠ node, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((qrl0 + vtail0 ') + qrl, vs, ps, owns), markedp(qrl0, ps), markedp(qrl0, vs), noid(tid, (qrl0 + vtail0 ') + qrl, vhead, vs), nonullRetRefs((qrl0 + vtail0 ') + qrl, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vtail0].deqID), some?(vs[vtail0].deqID), unmarkedp(qrl, ps), node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, ¬ dups(qrl0 + qrl), ¬ dups(qrl0), ¬ dups(qrl), ¬ node ∈ qrl, ¬ vtail0 ∈ qrl0, ¬ vtail0 ∈ qrl, ¬ node ∈ qrl0, 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), vtail0 = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ qrl0 ≠ [] ∧ qrl0.last = vhead ∧ phead ≠ vtail0 ∧ unmarkedp(qrl, vs), phead ∈ qrl0 ∨ phead = vtail0, vtail = (vtail0 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vtail0 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ |
⊦ a ≠ b → st[b, d][a] = st[a]
Used simplifier rules: ⊦ a = b → st[b, d][a] = d; (s) ⊦ mk(val, opttid, nxt).deqID = opttid; (s) ⊦ None ≠ Some(tid); (s) Used terms: vs, node, mk(value, None, null), vs[vhead].next
| ⊦ a ≠ b → st[b, d][a] = st[a] |
| dom vrvHp = dom prvHp, owns(node) = Some(tid), node ≠ null, node ≠ vtail0, vhead ≠ node, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((qrl0 + vtail0 ') + qrl, vs, ps, owns), markedp(qrl0, ps), markedp(qrl0, vs), nextnottid(tid, vhead, vs), noid(tid, (qrl0 + vtail0 ') + qrl, vhead, vs), nonullRetRefs((qrl0 + vtail0 ') + qrl, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vtail0].deqID), some?(vs[vtail0].deqID), unmarkedp(qrl, ps), node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, ¬ dups(qrl0 + qrl), ¬ dups(qrl0), ¬ dups(qrl), ¬ noid(tid, (qrl0 + vtail0 ') + qrl, vhead, vs[node, mk(value, None, null)]), ¬ node ∈ qrl, ¬ vtail0 ∈ qrl0, ¬ vtail0 ∈ qrl, ¬ node ∈ qrl0, 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), vtail0 = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ qrl0 ≠ [] ∧ qrl0.last = vhead ∧ phead ≠ vtail0 ∧ unmarkedp(qrl, vs), phead ∈ qrl0 ∨ phead = vtail0, vtail = (vtail0 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vtail0 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ |
⊦ noid(tid, rl, r, vs) → (noid(tid, rl0, r, vs0) ↔ (∀ r0. (r0 ≠ r ∧ r0 ∈ rl from r → vs[r0].deqID ≠ Some(tid)) → r0 ≠ r ∧ r0 ∈ rl0 from r → vs0[r0].deqID ≠ Some(tid)))
dom vrvHp = dom prvHp, owns(node) = Some(tid), node ≠ null, node ≠ vtail0, vhead ≠ node, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((qrl0 + vtail0 ') + qrl, vs, ps, owns), markedp(qrl0, vs), markedp(qrl0, ps), nextnottid(tid, vhead, vs), noid(tid, (qrl0 + vtail0 ') + qrl, vhead, vs), nonullRetRefs((qrl0 + vtail0 ') + qrl, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vtail0].deqID), some?(ps[vtail0].deqID), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, ¬ dups(qrl0 + qrl), ¬ dups(qrl0), ¬ dups(qrl), ¬ node ∈ qrl, ¬ vtail0 ∈ qrl0, ¬ vtail0 ∈ qrl, ¬ node ∈ qrl0, 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 ≠ vhead ∧ r0 ∈ (qrl0 + vtail0 ') + qrl from vhead → vs[r0].deqID ≠ Some(tid)) → r0 ≠ vhead ∧ r0 ∈ (qrl0 + vtail0 ') + qrl from vhead → vs[node, mk(value, None, null)][r0].deqID ≠ Some(tid)), vtail = (vtail0 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vtail0 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead ∈ qrl0 ∨ phead = vtail0, vtail0 = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ qrl0 ≠ [] ∧ qrl0.last = vhead ∧ phead ≠ vtail0 ∧ unmarkedp(qrl, vs) ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: (qrl0 + vtail0 ') + qrl, tid, vhead, vs[node, mk(value, None, null)], (qrl0 + vtail0 ') + qrl, vs
| ⊦ noid(tid, rl, r, vs) → (noid(tid, rl0, r, vs0) ↔ (∀ r0. (r0 ≠ r ∧ r0 ∈ rl from r → vs[r0].deqID ≠ Some(tid)) → r0 ≠ r ∧ r0 ∈ rl0 from r → vs0[r0].deqID ≠ Some(tid))) |
| dom vrvHp = dom prvHp, owns(node) = Some(tid), node ≠ null, node ≠ vtail0, vhead ≠ node, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((qrl0 + vtail0 ') + qrl, vs, ps, owns), markedp(qrl0, vs), markedp(qrl0, ps), nextnottid(tid, vhead, vs), noid(tid, (qrl0 + vtail0 ') + qrl, vhead, vs), nonullRetRefs((qrl0 + vtail0 ') + qrl, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vtail0].deqID), some?(ps[vtail0].deqID), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, ¬ dups(qrl0 + qrl), ¬ dups(qrl0), ¬ dups(qrl), ¬ node ∈ qrl, ¬ vtail0 ∈ qrl0, ¬ vtail0 ∈ qrl, ¬ node ∈ qrl0, 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 ≠ vhead ∧ r0 ∈ (qrl0 + vtail0 ') + qrl from vhead → vs[r0].deqID ≠ Some(tid)) → r0 ≠ vhead ∧ r0 ∈ (qrl0 + vtail0 ') + qrl from vhead → vs[node, mk(value, None, null)][r0].deqID ≠ Some(tid)), vtail = (vtail0 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vtail0 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead ∈ qrl0 ∨ phead = vtail0, vtail0 = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ qrl0 ≠ [] ∧ qrl0.last = vhead ∧ phead ≠ vtail0 ∧ unmarkedp(qrl, vs) ⊦ |
vs[node, mk(value, None, null)][r0].deqID = Some(tid), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[r0].deqID ≠ Some(tid), node ≠ null, node ≠ vtail0, r0 ≠ vhead, vhead ≠ node, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((qrl0 + vtail0 ') + qrl, vs, ps, owns), markedp(qrl0, ps), markedp(qrl0, vs), nextnottid(tid, vhead, vs), noid(tid, (qrl0 + vtail0 ') + qrl, vhead, vs), nonullRetRefs((qrl0 + vtail0 ') + qrl, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vtail0].deqID), some?(vs[vtail0].deqID), unmarkedp(qrl, ps), r0 ∈ (qrl0 + vtail0 ') + qrl from vhead, node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, ¬ dups(qrl0 + qrl), ¬ dups(qrl0), ¬ dups(qrl), ¬ node ∈ qrl, ¬ vtail0 ∈ qrl0, ¬ vtail0 ∈ qrl, ¬ node ∈ qrl0, 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), vtail0 = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ qrl0 ≠ [] ∧ qrl0.last = vhead ∧ phead ≠ vtail0 ∧ unmarkedp(qrl, vs), phead ∈ qrl0 ∨ phead = vtail0, vtail = (vtail0 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vtail0 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist]
| vs[node, mk(value, None, null)][r0].deqID = Some(tid), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[r0].deqID ≠ Some(tid), node ≠ null, node ≠ vtail0, r0 ≠ vhead, vhead ≠ node, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((qrl0 + vtail0 ') + qrl, vs, ps, owns), markedp(qrl0, ps), markedp(qrl0, vs), nextnottid(tid, vhead, vs), noid(tid, (qrl0 + vtail0 ') + qrl, vhead, vs), nonullRetRefs((qrl0 + vtail0 ') + qrl, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vtail0].deqID), some?(vs[vtail0].deqID), unmarkedp(qrl, ps), r0 ∈ (qrl0 + vtail0 ') + qrl from vhead, node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, ¬ dups(qrl0 + qrl), ¬ dups(qrl0), ¬ dups(qrl), ¬ node ∈ qrl, ¬ vtail0 ∈ qrl0, ¬ vtail0 ∈ qrl, ¬ node ∈ qrl0, 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), vtail0 = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ qrl0 ≠ [] ∧ qrl0.last = vhead ∧ phead ≠ vtail0 ∧ unmarkedp(qrl, vs), phead ∈ qrl0 ∨ phead = vtail0, vtail = (vtail0 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vtail0 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ |
⊦ a ≠ b → st[b, d][a] = st[a]
Used simplifier rules: ⊦ a = b → st[b, d][a] = d; (s) ⊦ mk(val, opttid, nxt).deqID = opttid; (s) ⊦ None ≠ Some(tid); (s) Used terms: vs, node, mk(value, None, null), r0
| ⊦ a ≠ b → st[b, d][a] = st[a] |
| dom vrvHp = dom prvHp, owns(node) = Some(tid), node ≠ null, node ≠ vtail0, vhead ≠ node, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((qrl0 + vtail0 ') + qrl, vs, ps, owns), markedp(qrl0, ps), markedp(qrl0, vs), nextnottid(tid, vhead, vs), noid(tid, (qrl0 + vtail0 ') + qrl, vhead, vs), nonullRetRefs((qrl0 + vtail0 ') + qrl, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vtail0].deqID), some?(vs[vtail0].deqID), unmarkedp(qrl, ps), node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, ¬ dups(qrl0 + qrl), ¬ dups(qrl0), ¬ dups(qrl), ¬ oneowns(tid, node, owns, vs[node, mk(value, None, null)], ps), ¬ node ∈ qrl, ¬ vtail0 ∈ qrl0, ¬ vtail0 ∈ qrl, ¬ node ∈ qrl0, 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), vtail0 = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ qrl0 ≠ [] ∧ qrl0.last = vhead ∧ phead ≠ vtail0 ∧ unmarkedp(qrl, vs), phead ∈ qrl0 ∨ phead = vtail0, vtail = (vtail0 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vtail0 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ |
⊦ oneowns(tid, r, owns, vs, ps) ↔ r ∈ vs ∧ r ∈ ps ∧ owns(r) = Some(tid) ∧ (∀ r0. r0 ≠ r ∧ owns(r0) ≠ None → owns(r0).tid ≠ tid)
dom vrvHp = dom prvHp, owns(node) = Some(tid), node ≠ null, node ≠ vtail0, vhead ≠ node, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((qrl0 + vtail0 ') + qrl, vs, ps, owns), markedp(qrl0, vs), markedp(qrl0, ps), nextnottid(tid, vhead, vs), noid(tid, (qrl0 + vtail0 ') + qrl, vhead, vs), nonullRetRefs((qrl0 + vtail0 ') + qrl, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vtail0].deqID), some?(ps[vtail0].deqID), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, ¬ dups(qrl0 + qrl), ¬ dups(qrl0), ¬ dups(qrl), ¬ node ∈ qrl, ¬ vtail0 ∈ qrl0, ¬ vtail0 ∈ qrl, ¬ node ∈ qrl0, 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 = (vtail0 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vtail0 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead ∈ qrl0 ∨ phead = vtail0, vtail0 = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ qrl0 ≠ [] ∧ qrl0.last = vhead ∧ phead ≠ vtail0 ∧ unmarkedp(qrl, vs), ¬ node ∈ vs[node, mk(value, None, null)] ∨ ¬ node ∈ ps ∨ owns(node) ≠ Some(tid) ∨ (∃ r0. ¬(r0 ≠ node ∧ owns(r0) ≠ None → owns(r0).tid ≠ tid)) ⊦
Used terms: ps, tid, owns, node, vs[node, mk(value, None, null)]
| ⊦ oneowns(tid, r, owns, vs, ps) ↔ r ∈ vs ∧ r ∈ ps ∧ owns(r) = Some(tid) ∧ (∀ r0. r0 ≠ r ∧ owns(r0) ≠ None → owns(r0).tid ≠ tid) |
| dom vrvHp = dom prvHp, owns(node) = Some(tid), node ≠ null, node ≠ vtail0, vhead ≠ node, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((qrl0 + vtail0 ') + qrl, vs, ps, owns), markedp(qrl0, vs), markedp(qrl0, ps), nextnottid(tid, vhead, vs), noid(tid, (qrl0 + vtail0 ') + qrl, vhead, vs), nonullRetRefs((qrl0 + vtail0 ') + qrl, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vtail0].deqID), some?(ps[vtail0].deqID), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, ¬ dups(qrl0 + qrl), ¬ dups(qrl0), ¬ dups(qrl), ¬ node ∈ qrl, ¬ vtail0 ∈ qrl0, ¬ vtail0 ∈ qrl, ¬ node ∈ qrl0, 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 = (vtail0 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vtail0 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead ∈ qrl0 ∨ phead = vtail0, vtail0 = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ qrl0 ≠ [] ∧ qrl0.last = vhead ∧ phead ≠ vtail0 ∧ unmarkedp(qrl, vs), ¬ node ∈ vs[node, mk(value, None, null)] ∨ ¬ node ∈ ps ∨ owns(node) ≠ Some(tid) ∨ (∃ r0. ¬(r0 ≠ node ∧ owns(r0) ≠ None → owns(r0).tid ≠ tid)) ⊦ |
dom vrvHp = dom prvHp, owns(node) = Some(owns(r0).tid), node ≠ vtail0, node ≠ null, owns(r0) ≠ None, r0 ≠ node, vhead ≠ node, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((qrl0 + vtail0 ') + qrl, vs, ps, owns), markedp(qrl0, vs), markedp(qrl0, ps), nextnottid(owns(r0).tid, vhead, vs), noid(owns(r0).tid, (qrl0 + vtail0 ') + qrl, vhead, vs), nonullRetRefs((qrl0 + vtail0 ') + qrl, vs, vretRefs, pretRefs), oneowns(owns(r0).tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vtail0].deqID), some?(ps[vtail0].deqID), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, ¬ dups(qrl), ¬ dups(qrl0), ¬ dups(qrl0 + qrl), ¬ node ∈ qrl0, ¬ vtail0 ∈ qrl, ¬ vtail0 ∈ qrl0, ¬ node ∈ 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 = (vtail0 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vtail0 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead ∈ qrl0 ∨ phead = vtail0, vtail0 = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ qrl0 ≠ [] ∧ qrl0.last = vhead ∧ phead ≠ vtail0 ∧ unmarkedp(qrl, vs) ⊦
Used simplifier rules: ⊦ a ∈ st[a, d]; (s)
| dom vrvHp = dom prvHp, owns(node) = Some(owns(r0).tid), node ≠ vtail0, node ≠ null, owns(r0) ≠ None, r0 ≠ node, vhead ≠ node, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((qrl0 + vtail0 ') + qrl, vs, ps, owns), markedp(qrl0, vs), markedp(qrl0, ps), nextnottid(owns(r0).tid, vhead, vs), noid(owns(r0).tid, (qrl0 + vtail0 ') + qrl, vhead, vs), nonullRetRefs((qrl0 + vtail0 ') + qrl, vs, vretRefs, pretRefs), oneowns(owns(r0).tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vtail0].deqID), some?(ps[vtail0].deqID), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, ¬ dups(qrl), ¬ dups(qrl0), ¬ dups(qrl0 + qrl), ¬ node ∈ qrl0, ¬ vtail0 ∈ qrl, ¬ vtail0 ∈ qrl0, ¬ node ∈ 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 = (vtail0 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vtail0 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead ∈ qrl0 ∨ phead = vtail0, vtail0 = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ qrl0 ≠ [] ∧ qrl0.last = vhead ∧ phead ≠ vtail0 ∧ unmarkedp(qrl, vs) ⊦ |
⊦ oneowns(tid, r, owns, vs, ps) ↔ r ∈ vs ∧ r ∈ ps ∧ owns(r) = Some(tid) ∧ (∀ r0. r0 ≠ r ∧ owns(r0) ≠ None → owns(r0).tid ≠ tid)
dom vrvHp = dom prvHp, owns(node) = Some(owns(r0).tid), node ≠ vtail0, node ≠ null, owns(r0) ≠ None, r0 ≠ node, vhead ≠ node, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((qrl0 + vtail0 ') + qrl, vs, ps, owns), markedp(qrl0, ps), markedp(qrl0, vs), nextnottid(owns(r0).tid, vhead, vs), noid(owns(r0).tid, (qrl0 + vtail0 ') + qrl, vhead, vs), nonullRetRefs((qrl0 + vtail0 ') + qrl, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vtail0].deqID), some?(vs[vtail0].deqID), unmarkedp(qrl, ps), phead ∈ vs, phead ∈ ps, node ∈ vs, node ∈ ps, ¬ dups(qrl), ¬ dups(qrl0), ¬ dups(qrl0 + qrl), ¬ node ∈ qrl0, ¬ vtail0 ∈ qrl, ¬ vtail0 ∈ qrl0, ¬ node ∈ 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), ∀ r1. r1 ≠ node ∧ owns(r1) ≠ None → owns(r1).tid ≠ owns(r0).tid, vtail0 = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ qrl0 ≠ [] ∧ qrl0.last = vhead ∧ phead ≠ vtail0 ∧ unmarkedp(qrl, vs), phead ∈ qrl0 ∨ phead = vtail0, vtail = (vtail0 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vtail0 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦
Used terms: ps, owns(r0).tid, owns, node, vs
| ⊦ oneowns(tid, r, owns, vs, ps) ↔ r ∈ vs ∧ r ∈ ps ∧ owns(r) = Some(tid) ∧ (∀ r0. r0 ≠ r ∧ owns(r0) ≠ None → owns(r0).tid ≠ tid) |
| dom vrvHp = dom prvHp, owns(node) = Some(owns(r0).tid), node ≠ vtail0, node ≠ null, owns(r0) ≠ None, r0 ≠ node, vhead ≠ node, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((qrl0 + vtail0 ') + qrl, vs, ps, owns), markedp(qrl0, ps), markedp(qrl0, vs), nextnottid(owns(r0).tid, vhead, vs), noid(owns(r0).tid, (qrl0 + vtail0 ') + qrl, vhead, vs), nonullRetRefs((qrl0 + vtail0 ') + qrl, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vtail0].deqID), some?(vs[vtail0].deqID), unmarkedp(qrl, ps), phead ∈ vs, phead ∈ ps, node ∈ vs, node ∈ ps, ¬ dups(qrl), ¬ dups(qrl0), ¬ dups(qrl0 + qrl), ¬ node ∈ qrl0, ¬ vtail0 ∈ qrl, ¬ vtail0 ∈ qrl0, ¬ node ∈ 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), ∀ r1. r1 ≠ node ∧ owns(r1) ≠ None → owns(r1).tid ≠ owns(r0).tid, vtail0 = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ qrl0 ≠ [] ∧ qrl0.last = vhead ∧ phead ≠ vtail0 ∧ unmarkedp(qrl, vs), phead ∈ qrl0 ∨ phead = vtail0, vtail = (vtail0 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vtail0 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ |
Used terms: r0
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.