{"abstract":"Combining scissor bounds as a union enlarges the drawable region.","category":"Raster clipping","checks":4,"contract":"Intersect two valid integer half-open scissor rectangles [left,top,right,bottom]. Clamp negative overlap width/height to zero at the maximum start coordinate.","contract_signature":"a, b","evaluation_group":"xg-scissor-intersection-empty","failed_approach":"Raw intersection can return inverted bounds that a raster backend interprets as huge unsigned extents.","family":"xg-scissor-intersection-empty","id":"FA-10651","implementations":{"attempt":{"sha256":"b2cf299ea26f733f55900cb06f866af8abc0f04d1dde65c726407fcba11fec5f","source":"\"\"\"Failure Map reference implementation. Python standard library only.\"\"\"\nimport json\nimport math\nN = 1\nobservations = []\ndef solve(a, b):\n    return [max(a[0],b[0]),max(a[1],b[1]),min(a[2],b[2]),min(a[3],b[3])]\ndef check(label, actual, expected):\n    observations.append({\"check\": label, \"actual\": actual, \"expected\": expected, \"passed\": actual == expected})\ncheck('fixture 1', solve(*([0, 0, 4, 4], [2, 1, 6, 3])), [2, 1, 4, 3])\ncheck('fixture 2', solve(*([0, 0, 1, 1], [3, 3, 4, 4])), [3, 3, 3, 3])\ncheck('fixture 3', solve(*([0, 0, 2, 2], [2, 0, 3, 2])), [2, 0, 2, 2])\ncheck('fixture 4', solve(*([0, 0, 4, 4], [1, 1, 2, 2])), [1, 1, 2, 2])\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":"7d768e8029a2fba29be902996ee4192ba8268b783b17feaa3dcfe97fff513a8c","source":"\"\"\"Failure Map reference implementation. Python standard library only.\"\"\"\nimport json\nimport math\nN = 1\nobservations = []\ndef solve(a, b):\n    return [min(a[0],b[0]),min(a[1],b[1]),max(a[2],b[2]),max(a[3],b[3])]\ndef check(label, actual, expected):\n    observations.append({\"check\": label, \"actual\": actual, \"expected\": expected, \"passed\": actual == expected})\ncheck('fixture 1', solve(*([0, 0, 4, 4], [2, 1, 6, 3])), [2, 1, 4, 3])\ncheck('fixture 2', solve(*([0, 0, 1, 1], [3, 3, 4, 4])), [3, 3, 3, 3])\ncheck('fixture 3', solve(*([0, 0, 2, 2], [2, 0, 3, 2])), [2, 0, 2, 2])\ncheck('fixture 4', solve(*([0, 0, 4, 4], [1, 1, 2, 2])), [1, 1, 2, 2])\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":" 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":"xg-scissor-intersection-empty","generated_at":"2026-09-29T14:38:41.008914+00:00","license":"CC0-1.0","python":"3.12.14","seed":1,"split":"open-access"},"relevance":"A deterministic software graphics stage with explicit channel and coordinate conventions; no hardware, device profile or API behavior is inferred.","root_cause":"Combining scissor bounds as a union enlarges the drawable region.","sha256":"99fc00aee37e4f53167ba4536cbdc2664befb335cb813730a5a719342f950c02","title":"Scissor intersection empty · 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.446,"exit_code":1,"observations":[{"actual":[2,1,4,3],"check":"fixture 1","expected":[2,1,4,3],"passed":true},{"actual":[3,3,1,1],"check":"fixture 2","expected":[3,3,3,3],"passed":false},{"actual":[2,0,2,2],"check":"fixture 3","expected":[2,0,2,2],"passed":true},{"actual":[1,1,2,2],"check":"fixture 4","expected":[1,1,2,2],"passed":true}],"passed":false,"stderr":"","stdout":"{\"observations\": [{\"check\": \"fixture 1\", \"actual\": [2, 1, 4, 3], \"expected\": [2, 1, 4, 3], \"passed\": true}, {\"check\": \"fixture 2\", \"actual\": [3, 3, 1, 1], \"expected\": [3, 3, 3, 3], \"passed\": false}, {\"check\": \"fixture 3\", \"actual\": [2, 0, 2, 2], \"expected\": [2, 0, 2, 2], \"passed\": true}, {\"check\": \"fixture 4\", \"actual\": [1, 1, 2, 2], \"expected\": [1, 1, 2, 2], \"passed\": true}], \"passed\": false}\n"},"broken":{"elapsed_ms":43.95,"exit_code":1,"observations":[{"actual":[0,0,6,4],"check":"fixture 1","expected":[2,1,4,3],"passed":false},{"actual":[0,0,4,4],"check":"fixture 2","expected":[3,3,3,3],"passed":false},{"actual":[0,0,3,2],"check":"fixture 3","expected":[2,0,2,2],"passed":false},{"actual":[0,0,4,4],"check":"fixture 4","expected":[1,1,2,2],"passed":false}],"passed":false,"stderr":"","stdout":"{\"observations\": [{\"check\": \"fixture 1\", \"actual\": [0, 0, 6, 4], \"expected\": [2, 1, 4, 3], \"passed\": false}, {\"check\": \"fixture 2\", \"actual\": [0, 0, 4, 4], \"expected\": [3, 3, 3, 3], \"passed\": false}, {\"check\": \"fixture 3\", \"actual\": [0, 0, 3, 2], \"expected\": [2, 0, 2, 2], \"passed\": false}, {\"check\": \"fixture 4\", \"actual\": [0, 0, 4, 4], \"expected\": [1, 1, 2, 2], \"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."}}