| ⊦ ( 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) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ ¬ 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, E3, a) ∧ pcstepf(gs, ls, E3, a) = E4 → ( listp(gstepf(gs, ls, E3, a).orl + gstepf(gs, ls, E3, a).qrl, gstepf(gs, ls, E3, a).vs, gstepf(gs, ls, E3, a).ps, gstepf(gs, ls, E3, a).owns) ∧ ¬ dups(gstepf(gs, ls, E3, a).orl + gstepf(gs, ls, E3, a).qrl) ∧ markedp(gstepf(gs, ls, E3, a).orl, gstepf(gs, ls, E3, a).ps) ∧ markedp(gstepf(gs, ls, E3, a).orl, gstepf(gs, ls, E3, a).vs) ∧ unmarkedp(gstepf(gs, ls, E3, a).qrl, gstepf(gs, ls, E3, a).ps) ∧ gstepf(gs, ls, E3, a).orl ≠ [] ∧ gstepf(gs, ls, E3, a).phead ∈ gstepf(gs, ls, E3, a).orl ∧ rvownerok(gstepf(gs, ls, E3, a).vretRefs, gstepf(gs, ls, E3, a).vrvHp, gstepf(gs, ls, E3, a).rvowns) ∧ allocrv(gstepf(gs, ls, E3, a).vretRefs, gstepf(gs, ls, E3, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, E3, a).orl + gstepf(gs, ls, E3, a).qrl, gstepf(gs, ls, E3, a).vs, gstepf(gs, ls, E3, a).vretRefs, gstepf(gs, ls, E3, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, E3, a).pretRefs, gstepf(gs, ls, E3, a).prvHp, gstepf(gs, ls, E3, a).rvowns) ∧ allocrv(gstepf(gs, ls, E3, a).pretRefs, gstepf(gs, ls, E3, a).prvHp) ∧ dom gstepf(gs, ls, E3, a).vrvHp = dom gstepf(gs, ls, E3, a).prvHp ∧ ( gstepf(gs, ls, E3, a).vs[gstepf(gs, ls, E3, a).vhead].next ≠ null ∧ gstepf(gs, ls, E3, a).vs[gstepf(gs, ls, E3, a).vs[gstepf(gs, ls, E3, a).vhead].next].deqID ≠ None → gstepf(gs, ls, E3, a).rvowns (gstepf(gs, ls, E3, a).vretRefs(gstepf(gs, ls, E3, a).vs[gstepf(gs, ls, E3, a).vs[gstepf(gs, ls, E3, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, E3, a).vs[gstepf(gs, ls, E3, a).vs[gstepf(gs, ls, E3, a).vhead].next].deqID.tid, gstepf(gs, ls, E3, a).vs[gstepf(gs, ls, E3, a).vs[gstepf(gs, ls, E3, a).vhead].next].val)) ∧ ( gstepf(gs, ls, E3, a).orl.last = gstepf(gs, ls, E3, a).vhead ∧ (gstepf(gs, ls, E3, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, E3, a).qrl.tail, gstepf(gs, ls, E3, a).vs)) ∨ gstepf(gs, ls, E3, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, E3, a).orl.butlast.last = gstepf(gs, ls, E3, a).vhead ∧ gstepf(gs, ls, E3, a).phead ≠ gstepf(gs, ls, E3, a).orl.last ∧ unmarkedp(gstepf(gs, ls, E3, a).qrl, gstepf(gs, ls, E3, a).vs)) ∧ ( gstepf(gs, ls, E3, a).vtail = (gstepf(gs, ls, E3, a).orl + gstepf(gs, ls, E3, a).qrl).last ∨ gstepf(gs, ls, E3, a).qrl ≠ [] ∧ gstepf(gs, ls, E3, a).vtail = (gstepf(gs, ls, E3, a).orl + gstepf(gs, ls, E3, a).qrl.butlast).last ∧ gstepf(gs, ls, E3, a).vs[gstepf(gs, ls, E3, a).qrl.last].deqID = None ∧ gstepf(gs, ls, E3, a).vs[(gstepf(gs, ls, E3, a).orl + gstepf(gs, ls, E3, a).qrl).last].next = null)) ∧ ( ¬ lstepf(gs, ls, E3, a).success → ¬ lstepf(gs, ls, E3, a).node ∈ gstepf(gs, ls, E3, a).orl ∧ ¬ lstepf(gs, ls, E3, a).node ∈ gstepf(gs, ls, E3, a).qrl ∧ lstepf(gs, ls, E3, a).node ≠ null ∧ lstepf(gs, ls, E3, a).node ∈ gstepf(gs, ls, E3, a).ps ∧ lstepf(gs, ls, E3, a).node ∈ gstepf(gs, ls, E3, a).vs ∧ gstepf(gs, ls, E3, a).owns(lstepf(gs, ls, E3, a).node) = Some(lstepf(gs, ls, E3, a).tid) ∧ gstepf(gs, ls, E3, a).vs[lstepf(gs, ls, E3, a).node] = mk(lstepf(gs, ls, E3, a).value, None, null) ∧ gstepf(gs, ls, E3, a).ps[lstepf(gs, ls, E3, a).node] = gstepf(gs, ls, E3, a).vs[lstepf(gs, ls, E3, a).node]) ∧ nextnottid(lstepf(gs, ls, E3, a).tid, gstepf(gs, ls, E3, a).vhead, gstepf(gs, ls, E3, a).vs) ∧ noid(lstepf(gs, ls, E3, a).tid, gstepf(gs, ls, E3, a).orl + gstepf(gs, ls, E3, a).qrl, gstepf(gs, ls, E3, a).vhead, gstepf(gs, ls, E3, a).vs) ∧ (lstepf(gs, ls, E3, a).success ⊃ noowns(lstepf(gs, ls, E3, a).tid, gstepf(gs, ls, E3, a).owns) ;oneowns(lstepf(gs, ls, E3, a).tid, lstepf(gs, ls, E3, a).node, gstepf(gs, ls, E3, a).owns, gstepf(gs, ls, E3, a).vs, gstepf(gs, ls, E3, a).ps) ) |
gs.owns(ls.node) = Some(ls.tid), gs.vs[ls.node] = mk(ls.value, None, null), dom gs.vrvHp = dom gs.prvHp, pcstepf(gs, ls, E3, a) = E4, 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, E3, 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 ⊦ ( listp(gstepf(gs, ls, E3, a).orl + gstepf(gs, ls, E3, a).qrl, gstepf(gs, ls, E3, a).vs, gstepf(gs, ls, E3, a).ps, gstepf(gs, ls, E3, a).owns) ∧ ¬ dups(gstepf(gs, ls, E3, a).orl + gstepf(gs, ls, E3, a).qrl) ∧ markedp(gstepf(gs, ls, E3, a).orl, gstepf(gs, ls, E3, a).ps) ∧ markedp(gstepf(gs, ls, E3, a).orl, gstepf(gs, ls, E3, a).vs) ∧ unmarkedp(gstepf(gs, ls, E3, a).qrl, gstepf(gs, ls, E3, a).ps) ∧ gstepf(gs, ls, E3, a).orl ≠ [] ∧ gstepf(gs, ls, E3, a).phead ∈ gstepf(gs, ls, E3, a).orl ∧ rvownerok(gstepf(gs, ls, E3, a).vretRefs, gstepf(gs, ls, E3, a).vrvHp, gstepf(gs, ls, E3, a).rvowns) ∧ allocrv(gstepf(gs, ls, E3, a).vretRefs, gstepf(gs, ls, E3, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, E3, a).orl + gstepf(gs, ls, E3, a).qrl, gstepf(gs, ls, E3, a).vs, gstepf(gs, ls, E3, a).vretRefs, gstepf(gs, ls, E3, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, E3, a).pretRefs, gstepf(gs, ls, E3, a).prvHp, gstepf(gs, ls, E3, a).rvowns) ∧ allocrv(gstepf(gs, ls, E3, a).pretRefs, gstepf(gs, ls, E3, a).prvHp) ∧ dom gstepf(gs, ls, E3, a).vrvHp = dom gstepf(gs, ls, E3, a).prvHp ∧ ( gstepf(gs, ls, E3, a).vs[gstepf(gs, ls, E3, a).vhead].next ≠ null ∧ gstepf(gs, ls, E3, a).vs[gstepf(gs, ls, E3, a).vs[gstepf(gs, ls, E3, a).vhead].next].deqID ≠ None → gstepf(gs, ls, E3, a).rvowns (gstepf(gs, ls, E3, a).vretRefs(gstepf(gs, ls, E3, a).vs[gstepf(gs, ls, E3, a).vs[gstepf(gs, ls, E3, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, E3, a).vs[gstepf(gs, ls, E3, a).vs[gstepf(gs, ls, E3, a).vhead].next].deqID.tid, gstepf(gs, ls, E3, a).vs[gstepf(gs, ls, E3, a).vs[gstepf(gs, ls, E3, a).vhead].next].val)) ∧ ( gstepf(gs, ls, E3, a).orl.last = gstepf(gs, ls, E3, a).vhead ∧ (gstepf(gs, ls, E3, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, E3, a).qrl.tail, gstepf(gs, ls, E3, a).vs)) ∨ gstepf(gs, ls, E3, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, E3, a).orl.butlast.last = gstepf(gs, ls, E3, a).vhead ∧ gstepf(gs, ls, E3, a).phead ≠ gstepf(gs, ls, E3, a).orl.last ∧ unmarkedp(gstepf(gs, ls, E3, a).qrl, gstepf(gs, ls, E3, a).vs)) ∧ ( gstepf(gs, ls, E3, a).vtail = (gstepf(gs, ls, E3, a).orl + gstepf(gs, ls, E3, a).qrl).last ∨ gstepf(gs, ls, E3, a).qrl ≠ [] ∧ gstepf(gs, ls, E3, a).vtail = (gstepf(gs, ls, E3, a).orl + gstepf(gs, ls, E3, a).qrl.butlast).last ∧ gstepf(gs, ls, E3, a).vs[gstepf(gs, ls, E3, a).qrl.last].deqID = None ∧ gstepf(gs, ls, E3, a).vs[(gstepf(gs, ls, E3, a).orl + gstepf(gs, ls, E3, a).qrl).last].next = null)) ∧ ( ¬ lstepf(gs, ls, E3, a).success → ¬ lstepf(gs, ls, E3, a).node ∈ gstepf(gs, ls, E3, a).orl ∧ ¬ lstepf(gs, ls, E3, a).node ∈ gstepf(gs, ls, E3, a).qrl ∧ lstepf(gs, ls, E3, a).node ≠ null ∧ lstepf(gs, ls, E3, a).node ∈ gstepf(gs, ls, E3, a).ps ∧ lstepf(gs, ls, E3, a).node ∈ gstepf(gs, ls, E3, a).vs ∧ gstepf(gs, ls, E3, a).owns(lstepf(gs, ls, E3, a).node) = Some(lstepf(gs, ls, E3, a).tid) ∧ gstepf(gs, ls, E3, a).vs[lstepf(gs, ls, E3, a).node] = mk(lstepf(gs, ls, E3, a).value, None, null) ∧ gstepf(gs, ls, E3, a).ps[lstepf(gs, ls, E3, a).node] = gstepf(gs, ls, E3, a).vs[lstepf(gs, ls, E3, a).node]) ∧ nextnottid(lstepf(gs, ls, E3, a).tid, gstepf(gs, ls, E3, a).vhead, gstepf(gs, ls, E3, a).vs) ∧ noid(lstepf(gs, ls, E3, a).tid, gstepf(gs, ls, E3, a).orl + gstepf(gs, ls, E3, a).qrl, gstepf(gs, ls, E3, a).vhead, gstepf(gs, ls, E3, a).vs) ∧ (lstepf(gs, ls, E3, a).success ⊃ noowns(lstepf(gs, ls, E3, a).tid, gstepf(gs, ls, E3, a).owns) ;oneowns(lstepf(gs, ls, E3, a).tid, lstepf(gs, ls, E3, a).node, gstepf(gs, ls, E3, a).owns, gstepf(gs, ls, E3, a).vs, gstepf(gs, ls, E3, a).ps) )
| gs.owns(ls.node) = Some(ls.tid), gs.vs[ls.node] = mk(ls.value, None, null), dom gs.vrvHp = dom gs.prvHp, pcstepf(gs, ls, E3, a) = E4, 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, E3, 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 ⊦ ( listp(gstepf(gs, ls, E3, a).orl + gstepf(gs, ls, E3, a).qrl, gstepf(gs, ls, E3, a).vs, gstepf(gs, ls, E3, a).ps, gstepf(gs, ls, E3, a).owns) ∧ ¬ dups(gstepf(gs, ls, E3, a).orl + gstepf(gs, ls, E3, a).qrl) ∧ markedp(gstepf(gs, ls, E3, a).orl, gstepf(gs, ls, E3, a).ps) ∧ markedp(gstepf(gs, ls, E3, a).orl, gstepf(gs, ls, E3, a).vs) ∧ unmarkedp(gstepf(gs, ls, E3, a).qrl, gstepf(gs, ls, E3, a).ps) ∧ gstepf(gs, ls, E3, a).orl ≠ [] ∧ gstepf(gs, ls, E3, a).phead ∈ gstepf(gs, ls, E3, a).orl ∧ rvownerok(gstepf(gs, ls, E3, a).vretRefs, gstepf(gs, ls, E3, a).vrvHp, gstepf(gs, ls, E3, a).rvowns) ∧ allocrv(gstepf(gs, ls, E3, a).vretRefs, gstepf(gs, ls, E3, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, E3, a).orl + gstepf(gs, ls, E3, a).qrl, gstepf(gs, ls, E3, a).vs, gstepf(gs, ls, E3, a).vretRefs, gstepf(gs, ls, E3, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, E3, a).pretRefs, gstepf(gs, ls, E3, a).prvHp, gstepf(gs, ls, E3, a).rvowns) ∧ allocrv(gstepf(gs, ls, E3, a).pretRefs, gstepf(gs, ls, E3, a).prvHp) ∧ dom gstepf(gs, ls, E3, a).vrvHp = dom gstepf(gs, ls, E3, a).prvHp ∧ ( gstepf(gs, ls, E3, a).vs[gstepf(gs, ls, E3, a).vhead].next ≠ null ∧ gstepf(gs, ls, E3, a).vs[gstepf(gs, ls, E3, a).vs[gstepf(gs, ls, E3, a).vhead].next].deqID ≠ None → gstepf(gs, ls, E3, a).rvowns (gstepf(gs, ls, E3, a).vretRefs(gstepf(gs, ls, E3, a).vs[gstepf(gs, ls, E3, a).vs[gstepf(gs, ls, E3, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, E3, a).vs[gstepf(gs, ls, E3, a).vs[gstepf(gs, ls, E3, a).vhead].next].deqID.tid, gstepf(gs, ls, E3, a).vs[gstepf(gs, ls, E3, a).vs[gstepf(gs, ls, E3, a).vhead].next].val)) ∧ ( gstepf(gs, ls, E3, a).orl.last = gstepf(gs, ls, E3, a).vhead ∧ (gstepf(gs, ls, E3, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, E3, a).qrl.tail, gstepf(gs, ls, E3, a).vs)) ∨ gstepf(gs, ls, E3, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, E3, a).orl.butlast.last = gstepf(gs, ls, E3, a).vhead ∧ gstepf(gs, ls, E3, a).phead ≠ gstepf(gs, ls, E3, a).orl.last ∧ unmarkedp(gstepf(gs, ls, E3, a).qrl, gstepf(gs, ls, E3, a).vs)) ∧ ( gstepf(gs, ls, E3, a).vtail = (gstepf(gs, ls, E3, a).orl + gstepf(gs, ls, E3, a).qrl).last ∨ gstepf(gs, ls, E3, a).qrl ≠ [] ∧ gstepf(gs, ls, E3, a).vtail = (gstepf(gs, ls, E3, a).orl + gstepf(gs, ls, E3, a).qrl.butlast).last ∧ gstepf(gs, ls, E3, a).vs[gstepf(gs, ls, E3, a).qrl.last].deqID = None ∧ gstepf(gs, ls, E3, a).vs[(gstepf(gs, ls, E3, a).orl + gstepf(gs, ls, E3, a).qrl).last].next = null)) ∧ ( ¬ lstepf(gs, ls, E3, a).success → ¬ lstepf(gs, ls, E3, a).node ∈ gstepf(gs, ls, E3, a).orl ∧ ¬ lstepf(gs, ls, E3, a).node ∈ gstepf(gs, ls, E3, a).qrl ∧ lstepf(gs, ls, E3, a).node ≠ null ∧ lstepf(gs, ls, E3, a).node ∈ gstepf(gs, ls, E3, a).ps ∧ lstepf(gs, ls, E3, a).node ∈ gstepf(gs, ls, E3, a).vs ∧ gstepf(gs, ls, E3, a).owns(lstepf(gs, ls, E3, a).node) = Some(lstepf(gs, ls, E3, a).tid) ∧ gstepf(gs, ls, E3, a).vs[lstepf(gs, ls, E3, a).node] = mk(lstepf(gs, ls, E3, a).value, None, null) ∧ gstepf(gs, ls, E3, a).ps[lstepf(gs, ls, E3, a).node] = gstepf(gs, ls, E3, a).vs[lstepf(gs, ls, E3, a).node]) ∧ nextnottid(lstepf(gs, ls, E3, a).tid, gstepf(gs, ls, E3, a).vhead, gstepf(gs, ls, E3, a).vs) ∧ noid(lstepf(gs, ls, E3, a).tid, gstepf(gs, ls, E3, a).orl + gstepf(gs, ls, E3, a).qrl, gstepf(gs, ls, E3, a).vhead, gstepf(gs, ls, E3, a).vs) ∧ (lstepf(gs, ls, E3, a).success ⊃ noowns(lstepf(gs, ls, E3, a).tid, gstepf(gs, ls, E3, a).owns) ;oneowns(lstepf(gs, ls, E3, a).tid, lstepf(gs, ls, E3, a).node, gstepf(gs, ls, E3, a).owns, gstepf(gs, ls, E3, a).vs, gstepf(gs, ls, E3, a).ps) ) |
gs.owns(ls.node) = Some(ls.tid), gs.vs[ls.node] = mk(ls.value, None, null), 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), ¬ oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps[ls.node, mk(ls.value, None, null)]), ¬ 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) ⊦
Used simplifier rules: ⊦ (gs.ps:= ps).ps = ps; (s) ⊦ gstepf(gs, ls, E3, τ) = gs.ps:= gs.ps[ls.node, gs.vs[ls.node]]; (s) ⊦ (gs.ps:= ps).vs = gs.vs; (s) ⊦ (gs.ps:= ps).owns = gs.owns; (s) ⊦ lstepf(gs, ls, E3, τ) = ls; (s) ⊦ (gs.ps:= ps).vhead = gs.vhead; (s) ⊦ (gs.ps:= ps).qrl = gs.qrl; (s) ⊦ (gs.ps:= ps).orl = gs.orl; (s) ⊦ a = b → st[b, d][a] = d; (s) ⊦ a ∈ st[a, d]; (s) ⊦ (gs.ps:= ps).vtail = gs.vtail; (s) ⊦ (gs.ps:= ps).phead = gs.phead; (s) ⊦ (gs.ps:= ps).rvowns = gs.rvowns; (s) ⊦ (gs.ps:= ps).vretRefs = gs.vretRefs; (s) ⊦ (gs.ps:= ps).prvHp = gs.prvHp; (s) ⊦ (gs.ps:= ps).vrvHp = gs.vrvHp; (s) ⊦ (gs.ps:= ps).pretRefs = gs.pretRefs; (s) ⊦ ¬ node ∈ rl → (unmarkedp(rl, vs[node, nd]) ↔ unmarkedp(rl, vs)); (s) ⊦ ¬ node ∈ rl → (markedp(rl, vs[node, nd]) ↔ markedp(rl, vs)); (s) ⊦ owns(node) = Some(tid) → (listp(rl, vs, ps[node, nd], 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, E3, a) ↔ a = τ; (s) ⊦ pcstepf(gs, ls, E3, a) = E4; (s)
| gs.owns(ls.node) = Some(ls.tid), gs.vs[ls.node] = mk(ls.value, None, null), 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), ¬ oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps[ls.node, mk(ls.value, None, null)]), ¬ 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) ⊦ |
vs[ls.node] = mk(ls.value, None, null), 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), ¬ oneowns(ls.tid, ls.node, owns, vs, ps[ls.node, mk(ls.value, None, null)]), ¬ 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 ⊦
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
| vs[ls.node] = mk(ls.value, None, null), 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), ¬ oneowns(ls.tid, ls.node, owns, vs, ps[ls.node, mk(ls.value, None, null)]), ¬ 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 ⊦ |
vs[ls.node] = mk(ls.value, None, null), 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), ¬ oneowns(ls.tid, ls.node, owns, vs, ps[ls.node, mk(ls.value, None, null)]), ¬ 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) ⊦
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
| vs[ls.node] = mk(ls.value, None, null), 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), ¬ oneowns(ls.tid, ls.node, owns, vs, ps[ls.node, mk(ls.value, None, null)]), ¬ 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) ⊦ |
vs[node] = mk(value, None, null), 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), ¬ oneowns(tid, node, owns, vs, ps[node, mk(value, None, null)]), ¬ 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 ⊦
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
| vs[node] = mk(value, None, null), 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), ¬ oneowns(tid, node, owns, vs, ps[node, mk(value, None, null)]), ¬ 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 ⊦ |
vs[node] = mk(value, None, null), 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), ¬ oneowns(tid, node, owns, vs, ps[node, mk(value, None, null)]), ¬ 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) ⊦
| vs[node] = mk(value, None, null), 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), ¬ oneowns(tid, node, owns, vs, ps[node, mk(value, None, null)]), ¬ 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) ⊦ |
⊦ oneowns(tid, r, owns, vs, ps) ↔ r ∈ vs ∧ r ∈ ps ∧ owns(r) = Some(tid) ∧ (∀ r0. r0 ≠ r ∧ owns(r0) ≠ None → owns(r0).tid ≠ tid)
vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, 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), 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, ¬ node ∈ vs ∨ ¬ node ∈ ps[node, mk(value, None, null)] ∨ owns(node) ≠ Some(tid) ∨ (∃ r0. ¬(r0 ≠ node ∧ owns(r0) ≠ None → owns(r0).tid ≠ tid)) ⊦
Used terms: ps[node, mk(value, None, null)], 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) |
| vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, 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), 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, ¬ node ∈ vs ∨ ¬ node ∈ ps[node, mk(value, None, null)] ∨ owns(node) ≠ Some(tid) ∨ (∃ r0. ¬(r0 ≠ node ∧ owns(r0) ≠ None → owns(r0).tid ≠ tid)) ⊦ |
vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(owns(r0).tid), node ≠ null, orl ≠ [], owns(r0) ≠ None, r0 ≠ node, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(owns(r0).tid, vhead, vs), noid(owns(r0).tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(owns(r0).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(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ node ∈ qrl, ¬ node ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (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 ⊦
Used simplifier rules: ⊦ a ∈ st[a, d]; (s)
| vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(owns(r0).tid), node ≠ null, orl ≠ [], owns(r0) ≠ None, r0 ≠ node, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(owns(r0).tid, vhead, vs), noid(owns(r0).tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(owns(r0).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(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ node ∈ qrl, ¬ node ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (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 ⊦ |
⊦ oneowns(tid, r, owns, vs, ps) ↔ r ∈ vs ∧ r ∈ ps ∧ owns(r) = Some(tid) ∧ (∀ r0. r0 ≠ r ∧ owns(r0) ≠ None → owns(r0).tid ≠ tid)
vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(owns(r0).tid), node ≠ null, orl ≠ [], owns(r0) ≠ None, r0 ≠ node, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(owns(r0).tid, vhead, vs), noid(owns(r0).tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, node ∈ vs, node ∈ ps, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ node ∈ qrl, ¬ node ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ∀ r1. r1 ≠ node ∧ owns(r1) ≠ None → owns(r1).tid ≠ owns(r0).tid, 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) ⊦
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) |
| vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(owns(r0).tid), node ≠ null, orl ≠ [], owns(r0) ≠ None, r0 ≠ node, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(owns(r0).tid, vhead, vs), noid(owns(r0).tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, node ∈ vs, node ∈ ps, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ node ∈ qrl, ¬ node ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ∀ r1. r1 ≠ node ∧ owns(r1) ≠ None → owns(r1).tid ≠ owns(r0).tid, 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) ⊦ |
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.