1TS Object: 1 MPI process 2 type: alpha2 3 Alpha_m=0.5, Alpha_f=0.5, Gamma=0.5, Beta=0.25 4 maximum steps=10 5 maximum time=31.4159 6 total number of I function evaluations=24 7 total number of I Jacobian evaluations=12 8 total number of nonlinear solver iterations=12 9 total number of linear solver iterations=12 10 total number of nonlinear solve failures=0 11 total number of rejected steps=0 12 using relative error tolerance of 0.0001, using absolute error tolerance of 0.0001 13 TSAdapt Object: 1 MPI process 14 type: none 15 SNES Object: 1 MPI process 16 type: newtonls 17 maximum iterations=50, maximum function evaluations=10000 18 tolerances: relative=1e-08, absolute=1e-50, solution=1e-08 19 total number of linear solver iterations=1 20 total number of function evaluations=2 21 norm schedule ALWAYS 22 SNESLineSearch Object: 1 MPI process 23 type: bt 24 interpolation: cubic 25 alpha=1.000000e-04 26 maxstep=1.000000e+08, minlambda=1.000000e-12 27 tolerances: relative=1.000000e-08, absolute=1.000000e-15, lambda=1.000000e-08 28 maximum iterations=40 29 KSP Object: 1 MPI process 30 type: gmres 31 restart=30, using Classical (unmodified) Gram-Schmidt Orthogonalization with no iterative refinement 32 happy breakdown tolerance 1e-30 33 maximum iterations=10000, initial guess is zero 34 tolerances: relative=1e-05, absolute=1e-50, divergence=10000. 35 left preconditioning 36 using PRECONDITIONED norm type for convergence test 37 PC Object: 1 MPI process 38 type: ilu 39 out-of-place factorization 40 0 levels of fill 41 tolerance for zero pivot 2.22045e-14 42 matrix ordering: external 43 factor fill ratio given 0., needed 0. 44 Factored matrix follows: 45 Mat Object: 1 MPI process 46 type: seqdense 47 rows=1, cols=1 48 package used to perform factorization: petsc 49 total: nonzeros=1, allocated nonzeros=1 50 linear system matrix = precond matrix: 51 Mat Object: 1 MPI process 52 type: seqdense 53 rows=1, cols=1 54 total: nonzeros=1, allocated nonzeros=1 55 total number of mallocs used during MatSetValues calls=0 56