{"abstract":"An ambiguous pointer store kills possible old values.","category":"Static analysis soundness","checks":6,"contract":"Heap maps allocated object names to possible integer values. Every target must name an allocated object already present in the heap; dangling targets are outside this model. Store a known value through a list of possible targets: unique target replaces, multiple targets union, empty target list changes nothing. Return sorted value lists.","contract_signature":"heap, targets, value","evaluation_group":"model-5497e0e13d3d44a5","failed_approach":"Always weakly updating is conservative but fails the required singleton precision.","family":"z-static_analysis-alias-weak-update","id":"FA-11511","implementations":{"attempt":{"sha256":"0e0dfc93c4ba51cc9770d7608db1217d78f67a0cf2bddb601bb8bc448666ae58","source":"\"\"\"Failure Map reference implementation. Python standard library only.\"\"\"\nimport json\n\nN = 1\nobservations = []\ndef solve(heap, targets, value):\n    out={k:set(v) for k,v in heap.items()}\n    for k in set(targets): out[k].add(value)\n    return {k:sorted(v) for k,v in out.items()}\ndef check(label, actual, expected):\n    observations.append({\"check\": label, \"actual\": actual, \"expected\": expected, \"passed\": actual == expected})\ncheck('ambiguous store',solve({'a':[0],'b':[1]},['a','b'],N+2),{'a':[0,N+2],'b':[1,N+2]})\ncheck('definite store',solve({'a':[0]},['a'],N),{'a':[N]})\ncheck('duplicate target is unique',solve({'a':[0]},['a','a'],N),{'a':[N]})\ncheck('no target',solve({'a':[N]},[],0),{'a':[N]})\ncheck('unrelated object',solve({'a':[0],'b':[N]},['a'],1),{'a':[1],'b':[N]})\ncheck('empty heap',solve({},[],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":"818e3bbe6ca159e8cc91d2c9f4da0b0d210a6a1b314716d40bad5e5ec02c33cd","source":"\"\"\"Failure Map reference implementation. Python standard library only.\"\"\"\nimport json\n\nN = 1\nobservations = []\ndef solve(heap, targets, value):\n    out={k:set(v) for k,v in heap.items()}\n    for k in set(targets): out[k]={value}\n    return {k:sorted(v) for k,v in out.items()}\ndef check(label, actual, expected):\n    observations.append({\"check\": label, \"actual\": actual, \"expected\": expected, \"passed\": actual == expected})\ncheck('ambiguous store',solve({'a':[0],'b':[1]},['a','b'],N+2),{'a':[0,N+2],'b':[1,N+2]})\ncheck('definite store',solve({'a':[0]},['a'],N),{'a':[N]})\ncheck('duplicate target is unique',solve({'a':[0]},['a','a'],N),{'a':[N]})\ncheck('no target',solve({'a':[N]},[],0),{'a':[N]})\ncheck('unrelated object',solve({'a':[0],'b':[N]},['a'],1),{'a':[1],'b':[N]})\ncheck('empty heap',solve({},[],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":" 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":"z-static_analysis-alias-weak-update","generated_at":"2026-09-29T14:38:48.607947+00:00","license":"CC0-1.0","python":"3.12.14","seed":1,"split":"open-access"},"relevance":"A deterministic offline analysis model exposing a specific soundness or precision boundary; it does not implement a complete language analyzer.","root_cause":"A store through a may-alias pointer is treated as a definite overwrite of every target.","sha256":"3dbf9209ed11f1061a32aef30d396ed2e329417328e7810764ad8a948b4b3ca4","title":"An ambiguous pointer store kills possible old values · 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":40.586,"exit_code":1,"observations":[{"actual":{"a":[0,3],"b":[1,3]},"check":"ambiguous store","expected":{"a":[0,3],"b":[1,3]},"passed":true},{"actual":{"a":[0,1]},"check":"definite store","expected":{"a":[1]},"passed":false},{"actual":{"a":[0,1]},"check":"duplicate target is unique","expected":{"a":[1]},"passed":false},{"actual":{"a":[1]},"check":"no target","expected":{"a":[1]},"passed":true},{"actual":{"a":[0,1],"b":[1]},"check":"unrelated object","expected":{"a":[1],"b":[1]},"passed":false},{"actual":{},"check":"empty heap","expected":{},"passed":true}],"passed":false,"stderr":"","stdout":"{\"observations\": [{\"check\": \"ambiguous store\", \"actual\": {\"a\": [0, 3], \"b\": [1, 3]}, \"expected\": {\"a\": [0, 3], \"b\": [1, 3]}, \"passed\": true}, {\"check\": \"definite store\", \"actual\": {\"a\": [0, 1]}, \"expected\": {\"a\": [1]}, \"passed\": false}, {\"check\": \"duplicate target is unique\", \"actual\": {\"a\": [0, 1]}, \"expected\": {\"a\": [1]}, \"passed\": false}, {\"check\": \"no target\", \"actual\": {\"a\": [1]}, \"expected\": {\"a\": [1]}, \"passed\": true}, {\"check\": \"unrelated object\", \"actual\": {\"a\": [0, 1], \"b\": [1]}, \"expected\": {\"a\": [1], \"b\": [1]}, \"passed\": false}, {\"check\": \"empty heap\", \"actual\": {}, \"expected\": {}, \"passed\": true}], \"passed\": false}\n"},"broken":{"elapsed_ms":39.633,"exit_code":1,"observations":[{"actual":{"a":[3],"b":[3]},"check":"ambiguous store","expected":{"a":[0,3],"b":[1,3]},"passed":false},{"actual":{"a":[1]},"check":"definite store","expected":{"a":[1]},"passed":true},{"actual":{"a":[1]},"check":"duplicate target is unique","expected":{"a":[1]},"passed":true},{"actual":{"a":[1]},"check":"no target","expected":{"a":[1]},"passed":true},{"actual":{"a":[1],"b":[1]},"check":"unrelated object","expected":{"a":[1],"b":[1]},"passed":true},{"actual":{},"check":"empty heap","expected":{},"passed":true}],"passed":false,"stderr":"","stdout":"{\"observations\": [{\"check\": \"ambiguous store\", \"actual\": {\"a\": [3], \"b\": [3]}, \"expected\": {\"a\": [0, 3], \"b\": [1, 3]}, \"passed\": false}, {\"check\": \"definite store\", \"actual\": {\"a\": [1]}, \"expected\": {\"a\": [1]}, \"passed\": true}, {\"check\": \"duplicate target is unique\", \"actual\": {\"a\": [1]}, \"expected\": {\"a\": [1]}, \"passed\": true}, {\"check\": \"no target\", \"actual\": {\"a\": [1]}, \"expected\": {\"a\": [1]}, \"passed\": true}, {\"check\": \"unrelated object\", \"actual\": {\"a\": [1], \"b\": [1]}, \"expected\": {\"a\": [1], \"b\": [1]}, \"passed\": true}, {\"check\": \"empty heap\", \"actual\": {}, \"expected\": {}, \"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."}}