Lang.Nat_nastyNatNasty benchmark — bounded natural-number WFA.
A 6-state WFA over the single-letter alphabet {a} using the bounded natural-number semiring (Nat.get (Some 12000), QF_NIA). The hand-crafted transition matrix contains large coefficients (125, 5) that make the learner's SMT constraint system harder to satisfy, stressing the solver with a tight bound of 12 000. Used to benchmark SWAL's performance on challenging integer arithmetic instances.
module S : sig ... endmodule Matrix : sig ... endmodule Aut : sig ... endval alpha : (Automata.Char.t, Automata.Char.comparator_witness) Base.Set.tval aut : Aut.tval out : Automata.Word.t -> Aut.s