{"abstract":"Packaging artwork reserves two extra modules after the last bar.","category":"Barcode symbology encoding","checks":8,"contract":"Encode an integer 3..131070 as a one-track Pharmacode: repeatedly, an even value adds a wide bar and becomes (n - 2) / 2, an odd value adds a narrow bar and becomes (n - 1) / 2, until zero; bars are read in the reverse order of generation (left to right). Width: narrow 1, wide 3, spaces 2 between bars. Return [pattern, width] or None outside the range.","contract_signature":"n","evaluation_group":"w2-barcode-symbology-encoding-pharmacode-bars","failed_approach":"Counting spaces as one module each halves them.","family":"w2-barcode-symbology-encoding-pharmacode-bars-space-count","id":"FA-79836","implementations":{"attempt":{"sha256":"5a161881378614d8921ef5ca619d09ba67ae47e6447a166d14e53744b27b3c1d","source":"\"\"\"Failure Map reference implementation. Python standard library only.\"\"\"\nimport json\n\nN = 1\nobservations = []\ndef solve(n):\n    if not isinstance(n, int) or n < 3 or n > 131070:\n        return None\n    bars = []\n    while n > 0:\n        if n % 2 == 0:\n            bars.append('w')\n            n = (n - 2) // 2\n        else:\n            bars.append('n')\n            n = (n - 1) // 2\n    bars.reverse()\n    width = sum(3 if b == 'w' else 1 for b in bars) + (len(bars) - 1)\n    return [''.join(bars), width]\ndef check(label, actual, expected):\n    observations.append({\"check\": label, \"actual\": actual, \"expected\": expected, \"passed\": actual == expected})\nfixtures = [[[34, ['nnnww', 17]], [120, ['wwwnnw', 24]], [1, None], [2, None], [131071, None], [0, None], [-5, None], [306, ['nnwwnnww', 30]]], [[6, ['ww', 8]], [146, ['nnwnnww', 25]], [2, None], [131071, None], [0, None], [-5, None], [1, None], [85, ['nwnwwn', 22]]], [[142, ['nnnwwww', 27]], [65, ['nnnnwn', 18]], [131071, None], [0, None], [-5, None], [1, None], [2, None], [396, ['wnnnwwnw', 30]]], [[229, ['wwnnwwn', 27]], [333, ['nwnnwwwn', 30]], [0, None], [-5, None], [1, None], [2, None], [131071, None], [143, ['nnwnnnn', 21]]], [[157, ['nnwwwwn', 27]], [29, ['wwwn', 16]], [-5, None], [1, None], [2, None], [131071, None], [0, None], [225, ['wwnnnwn', 25]]]]\nlabels = [\"regression: spaces between bars\", \"repair trap\", \"combined fault\", \"control\", \"control\", \"boundary\", \"boundary\", \"control\"]\nfor i, (args, expected) in enumerate(fixtures[N-1]):\n    check(\"%s %d\" % (labels[i % len(labels)], i), solve(args), expected)\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":"7fb0cf0061bcad2915f5ef8d6ff402bcf149afed4df3e7a4b97b37c099829998","source":"\"\"\"Failure Map reference implementation. Python standard library only.\"\"\"\nimport json\n\nN = 1\nobservations = []\ndef solve(n):\n    if not isinstance(n, int) or n < 3 or n > 131070:\n        return None\n    bars = []\n    while n > 0:\n        if n % 2 == 0:\n            bars.append('w')\n            n = (n - 2) // 2\n        else:\n            bars.append('n')\n            n = (n - 1) // 2\n    bars.reverse()\n    width = sum(3 if b == 'w' else 1 for b in bars) + 2 * len(bars)\n    return [''.join(bars), width]\ndef check(label, actual, expected):\n    observations.append({\"check\": label, \"actual\": actual, \"expected\": expected, \"passed\": actual == expected})\nfixtures = [[[34, ['nnnww', 17]], [120, ['wwwnnw', 24]], [1, None], [2, None], [131071, None], [0, None], [-5, None], [306, ['nnwwnnww', 30]]], [[6, ['ww', 8]], [146, ['nnwnnww', 25]], [2, None], [131071, None], [0, None], [-5, None], [1, None], [85, ['nwnwwn', 22]]], [[142, ['nnnwwww', 27]], [65, ['nnnnwn', 18]], [131071, None], [0, None], [-5, None], [1, None], [2, None], [396, ['wnnnwwnw', 30]]], [[229, ['wwnnwwn', 27]], [333, ['nwnnwwwn', 30]], [0, None], [-5, None], [1, None], [2, None], [131071, None], [143, ['nnwnnnn', 21]]], [[157, ['nnwwwwn', 27]], [29, ['wwwn', 16]], [-5, None], [1, None], [2, None], [131071, None], [0, None], [225, ['wwnnnwn', 25]]]]\nlabels = [\"regression: spaces between bars\", \"repair trap\", \"combined fault\", \"control\", \"control\", \"boundary\", \"boundary\", \"control\"]\nfor i, (args, expected) in enumerate(fixtures[N-1]):\n    check(\"%s %d\" % (labels[i % len(labels)], i), solve(args), expected)\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":"A deterministic bounded teaching model with a stipulated contract; it makes no claim of conformance to any published specification. 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":"w2-barcode-symbology-encoding-pharmacode-bars-space-count","generated_at":"2026-09-29T14:49:48.242859+00:00","license":"CC0-1.0","python":"3.12.14","seed":1,"split":"open-access"},"relevance":"Retail, logistics, pharmacy and document workflows depend on encoders that produce exactly the module pattern, code-set switches, separators and quiet zones scanners expect; one misplaced module or separator makes a label unreadable or, worse, scan as different data.","root_cause":"A space is counted after every bar instead of between bars.","sha256":"48dc72b26889551845357adb3502affd6726c0b82ec40579646c393f256d976d","title":"Pharmacode width counts a trailing space · 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":42.298,"exit_code":1,"observations":[{"actual":["nnnww",13],"check":"regression: spaces between bars 0","expected":["nnnww",17],"passed":false},{"actual":["wwwnnw",19],"check":"repair trap 1","expected":["wwwnnw",24],"passed":false},{"actual":null,"check":"combined fault 2","expected":null,"passed":true},{"actual":null,"check":"control 3","expected":null,"passed":true},{"actual":null,"check":"control 4","expected":null,"passed":true},{"actual":null,"check":"boundary 5","expected":null,"passed":true},{"actual":null,"check":"boundary 6","expected":null,"passed":true},{"actual":["nnwwnnww",23],"check":"control 7","expected":["nnwwnnww",30],"passed":false}],"passed":false,"stderr":"","stdout":"{\"observations\": [{\"check\": \"regression: spaces between bars 0\", \"actual\": [\"nnnww\", 13], \"expected\": [\"nnnww\", 17], \"passed\": false}, {\"check\": \"repair trap 1\", \"actual\": [\"wwwnnw\", 19], \"expected\": [\"wwwnnw\", 24], \"passed\": false}, {\"check\": \"combined fault 2\", \"actual\": null, \"expected\": null, \"passed\": true}, {\"check\": \"control 3\", \"actual\": null, \"expected\": null, \"passed\": true}, {\"check\": \"control 4\", \"actual\": null, \"expected\": null, \"passed\": true}, {\"check\": \"boundary 5\", \"actual\": null, \"expected\": null, \"passed\": true}, {\"check\": \"boundary 6\", \"actual\": null, \"expected\": null, \"passed\": true}, {\"check\": \"control 7\", \"actual\": [\"nnwwnnww\", 23], \"expected\": [\"nnwwnnww\", 30], \"passed\": false}], \"passed\": false}\n"},"broken":{"elapsed_ms":40.021,"exit_code":1,"observations":[{"actual":["nnnww",19],"check":"regression: spaces between bars 0","expected":["nnnww",17],"passed":false},{"actual":["wwwnnw",26],"check":"repair trap 1","expected":["wwwnnw",24],"passed":false},{"actual":null,"check":"combined fault 2","expected":null,"passed":true},{"actual":null,"check":"control 3","expected":null,"passed":true},{"actual":null,"check":"control 4","expected":null,"passed":true},{"actual":null,"check":"boundary 5","expected":null,"passed":true},{"actual":null,"check":"boundary 6","expected":null,"passed":true},{"actual":["nnwwnnww",32],"check":"control 7","expected":["nnwwnnww",30],"passed":false}],"passed":false,"stderr":"","stdout":"{\"observations\": [{\"check\": \"regression: spaces between bars 0\", \"actual\": [\"nnnww\", 19], \"expected\": [\"nnnww\", 17], \"passed\": false}, {\"check\": \"repair trap 1\", \"actual\": [\"wwwnnw\", 26], \"expected\": [\"wwwnnw\", 24], \"passed\": false}, {\"check\": \"combined fault 2\", \"actual\": null, \"expected\": null, \"passed\": true}, {\"check\": \"control 3\", \"actual\": null, \"expected\": null, \"passed\": true}, {\"check\": \"control 4\", \"actual\": null, \"expected\": null, \"passed\": true}, {\"check\": \"boundary 5\", \"actual\": null, \"expected\": null, \"passed\": true}, {\"check\": \"boundary 6\", \"actual\": null, \"expected\": null, \"passed\": true}, {\"check\": \"control 7\", \"actual\": [\"nnwwnnww\", 32], \"expected\": [\"nnwwnnww\", 30], \"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."}}