{"abstract":"Deque borrow uses the live count as its physical contiguous span.","category":"Bounded deques","checks":7,"contract":"Borrow a valid logical subrange from a bounded ring as at most two physical spans. Reject negative or out-of-live-range requests. Borrow captures the current epoch and pins storage only for nonempty ranges.","contract_signature":"x","evaluation_group":"s3-bounded-deques-range-borrow","failed_approach":"The partial repair still applies the incorrect transition to an admitted boundary or multi-element case.","family":"s3-bounded-deques-range-borrow-first-span-bound","id":"FA-46621","implementations":{"attempt":{"sha256":"90d1052e3ee5d889516bc94ffc1f53d0682815917b75722bbc3e59b71ecb297e","source":"\"\"\"Failure Map reference implementation. Python standard library only.\"\"\"\nimport json\n\nN = 1\nobservations = []\ndef solve(x):\n    cap,head,size,start,count,epoch=x\n    if start<0 or count<0 or start+count>size:return [False,[],epoch,0,False]\n    origin=(head+start)%cap\n    first=min(count,cap-origin) if origin==0 else min(count,size)\n    spans=[[origin,first]] if first else []\n    if count>first:spans.append([0,count-first])\n    captured=epoch\n    pin=count>0\n    return [True,spans,captured,count,pin]\ndef check(label, actual, expected):\n    observations.append({\"check\": label, \"actual\": actual, \"expected\": expected, \"passed\": actual == expected})\ncheck('0', solve([8,6,5,1,3,N]), {1: [True, [[7, 1], [0, 2]], 1, 3, True], 2: [True, [[7, 1], [0, 2]], 2, 3, True], 3: [True, [[7, 1], [0, 2]], 3, 3, True], 4: [True, [[7, 1], [0, 2]], 4, 3, True], 5: [True, [[7, 1], [0, 2]], 5, 3, True]}[N])\ncheck('1', solve([8,2,4,1,2,N]), {1: [True, [[3, 2]], 1, 2, True], 2: [True, [[3, 2]], 2, 2, True], 3: [True, [[3, 2]], 3, 2, True], 4: [True, [[3, 2]], 4, 2, True], 5: [True, [[3, 2]], 5, 2, True]}[N])\ncheck('2', solve([7,5,4,0,4,N]), {1: [True, [[5, 2], [0, 2]], 1, 4, True], 2: [True, [[5, 2], [0, 2]], 2, 4, True], 3: [True, [[5, 2], [0, 2]], 3, 4, True], 4: [True, [[5, 2], [0, 2]], 4, 4, True], 5: [True, [[5, 2], [0, 2]], 5, 4, True]}[N])\ncheck('3', solve([8,3,2,2,0,N]), {1: [True, [], 1, 0, False], 2: [True, [], 2, 0, False], 3: [True, [], 3, 0, False], 4: [True, [], 4, 0, False], 5: [True, [], 5, 0, False]}[N])\ncheck('4', solve([8,3,2,1,2,N]), {1: [False, [], 1, 0, False], 2: [False, [], 2, 0, False], 3: [False, [], 3, 0, False], 4: [False, [], 4, 0, False], 5: [False, [], 5, 0, False]}[N])\ncheck('5', solve([6,2,3,-1,2,N]), {1: [False, [], 1, 0, False], 2: [False, [], 2, 0, False], 3: [False, [], 3, 0, False], 4: [False, [], 4, 0, False], 5: [False, [], 5, 0, False]}[N])\ncheck('6', solve([7,1,5,3,-1,N]), {1: [False, [], 1, 0, False], 2: [False, [], 2, 0, False], 3: [False, [], 3, 0, False], 4: [False, [], 4, 0, False], 5: [False, [], 5, 0, False]}[N])\nprint(json.dumps({\"observations\": observations, \"passed\": all(x[\"passed\"] for x in observations)}, ensure_ascii=False))\nraise SystemExit(0 if all(x[\"passed\"] for x in observations) else 1)\n"},"broken":{"sha256":"6260dda25c9bea563d4cbcc315f189a842b67978d4dcd9f64cb0698d4708e3be","source":"\"\"\"Failure Map reference implementation. Python standard library only.\"\"\"\nimport json\n\nN = 1\nobservations = []\ndef solve(x):\n    cap,head,size,start,count,epoch=x\n    if start<0 or count<0 or start+count>size:return [False,[],epoch,0,False]\n    origin=(head+start)%cap\n    first=min(count,size)\n    spans=[[origin,first]] if first else []\n    if count>first:spans.append([0,count-first])\n    captured=epoch\n    pin=count>0\n    return [True,spans,captured,count,pin]\ndef check(label, actual, expected):\n    observations.append({\"check\": label, \"actual\": actual, \"expected\": expected, \"passed\": actual == expected})\ncheck('0', solve([8,6,5,1,3,N]), {1: [True, [[7, 1], [0, 2]], 1, 3, True], 2: [True, [[7, 1], [0, 2]], 2, 3, True], 3: [True, [[7, 1], [0, 2]], 3, 3, True], 4: [True, [[7, 1], [0, 2]], 4, 3, True], 5: [True, [[7, 1], [0, 2]], 5, 3, True]}[N])\ncheck('1', solve([8,2,4,1,2,N]), {1: [True, [[3, 2]], 1, 2, True], 2: [True, [[3, 2]], 2, 2, True], 3: [True, [[3, 2]], 3, 2, True], 4: [True, [[3, 2]], 4, 2, True], 5: [True, [[3, 2]], 5, 2, True]}[N])\ncheck('2', solve([7,5,4,0,4,N]), {1: [True, [[5, 2], [0, 2]], 1, 4, True], 2: [True, [[5, 2], [0, 2]], 2, 4, True], 3: [True, [[5, 2], [0, 2]], 3, 4, True], 4: [True, [[5, 2], [0, 2]], 4, 4, True], 5: [True, [[5, 2], [0, 2]], 5, 4, True]}[N])\ncheck('3', solve([8,3,2,2,0,N]), {1: [True, [], 1, 0, False], 2: [True, [], 2, 0, False], 3: [True, [], 3, 0, False], 4: [True, [], 4, 0, False], 5: [True, [], 5, 0, False]}[N])\ncheck('4', solve([8,3,2,1,2,N]), {1: [False, [], 1, 0, False], 2: [False, [], 2, 0, False], 3: [False, [], 3, 0, False], 4: [False, [], 4, 0, False], 5: [False, [], 5, 0, False]}[N])\ncheck('5', solve([6,2,3,-1,2,N]), {1: [False, [], 1, 0, False], 2: [False, [], 2, 0, False], 3: [False, [], 3, 0, False], 4: [False, [], 4, 0, False], 5: [False, [], 5, 0, False]}[N])\ncheck('6', solve([7,1,5,3,-1,N]), {1: [False, [], 1, 0, False], 2: [False, [], 2, 0, False], 3: [False, [], 3, 0, False], 4: [False, [], 4, 0, False], 5: [False, [], 5, 0, False]}[N])\nprint(json.dumps({\"observations\": observations, \"passed\": all(x[\"passed\"] for x in observations)}, ensure_ascii=False))\nraise SystemExit(0 if all(x[\"passed\"] for x in observations) else 1)\n"}},"limitations":"Offline finite deterministic model; no claim of production implementation or concurrent memory-model conformance. This reproducer isolates one failure mechanism. Results cover the supplied fixtures. Variants within a family share a test contract and should remain grouped when constructing evaluation splits. Related mechanisms with a shared evaluation_group must also remain together; these controlled models are not independent production incidents.","method":"Deterministic executable model with adversarial boundary fixtures.","provenance":{"created_by":"Failure Map","dependencies":"Python standard library","family":"s3-bounded-deques-range-borrow-first-span-bound","generated_at":"2026-09-29T14:44:33.900444+00:00","license":"CC0-1.0","python":"3.12.14","seed":1,"split":"open-access"},"relevance":"Controlled bounded deque implementation model with explicit storage and lifecycle observations.","root_cause":"Deque borrow uses the live count as its physical contiguous span.","sha256":"66fa0ee57a049895126ff47d5799c0aba8361319d13f828abc6de1aac7f4a057","title":"Deque borrow uses the live count as its physical contiguous span · case 01","variant":1,"variant_policy":"Five numbered records share a model and may reuse boundary fixtures.","verified":true,"visibility":"public","verification":{"attempt":{"elapsed_ms":43.093,"exit_code":1,"observations":[{"actual":[true,[[7,3]],1,3,true],"check":"0","expected":[true,[[7,1],[0,2]],1,3,true],"passed":false},{"actual":[true,[[3,2]],1,2,true],"check":"1","expected":[true,[[3,2]],1,2,true],"passed":true},{"actual":[true,[[5,4]],1,4,true],"check":"2","expected":[true,[[5,2],[0,2]],1,4,true],"passed":false},{"actual":[true,[],1,0,false],"check":"3","expected":[true,[],1,0,false],"passed":true},{"actual":[false,[],1,0,false],"check":"4","expected":[false,[],1,0,false],"passed":true},{"actual":[false,[],1,0,false],"check":"5","expected":[false,[],1,0,false],"passed":true},{"actual":[false,[],1,0,false],"check":"6","expected":[false,[],1,0,false],"passed":true}],"passed":false,"stderr":"","stdout":"{\"observations\": [{\"check\": \"0\", \"actual\": [true, [[7, 3]], 1, 3, true], \"expected\": [true, [[7, 1], [0, 2]], 1, 3, true], \"passed\": false}, {\"check\": \"1\", \"actual\": [true, [[3, 2]], 1, 2, true], \"expected\": [true, [[3, 2]], 1, 2, true], \"passed\": true}, {\"check\": \"2\", \"actual\": [true, [[5, 4]], 1, 4, true], \"expected\": [true, [[5, 2], [0, 2]], 1, 4, true], \"passed\": false}, {\"check\": \"3\", \"actual\": [true, [], 1, 0, false], \"expected\": [true, [], 1, 0, false], \"passed\": true}, {\"check\": \"4\", \"actual\": [false, [], 1, 0, false], \"expected\": [false, [], 1, 0, false], \"passed\": true}, {\"check\": \"5\", \"actual\": [false, [], 1, 0, false], \"expected\": [false, [], 1, 0, false], \"passed\": true}, {\"check\": \"6\", \"actual\": [false, [], 1, 0, false], \"expected\": [false, [], 1, 0, false], \"passed\": true}], \"passed\": false}\n"},"broken":{"elapsed_ms":43.748,"exit_code":1,"observations":[{"actual":[true,[[7,3]],1,3,true],"check":"0","expected":[true,[[7,1],[0,2]],1,3,true],"passed":false},{"actual":[true,[[3,2]],1,2,true],"check":"1","expected":[true,[[3,2]],1,2,true],"passed":true},{"actual":[true,[[5,4]],1,4,true],"check":"2","expected":[true,[[5,2],[0,2]],1,4,true],"passed":false},{"actual":[true,[],1,0,false],"check":"3","expected":[true,[],1,0,false],"passed":true},{"actual":[false,[],1,0,false],"check":"4","expected":[false,[],1,0,false],"passed":true},{"actual":[false,[],1,0,false],"check":"5","expected":[false,[],1,0,false],"passed":true},{"actual":[false,[],1,0,false],"check":"6","expected":[false,[],1,0,false],"passed":true}],"passed":false,"stderr":"","stdout":"{\"observations\": [{\"check\": \"0\", \"actual\": [true, [[7, 3]], 1, 3, true], \"expected\": [true, [[7, 1], [0, 2]], 1, 3, true], \"passed\": false}, {\"check\": \"1\", \"actual\": [true, [[3, 2]], 1, 2, true], \"expected\": [true, [[3, 2]], 1, 2, true], \"passed\": true}, {\"check\": \"2\", \"actual\": [true, [[5, 4]], 1, 4, true], \"expected\": [true, [[5, 2], [0, 2]], 1, 4, true], \"passed\": false}, {\"check\": \"3\", \"actual\": [true, [], 1, 0, false], \"expected\": [true, [], 1, 0, false], \"passed\": true}, {\"check\": \"4\", \"actual\": [false, [], 1, 0, false], \"expected\": [false, [], 1, 0, false], \"passed\": true}, {\"check\": \"5\", \"actual\": [false, [], 1, 0, false], \"expected\": [false, [], 1, 0, false], \"passed\": true}, {\"check\": \"6\", \"actual\": [false, [], 1, 0, false], \"expected\": [false, [], 1, 0, false], \"passed\": true}], \"passed\": false}\n"}},"member_only":{"stages":["fixed"],"fields":["implementations.fixed","verification.fixed","harness","repair"],"note":"The verified repair, its recorded checks, the repair description, and the scoring harness are available to members."}}