{"abstract":"A Pascal string length exceeds its physical slot.","category":"Binary formats","checks":4,"contract":"Decode length-prefixed bytes, clamping declared length to available slot capacity.","evaluation_group":"model-d9e41a6996194dfb","failed_approach":"The attempted repair handles the primary example but still violates a separate boundary of the same contract.","family":"xp-binary-pascal-capacity","id":"FA-3676","implementations":{"attempt":{"sha256":"6d9853f637ed5abccb8103e775020b1ba90895452797c339cb538ca0f7fa4400","source":"\"\"\"Failure Map reference implementation. Python standard library only.\"\"\"\nimport json\nimport re, unicodedata, json, csv, io, html, base64, binascii, codecs, struct\nfrom urllib.parse import quote, unquote, unquote_to_bytes, urlencode, parse_qsl, urlsplit, urlunsplit\nfrom email.header import decode_header, make_header\nfrom email.utils import getaddresses\nfrom xml.etree import ElementTree as ET\nimport shlex, string, textwrap\n\nN = 1\nobservations = []\ndef solve(x):\n    try:\n        return x[1:x[0]] if x else []\n    except Exception as exc:\n        return {\"error\": type(exc).__name__}\ndef check(label, actual, expected):\n    observations.append({\"check\": label, \"actual\": actual, \"expected\": expected, \"passed\": actual == expected})\ncheck('boundary 1', solve([2, 65, 66, 0]), [65, 66])\ncheck('boundary 2', solve([5, 65, 66]), [65, 66])\ncheck('boundary 3', solve([0, 65]), [])\ncheck('boundary 4', solve([]), [])\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":"f92fcd919d5d6aa424e9799e2bbf65905c4e44fdd301f82bcc632f7104df03bf","source":"\"\"\"Failure Map reference implementation. Python standard library only.\"\"\"\nimport json\nimport re, unicodedata, json, csv, io, html, base64, binascii, codecs, struct\nfrom urllib.parse import quote, unquote, unquote_to_bytes, urlencode, parse_qsl, urlsplit, urlunsplit\nfrom email.header import decode_header, make_header\nfrom email.utils import getaddresses\nfrom xml.etree import ElementTree as ET\nimport shlex, string, textwrap\n\nN = 1\nobservations = []\ndef solve(x):\n    try:\n        return x[1:]\n    except Exception as exc:\n        return {\"error\": type(exc).__name__}\ndef check(label, actual, expected):\n    observations.append({\"check\": label, \"actual\": actual, \"expected\": expected, \"passed\": actual == expected})\ncheck('boundary 1', solve([2, 65, 66, 0]), [65, 66])\ncheck('boundary 2', solve([5, 65, 66]), [65, 66])\ncheck('boundary 3', solve([0, 65]), [])\ncheck('boundary 4', solve([]), [])\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"},"fixed":{"sha256":"2af25cd4dac5d13f67890216847a5bd7c6d54269c8568e16b2f7a1d08e7f6126","source":"\"\"\"Failure Map reference implementation. Python standard library only.\"\"\"\nimport json\nimport re, unicodedata, json, csv, io, html, base64, binascii, codecs, struct\nfrom urllib.parse import quote, unquote, unquote_to_bytes, urlencode, parse_qsl, urlsplit, urlunsplit\nfrom email.header import decode_header, make_header\nfrom email.utils import getaddresses\nfrom xml.etree import ElementTree as ET\nimport shlex, string, textwrap\n\nN = 1\nobservations = []\ndef solve(x):\n    try:\n        return x[1:1+min(x[0],len(x)-1)] if x else []\n    except Exception as exc:\n        return {\"error\": type(exc).__name__}\ndef check(label, actual, expected):\n    observations.append({\"check\": label, \"actual\": actual, \"expected\": expected, \"passed\": actual == expected})\ncheck('boundary 1', solve([2, 65, 66, 0]), [65, 66])\ncheck('boundary 2', solve([5, 65, 66]), [65, 66])\ncheck('boundary 3', solve([0, 65]), [])\ncheck('boundary 4', solve([]), [])\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":"xp-binary-pascal-capacity","generated_at":"2026-09-29T14:37:29.447097+00:00","license":"CC0-1.0","python":"3.12.14","seed":1,"split":"open-access"},"relevance":"A local executable model for consumers of structured text; oracle values are authored literals, not outputs copied from the repaired implementation.","repair":"Implement the complete stated contract, including the boundary fixtures: Decode length-prefixed bytes, clamping declared length to available slot capacity.","root_cause":"The implementation applies an operation whose text or grammar semantics violate this contract: Decode length-prefixed bytes, clamping declared length to available slot capacity.","sha256":"28499c372c01214f51e0aebfa3c4661e8529be2bda2961053e0c0b5ca84dd101","title":"A Pascal string length exceeds its physical slot · case 01","variant":1,"variant_policy":"Five numbered records share a model and may reuse boundary fixtures.","verification":{"attempt":{"elapsed_ms":61.76,"exit_code":1,"observations":[{"actual":[65],"check":"boundary 1","expected":[65,66],"passed":false},{"actual":[65,66],"check":"boundary 2","expected":[65,66],"passed":true},{"actual":[],"check":"boundary 3","expected":[],"passed":true},{"actual":[],"check":"boundary 4","expected":[],"passed":true}],"passed":false,"stderr":"","stdout":"{\"observations\": [{\"check\": \"boundary 1\", \"actual\": [65], \"expected\": [65, 66], \"passed\": false}, {\"check\": \"boundary 2\", \"actual\": [65, 66], \"expected\": [65, 66], \"passed\": true}, {\"check\": \"boundary 3\", \"actual\": [], \"expected\": [], \"passed\": true}, {\"check\": \"boundary 4\", \"actual\": [], \"expected\": [], \"passed\": true}], \"passed\": false}\n"},"broken":{"elapsed_ms":59.094,"exit_code":1,"observations":[{"actual":[65,66,0],"check":"boundary 1","expected":[65,66],"passed":false},{"actual":[65,66],"check":"boundary 2","expected":[65,66],"passed":true},{"actual":[65],"check":"boundary 3","expected":[],"passed":false},{"actual":[],"check":"boundary 4","expected":[],"passed":true}],"passed":false,"stderr":"","stdout":"{\"observations\": [{\"check\": \"boundary 1\", \"actual\": [65, 66, 0], \"expected\": [65, 66], \"passed\": false}, {\"check\": \"boundary 2\", \"actual\": [65, 66], \"expected\": [65, 66], \"passed\": true}, {\"check\": \"boundary 3\", \"actual\": [65], \"expected\": [], \"passed\": false}, {\"check\": \"boundary 4\", \"actual\": [], \"expected\": [], \"passed\": true}], \"passed\": false}\n"},"fixed":{"elapsed_ms":148.314,"exit_code":0,"observations":[{"actual":[65,66],"check":"boundary 1","expected":[65,66],"passed":true},{"actual":[65,66],"check":"boundary 2","expected":[65,66],"passed":true},{"actual":[],"check":"boundary 3","expected":[],"passed":true},{"actual":[],"check":"boundary 4","expected":[],"passed":true}],"passed":true,"stderr":"","stdout":"{\"observations\": [{\"check\": \"boundary 1\", \"actual\": [65, 66], \"expected\": [65, 66], \"passed\": true}, {\"check\": \"boundary 2\", \"actual\": [65, 66], \"expected\": [65, 66], \"passed\": true}, {\"check\": \"boundary 3\", \"actual\": [], \"expected\": [], \"passed\": true}, {\"check\": \"boundary 4\", \"actual\": [], \"expected\": [], \"passed\": true}], \"passed\": true}\n"}},"verified":true,"visibility":"public"}