{"abstract":"Bulk consume advances across unoccupied slots.","category":"Bounded deques","checks":6,"contract":"Consume min(requested,size) slots from a ring. Report new head, count, cleared physical slots, and whether its occupied arc crossed the physical boundary.","contract_signature":"x","evaluation_group":"s3-bounded-deques-ring-consume","failed_approach":"The partial repair still applies the incorrect transition to an admitted boundary or multi-element case.","family":"s3-bounded-deques-ring-consume-clamp-live","id":"FA-45866","implementations":{"attempt":{"sha256":"6ab6920b5c76c19146234e3190ff8cf66ca4cde051f36c5564881f4dbc47d8ef","source":"\"\"\"Failure Map reference implementation. Python standard library only.\"\"\"\nimport json\n\nN = 1\nobservations = []\ndef solve(x):\n    cap, head, size, requested = x\n    count = 0 if size == 0 else requested\n    cleared = [(head + i) % cap for i in range(count)]\n    new_head = (head + count) % cap\n    remaining = size - count\n    crossed = head + count > cap\n    return [new_head, remaining, cleared, crossed]\ndef check(label, actual, expected):\n    observations.append({\"check\": label, \"actual\": actual, \"expected\": expected, \"passed\": actual == expected})\ncheck('wrap consume', solve([N+5,N+4,4,3]), [2,1,[N+4,0,1],True])\ncheck('oversized consume', solve([N+5,1,2,4]), [3,0,[1,2],False])\ncheck('empty', solve([N+5,2,0,4]), [2,0,[],False])\ncheck('zero consume', solve([N+5,2,3,0]), [2,3,[],False])\ncheck('exact boundary', solve([N+5,N+3,2,2]), [0,0,[N+3,N+4],False])\ncheck('single retained', solve([N+5,1,3,2]), [3,1,[1,2],False])\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":"78b9ca5add1b3cb951d747f00cd3f569e28cee4d35e438ec2717ae752459f424","source":"\"\"\"Failure Map reference implementation. Python standard library only.\"\"\"\nimport json\n\nN = 1\nobservations = []\ndef solve(x):\n    cap, head, size, requested = x\n    count = requested\n    cleared = [(head + i) % cap for i in range(count)]\n    new_head = (head + count) % cap\n    remaining = size - count\n    crossed = head + count > cap\n    return [new_head, remaining, cleared, crossed]\ndef check(label, actual, expected):\n    observations.append({\"check\": label, \"actual\": actual, \"expected\": expected, \"passed\": actual == expected})\ncheck('wrap consume', solve([N+5,N+4,4,3]), [2,1,[N+4,0,1],True])\ncheck('oversized consume', solve([N+5,1,2,4]), [3,0,[1,2],False])\ncheck('empty', solve([N+5,2,0,4]), [2,0,[],False])\ncheck('zero consume', solve([N+5,2,3,0]), [2,3,[],False])\ncheck('exact boundary', solve([N+5,N+3,2,2]), [0,0,[N+3,N+4],False])\ncheck('single retained', solve([N+5,1,3,2]), [3,1,[1,2],False])\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-ring-consume-clamp-live","generated_at":"2026-09-29T14:44:26.745919+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":"The consume count is not bounded by the live arc.","sha256":"65181ca7b3b305230b04d79c26ae2ce09ce93a5ab5ca81379f80cc815b24f8c0","title":"Bulk consume advances across unoccupied slots · 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":44.075,"exit_code":1,"observations":[{"actual":[2,1,[5,0,1],true],"check":"wrap consume","expected":[2,1,[5,0,1],true],"passed":true},{"actual":[5,-2,[1,2,3,4],false],"check":"oversized consume","expected":[3,0,[1,2],false],"passed":false},{"actual":[2,0,[],false],"check":"empty","expected":[2,0,[],false],"passed":true},{"actual":[2,3,[],false],"check":"zero consume","expected":[2,3,[],false],"passed":true},{"actual":[0,0,[4,5],false],"check":"exact boundary","expected":[0,0,[4,5],false],"passed":true},{"actual":[3,1,[1,2],false],"check":"single retained","expected":[3,1,[1,2],false],"passed":true}],"passed":false,"stderr":"","stdout":"{\"observations\": [{\"check\": \"wrap consume\", \"actual\": [2, 1, [5, 0, 1], true], \"expected\": [2, 1, [5, 0, 1], true], \"passed\": true}, {\"check\": \"oversized consume\", \"actual\": [5, -2, [1, 2, 3, 4], false], \"expected\": [3, 0, [1, 2], false], \"passed\": false}, {\"check\": \"empty\", \"actual\": [2, 0, [], false], \"expected\": [2, 0, [], false], \"passed\": true}, {\"check\": \"zero consume\", \"actual\": [2, 3, [], false], \"expected\": [2, 3, [], false], \"passed\": true}, {\"check\": \"exact boundary\", \"actual\": [0, 0, [4, 5], false], \"expected\": [0, 0, [4, 5], false], \"passed\": true}, {\"check\": \"single retained\", \"actual\": [3, 1, [1, 2], false], \"expected\": [3, 1, [1, 2], false], \"passed\": true}], \"passed\": false}\n"},"broken":{"elapsed_ms":40.789,"exit_code":1,"observations":[{"actual":[2,1,[5,0,1],true],"check":"wrap consume","expected":[2,1,[5,0,1],true],"passed":true},{"actual":[5,-2,[1,2,3,4],false],"check":"oversized consume","expected":[3,0,[1,2],false],"passed":false},{"actual":[0,-4,[2,3,4,5],false],"check":"empty","expected":[2,0,[],false],"passed":false},{"actual":[2,3,[],false],"check":"zero consume","expected":[2,3,[],false],"passed":true},{"actual":[0,0,[4,5],false],"check":"exact boundary","expected":[0,0,[4,5],false],"passed":true},{"actual":[3,1,[1,2],false],"check":"single retained","expected":[3,1,[1,2],false],"passed":true}],"passed":false,"stderr":"","stdout":"{\"observations\": [{\"check\": \"wrap consume\", \"actual\": [2, 1, [5, 0, 1], true], \"expected\": [2, 1, [5, 0, 1], true], \"passed\": true}, {\"check\": \"oversized consume\", \"actual\": [5, -2, [1, 2, 3, 4], false], \"expected\": [3, 0, [1, 2], false], \"passed\": false}, {\"check\": \"empty\", \"actual\": [0, -4, [2, 3, 4, 5], false], \"expected\": [2, 0, [], false], \"passed\": false}, {\"check\": \"zero consume\", \"actual\": [2, 3, [], false], \"expected\": [2, 3, [], false], \"passed\": true}, {\"check\": \"exact boundary\", \"actual\": [0, 0, [4, 5], false], \"expected\": [0, 0, [4, 5], false], \"passed\": true}, {\"check\": \"single retained\", \"actual\": [3, 1, [1, 2], false], \"expected\": [3, 1, [1, 2], 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."}}