{"abstract":"The drive unwinds a full turn even though a nearer wrap of the target is reachable.","category":"Solar tracker geometry","checks":7,"contract":"The azimuth drive has a continuous mechanical range [min_az, max_az] (may exceed 360 span). target_az is 0..359. Candidates are target + 360k inside the range; pick the smallest |move| from cur_az, ties to the candidate nearest the range centre, then the smaller. If none is in range, go to the limit with the smaller angular distance (mod 360) to the target, ties to min_az, status 'limit'. Return [position, move, status].","contract_signature":"cur_az, target_az, min_az, max_az","evaluation_group":"w2-solar_tracker_geometry-azimuth-cable-wrap","failed_approach":"Skipping the lowest wrap misses targets exactly at the lower stop.","family":"w2-solar_tracker_geometry-azimuth-cable-wrap-wrap-candidate-enumeration","id":"FA-93431","implementations":{"attempt":{"sha256":"0cf53ebb3947257ac50573badcd73cf4553f0ed03c0bd85504367df9f6fb3fc4","source":"\"\"\"Failure Map reference implementation. Python standard library only.\"\"\"\nimport json\nimport math\nN = 1\nobservations = []\ndef solve(cur_az, target_az, min_az, max_az):\n    cands = []\n    k0 = math.floor((min_az - target_az) / 360)\n    for k in range(k0 + 1, k0 + 4):\n        c = target_az + 360 * k\n        if min_az <= c <= max_az:\n            cands.append(c)\n    center = (min_az + max_az) / 2\n    if not cands:\n        def ang(a):\n            d = (a - target_az) % 360\n            return min(d, 360 - d)\n        lim = min_az if ang(min_az) <= ang(max_az) else max_az\n        return [lim, lim - cur_az, 'limit']\n    best = min(cands, key=lambda c: (abs(c - cur_az), abs(c - center), c))\n    return [best, best - cur_az, 'ok']\ndef check(label, actual, expected):\n    observations.append({\"check\": label, \"actual\": actual, \"expected\": expected, \"passed\": actual == expected})\nfixtures = [[['boundary: target exactly at max stop', [0, 270, -270, 270], [-90, -90, 'ok']],\n  ['normal: short way through north', [350, 10, -270, 270], [10, -340, 'ok']],\n  ['boundary: target outside narrow range', [180, 0, 90, 270], [90, -90, 'limit']],\n  ['regression: wrap candidate enumeration', [-180, 0, -180, 180], [0, 180, 'ok']],\n  ['regression: wrap candidate enumeration (partial repair)', [90, 0, 0, 180], [0, -90, 'ok']],\n  ['control 1', [180, 0, -90, 450], [0, -180, 'ok']],\n  ['control 2', [180, 315, 0, 360], [315, 135, 'ok']]],\n [['boundary: target exactly at max stop', [0, 270, -270, 270], [-90, -90, 'ok']],\n  ['normal: short way through north', [350, 10, -270, 270], [10, -340, 'ok']],\n  ['boundary: target outside narrow range', [180, 0, 90, 270], [90, -90, 'limit']],\n  ['regression: wrap candidate enumeration', [135, 0, -45, 200], [0, -135, 'ok']],\n  ['regression: wrap candidate enumeration (partial repair)', [-135, 180, -180, 180],\n   [-180, -45, 'ok']],\n  ['control 1', [45, 225, -90, 450], [225, 180, 'ok']],\n  ['control 2', [180, 180, -90, 450], [180, 0, 'ok']]],\n [['boundary: target exactly at max stop', [0, 270, -270, 270], [-90, -90, 'ok']],\n  ['normal: short way through north', [350, 10, -270, 270], [10, -340, 'ok']],\n  ['boundary: target outside narrow range', [180, 0, 90, 270], [90, -90, 'limit']],\n  ['regression: wrap candidate enumeration', [0, 180, -45, 200], [180, 180, 'ok']],\n  ['regression: wrap candidate enumeration (partial repair)', [-225, 90, -270, 270],\n   [-270, -45, 'ok']],\n  ['control 1', [0, 45, -90, 450], [45, 45, 'ok']],\n  ['control 2', [360, 45, 0, 360], [45, -315, 'ok']]],\n [['boundary: target exactly at max stop', [0, 270, -270, 270], [-90, -90, 'ok']],\n  ['normal: short way through north', [350, 10, -270, 270], [10, -340, 'ok']],\n  ['boundary: target outside narrow range', [180, 0, 90, 270], [90, -90, 'limit']],\n  ['regression: wrap candidate enumeration', [180, 45, -180, 180], [45, -135, 'ok']],\n  ['regression: wrap candidate enumeration (partial repair)', [270, 45, 45, 315], [45, -225, 'ok']],\n  ['control 1', [315, 135, 45, 315], [135, -180, 'ok']],\n  ['control 2', [45, 135, 45, 315], [135, 90, 'ok']]],\n [['boundary: target exactly at max stop', [0, 270, -270, 270], [-90, -90, 'ok']],\n  ['normal: short way through north', [350, 10, -270, 270], [10, -340, 'ok']],\n  ['boundary: target outside narrow range', [180, 0, 90, 270], [90, -90, 'limit']],\n  ['regression: wrap candidate enumeration', [135, 135, -45, 200], [135, 0, 'ok']],\n  ['regression: wrap candidate enumeration (partial repair)', [-270, 90, -270, 270],\n   [-270, 0, 'ok']],\n  ['control 1', [45, 315, 0, 180], [0, -45, 'limit']],\n  ['control 2', [315, 180, 0, 360], [180, -135, 'ok']]]]\nfor label, args, expected in fixtures[N-1]:\n    check(label, 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":"ccdb21271259c3e62da4037a685b7e0beaf86387013ccc4e86cfc4cf8f776111","source":"\"\"\"Failure Map reference implementation. Python standard library only.\"\"\"\nimport json\nimport math\nN = 1\nobservations = []\ndef solve(cur_az, target_az, min_az, max_az):\n    cands = []\n    k0 = math.floor((min_az - target_az) / 360)\n    for k in range(k0, k0 + 1):\n        c = target_az + 360 * k\n        if min_az <= c <= max_az:\n            cands.append(c)\n    center = (min_az + max_az) / 2\n    if not cands:\n        def ang(a):\n            d = (a - target_az) % 360\n            return min(d, 360 - d)\n        lim = min_az if ang(min_az) <= ang(max_az) else max_az\n        return [lim, lim - cur_az, 'limit']\n    best = min(cands, key=lambda c: (abs(c - cur_az), abs(c - center), c))\n    return [best, best - cur_az, 'ok']\ndef check(label, actual, expected):\n    observations.append({\"check\": label, \"actual\": actual, \"expected\": expected, \"passed\": actual == expected})\nfixtures = [[['boundary: target exactly at max stop', [0, 270, -270, 270], [-90, -90, 'ok']],\n  ['normal: short way through north', [350, 10, -270, 270], [10, -340, 'ok']],\n  ['boundary: target outside narrow range', [180, 0, 90, 270], [90, -90, 'limit']],\n  ['regression: wrap candidate enumeration', [-180, 0, -180, 180], [0, 180, 'ok']],\n  ['regression: wrap candidate enumeration (partial repair)', [90, 0, 0, 180], [0, -90, 'ok']],\n  ['control 1', [180, 0, -90, 450], [0, -180, 'ok']],\n  ['control 2', [180, 315, 0, 360], [315, 135, 'ok']]],\n [['boundary: target exactly at max stop', [0, 270, -270, 270], [-90, -90, 'ok']],\n  ['normal: short way through north', [350, 10, -270, 270], [10, -340, 'ok']],\n  ['boundary: target outside narrow range', [180, 0, 90, 270], [90, -90, 'limit']],\n  ['regression: wrap candidate enumeration', [135, 0, -45, 200], [0, -135, 'ok']],\n  ['regression: wrap candidate enumeration (partial repair)', [-135, 180, -180, 180],\n   [-180, -45, 'ok']],\n  ['control 1', [45, 225, -90, 450], [225, 180, 'ok']],\n  ['control 2', [180, 180, -90, 450], [180, 0, 'ok']]],\n [['boundary: target exactly at max stop', [0, 270, -270, 270], [-90, -90, 'ok']],\n  ['normal: short way through north', [350, 10, -270, 270], [10, -340, 'ok']],\n  ['boundary: target outside narrow range', [180, 0, 90, 270], [90, -90, 'limit']],\n  ['regression: wrap candidate enumeration', [0, 180, -45, 200], [180, 180, 'ok']],\n  ['regression: wrap candidate enumeration (partial repair)', [-225, 90, -270, 270],\n   [-270, -45, 'ok']],\n  ['control 1', [0, 45, -90, 450], [45, 45, 'ok']],\n  ['control 2', [360, 45, 0, 360], [45, -315, 'ok']]],\n [['boundary: target exactly at max stop', [0, 270, -270, 270], [-90, -90, 'ok']],\n  ['normal: short way through north', [350, 10, -270, 270], [10, -340, 'ok']],\n  ['boundary: target outside narrow range', [180, 0, 90, 270], [90, -90, 'limit']],\n  ['regression: wrap candidate enumeration', [180, 45, -180, 180], [45, -135, 'ok']],\n  ['regression: wrap candidate enumeration (partial repair)', [270, 45, 45, 315], [45, -225, 'ok']],\n  ['control 1', [315, 135, 45, 315], [135, -180, 'ok']],\n  ['control 2', [45, 135, 45, 315], [135, 90, 'ok']]],\n [['boundary: target exactly at max stop', [0, 270, -270, 270], [-90, -90, 'ok']],\n  ['normal: short way through north', [350, 10, -270, 270], [10, -340, 'ok']],\n  ['boundary: target outside narrow range', [180, 0, 90, 270], [90, -90, 'limit']],\n  ['regression: wrap candidate enumeration', [135, 135, -45, 200], [135, 0, 'ok']],\n  ['regression: wrap candidate enumeration (partial repair)', [-270, 90, -270, 270],\n   [-270, 0, 'ok']],\n  ['control 1', [45, 315, 0, 180], [0, -45, 'limit']],\n  ['control 2', [315, 180, 0, 360], [180, -135, 'ok']]]]\nfor label, args, expected in fixtures[N-1]:\n    check(label, 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":"Deterministic stipulated toy contract for teaching; no claim of conformance with any standard, vendor protocol or production controller. 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-solar_tracker_geometry-azimuth-cable-wrap-wrap-candidate-enumeration","generated_at":"2026-09-29T14:51:55.030078+00:00","license":"CC0-1.0","python":"3.12.14","seed":1,"split":"open-access"},"relevance":"Single-axis and dual-axis solar trackers turn a sun direction into actuator commands; a sign, frame or limit mistake points a whole plant away from the sun or into a mechanical stop.","root_cause":"Only the first wrap of the target is considered.","sha256":"a23130b229b64196a3c7d01a3c62bb4a0d24245b4f45a34ddd67a0bfc96d76b1","title":"Dual-axis azimuth cable-wrap slew: wrap candidate enumeration · 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.059,"exit_code":1,"observations":[{"actual":[-90,-90,"ok"],"check":"boundary: target exactly at max stop","expected":[-90,-90,"ok"],"passed":true},{"actual":[10,-340,"ok"],"check":"normal: short way through north","expected":[10,-340,"ok"],"passed":true},{"actual":[90,-90,"limit"],"check":"boundary: target outside narrow range","expected":[90,-90,"limit"],"passed":true},{"actual":[0,180,"ok"],"check":"regression: wrap candidate enumeration","expected":[0,180,"ok"],"passed":true},{"actual":[0,-90,"limit"],"check":"regression: wrap candidate enumeration (partial repair)","expected":[0,-90,"ok"],"passed":false},{"actual":[0,-180,"ok"],"check":"control 1","expected":[0,-180,"ok"],"passed":true},{"actual":[315,135,"ok"],"check":"control 2","expected":[315,135,"ok"],"passed":true}],"passed":false,"stderr":"","stdout":"{\"observations\": [{\"check\": \"boundary: target exactly at max stop\", \"actual\": [-90, -90, \"ok\"], \"expected\": [-90, -90, \"ok\"], \"passed\": true}, {\"check\": \"normal: short way through north\", \"actual\": [10, -340, \"ok\"], \"expected\": [10, -340, \"ok\"], \"passed\": true}, {\"check\": \"boundary: target outside narrow range\", \"actual\": [90, -90, \"limit\"], \"expected\": [90, -90, \"limit\"], \"passed\": true}, {\"check\": \"regression: wrap candidate enumeration\", \"actual\": [0, 180, \"ok\"], \"expected\": [0, 180, \"ok\"], \"passed\": true}, {\"check\": \"regression: wrap candidate enumeration (partial repair)\", \"actual\": [0, -90, \"limit\"], \"expected\": [0, -90, \"ok\"], \"passed\": false}, {\"check\": \"control 1\", \"actual\": [0, -180, \"ok\"], \"expected\": [0, -180, \"ok\"], \"passed\": true}, {\"check\": \"control 2\", \"actual\": [315, 135, \"ok\"], \"expected\": [315, 135, \"ok\"], \"passed\": true}], \"passed\": false}\n"},"broken":{"elapsed_ms":39.676,"exit_code":1,"observations":[{"actual":[270,270,"limit"],"check":"boundary: target exactly at max stop","expected":[-90,-90,"ok"],"passed":false},{"actual":[-270,-620,"limit"],"check":"normal: short way through north","expected":[10,-340,"ok"],"passed":false},{"actual":[90,-90,"limit"],"check":"boundary: target outside narrow range","expected":[90,-90,"limit"],"passed":true},{"actual":[-180,0,"limit"],"check":"regression: wrap candidate enumeration","expected":[0,180,"ok"],"passed":false},{"actual":[0,-90,"ok"],"check":"regression: wrap candidate enumeration (partial repair)","expected":[0,-90,"ok"],"passed":true},{"actual":[-90,-270,"limit"],"check":"control 1","expected":[0,-180,"ok"],"passed":false},{"actual":[0,-180,"limit"],"check":"control 2","expected":[315,135,"ok"],"passed":false}],"passed":false,"stderr":"","stdout":"{\"observations\": [{\"check\": \"boundary: target exactly at max stop\", \"actual\": [270, 270, \"limit\"], \"expected\": [-90, -90, \"ok\"], \"passed\": false}, {\"check\": \"normal: short way through north\", \"actual\": [-270, -620, \"limit\"], \"expected\": [10, -340, \"ok\"], \"passed\": false}, {\"check\": \"boundary: target outside narrow range\", \"actual\": [90, -90, \"limit\"], \"expected\": [90, -90, \"limit\"], \"passed\": true}, {\"check\": \"regression: wrap candidate enumeration\", \"actual\": [-180, 0, \"limit\"], \"expected\": [0, 180, \"ok\"], \"passed\": false}, {\"check\": \"regression: wrap candidate enumeration (partial repair)\", \"actual\": [0, -90, \"ok\"], \"expected\": [0, -90, \"ok\"], \"passed\": true}, {\"check\": \"control 1\", \"actual\": [-90, -270, \"limit\"], \"expected\": [0, -180, \"ok\"], \"passed\": false}, {\"check\": \"control 2\", \"actual\": [0, -180, \"limit\"], \"expected\": [315, 135, \"ok\"], \"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."}}