Public report of UQ-PAC/BASIL, published 17 November 2026. It has the same score, grades and number of
findings as the full report. The details of security findings (where they are in the code, which known
vulnerabilities and which passwords or keys were found) are left out, so nobody can use them against the project.
Public
Executive reportMeasured under the Code Assurance Index, an open standard for code quality, using its published scoring rules (rubric version 2026.11.4). Assert signed this survey and filed it in the standard's public register, where anyone can look it up by its survey ID. Check this survey →
Signed and filed in the standard's public register, 17 November 2026, 15:30 UTC · Survey ID cd_4e670c14235f4bd0860e0581056bbdeb
UQ-PAC/BASIL
Measured 17 November 2026, 15:24 UTC, at code version 3beae99
Supply-chain provenance & signing is not measured: Supply-chain provenance is not scored (this pipeline releases no artifact), but its build steps or GitHub Actions workflows have integrity defects, or nothing watches its dependency set for published advisories.
CAI scoreAdequate
CriticalWeakAdequateStrongExemplary
The score is built from these lenses. Each lens grades one area of the code, such as how easy it is to change or how well it is protected. The weakest lens counts most, so one weak area pulls the score down instead of being averaged away.
A medium codebase: 41,978 lines of product code in 1 project, tests not counted · Estimated rebuild effort: about 0.4 person-years · Weakest lens: Production Readiness, 45.8
Findings by how serious they are
38 critical471 serious101 minor
15 dimensions are left out of the score. For each one, we either couldn't measure it in this code, or found no evidence of the safeguard we look for, such as a tested backup restore. They count neither for nor against the score, and Limitations lists each one with its reason.
This survey was produced by
Canine Code Analyzer
Producer
Canine Development
Analyzer
Canine Code Analyzer engine 1.0.0
Measured
17 November 2026, 15:24 UTC
A measurement, not a certificate. The Code Assurance Index records a number
together with the evidence it was worked out from, so anyone can recalculate it, but it doesn't certify or guarantee
the code. The standard was written by Canine Development, which also builds the Canine Code Analyzer. It is open to any tool that
implements it, and today the Canine Code Analyzer is the only one that does.
The score is deterministic, which means the same code always gets the same score. We work it out with tools that follow published rules, and an AI model never decides it, so anyone who applies the same rules to the same code gets the same number. How it is done is explained under Methodology ▸
43of 43 dimensions measured by tools.
603of 610 findings point to an exact file and line, so you can open each one in the code. The other 7 concern the repository as a whole, such as missing documentation.
43dimensions across 6 lenses, read from 41,978 lines of product code in 1 project.
UQ-PAC/BASIL falls short of our standard for a preview release because we found no automated security scanning of the code, its secrets or its dependencies. It scores 55.9 out of 100 and is rated Adequate, and all 38 of its critical findings are security problems in the build pipeline and in its servers and containers.
Production Readiness, at 45.8, is the weakest lens and counts most in the score. The best first step is adding automated security scanning, worth about 7.1 points. Declaring which values may be missing comes next, worth about 4.5 points. Raising Production Readiness to 62 would lift the score to about 61.4.
Thirty-two pipeline tools are referenced by a changeable name, so the build pipeline can be tampered with. Six settings leave the servers or containers unsafe. Pinning each tool to an exact version and correcting the unsafe settings would close both risks.
The product code is 41,978 lines, about €53,000 to rebuild.
A lens is capped at Adequate while one of its dimensions scores below 4 out of 10, however well the rest of the lens does. That way a serious problem in one place always shows in the lens's rating.
How the score is built: what each lens counts forThe lenses don't count equally. The weakest lens counts most, the next weakest a little less, and so on, so a weak area pulls the score down instead of being averaged away. In the bar below, each part's width shows how much that lens counts and its colour shows its rating. Improving the widest part moves the score most, and as that lens improves, it counts for less, because another lens becomes the weakest.
If Production Readiness rose from 45.8 to 62, the lowest score rated Strong, the score would rise from 55.9 to about 61.4.
Code composition: what the lines of code are
Product code 80%Tests 20%
Rebuild cost: about €53,000 · Estimate
Cost to rebuild
€18,000 to €88,000, for 292 to 928 hours of work, about 0.4 person-years for one engineer
Difficulty of the problem
Standard, judged from the kind of software and how it is built. Code that solves a harder problem, such as payments or medical bookings, costs more per line to write.
Quality factor
×0.8 at a score of 56. Better code takes more work to write, so the factor is ×1.0 at a score of 70, lower below it and higher above it.
Size
Medium: 41,978 lines of product code
What it is not
Not a quotation: nobody has offered to build it for that. Not a valuation: it says nothing about what the business is worth. Not a certified figure: no professional has signed it as one.
How the estimate is made: We price the hours a team would need to write this code again, at €60 to €95 an hour. Declarations and boilerplate are priced at a fast rate and logic at a slower one, and the logic is then multiplied by the difficulty of the problem and by the quality factor. The estimate can be about 30% off either way, and it moves most with the hourly rate and the difficulty. For this code, every line is priced as straight logic, which keeps the estimate on the low side.
Top priorities
The three actions that raise the score most for the work they take. The full ranked list is in the Roadmap.
1
Add a SAST step to CI running what this repository's stack ships: scalafix or scapegoat — or `semgrep --config=auto`, which runs on any language — so a security regression fails the build instead of landing.
On Scala 3, add `-Yexplicit-nulls` to `scalacOptions` so `String` and `String | Null` mean different things, and type each Java API's result as nullable where it can return null; on Scala 2 (or as a first step), enable WartRemover's `Null` wart (`wartremoverErrors += Wart.Null`) or Scalafix's `DisableSyntax.noNulls = true` so the code holds absence in `Option`.
Then pay the assertions down rather than adding to them: each `.nn` is a null the compiler could not rule out — wrap the Java value in `Option(…)` at the boundary, pattern-match on `null` once there, or change the API so the null cannot arrive; an `unsafeNulls` import switches the checking off for everything after it.
Resolve the 1 No ADRs found finding(s) in ADR Quality — start with build.mill.
Raises the score by about 2.1 points · Low effort · ADR Quality
Diagnosis: what the measurements show together
Each conclusion below combines several dimensions into one point that no single dimension shows, and lists the measurements it rests on.
Where the investment is most exposed · Value at risk
This code would cost about €53,000 to build again, about 0.4 person-years of work. Its weakest lens is Production Readiness, at 45.8 (Weak). Production Readiness is about whether the product is ready to run in production and to change without breaking. Because the weakest lens counts most in the score, work on Production Readiness also moves the score most.
Based on: the rebuild estimate · the Production Readiness grade · how much each lens counts
What to do: Start with the Production Readiness actions in Top priorities.
If you do one thing first · First action
Add a SAST step to CI running what this repository's stack ships: scalafix or scapegoat — or `semgrep --config=auto`, which runs on any language — so a security regression fails the build instead of landing. Of all the actions in this report, it raises the score most for the work it takes: about 7.1 points for medium effort. The next survey will show the change in the score.
Based on: the ranked actions in Top priorities, by score gain and effort
What hard-to-read code costs each year · Cost
Four dimensions measure how easy the code is to work in: two measure how tangled its logic is, one how much of it is copied, and one how well each part sticks to a single job. In this codebase they average 7.1 out of 10. Code at that level is slower to change than clean code, and we estimate the extra work at 2% to 5% on every change.
How this is estimated: It rests on an assumption of our own: code scoring 8 out of 10 or more adds no extra work, and each point below 8 adds 2.5% to 5.6% to every change, never less than 2% to 5% and never more than 40% to 60% in all. The result is a range for planning, not a measurement.
Based on: Cyclomatic Complexity · Cognitive Complexity · Code Duplication · Cohesion (LCOM4)
What to do: Start with the files listed under Churn × Complexity Hotspots, which change often and are hard to read, because that is where the extra work is paid most often.
Architecture: which parts of the code depend on which
The code is divided into modules, groups of code that each handle one part of the product, and a module depends on another when it uses code from it. The table lists the modules both down the side and across the top, in an order where each module should only use modules listed above it. A number in a cell means the module on that row uses the module in that column, and it counts the pairs of building blocks (types) that connect them. The one thing to look for is a mark above the diagonal line. It means two or more modules use each other in a loop (a dependency cycle), so none of them can be changed, tested or released on its own.
73 modules, with 119 dependencies between them. One loop runs through 13 of the modules, marked above the diagonal.
The table shows the 40 modules with the most connections; 33 more are left out to keep it readable.
Which modules use which. The module on each row uses the module in each column, and the number counts the pairs of types that connect them. A cell above the diagonal is part of a loop.
gtirb.GTIRBResolver.GTIRBRef uses gtirb.GTIRBResolver, so a change to gtirb.GTIRBResolver can break gtirb.GTIRBResolver.GTIRBRef, while a change to gtirb.GTIRBResolver.GTIRBRef can't break gtirb.GTIRBResolver.
Position
Below the diagonal: gtirb.GTIRBResolver.GTIRBRef uses a module listed above it, which is the healthy direction.
util uses analysis.data_structure_analysis, so a change to analysis.data_structure_analysis can break util, while a change to util can't break analysis.data_structure_analysis.
Position
Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
33 pairs of types, where a type in translating uses a type in boogie. Showing 25 of them; the rest are in namespace-graph.json in this report's bundle.
analysis.ProcFrames uses ir.cilvisitor, so a change to ir.cilvisitor can break analysis.ProcFrames, while a change to analysis.ProcFrames can't break ir.cilvisitor.
Position
Below the diagonal: analysis.ProcFrames uses a module listed above it, which is the healthy direction.
analysis.solvers uses analysis.data_structure_analysis, so a change to analysis.data_structure_analysis can break analysis.solvers, while a change to analysis.solvers can't break analysis.data_structure_analysis.
Position
Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
15→33 analysis.solvers uses analysispart of a loop✕
Connections
18 pairs of types, where a type in analysis.solvers uses a type in analysis.
ir.transforms.CalleePreservedParam uses ir, so a change to ir can break ir.transforms.CalleePreservedParam, while a change to ir.transforms.CalleePreservedParam can't break ir.
Position
Below the diagonal: ir.transforms.CalleePreservedParam uses a module listed above it, which is the healthy direction.
ir.transforms.CopyProp uses ir.cilvisitor, so a change to ir.cilvisitor can break ir.transforms.CopyProp, while a change to ir.transforms.CopyProp can't break ir.cilvisitor.
Position
Below the diagonal: ir.transforms.CopyProp uses a module listed above it, which is the healthy direction.
ir.transforms.SpecFixer uses ir.cilvisitor, so a change to ir.cilvisitor can break ir.transforms.SpecFixer, while a change to ir.transforms.SpecFixer can't break ir.cilvisitor.
Position
Below the diagonal: ir.transforms.SpecFixer uses a module listed above it, which is the healthy direction.
ir.transforms.getProcFrame uses ir.cilvisitor, so a change to ir.cilvisitor can break ir.transforms.getProcFrame, while a change to ir.transforms.getProcFrame can't break ir.cilvisitor.
Position
Below the diagonal: ir.transforms.getProcFrame uses a module listed above it, which is the healthy direction.
ir.transforms.getProcFrame uses ir, so a change to ir can break ir.transforms.getProcFrame, while a change to ir.transforms.getProcFrame can't break ir.
Position
Below the diagonal: ir.transforms.getProcFrame uses a module listed above it, which is the healthy direction.
ir.transforms.validate.TranslationValidator.toVariable uses ir.cilvisitor, so a change to ir.cilvisitor can break ir.transforms.validate.TranslationValidator.toVariable, while a change to ir.transforms.validate.TranslationValidator.toVariable can't break ir.cilvisitor.
Position
Below the diagonal: ir.transforms.validate.TranslationValidator.toVariable uses a module listed above it, which is the healthy direction.
ir.transforms.validate.TranslationValidator.toVariable uses ir, so a change to ir can break ir.transforms.validate.TranslationValidator.toVariable, while a change to ir.transforms.validate.TranslationValidator.toVariable can't break ir.
Position
Below the diagonal: ir.transforms.validate.TranslationValidator.toVariable uses a module listed above it, which is the healthy direction.
translating.BasilIRPrettyPrinter uses ir.cilvisitor, so a change to ir.cilvisitor can break translating.BasilIRPrettyPrinter, while a change to translating.BasilIRPrettyPrinter can't break ir.cilvisitor.
Position
Below the diagonal: translating.BasilIRPrettyPrinter uses a module listed above it, which is the healthy direction.
translating.BasilIRPrettyPrinter uses ir, so a change to ir can break translating.BasilIRPrettyPrinter, while a change to translating.BasilIRPrettyPrinter can't break ir.
Position
Below the diagonal: translating.BasilIRPrettyPrinter uses a module listed above it, which is the healthy direction.
ir.dsl.ToScalaDeriving uses ir.dsl, so a change to ir.dsl can break ir.dsl.ToScalaDeriving, while a change to ir.dsl.ToScalaDeriving can't break ir.dsl.
Position
Below the diagonal: ir.dsl.ToScalaDeriving uses a module listed above it, which is the healthy direction.
1 pair of types, where a type in ir.transforms uses a type in analysis.solvers.
The types involved
ir.transforms.LVTerm → analysis.solvers.Var
Direction
ir.transforms uses analysis.solvers, so a change to analysis.solvers can break ir.transforms, while a change to ir.transforms can't break analysis.solvers.
Position
Below the diagonal: ir.transforms uses a module listed above it, which is the healthy direction.
28→29 ir.transforms uses analysis.data_structure_analysispart of a loop✕
Connections
2 pairs of types, where a type in ir.transforms uses a type in analysis.data_structure_analysis.
ir.transforms uses analysis.data_structure_analysis, so a change to analysis.data_structure_analysis can break ir.transforms, while a change to ir.transforms can't break analysis.data_structure_analysis.
Position
Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
analysis.data_structure_analysis uses util, so a change to util can break analysis.data_structure_analysis, while a change to analysis.data_structure_analysis can't break util.
Position
Below the diagonal: analysis.data_structure_analysis uses a module listed above it, which is the healthy direction.
analysis.data_structure_analysis uses specification, so a change to specification can break analysis.data_structure_analysis, while a change to analysis.data_structure_analysis can't break specification.
Position
Below the diagonal: analysis.data_structure_analysis uses a module listed above it, which is the healthy direction.
59 pairs of types, where a type in analysis.data_structure_analysis uses a type in ir. Showing 25 of them; the rest are in namespace-graph.json in this report's bundle.
analysis.data_structure_analysis uses ir, so a change to ir can break analysis.data_structure_analysis, while a change to analysis.data_structure_analysis can't break ir.
Position
Below the diagonal: analysis.data_structure_analysis uses a module listed above it, which is the healthy direction.
analysis.data_structure_analysis uses analysis.solvers, so a change to analysis.solvers can break analysis.data_structure_analysis, while a change to analysis.data_structure_analysis can't break analysis.solvers.
Position
Below the diagonal: analysis.data_structure_analysis uses a module listed above it, which is the healthy direction.
analysis.data_structure_analysis uses ir.transforms, so a change to ir.transforms can break analysis.data_structure_analysis, while a change to analysis.data_structure_analysis can't break ir.transforms.
Position
Below the diagonal: analysis.data_structure_analysis uses a module listed above it, which is the healthy direction.
29→33 analysis.data_structure_analysis uses analysispart of a loop✕
Connections
7 pairs of types, where a type in analysis.data_structure_analysis uses a type in analysis.
analysis.data_structure_analysis uses analysis, so a change to analysis can break analysis.data_structure_analysis, while a change to analysis.data_structure_analysis can't break analysis.
Position
Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
ir.parsing.BasilEarlyBNFCVisitor uses ir, so a change to ir can break ir.parsing.BasilEarlyBNFCVisitor, while a change to ir.parsing.BasilEarlyBNFCVisitor can't break ir.
Position
Below the diagonal: ir.parsing.BasilEarlyBNFCVisitor uses a module listed above it, which is the healthy direction.
ir.parsing.BasilEarlyBNFCVisitor uses ir.parsing, so a change to ir.parsing can break ir.parsing.BasilEarlyBNFCVisitor, while a change to ir.parsing.BasilEarlyBNFCVisitor can't break ir.parsing.
Position
Below the diagonal: ir.parsing.BasilEarlyBNFCVisitor uses a module listed above it, which is the healthy direction.
ir.transforms.DefinedOnAllPaths uses ir, so a change to ir can break ir.transforms.DefinedOnAllPaths, while a change to ir.transforms.DefinedOnAllPaths can't break ir.
Position
Below the diagonal: ir.transforms.DefinedOnAllPaths uses a module listed above it, which is the healthy direction.
ir.transforms.DefinedOnAllPaths uses ir.transforms, so a change to ir.transforms can break ir.transforms.DefinedOnAllPaths, while a change to ir.transforms.DefinedOnAllPaths can't break ir.transforms.
Position
Below the diagonal: ir.transforms.DefinedOnAllPaths uses a module listed above it, which is the healthy direction.
analysis uses analysis.data_structure_analysis, so a change to analysis.data_structure_analysis can break analysis, while a change to analysis can't break analysis.data_structure_analysis.
Position
Below the diagonal: analysis uses a module listed above it, which is the healthy direction.
analysis.EdgeFunctionLattice uses analysis, so a change to analysis can break analysis.EdgeFunctionLattice, while a change to analysis.EdgeFunctionLattice can't break analysis.
Position
Below the diagonal: analysis.EdgeFunctionLattice uses a module listed above it, which is the healthy direction.
analysis.ValueSetLattice uses analysis, so a change to analysis can break analysis.ValueSetLattice, while a change to analysis.ValueSetLattice can't break analysis.
Position
Below the diagonal: analysis.ValueSetLattice uses a module listed above it, which is the healthy direction.
2 pairs of types, where a type in analysis.solvers.IDESolver uses a type in ir.
The types involved
analysis.solvers.IDESolver.Phase1 → ir.Procedure
analysis.solvers.IDESolver.Phase2 → ir.Procedure
Direction
analysis.solvers.IDESolver uses ir, so a change to ir can break analysis.solvers.IDESolver, while a change to analysis.solvers.IDESolver can't break ir.
Position
Below the diagonal: analysis.solvers.IDESolver uses a module listed above it, which is the healthy direction.
analysis.solvers.IDESolver uses analysis.solvers, so a change to analysis.solvers can break analysis.solvers.IDESolver, while a change to analysis.solvers.IDESolver can't break analysis.solvers.
Position
Below the diagonal: analysis.solvers.IDESolver uses a module listed above it, which is the healthy direction.
analysis.solvers.IDESolver uses analysis, so a change to analysis can break analysis.solvers.IDESolver, while a change to analysis.solvers.IDESolver can't break analysis.
Position
Below the diagonal: analysis.solvers.IDESolver uses a module listed above it, which is the healthy direction.
ir.transforms.validate uses analysis.IrreducibleLoops, so a change to analysis.IrreducibleLoops can break ir.transforms.validate, while a change to ir.transforms.validate can't break analysis.IrreducibleLoops.
Position
Below the diagonal: ir.transforms.validate uses a module listed above it, which is the healthy direction.
ir.transforms.validate uses ir.cilvisitor, so a change to ir.cilvisitor can break ir.transforms.validate, while a change to ir.transforms.validate can't break ir.cilvisitor.
Position
Below the diagonal: ir.transforms.validate uses a module listed above it, which is the healthy direction.
ir.transforms.validate uses analysis.ProcFrames, so a change to analysis.ProcFrames can break ir.transforms.validate, while a change to ir.transforms.validate can't break analysis.ProcFrames.
Position
Below the diagonal: ir.transforms.validate uses a module listed above it, which is the healthy direction.
ir.transforms.validate uses util.SMT, so a change to util.SMT can break ir.transforms.validate, while a change to ir.transforms.validate can't break util.SMT.
Position
Below the diagonal: ir.transforms.validate uses a module listed above it, which is the healthy direction.
1 pair of types, where a type in ir.transforms.validate.Ackermann uses a type in ir.
The types involved
ir.transforms.validate.Ackermann.AckInv → ir.Expr
Direction
ir.transforms.validate.Ackermann uses ir, so a change to ir can break ir.transforms.validate.Ackermann, while a change to ir.transforms.validate.Ackermann can't break ir.
Position
Below the diagonal: ir.transforms.validate.Ackermann uses a module listed above it, which is the healthy direction.
ir.transforms.validate.Ackermann uses ir.transforms.validate, so a change to ir.transforms.validate can break ir.transforms.validate.Ackermann, while a change to ir.transforms.validate.Ackermann can't break ir.transforms.validate.
Position
Below the diagonal: ir.transforms.validate.Ackermann uses a module listed above it, which is the healthy direction.
ir.transforms.validate.TranslationValidator uses ir, so a change to ir can break ir.transforms.validate.TranslationValidator, while a change to ir.transforms.validate.TranslationValidator can't break ir.
Position
Below the diagonal: ir.transforms.validate.TranslationValidator uses a module listed above it, which is the healthy direction.
ir.transforms.validate.TranslationValidator uses analysis.ProcFrames, so a change to analysis.ProcFrames can break ir.transforms.validate.TranslationValidator, while a change to ir.transforms.validate.TranslationValidator can't break analysis.ProcFrames.
Position
Below the diagonal: ir.transforms.validate.TranslationValidator uses a module listed above it, which is the healthy direction.
ir.transforms.validate.TranslationValidator uses ir.transforms, so a change to ir.transforms can break ir.transforms.validate.TranslationValidator, while a change to ir.transforms.validate.TranslationValidator can't break ir.transforms.
Position
Below the diagonal: ir.transforms.validate.TranslationValidator uses a module listed above it, which is the healthy direction.
ir.transforms.validate.TranslationValidator uses ir.transforms.validate, so a change to ir.transforms.validate can break ir.transforms.validate.TranslationValidator, while a change to ir.transforms.validate.TranslationValidator can't break ir.transforms.validate.
Position
Below the diagonal: ir.transforms.validate.TranslationValidator uses a module listed above it, which is the healthy direction.
At a glance — Code Health · 52.3 · Adequate · gated by X5 ·
Findings mapped to OWASP categories; the specific CVEs/secrets are in the Security dimension cards below and findings.md (redacted only on the public version of this report).
OWASP category
Findings
Severity
A05:2025 — Injection
36
High / Critical
A02:2025 — Security Misconfiguration
28
High / Critical
Roadmap
Top priorities: Add a SAST step to CI running what this repository's stack ships: scalafix or scapegoat — or `semgrep --config=auto`, which runs on any language — so a security regression fails the build instead of landing; On Scala 3, add `-Yexplicit-nulls` to `scalacOptions` so `String` and `String | Null` mean different things, and type each Java API's result as nullable where it can return null; on Scala 2 (or as a first step), enable WartRemover's `Null` wart (`wartremoverErrors += Wart.Null`) or Scalafix's `DisableSyntax.noNulls = true` so the code holds absence in `Option`. Then pay the assertions down rather than adding to them: each `.nn` is a null the compiler could not rule out — wrap the Java value in `Option(…)` at the boundary, pattern-match on `null` once there, or change the API so the null cannot arrive; an `unsafeNulls` import switches the checking off for everything after it; Add a `healthcheck:` to the served compose service — probing the endpoint it already answers on where it has one — with `depends_on: condition: service_healthy` on whatever waits for it, and keep the deployed image tag immutable and recorded so rolling back is re-pointing at the previous tag rather than rebuilding.
Ranked by impact ÷ effort. "Helps" is the estimated gain on the 0–100 health score.
Do this
Helps
Effort
Dimension
Add a SAST step to CI running what this repository's stack ships: scalafix or scapegoat — or `semgrep --config=auto`, which runs on any language — so a security regression fails the build instead of landing.
On Scala 3, add `-Yexplicit-nulls` to `scalacOptions` so `String` and `String | Null` mean different things, and type each Java API's result as nullable where it can return null; on Scala 2 (or as a first step), enable WartRemover's `Null` wart (`wartremoverErrors += Wart.Null`) or Scalafix's `DisableSyntax.noNulls = true` so the code holds absence in `Option`. Then pay the assertions down rather than adding to them: each `.nn` is a null the compiler could not rule out — wrap the Java value in `Option(…)` at the boundary, pattern-match on `null` once there, or change the API so the null cannot arrive; an `unsafeNulls` import switches the checking off for everything after it.
Resolve the 1 `visitBv` spells `Bv` where 20 names in the project spell it `BV` finding(s) in Naming Consistency — start with SpecificationLoader.scala.
Add a `healthcheck:` to the served compose service — probing the endpoint it already answers on where it has one — with `depends_on: condition: service_healthy` on whatever waits for it, and keep the deployed image tag immutable and recorded so rolling back is re-pointing at the previous tag rather than rebuilding.
Add a health-check endpoint (Spring Boot Actuator's /actuator/health, or a /health route) so orchestrators and load balancers can probe liveness/readiness.
Secure the server's transport: serve TLS itself (akka/pekko-http `ConnectionContext.httpsServer(sslContext)` with `newServerAt(…).enableHttps(…)`, an http4s server builder's `withTLS(…)`, Play's `https.port`), or run it behind a TLS-terminating proxy and trust it (`X-Forwarded-Proto`; Play `play.http.forwarded.trustedProxies`); send `Strict-Transport-Security` once it is HTTPS-only (http4s `HSTS(…)`, Play `RedirectHttpsFilter`).
Every finding carries one of four grades. Three say how serious it is. The fourth says this
survey could not settle it — and it is a grade, not a gap.
Critical — 38
A definite problem that already costs you something and drags the score down: a
missing authorisation check, a dependency with a known exploit, a build that does not reproduce. Failure here
tends to cause failures elsewhere.
Serious — 471
Likely wrong, but not failing yet. It degrades
the codebase over a longer horizon and can cause failures elsewhere — not urgent this week, not something to
carry for two years either.
Minor — 101
Recorded, with no effect on how the codebase functions.
Present so the survey is complete, not because it needs doing.
Could not be resolved — 15
Something this survey could not settle
from the outside, and which could be critical or serious. Either a control was required and no
positive evidence of it exists in the repository — a backup job that nothing shows was ever restored from proves
nothing about restores — or our own analysis could not run over that part of the tree. This is not a clean
result. These are excluded from the score rather than awarded a pass, so the number on the cover neither
rewards nor penalises them: if you act on this survey without resolving them, you carry that risk yourself. Each
one is named under Limitations.
Methodology & how to trust this report
This survey is a deep, periodic assessment — run each sprint, monthly, or quarterly, taking the time to go wider and deeper than a quick check and surfacing in one coherent report what you'd otherwise piece together from a dozen separate tools. It scores deterministically: the same commit yields the same score, every run. All 43 evaluated dimensions are computed by tools and static analysis; no language model sets or judges any of them. Overall confidence is 0.8, the weighted average across measured dimensions.
Every figure here is one of two kinds, and we label which: ✓ Measured — a deterministic fact (LoC, complexity, coverage); ~ Modeled — an estimate from a stated model (cost, effort, value-at-risk), always a range with its assumptions, never a precise fact. We never present a modelled estimate as if it were measured. Perfect or absent scores carry their provenance too (ADR-0011): ✓ Tool-verified means the property itself was measured across the surface; ○ Nothing flagged means the probes came back clean — a claim bounded by what a repository can show; ⊘ Not evidenced means a working control (a tested restore, an automated rollback) showed no positive evidence — absence of evidence is not evidence of a control, so it's excluded from the score rather than awarded a spurious 10.
What we checked — 43 dimensions across the health lenses
Each chip is a dimension scored from real signals across architecture, testing, dependencies, security & compliance, documentation, git-history and code quality — in one coherent pass. A surface report typically covers a handful.
How to trust any code-health report — three questions
Can you open the finding? Real findings cite a repo-relative file and line you can open at the cited line — never an absolute scratch path. Here, 603 of 610 do; the remainder are repo-wide signals — a dimension-level measurement, not a single line. (Every path in this report is repo-relative by construction: paths are normalized at the producer and the report is rejected if any rooted path leaks through.)
Is there a tool behind the number? Every score below names the method that produced it: Roslyn, git or a scanner, not a narrative.
Does re-running give the same result? Run it again on the same commit and the score — and this report, byte for byte — is identical. A report whose numbers move between runs is describing the run, not the code.
This report answers yes to all three. That's the bar to hold any assessment to.
Tools & methods
The actual versions used this run (captured at analysis time) — re-run on the same commit for the identical score.
Method
Backs
Version
Evaluator
Roslyn static analysis
Complexity, cohesion, coupling, dead code, API surface, layering
What ran differently this time — a tool absent, degraded, or that fell back to an estimate. Named openly, not folded silently into the scores. A degraded run also records its exact cause in diagnostics.md.
D8 Code Coverage — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Coverage NOT MEASURED: test source is present (.scala, .java) but the built-in coverage collector has no runner for this repository's ecosystem — so this suite was never executed by it. Not scored — this is a gap in the analyzer's language coverage, not a defect in the repo.
D11 Test Reliability — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Test source is present (.scala, .java) but the built-in reliability runner does not support this repository's ecosystem, so flakiness couldn't be assessed. Not scored — this is a gap in the analyzer's language coverage, not a finding about this repository.
D12 Dependency Hygiene — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. No dependency manifest this pass reads for hygiene (a Python pyproject.toml/requirements.txt (pip/uv/Poetry), a Swift Package.swift/Package.resolved, a Cargo manifest, a Go module (go.mod/go.sum), a Gradle version catalogue, a Maven POM, an sbt build (build.sbt), composer.json, package.json, a Dart pubspec.yaml, an Elixir mix.exs/mix.lock (Hex), a rebar.config / erlang.mk DEPS (Hex), a Ruby Gemfile/Gemfile.lock or .gemspec (Bundler/RubyGems)) was found in this repository, so no package was assessed. Zero packages read is NOT a clean dependency tree, so this is NOT SCORED — a gap in the analyzer, not a verdict about this repository. This row is about dependency HYGIENE — outdated, deprecated or unmaintained direct dependencies; known CVEs in the same dependency graph are a separate question, reported under D30 wherever the manifest is OSV-readable.
D14 License Compliance — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Not scored — no dependency manifest this pass reads for licence data (a Python pyproject.toml/requirements.txt (pip/uv/Poetry), a Swift Package.swift/Package.resolved, a Cargo manifest, a Go module (go.mod/go.sum), a Gradle version catalogue, a Maven POM, an sbt build (build.sbt), composer.json, package.json, a Dart pubspec.yaml, an Elixir mix.exs/mix.lock (Hex), a rebar.config / erlang.mk DEPS (Hex), a Ruby Gemfile/Gemfile.lock or .gemspec (Bundler/RubyGems)) was found in this repository, so it declares no third-party dependency closure to grade. A gap in the analyzer, NOT a finding that this repository's licences are compliant: a manifest in an ecosystem outside that list, or third-party code copied into the tree, is not read — so this dimension asserts nothing about this repository's licensing in either direction.
D21 Naming Consistency — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. PREREGISTRATION version 20's fallback (adjudication D21-sample3-v3): this rule kind was adjudicated below the 95 % precision gate, so its candidates are counted here and not published, and the score covers only the acronym-spelling and awaitable-suffix rules. The kind returns as rows only after it shows a measured precision; this says nothing about whether these names are consistent.
D21 Naming Consistency — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. PREREGISTRATION version 20's fallback (adjudication D21-sample3-v3): this rule kind was adjudicated below the 95 % precision gate, so its candidates are counted here and not published, and the score covers only the acronym-spelling and awaitable-suffix rules. The kind returns as rows only after it shows a measured precision; this says nothing about whether these names are consistent.
D22 Internal API Consistency — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. D22 identifies the intentionally-exposed surface from `IsPackable` and `.Contracts` project names, MSBuild conventions read off the loaded project set. This target exposed no such projects, so the probe never ran; this says nothing about whether the repository has a public API. This repository commits no C#/VB source at all, so there was never an MSBuild project set to read these conventions off. That is OUR side and it is a COLLECTOR gap, not an environment fault: no published-package marker D22 reads admitted any project here, so this ecosystem's public API has no collector, and the remedy is to write one — no change to the scan image can close it.
D24 Comment Value — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check's reader does not cover the language this repository's product is written in, so it had nothing of the product to read. That is a gap in this analyzer's language reach — not a finding about this repository.
D26 Project Cohesion — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. `(repository root)` (41978 LoC, 1095 module-visible types across 30 directories) is over its size bounds, and whether one unit is a coherent whole or a grab-bag is read from its type references: the parts of it that reach the rest only through its shared core. Those are read over the C#/VB code model, which this unit's source did not supply. Its size alone is no verdict on its cohesion, so none is published.
D27 Navigability — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Navigability is taken over call sites whose callee resolved. For C# that population includes calls into referenced assemblies; for this language only calls declared inside the repository count, so the abstention threshold reads the repository's use of its standard library as a resolution failure. That is a limit of this analyzer, not a build problem in this repository.
D32 Data Compliance (PII/GDPR) — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. `src/main/scala/analysis/ANR.scala`, `src/main/scala/analysis/GammaDomains.scala`, `src/main/scala/analysis/GlobalRegionAnalysis.scala`, `src/main/scala/analysis/InterLiveVarsAnalysis.scala`, `src/main/scala/analysis/MemoryModelMap.scala`, … (+54 more) produced a parse error, so every rule in this engine's `gdpr.yml` was absent there. That absence is NOT a clean result: these rules detect personal data crossing a boundary into a log sink, a URL or browser storage, and a file that was never parsed cannot report any of the three. The rest of the tree analysed normally and its rows above stand; only these files are unaccounted for. You can widen what we reach: fix the syntax error (or exclude the file deliberately) and re-scan to cover it.
D44 Platform End-of-Life — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This dimension reads a project's own statement about the platform it runs on: a TargetFramework in a .NET project file, a .nvmrc or .python-version, a capped requires-python, a Rust toolchain file or Cargo.toml rust-version, a .go-version, .java-version, .ruby-version, .tool-versions or .sdkmanrc, a go.mod go directive, a Maven or Gradle Java level or toolchain, a Gemfile's ruby directive, a mix.exs elixir requirement, a rebar.config minimum_otp_vsn, a pubspec.yaml SDK constraint, a build.sbt scalaVersion, or a framework major pinned by a dependency constraint. This repository carries none of them, so nothing about its platform was established. That is a gap in this analyzer's coverage, NOT a finding that the platform is supported — a language whose runtime is declared elsewhere (Package.swift, a Dockerfile) is simply not read here yet.
AX2 Stateful singletons — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads Microsoft.Extensions.DependencyInjection singletons in C#, Spring/JSR-330/CDI singletons in Java and Kotlin, module state in Python request handlers, handler state in Go and Swift, Play controllers, Cask routes, Scalatra servlets, Finatra controllers, Akka/Pekko HTTP routes and JSR-330 singletons in Scala, Rails, Sinatra, Grape, Roda and Hanami handlers and Rack apps in Ruby, and module state in F# request handlers (Giraffe, Saturn, Falco, Oxpecker and Suave handlers and ASP.NET Core controllers) only, and this repository's product is written in Scala (http4s), which was left unread, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
AXB2 Runtime readiness — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. An image the Dockerfile builds FROM could not be fetched: our sandbox reaches registries only through its pull-through mirror, and the mirror did not serve it. This is a limit of our sandbox, not of your repository. (rule: registry). The renderer reported: compose up failed (exit 17 — an image could not be built) — a8db9b61eba3 Extracting [=================> ] 293.6MB/859.5MB a8db9b61eba3 Extracting [==================================================>] 859.5MB/859.5MB failed to solve: dockerfile parse error on line 132: invalid name for build stage: "basil:dev", name can't start with a number or contain symbols; likely cause (our sandbox): an image the Dockerfile builds FROM could not be fetched: our sandbox reaches registries only through its pull-through mirror, and the mirror did not serve it. This is a limit of our sandbox, not of your repository; runtime evidence skipped.
AXR1 Runtime accessibility — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Render strategy: boot via DockerCompose (REDACTED). compose up failed (exit 17 — an image could not be built) — a8db9b61eba3 Extracting [=================> ] 293.6MB/859.5MB a8db9b61eba3 Extracting [==================================================>] 859.5MB/859.5MB failed to solve: dockerfile parse error on line 132: invalid name for build stage: "basil:dev", name can't start with a number or contain symbols; likely cause (our sandbox): an image the Dockerfile builds FROM could not be fetched: our sandbox reaches registries only through its pull-through mirror, and the mirror did not serve it. This is a limit of our sandbox, not of your repository; runtime evidence skipped.
C1 Data Protection — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. These personal data controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach — not a finding that the repository lacks personal data controls.
C2 Access Controls — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. These authorization controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach — not a finding that the repository lacks authorization controls.
M4 Documentation accuracy — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. M4 checks only the claim kinds adjudicated at or above 95 % precision: links and versions (PREREGISTRATION version 9), and artefact counts an order of magnitude off. Paths, command arguments, installs, environment variables, settings, projects, packages, routes, cd targets, infrastructure products and removed modules are read but not checked, and none of them is reported or counted.
P5 DR & Backup — not measured this run — This is a true statement about the repository that carries nothing for its owner to act on, so it is reported here rather than as a defect in their code. No backup/snapshot/replication config, RTO/RPO or restore-procedure documentation was found — and no production persistence was detected either (no data-access packages, no data-store services, no database resources), so there is nothing in this repository whose loss a DR control would recover. If this system's data lives in a platform or ops repo we can't see, that's where the DR evidence belongs.
Repo exclusion declarations: 4 pattern(s) declared (.gitattributes linguist-generated/vendored, .editorconfig generated_code) excluded 0 source file(s) from code-quality scoring. Declarations are the repo's own visible statement that a tree is machine-written or vendored — auditable in any diff, honored by GitHub the same way.
Limitations & what we did not check
We assess the repository exactly as committed, and only the repository. By design we do not reach outside the source tree: the live cloud account, the running CI/CD pipeline, the host's branch-protection and approval rules, the production configuration, or a restore actually exercised against a backup are all out of scope. That boundary is a feature, not a gap — a repo-relative, deterministic scan re-runs identically on any commit and every finding opens at a real file and line, where a live audit can neither be reproduced nor traced. The visible consequence is that controls which leave no in-repo evidence are reported as "not evidenced" and excluded from the score rather than awarded a number a static scan cannot justify.
Per-dimension blind spots
For each dimension that was measured, what a static, repo-only scan structurally cannot see — the honest edge of the measurement, not a failure of it.
D1 Cyclomatic Complexity: Cyclomatic complexity counts branches statically — it cannot tell an essential decision tree from accidental tangle, nor see complexity that lives in data or configuration (large switch-case token tables, DSL lexers/parsers, data-as-code rule tables) rather than control flow: a tokenizer's many single-character cases read as high complexity though each branch is trivial.
D2 Cognitive Complexity: Cognitive-complexity heuristics approximate how hard code is to follow; genuine domain difficulty and well-named intent that eases reading are not captured.
D3 God Classes: "God class" is sized by members and responsibilities visible in the type — a deliberately broad facade over a coherent subsystem can read the same as an accidental grab-bag. For front-end JS the file-length check is cohesion-aware (a single-responsibility module — one class/IIFE — earns a 3× threshold), but cohesion is approximated from top-level declarations, not true dependency structure.
D4 Code Duplication: Duplication is token-similarity — an in-process token-stream comparison over sliding windows, with type-aware normalization — so it finds copy-paste, not semantic duplication expressed differently. Committed machine-written code (scaffolded migrations, designer/codegen output, protobuf/OpenAPI stubs, model snapshots) is EXCLUDED — its repetition is the tool's, not the team's — so the score reflects hand-written duplication only.
D6 Cohesion (LCOM4): LCOM4 cohesion is syntactic — it infers connectivity from which methods touch which fields/methods by name, not from real runtime behaviour or intent.
D13 Secret Scanning: Secret detection is signature- and entropy-based on the current tree — a secret that does not match a known pattern, or one already rotated, will not be flagged (a clean scan is "nothing matched", not "no secrets exist").
D15 Churn × Complexity Hotspots: Churn hotspots come from git history — a freshly imported or squashed repository has no churn signal, and recent rewrites can mask a historically risky file.
D16 Bus Factor: Bus-factor is a time-decayed model of commit attribution (who has recently, repeatedly worked a file), not comprehension — pairing, review and reading-without-committing spread knowledge it can't see; bot commits and shared accounts still distort it.
D17 Explicit Debt: Acknowledged-debt signals (TODO/FIXME, suppressions, dead code) are textual — undocumented debt that nobody marked, and debt that lives in design rather than annotations, is invisible. Committed machine-written code (scaffolded migrations, designer/codegen output, generated stubs) is excluded — it is never the team's dead code to delete.
D20 ADR Quality: ADR quality checks the structure of the decision records present: it cannot know about decisions made and never recorded, and it does not judge how well a record argues its case. Records in a language the section lexicon does not cover are not evaluated.
D21 Naming Consistency: Naming consistency compares each name with the convention its structural peers follow in this repository: it cannot tell whether a consistently used name is a good one, and languages other than C# and TypeScript are not measured.
D28 Secrets (history): Secret-history scanning sweeps the git log for known patterns — a secret that predates the available history, or never matched a signature, is not found (clean means "nothing matched in the history we can see").
D29 Static Analysis (SAST): SAST findings are pattern-based (semgrep) — it finds classes of bug it has rules for; logic flaws, auth/authorization gaps and issues needing runtime context are out of reach (and clean means "no rule matched").
D31 IaC & Container Security: IaC scanning checks Dockerfiles/Terraform/Kubernetes against best-practice rules — it cannot see the live cloud account, runtime configuration, or drift between the committed config and what is actually deployed.
D34 Knowledge Freshness: Freshness is decayed commit RECENCY, not comprehension — code read often but rarely committed reads as orphaned, and stable code that genuinely needs no changes is penalised the same as forgotten code; bot/squash commits distort it like the bus factor.
D35 Change Coupling: Change coupling is co-change in COMMITS — files split across separate commits, or coupled only through a shared config/build step, read as uncoupled, and a sweeping commit (rename/format) is excluded so it doesn't couple everything. It shows that files change together, not WHY: a high coupling can be a healthy cohesive pair as readily as a hidden leak.
AX10 Code composition: Role is inferred from namespace/folder convention, not semantics — a domain concept living in a folder named "Services" reads as application, and the split is lines-of-code, not business value. The business-logic-share score is a SOFT, FLOORED signal: it contributes to the Architecture lens but is floored at the Critical gate, so an infrastructure-heavy design (a gateway, an ETL, a driver) is legitimately low without being nuked to zero.
M4 Documentation accuracy: Documentation accuracy checks links, versions and artefact counts against the tree: other claims (paths, commands, settings, routes) are read but not checked, and it cannot run the onboarding or measure how long a real new joiner takes.
P4 Deployment & Rollback: Approval/branch-protection rules live in repository settings the scan cannot see — only their in-repo evidence (config files, workflows) is checked, so a control enforced purely in the host's settings reads as "not evidenced".
P6 Release Hygiene: Rollback/observability controls are inferred from repo artefacts (pipelines, dashboards-as-code) — controls configured in external tooling, with no in-repo trace, cannot be credited.
What it measures: How tangled the control flow is — methods with many branches are hard to test and change.
Method: Cyclomatic complexity per method (1 + decision points), computed exhaustively across production source; test projects separated by convention. Deterministic.
41 method(s) exceeded the cyclomatic complexity threshold of 15; the worst was Predicate.simplify at 71. A further 12 method(s) were over the threshold but excluded as flat dispatchers (a long switch/match over independent cases: many branches, almost no nesting), the largest being TNumDomain.evaluateValueBinOp at 37 — they are counted neither in the figure above nor in this dimension's score. 6 files carry no cyclomatic complexity row at all for this reason — every one of their over-threshold methods was excluded, so the exclusion is disclosed nowhere in the file itself: src/main/scala/analysis/KnownBits.scala (TNumDomain.evaluateValueBinOp at 37), src/main/scala/analysis/ConstantPropagation.scala (ConstantPropagation.eval at 29), src/main/scala/bap/BAPExpr.scala (BAPBinOperator.apply at 20), src/main/scala/analysis/GammaDomains.scala (WpDualDomain.transfer at 19), src/main/scala/analysis/IntraLiveVarsAnalysis.scala (LivenessAnalysis.transfer at 19), and 1 more not listed here. They are named here because the per-file figures other dimensions report are taken BEFORE this exclusion, so such a file can show a high maximum complexity elsewhere in this report and nothing here, with nothing to reconcile the two.
+ 36 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Bring the 41 bodies over 15 down to 15 or less in Cyclomatic Complexity — start with Predicate.simplify (cyclomatic 71), Main.configOfArgs (cyclomatic 62), GTIRBLoader.visitExprTApply (cyclomatic 59). — This score is capped by its worst body, so a finding fixed alone moves it by almost nothing — the next one down takes its place. Refactoring these 41 together lifts Cyclomatic Complexity from 6.4 to about 10.0/10, projected with the scoring formula itself and assuming each lands exactly at 15.
Detailed fixes: d1_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: How hard the code is for a person to follow, beyond raw branching.
Method: Cognitive complexity per method (Sonar-style nesting-penalized score), computed exhaustively over production code, excluding test projects. Deterministic.
+ 81 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Bring the 1 body over 120 down to 120 or less in Cognitive Complexity — start with InterpFuns.initialState (cognitive 276). — Refactoring it lifts Cognitive Complexity from 4.5 to about 5.5/10.
Detailed fixes: d2_recommendation.md · top locations in Appendix A, every location in findings.md.
Do you agree with this assessment?
D3 · God Classes8.0 / 10Strong✓ Tool-verified
What it measures: Over-large classes that try to do too much ("god classes").
Method: God-class detection by line and method-count thresholds per logical type (partial classes unified), filtered for generated code and registration/contract false positives. Deterministic.
Resolve the 13 FileTooLong finding(s) in God Classes — start with Simp.scala, IntervalDSA.scala, TranslationValidate.scala. — One of this dimension's main actionable groups (13 warning-level).
Resolve the 6 TooManyMethods finding(s) in God Classes — start with InstructionBuilder.scala, BitVectorEval.scala, IntervalDSA.scala. — One of this dimension's main actionable groups (6 warning-level).
Resolve the 3 MethodTooLong finding(s) in God Classes — start with RunUtils.scala, TranslationValidate.scala, SSADAG.scala. — One of this dimension's main actionable groups (3 warning-level).
Detailed fixes: d3_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: How much of the production code is copy-pasted: the share of production lines inside a reported copy (every copy of a duplicated block or of an edited member, each line once), 10 at none and 0 at a quarter of the lines.
Method: Code duplication via token-stream sliding windows with type-aware normalization (locals masked, type names preserved), scored on the share of production lines inside a reported copy (each line once; 10 at none, 0 at a quarter). Deterministic.
42 duplicated block group(s) detected. 3.7 % of the production lines (1,572 of 41,978) are in a reported copy. A further 40 rows report members as variants of one another; the share counts each copied line once, however many rows cite it. 2 of the 82 are in trees this repository does not ship — vendored, example/demo, project-template, fixture and benchmark code — and are ranked below the shipped groups rather than excluded from them: the duplication there is real and is still counted in this dimension's score. The dimensions that publish a production-file census leave those trees out of theirs, so this count is deliberately drawn over the wider population.
+ 39 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Resolve the 11 Duplicated block (5 lines × 2) finding(s) in Code Duplication — start with Predicate.scala (3), GTIRBLoader.scala (2), InterLiveVarsAnalysis.scala. — One of this dimension's main actionable groups (11 warning-level).
Resolve the 5 Duplicated block (7 lines × 2) finding(s) in Code Duplication — start with Graph.scala, AbsInt.scala, BAPLoader.scala. — One of this dimension's main actionable groups (5 warning-level).
Resolve the 4 Edited copy of a member (8 corresponding lines) finding(s) in Code Duplication — start with Predicate.scala (2), BasilEarlyBNFCVisitor.scala, Lattice.scala. — One of this dimension's main actionable groups (4 warning-level).
Detailed fixes: d4_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether a class's methods are focused on a single responsibility.
Method: LCOM4 cohesion per production class with at least two methods: connected components of methods sharing state or calls, computed syntactically. Deterministic, not a proxy.
Coverage: Exhaustive · type-level: LCOM4 cohesion computed over every production class — the population is all types, not a name convention.
Resolve the 6 Low cohesion finding(s) in Cohesion (LCOM4) — start with Program.scala (2), PrettyPrinter.scala, BlockBNFCVisitor.scala. — One of this dimension's main actionable groups (6 warning-level).
Detailed fixes: d6_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether any secrets (keys, tokens, passwords) have leaked into the code.
Method: In-process native secret scanner (entropy plus signature patterns) across all tracked files; no external tool. A clean result is a measured 10, not no-data zero. Deterministic.
What it measures: Files that change often and are also complex — the riskiest hotspots.
Method: Per production file churn times cyclomatic complexity over a rolling window, computed from git and Roslyn/JS/Razor analysis. Exhaustive, deterministic per commit date.
What it measures: Whether knowledge is concentrated in too few people (the "bus factor").
Method: Living knowledge per author via time-decayed commit attribution (6-month half-life, focus weighting) across largest source files. Deterministic, avoids blame's mechanical-refactor false positives.
No source file's living knowledge is concentrated in a single author. Counted over 135 of the 201 production source files in this repository: the rest are under the ~2,400-byte size floor this dimension measures over.
What it measures: Acknowledged debt left in the code — TODOs, dead code, suppressed warnings.
Method: Roslyn syntactic debt markers (suppressions/TODO/FIXME/HACK/empty-catch/commented-code/Obsolete) plus SymbolFinder dead-code analysis; weighted-debt-per-KLoC density deducted 2.0x per unit. Deterministic, exhaustive.
135 deducted task-comment markers across 41978 LoC (0.3/KLoC) → score 9.4. Task comments only: this repository's language is read without a compiler, so D17's suppression, dead-code and commented-out-code arms did not run and this score counts fewer marker kinds than a .NET repository's would.
Resolve the 112 TodoComment finding(s) in Explicit Debt — start with Lattice.scala (13), GTIRBToIR.scala (10), Predicate.scala (6). — One of this dimension's main actionable groups (112 warning-level).
Resolve the 11 XxxComment finding(s) in Explicit Debt — start with PCTrackingTest.scala (2), SystemTests.scala, ToScalaTest.scala. — One of this dimension's main actionable groups (11 warning-level).
Resolve the 11 FixmeComment finding(s) in Explicit Debt — start with InstructionBuilder.scala (2), Simp.scala (2), TranslationValidate.scala (2). — One of this dimension's main actionable groups (11 warning-level).
Detailed fixes: d17_recommendation.md · top locations in Appendix A, every location in findings.md.
Do you agree with this assessment?
D20 · ADR Quality0.0 / 10Critical✓ Tool-verified
What it measures: Whether architecture decisions are recorded well (context, decision, consequences).
Method: Every ADR read by its section structure: nine located rules (a missing Decision, Context or Consequences section, a stale status, two records deciding the same question, a dangling supersede link, a number-only title, a single option, no named cost, no status where the log uses one, no enforcement field where the log adopted one), each a fixed deduction from 10; the score is the mean over evaluated records. Deterministic, no model. Advisory.
Resolve the 1 No ADRs found finding(s) in ADR Quality — start with build.mill. — One of this dimension's main actionable groups (1 recommendation-level).
Detailed fixes: d20_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether names — types, methods, variables — are clear and consistent.
Method: Seven vocabulary-free rules (N1-N7) mine each naming convention from the repository and flag a name that breaks a convention its structural peers in the same unit follow; production C# and TypeScript, each its own population. Deterministic, no model, no sample. Advisory.
1 naming inconsistencies among 21 declarations measured against a convention their peers follow.
`visitBv` spells `Bv` where 20 names in the project spell it `BV`src/main/scala/translating/SpecificationLoader.scala:292
What to do
Resolve the 1 `visitBv` spells `Bv` where 20 names in the project spell it `BV` finding(s) in Naming Consistency — start with SpecificationLoader.scala. — One of this dimension's main actionable groups (1 recommendation-level).
Detailed fixes: d21_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether any secrets were ever committed — scanned across the full git history, not just now.
Method: Secret scan via TWO gitleaks detect passes in an isolated checkout — the full git history, then a second --no-git pass over the working tree as it stands — merged and de-duplicated by (rule, file, line); each match flagged High. Both invocations are recorded in the audit trail. Exhaustive; when the tool is absent, or when its output cannot be parsed into the expected shape, the dimension is WITHHELD as an explicit measurement gap on our side — unscored and excluded from the lens, never a hedged middling score.
What it measures: Real static-analysis (SAST) findings — likely security bugs in the code, any language.
Method: Polyglot static analysis via semgrep across the repo using the pinned, image-baked p/security-audit + p/owasp-top-ten rulesets (no scan-time registry fetch); severity rules (ERROR/WARNING/INFO) map to a full-band severity-weighted score. Exhaustive, deterministic; degrades on parse failure.
Coverage: semgrep pattern rules over all files — exhaustive for the rule set, blind to classes of bug without a rule (clean = no rule matched).
36 finding(s): 0 critical, 32 high, 4 medium, 0 low. 32 unpinned-GitHub-Actions row(s) are reported here but scored by D36 (supply-chain provenance), which measures that posture as `pinned_actions` — one pinning decision is charged once, not once per lens. semgrep hit a parse error in 57 file(s) — `REDACTED` (lines 35–199), `REDACTED` (lines 6–29), `REDACTED`, `src/main/scala/analysis/ANR.scala`, `src/main/scala/analysis/GammaDomains.scala`, … (+52 more) — so no absence of findings in the named regions is evidence of anything; rows reported elsewhere in those files are real. Fix the syntax error (or exclude the file deliberately) and re-scan to cover them. Separately, one or more rules could not re-parse an embedded snippet in 2 file(s) (e.g. a workflow `run:` block read as shell). Those files WERE scanned and their other rows are unaffected; only those rules' view of those snippets is missing.
REDACTED
REDACTED
What to do
Resolve the 4 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED (4). — One of this dimension's main actionable groups (4 warning-level).
No action in Static Analysis (SAST) — all 32 REDACTED finding(s) are reported here at file:line but scored by D36 (supply-chain provenance), so none is charged to this dimension. — One of this dimension's main actionable groups (32 issue-level, 0 of them charged here).
Detailed fixes: d29_recommendation.md · top locations in Appendix A, every location in findings.md.
Resolve the 22 Medium IaC finding(s) in IaC & Container Security — start with REDACTED (10), REDACTED (6), REDACTED (5). — One of this dimension's main actionable groups (22 warning-level).
Resolve the 6 High IaC finding(s) in IaC & Container Security — start with REDACTED (4), REDACTED, REDACTED. — One of this dimension's main actionable groups (6 issue-level).
Detailed fixes: d31_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether anyone still has living knowledge of each file, or it has been orphaned — last understood long ago by someone now gone quiet. The sibling of the bus factor: D16 asks who owns it, D34 asks whether anyone still knows it.
Method: File orphaning as total living-knowledge decay below one focused-commit's worth within a year, computed per-file from the D16 decay model. Exhaustive, deterministic over fixed history.
79 of 135 significant source file(s) are orphaned — their living knowledge has decayed to nothing, so no one currently understands them. The largest is src/main/scala/ir/eval/SimplifyExpr.scala. Counted over 135 of the 201 production source files in this repository: the rest are under the ~2,400-byte size floor this dimension measures over.
Most significant orphaned file · ×3src/main/scala/ir/eval/SimplifyExpr.scala:1
Concentrated knowledge decay
What to do
Resolve the 76 Orphaned file finding(s) in Knowledge Freshness — start with SimplifyPipeline.scala (2), InterpretBasilIR.scala, Interpreter.scala. — One of this dimension's main actionable groups (76 recommendation-level).
Resolve the 3 Most significant orphaned file finding(s) in Knowledge Freshness — start with SimplifyExpr.scala, TranslationValidate.scala, Predicate.scala. — One of this dimension's main actionable groups (3 recommendation-level).
Resolve the 1 Concentrated knowledge decay finding(s) in Knowledge Freshness. — One of this dimension's main actionable groups (1 recommendation-level).
Detailed fixes: d34_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether files that change together actually belong together — pairs that repeatedly co-change in git history despite having no explicit code dependency, surfacing the hidden/logical coupling (and boundaries in the wrong place) a static scan can't see.
Method: Pairwise co-occurrence over the per-commit file sets in git history (production source only — tests and generated dropped): Degree-of-Coupling = shared ÷ min individual revisions, reported above noise floors (each file ≥10 revisions, ≥5 shared commits, ≥50% strength); sweeping commits excluded. Deterministic over fixed history.
Coverage: Population: PRODUCTION source files only — test and generated files are dropped before pairing, so a class co-changing with its own test (trivially ~100%) can't drown the real production↔production coupling. Pairs ranked by Degree-of-Coupling. A non-source file is never a coupling PARTICIPANT either: documentation, schemas, config and data files are dropped with the rest, so a code↔docs pair — a command and the reference page that restates it — is not reported however strongly the two co-change; nor is coupling that runs THROUGH a build step or config file.
Resolve the 2 Change-coupling hub finding(s) in Change Coupling — start with RunUtils.scala, MemoryRegionAnalysis.scala. — One of this dimension's main actionable groups (2 warning-level).
Resolve the 2 Change coupling finding(s) in Change Coupling — start with InterprocSteensgaardAnalysis.scala, VSA.scala. — One of this dimension's main actionable groups (2 warning-level).
Detailed fixes: d35_recommendation.md · top locations in Appendix A, every location in findings.md.
Other · Architecture — How the codebase splits by code ROLE — domain, application, infrastructure, test, generated. The significance map behind the knowledge/coupling weighting, and a DDD signal in its own right: a thin domain core under fat infrastructure is the anemic-domain smell, quantified. How each file's role is decided, because the split is only as good as that: a generated name or a build-output tree makes it Generated, a test project makes it Test, and otherwise the file's NAMESPACE and PATH words are matched against fixed vocabularies in a fixed ORDER — domain, then infrastructure, then application — so a file whose words hit two layers is counted under the earlier one. A production file matching none of them counts as application, so that share reads 'application or unclassified' rather than a measured application layer. Roles come from naming convention, never from what the code does. On this repository the split was taken from the source tree on disk rather than from a loaded .NET workspace, so a file's role is decided by its PATH segments alone — no declared namespace was available to add to the evidence — and generated output is excluded from the census entirely rather than counted as a generated share.
Method: Roslyn line-count by code ROLE: every source file classified Domain/Application/Infrastructure/Test/Generated by namespace + path convention (the shared CodeRoleClassifier), then significant lines summed per role. Deterministic; the advisory score is the business-logic (domain+application) share of production code.
Coverage: Population: ALL source files, each bucketed into ONE of five roles (Domain/Application/Infrastructure/Test/Generated) by namespace + path convention — a file whose layer isn't named in the convention falls to Application (the neutral default), and the split is line-count, not semantic depth or business value.
Other · Architecture — Whether the project-reference graph is acyclic (cycles block independent build/deploy and signal eroding boundaries).
Method: Project reference cycles via elementary-DFS over real .csproj references, using the engine shared with D5/D7; cyclic versus acyclic. Exhaustive, deterministic.
Other · Architecture — Whether dependencies point inward (Domain ← Application ← Infrastructure/Web) — the clean-architecture dependency rule, checked across the project graph.
Method: Layer violations by name-segment inference (Domain/Core to Application to Infrastructure/Web) over the project-reference graph. Exhaustive over all projects, deterministic.
Other · Architecture — Whether interfaces stay focused rather than fat — the Interface-Segregation principle (SOLID 'I').
Method: Roslyn scan: public interface declared-member counts (accessors fold into their property/event); fat-interface threshold (over 15 declared members) flagged per type. Each finding also reports the distinct-OPERATION count — members counted by name, so an overload group counts once — which decides whether it states the caller-side ISP harm or the implementer-side burden of an overload set. TypeScript: exported interfaces that declare behaviour, counted over their REQUIRED operations (method signatures and function-typed properties with no `?`, once per signature) — data-shape interfaces and ambient .d.ts declarations are outside the population; JavaScript declares no interfaces and is not applicable. Deterministic, type-level.
`BasilIR[Repr]` declares 19 abstract members: `vblock`, `vprog`, `vproc`, `vmemory`, `vassign`, `vmemassign`, `vsimulassign`, `vhavoc`, `vload`, `vstore`, `vcall`, `vindirect`, `vassert`, `vassume`, `vnop`, `vgoto`, `vunreachable`, `vreturn`, `vlvar`. Counted over its ABSTRACT members — a `def` with no body or a `val`/`var` with no initializer, once per signature; concrete members, private and protected members, and members of a companion `object` are not counted, because no implementer is forced to write them. A wide interface forces every implementer and caller to depend on methods they don't use (the Interface-Segregation 'I' in SOLID). Split it into focused role-interfaces. — src/main/scala/translating/IRExpToSMT2.scala:8
`BasilIRExp[Repr]` declares 16 abstract members: `vexpr`, `vassoc_expr`, `vextract`, `vquantifier`, `vlambda`, `vold`, `vzeroextend`, `vsignextend`, `vbinary_expr`, `vunary_expr`, `vboollit`, `vbvlit`, `vintlit`, `vrepeat`, `vfapply_expr`, `vrvar`. Counted over its ABSTRACT members — a `def` with no body or a `val`/`var` with no initializer, once per signature; concrete members, private and protected members, and members of a companion `object` are not counted, because no implementer is forced to write them. A wide interface forces every implementer and caller to depend on methods they don't use (the Interface-Segregation 'I' in SOLID). Split it into focused role-interfaces. — src/main/scala/translating/IRExpToSMT2.scala:117
What to do
Split fat interfaces into focused role-interfaces so clients depend only on what they use.
Do you agree with this assessment?
AX8 · Test isolation10.0 / 10Exemplary✓ Tool-verified
Other · Architecture — Whether production projects stay free of references to test projects — tests may depend on production, never the reverse.
Method: Csproj graph: each production project checked for references to test projects (identified by test-framework presence, not name). Zero violations is clean. Deterministic.
Other · Code Health — Unreviewed-generation residue in this repository's Scala: methods whose whole body is still `???` or a "not implemented" throw where nothing overrides them, and placeholder text (lorem ipsum, changeme/replace_me…) left in strings of non-test, non-generated code. Scored as a quality signature, never as a claim about authorship.
Method: Roslyn syntax scan: NotImplementedException throws and placeholder string literals in non-test, non-generated shipped code. Deterministic, code-shape signature.
`narrow` is a shipped member whose whole body is still `???`, and nothing in the repository overrides it — generated scaffolding that was never completed. Implement it or remove the dead surface. (×2) — src/main/scala/analysis/Domains.scala:60, src/main/scala/analysis/Domains.scala:107
`transfer` is a shipped member whose whole body is still `???`, and nothing in the repository overrides it — generated scaffolding that was never completed. Implement it or remove the dead surface. (×5) — src/main/scala/analysis/data_structure_analysis/SymbolicValueAnalysis.scala:159, src/main/scala/analysis/data_structure_analysis/SymbolicValueAnalysis.scala:191, src/main/scala/analysis/data_structure_analysis/SymbolicValueAnalysis.scala:258, …
`top` is a shipped member whose whole body is still `???`, and nothing in the repository overrides it — generated scaffolding that was never completed. Implement it or remove the dead surface. (×7) — src/main/scala/analysis/data_structure_analysis/SymbolicValueAnalysis.scala:266, src/main/scala/analysis/data_structure_analysis/SymbolicValueAnalysis.scala:523, src/main/scala/analysis/rely_guarantee_generation/RelyGuaranteeGeneration.scala:134, …
`vload` is a shipped member whose whole body is still `???`, and nothing in the repository overrides it — generated scaffolding that was never completed. Implement it or remove the dead surface. — src/main/scala/translating/IRExpToSMT2.scala:212
`vstore` is a shipped member whose whole body is still `???`, and nothing in the repository overrides it — generated scaffolding that was never completed. Implement it or remove the dead surface. — src/main/scala/translating/IRExpToSMT2.scala:213
`vhavoc` is a shipped member whose whole body is still `???`, and nothing in the repository overrides it — generated scaffolding that was never completed. Implement it or remove the dead surface. — src/main/scala/translating/IRExpToSMT2.scala:214
`vold` is a shipped member whose whole body is still `???`, and nothing in the repository overrides it — generated scaffolding that was never completed. Implement it or remove the dead surface. — src/main/scala/translating/IRExpToSMT2.scala:215
`vquantifier` is a shipped member whose whole body is still `???`, and nothing in the repository overrides it — generated scaffolding that was never completed. Implement it or remove the dead surface. (×2) — src/main/scala/translating/IRExpToSMT2.scala:216, src/main/scala/translating/PrettyPrinter.scala:601
`vlambda` is a shipped member whose whole body is still `???`, and nothing in the repository overrides it — generated scaffolding that was never completed. Implement it or remove the dead surface. (×2) — src/main/scala/translating/IRExpToSMT2.scala:217, src/main/scala/translating/PrettyPrinter.scala:600
`vprog` is a shipped member whose whole body is still `???`, and nothing in the repository overrides it — generated scaffolding that was never completed. Implement it or remove the dead surface. — src/main/scala/translating/IRExpToSMT2.scala:218
`vrepeat` is a shipped member whose whole body is still `???`, and nothing in the repository overrides it — generated scaffolding that was never completed. Implement it or remove the dead surface. — src/main/scala/translating/IRExpToSMT2.scala:219
`vzeroextend` is a shipped member whose whole body is still `???`, and nothing in the repository overrides it — generated scaffolding that was never completed. Implement it or remove the dead surface. — src/main/scala/translating/IRExpToSMT2.scala:220
`vsignextend` is a shipped member whose whole body is still `???`, and nothing in the repository overrides it — generated scaffolding that was never completed. Implement it or remove the dead surface. — src/main/scala/translating/IRExpToSMT2.scala:221
`vboollit` is a shipped member whose whole body is still `???`, and nothing in the repository overrides it — generated scaffolding that was never completed. Implement it or remove the dead surface. — src/main/scala/translating/IRExpToSMT2.scala:222
`vbvlit` is a shipped member whose whole body is still `???`, and nothing in the repository overrides it — generated scaffolding that was never completed. Implement it or remove the dead surface. — src/main/scala/translating/IRExpToSMT2.scala:223
`vintlit` is a shipped member whose whole body is still `???`, and nothing in the repository overrides it — generated scaffolding that was never completed. Implement it or remove the dead surface. — src/main/scala/translating/IRExpToSMT2.scala:224
`vblock` is a shipped member whose whole body is still `???`, and nothing in the repository overrides it — generated scaffolding that was never completed. Implement it or remove the dead surface. — src/main/scala/translating/PrettyPrinter.scala:314
`vproc` is a shipped member whose whole body is still `???`, and nothing in the repository overrides it — generated scaffolding that was never completed. Implement it or remove the dead surface. — src/main/scala/translating/PrettyPrinter.scala:466
What to do
Finish or delete the members whose body is still `???` or a "not implemented" throw where nothing overrides them, and replace placeholder text before shipping.
Other · Code Health — Unfinished work detected by code SHAPE, not keywords, in this repository's Scala: methods whose body is `???` or only throws a "not implemented" error, methods that take inputs and return a constant or do nothing, dead `if (false)` branches, and skeleton classes most of whose methods are holes.
Method: Roslyn syntax scan: incompleteness by code shape (constant-returning methods, async-never-await, #if false branches, guards that return what the code already falls through to, tests an earlier guard already decided, comparisons against NaN, skeleton types), not keyword-gated. Deterministic, code-shape heuristic.
`narrow` is a shipped method whose whole body is `???` (or throws NotImplementedError), and nothing in the repository overrides it — scaffolding that was never completed. Implement it or remove the dead surface. (×2) — src/main/scala/analysis/Domains.scala:60, src/main/scala/analysis/Domains.scala:107
`transfer` is a shipped method whose whole body is `???` (or throws NotImplementedError), and nothing in the repository overrides it — scaffolding that was never completed. Implement it or remove the dead surface. (×5) — src/main/scala/analysis/data_structure_analysis/SymbolicValueAnalysis.scala:159, src/main/scala/analysis/data_structure_analysis/SymbolicValueAnalysis.scala:191, src/main/scala/analysis/data_structure_analysis/SymbolicValueAnalysis.scala:258, …
`top` is a shipped method whose whole body is `???` (or throws NotImplementedError), and nothing in the repository overrides it — scaffolding that was never completed. Implement it or remove the dead surface. (×7) — src/main/scala/analysis/data_structure_analysis/SymbolicValueAnalysis.scala:266, src/main/scala/analysis/data_structure_analysis/SymbolicValueAnalysis.scala:523, src/main/scala/analysis/rely_guarantee_generation/RelyGuaranteeGeneration.scala:134, …
`vload` is a shipped method whose whole body is `???` (or throws NotImplementedError), and nothing in the repository overrides it — scaffolding that was never completed. Implement it or remove the dead surface. — src/main/scala/translating/IRExpToSMT2.scala:212
`vstore` is a shipped method whose whole body is `???` (or throws NotImplementedError), and nothing in the repository overrides it — scaffolding that was never completed. Implement it or remove the dead surface. — src/main/scala/translating/IRExpToSMT2.scala:213
`vhavoc` is a shipped method whose whole body is `???` (or throws NotImplementedError), and nothing in the repository overrides it — scaffolding that was never completed. Implement it or remove the dead surface. — src/main/scala/translating/IRExpToSMT2.scala:214
`vold` is a shipped method whose whole body is `???` (or throws NotImplementedError), and nothing in the repository overrides it — scaffolding that was never completed. Implement it or remove the dead surface. — src/main/scala/translating/IRExpToSMT2.scala:215
`vquantifier` is a shipped method whose whole body is `???` (or throws NotImplementedError), and nothing in the repository overrides it — scaffolding that was never completed. Implement it or remove the dead surface. (×2) — src/main/scala/translating/IRExpToSMT2.scala:216, src/main/scala/translating/PrettyPrinter.scala:601
`vlambda` is a shipped method whose whole body is `???` (or throws NotImplementedError), and nothing in the repository overrides it — scaffolding that was never completed. Implement it or remove the dead surface. (×2) — src/main/scala/translating/IRExpToSMT2.scala:217, src/main/scala/translating/PrettyPrinter.scala:600
`vprog` is a shipped method whose whole body is `???` (or throws NotImplementedError), and nothing in the repository overrides it — scaffolding that was never completed. Implement it or remove the dead surface. — src/main/scala/translating/IRExpToSMT2.scala:218
`vrepeat` is a shipped method whose whole body is `???` (or throws NotImplementedError), and nothing in the repository overrides it — scaffolding that was never completed. Implement it or remove the dead surface. — src/main/scala/translating/IRExpToSMT2.scala:219
`vzeroextend` is a shipped method whose whole body is `???` (or throws NotImplementedError), and nothing in the repository overrides it — scaffolding that was never completed. Implement it or remove the dead surface. — src/main/scala/translating/IRExpToSMT2.scala:220
`vsignextend` is a shipped method whose whole body is `???` (or throws NotImplementedError), and nothing in the repository overrides it — scaffolding that was never completed. Implement it or remove the dead surface. — src/main/scala/translating/IRExpToSMT2.scala:221
`vboollit` is a shipped method whose whole body is `???` (or throws NotImplementedError), and nothing in the repository overrides it — scaffolding that was never completed. Implement it or remove the dead surface. — src/main/scala/translating/IRExpToSMT2.scala:222
`vbvlit` is a shipped method whose whole body is `???` (or throws NotImplementedError), and nothing in the repository overrides it — scaffolding that was never completed. Implement it or remove the dead surface. — src/main/scala/translating/IRExpToSMT2.scala:223
`vintlit` is a shipped method whose whole body is `???` (or throws NotImplementedError), and nothing in the repository overrides it — scaffolding that was never completed. Implement it or remove the dead surface. — src/main/scala/translating/IRExpToSMT2.scala:224
`vblock` is a shipped method whose whole body is `???` (or throws NotImplementedError), and nothing in the repository overrides it — scaffolding that was never completed. Implement it or remove the dead surface. — src/main/scala/translating/PrettyPrinter.scala:314
`vproc` is a shipped method whose whole body is `???` (or throws NotImplementedError), and nothing in the repository overrides it — scaffolding that was never completed. Implement it or remove the dead surface. — src/main/scala/translating/PrettyPrinter.scala:466
A test is skipped/ignored — coverage that looks present but never runs. Re-enable it or delete it so the green run means something. (×7) — src/test/scala/DataStructureAnalysisTest.scala:565, src/test/scala/DataStructureAnalysisTest.scala:610, src/test/scala/DataStructureAnalysisTest.scala:650, …
What to do
Finish or delete the unfinished stubs (functions that throw "not implemented", or whose body is empty or a bare constant) — they are dead surface that looks live.
Clear the softer debt: re-enable or delete `ignore`d and `pending` tests, decide whether each empty method or UnsupportedOperationException is deliberate (and say so in a comment), and replace a bare `// scalastyle:off` or `@nowarn` with targeted, justified suppressions.
Maturity · Maturity — Whether the repository and its projects have a README, and whether it is substantive.
Method: Filesystem scan: README presence, word count, and headings for depth; git history for staleness. Exhaustive across root and project dirs, deterministic.
Maturity · Maturity — Whether key decisions (ADRs) and the high-level shape (C4/diagrams) are written down.
Method: Filesystem scan: ADR folder/naming conventions or content, plus Mermaid/PlantUML/C4/architecture.md discovery. Exhaustive, deterministic.
No Architecture Decision Records found — no conventional ADR directory, no numbered `NNNN-title` 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.
What to do
Record your significant design decisions. Write one short document per decision, giving its date, the situation, the decision and its consequences, and keep them together with your other design documents. A docs/adr folder with each file named by number and title is the easiest place to find them.
Maturity · Maturity — Whether the repository is organised deliberately: production code and tests are set apart in a way its ecosystem or the repository itself declares.
Method: Filesystem scan: src/test folder separation and namespace-prefix consistency (majority RootNamespace agreement). Exhaustive across projects, deterministic.
Maturity · Maturity — Whether the project's current-state documentation describes the code that exists.
Method: Every current-state document's checkable claims looked up in the tree (links, versions, and artefact counts an order of magnitude off), plus two README checks: an advertised infrastructure product with no footprint, and a module the CHANGELOG records as removed. Deterministic, no model. Advisory.
docker/readme.md links to `godbolt.org`, but `docker/godbolt.org` does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong. — docker/readme.md:50
What to do
Reconcile the README with reality: docker/readme.md links to `godbolt.org`, but `docker/godbolt.org` does not exist.
Add a health-check endpoint (Spring Boot Actuator's /actuator/health, or a /health route) so orchestrators and load balancers can probe liveness/readiness.
Readiness · Readiness — Whether SAST, secret/dependency scanning and performance benchmarking are wired in (presence, not runtime).
Method: Filesystem scan: SAST configuration, dependency-update automation, secret scanning, and a benchmark harness or benchmark step — in this repository's own ecosystem. Exhaustive, deterministic.
No static application security testing detected. For this repository's stack, add scalafix or scapegoat (or `semgrep --config=auto`, which runs on any language) as a CI step. What was searched, so you can tell an absence from a miss: the 3 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's web UI rather than in a committed file, or a tool whose name is none of those this check carries, is not seen — if that is your case the row is wrong, and saying so is more useful than adding a second scanner. — REDACTED:7
What to do
Add a SAST step to CI running what this repository's stack ships: scalafix or scapegoat — or `semgrep --config=auto`, which runs on any language — so a security regression fails the build instead of landing.
Add gitleaks/trufflehog in CI to block PRs that introduce committed secrets.
Readiness · Readiness — Whether releases are automated and safely reversible (probes, rolling updates, approval gates) — from manifests/pipeline files, not the live environment.
Method: Filesystem scan: deployment manifests/IaC (K8s YAML, Helm, Terraform) for rolling updates, probes, approval gates, migration hooks. Exhaustive, deterministic.
Deployment is orchestrated by compose, but no service declares a `healthcheck:` and nothing pins a previous image to fall back to — the runtime can tell that the container is up, not that it is serving, so a bad release is harder to detect and reverse.
What to do
Add a `healthcheck:` to the served compose service — probing the endpoint it already answers on where it has one — with `depends_on: condition: service_healthy` on whatever waits for it, and keep the deployed image tag immutable and recorded so rolling back is re-pointing at the previous tag rather than rebuilding.
Readiness · Readiness — Whether releases are traceable — a maintained changelog and explicit version stamping.
Method: Filesystem scan: changelog file presence and version tags in csproj or git tags. Exhaustive, deterministic.
No CHANGELOG/HISTORY/RELEASES file — what shipped when isn't easy to reconstruct for support or audit. (Versioning/tagging makes releases traceable, but a changelog records the what.)
What to do
Keep a changelog (e.g. Keep-a-Changelog) recording what shipped in each release.
Readiness · Performance — Whether asynchronous code stays responsive — it avoids sync-over-async blocking (a .NET .Wait()/.GetAwaiter().GetResult(), a time.sleep or blocking HTTP call inside a Python coroutine, a *Sync call inside an async JavaScript function, block_on inside a Rust async fn, runBlocking inside a Kotlin suspend function, block() inside a Reactor publisher) that stalls a thread or event loop and risks deadlock, and, where the code is a reusable library on .NET, awaits with ConfigureAwait(false) so it never captures and stalls its caller's context.
Method: Production-source scan: sync-over-async blocking counted everywhere — .Wait()/.GetAwaiter().GetResult() in .NET; off .NET, read from each language's code model, a blocking call inside an async function (Python, TS/JS, Rust, Kotlin, Swift, Dart) or inside a Java method returning a Reactor Mono/Flux or a Scala method returning a Future or effect — and, for a .NET library with ≥5 awaits, the share of awaits using ConfigureAwait(false). Deterministic, syntax/text detection.
Other · Security — Read from this repository's Scala source and the Java beside it: cryptographic hygiene (weak hash or cipher, key material fixed in the source) and outbound TLS (certificate validation, protocol version) — facts about code that hold whether or not it serves anything itself. This repository serves HTTP itself (src/main/scala/server/ApiServer.scala:8 — `EmberServerBuilder`), so its Scala source was also read for the server controls: TLS served or HSTS set, security response headers, cookie flags and inbound validation — each credited where its Scala spelling appears in production source, not proven on every route. A Play application is credited the security headers Play's default `SecurityHeadersFilter` sends unless its build or configuration switches that filter off, and its cookies the HttpOnly flag Play sets by default.
Method: Roslyn plus filesystem scan: HSTS/security headers, secure cookies, input validation, middleware order, weak crypto (MD5/SHA1/DES); HTTPS-metadata context-aware. On a repository with no .NET source it reads JavaScript/TypeScript, Dart, Ruby, Scala, Rust or Elixir source itself (test, vendored, generated and minified paths not) for the arms that hold whether or not the code serves HTTP: a weak hash or cipher, key material fixed in the source, a TLS client that accepts any certificate, and (JavaScript/TypeScript, Ruby, Scala, Rust and Elixir) an obsolete TLS version; the server controls are not assessed there, and a Dart, Ruby, Scala, Rust or Elixir repository that serves no HTTP of its own is N/A on them. Deterministic.
This repository runs an HTTP server and nothing in its Scala source or committed configuration secures the transport: no HTTPS served (akka/pekko-http `ConnectionContext.httpsServer`/`enableHttps`, an http4s builder's `withTLS`, Jetty's `SslContextFactory`, zio-http's `SSLConfig`, Play's `https.port`), no `Strict-Transport-Security` header, HSTS middleware or Play `RedirectHttpsFilter`, no `X-Forwarded-Proto` read or Play `play.http.forwarded.trustedProxies` for a TLS-terminating proxy — so its traffic may cross the network in clear text. (−2.0 on this card.) The server: src/main/scala/server/ApiServer.scala:8 — `EmberServerBuilder`.
None of the 11 security response headers the OWASP Secure Headers Project recommends (Content-Security-Policy, Strict-Transport-Security, X-Content-Type-Options, X-Frame-Options, …) is set on a response this repository's Scala server sends — defense in depth, even when a proxy could set them. (−2.0 on this card.) The server: src/main/scala/server/ApiServer.scala:8 — `EmberServerBuilder`.
What to do
Secure the server's transport: serve TLS itself (akka/pekko-http `ConnectionContext.httpsServer(sslContext)` with `newServerAt(…).enableHttps(…)`, an http4s server builder's `withTLS(…)`, Play's `https.port`), or run it behind a TLS-terminating proxy and trust it (`X-Forwarded-Proto`; Play `play.http.forwarded.trustedProxies`); send `Strict-Transport-Security` once it is HTTPS-only (http4s `HSTS(…)`, Play `RedirectHttpsFilter`).
Set security response headers on what the server sends — keep Play's `SecurityHeadersFilter` enabled, wrap akka/pekko-http routes in `respondWithHeaders(RawHeader("X-Content-Type-Options", "nosniff"), …)`, or add an http4s middleware that sets `Content-Security-Policy`, `X-Content-Type-Options` and a frame policy on every response.
Other · Code Health — Whether any branch is dead by construction — a switch arm whose label can never equal a case-normalised subject, or an `else if` whose predicate the arm above has already swallowed.
Method: Roslyn syntax + semantics: switch labels compared against the subject's own case normaliser, and if/else-if chains checked for a literal an earlier arm's containment test already swallows. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether a loop that shortens a string until it fits a length budget has a floor — one with none grinds the value down to the empty string, or past it into a negative-length `Substring`.
Method: Roslyn syntax + semantics: while/do loops whose body's only effect on a string is to drop its last character, checked for whether anything — a direct comparison on the length, a body guard, a break — bounds that length below. On a repository with no .NET source it reads JavaScript/TypeScript off the engine’s own token stream (test, vendored and minified paths not) with the same rule: a `while`/`do` loop whose body’s one assignment to a value is `x = x.slice(0, -1)` or `x = x.slice|substring|substr(0, x.length - 1)`, driven by a condition that reads `x.length` only as a term of a larger expression — never compared directly, never tested for truthiness, and with no other read of `x` — and whose body has no `break`, `return`, `throw` or `if` naming `x`. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether a type's disposal matches what it OWNS — releasing what it created, leaving alone what it was handed, and not declaring a finalizer for state that has nothing unmanaged to finalize.
Method: Roslyn syntax + semantics: every assignment to a disposable field is read to decide whether the type CREATED the value or was handed it, and the type's disposal is checked against that answer — an injected interface it disposes, a value it constructed and never releases, a finalizer on a type holding nothing unmanaged, and a disposable local whose every reference is a plain member read. A value handed to a container that disposes its contents (a parent control's `Controls` collection, a component `IContainer`) is released by that container and is not reported; generated code is out of population. On a repository with no .NET source the same ownership questions are read in JavaScript/TypeScript off the engine’s own token stream (test, vendored, generated and minified paths not): a class declaring `dispose()`, `[Symbol.dispose]()` or `[Symbol.asyncDispose]()` that disposes a field it was handed through a constructor parameter typed as a repository interface or resolved by a dependency-injection container; that assigns a field only ever from `new X(…)` of a disposable class and neither releases it anywhere in the class nor names it in its disposal member or a method that member calls, nor hands it to anything else; and a `const`/`let` local built from literals only whose every reference opens a statement operating on a non-release member of it. A class is disposable when every repository declaration of its name declares or inherits a disposal member, or when it is a documented library disposable (`vscode` EventEmitter, CancellationTokenSource and Disposable; three.js geometries, materials, textures, render targets, renderers, controls and composers). The finalizer arm has no JavaScript counterpart: a class cannot declare one. Dart is read for the owned-and-never-released arm: a Flutter `State` (or a class declaring `dispose()`/`close()`) whose library-private field is written only with direct creations of a framework controller, `FocusNode`, `StreamController` or periodic `Timer` (or a `.listen(…)` into a field declared `StreamSubscription`), which nothing in the class or its library releases (`dispose`/`close`/`cancel`) and which is never handed on except as a named argument. Ruby is read for the owned-and-never-released arm and the abandoned-local arm: a class declaring an instance `close`, `dispose`, `shutdown`, `stop`, `disconnect` or `terminate` whose instance variable is written only with a blockless core descriptor creation (`File.open`/`new`, `Tempfile`, `Dir.open`, `IO.popen`, the `socket` and `openssl` socket classes) that no method of the class closes and that is never handed on (passed, returned, stored, exposed by `attr_reader`, delegated) — a class whose superclass or mixin lies outside the repository is not judged — and a blockless creation read through and dropped (`File.open(path).read`) or held in a local that is never closed, returned, passed or stored (a `&:read` block-pass, an `autoclose: false` borrow and a `fileno` hand-over are not abandonment). PHP is read for the same two arms: a class (not a trait, and not one using a trait) declaring an instance `close`, `dispose`, `shutdown`, `stop`, `disconnect` or `terminate` whose `private` property (or a `final` class's `protected` one) is written only with a direct core `fopen`, `tmpfile`, `popen`, `proc_open`, `fsockopen`, `stream_socket_client`/`server` or `opendir` that nothing in the class closes (`fclose`, `pclose`, `closedir`, `unset`, a reset to `null`) and that is never handed on, and a handle held in a function's local, or read through as the argument of a reader, that is never closed, returned, passed, captured or stored; a `php://` stream, `curl_init`, `SplFileObject`, `PDO` and a function the repository declares under the core name are not read. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether a `when` guard is free of side effects — a guard that increments a counter or assigns while deciding whether its arm matches applies that change during PATTERN MATCHING, on an arm that may not be selected, and skips it entirely when a short-circuit to its left answers first.
Method: Roslyn syntax: `when` guards on case labels and switch-expression arms, read for a mutation (`++`/`--`/assignment) sitting in a position the guard's own `&&`/`||`/`??`/`?:`/`?.` can skip. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether the work a diagnostic log line costs is paid only when that line is wanted — C# evaluates a call's arguments BEFORE the call, so a trace/debug message joined or projected out of a collection is built in full on every pass, and then discarded by a sink the shipped configuration leaves switched off.
Method: Roslyn syntax: log calls at a diagnostic level (a `Log`-prefixed method naming Trace/Debug/Verbose, or a bare `Debug`/`Trace`/`Verbose` on a receiver named for a logger), whose argument list is read for a call whose cost scales with a sequence — a LINQ operator, a materialisation, `string.Join`, a serializer — with no enclosing level check or conditional-compilation region. On a repository with no .NET source it reads JavaScript/TypeScript off the engine’s own token stream (test, vendored and minified paths not) with the same rule: a `debug`/`trace`/`verbose` call on a receiver named for a logger, or a `log`-prefixed method naming the level, whose argument calls an array operator (`map`/`filter`/`reduce`/`sort`/…), `Array.from`, `Object.keys/values/entries`, `JSON.stringify`/`util.inspect` over anything but a literal, or an array `join` — outside any arrow or function passed as an argument, which the logger calls only when the level is on — with no enclosing `if`, `&&` or `?:` whose condition names a level, a level string, or the `NODE_ENV`/`__DEV__`/`DEV` build switch. Deterministic, provable per finding. Advisory.
Do you agree with this assessment?
X27 · Collection changed while being enumerated10.0 / 10Exemplary○ Nothing flagged
Other · Code Health — Whether a `for` comprehension or `foreach` leaves the mutable collection it is walking alone — an `ArrayBuffer` or `ListBuffer` counts its changes and its iterator checks the count, an `ArrayDeque` (and `mutable.Queue`/`mutable.Stack`) is walked by index up to its starting length, and a `java.util` collection walked through `asScala` is fail-fast, so a body that adds to or removes from the very collection the loop is walking makes a later step throw `ConcurrentModificationException` (`IndexOutOfBoundsException` for a deque) and the remaining elements are never seen.
Method: Roslyn syntax + semantics: `foreach` statements whose body calls a structural mutator (`Add`/`Remove`/`Clear`/`Insert`/…) on the very expression the loop is enumerating. Two arms. ARM A — the source is a concrete fragile BCL collection, or a live `Keys`/`Values` view over one, and the mutator resolves to that same collection's own member; concurrent and immutable collections and arrays are outside the population by construction, since their enumerators survive a structural change. ARM B — the source is an argument-less accessor CALL on a receiver whose body is in source: the accessor must return a stored field VERBATIM and a sibling member must structurally change that same field, both read off the implementations rather than from the members' names. A mutation the loop provably exits immediately after (`break`/`return`/`throw`/`goto`), or one written inside a nested loop or a lambda, is counted and never reported. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether exceptions are handled rather than silently swallowed or rethrown with lost stack traces.
Method: Roslyn syntax scan: every catch clause counted; empty catches and bare rethrows flagged. Population is all catch clauses, not estimated. Deterministic, hard fact.
`case x` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter. — src/main/scala/ir/transforms/validate/TranslationValidate.scala:95
What to do
Swallowed exception (caught, then discarded)
Do you agree with this assessment?
X30 · Support guard that admits what it rejects10.0 / 10Exemplary○ Nothing flagged
Other · Code Health — Whether a guard written as a NEGATED `||` says what its author meant — `!(a || b || x != k)` is `!a && !b && x == k` by De Morgan, so a bail-out that mixes capabilities the code needs with a fault it refuses turns inside out: it fires only where the capabilities are ABSENT, and lets every value the fault term names walk straight into the body that cannot handle it.
Method: Roslyn syntax only, no semantic model: every logical-not whose operand is a parenthesised `||` chain of two or more disjuncts, flattened (a left-nested `a || b || c` read once would see `(a || b)` as one disjunct). A site enters the population on that shape alone. A finding additionally needs the disjuncts to DISAGREE in polarity: at least one bare boolean read — an identifier or member access, never an invocation, which is a predicate rather than a capability flag — and at least one `x != <constant>`, the only form that negates into an exact-value pin (`== null` negates into a looser requirement and is outside the fault set). Consistently-polarised disjunctions, all-fault or all-capability, are counted and never reported; a negated `&&` is outside the population entirely. No same-receiver gate: it was measured to cost a real defect and remove no false positive. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether Scala's null is held to the type system and not undermined by assertions — a file compiled with `-Yexplicit-nulls` is one where `String` excludes null and `String | Null` admits it, a file under WartRemover's `Null` wart or Scalafix's `DisableSyntax.noNulls` is one whose code cannot write `null` and must say `Option`, and each `.nn`, `import scala.language.unsafeNulls` or null-lint suppression is the author overruling that.
Method: Roslyn compiler-options scan: NullableContextOptions per project; null-forgiving (!) suppression density per 1k syntax nodes. Deterministic, adoption plus suppression penalty.
No build over this repository's 197 Scala product file(s) passes `-Yexplicit-nulls`, enables WartRemover's `Null` wart or runs Scalafix's `DisableSyntax.noNulls`, so every reference type admits null and nothing reports a `null` written into the code or returned from a Java API — the first one to reach a method call is a `NullPointerException`. `Option` by convention is a habit no tool here holds the code to.
What to do
On Scala 3, add `-Yexplicit-nulls` to `scalacOptions` so `String` and `String | Null` mean different things, and type each Java API's result as nullable where it can return null; on Scala 2 (or as a first step), enable WartRemover's `Null` wart (`wartremoverErrors += Wart.Null`) or Scalafix's `DisableSyntax.noNulls = true` so the code holds absence in `Option`. Then pay the assertions down rather than adding to them: each `.nn` is a null the compiler could not rule out — wrap the Java value in `Option(…)` at the boundary, pattern-match on `null` once there, or change the API so the null cannot arrive; an `unsafeNulls` import switches the checking off for everything after it.
Do you agree with this assessment?
Reference — by lens
The score is the rank-weighted fold of these lenses (worst-heaviest), each including its meta-dimensions; a lens with a Critical contributor is capped at Fair (its band reads "gated by …") and is never the strongest area however high its average.
Unscored — 2 check(s) recorded observations but carry no score
These checks ran and found something, but they do not carry a score — either by design (an advisory check reports evidence rather than grading it) or because they could not be scored here. They are excluded from the score for that reason, not because there was nothing to see.
D36 Supply-chain Provenance & Signing — 2 observation(s) recorded · The CI pipeline publishes no artifact — no package publish, container push or release with files to download. Supply-chain provenance, signing and an SBOM describe a PUBLISHED artifact for the people who obtain it, so there is nothing to attest here; a deployment of the service itself publishes nothing for anyone else to verify. Add them to the release pipeline when this repo starts publishing artifacts (a package, a container image, or a release with downloadable files). Build integrity and workflow-token hygiene are reported below: they describe what the CI runs and the token it runs with, neither of which is affected by whether the pipeline ships an artifact.
X10 Duplicated predicate — 2 observation(s) recorded · Advisory — this card reports evidence and never carries a score.
Not evidenced — 1 control(s) we could not find positive evidence for
These checks grade a working control, and the repository shows no evidence of one. That is deliberately not scored as a zero: a repository cannot show an ops runbook, a database TTL or an infrastructure-side audit log, so absence of evidence here is not evidence the control is missing. It is also not a statement that the check is irrelevant to this codebase — the thing it grades applies; we just could not see it. Excluded from the score either way.
P5 DR & Backup — not evidenced — repo shows no backup/RTO/RPO controls; absence of evidence is not evidence of a working control
Not included — 70 check(s) not relevant to this codebase
These checks had nothing to measure here (no tests, no git history, the codebase is small, or the architecture style doesn't apply), so they're omitted above rather than scored low.
AC1 Text alternatives — No web markup found — accessibility is not applicable to this repository.
AC2 Forms & labels — No web markup found — accessibility is not applicable to this repository.
AC3 Page structure — No web markup found — accessibility is not applicable to this repository.
AC4 Keyboard semantics — No web markup found — accessibility is not applicable to this repository.
AC5 ARIA correctness — No web markup found — accessibility is not applicable to this repository.
AC6 Visual & motion safety — No web markup found — accessibility is not applicable to this repository.
AX1 Captive dependencies — Not applicable: this repository's Scala imports no dependency-injection container and defines no container of its own — nothing that both registers and resolves bindings, and nothing that names two lifetimes — so nothing holds one lifetime's instance while handing out another's.
AX2 Stateful singletons — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
AX5 Architecture & structure — not assessed — architecture style/structure is computed from a project graph (projects, types, module namespaces) that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
AX7 Slice cohesion — not applicable — not a vertical-slice architecture
AX9 CQS / query purity — no CQRS query handlers detected — query purity is not applicable to this codebase
AXB2 Runtime readiness — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
AXR1 Runtime accessibility — compose up failed (exit 17 — an image could not be built) — a8db9b61eba3 Extracting [=================> ] 293.6MB/859.5MB a8db9b61eba3 Extracting [==================================================>] 859.5MB/859.5MB failed to solve: dockerfile parse error on line 132: invalid name for build stage: "basil:dev", name can't start with a number or contain symbols; likely cause (our sandbox): an image the Dockerfile builds FROM could not be fetched: our sandbox reaches registries only through its pull-through mirror, and the mirror did not serve it. This is a limit of our sandbox, not of your repository; runtime evidence skipped This is a statement about this run, not a statement about your application: nothing here says the surface is inaccessible, only that it was never rendered.
C1 Data Protection — Not assessed: these personal data controls are read from a source model (declarative annotations, request middleware, entity/column names, guard methods) that was not loaded for this repository — because the repository is written in a language this check does not yet model, or because its projects failed to load. Absence of an idiom this check recognises is NOT evidence that this repository lacks personal data controls: it may implement them entirely in its own ecosystem. This is a gap in the analyzer's language coverage, not a finding about this repository.
C2 Access Controls — Not assessed: these authorization controls are read from a source model (declarative annotations, request middleware, entity/column names, guard methods) that was not loaded for this repository — because the repository is written in a language this check does not yet model, or because its projects failed to load. Absence of an idiom this check recognises is NOT evidence that this repository lacks authorization controls: it may implement them entirely in its own ecosystem. This is a gap in the analyzer's language coverage, not a finding about this repository.
C3 Audit Trail — No personal data detected in a persisted data model — no PII-named column (email, first_name, date_of_birth, phone_number, …) or stored credential on a Slick table or in a SQL migration's CREATE TABLE or ALTER TABLE — and no database client (Slick, Doobie, Quill, ScalikeJDBC, Anorm, Skunk, a MongoDB or Cassandra driver, JDBC) imported either, so this repository keeps no sensitive data whose changes an audit trail would record. If it does (through a store configured outside this repository, for instance), the trail belongs to wherever that data is stored.
C4 Data Retention — No personal data detected in a persisted data model — no PII-named field (email, firstName, dateOfBirth, phoneNumber, …) or stored credential on a Slick table or in a SQL migration's CREATE TABLE or ALTER TABLE — and no database or data-store client (Slick, Doobie, Quill, ScalikeJDBC, Anorm, Skunk, JDBC, MongoDB, Cassandra, …) imported either, so this repository keeps no personal data whose lifetime a retention limit would bound.
C5 Data-Subject Rights — No personal data detected in a persisted data model — no PII-named field (email, firstName, dateOfBirth, phoneNumber, …) or stored credential on a Slick table or in a SQL migration's CREATE TABLE or ALTER TABLE — and no database or data-store client (Slick, Doobie, Quill, ScalikeJDBC, Anorm, Skunk, JDBC, MongoDB, Cassandra, …) imported either, so this repository keeps no personal data for a data subject to erase, export or consent over.
D10 Test Quality — ~10271 lines of test source are present (.scala, .java) but no test cases reached the test census for this repository — no test root we could resolve declared them, or the files we read declare no cases in a test framework we recognise — so skipped/assertion-free tests couldn't be counted. Not scored — this is a gap in the analyzer, not a finding about this repository.
D11 Test Reliability — Test reliability not included — no .scala test runner
D12 Dependency Hygiene — Dependency hygiene not measured — no supported dependency manifest was read
D14 License Compliance — No dependency manifest found — no declared dependency closure to grade for licences
D18 Solution Shape — D18 scores the shape of a .NET solution; this repository has no .NET solution or project files, so the dimension does not apply.
D19 Documentation Quality — No runnable or published unit to look for an example in, and no multi-project root README to look for a map in; the other documentation kinds are withheld (see the gaps), so documentation quality is not applicable here.
D22 Internal API Consistency — The exposed public-API surface could not be collected — no C#/VB projects loaded.
D23 Boundary Type-Coupling — No bounded-context organisation was detected either — neither a context-shaped layout, nor 2+ sibling source directories each declaring an aggregate root, nor 2+ sibling projects each declaring an entity of their own or taking another project's integration events. Declaring this codebase's bounded contexts (≥2) would let cross-boundary type coupling be assessed. Declare them in `.codehealth/config.yaml` at the repository root (create it if absent), mapping each context name to the module-path or namespace prefixes that belong to it — e.g. `architecture:` → `contexts:` → `Billing: ["src/billing", "Acme.Billing"]`, `Catalog: ["src/catalog", "Acme.Catalog"]`.
D24 Comment Value — D24 reads C#, Visual Basic, TypeScript and JavaScript comments only — this repository's production source is .py, .scala, which was left unread. Not scored: this is a gap in the analyzer, not a verdict about this repository.
D25 ADR Conformance — no ADRs to check
D26 Project Cohesion — D26 could not read how the parts of this repository's one build unit reference each other, so its cohesion was not measured. Not scored: this is a gap in the analyzer, not a verdict about this repository.
D27 Navigability — D27 counts a call into the standard library or a dependency as unresolved for this repository's language (.scala), so too few call sites counted as resolved to assess navigability. Not scored: this is a gap in the analyzer, not a verdict about this repository.
D30 Dependency Vulnerabilities — Not scored — no dependency manifest in a supported ecosystem was read for this repository. A gap in the analyzer's language coverage, NOT a finding that the repository is free of vulnerable dependencies (a Python pyproject.toml/requirements.txt (pip/uv/Poetry), a Swift Package.swift/Package.resolved, a Cargo manifest, a Go module (go.mod/go.sum), a Gradle version catalogue, a Maven POM, an sbt build (build.sbt), composer.json, package.json, a Dart pubspec.yaml, an Elixir mix.exs/mix.lock (Hex), a rebar.config / erlang.mk DEPS (Hex), a Ruby Gemfile/Gemfile.lock or .gemspec (Bundler/RubyGems) — not scanned yet).
D32 Data Compliance (PII/GDPR) — 59 file(s) were not parsed by semgrep — the PII/GDPR ruleset never ran over them
D37 Vulnerability-disclosure Policy — No vulnerability-disclosure policy file found (SECURITY.md/.markdown/.rst/.txt at root or under .github/.forgejo/.gitea/docs, .well-known/security.txt). A coordinated-disclosure policy may live off-repo, so this is not evidenced rather than failed.
D40 Network Egress Confinement — No Kubernetes/orchestration workloads found in the repository manifests; network egress policy is a cluster-native control that may live at the platform/firewall layer, so there is nothing to assess here.
D41 Kernel & Syscall Confinement — No Kubernetes/orchestration workloads found in the repository manifests; seccomp/AppArmor/SELinux confinement is a workload-level control, so there is nothing to assess here.
D42 Runtime Threat Enforcement — No Kubernetes/orchestration workloads found in the repository manifests; runtime threat-detection and admission-control policy are cluster-level controls, so there is nothing to assess here.
D43 Malicious Dependencies — Not scored — no dependency manifest in a supported ecosystem was read for this repository. A gap in the analyzer's language coverage, NOT a finding that the repository is free of vulnerable dependencies (a Python pyproject.toml/requirements.txt (pip/uv/Poetry), a Swift Package.swift/Package.resolved, a Cargo manifest, a Go module (go.mod/go.sum), a Gradle version catalogue, a Maven POM, an sbt build (build.sbt), composer.json, package.json, a Dart pubspec.yaml, an Elixir mix.exs/mix.lock (Hex), a rebar.config / erlang.mk DEPS (Hex), a Ruby Gemfile/Gemfile.lock or .gemspec (Bundler/RubyGems) — not scanned yet).
D44 Platform End-of-Life — Platform end-of-life not assessed — this repository declares no platform this pass reads
D5 Coupling — Not applicable — this Mill build ships 1 production module(s), so there is no coupling BETWEEN modules to measure. (Its test and non-production modules are not part of the shipped graph.)
D7 Architectural Integrity — no checkable ADRs, and no project-reference graph for the cycle pass to read — so this dimension makes no claim about dependency cycles in either direction (where this repository's language has an import-cycle lens, cycles are reported there). Architectural integrity not assessed
D8 Code Coverage — Coverage not included — suite not readable by the collector
DM1 Domain Modelling — applicable but not scored (2 signals for this style, 2 needed — the count is met but a required primary signal is absent): 296 value object(s); 2 domain event(s); its domain events are published by services or handlers — no domain entity raises one
ED1 Event-Driven — not scored — this repository shows none of the 3 signals this lens looks for
ED5 Idempotency — no mutating command handlers or message consumers detected — idempotency check not applicable
ES1 Event Sourcing — not scored — this repository shows none of the 3 signals this lens looks for
P12 CI test-gate honesty — Reported, not scored — and nothing was matched here. The coverage check applies to any stack, and the automatic-re-run check to any GitHub-Actions workflow, but the checks for excluded tests, skipped tests and sleep-based synchronisation currently recognise only some ecosystems' test-runner idioms, so on a repository built with another stack the zeros below mean 'not checked', not 'clean'.
P7 Outbound HTTP resilience — not applicable — no HTTP server, API framework or worker entry point was found in the JVM source, so there is no service whose uptime a failing dependency could take down
P8 Schema migrations — no ORM, schema-migration tool or schema auto-create was found in this repository's dependency manifests or source, so there is no database schema for this check to judge
P9 Domain vs controller coverage — coverage not measured: this check compares the coverage of the analyzer's own test run across the domain and web layers, and that run measured none here — Test coverage (D8) says why
PF1 Benchmark discipline — Not applicable: no benchmark suite was found. This check searched for `@Benchmark` in a Java, Kotlin or Scala file importing JMH or kotlinx-benchmark, Jetpack Benchmark's `measureRepeated` in a file importing androidx.benchmark, or JMH/kotlinx-benchmark/androidx.benchmark in a pom.xml, Gradle or sbt build, and for a `*benchmark*` script that this repository's CI runs. Benchmarks are credited as a bonus, so their absence is neither scored nor deducted.
PF2 Allocation hygiene — Not scored: this check counted allocation-aware idioms (Span, pools, stackalloc) per line, which describes what kind of code a repository is rather than whether it has an allocation problem, so it was withdrawn. Nothing here is a finding about your code.
X1 Async correctness — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X13 Undrained process stream — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X14 Bypassable address classification — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X15 Unvalidated length from an untrusted reader — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X17 Uncapped recursion over a caller-supplied document — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X19 Unrestored process-global state — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X2 Cancellation propagation — no C# was loaded; this repository's Scala was read, and no request in it can be cancelled by a caller — a Scala request takes no token: a Future cannot be cancelled, and cats-effect, ZIO and Monix interrupt the fiber that made the request from outside the call, not through a parameter
X20 Mistyped argument guard — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X22 Contradicted release guard — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X24 Document value interpolated into markup unescaped — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X25 Inert configuration knob — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X26 Unsynchronised callback handoff — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X28 Index access outside its own emptiness guard — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X29 Per-element action decided by a fixed element — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X32 Type resolved by simple name across every loaded assembly — This check is about how a .NET program searches the assemblies loaded into its process for a type, and this repository contains no .NET source, so there is nothing here for it to assess. Not a gap in the analyzer and not a finding about your code.
X4 Structured logging — This check asks whether log calls keep a message's values apart from its text, which needs a logger that can carry them as fields. This repository's Scala was read, and it logs through none that an interpolated message defeats: scala-logging takes an `s"…"` message apart into SLF4J's pattern and arguments at compile time, and log4s, grizzled-slf4j, Play's Logger, Akka's LoggingAdapter, sbt's Logger and Spark's Logging take one finished message (as log4net does in C#). Calls made straight through SLF4J (`org.slf4j.Logger`) would be judged.
X6 Hand-rolled structured-format parsing — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
X7 Silent fallback defaults — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
X9 Subsumed condition operand — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
Appendix A — Findings (grouped)
The findings behind the scores, grouped by severity, then by dimension and kind. The high-severity issues are enumerated in full below; items per group are capped at 25 with any overflow stated explicitly per group, never silently truncated. The complete machine-readable list of every finding (all severities) is the companion findings.md in this report's bundle.
TodoComment src/test/scala/DataStructureAnalysisTest.scala:568— // TODO count point-to relations and ensure no more constraints are added in this phase — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment src/test/scala/GammaDomainTests.scala:8— // TODO more tests + system tests — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment src/test/scala/GammaDomainTests.scala:70— // TODO is this right?! — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment src/test/scala/LoopInvariantTests.scala:108— // TODO fix gamma domains — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment src/test/scala/PointsToTest.scala:95— // * TODO: if the region is not modified in the function but only referenced. Is there a need — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment src/test/scala/ProcedureAnnotationTests.scala:62— // TODO run boogie once gamma constraints on the loop guard variables can be added in a loop invariant. — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment src/test/scala/SVATest.scala:67— // TODO look into why there is an inParam — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment src/main/scala/util/RunUtils.scala:106— // todo: since refactoring, there is some extra code that is run here — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment src/main/scala/util/smt/SMT.scala:25— // TODO — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment src/main/scala/analysis/KnownBits.scala:292— // TODO — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment src/main/scala/analysis/KnownBits.scala:323— // TODO — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment src/main/scala/analysis/KnownBits.scala:348— // TODO — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment src/main/scala/analysis/KnownBits.scala:373— // TODO — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment src/main/scala/analysis/KnownBits.scala:412— // TODO — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment src/main/scala/analysis/NumericalDomains.scala:177— // TODO — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment src/main/scala/analysis/VariableDependencyAnalysis.scala:220— // TODO — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment src/main/scala/util/intrusive_list/IntrusiveList.scala:7— // TODO: implement IterableOps — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment src/main/scala/util/intrusive_list/IntrusiveList.scala:85— // TODO: cache? — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment src/main/scala/translating/BAPToIR.scala:70— // TODO maybe throw an exception if there is no block with the same address, to be safe? — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment src/main/scala/translating/GTIRBToIR.scala:148— // TODO this is a hack to imitate BAP so that the existing specifications relying on this will work — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment src/main/scala/translating/GTIRBToIR.scala:185— // TODO cleanup blocks that are entirely nop but have fallthrough edges? — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment src/main/scala/translating/GTIRBToIR.scala:298— // TODO this is a case that requires special consideration — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment src/main/scala/translating/GTIRBToIR.scala:337— // TODO this is a case that requires special consideration — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment src/main/scala/translating/GTIRBToIR.scala:547— // TODO - jump is to a block in the middle of another procedure - need to either split or merge procedures — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment src/main/scala/translating/GTIRBToIR.scala:633— // TODO requires further consideration once encountered — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
Unfinished stub — body is `???` src/main/scala/analysis/Domains.scala:60— `narrow` is a shipped member whose whole body is still `???`, and nothing in the repository overrides it — generated scaffolding that was never completed. Implement it or remove the dead surface.
Unfinished stub — body is `???` src/main/scala/analysis/Domains.scala:107— `narrow` is a shipped member whose whole body is still `???`, and nothing in the repository overrides it — generated scaffolding that was never completed. Implement it or remove the dead surface.
Unfinished stub — body is `???` src/main/scala/analysis/data_structure_analysis/SymbolicValueAnalysis.scala:159— `transfer` is a shipped member whose whole body is still `???`, and nothing in the repository overrides it — generated scaffolding that was never completed. Implement it or remove the dead surface.
Unfinished stub — body is `???` src/main/scala/analysis/data_structure_analysis/SymbolicValueAnalysis.scala:191— `transfer` is a shipped member whose whole body is still `???`, and nothing in the repository overrides it — generated scaffolding that was never completed. Implement it or remove the dead surface.
Unfinished stub — body is `???` src/main/scala/analysis/data_structure_analysis/SymbolicValueAnalysis.scala:258— `transfer` is a shipped member whose whole body is still `???`, and nothing in the repository overrides it — generated scaffolding that was never completed. Implement it or remove the dead surface.
Unfinished stub — body is `???` src/main/scala/analysis/data_structure_analysis/SymbolicValueAnalysis.scala:266— `top` is a shipped member whose whole body is still `???`, and nothing in the repository overrides it — generated scaffolding that was never completed. Implement it or remove the dead surface.
Unfinished stub — body is `???` src/main/scala/analysis/data_structure_analysis/SymbolicValueAnalysis.scala:523— `top` is a shipped member whose whole body is still `???`, and nothing in the repository overrides it — generated scaffolding that was never completed. Implement it or remove the dead surface.
Unfinished stub — body is `???` src/main/scala/analysis/rely_guarantee_generation/RelyGuaranteeGeneration.scala:134— `top` is a shipped member whose whole body is still `???`, and nothing in the repository overrides it — generated scaffolding that was never completed. Implement it or remove the dead surface.
Unfinished stub — body is `???` src/main/scala/analysis/rely_guarantee_generation/RelyGuaranteeGeneration.scala:138— `transfer` is a shipped member whose whole body is still `???`, and nothing in the repository overrides it — generated scaffolding that was never completed. Implement it or remove the dead surface.
Unfinished stub — body is `???` src/main/scala/ir/transforms/ProcedureParameters.scala:90— `top` is a shipped member whose whole body is still `???`, and nothing in the repository overrides it — generated scaffolding that was never completed. Implement it or remove the dead surface.
Unfinished stub — body is `???` src/main/scala/ir/transforms/Simp.scala:86— `top` is a shipped member whose whole body is still `???`, and nothing in the repository overrides it — generated scaffolding that was never completed. Implement it or remove the dead surface.
Unfinished stub — body is `???` src/main/scala/ir/transforms/Simp.scala:116— `top` is a shipped member whose whole body is still `???`, and nothing in the repository overrides it — generated scaffolding that was never completed. Implement it or remove the dead surface.
Unfinished stub — body is `???` src/main/scala/ir/transforms/Simp.scala:1944— `top` is a shipped member whose whole body is still `???`, and nothing in the repository overrides it — generated scaffolding that was never completed. Implement it or remove the dead surface.
Unfinished stub — body is `???` src/main/scala/ir/transforms/Simp.scala:1949— `transfer` is a shipped member whose whole body is still `???`, and nothing in the repository overrides it — generated scaffolding that was never completed. Implement it or remove the dead surface.
Unfinished stub — body is `???` src/main/scala/translating/IRExpToSMT2.scala:212— `vload` is a shipped member whose whole body is still `???`, and nothing in the repository overrides it — generated scaffolding that was never completed. Implement it or remove the dead surface.
Unfinished stub — body is `???` src/main/scala/translating/IRExpToSMT2.scala:213— `vstore` is a shipped member whose whole body is still `???`, and nothing in the repository overrides it — generated scaffolding that was never completed. Implement it or remove the dead surface.
Unfinished stub — body is `???` src/main/scala/translating/IRExpToSMT2.scala:214— `vhavoc` is a shipped member whose whole body is still `???`, and nothing in the repository overrides it — generated scaffolding that was never completed. Implement it or remove the dead surface.
Unfinished stub — body is `???` src/main/scala/translating/IRExpToSMT2.scala:215— `vold` is a shipped member whose whole body is still `???`, and nothing in the repository overrides it — generated scaffolding that was never completed. Implement it or remove the dead surface.
Unfinished stub — body is `???` src/main/scala/translating/IRExpToSMT2.scala:216— `vquantifier` is a shipped member whose whole body is still `???`, and nothing in the repository overrides it — generated scaffolding that was never completed. Implement it or remove the dead surface.
Unfinished stub — body is `???` src/main/scala/translating/IRExpToSMT2.scala:217— `vlambda` is a shipped member whose whole body is still `???`, and nothing in the repository overrides it — generated scaffolding that was never completed. Implement it or remove the dead surface.
Unfinished stub — body is `???` src/main/scala/translating/IRExpToSMT2.scala:218— `vprog` is a shipped member whose whole body is still `???`, and nothing in the repository overrides it — generated scaffolding that was never completed. Implement it or remove the dead surface.
Unfinished stub — body is `???` src/main/scala/translating/IRExpToSMT2.scala:219— `vrepeat` is a shipped member whose whole body is still `???`, and nothing in the repository overrides it — generated scaffolding that was never completed. Implement it or remove the dead surface.
Unfinished stub — body is `???` src/main/scala/translating/IRExpToSMT2.scala:220— `vzeroextend` is a shipped member whose whole body is still `???`, and nothing in the repository overrides it — generated scaffolding that was never completed. Implement it or remove the dead surface.
Unfinished stub — body is `???` src/main/scala/translating/IRExpToSMT2.scala:221— `vsignextend` is a shipped member whose whole body is still `???`, and nothing in the repository overrides it — generated scaffolding that was never completed. Implement it or remove the dead surface.
Unfinished stub — body is `???` src/main/scala/translating/IRExpToSMT2.scala:222— `vboollit` is a shipped member whose whole body is still `???`, and nothing in the repository overrides it — generated scaffolding that was never completed. Implement it or remove the dead surface.
Unfinished stub — body is ??? / NotImplementedError src/main/scala/analysis/Domains.scala:60— `narrow` is a shipped method whose whole body is `???` (or throws NotImplementedError), and nothing in the repository overrides it — scaffolding that was never completed. Implement it or remove the dead surface.
Unfinished stub — body is ??? / NotImplementedError src/main/scala/analysis/Domains.scala:107— `narrow` is a shipped method whose whole body is `???` (or throws NotImplementedError), and nothing in the repository overrides it — scaffolding that was never completed. Implement it or remove the dead surface.
Unfinished stub — body is ??? / NotImplementedError src/main/scala/analysis/data_structure_analysis/SymbolicValueAnalysis.scala:159— `transfer` is a shipped method whose whole body is `???` (or throws NotImplementedError), and nothing in the repository overrides it — scaffolding that was never completed. Implement it or remove the dead surface.
Unfinished stub — body is ??? / NotImplementedError src/main/scala/analysis/data_structure_analysis/SymbolicValueAnalysis.scala:191— `transfer` is a shipped method whose whole body is `???` (or throws NotImplementedError), and nothing in the repository overrides it — scaffolding that was never completed. Implement it or remove the dead surface.
Unfinished stub — body is ??? / NotImplementedError src/main/scala/analysis/data_structure_analysis/SymbolicValueAnalysis.scala:258— `transfer` is a shipped method whose whole body is `???` (or throws NotImplementedError), and nothing in the repository overrides it — scaffolding that was never completed. Implement it or remove the dead surface.
Unfinished stub — body is ??? / NotImplementedError src/main/scala/analysis/data_structure_analysis/SymbolicValueAnalysis.scala:266— `top` is a shipped method whose whole body is `???` (or throws NotImplementedError), and nothing in the repository overrides it — scaffolding that was never completed. Implement it or remove the dead surface.
Unfinished stub — body is ??? / NotImplementedError src/main/scala/analysis/data_structure_analysis/SymbolicValueAnalysis.scala:523— `top` is a shipped method whose whole body is `???` (or throws NotImplementedError), and nothing in the repository overrides it — scaffolding that was never completed. Implement it or remove the dead surface.
Unfinished stub — body is ??? / NotImplementedError src/main/scala/analysis/rely_guarantee_generation/RelyGuaranteeGeneration.scala:134— `top` is a shipped method whose whole body is `???` (or throws NotImplementedError), and nothing in the repository overrides it — scaffolding that was never completed. Implement it or remove the dead surface.
Unfinished stub — body is ??? / NotImplementedError src/main/scala/analysis/rely_guarantee_generation/RelyGuaranteeGeneration.scala:138— `transfer` is a shipped method whose whole body is `???` (or throws NotImplementedError), and nothing in the repository overrides it — scaffolding that was never completed. Implement it or remove the dead surface.
Unfinished stub — body is ??? / NotImplementedError src/main/scala/ir/transforms/ProcedureParameters.scala:90— `top` is a shipped method whose whole body is `???` (or throws NotImplementedError), and nothing in the repository overrides it — scaffolding that was never completed. Implement it or remove the dead surface.
Unfinished stub — body is ??? / NotImplementedError src/main/scala/ir/transforms/Simp.scala:86— `top` is a shipped method whose whole body is `???` (or throws NotImplementedError), and nothing in the repository overrides it — scaffolding that was never completed. Implement it or remove the dead surface.
Unfinished stub — body is ??? / NotImplementedError src/main/scala/ir/transforms/Simp.scala:116— `top` is a shipped method whose whole body is `???` (or throws NotImplementedError), and nothing in the repository overrides it — scaffolding that was never completed. Implement it or remove the dead surface.
Unfinished stub — body is ??? / NotImplementedError src/main/scala/ir/transforms/Simp.scala:1944— `top` is a shipped method whose whole body is `???` (or throws NotImplementedError), and nothing in the repository overrides it — scaffolding that was never completed. Implement it or remove the dead surface.
Unfinished stub — body is ??? / NotImplementedError src/main/scala/ir/transforms/Simp.scala:1949— `transfer` is a shipped method whose whole body is `???` (or throws NotImplementedError), and nothing in the repository overrides it — scaffolding that was never completed. Implement it or remove the dead surface.
Unfinished stub — body is ??? / NotImplementedError src/main/scala/translating/IRExpToSMT2.scala:212— `vload` is a shipped method whose whole body is `???` (or throws NotImplementedError), and nothing in the repository overrides it — scaffolding that was never completed. Implement it or remove the dead surface.
Unfinished stub — body is ??? / NotImplementedError src/main/scala/translating/IRExpToSMT2.scala:213— `vstore` is a shipped method whose whole body is `???` (or throws NotImplementedError), and nothing in the repository overrides it — scaffolding that was never completed. Implement it or remove the dead surface.
Unfinished stub — body is ??? / NotImplementedError src/main/scala/translating/IRExpToSMT2.scala:214— `vhavoc` is a shipped method whose whole body is `???` (or throws NotImplementedError), and nothing in the repository overrides it — scaffolding that was never completed. Implement it or remove the dead surface.
Unfinished stub — body is ??? / NotImplementedError src/main/scala/translating/IRExpToSMT2.scala:215— `vold` is a shipped method whose whole body is `???` (or throws NotImplementedError), and nothing in the repository overrides it — scaffolding that was never completed. Implement it or remove the dead surface.
Unfinished stub — body is ??? / NotImplementedError src/main/scala/translating/IRExpToSMT2.scala:216— `vquantifier` is a shipped method whose whole body is `???` (or throws NotImplementedError), and nothing in the repository overrides it — scaffolding that was never completed. Implement it or remove the dead surface.
Unfinished stub — body is ??? / NotImplementedError src/main/scala/translating/IRExpToSMT2.scala:217— `vlambda` is a shipped method whose whole body is `???` (or throws NotImplementedError), and nothing in the repository overrides it — scaffolding that was never completed. Implement it or remove the dead surface.
Unfinished stub — body is ??? / NotImplementedError src/main/scala/translating/IRExpToSMT2.scala:218— `vprog` is a shipped method whose whole body is `???` (or throws NotImplementedError), and nothing in the repository overrides it — scaffolding that was never completed. Implement it or remove the dead surface.
Unfinished stub — body is ??? / NotImplementedError src/main/scala/translating/IRExpToSMT2.scala:219— `vrepeat` is a shipped method whose whole body is `???` (or throws NotImplementedError), and nothing in the repository overrides it — scaffolding that was never completed. Implement it or remove the dead surface.
Unfinished stub — body is ??? / NotImplementedError src/main/scala/translating/IRExpToSMT2.scala:220— `vzeroextend` is a shipped method whose whole body is `???` (or throws NotImplementedError), and nothing in the repository overrides it — scaffolding that was never completed. Implement it or remove the dead surface.
Unfinished stub — body is ??? / NotImplementedError src/main/scala/translating/IRExpToSMT2.scala:221— `vsignextend` is a shipped method whose whole body is `???` (or throws NotImplementedError), and nothing in the repository overrides it — scaffolding that was never completed. Implement it or remove the dead surface.
Unfinished stub — body is ??? / NotImplementedError src/main/scala/translating/IRExpToSMT2.scala:222— `vboollit` is a shipped method whose whole body is `???` (or throws NotImplementedError), and nothing in the repository overrides it — scaffolding that was never completed. Implement it or remove the dead surface.
FileTooLong: transforms/Simp.scala src/main/scala/ir/transforms/Simp.scala— FileTooLong — 1419 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 919 over it, 2.84× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: data_structure_analysis/IntervalDSA.scala src/main/scala/analysis/data_structure_analysis/IntervalDSA.scala— FileTooLong — 1022 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 522 over it, 2.04× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: validate/TranslationValidate.scala src/main/scala/ir/transforms/validate/TranslationValidate.scala— FileTooLong — 830 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 330 over it, 1.66× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: eval/SimplifyExpr.scala src/main/scala/ir/eval/SimplifyExpr.scala— FileTooLong — 744 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 244 over it, 1.49× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: translating/IRToBoogie.scala src/main/scala/translating/IRToBoogie.scala— FileTooLong — 744 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 244 over it, 1.49× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: data_structure_analysis/Graph.scala src/main/scala/analysis/data_structure_analysis/Graph.scala— FileTooLong — 682 significant lines (blank, comment-only and punctuation-only lines excluded), about 98% of them inside a single declaration: Graph (30-1004). The bar is 500 significant lines; this is 182 over it, 1.36× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
FileTooLong: translating/GTIRBToIR.scala src/main/scala/translating/GTIRBToIR.scala— FileTooLong — 593 significant lines (blank, comment-only and punctuation-only lines excluded), about 96% of them inside a single declaration: GTIRBToIR (58-936). The bar is 500 significant lines; this is 93 over it, 1.19× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
FileTooLong: boogie/BExpr.scala src/main/scala/boogie/BExpr.scala— FileTooLong — 586 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 86 over it, 1.17× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: eval/InterpretBasilIR.scala src/main/scala/ir/eval/InterpretBasilIR.scala— FileTooLong — 569 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 69 over it, 1.14× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: translating/GTIRBLoader.scala src/main/scala/translating/GTIRBLoader.scala— FileTooLong — 557 significant lines (blank, comment-only and punctuation-only lines excluded), about 98% of them inside a single declaration: GTIRBLoader (16-772). The bar is 500 significant lines; this is 57 over it, 1.11× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
FileTooLong: procedure_summaries/Predicate.scala src/main/scala/analysis/procedure_summaries/Predicate.scala— FileTooLong — 546 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 46 over it, 1.09× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: ir/Program.scala src/main/scala/ir/Program.scala— FileTooLong — 521 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 21 over it, 1.04× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: eval/Interpreter.scala src/main/scala/ir/eval/Interpreter.scala— FileTooLong — 504 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 4 over it, 1.01× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
XxxComment src/test/scala/PCTrackingTest.scala:54— // XXX: test broken until .gts files are updated with fixed PC offsets — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
XxxComment src/test/scala/PCTrackingTest.scala:68— // XXX: test broken until .gts files are updated with fixed PC offsets — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
XxxComment src/test/scala/SystemTests.scala:167— // XXX likely not thread-safe — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
XxxComment src/test/scala/ir/ToScalaTest.scala:26— // XXX: work around https://github.com/scala/scala3/issues/23578 / https://github.com/scala/scala3/issues/22968
XxxComment src/main/scala/ir/Statement.scala:27— // XXX: hack to allow overriding a "mutable" "variable" — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
XxxComment src/main/scala/ir/parsing/BasilEarlyBNFCVisitor.scala:55— // XXX: be aware of foldRight and merge order. foldRight means that to keep the original order, — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
XxxComment src/main/scala/ir/dsl/IRToDSL.scala:32— // XXX: be aware of ordering, .map() on a SortedMap may return a HashMap. — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
XxxComment src/main/scala/ir/dsl/ProgramToScala.scala:113— // XXX: using a Seq here allows the size to be known, avoiding excessive splitting. — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
XxxComment src/main/scala/ir/dsl/StatementToScala.scala:79— // XXX: order changed in DirectCall params — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
XxxComment src/main/scala/gtirb/GTIRBReadELF.scala:332— // XXX: account for gtsrelf moving the bss_start symbols to .bss in certain binaries on certain compilers. — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
XxxComment src/main/scala/gtirb/GTIRBResolver.scala:82— // XXX: forwarded object symbols correspond to R_AARCH64_COPY relocations. — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
FixmeComment src/main/scala/translating/offlineLifter/InstructionBuilder.scala:87— // FIXME: shouldn't need always clear — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
FixmeComment src/main/scala/translating/offlineLifter/InstructionBuilder.scala:323— // FIXME: make global boolean when merged — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
FixmeComment src/main/scala/ir/transforms/ReplaceReturn.scala:146— // FIXME: Main will often maintain the stack by loading R30 from the caller's stack frame — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
FixmeComment src/main/scala/ir/transforms/Simp.scala:888— // FIXME: .filterNot(p.mainProcedure == _). is a bad hack to fix tests that refer to variabels in requries spec — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
FixmeComment src/main/scala/ir/transforms/Simp.scala:2038— // fixme: is this all the cleanup is doing? — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
FixmeComment src/main/scala/ir/transforms/StackSubstituter.scala:10— // FIXME: does this break for programs with loops? need to calculate a fixed-point? — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
FixmeComment src/main/scala/ir/transforms/validate/SSADAG.scala:27— // FIXME: should probably go in the ackermann pass? — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
FixmeComment src/main/scala/ir/transforms/validate/TranslationValidate.scala:293— // FIXME: this is a huge mess -- isPost; subtle as it can introduce soundness issues — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
FixmeComment src/main/scala/ir/transforms/validate/TranslationValidate.scala:860— // FIXME: seq — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
FixmeComment src/main/scala/analysis/rely_guarantee_generation/RelyGuaranteeGeneration.scala:97— // fixme: derive transitive closure for this rely??? — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
FixmeComment src/main/scala/analysis/rely_guarantee_generation/RelyGuaranteeGeneration.scala:165— // fixme: these should not be printed to stdout — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
Duplicated block (5 lines × 2) src/main/scala/analysis/InterLiveVarsAnalysis.scala:66— src/main/scala/analysis/InterLiveVarsAnalysis.scala:66-70 | src/main/scala/analysis/InterLiveVarsAnalysis.scala:100-104 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/main/scala/analysis/InterLiveVarsAnalysis.scala:66` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (5 lines × 2) src/main/scala/analysis/KnownBits.scala:240— src/main/scala/analysis/KnownBits.scala:240-244 | src/main/scala/analysis/KnownBits.scala:272-278 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/main/scala/analysis/KnownBits.scala:240` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (5 lines × 2) src/main/scala/analysis/data_structure_analysis/IntervalDSA.scala:1223— src/main/scala/analysis/data_structure_analysis/IntervalDSA.scala:1223-1227 | src/main/scala/analysis/data_structure_analysis/IntervalDSA.scala:1240-1245 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/main/scala/analysis/data_structure_analysis/IntervalDSA.scala:1223` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. 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 — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (5 lines × 2) src/main/scala/analysis/data_structure_analysis/SymbolicAddressAnalysis.scala:127— src/main/scala/analysis/data_structure_analysis/SymbolicAddressAnalysis.scala:127-133 | src/main/scala/analysis/data_structure_analysis/SymbolicAddressAnalysis.scala:140-144 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/main/scala/analysis/data_structure_analysis/SymbolicAddressAnalysis.scala:127` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it.
Duplicated block (5 lines × 2) src/main/scala/analysis/procedure_summaries/Predicate.scala:392— src/main/scala/analysis/procedure_summaries/Predicate.scala:392-396 | src/main/scala/analysis/procedure_summaries/Predicate.scala:404-408 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/main/scala/analysis/procedure_summaries/Predicate.scala:392` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (5 lines × 2) src/main/scala/translating/GTIRBLoader.scala:489— src/main/scala/translating/GTIRBLoader.scala:489-493 | src/main/scala/translating/GTIRBLoader.scala:497-501 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/main/scala/translating/GTIRBLoader.scala:489` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (5 lines × 2) src/main/scala/translating/GTIRBLoader.scala:506— src/main/scala/translating/GTIRBLoader.scala:506-510 | src/main/scala/translating/GTIRBLoader.scala:521-525 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/main/scala/translating/GTIRBLoader.scala:506` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (5 lines × 2) src/main/scala/analysis/solvers/DSAUnionFindSolver.scala:44— src/main/scala/analysis/solvers/DSAUnionFindSolver.scala:44-48 | src/main/scala/analysis/solvers/OffsetUnionFindSolver.scala:45-49 — 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 — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (5 lines × 2) src/main/scala/analysis/TaintAnalysis.scala:27— src/main/scala/analysis/TaintAnalysis.scala:27-31 | src/main/scala/analysis/TaintAnalysis.scala:41-45 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (5 lines × 2) src/main/scala/analysis/procedure_summaries/Predicate.scala:416— src/main/scala/analysis/procedure_summaries/Predicate.scala:416-420 | src/main/scala/analysis/procedure_summaries/Predicate.scala:428-432 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/main/scala/analysis/procedure_summaries/Predicate.scala:416` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (5 lines × 2) src/main/scala/analysis/procedure_summaries/Predicate.scala:441— src/main/scala/analysis/procedure_summaries/Predicate.scala:441-445 | src/main/scala/analysis/procedure_summaries/Predicate.scala:450-454 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
TooManyMethods: LifterIFace src/main/scala/translating/offlineLifter/InstructionBuilder.scala:19— TooManyMethods — 132 methods. The bar is 30 methods; this is 102 over it, 4.40× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: BitVectorEval src/main/scala/ir/eval/BitVectorEval.scala:4— TooManyMethods — 42 methods. The bar is 30 methods; this is 12 over it, 1.40× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: IntervalGraph src/main/scala/analysis/data_structure_analysis/IntervalDSA.scala:26— TooManyMethods — 41 methods. The bar is 30 methods; this is 11 over it, 1.37× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: BAPLoader src/main/scala/translating/BAPLoader.scala:11— TooManyMethods — 36 methods. The bar is 30 methods; this is 6 over it, 1.20× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: Procedure src/main/scala/ir/Program.scala:279— TooManyMethods — 35 methods. The bar is 30 methods; this is 5 over it, 1.17× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: GTIRBLoader src/main/scala/translating/GTIRBLoader.scala:16— TooManyMethods — 35 methods. The bar is 30 methods; this is 5 over it, 1.17× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
Low cohesion: BasilIRPrettyPrinter (LCOM4 14) src/main/scala/translating/PrettyPrinter.scala:154— BasilIRPrettyPrinter's methods fall into 14 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable — your repository's bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 14 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
Low cohesion: BlockBNFCVisitor (LCOM4 9) src/main/scala/ir/parsing/BlockBNFCVisitor.scala:20— BlockBNFCVisitor's methods fall into 9 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable — your repository's bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 9 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
Low cohesion: ExprBNFCVisitor (LCOM4 6) src/main/scala/ir/parsing/ExprBNFCVisitor.scala:11— ExprBNFCVisitor's methods fall into 6 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable — your repository's bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 6 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
Low cohesion: Procedure (LCOM4 4) src/main/scala/ir/Program.scala:279— Procedure's methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable — your repository's bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
Low cohesion: Block (LCOM4 4) src/main/scala/ir/Program.scala:606— Block's methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable — your repository's bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
Low cohesion: GTIRBToIR (LCOM4 4) src/main/scala/translating/GTIRBToIR.scala:58— GTIRBToIR's methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable — your repository's bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
Duplicated block (7 lines × 2) src/main/scala/analysis/data_structure_analysis/Graph.scala:918— src/main/scala/analysis/data_structure_analysis/Graph.scala:918-924 | src/main/scala/analysis/data_structure_analysis/Graph.scala:927-933 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (7 lines × 2) src/main/scala/ir/transforms/AbsInt.scala:332— src/main/scala/ir/transforms/AbsInt.scala:332-338 | src/main/scala/ir/transforms/AbsInt.scala:363-369 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/main/scala/ir/transforms/AbsInt.scala:332` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (7 lines × 2) src/main/scala/translating/BAPLoader.scala:115— src/main/scala/translating/BAPLoader.scala:115-121 | src/main/scala/translating/BAPLoader.scala:126-132 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (7 lines × 2) src/main/scala/analysis/IntraLiveVarsAnalysis.scala:27— src/main/scala/analysis/IntraLiveVarsAnalysis.scala:27-33 | src/main/scala/ir/transforms/Simp.scala:144-150 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `src/main/scala/analysis/IntraLiveVarsAnalysis.scala:27` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (7 lines × 2) src/main/scala/ir/transforms/Simp.scala:135— src/main/scala/ir/transforms/Simp.scala:135-141 | src/main/scala/ir/transforms/validate/TranslationValidate.scala:245-251 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `src/main/scala/ir/transforms/Simp.scala:135` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication· Edited copy of a member (8 corresponding lines) · ×4
Edited copy of a member (8 corresponding lines) src/main/scala/analysis/procedure_summaries/Predicate.scala:416— src/main/scala/analysis/procedure_summaries/Predicate.scala:416-423 | src/main/scala/analysis/procedure_summaries/Predicate.scala:428-435 — These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (8 corresponding lines) src/main/scala/analysis/procedure_summaries/Predicate.scala:392— src/main/scala/analysis/procedure_summaries/Predicate.scala:392-399 | src/main/scala/analysis/procedure_summaries/Predicate.scala:404-411 — These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (8 corresponding lines) src/main/scala/ir/parsing/BasilEarlyBNFCVisitor.scala:147— src/main/scala/ir/parsing/BasilEarlyBNFCVisitor.scala:147-159 | src/main/scala/ir/parsing/BasilEarlyBNFCVisitor.scala:161-168 — These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (8 corresponding lines) src/main/scala/analysis/Lattice.scala:643— src/main/scala/analysis/Lattice.scala:643-650 | src/main/scala/analysis/Lattice.scala:661-668 — These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Duplicated block (10 lines × 2) src/main/scala/analysis/InterLiveVarsAnalysis.scala:113— src/main/scala/analysis/InterLiveVarsAnalysis.scala:113-122 | src/main/scala/analysis/InterLiveVarsAnalysis.scala:126-135 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/main/scala/analysis/InterLiveVarsAnalysis.scala:113` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (10 lines × 2) src/main/scala/analysis/RegionInjector.scala:37— src/main/scala/analysis/RegionInjector.scala:37-46 | src/main/scala/analysis/RegionInjector.scala:205-214 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/main/scala/analysis/RegionInjector.scala:37` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (10 lines × 2) src/main/scala/boogie/BVisitor.scala:63— src/main/scala/boogie/BVisitor.scala:63-72 | src/main/scala/boogie/BVisitor.scala:87-96 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any `return` inside it is the body's own exit and keeps its meaning in the moved unit.
Duplicated block (10 lines × 2) src/main/scala/boogie/BVisitor.scala:117— src/main/scala/boogie/BVisitor.scala:117-126 | src/main/scala/boogie/BVisitor.scala:129-138 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any `return` inside it is the body's own exit and keeps its meaning in the moved unit.
Duplicated block (6 lines × 2) src/main/scala/analysis/procedure_summaries/Predicate.scala:120— src/main/scala/analysis/procedure_summaries/Predicate.scala:120-125 | src/main/scala/analysis/procedure_summaries/Predicate.scala:239-244 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/main/scala/analysis/procedure_summaries/Predicate.scala:120` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (6 lines × 2) src/main/scala/analysis/LatticeCollections.scala:352— src/main/scala/analysis/LatticeCollections.scala:352-357 | src/main/scala/analysis/LatticeCollections.scala:371-376 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/main/scala/analysis/LatticeCollections.scala:352` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (6 lines × 2) src/main/scala/ir/transforms/Simp.scala:1247— src/main/scala/ir/transforms/Simp.scala:1247-1252 | src/main/scala/ir/transforms/Simp.scala:1256-1261 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/main/scala/ir/transforms/Simp.scala:1247` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (6 lines × 2) src/main/scala/analysis/Lattice.scala:215— src/main/scala/analysis/Lattice.scala:215-220 | src/main/scala/analysis/Lattice.scala:236-241 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/main/scala/analysis/Lattice.scala:215` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
MethodTooLong: RunUtils.loadAndTranslate src/main/scala/util/RunUtils.scala:75— MethodTooLong — loadAndTranslate runs 170 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 70 over it, 1.70× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: TranslationValidator.processModel src/main/scala/ir/transforms/validate/TranslationValidate.scala:655— MethodTooLong — processModel runs 157 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 57 over it, 1.57× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: SSADAG.ssaTransform src/main/scala/ir/transforms/validate/SSADAG.scala:65— MethodTooLong — ssaTransform runs 120 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 20 over it, 1.20× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
ClassTooLong: Graph src/main/scala/analysis/data_structure_analysis/Graph.scala:30— ClassTooLong — 670 significant lines (blank, comment-only and punctuation-only lines excluded), 29 methods. The bar is 400 significant lines; this is 270 over it, 1.68× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
ClassTooLong: GTIRBToIR src/main/scala/translating/GTIRBToIR.scala:58— ClassTooLong — 567 significant lines (blank, comment-only and punctuation-only lines excluded), 23 methods. The bar is 400 significant lines; this is 167 over it, 1.42× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
ClassTooLong: GTIRBLoader src/main/scala/translating/GTIRBLoader.scala:16— ClassTooLong — 546 significant lines (blank, comment-only and punctuation-only lines excluded), 35 methods. The bar is 400 significant lines; this is 146 over it, 1.37× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
D4 · Code Duplication· Edited copy of a member (18 corresponding lines) · ×3
Edited copy of a member (18 corresponding lines) src/main/scala/translating/GTIRBLoader.scala:313— src/main/scala/translating/GTIRBLoader.scala:313-331 | src/main/scala/translating/GTIRBLoader.scala:700-717 — These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (18 corresponding lines) src/main/scala/analysis/procedure_summaries/Predicate.scala:459— src/main/scala/analysis/procedure_summaries/Predicate.scala:459-476 | src/main/scala/analysis/procedure_summaries/Predicate.scala:481-498 — These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (18 corresponding lines) scripts/tnum_test_z3.py:342— scripts/tnum_test_z3.py:342-361 | scripts/tnum_test_z3.py:364-381 — These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (11 corresponding lines) · ×3
Edited copy of a member (11 corresponding lines) src/main/scala/analysis/Lattice.scala:214— src/main/scala/analysis/Lattice.scala:214-224 | src/main/scala/analysis/Lattice.scala:235-245 — These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (11 corresponding lines) src/main/scala/analysis/data_structure_analysis/IntervalDSA.scala:1463— src/main/scala/analysis/data_structure_analysis/IntervalDSA.scala:1463-1474 | src/main/scala/analysis/data_structure_analysis/Utility.scala:27-37 — These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (11 corresponding lines) src/main/scala/analysis/GlobalRegionAnalysis.scala:102— src/main/scala/analysis/GlobalRegionAnalysis.scala:102-112 | src/main/scala/analysis/MemoryRegionAnalysis.scala:255-265 — These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (9 corresponding lines) · ×3
Edited copy of a member (9 corresponding lines) src/main/scala/analysis/NumericalDomains.scala:36— src/main/scala/analysis/NumericalDomains.scala:36-44 | src/main/scala/analysis/NumericalDomains.scala:46-57 — These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (9 corresponding lines) src/main/scala/analysis/solvers/DSAUnionFindSolver.scala:32— src/main/scala/analysis/solvers/DSAUnionFindSolver.scala:32-40 | src/main/scala/analysis/solvers/OffsetUnionFindSolver.scala:33-41 — These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (9 corresponding lines) src/main/scala/util/functional/State.scala:21— src/main/scala/util/functional/State.scala:21-29 | src/main/scala/util/functional/State.scala:31-39 — These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (4 corresponding lines) · ×3
Edited copy of a member (4 corresponding lines) src/main/scala/boogie/BExpr.scala:110— src/main/scala/boogie/BExpr.scala:110-113 | src/main/scala/ir/Expr.scala:119-122 — These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (4 corresponding lines) src/main/scala/boogie/BExpr.scala:143— src/main/scala/boogie/BExpr.scala:143-146 | src/main/scala/ir/Expr.scala:131-134 — These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (4 corresponding lines) src/main/scala/boogie/BExpr.scala:178— src/main/scala/boogie/BExpr.scala:178-181 | src/main/scala/ir/Expr.scala:143-146 — These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Duplicated block (9 lines × 2) src/main/scala/analysis/Lattice.scala:283— src/main/scala/analysis/Lattice.scala:283-291 | src/main/scala/analysis/Lattice.scala:376-384 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/main/scala/analysis/Lattice.scala:283` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (9 lines × 2) src/main/scala/analysis/LatticeCollections.scala:423— src/main/scala/analysis/LatticeCollections.scala:423-431 | src/main/scala/analysis/LatticeCollections.scala:452-460 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `src/main/scala/analysis/LatticeCollections.scala:432` calls `Bottom`, `BottomMap` and `src/main/scala/analysis/LatticeCollections.scala:461` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (9 lines × 2) src/main/scala/boogie/BExpr.scala:359— src/main/scala/boogie/BExpr.scala:359-367 | src/main/scala/ir/Expr.scala:239-247 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `src/main/scala/boogie/BExpr.scala:359` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
CopyProp.analyse (cognitive 16) src/main/scala/ir/transforms/Simp.scala:1332— CopyProp.analyse has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (8 pts), loops 2 (4 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 7). 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.
CopyProp.analyse (cognitive 16) src/main/scala/ir/transforms/Simp.scala:1463— CopyProp.analyse has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (8 pts), loops 2 (4 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 7). 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.
Change-coupling hub: RunUtils.scala → Analysis.scala, Dependencies.scala, InterLiveVarsAnalysis.scala, InterprocSteensgaardAnalysis.scala, IntraLiveVarsAnalysis.scala, Lattice.scala, MemoryRegionAnalysis.scala, ReachingDefinitionsAnalysis.scala, TaintAnalysis.scala, VSA.scala, IDESolver.scala, MonotonicSolver.scala, AbsInt.scala, DynamicSingleAssignment.scala, IndirectCallResolution.scala, ProcedureParameters.scala, ReplaceReturn.scala, BAPToIR.scala, GTIRBToIR.scala, SpecificationLoader.scala src/main/scala/util/RunUtils.scala— `src/main/scala/util/RunUtils.scala` changes together with 20 other files — `src/main/scala/analysis/Analysis.scala`, `src/main/scala/analysis/Dependencies.scala`, `src/main/scala/analysis/InterLiveVarsAnalysis.scala`, `src/main/scala/analysis/InterprocSteensgaardAnalysis.scala`, `src/main/scala/analysis/IntraLiveVarsAnalysis.scala`, `src/main/scala/analysis/Lattice.scala`, `src/main/scala/analysis/MemoryRegionAnalysis.scala`, `src/main/scala/analysis/ReachingDefinitionsAnalysis.scala`, `src/main/scala/analysis/TaintAnalysis.scala`, `src/main/scala/analysis/VSA.scala`, `src/main/scala/analysis/solvers/IDESolver.scala`, `src/main/scala/analysis/solvers/MonotonicSolver.scala`, `src/main/scala/ir/transforms/AbsInt.scala`, `src/main/scala/ir/transforms/DynamicSingleAssignment.scala`, `src/main/scala/ir/transforms/IndirectCallResolution.scala`, `src/main/scala/ir/transforms/ProcedureParameters.scala`, `src/main/scala/ir/transforms/ReplaceReturn.scala`, `src/main/scala/translating/BAPToIR.scala`, `src/main/scala/translating/GTIRBToIR.scala`, `src/main/scala/translating/SpecificationLoader.scala` — none of which declares a dependency on it: one file is the hub of 20 separate couplings, not 20 unrelated pairs. Read the hub first: if the others each duplicate a part of what it does, the shared concern belongs in ONE unit and extracting it clears every edge at once; if the hub is a registry, dispatcher or barrel that must name each of them, the coupling is structural and the question is whether that list can be discovered instead of enumerated. Fixing the hub is one change; breaking the couplings one pair at a time is 20.
Change-coupling hub: MemoryRegionAnalysis.scala → GlobalRegionAnalysis.scala, InterprocSteensgaardAnalysis.scala, ReachingDefinitionsAnalysis.scala src/main/scala/analysis/MemoryRegionAnalysis.scala— `src/main/scala/analysis/MemoryRegionAnalysis.scala` changes together with 3 other files — `src/main/scala/analysis/GlobalRegionAnalysis.scala`, `src/main/scala/analysis/InterprocSteensgaardAnalysis.scala`, `src/main/scala/analysis/ReachingDefinitionsAnalysis.scala` — none of which declares a dependency on it: one file is the hub of 3 separate couplings, not 3 unrelated pairs. Read the hub first: if the others each duplicate a part of what it does, the shared concern belongs in ONE unit and extracting it clears every edge at once; if the hub is a registry, dispatcher or barrel that must name each of them, the coupling is structural and the question is whether that list can be discovered instead of enumerated. Fixing the hub is one change; breaking the couplings one pair at a time is 3.
Change coupling: InterprocSteensgaardAnalysis.scala ↔ ReachingDefinitionsAnalysis.scala src/main/scala/analysis/InterprocSteensgaardAnalysis.scala:1— `src/main/scala/analysis/InterprocSteensgaardAnalysis.scala` and `src/main/scala/analysis/ReachingDefinitionsAnalysis.scala` change together 59% of the time (10 of the 17 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets). They sit in the same directory, and in this ecosystem sibling files there normally share one namespace/package — so a direct reference between them needs no import and this pass cannot see whether one exists. Read the pair before acting: if one file only DECLARES what the other consumes (a constants/types file beside its user), the co-change is definitional and the question is whether the split earns its keep; if they duplicate structure, extract the common part into a shared function or type they both call; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 10 shared commits counted here, the most recent 3 are `5cd956d9` Heap tracking and Work on Points-to; `733cd0bb` Added GRA; `846b020c` Changes in MRA and made Reaching def interproc — run `git show` on any of them.
Change coupling: VSA.scala ↔ MonotonicSolver.scala src/main/scala/analysis/VSA.scala:1— `src/main/scala/analysis/VSA.scala` and `src/main/scala/analysis/solvers/MonotonicSolver.scala` change together 50% of the time (8 of the 16 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency — the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE — the registration is the link, and it is meant not to be an import — and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 8 shared commits counted here, the most recent 3 are `d727ef75` clean up monotonic solver; `fb952660` clean up inter/intra in analysis; `6dde74ea` more explicit analysis types — run `git show` on any of them.
D4 · Code Duplication· Edited copy of a member (17 corresponding lines) · ×2
Edited copy of a member (17 corresponding lines) src/main/scala/analysis/LatticeCollections.scala:349— src/main/scala/analysis/LatticeCollections.scala:349-365 | src/main/scala/analysis/LatticeCollections.scala:368-384 — These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (17 corresponding lines) src/main/scala/ir/transforms/Simp.scala:1370— src/main/scala/ir/transforms/Simp.scala:1370-1386 | src/main/scala/ir/transforms/Simp.scala:1499-1515 — These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (13 corresponding lines) · ×2
Edited copy of a member (13 corresponding lines) src/main/scala/ir/eval/Interpreter.scala:426— src/main/scala/ir/eval/Interpreter.scala:426-444 | src/main/scala/ir/eval/Interpreter.scala:561-573 — These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (13 corresponding lines) src/main/scala/ir/eval/BitVectorEval.scala:217— src/main/scala/ir/eval/BitVectorEval.scala:217-229 | src/main/scala/ir/eval/BitVectorEval.scala:247-259 — These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (7 corresponding lines) · ×2
Edited copy of a member (7 corresponding lines) src/main/scala/analysis/NumericalDomains.scala:87— src/main/scala/analysis/NumericalDomains.scala:87-93 | src/main/scala/analysis/NumericalDomains.scala:96-104 — These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (7 corresponding lines) src/main/scala/ir/transforms/Simp.scala:1246— src/main/scala/ir/transforms/Simp.scala:1246-1252 | src/main/scala/ir/transforms/Simp.scala:1255-1261 — These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (10 corresponding lines) · ×2
Edited copy of a member (10 corresponding lines) src/main/scala/translating/BAPLoader.scala:114— src/main/scala/translating/BAPLoader.scala:114-123 | src/main/scala/translating/BAPLoader.scala:125-134 — These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (10 corresponding lines) src/main/scala/analysis/Lattice.scala:443— src/main/scala/analysis/Lattice.scala:443-452 | src/main/scala/analysis/Lattice.scala:454-463 — These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (6 corresponding lines) · ×2
Edited copy of a member (6 corresponding lines) src/main/scala/ir/parsing/BlockBNFCVisitor.scala:84— src/main/scala/ir/parsing/BlockBNFCVisitor.scala:84-89 | src/main/scala/ir/parsing/BlockBNFCVisitor.scala:92-97 — These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (6 corresponding lines) src/main/scala/translating/BAPLoader.scala:231— src/main/scala/translating/BAPLoader.scala:231-236 | src/main/scala/translating/BAPLoader.scala:238-243 — These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Predicate.simplify (cyclomatic 71) src/main/scala/analysis/procedure_summaries/Predicate.scala:538— Predicate.simplify has cyclomatic complexity 71 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
Main.configOfArgs (cyclomatic 62) src/main/scala/Main.scala:277— Main.configOfArgs has cyclomatic complexity 62 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
GTIRBLoader.visitExprTApply (cyclomatic 59) src/main/scala/translating/GTIRBLoader.scala:333— GTIRBLoader.visitExprTApply has cyclomatic complexity 59 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
BAPToIR.translateExpr (cyclomatic 46) src/main/scala/translating/BAPToIR.scala:247— BAPToIR.translateExpr has cyclomatic complexity 46 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
InterpFuns.interpretStatement (cyclomatic 44) src/main/scala/ir/eval/InterpretBasilIR.scala:376— InterpFuns.interpretStatement has cyclomatic complexity 44 (threshold 15). 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.
SpecFixer.convVarToOld (cyclomatic 42) src/main/scala/ir/transforms/ProcedureParameters.scala:599— SpecFixer.convVarToOld has cyclomatic complexity 42 (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.
ValueSetLattice.applyOp (cyclomatic 40) src/main/scala/analysis/Lattice.scala:313— ValueSetLattice.applyOp has cyclomatic complexity 40 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
TypeChecker.vexpr (cyclomatic 40) src/main/scala/ir/invariant/Typecheck.scala:65— TypeChecker.vexpr has cyclomatic complexity 40 (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.
IntervalDomain.fromPred (cyclomatic 38) src/main/scala/analysis/NumericalDomains.scala:191— IntervalDomain.fromPred has cyclomatic complexity 38 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
TranslationValidator.processModel (cyclomatic 35) src/main/scala/ir/transforms/validate/TranslationValidate.scala:655— TranslationValidator.processModel has cyclomatic complexity 35 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
LiveVarsAnalysisFunctions.edgesOther (cyclomatic 32) src/main/scala/analysis/InterLiveVarsAnalysis.scala:59— LiveVarsAnalysisFunctions.edgesOther has cyclomatic complexity 32 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
SymbolicAddressFunctions.edgesOther (cyclomatic 32) src/main/scala/analysis/data_structure_analysis/SymbolicAddressAnalysis.scala:100— SymbolicAddressFunctions.edgesOther has cyclomatic complexity 32 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
InterpFuns.callProcedure (cyclomatic 31) src/main/scala/ir/eval/InterpretBasilIR.scala:626— InterpFuns.callProcedure has cyclomatic complexity 31 (threshold 15). 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.
LocalPhase.visit (cyclomatic 29) src/main/scala/analysis/data_structure_analysis/LocalPhase.scala:231— LocalPhase.visit has cyclomatic complexity 29 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
RunUtils.loadAndTranslate (cyclomatic 28) src/main/scala/util/RunUtils.scala:75— RunUtils.loadAndTranslate has cyclomatic complexity 28 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
TypeChecker.vstmt (cyclomatic 26) src/main/scala/ir/invariant/Typecheck.scala:131— TypeChecker.vstmt 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.
ProcVariableDependencyAnalysisFunctions.edgesOther (cyclomatic 25) src/main/scala/analysis/VariableDependencyAnalysis.scala:173— ProcVariableDependencyAnalysisFunctions.edgesOther has cyclomatic complexity 25 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
CILVisitorImpl.visit_expr (cyclomatic 25) src/main/scala/ir/cilvisitor/CILVisitor.scala:96— CILVisitorImpl.visit_expr has cyclomatic complexity 25 (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.
InterpFuns.initialState (cyclomatic 24) src/main/scala/ir/eval/InterpretBasilIR.scala:549— InterpFuns.initialState has cyclomatic complexity 24 (threshold 15). 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.
CopyProp.DSACopyProp (cyclomatic 24) src/main/scala/ir/transforms/Simp.scala:1682— CopyProp.DSACopyProp has cyclomatic complexity 24 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
Ackermann.instantiateAxioms (cyclomatic 24) src/main/scala/ir/transforms/validate/Ackermann.scala:291— Ackermann.instantiateAxioms has cyclomatic complexity 24 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
RememberBreakpoints.getNext (cyclomatic 22) src/main/scala/ir/eval/InterpretBreakpoints.scala:35— RememberBreakpoints.getNext has cyclomatic complexity 22 (threshold 15). 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.
IntrinsicImpl.printf (cyclomatic 22) src/main/scala/ir/eval/Interpreter.scala:507— IntrinsicImpl.printf has cyclomatic complexity 22 (threshold 15). 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.
MemoryTransform.vstmt (cyclomatic 22) src/main/scala/ir/transforms/MemoryTransform.scala:33— MemoryTransform.vstmt 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.
SSADAG.ssaTransform (cyclomatic 22) src/main/scala/ir/transforms/validate/SSADAG.scala:65— SSADAG.ssaTransform 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.
MemoryModelMap.logRegions (cyclomatic 21) src/main/scala/analysis/MemoryModelMap.scala:385— MemoryModelMap.logRegions has cyclomatic complexity 21 (threshold 15). 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.
Graph.mergeCells (cyclomatic 21) src/main/scala/analysis/data_structure_analysis/Graph.scala:608— Graph.mergeCells has cyclomatic complexity 21 (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.
worklistSolver.solve (cyclomatic 21) src/main/scala/ir/transforms/AbsInt.scala:168— worklistSolver.solve has cyclomatic complexity 21 (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.
BlockyProp.vstmt (cyclomatic 20) src/main/scala/ir/transforms/Simp.scala:1550— BlockyProp.vstmt has cyclomatic complexity 20 (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.
BAPToIR.handleAtomicSections (cyclomatic 20) src/main/scala/translating/BAPToIR.scala:106— BAPToIR.handleAtomicSections has cyclomatic complexity 20 (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.
GTIRBToIR.handleMultipleEdges (cyclomatic 20) src/main/scala/translating/GTIRBToIR.scala:653— GTIRBToIR.handleMultipleEdges has cyclomatic complexity 20 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions.
IRToBoogie.translate (cyclomatic 20) src/main/scala/translating/IRToBoogie.scala:862— IRToBoogie.translate has cyclomatic complexity 20 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
FormulaConverter.convertBoolExpr (cyclomatic 20) src/main/scala/util/smt/SMT.scala:326— FormulaConverter.convertBoolExpr has cyclomatic complexity 20 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
ProcVariableDependencyAnalysisFunctions.edgesCallToAfterCall (cyclomatic 19) src/main/scala/analysis/VariableDependencyAnalysis.scala:98— ProcVariableDependencyAnalysisFunctions.edgesCallToAfterCall has cyclomatic complexity 19 (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.
BAPToIR.translate (cyclomatic 19) src/main/scala/translating/BAPToIR.scala:17— BAPToIR.translate has cyclomatic complexity 19 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions.
IRToBoogie.functionOpToDefinition (cyclomatic 19) src/main/scala/translating/IRToBoogie.scala:448— IRToBoogie.functionOpToDefinition has cyclomatic complexity 19 (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.
InterpFuns.interpretJump (cyclomatic 17) src/main/scala/ir/eval/InterpretBasilIR.scala:315— InterpFuns.interpretJump has cyclomatic complexity 17 (threshold 15). 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.
GTIRBToIR.handleSingleEdge (cyclomatic 17) src/main/scala/translating/GTIRBToIR.scala:525— GTIRBToIR.handleSingleEdge 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.
SASILattice.lub (cyclomatic 16) src/main/scala/analysis/Lattice.scala:127— SASILattice.lub has cyclomatic complexity 16 (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.
MemoryModelMap.add (cyclomatic 16) src/main/scala/analysis/MemoryModelMap.scala:99— MemoryModelMap.add has cyclomatic complexity 16 (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.
GenericLogger.writeLog (cyclomatic 16) src/main/scala/util/Logging.scala:100— GenericLogger.writeLog has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
HackComment src/main/scala/analysis/CommonDefinitionVariableRenaming.scala:44— // hack to get unreachable nodes in the visit order — a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there.
InterpFuns.initialState (cognitive 276) src/main/scala/ir/eval/InterpretBasilIR.scala:549— InterpFuns.initialState has cognitive complexity 276 (threshold 15). Drivers by points: loops 23 (276 pts) (nesting depth added 253). 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. This file is where this pass's cognitive complexity CONCENTRATES: src/main/scala/ir/eval/InterpretBasilIR.scala holds 9 of the 87 methods over the threshold — including the worst — and 442 of the 1627 points over it (27%), 4.3× the next-largest file (src/main/scala/translating/BAPToIR.scala at 103). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
InterpFuns.interpretStatement (cognitive 113) src/main/scala/ir/eval/InterpretBasilIR.scala:376— InterpFuns.interpretStatement has cognitive complexity 113 (threshold 15). Drivers by points: loops 27 (90 pts), if/else 7 (12 pts), match/switch 3 (11 pts) (nesting depth added 76). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident. This file is where this pass's cognitive complexity CONCENTRATES: src/main/scala/ir/eval/InterpretBasilIR.scala holds 9 of the 87 methods over the threshold — including the worst — and 442 of the 1627 points over it (27%), 4.3× the next-largest file (src/main/scala/translating/BAPToIR.scala at 103). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
RememberBreakpoints.getNext (cognitive 112) src/main/scala/ir/eval/InterpretBreakpoints.scala:35— RememberBreakpoints.getNext has cognitive complexity 112 (threshold 15). Drivers by points: loops 10 (51 pts), if/else 10 (41 pts), match/switch 4 (20 pts) (nesting depth added 88). 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.
Predicate.simplify (cognitive 74) src/main/scala/analysis/procedure_summaries/Predicate.scala:538— Predicate.simplify has cognitive complexity 74 (threshold 15). Drivers by points: if/else 21 (35 pts), match/switch 8 (23 pts), loops 6 (16 pts) (nesting depth added 39). 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.
TranslationValidator.processModel (cognitive 66) src/main/scala/ir/transforms/validate/TranslationValidate.scala:655— TranslationValidator.processModel has cognitive complexity 66 (threshold 15). Drivers by points: match/switch 17 (36 pts), if/else 23 (26 pts), loops 3, boolean chains 1 (nesting depth added 22). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
ApiServer.generateIRAsync (cognitive 66) src/main/scala/server/ApiServer.scala:100— ApiServer.generateIRAsync has cognitive complexity 66 (threshold 15). Drivers by points: loops 11 (66 pts) (nesting depth added 55). 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.
InterpFuns.callProcedure (cognitive 61) src/main/scala/ir/eval/InterpretBasilIR.scala:626— InterpFuns.callProcedure has cognitive complexity 61 (threshold 15). Drivers by points: loops 11 (30 pts), match/switch 6 (17 pts), if/else 9 (13 pts), error handling 1 (nesting depth added 34). 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. This file is where this pass's cognitive complexity CONCENTRATES: src/main/scala/ir/eval/InterpretBasilIR.scala holds 9 of the 87 methods over the threshold — including the worst — and 442 of the 1627 points over it (27%), 4.3× the next-largest file (src/main/scala/translating/BAPToIR.scala at 103). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
SymbolicAddressFunctions.edgesOther (cognitive 58) src/main/scala/analysis/data_structure_analysis/SymbolicAddressAnalysis.scala:100— SymbolicAddressFunctions.edgesOther has cognitive complexity 58 (threshold 15). Drivers by points: match/switch 12 (34 pts), if/else 12 (23 pts), boolean chains 1 (nesting depth added 33). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
BAPToIR.handleAtomicSections (cognitive 57) src/main/scala/translating/BAPToIR.scala:106— BAPToIR.handleAtomicSections has cognitive complexity 57 (threshold 15). Drivers by points: if/else 16 (44 pts), match/switch 2 (7 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 35). 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.
TypeChecker.vexpr (cognitive 53) src/main/scala/ir/invariant/Typecheck.scala:65— TypeChecker.vexpr has cognitive complexity 53 (threshold 15). Drivers by points: if/else 34 (48 pts), match/switch 3 (5 pts) (nesting depth added 16). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
Main.configOfArgs (cognitive 52) src/main/scala/Main.scala:277— Main.configOfArgs has cognitive complexity 52 (threshold 15). Drivers by points: if/else 23 (25 pts), match/switch 12 (17 pts), boolean chains 9, loops 1 (nesting depth added 7). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
ProcVariableDependencyAnalysisFunctions.edgesCallToAfterCall (cognitive 50) src/main/scala/analysis/VariableDependencyAnalysis.scala:98— ProcVariableDependencyAnalysisFunctions.edgesCallToAfterCall has cognitive complexity 50 (threshold 15). Drivers by points: if/else 13 (26 pts), match/switch 7 (24 pts) (nesting depth added 30). 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.
LocalPhase.visit (cognitive 48) src/main/scala/analysis/data_structure_analysis/LocalPhase.scala:231— LocalPhase.visit has cognitive complexity 48 (threshold 15). Drivers by points: if/else 19 (25 pts), match/switch 8 (22 pts), boolean chains 1 (nesting depth added 20). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
MemoryTransform.vstmt (cognitive 47) src/main/scala/ir/transforms/MemoryTransform.scala:33— MemoryTransform.vstmt has cognitive complexity 47 (threshold 15). Drivers by points: if/else 21 (39 pts), boolean chains 6, match/switch 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.
GTIRBLoader.visitExprTApply (cognitive 46) src/main/scala/translating/GTIRBLoader.scala:333— GTIRBLoader.visitExprTApply has cognitive complexity 46 (threshold 15). Drivers by points: if/else 22 (38 pts), match/switch 5 (8 pts) (nesting depth added 19). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
IntrinsicImpl.printf (cognitive 42) src/main/scala/ir/eval/Interpreter.scala:507— IntrinsicImpl.printf has cognitive complexity 42 (threshold 15). Drivers by points: loops 8 (32 pts), match/switch 3 (8 pts), if/else 2 (nesting depth added 29). 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.
LiveVarsAnalysisFunctions.edgesOther (cognitive 40) src/main/scala/analysis/InterLiveVarsAnalysis.scala:59— LiveVarsAnalysisFunctions.edgesOther has cognitive complexity 40 (threshold 15). Drivers by points: if/else 11 (21 pts), match/switch 9 (17 pts), boolean chains 2 (nesting depth added 18). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
SSADAG.ssaTransform (cognitive 39) src/main/scala/ir/transforms/validate/SSADAG.scala:65— SSADAG.ssaTransform has cognitive complexity 39 (threshold 15). Drivers by points: if/else 15 (24 pts), match/switch 8 (11 pts), loops 2 (3 pts), boolean chains 1 (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.
Graph.mergeCells (cognitive 38) src/main/scala/analysis/data_structure_analysis/Graph.scala:608— Graph.mergeCells has cognitive complexity 38 (threshold 15). Drivers by points: if/else 22 (34 pts), boolean chains 4 (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.
IntrinsicImpl.fopen (cognitive 38) src/main/scala/ir/eval/Interpreter.scala:406— IntrinsicImpl.fopen has cognitive complexity 38 (threshold 15). Drivers by points: loops 8 (36 pts), if/else 1, match/switch 1 (nesting depth added 28). 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.
RunUtils.loadAndTranslate (cognitive 38) src/main/scala/util/RunUtils.scala:75— RunUtils.loadAndTranslate has cognitive complexity 38 (threshold 15). Drivers by points: if/else 22 (27 pts), boolean chains 4, loops 2 (4 pts), match/switch 2 (3 pts) (nesting depth added 8). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
SpecFixer.convVarToOld (cognitive 37) src/main/scala/ir/transforms/ProcedureParameters.scala:599— SpecFixer.convVarToOld has cognitive complexity 37 (threshold 15). Drivers by points: if/else 19 (32 pts), boolean chains 4, match/switch 1 (nesting depth added 13). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
BAPToIR.translate (cognitive 37) src/main/scala/translating/BAPToIR.scala:17— BAPToIR.translate has cognitive complexity 37 (threshold 15). Drivers by points: loops 8 (17 pts), if/else 9 (16 pts), boolean chains 3, match/switch 1 (nesting depth added 16). 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.
IRToBoogie.functionOpToDefinition (cognitive 37) src/main/scala/translating/IRToBoogie.scala:448— IRToBoogie.functionOpToDefinition has cognitive complexity 37 (threshold 15). Drivers by points: if/else 10 (19 pts), loops 4 (11 pts), match/switch 3 (6 pts), boolean chains 1 (nesting depth added 19). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
BAPToIR.translate (cognitive 35) src/main/scala/translating/BAPToIR.scala:424— BAPToIR.translate has cognitive complexity 35 (threshold 15). Drivers by points: if/else 10 (18 pts), match/switch 5 (15 pts), loops 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.
GTIRBToIR.createIR (cognitive 35) src/main/scala/translating/GTIRBToIR.scala:163— GTIRBToIR.createIR has cognitive complexity 35 (threshold 15). Drivers by points: if/else 10 (23 pts), loops 5 (9 pts), boolean chains 3 (nesting depth added 17). 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.
GTIRBToIR.cleanUpTemporary (cognitive 35) src/main/scala/translating/GTIRBToIR.scala:368— GTIRBToIR.cleanUpTemporary has cognitive complexity 35 (threshold 15). Drivers by points: if/else 14 (32 pts), match/switch 1 (2 pts), loops 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.
MemoryModelMap.logRegions (cognitive 34) src/main/scala/analysis/MemoryModelMap.scala:385— MemoryModelMap.logRegions has cognitive complexity 34 (threshold 15). Drivers by points: loops 11 (18 pts), if/else 8 (14 pts), match/switch 2 (nesting depth added 13). 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.
MemoryAttribData.fromAttrib (cognitive 34) src/main/scala/ir/parsing/Attrib.scala:341— MemoryAttribData.fromAttrib has cognitive complexity 34 (threshold 15). Drivers by points: loops 8 (34 pts) (nesting depth added 26). 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.
worklistSolver.solve (cognitive 34) src/main/scala/ir/transforms/AbsInt.scala:168— worklistSolver.solve has cognitive complexity 34 (threshold 15). Drivers by points: if/else 18 (25 pts), boolean chains 4, loops 2 (3 pts), match/switch 1 (2 pts) (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.
BAPToIR.translateExpr (cognitive 34) src/main/scala/translating/BAPToIR.scala:247— BAPToIR.translateExpr has cognitive complexity 34 (threshold 15). Drivers by points: if/else 14 (25 pts), match/switch 5 (9 pts) (nesting depth added 15). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
TypeChecker.vstmt (cognitive 32) src/main/scala/ir/invariant/Typecheck.scala:131— TypeChecker.vstmt has cognitive complexity 32 (threshold 15). Drivers by points: if/else 17 (24 pts), match/switch 4 (7 pts), loops 1 (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.
InterpFuns.interpretJump (cognitive 30) src/main/scala/ir/eval/InterpretBasilIR.scala:315— InterpFuns.interpretJump has cognitive complexity 30 (threshold 15). Drivers by points: loops 7 (20 pts), match/switch 3 (7 pts), if/else 2 (3 pts) (nesting depth added 18). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident. This file is where this pass's cognitive complexity CONCENTRATES: src/main/scala/ir/eval/InterpretBasilIR.scala holds 9 of the 87 methods over the threshold — including the worst — and 442 of the 1627 points over it (27%), 4.3× the next-largest file (src/main/scala/translating/BAPToIR.scala at 103). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
RegionInjectorDSA.injectRegions (cognitive 29) src/main/scala/analysis/RegionInjector.scala:203— RegionInjectorDSA.injectRegions has cognitive complexity 29 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 4 (8 pts), match/switch 1 (4 pts), boolean chains 1 (nesting depth added 17). 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.
CILVisitorImpl.visit_expr (cognitive 29) src/main/scala/ir/cilvisitor/CILVisitor.scala:96— CILVisitorImpl.visit_expr has cognitive complexity 29 (threshold 15). Drivers by points: if/else 18 (27 pts), boolean chains 1, match/switch 1 (nesting depth added 9). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
TraverseLoops.trav_loops_tailrec (cognitive 28) src/main/scala/analysis/IrreducibleLoops.scala:306— TraverseLoops.trav_loops_tailrec has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (20 pts), loops 2 (6 pts), boolean chains 1, match/switch 1 (nesting depth added 15). To reduce it, flatten the nesting: this score is depth rather than breadth — 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's 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.
ReplaceReturns.vstmt (cognitive 28) src/main/scala/ir/transforms/ReplaceReturn.scala:31— ReplaceReturns.vstmt has cognitive complexity 28 (threshold 15). Drivers by points: if/else 12 (20 pts), match/switch 4 (7 pts), boolean chains 1 (nesting depth added 11). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
MemoryModelMap.add (cognitive 27) src/main/scala/analysis/MemoryModelMap.scala:99— MemoryModelMap.add has cognitive complexity 27 (threshold 15). Drivers by points: if/else 14 (23 pts), boolean chains 2, match/switch 2 (nesting depth added 9). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
GTIRBToIR.handleSingleEdge (cognitive 27) src/main/scala/translating/GTIRBToIR.scala:525— GTIRBToIR.handleSingleEdge has cognitive complexity 27 (threshold 15). Drivers by points: if/else 18 (26 pts), match/switch 1 (nesting depth added 8). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
ProcVariableDependencyAnalysisFunctions.edgesExitToAfterCall (cognitive 25) src/main/scala/analysis/VariableDependencyAnalysis.scala:64— ProcVariableDependencyAnalysisFunctions.edgesExitToAfterCall has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (16 pts), match/switch 3 (9 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.
DataStructureAnalysis.analyze (cognitive 25) src/main/scala/analysis/data_structure_analysis/DataStructureAnalysis.scala:73— DataStructureAnalysis.analyze has cognitive complexity 25 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 4 (5 pts), match/switch 2 (5 pts), boolean chains 1 (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.
Node.cloneNode (cognitive 25) src/main/scala/analysis/data_structure_analysis/Utility.scala:105— Node.cloneNode has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (25 pts) (nesting depth added 13). To reduce it, flatten the nesting: this score is depth rather than breadth — 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's 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.
MemoryState.doStore (cognitive 25) src/main/scala/ir/eval/Interpreter.scala:304— MemoryState.doStore has cognitive complexity 25 (threshold 15). Drivers by points: loops 5 (14 pts), match/switch 2 (7 pts), if/else 3, boolean chains 1 (nesting depth added 14). 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.
GTIRBToIR.handleMultipleEdges (cognitive 25) src/main/scala/translating/GTIRBToIR.scala:653— GTIRBToIR.handleMultipleEdges has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (13 pts), match/switch 2 (5 pts), loops 2 (4 pts), boolean chains 3 (nesting depth added 8). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
IntervalNode.clone (cognitive 24) src/main/scala/analysis/data_structure_analysis/IntervalDSA.scala:661— IntervalNode.clone has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (18 pts), match/switch 1 (3 pts), loops 1 (2 pts), boolean chains 1 (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.
IntrinsicImpl.write (cognitive 24) src/main/scala/ir/eval/Interpreter.scala:424— IntrinsicImpl.write has cognitive complexity 24 (threshold 15). Drivers by points: loops 6 (21 pts), match/switch 1 (2 pts), if/else 1 (nesting depth added 16). 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.
IntrinsicImpl.malloc (cognitive 23) src/main/scala/ir/eval/Interpreter.scala:575— IntrinsicImpl.malloc has cognitive complexity 23 (threshold 15). Drivers by points: loops 6 (21 pts), if/else 1, match/switch 1 (nesting depth added 15). 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.
SymbolTableInfo.fromAttrib (cognitive 23) src/main/scala/ir/parsing/Attrib.scala:223— SymbolTableInfo.fromAttrib has cognitive complexity 23 (threshold 15). Drivers by points: loops 5 (15 pts), match/switch 2 (7 pts), if/else 1 (nesting depth added 15). 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.
MemoryRegionAnalysis.eval (cognitive 22) src/main/scala/analysis/MemoryRegionAnalysis.scala:202— MemoryRegionAnalysis.eval has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (13 pts), match/switch 3 (9 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.
IntervalDomain.eval (cognitive 22) src/main/scala/analysis/NumericalDomains.scala:153— IntervalDomain.eval has cognitive complexity 22 (threshold 15). Drivers by points: match/switch 6 (12 pts), if/else 8 (9 pts), boolean chains 1 (nesting depth added 7). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
ProcVariableDependencyAnalysisFunctions.edgesOther (cognitive 22) src/main/scala/analysis/VariableDependencyAnalysis.scala:173— ProcVariableDependencyAnalysisFunctions.edgesOther has cognitive complexity 22 (threshold 15). Drivers by points: match/switch 7 (19 pts), if/else 3 (nesting depth added 12). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
RelyGuaranteeGenerator.generate (cognitive 22) src/main/scala/analysis/rely_guarantee_generation/RelyGuaranteeGeneration.scala:81— RelyGuaranteeGenerator.generate has cognitive complexity 22 (threshold 15). Drivers by points: loops 6 (11 pts), if/else 3 (10 pts), boolean chains 1 (nesting depth added 12). 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.
SteensgaardIndirectCallResolution.searchRegion (cognitive 22) src/main/scala/ir/transforms/IndirectCallResolution.scala:30— SteensgaardIndirectCallResolution.searchRegion has cognitive complexity 22 (threshold 15). Drivers by points: match/switch 5 (15 pts), if/else 4 (6 pts), boolean chains 1 (nesting depth added 12). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
Eval.getNullTerminatedString (cognitive 21) src/main/scala/ir/eval/InterpretBasilIR.scala:256— Eval.getNullTerminatedString has cognitive complexity 21 (threshold 15). Drivers by points: loops 5 (15 pts), match/switch 2 (4 pts), if/else 2 (nesting depth added 12). 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. This file is where this pass's cognitive complexity CONCENTRATES: src/main/scala/ir/eval/InterpretBasilIR.scala holds 9 of the 87 methods over the threshold — including the worst — and 442 of the 1627 points over it (27%), 4.3× the next-largest file (src/main/scala/translating/BAPToIR.scala at 103). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
IntrinsicImpl.putc (cognitive 21) src/main/scala/ir/eval/Interpreter.scala:393— IntrinsicImpl.putc has cognitive complexity 21 (threshold 15). Drivers by points: loops 6 (21 pts) (nesting depth added 15). 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. This shape REPEATS in the file: one other method here (IntrinsicImpl.print) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
IntrinsicImpl.print (cognitive 21) src/main/scala/ir/eval/Interpreter.scala:559— IntrinsicImpl.print has cognitive complexity 21 (threshold 15). Drivers by points: loops 6 (21 pts) (nesting depth added 15). 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. This shape REPEATS in the file: one other method here (IntrinsicImpl.putc) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
CopyProp.DSACopyProp (cognitive 21) src/main/scala/ir/transforms/Simp.scala:1682— CopyProp.DSACopyProp has cognitive complexity 21 (threshold 15). Drivers by points: match/switch 4 (7 pts), if/else 6, loops 3 (5 pts), boolean chains 3 (nesting depth added 5). 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.
Eval.storeBV (cognitive 20) src/main/scala/ir/eval/InterpretBasilIR.scala:206— Eval.storeBV has cognitive complexity 20 (threshold 15). Drivers by points: loops 4 (10 pts), if/else 3 (5 pts), match/switch 2 (5 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. This file is where this pass's cognitive complexity CONCENTRATES: src/main/scala/ir/eval/InterpretBasilIR.scala holds 9 of the 87 methods over the threshold — including the worst — and 442 of the 1627 points over it (27%), 4.3× the next-largest file (src/main/scala/translating/BAPToIR.scala at 103). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
InterpFuns.initBSS (cognitive 20) src/main/scala/ir/eval/InterpretBasilIR.scala:732— InterpFuns.initBSS has cognitive complexity 20 (threshold 15). Drivers by points: loops 5 (15 pts), if/else 2 (4 pts), match/switch 1 (nesting depth added 12). 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. This file is where this pass's cognitive complexity CONCENTRATES: src/main/scala/ir/eval/InterpretBasilIR.scala holds 9 of the 87 methods over the threshold — including the worst — and 442 of the 1627 points over it (27%), 4.3× the next-largest file (src/main/scala/translating/BAPToIR.scala at 103). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
Ackermann.instantiateAxioms (cognitive 20) src/main/scala/ir/transforms/validate/Ackermann.scala:291— Ackermann.instantiateAxioms has cognitive complexity 20 (threshold 15). Drivers by points: loops 7 (8 pts), match/switch 6 (7 pts), if/else 3, boolean chains 2 (nesting depth added 2). 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.
Graph.cloneSelf (cognitive 19) src/main/scala/analysis/data_structure_analysis/Graph.scala:879— Graph.cloneSelf has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (16 pts), match/switch 2, loops 1 (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.
LibcIntrinsic.calloc (cognitive 19) src/main/scala/ir/eval/Interpreter.scala:340— LibcIntrinsic.calloc has cognitive complexity 19 (threshold 15). Drivers by points: loops 5 (15 pts), match/switch 1 (3 pts), if/else 1 (nesting depth added 12). 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.
IRToBoogie.translate (cognitive 19) src/main/scala/translating/IRToBoogie.scala:862— IRToBoogie.translate has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (10 pts), match/switch 5 (9 pts) (nesting depth added 8). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
FormulaConverter.convertBoolExpr (cognitive 19) src/main/scala/util/smt/SMT.scala:326— FormulaConverter.convertBoolExpr has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 6 (15 pts), if/else 4 (nesting depth added 9). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
SASILattice.lub (cognitive 18) src/main/scala/analysis/Lattice.scala:127— SASILattice.lub has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 4, match/switch 1 (nesting depth added 6). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
BinaryBExpr.getType (cognitive 18) src/main/scala/boogie/BExpr.scala:352— BinaryBExpr.getType has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (13 pts), match/switch 3 (5 pts) (nesting depth added 8). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
BinaryExpr.getType (cognitive 18) src/main/scala/ir/Expr.scala:231— BinaryExpr.getType has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (13 pts), match/switch 3 (5 pts) (nesting depth added 8). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
Eval.loadBV (cognitive 18) src/main/scala/ir/eval/InterpretBasilIR.scala:141— Eval.loadBV has cognitive complexity 18 (threshold 15). Drivers by points: loops 4 (10 pts), match/switch 2 (6 pts), if/else 2 (nesting depth added 10). 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. This file is where this pass's cognitive complexity CONCENTRATES: src/main/scala/ir/eval/InterpretBasilIR.scala holds 9 of the 87 methods over the threshold — including the worst — and 442 of the 1627 points over it (27%), 4.3× the next-largest file (src/main/scala/translating/BAPToIR.scala at 103). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
Eval.store (cognitive 18) src/main/scala/ir/eval/InterpretBasilIR.scala:180— Eval.store has cognitive complexity 18 (threshold 15). Drivers by points: loops 4 (10 pts), match/switch 2 (6 pts), boolean chains 1, if/else 1 (nesting depth added 10). 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. This file is where this pass's cognitive complexity CONCENTRATES: src/main/scala/ir/eval/InterpretBasilIR.scala holds 9 of the 87 methods over the threshold — including the worst — and 442 of the 1627 points over it (27%), 4.3× the next-largest file (src/main/scala/translating/BAPToIR.scala at 103). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
Substitute.vexpr (cognitive 18) src/main/scala/ir/transforms/Simp.scala:1857— Substitute.vexpr has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (8 pts), match/switch 2 (5 pts), loops 1 (3 pts), boolean chains 2 (nesting depth added 7). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
SASILattice.orderingOperator (cognitive 17) src/main/scala/analysis/Lattice.scala:105— SASILattice.orderingOperator has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 8, if/else 5 (7 pts), match/switch 1 (2 pts) (nesting depth added 3). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
IntervalDomain.fromPred (cognitive 17) src/main/scala/analysis/NumericalDomains.scala:191— IntervalDomain.fromPred has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 8, if/else 6 (8 pts), match/switch 1 (nesting depth added 2). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
ParamAnalysis.getProcParams (cognitive 17) src/main/scala/analysis/ParamAnalysis.scala:30— ParamAnalysis.getProcParams has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (10 pts), match/switch 1 (4 pts), boolean chains 3 (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.
IntervalDSA.dsa (cognitive 17) src/main/scala/analysis/data_structure_analysis/IntervalDSA.scala:970— IntervalDSA.dsa has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (14 pts), match/switch 1 (2 pts), boolean chains 1 (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.
OnePassDSA.fixSuccessors (cognitive 17) src/main/scala/ir/transforms/DynamicSingleAssignment.scala:189— OnePassDSA.fixSuccessors has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (13 pts), loops 2 (4 pts) (nesting depth added 11). 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.
BlockyProp.vstmt (cognitive 17) src/main/scala/ir/transforms/Simp.scala:1550— BlockyProp.vstmt has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (16 pts), match/switch 1 (nesting depth added 8). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
Ackermann.instantiateAxiomInstance (cognitive 17) src/main/scala/ir/transforms/validate/Ackermann.scala:230— Ackermann.instantiateAxiomInstance has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 5 (9 pts), loops 3 (6 pts), if/else 2 (nesting depth added 7). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
GlobalRegionAnalysis.checkIfDefined (cognitive 16) src/main/scala/analysis/GlobalRegionAnalysis.scala:124— GlobalRegionAnalysis.checkIfDefined has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 2 (nesting depth added 5). 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.
RegionInjectorMRA.injectRegions (cognitive 16) src/main/scala/analysis/RegionInjector.scala:35— RegionInjectorMRA.injectRegions has cognitive complexity 16 (threshold 15). Drivers by points: loops 5 (9 pts), if/else 3 (6 pts), boolean chains 1 (nesting depth added 7). 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.
ValueSetAnalysis.eval (cognitive 16) src/main/scala/analysis/VSA.scala:57— ValueSetAnalysis.eval has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 4 (9 pts), if/else 5 (7 pts) (nesting depth added 7). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
Graph.getGlobal (cognitive 16) src/main/scala/analysis/data_structure_analysis/Graph.scala:190— Graph.getGlobal has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 1 (3 pts) (nesting depth added 7). 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.
OnePassDSA.fixPredecessors (cognitive 16) src/main/scala/ir/transforms/DynamicSingleAssignment.scala:121— OnePassDSA.fixPredecessors has cognitive complexity 16 (threshold 15). Drivers by points: loops 3 (7 pts), if/else 5, match/switch 2 (3 pts), boolean chains 1 (nesting depth added 5). 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.
IndirectCallResolution.process (cognitive 16) src/main/scala/ir/transforms/IndirectCallResolution.scala:136— IndirectCallResolution.process has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (7 pts), match/switch 2 (5 pts), loops 1 (3 pts), boolean chains 1 (nesting depth added 7). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
GuardVisitor.substitute (cognitive 16) src/main/scala/ir/transforms/Simp.scala:664— GuardVisitor.substitute has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 3, match/switch 1 (3 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.
TransitionSystem.procToTransition (cognitive 16) src/main/scala/ir/transforms/validate/TransitionSystem.scala:46— TransitionSystem.procToTransition has cognitive complexity 16 (threshold 15). Drivers by points: loops 5 (9 pts), if/else 3, match/switch 2 (3 pts), boolean chains 1 (nesting depth added 5). 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.
D4 · Code Duplication· Members sharing a duplicated core (5 members, 50+ identical tokens) · ×1
Members sharing a duplicated core (5 members, 50+ identical tokens) src/main/scala/analysis/KnownBits.scala:294— src/main/scala/analysis/KnownBits.scala:294-315 | src/main/scala/analysis/KnownBits.scala:325-346 | src/main/scala/analysis/KnownBits.scala:350-371 | src/main/scala/analysis/KnownBits.scala:375-397 | src/main/scala/analysis/KnownBits.scala:414-445 — These 5 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 — 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 5 times. The repair is at the members' grain — 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 5 times.
D4 · Code Duplication· Edited copy of a member (39 corresponding lines) · ×1
Edited copy of a member (39 corresponding lines) src/main/scala/analysis/GammaDomains.scala:158— src/main/scala/analysis/GammaDomains.scala:158-196 | src/main/scala/analysis/GammaDomains.scala:232-276 — These two members are one piece of code written twice and then edited apart: 39 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (35 corresponding lines) · ×1
Edited copy of a member (35 corresponding lines) src/main/scala/boogie/BExpr.scala:352— src/main/scala/boogie/BExpr.scala:352-386 | src/main/scala/ir/Expr.scala:231-270 — These two members are one piece of code written twice and then edited apart: 35 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (25 corresponding lines) · ×1
Edited copy of a member (25 corresponding lines) src/main/scala/translating/GTIRBLoader.scala:203— src/main/scala/translating/GTIRBLoader.scala:203-227 | src/main/scala/translating/GTIRBLoader.scala:247-272 — These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (34 corresponding lines) · ×1
Edited copy of a member (34 corresponding lines) src/main/scala/ir/transforms/Simp.scala:1332— src/main/scala/ir/transforms/Simp.scala:1332-1366 | src/main/scala/ir/transforms/Simp.scala:1463-1496 — These two members are one piece of code written twice and then edited apart: 34 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copies of one member (3 members, 30+ corresponding lines) · ×1
Edited copies of one member (3 members, 30+ corresponding lines) src/main/scala/analysis/KnownBits.scala:195— src/main/scala/analysis/KnownBits.scala:195-224 | src/main/scala/analysis/KnownBits.scala:227-256 | src/main/scala/analysis/KnownBits.scala:259-290 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 30 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. 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. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D4 · Code Duplication· Edited copy of a member (16 corresponding lines) · ×1
Edited copy of a member (16 corresponding lines) src/main/scala/analysis/data_structure_analysis/IntervalDSA.scala:1221— src/main/scala/analysis/data_structure_analysis/IntervalDSA.scala:1221-1236 | src/main/scala/analysis/data_structure_analysis/IntervalDSA.scala:1238-1256 — These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copies of one member (4 members, 12+ corresponding lines) · ×1
Edited copies of one member (4 members, 12+ corresponding lines) src/main/scala/analysis/Lattice.scala:282— src/main/scala/analysis/Lattice.scala:282-295 | src/main/scala/analysis/Lattice.scala:375-388 | src/main/scala/analysis/Lattice.scala:401-414 | src/main/scala/analysis/Lattice.scala:544-555 — These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 12 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. 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. Left alone, the next edit has to be made 4 times and the copies will drift further apart.
D4 · Code Duplication· Edited copy of a member (3 corresponding lines) · ×1
Edited copy of a member (3 corresponding lines) src/main/scala/ir/parsing/BasilEarlyBNFCVisitor.scala:84— src/main/scala/ir/parsing/BasilEarlyBNFCVisitor.scala:84-86 | src/main/scala/ir/parsing/BasilEarlyBNFCVisitor.scala:89-91 — These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (5 corresponding lines) · ×1
Edited copy of a member (5 corresponding lines) src/main/scala/translating/offlineLifter/InstructionBuilder.scala:270— src/main/scala/translating/offlineLifter/InstructionBuilder.scala:270-274 | src/main/scala/translating/offlineLifter/InstructionBuilder.scala:276-281 — These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (14 corresponding lines) · ×1
Edited copy of a member (14 corresponding lines) src/main/scala/analysis/rely_guarantee_generation/InterferenceDomains.scala:88— src/main/scala/analysis/rely_guarantee_generation/InterferenceDomains.scala:88-101 | src/main/scala/analysis/rely_guarantee_generation/InterferenceDomains.scala:258-271 — These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (12 corresponding lines) · ×1
Edited copy of a member (12 corresponding lines) src/main/scala/translating/BAPToIR.scala:356— src/main/scala/translating/BAPToIR.scala:356-368 | src/main/scala/translating/BAPToIR.scala:384-395 — These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copies of one member (3 members, 7+ corresponding lines) · ×1
Edited copies of one member (3 members, 7+ corresponding lines) src/main/scala/ir/parsing/BlockBNFCVisitor.scala:117— src/main/scala/ir/parsing/BlockBNFCVisitor.scala:117-123 | src/main/scala/ir/parsing/BlockBNFCVisitor.scala:125-131 | src/main/scala/ir/parsing/BlockBNFCVisitor.scala:133-139 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 7 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. 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. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
Duplicated block (22 lines × 2) src/main/scala/ir/transforms/Simp.scala:1333— src/main/scala/ir/transforms/Simp.scala:1333-1354 | src/main/scala/ir/transforms/Simp.scala:1464-1485 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (20 lines × 2) src/main/scala/translating/IRToBoogie.scala:319— src/main/scala/translating/IRToBoogie.scala:319-338 | src/main/scala/translating/IRToBoogie.scala:351-370 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (19 lines × 2) src/main/scala/analysis/KnownBits.scala:297— src/main/scala/analysis/KnownBits.scala:297-315 | src/main/scala/analysis/KnownBits.scala:328-346 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/main/scala/analysis/KnownBits.scala:297` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (13–16 lines × 3) src/main/scala/analysis/KnownBits.scala:353— src/main/scala/analysis/KnownBits.scala:353-365 | src/main/scala/analysis/KnownBits.scala:378-391 | src/main/scala/analysis/KnownBits.scala:417-432 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (15 lines × 2) src/main/scala/ir/invariant/Typecheck.scala:157— src/main/scala/ir/invariant/Typecheck.scala:157-171 | src/main/scala/ir/invariant/Typecheck.scala:181-195 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/main/scala/ir/invariant/Typecheck.scala:157` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it.
Duplicated block (14 lines × 2) src/main/scala/translating/GTIRBLoader.scala:419— src/main/scala/translating/GTIRBLoader.scala:419-432 | src/main/scala/translating/GTIRBLoader.scala:434-447 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/main/scala/translating/GTIRBLoader.scala:419` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (12 lines × 2) src/main/scala/translating/GTIRBToIR.scala:400— src/main/scala/translating/GTIRBToIR.scala:400-411 | src/main/scala/translating/GTIRBToIR.scala:430-441 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/main/scala/translating/GTIRBToIR.scala:400` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `src/main/scala/translating/GTIRBToIR.scala:413` calls `Some`, `add` and `src/main/scala/translating/GTIRBToIR.scala:443` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (10–11 lines × 2) src/main/scala/ir/transforms/MemoryTransform.scala:50— src/main/scala/ir/transforms/MemoryTransform.scala:50-59 | src/main/scala/ir/transforms/MemoryTransform.scala:80-90 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/main/scala/ir/transforms/MemoryTransform.scala:50` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (16 lines × 2) src/main/scala/translating/GTIRBLoader.scala:212— src/main/scala/translating/GTIRBLoader.scala:212-227 | src/main/scala/translating/GTIRBLoader.scala:257-272 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/main/scala/translating/GTIRBLoader.scala:212` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `src/main/scala/translating/GTIRBLoader.scala:256` calls `MemoryLoad` and `src/main/scala/translating/GTIRBLoader.scala:211` does not — after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (9–10 lines × 2) src/main/scala/util/RunUtils.scala:158— src/main/scala/util/RunUtils.scala:158-166 | src/main/scala/util/RunUtils.scala:173-182 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (9 lines × 5) src/main/scala/analysis/KnownBits.scala:296— src/main/scala/analysis/KnownBits.scala:296-304 | src/main/scala/analysis/KnownBits.scala:327-335 | src/main/scala/analysis/KnownBits.scala:352-360 | src/main/scala/analysis/KnownBits.scala:377-385 | src/main/scala/analysis/KnownBits.scala:416-424 — all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one 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.
Duplicated block (8 lines × 2) src/main/scala/analysis/data_structure_analysis/Graph.scala:799— src/main/scala/analysis/data_structure_analysis/Graph.scala:799-806 | src/main/scala/analysis/data_structure_analysis/Graph.scala:810-817 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/main/scala/analysis/data_structure_analysis/Graph.scala:799` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it.
Duplicated block (6 lines × 3) src/main/scala/translating/GTIRBLoader.scala:494— src/main/scala/translating/GTIRBLoader.scala:494-499 | src/main/scala/translating/GTIRBLoader.scala:503-508 | src/main/scala/translating/GTIRBLoader.scala:512-517 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (11 lines × 2) src/main/scala/analysis/solvers/DSAUnionFindSolver.scala:15— src/main/scala/analysis/solvers/DSAUnionFindSolver.scala:15-30 | src/main/scala/analysis/solvers/OffsetUnionFindSolver.scala:21-31 — 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 — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (5 lines × 3) src/main/scala/translating/GTIRBLoader.scala:462— src/main/scala/translating/GTIRBLoader.scala:462-466 | src/main/scala/translating/GTIRBLoader.scala:469-473 | src/main/scala/translating/GTIRBLoader.scala:476-480 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
D4 · Code Duplication· Edited copies of one member (4 members, 15+ corresponding lines) · ×1
Edited copies of one member (4 members, 15+ corresponding lines) scripts/tnum_test_z3.py:166— scripts/tnum_test_z3.py:166-186 | scripts/tnum_test_z3.py:189-203 | scripts/tnum_test_z3.py:206-220 | scripts/tnum_test_z3.py:252-266 — These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 15 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. 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. Left alone, the next edit has to be made 4 times and the copies will drift further apart.
Swallowed exception (caught, then discarded) src/main/scala/ir/transforms/validate/TranslationValidate.scala:95— `case x` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
Orphaned file src/main/scala/ir/eval/InterpretBasilIR.scala:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file src/main/scala/ir/eval/Interpreter.scala:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file src/main/scala/analysis/Lattice.scala:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file src/main/scala/analysis/KnownBits.scala:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file src/main/scala/ir/transforms/ProcedureParameters.scala:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file src/main/scala/analysis/MemoryModelMap.scala:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file src/main/scala/analysis/data_structure_analysis/SymbolicValueAnalysis.scala:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file src/main/scala/ir/transforms/DynamicSingleAssignment.scala:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file src/main/scala/server/IrServiceRoutes.scala:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file src/main/scala/util/smt/SMT.scala:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file src/main/scala/analysis/data_structure_analysis/LocalPhase.scala:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file src/main/scala/translating/offlineLifter/InstructionBuilder.scala:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file src/main/scala/analysis/LatticeCollections.scala:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file src/main/scala/translating/IRExpToSMT2.scala:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file src/main/scala/ir/IRCursor.scala:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file src/main/scala/util/intrusive_list/IntrusiveList.scala:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file src/main/scala/analysis/AnalysePipelineMRA.scala:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file src/main/scala/analysis/rely_guarantee_generation/InterferenceDomains.scala:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file scripts/tnum_test_z3.py:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file src/main/scala/ir/transforms/AbsInt.scala:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file src/main/scala/ir/eval/ExprEval.scala:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file src/main/scala/ir/transforms/validate/Ackermann.scala:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file src/main/scala/analysis/VariableDependencyAnalysis.scala:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file src/main/scala/ir/eval/BitVectorEval.scala:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file src/main/scala/analysis/NumericalDomains.scala:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Disabled test src/test/scala/DataStructureAnalysisTest.scala:565— A test is skipped/ignored — coverage that looks present but never runs. Re-enable it or delete it so the green run means something.
Disabled test src/test/scala/DataStructureAnalysisTest.scala:610— A test is skipped/ignored — coverage that looks present but never runs. Re-enable it or delete it so the green run means something.
Disabled test src/test/scala/DataStructureAnalysisTest.scala:650— A test is skipped/ignored — coverage that looks present but never runs. Re-enable it or delete it so the green run means something.
Disabled test src/test/scala/DataStructureAnalysisTest.scala:673— A test is skipped/ignored — coverage that looks present but never runs. Re-enable it or delete it so the green run means something.
Disabled test src/test/scala/DataStructureAnalysisTest.scala:708— A test is skipped/ignored — coverage that looks present but never runs. Re-enable it or delete it so the green run means something.
Disabled test src/test/scala/LiveVarsAnalysisTests.scala:215— A test is skipped/ignored — coverage that looks present but never runs. Re-enable it or delete it so the green run means something.
Disabled test src/test/scala/ParamAnalysisTests.scala:70— A test is skipped/ignored — coverage that looks present but never runs. Re-enable it or delete it so the green run means something.
D34 · Knowledge Freshness· Most significant orphaned file · ×3
Most significant orphaned file src/main/scala/ir/eval/SimplifyExpr.scala:1— One of the orphaned files carrying the most lost knowledge — ranked by size weighted by the file's role in the codebase, the same weighting behind the score above, so core code outranks equally large plumbing. A reasonable place to start a read-through before the aggregate risk above bites.
Most significant orphaned file src/main/scala/ir/transforms/validate/TranslationValidate.scala:1— One of the orphaned files carrying the most lost knowledge — ranked by size weighted by the file's role in the codebase, the same weighting behind the score above, so core code outranks equally large plumbing. A reasonable place to start a read-through before the aggregate risk above bites.
Most significant orphaned file src/main/scala/analysis/procedure_summaries/Predicate.scala:1— One of the orphaned files carrying the most lost knowledge — ranked by size weighted by the file's role in the codebase, the same weighting behind the score above, so core code outranks equally large plumbing. A reasonable place to start a read-through before the aggregate risk above bites.
Fat interface: BasilIR[Repr] (19 abstract members) src/main/scala/translating/IRExpToSMT2.scala:8— `BasilIR[Repr]` declares 19 abstract members: `vblock`, `vprog`, `vproc`, `vmemory`, `vassign`, `vmemassign`, `vsimulassign`, `vhavoc`, `vload`, `vstore`, `vcall`, `vindirect`, `vassert`, `vassume`, `vnop`, `vgoto`, `vunreachable`, `vreturn`, `vlvar`. Counted over its ABSTRACT members — a `def` with no body or a `val`/`var` with no initializer, once per signature; concrete members, private and protected members, and members of a companion `object` are not counted, because no implementer is forced to write them. A wide interface forces every implementer and caller to depend on methods they don't use (the Interface-Segregation 'I' in SOLID). Split it into focused role-interfaces.
Fat interface: BasilIRExp[Repr] (16 abstract members) src/main/scala/translating/IRExpToSMT2.scala:117— `BasilIRExp[Repr]` declares 16 abstract members: `vexpr`, `vassoc_expr`, `vextract`, `vquantifier`, `vlambda`, `vold`, `vzeroextend`, `vsignextend`, `vbinary_expr`, `vunary_expr`, `vboollit`, `vbvlit`, `vintlit`, `vrepeat`, `vfapply_expr`, `vrvar`. Counted over its ABSTRACT members — a `def` with no body or a `val`/`var` with no initializer, once per signature; concrete members, private and protected members, and members of a companion `object` are not counted, because no implementer is forced to write them. A wide interface forces every implementer and caller to depend on methods they don't use (the Interface-Segregation 'I' in SOLID). Split it into focused role-interfaces.
Duplicated predicate src/main/scala/analysis/InterLiveVarsAnalysis.scala:110— `addExternals && (c.target.isExternal.contains(true) || c.target.blocks.isEmpty)` appears character-identically in 2 files — src/main/scala/analysis/InterLiveVarsAnalysis.scala, src/main/scala/analysis/IntraLiveVarsAnalysis.scala. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate src/main/scala/analysis/RegionInjector.scala:307— `address >= range.start && (address < range.end || (range.start == range.end && range.end == address))` appears character-identically in 2 files — src/main/scala/analysis/RegionInjector.scala, src/main/scala/analysis/data_structure_analysis/Graph.scala. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
No ADRs found build.mill:84— No ADRs found. No recognised ADR directory (`docs/adr/`, `docs/decisions/`, `adr/`, `docs/rfcs/`, an `ADR0001/` folder, or their siblings) exists anywhere in this tree. What was searched, so you can tell an empty log from a search that missed one: every directory under the tree (build output, dependencies and VCS metadata excepted), for a document that is either any non-index page inside a recognised ADR directory, whatever its name and however deeply nested (`docs/adr/use-postgres.md`, `docs/adr/2024/0001-x.md`); or a file anywhere whose name is ADR-shaped (`0001-use-postgres.md`, `adr-012-caching.md`); or, when neither turned anything up, a document carrying the decision-record signature (an "Architecture Decision Record" heading, or Status / Context / Decision / Consequences as section headings). A decision log that clears none of these — unnumbered files outside any recognised directory, without those headings — is not seen by this check and this row is then wrong. If that is your case, say so rather than renaming anything; otherwise, consider recording architectural decisions in `docs/adr/`. ADRs are expected here because `build.mill` makes this repository a deployable product (line 84).
D21 · Naming Consistency· `visitBv` spells `Bv` where 20 names in the project spell it `BV` · ×1
`visitBv` spells `Bv` where 20 names in the project spell it `BV` src/main/scala/translating/SpecificationLoader.scala:292— 20 of 21 names in project repository spell the token `BV` (20 of 21; unit: names in project repository containing `BV`). Peers: BVisitor.visitBVExtract (src/main/scala/boogie/BVisitor.scala:9); BVisitor.visitBVRepeat (src/main/scala/boogie/BVisitor.scala:11); BVisitor.visitBVZeroExtend (src/main/scala/boogie/BVisitor.scala:13); BVisitor.visitBVSignExtend (src/main/scala/boogie/BVisitor.scala:15); IntUnOp.toBV (src/main/scala/ir/Expr.scala:178). Rename to `visitBV`. [rule N6]
Concentrated knowledge decay — 79 of 135 significant files have no living knowledge, while the repository is still being changed at a low rate (4 commit(s) in the last 90 days) — so this is one repo-wide knowledge-decay state, not 79 separate risks. Counted over 135 of the 201 production source files in this repository: the rest are under the ~2,400-byte size floor this dimension measures over. The code moved on without the people who understood these files: document them or schedule a read-through before the next change lands in them.
No ADRs — No Architecture Decision Records found — no conventional ADR directory, no numbered `NNNN-title` 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.
README/code drift docker/readme.md:50— docker/readme.md links to `godbolt.org`, but `docker/godbolt.org` does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong.
No SAST REDACTED:7— No static application security testing detected. For this repository's stack, add scalafix or scapegoat (or `semgrep --config=auto`, which runs on any language) as a CI step. What was searched, so you can tell an absence from a miss: the 3 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's web UI rather than in a committed file, or a tool whose name is none of those this check carries, is not seen — if that is your case the row is wrong, and saying so is more useful than adding a second scanner.
P4 · Deployment & Rollback· No rollback/health safety · ×1
No rollback/health safety — Deployment is orchestrated by compose, but no service declares a `healthcheck:` and nothing pins a previous image to fall back to — the runtime can tell that the container is up, not that it is serving, so a bad release is harder to detect and reverse.
No changelog — No CHANGELOG/HISTORY/RELEASES file — what shipped when isn't easy to reconstruct for support or audit. (Versioning/tagging makes releases traceable, but a changelog records the what.)
No app-layer HTTPS enforcement detected — This repository runs an HTTP server and nothing in its Scala source or committed configuration secures the transport: no HTTPS served (akka/pekko-http `ConnectionContext.httpsServer`/`enableHttps`, an http4s builder's `withTLS`, Jetty's `SslContextFactory`, zio-http's `SSLConfig`, Play's `https.port`), no `Strict-Transport-Security` header, HSTS middleware or Play `RedirectHttpsFilter`, no `X-Forwarded-Proto` read or Play `play.http.forwarded.trustedProxies` for a TLS-terminating proxy — so its traffic may cross the network in clear text. (−2.0 on this card.) The server: src/main/scala/server/ApiServer.scala:8 — `EmberServerBuilder`.
No security response headers detected — None of the 11 security response headers the OWASP Secure Headers Project recommends (Content-Security-Policy, Strict-Transport-Security, X-Content-Type-Options, X-Frame-Options, …) is set on a response this repository's Scala server sends — defense in depth, even when a proxy could set them. (−2.0 on this card.) The server: src/main/scala/server/ApiServer.scala:8 — `EmberServerBuilder`.
X5 · Nullable reference types· Scala's null is not held to the type system everywhere · ×1
Scala's null is not held to the type system everywhere — No build over this repository's 197 Scala product file(s) passes `-Yexplicit-nulls`, enables WartRemover's `Null` wart or runs Scalafix's `DisableSyntax.noNulls`, so every reference type admits null and nothing reports a `null` written into the code or returned from a Java API — the first one to reach a method call is a `NullPointerException`. `Option` by convention is a habit no tool here holds the code to.
Appendix B — Reproduction & audit trail
Every external tool invocation behind a deep-scan dimension — the tool, its captured version, the exact command, how many findings it yielded, and a link to the retained raw output. To reproduce any finding: check out the same commit and run the command shown (repo-relative — never an absolute scratch path). The complete raw scanner output is retained verbatim under artifacts/raw/ (indexed in artifacts/raw/index.json); per-invocation exit codes and wall-clock durations are in sidecar.json — kept out of this table so the rendered report stays byte-identical across runs of the same commit.
none (no readable dependency manifest): not applicable — Not scored — no dependency manifest in a supported ecosystem was read for this repository. A gap in the analyzer's language coverage, NOT a finding that the repository is free of vulnerable dependencies (a Python pyproject.toml/requirements.txt (pip/uv/Poetry), a Swift Package.swift/Package.resolved, a Cargo manifest, a Go module (go.mod/go.sum), a Gradle version catalogue, a Maven POM, an sbt build (build.sbt), composer.json, package.json, a Dart pubspec.yaml, an Elixir mix.exs/mix.lock (Hex), a rebar.config / erlang.mk DEPS (Hex), a Ruby Gemfile/Gemfile.lock or .gemspec (Bundler/RubyGems) — not scanned yet).
semgrep: not applicable — No personal data was found crossing a boundary the PII/GDPR ruleset checks — nothing written to a log or console sink, placed in a URL or query string, or persisted to browser storage. That is a clean result for the LEAK surface only: this ruleset detects personal data escaping, it does not inventory the personal data a repository holds, so it is not evidence that this repository has no personal-data surface. The personal-data map (Appendix C) and the C1-C5 compliance cards are what speak to that. semgrep could not parse 59 file(s) — `src/main/scala/analysis/ANR.scala`, `src/main/scala/analysis/GammaDomains.scala`, `src/main/scala/analysis/GlobalRegionAnalysis.scala`, `src/main/scala/analysis/InterLiveVarsAnalysis.scala`, `src/main/scala/analysis/MemoryModelMap.scala`, … (+54 more) — so the PII/GDPR sweep did not cover them at all.
disclosure: not applicable — No vulnerability-disclosure policy file found (SECURITY.md/.markdown/.rst/.txt at root or under .github/.forgejo/.gitea/docs, .well-known/security.txt). A coordinated-disclosure policy may live off-repo, so this is not evidenced rather than failed.
runtime-hardening: not applicable — No Kubernetes/orchestration workloads found in the repository manifests; network egress policy is a cluster-native control that may live at the platform/firewall layer, so there is nothing to assess here.
runtime-hardening: not applicable — No Kubernetes/orchestration workloads found in the repository manifests; seccomp/AppArmor/SELinux confinement is a workload-level control, so there is nothing to assess here.
runtime-hardening: not applicable — No Kubernetes/orchestration workloads found in the repository manifests; runtime threat-detection and admission-control policy are cluster-level controls, so there is nothing to assess here.
none (no readable dependency manifest): not applicable — Not scored — no dependency manifest in a supported ecosystem was read for this repository. A gap in the analyzer's language coverage, NOT a finding that the repository is free of vulnerable dependencies (a Python pyproject.toml/requirements.txt (pip/uv/Poetry), a Swift Package.swift/Package.resolved, a Cargo manifest, a Go module (go.mod/go.sum), a Gradle version catalogue, a Maven POM, an sbt build (build.sbt), composer.json, package.json, a Dart pubspec.yaml, an Elixir mix.exs/mix.lock (Hex), a rebar.config / erlang.mk DEPS (Hex), a Ruby Gemfile/Gemfile.lock or .gemspec (Bundler/RubyGems) — not scanned yet).
0
—
Run 01a1ea1c-6bfa-7898-b183-b6cc8a60f74d · every finding is also locatable in findings.md, and the complete scoring record (with exit codes + durations) in sidecar.json.
Issues: 38 · Warnings: 471 · Recommendations: 101 — Appendix A · all findings · full markdown report.
Generated by the Canine Code Analyzer: deterministic code-health analysis. 17-11-2026 @ 15:24 UTC.
Downloadable artifacts
Machine-readable and reproducible from this commit + frozen rubric — drop them straight into a contract appendix, a CRA dossier, or a downstream SCA / VEX tool.