{"abstract":"The queue publish operation is admitted even though a mandatory message has no matching queue.","category":"Queues","checks":9,"contract":"Return a Boolean admission decision for accept a durable queue publication. The record r must satisfy all of: len(r['message_size'][0]) <= r['message_size'][1]; r['queue_capacity'][0]+r['queue_capacity'][1] <= r['queue_capacity'][2]; bool(r['routing_target']); r['producer_epoch'][0] == r['producer_epoch'][1]; r['sequence_next'][0] == r['sequence_next'][1]+1. Extra tracing fields are ignored; validation does not mutate the record.","evaluation_group":"xd-queue-publish","failed_approach":"Adding the routing target check repairs the reported defect, but replacing the adjacent producer epoch check loses that independent invariant.","family":"xd-queue-publish-routing_target","id":"FA-736","implementations":{"attempt":{"sha256":"2fcef26b36129adc030a07730d013773b8e58b8ca888e33c5c458df7efb32479","source":"\"\"\"Failure Map reference implementation. Python standard library only.\"\"\"\nimport json\n\nN = 1\nobservations = []\ndef solve(r):\n    return (len(r['message_size'][0]) <= r['message_size'][1]) and (r['queue_capacity'][0]+r['queue_capacity'][1] <= r['queue_capacity'][2]) and (bool(r['routing_target'])) and (r['sequence_next'][0] == r['sequence_next'][1]+1)\ndef check(label, actual, expected):\n    observations.append({\"check\": label, \"actual\": actual, \"expected\": expected, \"passed\": actual == expected})\nr = {'message_size': ['abc', 3], 'queue_capacity': [8, 2, 10], 'routing_target': ['orders'], 'producer_epoch': [4, 4], 'sequence_next': [8, 7]}\ncheck('valid operation', solve(r), True)\ncheck('An oversized message bypasses broker frame limits', solve(dict(r, **{'message_size': ['abcd', 3]})), False)\ncheck('Admission exceeds the queue retained-byte budget', solve(dict(r, **{'queue_capacity': [8, 3, 10]})), False)\ncheck('A mandatory message has no matching queue', solve(dict(r, **{'routing_target': []})), False)\ncheck('A fenced producer continues publishing', solve(dict(r, **{'producer_epoch': [3, 4]})), False)\ncheck('A producer sequence gap is accepted as contiguous', solve(dict(r, **{'sequence_next': [9, 7]})), False)\ncheck('unrelated tracing metadata', solve(dict(r, trace='run-'+str(N))), True)\ncheck('repeat validation is pure', solve(r), True)\ninvalid = {'message_size': ['abcd', 3], 'queue_capacity': [8, 3, 10], 'routing_target': [], 'producer_epoch': [3, 4], 'sequence_next': [9, 7]}\nkeys = list(invalid)\npair = {keys[N % len(keys)]: invalid[keys[N % len(keys)]], keys[(N+1) % len(keys)]: invalid[keys[(N+1) % len(keys)]]}\ncheck('two independent violations in variant', solve(dict(r, **pair)), 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":"bcaa6e529cfd5df5c0f5ce34ab018eea4ef069ed909d191a68365a712e1b5dca","source":"\"\"\"Failure Map reference implementation. Python standard library only.\"\"\"\nimport json\n\nN = 1\nobservations = []\ndef solve(r):\n    return (len(r['message_size'][0]) <= r['message_size'][1]) and (r['queue_capacity'][0]+r['queue_capacity'][1] <= r['queue_capacity'][2]) and (r['producer_epoch'][0] == r['producer_epoch'][1]) and (r['sequence_next'][0] == r['sequence_next'][1]+1)\ndef check(label, actual, expected):\n    observations.append({\"check\": label, \"actual\": actual, \"expected\": expected, \"passed\": actual == expected})\nr = {'message_size': ['abc', 3], 'queue_capacity': [8, 2, 10], 'routing_target': ['orders'], 'producer_epoch': [4, 4], 'sequence_next': [8, 7]}\ncheck('valid operation', solve(r), True)\ncheck('An oversized message bypasses broker frame limits', solve(dict(r, **{'message_size': ['abcd', 3]})), False)\ncheck('Admission exceeds the queue retained-byte budget', solve(dict(r, **{'queue_capacity': [8, 3, 10]})), False)\ncheck('A mandatory message has no matching queue', solve(dict(r, **{'routing_target': []})), False)\ncheck('A fenced producer continues publishing', solve(dict(r, **{'producer_epoch': [3, 4]})), False)\ncheck('A producer sequence gap is accepted as contiguous', solve(dict(r, **{'sequence_next': [9, 7]})), False)\ncheck('unrelated tracing metadata', solve(dict(r, trace='run-'+str(N))), True)\ncheck('repeat validation is pure', solve(r), True)\ninvalid = {'message_size': ['abcd', 3], 'queue_capacity': [8, 3, 10], 'routing_target': [], 'producer_epoch': [3, 4], 'sequence_next': [9, 7]}\nkeys = list(invalid)\npair = {keys[N % len(keys)]: invalid[keys[N % len(keys)]], keys[(N+1) % len(keys)]: invalid[keys[(N+1) % len(keys)]]}\ncheck('two independent violations in variant', solve(dict(r, **pair)), 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"},"fixed":{"sha256":"8ea93560e997352f0b1e768d5f01062994be9096bf0b28345ab9c60c3fe81bc2","source":"\"\"\"Failure Map reference implementation. Python standard library only.\"\"\"\nimport json\n\nN = 1\nobservations = []\ndef solve(r):\n    return (len(r['message_size'][0]) <= r['message_size'][1]) and (r['queue_capacity'][0]+r['queue_capacity'][1] <= r['queue_capacity'][2]) and (bool(r['routing_target'])) and (r['producer_epoch'][0] == r['producer_epoch'][1]) and (r['sequence_next'][0] == r['sequence_next'][1]+1)\ndef check(label, actual, expected):\n    observations.append({\"check\": label, \"actual\": actual, \"expected\": expected, \"passed\": actual == expected})\nr = {'message_size': ['abc', 3], 'queue_capacity': [8, 2, 10], 'routing_target': ['orders'], 'producer_epoch': [4, 4], 'sequence_next': [8, 7]}\ncheck('valid operation', solve(r), True)\ncheck('An oversized message bypasses broker frame limits', solve(dict(r, **{'message_size': ['abcd', 3]})), False)\ncheck('Admission exceeds the queue retained-byte budget', solve(dict(r, **{'queue_capacity': [8, 3, 10]})), False)\ncheck('A mandatory message has no matching queue', solve(dict(r, **{'routing_target': []})), False)\ncheck('A fenced producer continues publishing', solve(dict(r, **{'producer_epoch': [3, 4]})), False)\ncheck('A producer sequence gap is accepted as contiguous', solve(dict(r, **{'sequence_next': [9, 7]})), False)\ncheck('unrelated tracing metadata', solve(dict(r, trace='run-'+str(N))), True)\ncheck('repeat validation is pure', solve(r), True)\ninvalid = {'message_size': ['abcd', 3], 'queue_capacity': [8, 3, 10], 'routing_target': [], 'producer_epoch': [3, 4], 'sequence_next': [9, 7]}\nkeys = list(invalid)\npair = {keys[N % len(keys)]: invalid[keys[N % len(keys)]], keys[(N+1) % len(keys)]: invalid[keys[(N+1) % len(keys)]]}\ncheck('two independent violations in variant', solve(dict(r, **pair)), 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":" 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":"xd-queue-publish-routing_target","generated_at":"2026-09-29T14:36:55.566440+00:00","license":"CC0-1.0","python":"3.12.14","seed":1,"split":"open-access"},"relevance":"A deterministic local contract for queues. Each negative fixture violates exactly one invariant. No transport timing, persistence, cryptographic verification, or full protocol implementation is claimed.","repair":"Require bool(r['routing_target']) together with every other stated precondition before accepting the operation.","root_cause":"The admission path omits the routing target invariant while validating the other operation preconditions.","sha256":"dbd9f0bfd9446907fade807d75f6726b90bc75b1ca78942b5b8644fd1455bc49","title":"Accept a durable queue publication: A mandatory message has no matching queue · case 01","variant":1,"variant_policy":"Five numbered records share a model and may reuse boundary fixtures.","verification":{"attempt":{"elapsed_ms":31.446,"exit_code":1,"observations":[{"actual":true,"check":"valid operation","expected":true,"passed":true},{"actual":false,"check":"An oversized message bypasses broker frame limits","expected":false,"passed":true},{"actual":false,"check":"Admission exceeds the queue retained-byte budget","expected":false,"passed":true},{"actual":false,"check":"A mandatory message has no matching queue","expected":false,"passed":true},{"actual":true,"check":"A fenced producer continues publishing","expected":false,"passed":false},{"actual":false,"check":"A producer sequence gap is accepted as contiguous","expected":false,"passed":true},{"actual":true,"check":"unrelated tracing metadata","expected":true,"passed":true},{"actual":true,"check":"repeat validation is pure","expected":true,"passed":true},{"actual":false,"check":"two independent violations in variant","expected":false,"passed":true}],"passed":false,"stderr":"","stdout":"{\"observations\": [{\"check\": \"valid operation\", \"actual\": true, \"expected\": true, \"passed\": true}, {\"check\": \"An oversized message bypasses broker frame limits\", \"actual\": false, \"expected\": false, \"passed\": true}, {\"check\": \"Admission exceeds the queue retained-byte budget\", \"actual\": false, \"expected\": false, \"passed\": true}, {\"check\": \"A mandatory message has no matching queue\", \"actual\": false, \"expected\": false, \"passed\": true}, {\"check\": \"A fenced producer continues publishing\", \"actual\": true, \"expected\": false, \"passed\": false}, {\"check\": \"A producer sequence gap is accepted as contiguous\", \"actual\": false, \"expected\": false, \"passed\": true}, {\"check\": \"unrelated tracing metadata\", \"actual\": true, \"expected\": true, \"passed\": true}, {\"check\": \"repeat validation is pure\", \"actual\": true, \"expected\": true, \"passed\": true}, {\"check\": \"two independent violations in variant\", \"actual\": false, \"expected\": false, \"passed\": true}], \"passed\": false}\n"},"broken":{"elapsed_ms":34.408,"exit_code":1,"observations":[{"actual":true,"check":"valid operation","expected":true,"passed":true},{"actual":false,"check":"An oversized message bypasses broker frame limits","expected":false,"passed":true},{"actual":false,"check":"Admission exceeds the queue retained-byte budget","expected":false,"passed":true},{"actual":true,"check":"A mandatory message has no matching queue","expected":false,"passed":false},{"actual":false,"check":"A fenced producer continues publishing","expected":false,"passed":true},{"actual":false,"check":"A producer sequence gap is accepted as contiguous","expected":false,"passed":true},{"actual":true,"check":"unrelated tracing metadata","expected":true,"passed":true},{"actual":true,"check":"repeat validation is pure","expected":true,"passed":true},{"actual":false,"check":"two independent violations in variant","expected":false,"passed":true}],"passed":false,"stderr":"","stdout":"{\"observations\": [{\"check\": \"valid operation\", \"actual\": true, \"expected\": true, \"passed\": true}, {\"check\": \"An oversized message bypasses broker frame limits\", \"actual\": false, \"expected\": false, \"passed\": true}, {\"check\": \"Admission exceeds the queue retained-byte budget\", \"actual\": false, \"expected\": false, \"passed\": true}, {\"check\": \"A mandatory message has no matching queue\", \"actual\": true, \"expected\": false, \"passed\": false}, {\"check\": \"A fenced producer continues publishing\", \"actual\": false, \"expected\": false, \"passed\": true}, {\"check\": \"A producer sequence gap is accepted as contiguous\", \"actual\": false, \"expected\": false, \"passed\": true}, {\"check\": \"unrelated tracing metadata\", \"actual\": true, \"expected\": true, \"passed\": true}, {\"check\": \"repeat validation is pure\", \"actual\": true, \"expected\": true, \"passed\": true}, {\"check\": \"two independent violations in variant\", \"actual\": false, \"expected\": false, \"passed\": true}], \"passed\": false}\n"},"fixed":{"elapsed_ms":32.851,"exit_code":0,"observations":[{"actual":true,"check":"valid operation","expected":true,"passed":true},{"actual":false,"check":"An oversized message bypasses broker frame limits","expected":false,"passed":true},{"actual":false,"check":"Admission exceeds the queue retained-byte budget","expected":false,"passed":true},{"actual":false,"check":"A mandatory message has no matching queue","expected":false,"passed":true},{"actual":false,"check":"A fenced producer continues publishing","expected":false,"passed":true},{"actual":false,"check":"A producer sequence gap is accepted as contiguous","expected":false,"passed":true},{"actual":true,"check":"unrelated tracing metadata","expected":true,"passed":true},{"actual":true,"check":"repeat validation is pure","expected":true,"passed":true},{"actual":false,"check":"two independent violations in variant","expected":false,"passed":true}],"passed":true,"stderr":"","stdout":"{\"observations\": [{\"check\": \"valid operation\", \"actual\": true, \"expected\": true, \"passed\": true}, {\"check\": \"An oversized message bypasses broker frame limits\", \"actual\": false, \"expected\": false, \"passed\": true}, {\"check\": \"Admission exceeds the queue retained-byte budget\", \"actual\": false, \"expected\": false, \"passed\": true}, {\"check\": \"A mandatory message has no matching queue\", \"actual\": false, \"expected\": false, \"passed\": true}, {\"check\": \"A fenced producer continues publishing\", \"actual\": false, \"expected\": false, \"passed\": true}, {\"check\": \"A producer sequence gap is accepted as contiguous\", \"actual\": false, \"expected\": false, \"passed\": true}, {\"check\": \"unrelated tracing metadata\", \"actual\": true, \"expected\": true, \"passed\": true}, {\"check\": \"repeat validation is pure\", \"actual\": true, \"expected\": true, \"passed\": true}, {\"check\": \"two independent violations in variant\", \"actual\": false, \"expected\": false, \"passed\": true}], \"passed\": true}\n"}},"verified":true,"visibility":"public"}