{"abstract":"Deque reservation commit accepts a negative initialized prefix length.","category":"Bounded deques","checks":7,"contract":"A bounded deque write reservation publishes exactly its initialized prefix. Reject negative, uninitialized, over-reserved or over-capacity commit counts atomically. Successful commit releases the entire reservation and advances structure epoch only for nonempty publication.","contract_signature":"x","evaluation_group":"s3-bounded-deques-write-reservation-commit","failed_approach":"The attempted transition still violates the stated contract: if written<-1 or written>len(values) or written>reserved:","family":"s3-bounded-deques-write-reservation-commit-negative-publication","id":"FA-47336","implementations":{"attempt":{"sha256":"6438766765d7b62bdd2063a79006bc9f6e2ec4f1ecf85bb01fce7153a45b29e2","source":"\"\"\"Failure Map reference implementation. Python standard library only.\"\"\"\nimport json\n\nN = 1\nobservations = []\ndef solve(x):\n    a,reserved,values,written,cap,epoch=x\n    if written<-1 or written>len(values) or written>reserved:return [a,reserved,epoch,False,[]]\n    if len(a)+written>cap:return [a,reserved,epoch,False,[]]\n    published=values[:written]\n    state=a+published\n    remaining=0\n    version=epoch+(written>0)\n    unused=values[written:]\n    return [state,remaining,version,True,unused]\ndef check(label, actual, expected):\n    observations.append({\"check\": label, \"actual\": actual, \"expected\": expected, \"passed\": actual == expected})\ncheck('0', solve([[N],3,[N+1,N+2,N+3],2,5,4]), {1: [[1, 2, 3], 0, 5, True, [4]], 2: [[2, 3, 4], 0, 5, True, [5]], 3: [[3, 4, 5], 0, 5, True, [6]], 4: [[4, 5, 6], 0, 5, True, [7]], 5: [[5, 6, 7], 0, 5, True, [8]]}[N])\ncheck('1', solve([[N],1,[N+1,N+2],2,4,2]), {1: [[1], 1, 2, False, []], 2: [[2], 1, 2, False, []], 3: [[3], 1, 2, False, []], 4: [[4], 1, 2, False, []], 5: [[5], 1, 2, False, []]}[N])\ncheck('2', solve([[N],3,[N+1],2,5,1]), {1: [[1], 3, 1, False, []], 2: [[2], 3, 1, False, []], 3: [[3], 3, 1, False, []], 4: [[4], 3, 1, False, []], 5: [[5], 3, 1, False, []]}[N])\ncheck('3', solve([[N,N+1],2,[N+2,N+3],2,3,5]), {1: [[1, 2], 2, 5, False, []], 2: [[2, 3], 2, 5, False, []], 3: [[3, 4], 2, 5, False, []], 4: [[4, 5], 2, 5, False, []], 5: [[5, 6], 2, 5, False, []]}[N])\ncheck('4', solve([[N],2,[N+1,N+2],0,4,7]), {1: [[1], 0, 7, True, [2, 3]], 2: [[2], 0, 7, True, [3, 4]], 3: [[3], 0, 7, True, [4, 5]], 4: [[4], 0, 7, True, [5, 6]], 5: [[5], 0, 7, True, [6, 7]]}[N])\ncheck('5', solve([[],2,[N,N+1],2,2,0]), {1: [[1, 2], 0, 1, True, []], 2: [[2, 3], 0, 1, True, []], 3: [[3, 4], 0, 1, True, []], 4: [[4, 5], 0, 1, True, []], 5: [[5, 6], 0, 1, True, []]}[N])\ncheck('6', solve([[N],2,[N+1],-1,4,1]), {1: [[1], 2, 1, False, []], 2: [[2], 2, 1, False, []], 3: [[3], 2, 1, False, []], 4: [[4], 2, 1, False, []], 5: [[5], 2, 1, 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":"023958b3d24ab2ee4d8672fce036c60bb7e4e01d5694ecbce918acc2e3c32766","source":"\"\"\"Failure Map reference implementation. Python standard library only.\"\"\"\nimport json\n\nN = 1\nobservations = []\ndef solve(x):\n    a,reserved,values,written,cap,epoch=x\n    if written>len(values) or written>reserved:return [a,reserved,epoch,False,[]]\n    if len(a)+written>cap:return [a,reserved,epoch,False,[]]\n    published=values[:written]\n    state=a+published\n    remaining=0\n    version=epoch+(written>0)\n    unused=values[written:]\n    return [state,remaining,version,True,unused]\ndef check(label, actual, expected):\n    observations.append({\"check\": label, \"actual\": actual, \"expected\": expected, \"passed\": actual == expected})\ncheck('0', solve([[N],3,[N+1,N+2,N+3],2,5,4]), {1: [[1, 2, 3], 0, 5, True, [4]], 2: [[2, 3, 4], 0, 5, True, [5]], 3: [[3, 4, 5], 0, 5, True, [6]], 4: [[4, 5, 6], 0, 5, True, [7]], 5: [[5, 6, 7], 0, 5, True, [8]]}[N])\ncheck('1', solve([[N],1,[N+1,N+2],2,4,2]), {1: [[1], 1, 2, False, []], 2: [[2], 1, 2, False, []], 3: [[3], 1, 2, False, []], 4: [[4], 1, 2, False, []], 5: [[5], 1, 2, False, []]}[N])\ncheck('2', solve([[N],3,[N+1],2,5,1]), {1: [[1], 3, 1, False, []], 2: [[2], 3, 1, False, []], 3: [[3], 3, 1, False, []], 4: [[4], 3, 1, False, []], 5: [[5], 3, 1, False, []]}[N])\ncheck('3', solve([[N,N+1],2,[N+2,N+3],2,3,5]), {1: [[1, 2], 2, 5, False, []], 2: [[2, 3], 2, 5, False, []], 3: [[3, 4], 2, 5, False, []], 4: [[4, 5], 2, 5, False, []], 5: [[5, 6], 2, 5, False, []]}[N])\ncheck('4', solve([[N],2,[N+1,N+2],0,4,7]), {1: [[1], 0, 7, True, [2, 3]], 2: [[2], 0, 7, True, [3, 4]], 3: [[3], 0, 7, True, [4, 5]], 4: [[4], 0, 7, True, [5, 6]], 5: [[5], 0, 7, True, [6, 7]]}[N])\ncheck('5', solve([[],2,[N,N+1],2,2,0]), {1: [[1, 2], 0, 1, True, []], 2: [[2, 3], 0, 1, True, []], 3: [[3, 4], 0, 1, True, []], 4: [[4, 5], 0, 1, True, []], 5: [[5, 6], 0, 1, True, []]}[N])\ncheck('6', solve([[N],2,[N+1],-1,4,1]), {1: [[1], 2, 1, False, []], 2: [[2], 2, 1, False, []], 3: [[3], 2, 1, False, []], 4: [[4], 2, 1, False, []], 5: [[5], 2, 1, 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-write-reservation-commit-negative-publication","generated_at":"2026-09-29T14:44:40.448254+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 signed commit count is passed to slicing before rejecting negative publication; negative counts expose unintended prefix data and corrupt the release receipt.","sha256":"9247cc4dd247e7599dd0b0cf425d33b3eb1cc7e0188225bc86ea333d73ab8cbe","title":"Deque reservation commit accepts a negative initialized prefix length · 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":46.96,"exit_code":1,"observations":[{"actual":[[1,2,3],0,5,true,[4]],"check":"0","expected":[[1,2,3],0,5,true,[4]],"passed":true},{"actual":[[1],1,2,false,[]],"check":"1","expected":[[1],1,2,false,[]],"passed":true},{"actual":[[1],3,1,false,[]],"check":"2","expected":[[1],3,1,false,[]],"passed":true},{"actual":[[1,2],2,5,false,[]],"check":"3","expected":[[1,2],2,5,false,[]],"passed":true},{"actual":[[1],0,7,true,[2,3]],"check":"4","expected":[[1],0,7,true,[2,3]],"passed":true},{"actual":[[1,2],0,1,true,[]],"check":"5","expected":[[1,2],0,1,true,[]],"passed":true},{"actual":[[1],0,1,true,[2]],"check":"6","expected":[[1],2,1,false,[]],"passed":false}],"passed":false,"stderr":"","stdout":"{\"observations\": [{\"check\": \"0\", \"actual\": [[1, 2, 3], 0, 5, true, [4]], \"expected\": [[1, 2, 3], 0, 5, true, [4]], \"passed\": true}, {\"check\": \"1\", \"actual\": [[1], 1, 2, false, []], \"expected\": [[1], 1, 2, false, []], \"passed\": true}, {\"check\": \"2\", \"actual\": [[1], 3, 1, false, []], \"expected\": [[1], 3, 1, false, []], \"passed\": true}, {\"check\": \"3\", \"actual\": [[1, 2], 2, 5, false, []], \"expected\": [[1, 2], 2, 5, false, []], \"passed\": true}, {\"check\": \"4\", \"actual\": [[1], 0, 7, true, [2, 3]], \"expected\": [[1], 0, 7, true, [2, 3]], \"passed\": true}, {\"check\": \"5\", \"actual\": [[1, 2], 0, 1, true, []], \"expected\": [[1, 2], 0, 1, true, []], \"passed\": true}, {\"check\": \"6\", \"actual\": [[1], 0, 1, true, [2]], \"expected\": [[1], 2, 1, false, []], \"passed\": false}], \"passed\": false}\n"},"broken":{"elapsed_ms":44.873,"exit_code":1,"observations":[{"actual":[[1,2,3],0,5,true,[4]],"check":"0","expected":[[1,2,3],0,5,true,[4]],"passed":true},{"actual":[[1],1,2,false,[]],"check":"1","expected":[[1],1,2,false,[]],"passed":true},{"actual":[[1],3,1,false,[]],"check":"2","expected":[[1],3,1,false,[]],"passed":true},{"actual":[[1,2],2,5,false,[]],"check":"3","expected":[[1,2],2,5,false,[]],"passed":true},{"actual":[[1],0,7,true,[2,3]],"check":"4","expected":[[1],0,7,true,[2,3]],"passed":true},{"actual":[[1,2],0,1,true,[]],"check":"5","expected":[[1,2],0,1,true,[]],"passed":true},{"actual":[[1],0,1,true,[2]],"check":"6","expected":[[1],2,1,false,[]],"passed":false}],"passed":false,"stderr":"","stdout":"{\"observations\": [{\"check\": \"0\", \"actual\": [[1, 2, 3], 0, 5, true, [4]], \"expected\": [[1, 2, 3], 0, 5, true, [4]], \"passed\": true}, {\"check\": \"1\", \"actual\": [[1], 1, 2, false, []], \"expected\": [[1], 1, 2, false, []], \"passed\": true}, {\"check\": \"2\", \"actual\": [[1], 3, 1, false, []], \"expected\": [[1], 3, 1, false, []], \"passed\": true}, {\"check\": \"3\", \"actual\": [[1, 2], 2, 5, false, []], \"expected\": [[1, 2], 2, 5, false, []], \"passed\": true}, {\"check\": \"4\", \"actual\": [[1], 0, 7, true, [2, 3]], \"expected\": [[1], 0, 7, true, [2, 3]], \"passed\": true}, {\"check\": \"5\", \"actual\": [[1, 2], 0, 1, true, []], \"expected\": [[1, 2], 0, 1, true, []], \"passed\": true}, {\"check\": \"6\", \"actual\": [[1], 0, 1, true, [2]], \"expected\": [[1], 2, 1, false, []], \"passed\": false}], \"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."}}