Solving a linear TS problem on 1 processor
Timestep   0: step size = 0.000143637, time = 0          , 2-norm error = 1.01507e-15, max norm error = 3.10862e-15
    Linear solve converged due to CONVERGED_RTOL iterations 1
    Linear solve converged due to CONVERGED_RTOL iterations 1
    Linear solve converged due to CONVERGED_RTOL iterations 1
    Linear solve converged due to CONVERGED_RTOL iterations 1
Timestep   1: step size = 0.000504055, time = 0.000143637, 2-norm error = 0.000290581, max norm error = 0.0004186  
    Linear solve converged due to CONVERGED_RTOL iterations 1
    Linear solve converged due to CONVERGED_RTOL iterations 1
    Linear solve converged due to CONVERGED_RTOL iterations 1
    Linear solve converged due to CONVERGED_RTOL iterations 1
Timestep   2: step size = 0.000500257, time = 0.000647692, 2-norm error = 0.0010422  , max norm error = 0.00150753 
    Linear solve converged due to CONVERGED_RTOL iterations 1
    Linear solve converged due to CONVERGED_RTOL iterations 1
    Linear solve converged due to CONVERGED_RTOL iterations 1
    Linear solve converged due to CONVERGED_RTOL iterations 1
Timestep   3: step size = 0.000526001, time = 0.00114795 , 2-norm error = 0.0015392  , max norm error = 0.0022348  
avg. error (2 norm) = 0.000957327, avg. error (max norm) = 0.00138698
TS Object: 1 MPI processes
  type: rosw
  maximum steps=3
  maximum time=100
  total number of linear solver iterations=12
  total number of rejected steps=0
    Rosenbrock-W ra34pw2
    Abscissa of A       =  0.000000  0.871733  0.731580  1.000000 
    Abscissa of A+Gamma =  0.435867  0.871733  0.731580  1.000000 
  TSAdapt Object:   1 MPI processes
    type: basic
    number of candidates 1
      Basic: clip fastest decrease 0.1, fastest increase 10
      Basic: safety factor 0.9, extra factor after step rejection 0.5
  SNES Object:   1 MPI processes
    type: ksponly
    maximum iterations=50, maximum function evaluations=10000
    tolerances: relative=1e-08, absolute=1e-50, solution=1e-08
    total number of linear solver iterations=1
    total number of function evaluations=1
    Jacobian is never rebuilt
    SNESLineSearch Object:     1 MPI processes
      type: basic
      maxstep=1.000000e+08, minlambda=1.000000e-12
      tolerances: relative=1.000000e-08, absolute=1.000000e-15, lambda=1.000000e-08
      maximum iterations=1
    KSP Object:     1 MPI processes
      type: gmres
        GMRES: restart=30, using Classical (unmodified) Gram-Schmidt Orthogonalization with no iterative refinement
        GMRES: happy breakdown tolerance 1e-30
      maximum iterations=10000, initial guess is zero
      tolerances:  relative=1e-05, absolute=1e-50, divergence=10000
      left preconditioning
      using PRECONDITIONED norm type for convergence test
    PC Object:     1 MPI processes
      type: ilu
        ILU: out-of-place factorization
        0 levels of fill
        tolerance for zero pivot 2.22045e-14
        using diagonal shift on blocks to prevent zero pivot
        matrix ordering: natural
        factor fill ratio given 1, needed 1
          Factored matrix follows:
            Matrix Object:             1 MPI processes
              type: seqaij
              rows=60, cols=60
              package used to perform factorization: petsc
              total: nonzeros=176, allocated nonzeros=176
              total number of mallocs used during MatSetValues calls =0
                not using I-node routines
      linear system matrix followed by preconditioner matrix:
      Matrix Object:       1 MPI processes
        type: seqaij
        rows=60, cols=60
        total: nonzeros=176, allocated nonzeros=176
        total number of mallocs used during MatSetValues calls =0
          not using I-node routines
      Matrix Object:       1 MPI processes
        type: seqaij
        rows=60, cols=60
        total: nonzeros=176, allocated nonzeros=176
        total number of mallocs used during MatSetValues calls =0
          not using I-node routines
