Solving a linear TS problem on 1 processor
Timestep   0: step size = 0.000143637, time = 0., 2-norm error = 0., max norm error = 0.
    Linear solve converged due to CONVERGED_RTOL iterations 1
Timestep   1: step size = 0.000143637, time = 0.000143637, 2-norm error = 0.00112483, max norm error = 0.00162124
    Linear solve converged due to CONVERGED_RTOL iterations 1
Timestep   2: step size = 0.000143637, time = 0.000287274, 2-norm error = 0.00213968, max norm error = 0.00308653
    Linear solve converged due to CONVERGED_RTOL iterations 1
Timestep   3: step size = 0.000143637, time = 0.000430911, 2-norm error = 0.00305264, max norm error = 0.0044073
avg. error (2 norm) = 0.00210572, avg. error (max norm) = 0.00303835
TS Object: 1 MPI process
  type: beuler
  maximum steps=3
  maximum time=100.
  total number of RHS function evaluations=3
  total number of RHS Jacobian evaluations=6
  total number of linear solver iterations=3
  total number of linear solve failures=0
  total number of rejected steps=0
  using relative error tolerance of 0.0001,   using absolute error tolerance of 0.0001
  TSAdapt Object: 1 MPI process
    type: none
  SNES Object: 1 MPI process
    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
    norm schedule ALWAYS
    KSP Object: 1 MPI process
      type: gmres
        restart=30, using Classical (unmodified) Gram-Schmidt Orthogonalization with no iterative refinement
        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 process
      type: ilu
        out-of-place factorization
        0 levels of fill
        tolerance for zero pivot 2.22045e-14
        matrix ordering: natural
        factor fill ratio given 1., needed 1.
          Factored matrix follows:
            Mat Object: 1 MPI process
              type: seqaij
              rows=60, cols=60
              package used to perform factorization: petsc
              total: nonzeros=176, allocated nonzeros=176
                not using I-node routines
      linear system matrix followed by preconditioner matrix:
      Mat Object: 1 MPI process
        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
      Mat Object: 1 MPI process
        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
