{"$schema":"https://json.schemastore.org/sarif-2.1.0.json","version":"2.1.0","runs":[{"tool":{"driver":{"name":"codehealth","informationUri":"https://codehealth.canine.dev","rules":[{"id":"D1","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D1"},{"id":"D2","name":"Cognitive Complexity","shortDescription":{"text":"Cognitive Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D2"},{"id":"D3","name":"God Classes","shortDescription":{"text":"God Classes"},"helpUri":"https://codehealth.canine.dev/dimensions/D3"},{"id":"D4","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/D4"},{"id":"D8","name":"Code Coverage","shortDescription":{"text":"Code Coverage"},"helpUri":"https://codehealth.canine.dev/dimensions/D8"},{"id":"D13","name":"Secret Scanning","shortDescription":{"text":"Secret Scanning"},"helpUri":"https://codehealth.canine.dev/dimensions/D13","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D15","name":"Churn \u00D7 Complexity Hotspots","shortDescription":{"text":"Churn \u00D7 Complexity Hotspots"},"helpUri":"https://codehealth.canine.dev/dimensions/D15"},{"id":"D17","name":"Explicit Debt","shortDescription":{"text":"Explicit Debt"},"helpUri":"https://codehealth.canine.dev/dimensions/D17"},{"id":"D27","name":"Navigability","shortDescription":{"text":"Navigability"},"helpUri":"https://codehealth.canine.dev/dimensions/D27"},{"id":"D28","name":"Secrets (history)","shortDescription":{"text":"Secrets (history)"},"helpUri":"https://codehealth.canine.dev/dimensions/D28","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D29","name":"Static Analysis (SAST)","shortDescription":{"text":"Static Analysis (SAST)"},"helpUri":"https://codehealth.canine.dev/dimensions/D29","relationships":[{"target":{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-77","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"],"owasp":"A05:2025"}},{"id":"D34","name":"Knowledge Freshness","shortDescription":{"text":"Knowledge Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/D34"},{"id":"D35","name":"Change Coupling","shortDescription":{"text":"Change Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D35"},{"id":"AX10","name":"Code composition","shortDescription":{"text":"Code composition"},"helpUri":"https://codehealth.canine.dev/dimensions/AX10"},{"id":"AX3","name":"Project dependency cycles","shortDescription":{"text":"Project dependency cycles"},"helpUri":"https://codehealth.canine.dev/dimensions/AX3"},{"id":"AX4","name":"Dependency direction","shortDescription":{"text":"Dependency direction"},"helpUri":"https://codehealth.canine.dev/dimensions/AX4"},{"id":"AXB1","name":"Runtime evidence locked \u2014 no reproducible boot","shortDescription":{"text":"Runtime evidence locked \u2014 no reproducible boot"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB1"},{"id":"ED5","name":"Idempotency","shortDescription":{"text":"Idempotency"},"helpUri":"https://codehealth.canine.dev/dimensions/ED5"},{"id":"M1","name":"Documentation (README)","shortDescription":{"text":"Documentation (README)"},"helpUri":"https://codehealth.canine.dev/dimensions/M1"},{"id":"M2","name":"Architecture documentation","shortDescription":{"text":"Architecture documentation"},"helpUri":"https://codehealth.canine.dev/dimensions/M2"},{"id":"M3","name":"Folder \u0026 project structure","shortDescription":{"text":"Folder \u0026 project structure"},"helpUri":"https://codehealth.canine.dev/dimensions/M3"},{"id":"P1","name":"CI/CD gates","shortDescription":{"text":"CI/CD gates"},"helpUri":"https://codehealth.canine.dev/dimensions/P1"},{"id":"P3","name":"Security \u0026 performance tooling","shortDescription":{"text":"Security \u0026 performance tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/P3"},{"id":"X10","name":"Duplicated predicate","shortDescription":{"text":"Duplicated predicate"},"helpUri":"https://codehealth.canine.dev/dimensions/X10"},{"id":"X12","name":"Unreachable branch","shortDescription":{"text":"Unreachable branch"},"helpUri":"https://codehealth.canine.dev/dimensions/X12"},{"id":"X13","name":"Undrained process stream","shortDescription":{"text":"Undrained process stream"},"helpUri":"https://codehealth.canine.dev/dimensions/X13"},{"id":"X14","name":"Bypassable address classification","shortDescription":{"text":"Bypassable address classification"},"helpUri":"https://codehealth.canine.dev/dimensions/X14"},{"id":"X15","name":"Unvalidated length from an untrusted reader","shortDescription":{"text":"Unvalidated length from an untrusted reader"},"helpUri":"https://codehealth.canine.dev/dimensions/X15"},{"id":"X17","name":"Uncapped recursion over a caller-supplied document","shortDescription":{"text":"Uncapped recursion over a caller-supplied document"},"helpUri":"https://codehealth.canine.dev/dimensions/X17"},{"id":"X19","name":"Unrestored process-global state","shortDescription":{"text":"Unrestored process-global state"},"helpUri":"https://codehealth.canine.dev/dimensions/X19"},{"id":"X20","name":"Mistyped argument guard","shortDescription":{"text":"Mistyped argument guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X20"},{"id":"X21","name":"Side-effecting pattern guard","shortDescription":{"text":"Side-effecting pattern guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X21"},{"id":"X22","name":"Contradicted release guard","shortDescription":{"text":"Contradicted release guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X22"},{"id":"X23","name":"Unguarded diagnostic materialisation","shortDescription":{"text":"Unguarded diagnostic materialisation"},"helpUri":"https://codehealth.canine.dev/dimensions/X23"},{"id":"X24","name":"Document value interpolated into markup unescaped","shortDescription":{"text":"Document value interpolated into markup unescaped"},"helpUri":"https://codehealth.canine.dev/dimensions/X24"},{"id":"X25","name":"Inert configuration knob","shortDescription":{"text":"Inert configuration knob"},"helpUri":"https://codehealth.canine.dev/dimensions/X25"},{"id":"X26","name":"Unsynchronised callback handoff","shortDescription":{"text":"Unsynchronised callback handoff"},"helpUri":"https://codehealth.canine.dev/dimensions/X26"},{"id":"X27","name":"Collection changed while being enumerated","shortDescription":{"text":"Collection changed while being enumerated"},"helpUri":"https://codehealth.canine.dev/dimensions/X27"},{"id":"X28","name":"Index access outside its own emptiness guard","shortDescription":{"text":"Index access outside its own emptiness guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X28"},{"id":"X3","name":"Exception handling","shortDescription":{"text":"Exception handling"},"helpUri":"https://codehealth.canine.dev/dimensions/X3"},{"id":"X30","name":"Support guard that admits what it rejects","shortDescription":{"text":"Support guard that admits what it rejects"},"helpUri":"https://codehealth.canine.dev/dimensions/X30"},{"id":"X32","name":"Type resolved by simple name across every loaded assembly","shortDescription":{"text":"Type resolved by simple name across every loaded assembly"},"helpUri":"https://codehealth.canine.dev/dimensions/X32"},{"id":"X6","name":"Hand-rolled structured-format parsing","shortDescription":{"text":"Hand-rolled structured-format parsing"},"helpUri":"https://codehealth.canine.dev/dimensions/X6"},{"id":"X7","name":"Silent fallback defaults","shortDescription":{"text":"Silent fallback defaults"},"helpUri":"https://codehealth.canine.dev/dimensions/X7"},{"id":"X9","name":"Subsumed condition operand","shortDescription":{"text":"Subsumed condition operand"},"helpUri":"https://codehealth.canine.dev/dimensions/X9"}]}},"results":[{"ruleId":"D1","level":"warning","message":{"text":"clause_weight_ls._do_flip (cyclomatic 67): clause_weight_ls._do_flip has cyclomatic complexity 67 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/clause_weight_ls.py"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc44d0bfb481180b0fbc60891cdb44be91ad216aa0bf67c08946990442d57770"}},{"ruleId":"D1","level":"warning","message":{"text":"solvers._update_neighbor_scores (cyclomatic 58): solvers._update_neighbor_scores has cyclomatic complexity 58 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/solvers.py"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7bb2559c7e1c8bbe791a4c648a826f9f07a75bb0aa7208ff9b1fba0247a74ab"}},{"ruleId":"D1","level":"warning","message":{"text":"clause_weight_ls.clause_weight_local_search (cyclomatic 51): clause_weight_ls.clause_weight_local_search has cyclomatic complexity 51 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/clause_weight_ls.py"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"9832582b1891da0da03af13651f2a5bcdba89f0a0de5eaa7a29b671d4ffb87f8"}},{"ruleId":"D1","level":"warning","message":{"text":"solvers.tabu_search (cyclomatic 26): solvers.tabu_search has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/solvers.py"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"3eeeb0f466d5966f6ff1e6d43e312f7a5ad1552b66bb885091cad6df5c06de97"}},{"ruleId":"D1","level":"warning","message":{"text":"core_guided.wpm1_solve (cyclomatic 22): core_guided.wpm1_solve has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/core_guided.py"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"79009cbe1fbf7d01aee552d0003853ab02e37b9bd48513263f2e9e15b282f381"}},{"ruleId":"D1","level":"warning","message":{"text":"core_guided.core_guided_budget (cyclomatic 17): core_guided.core_guided_budget has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/core_guided.py"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc04671c670be6c56283d1f7d058613dc4477b01325313e152d95eedd59c3b0d"}},{"ruleId":"D2","level":"warning","message":{"text":"clause_weight_ls.clause_weight_local_search (cognitive 144): clause_weight_ls.clause_weight_local_search has cognitive complexity 144 (threshold 15). Drivers by points: if/else 26 (89 pts), loops 13 (42 pts), boolean chains 13 (nesting depth added 92). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/clause_weight_ls.py"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"2975f6f2352de01961d3766ef52554b7ee0d12254fe3286a48b4387ac4ab2bf5"}},{"ruleId":"D2","level":"warning","message":{"text":"clause_weight_ls._do_flip (cognitive 144): clause_weight_ls._do_flip has cognitive complexity 144 (threshold 15). Drivers by points: if/else 20 (68 pts), loops 16 (48 pts), boolean chains 28 (nesting depth added 80). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/clause_weight_ls.py"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"54cd0eed43e9c9bf270a1d09663069b6144d45b6d62996ca99b59598db3ae501"}},{"ruleId":"D2","level":"warning","message":{"text":"solvers._update_neighbor_scores (cognitive 122): solvers._update_neighbor_scores has cognitive complexity 122 (threshold 15). Drivers by points: if/else 14 (54 pts), loops 12 (40 pts), boolean chains 28 (nesting depth added 68). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/solvers.py"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"3955d82f681e6fd5216cbae49b2c0a60c8c4d3e0160ab82d8be0d30669c4893a"}},{"ruleId":"D2","level":"warning","message":{"text":"solvers.tabu_search (cognitive 71): solvers.tabu_search has cognitive complexity 71 (threshold 15). Drivers by points: if/else 14 (47 pts), loops 7 (20 pts), boolean chains 4 (nesting depth added 46). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/solvers.py"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"148965584a9e6887d9c47579e75d5f8f78b755365ccc57f0b212bcafc736d4ca"}},{"ruleId":"D2","level":"warning","message":{"text":"core_guided.wpm1_solve (cognitive 61): core_guided.wpm1_solve has cognitive complexity 61 (threshold 15). Drivers by points: if/else 15 (40 pts), loops 8 (21 pts) (nesting depth added 38). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/core_guided.py"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cb3f8e41fc00674b199df8d12bd6dda74f3fd2d211a22e54fe1aa7cbf62f335"}},{"ruleId":"D2","level":"warning","message":{"text":"core_guided.core_guided_budget (cognitive 36): core_guided.core_guided_budget has cognitive complexity 36 (threshold 15). Drivers by points: if/else 12 (30 pts), loops 4 (6 pts) (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/core_guided.py"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e2a44b3afb26f026d6bbe05757c4c997d080d233701a8477c5188ffde9cda87"}},{"ruleId":"D2","level":"warning","message":{"text":"wcnf_parser.parse_wcnf (cognitive 34): wcnf_parser.parse_wcnf has cognitive complexity 34 (threshold 15). Drivers by points: if/else 10 (24 pts), loops 3 (7 pts), error handling 1 (2 pts), boolean chains 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/wcnf_parser.py"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"83ed9196bbaf3616b09d544ee023bd288605da26340a43c9b8d73196c8b042e8"}},{"ruleId":"D2","level":"warning","message":{"text":"solvers.randomized_greedy (cognitive 33): solvers.randomized_greedy has cognitive complexity 33 (threshold 15). Drivers by points: if/else 8 (21 pts), loops 5 (10 pts), error handling 1 (2 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/solvers.py"},"region":{"startLine":530}}}],"partialFingerprints":{"codehealthFindingId/v1":"a217b3c6654652b1ea52b38c685097f397cd9c27c1125e4dc6681746cc8ecc62"}},{"ruleId":"D2","level":"warning","message":{"text":"core_guided.core_guided_solve (cognitive 28): core_guided.core_guided_solve has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (20 pts), loops 4 (6 pts), error handling 1 (2 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/core_guided.py"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9db9ca67f2621439d4a8244a557b6397eb37c38e49ce76a9ea74b103f8b2da6"}},{"ruleId":"D2","level":"warning","message":{"text":"solvers.walksat_soft (cognitive 25): solvers.walksat_soft has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (19 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/solvers.py"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"09f021b3187905b4aaa25c71a1e87449dae5130e90856f5cf2c0c2883760add3"}},{"ruleId":"D2","level":"warning","message":{"text":"solvers.greedy_sat (cognitive 23): solvers.greedy_sat has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (19 pts), loops 4 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/solvers.py"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"83bdf018f60280e9b375e6c3d7e99fc0b2358254d74b4ece192fcf4ae01d4a9f"}},{"ruleId":"D2","level":"warning","message":{"text":"solvers.compute_flip_delta (cognitive 22): solvers.compute_flip_delta has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 4 (8 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/solvers.py"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"130d92441f777fe9d1b8dd6c8cfcb968fc5c176243145b0f0f9487ac21b9ea04"}},{"ruleId":"D2","level":"warning","message":{"text":"solvers.multi_init (cognitive 22): solvers.multi_init has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 3 (5 pts), error handling 1 (2 pts), ternaries 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/solvers.py"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"62b7248288c826862f7e947c39767f38950436e6fac9019d38be8f0df97a586c"}},{"ruleId":"D2","level":"warning","message":{"text":"solvers.walksat_hard (cognitive 21): solvers.walksat_hard has cognitive complexity 21 (threshold 15). Drivers by points: loops 5 (13 pts), if/else 5 (8 pts) (nesting depth added 11). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/solvers.py"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"f12339c3089b5a403811b8207a63dbcd0c83bb3e04a8891a23dd384f3d279561"}},{"ruleId":"D2","level":"warning","message":{"text":"solvers.compute_sat_counts (cognitive 18): solvers.compute_sat_counts has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 6, if/else 2 (6 pts), loops 4 (6 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/solvers.py"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"1aebdd4ad03cfbc8ab8fe9b045e5f1f8201d3c0c70c127b943b7b7590700dd27"}},{"ruleId":"D2","level":"warning","message":{"text":"solvers.flip_variable (cognitive 18): solvers.flip_variable has cognitive complexity 18 (threshold 15). Drivers by points: loops 8 (16 pts), if/else 2 (nesting depth added 8). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/solvers.py"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe923853fa9bd7ecf71917b0c7c5ee3cb2131eaaf91b4a914ddf6a05af4881e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (55 shared lines): library/clause_weight_ls.py:170-246 | library/solvers.py:231-299 \u2014 These two members are variants of one another: 55 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/clause_weight_ls.py"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"2af5462f89b1341ad7af50afdbf484debb75a9bb864940df5f3643f4feca5b81"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): library/core_guided.py:21-64 | library/core_guided.py:69-131 | library/core_guided.py:135-234 | library/solvers.py:532-605 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/core_guided.py"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3f0b671cc4010989b77db3b7e2c66f0eb98319b48f312d107523aaf843e74aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201326 lines \u00D7 2): library/core_guided.py:21-37 | library/core_guided.py:69-94 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/core_guided.py"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"e01105eebe173bb8aaf2c7b1466ba0bb18dcd215a17a8628877a1442aedbbab2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u201318 lines \u00D7 8): library/clause_weight_ls.py:175-192 | library/clause_weight_ls.py:195-198 | library/clause_weight_ls.py:210-213 | library/clause_weight_ls.py:215-228 | library/solvers.py:246-250 | library/solvers.py:252-267 | library/solvers.py:277-280 | library/solvers.py:282-295 \u2014 there are 8 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 8 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/clause_weight_ls.py:195\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/clause_weight_ls.py"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"962b4eedd65bbc80046a852d53dd2bf90357035ab07f2c18922a0f92ed09ebc6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): library/core_guided.py:49-61 | library/core_guided.py:177-189 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/core_guided.py"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d1556ac4fe51c4db2ba371d7f88a68b2b49b69990c775d1ff96f86df8053efd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): library/solvers.py:494-505 | library/solvers.py:560-572 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/solvers.py"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"351bc9056c06057efcf464b03d7e22924b81a1138a3cffa11de298da765f4085"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): library/clause_weight_ls.py:58-68 | library/clause_weight_ls.py:235-245 | library/solvers.py:118-128 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/clause_weight_ls.py"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"83e844683da89d48baacb018dbb180e1e2c0af0317034c5431c874ce023b7f66"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): library/clause_weight_ls.py:123-133 | library/clause_weight_ls.py:154-163 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/clause_weight_ls.py"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e9d05cdac905a84628b0182d250719ce879c24d737e8942dde57efd14c93e5a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): library/core_guided.py:47-56 | library/core_guided.py:107-116 | library/core_guided.py:175-184 | library/solvers.py:592-601 \u2014 there are 4 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 4 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/core_guided.py"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4c493c2e677c43b844e323d489e47a67dfc70272c934ee8625810ec91d9a78f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): library/clause_weight_ls.py:170-179 | library/solvers.py:231-243 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/clause_weight_ls.py"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd6fff8def0fb9cbe3d597ababa87de21f7a10054a04f918b9eb9c8db08af0f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): library/clause_weight_ls.py:102-110 | library/clause_weight_ls.py:113-120 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/clause_weight_ls.py"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"a59abeb734f68ae6efd018a2efebff10255854cc6137d8ad1fb13c6d12d48408"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): library/solvers.py:181-189 | library/solvers.py:570-578 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/solvers.py"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bc9bd9ce46be46fbca247236a0299ce8e6c0a13cbc49e099f48203a17d57b6d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): library/clause_weight_ls.py:46-57 | library/solvers.py:356-363 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/clause_weight_ls.py"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"586c78d7f4bcb377a5af603ca11a35a15c88ca65228c19004e9d5d3805bc9854"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): library/clause_weight_ls.py:200-207 | library/solvers.py:267-274 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/clause_weight_ls.py"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"80dcadbe55e2f0420c717020f5e37d18854c31b4e2ee3406de6a5c6e4a4a369a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 8): library/clause_weight_ls.py:174-180 | library/clause_weight_ls.py:188-193 | library/clause_weight_ls.py:203-208 | library/clause_weight_ls.py:216-221 | library/solvers.py:238-244 | library/solvers.py:253-259 | library/solvers.py:270-275 | library/solvers.py:283-288 \u2014 there are 8 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 8 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/clause_weight_ls.py"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfc2b383b9e4c4a8671e9b140848a5ca46b5c165b39d10e6927ff549c68b1ca6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 2): library/solvers.py:82-88 | library/solvers.py:345-350 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/solvers.py"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"b38737309e54aed0b4f1d249346439207fe886618be4858311aa43322e45d806"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): library/solvers.py:106-111 | library/solvers.py:419-424 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/solvers.py"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"244e56ffd26bcc9c0408f46f926a11f2851cd997bf65ab295023d1e0b4bb57fc"}},{"ruleId":"D8","level":"error","message":{"text":"No automated tests: No automated tests \u2014 no test code was found in this repository. Untested code is the largest single risk to changing it safely. Start with the code you change most often: add a suite in a framework a runner can collect (pytest or unittest), and run it in CI so the gap cannot reopen."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"3132564c6310e5d01a231f252a02d5d2f5a542c0a8fa29a14c89693f1e3df871"}},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ffe2cda18a76646b9a45d1f0eeb8690dc9b9e98ab68e98202bd240f018d5bcc4"},"taxa":[{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"M2","level":"note","message":{"text":"No ADRs: No Architecture Decision Records found \u2014 no conventional ADR directory, no numbered \u0060NNNN-title\u0060 documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"670b3d6e36a756d63097d0dfbf90afd5fc761308800b9354894a07c3f4e4aa14"}},{"ruleId":"P1","level":"warning","message":{"text":"No CI pipeline: No CI workflow found (.github/workflows, azure-pipelines.yml, .gitlab-ci.yml, \u2026) \u2014 changes aren\u0027t gated by an automated build/test."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"44f01af96e50474fba2df84d95ddf4f7e1d34c29c307830b9efc9057daa6b670"}},{"ruleId":"P3","level":"note","message":{"text":"No SAST: No static application security testing detected. For this repository\u0027s stack, add bandit, \u0060semgrep --config=p/python\u0060, or CodeQL\u0027s python pack \u2014 this repository has no CI pipeline yet, so run it locally to clear the existing findings, then make it a step of the first workflow you add so a regression fails the build. What was searched, so you can tell an absence from a miss: the 0 CI workflow file(s) in this repository, and the scanner and linter configuration checked in beside them. A scan that runs outside CI, one configured in your forge\u0027s web UI rather than in a committed file, or a tool whose name is none of those this check carries, is not seen \u2014 if that is your case the row is wrong, and saying so is more useful than adding a second scanner."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6e54424179c892f03ef2fd003130ac4bd43f39bbf3b1ca0a0143e25acb80ec87"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/solvers.py"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"753beecd91f94c52effd5eb9d4815e54b27d6d557d6c2fcf70d3e8d4e5c5e23a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/solvers.py"},"region":{"startLine":602}}}],"partialFingerprints":{"codehealthFindingId/v1":"a579666f79757be12618d1d8bddc6460dba93b3640cb280645b7ac202c4d936e"}}],"taxonomies":[{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d","organization":"MITRE","informationUri":"https://cwe.mitre.org/","isComprehensive":false,"shortDescription":{"text":"The MITRE Common Weakness Enumeration (CWE)."},"taxa":[{"id":"CWE-259","guid":"ae9ad959-fbb6-9d5e-892d-3dca66da0b69","name":"Use of Hard-coded Password","shortDescription":{"text":"Use of Hard-coded Password"},"helpUri":"https://cwe.mitre.org/data/definitions/259.html"},{"id":"CWE-494","guid":"b8a65e0d-e459-4a55-a931-fc1136482375","name":"Download of Code Without Integrity Check","shortDescription":{"text":"Download of Code Without Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/494.html"},{"id":"CWE-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)","shortDescription":{"text":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/79.html"},{"id":"CWE-798","guid":"5e8f057d-fee3-995a-a0cb-9fc5b0d174d1","name":"Use of Hard-coded Credentials","shortDescription":{"text":"Use of Hard-coded Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/798.html"},{"id":"CWE-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/89.html"},{"id":"CWE-94","guid":"75e7f50c-6c2f-dd52-bf40-bf6c52b861fd","name":"Improper Control of Generation of Code (\u0027Code Injection\u0027)","shortDescription":{"text":"Improper Control of Generation of Code (\u0027Code Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]},{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61","version":"2025","organization":"OWASP Foundation","informationUri":"https://top10.owasp.org/2025/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10:2025 web application security risks."},"taxa":[{"id":"A05:2025","guid":"87e86033-3231-8458-8e4a-5cb82743553a","name":"Injection","shortDescription":{"text":"Injection"},"helpUri":"https://top10.owasp.org/2025/A05_2025-Injection/"},{"id":"A07:2025","guid":"334ddd78-539d-d35c-83dd-253647eb7eaf","name":"Authentication Failures","shortDescription":{"text":"Authentication Failures"},"helpUri":"https://top10.owasp.org/2025/A07_2025-Authentication_Failures/"},{"id":"A08:2025","guid":"84b0c297-710e-9a5f-9335-936ecb260c36","name":"Software or Data Integrity Failures","shortDescription":{"text":"Software or Data Integrity Failures"},"helpUri":"https://top10.owasp.org/2025/A08_2025-Software_or_Data_Integrity_Failures/"}]}],"properties":{"codehealthPublication":{"public":true,"notice":"This is the PUBLIC form of this artifact. Findings are listed in full, but the details of SECURITY findings \u2014 which rule fired, in which file, on which line, and how to fix it \u2014 are deliberately withheld, and any secret-scanner results are excluded entirely. Where detail is absent here it was REMOVED FOR PUBLICATION; it is not missing from the analysis. The complete artifact is available from the repository owner.","securityFindingsRedacted":1,"secretScannerRunsExcluded":0}},"redactionTokens":["A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."]}]}