diff --git a/test/mirk/nonlinear_least_squares.jl b/test/mirk/nonlinear_least_squares.jl
index 2d994309..b782955c 100644
--- a/test/mirk/nonlinear_least_squares.jl
+++ b/test/mirk/nonlinear_least_squares.jl
@@ -70,7 +70,7 @@ using BoundaryValueDiffEq, LinearAlgebra, Test
 
     for solver in SOLVERS
         @time sol = solve(bvp3, solver; verbose = false, dt = 1.0, abstol = 1e-3,
-            reltol = 1e-3, nlsolve_kwargs = (; maxiters = 50, abstol = 1e-3, reltol = 1e-3))
+            reltol = 1e-3)
         resida = Array{Float64}(undef, 1)
         residb = Array{Float64}(undef, 2)
         bc1a!(resida, sol(0.0), nothing)
@@ -82,7 +82,8 @@ end
 # This is not a very meaningful problem, but it tests that our solvers are not throwing an
 # error
 @testset "Underconstrained BVP: Rod BVP" begin
-    SOLVERS = [mirk(; nlsolve) for mirk in (MIRK4, MIRK5, MIRK6),
+    # Force normal form for GN
+    SOLVERS = [mirk(; nlsolve) for mirk in (MIRK4, MIRK5),
     nlsolve in (LevenbergMarquardt(), GaussNewton(), nothing)]
 
     function hat(y)
@@ -183,10 +184,10 @@ end
 
     for solver in SOLVERS
         @time sol = solve(prob_tp, solver; verbose = false, dt = 0.1, abstol = 1e-3,
-            reltol = 1e-3, nlsolve_kwargs = (; maxiters = 50, abstol = 1e-3, reltol = 1e-3))
+            reltol = 1e-3)
         @test SciMLBase.successful_retcode(sol.retcode)
         @time sol = solve(prob, solver; verbose = false, dt = 0.1, abstol = 1e-3,
-            reltol = 1e-3, nlsolve_kwargs = (; maxiters = 50, abstol = 1e-3, reltol = 1e-3))
+            reltol = 1e-3)
         @test SciMLBase.successful_retcode(sol.retcode)
     end
 end