atol=1e-50, rtol=1e-08, stol=1e-08, maxit=50, maxf=10000
iter = 0,SNES Function norm 347.341
KSP Object: 8 MPI processes
  type: fgmres
    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.
  right preconditioning
  using UNPRECONDITIONED norm type for convergence test
PC Object: 8 MPI processes
  type: bjacobi
    number of blocks = 4
    Local solve is same for all blocks, in the following KSP and PC objects:
  KSP Object: (sub_) 2 MPI processes
    type: gmres
      restart=30, using Classical (unmodified) Gram-Schmidt Orthogonalization with no iterative refinement
      happy breakdown tolerance 1e-30
    maximum iterations=3, initial guess is zero
    tolerances:  relative=1e-05, absolute=1e-50, divergence=10000.
    left preconditioning
    using PRECONDITIONED norm type for convergence test
  PC Object: (sub_) 2 MPI processes
    type: bjacobi
      number of blocks = 2
      Local solve is same for all blocks, in the following KSP and PC objects:
    linear system matrix = precond matrix:
    Mat Object: 2 MPI processes
      type: mpiaij
      rows=2500, cols=2500
      total: nonzeros=7497, allocated nonzeros=7502
      total number of mallocs used during MatSetValues calls =0
        not using I-node (on process 0) routines
      KSP Object:   (sub_sub_)   1 MPI processes
        type: preonly
        maximum iterations=10000, initial guess is zero
        tolerances:  relative=1e-05, absolute=1e-50, divergence=10000.
        left preconditioning
        using NONE norm type for convergence test
      PC Object:   (sub_sub_)   1 MPI processes
        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 processes
                type: seqaij
                rows=1250, cols=1250
                package used to perform factorization: petsc
                total: nonzeros=3747, allocated nonzeros=3747
                total number of mallocs used during MatSetValues calls =0
                  not using I-node routines
        linear system matrix = precond matrix:
        Mat Object:   1 MPI processes
          type: seqaij
          rows=1250, cols=1250
          total: nonzeros=3747, allocated nonzeros=3750
          total number of mallocs used during MatSetValues calls =0
            not using I-node routines
  linear system matrix = precond matrix:
  Mat Object: 8 MPI processes
    type: mpiaij
    rows=10000, cols=10000
    total: nonzeros=29996, allocated nonzeros=60000
    total number of mallocs used during MatSetValues calls =0
      not using I-node (on process 0) routines
iter = 1,SNES Function norm 17.889
KSP Object: 8 MPI processes
  type: fgmres
    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.
  right preconditioning
  using UNPRECONDITIONED norm type for convergence test
PC Object: 8 MPI processes
  type: bjacobi
    number of blocks = 4
    Local solve is same for all blocks, in the following KSP and PC objects:
  KSP Object: (sub_) 2 MPI processes
    type: gmres
      restart=30, using Classical (unmodified) Gram-Schmidt Orthogonalization with no iterative refinement
      happy breakdown tolerance 1e-30
    maximum iterations=3, initial guess is zero
    tolerances:  relative=1e-05, absolute=1e-50, divergence=10000.
    left preconditioning
    using PRECONDITIONED norm type for convergence test
  PC Object: (sub_) 2 MPI processes
    type: bjacobi
      number of blocks = 2
      Local solve is same for all blocks, in the following KSP and PC objects:
    linear system matrix = precond matrix:
    Mat Object: 2 MPI processes
      type: mpiaij
      rows=2500, cols=2500
      total: nonzeros=7497, allocated nonzeros=7502
      total number of mallocs used during MatSetValues calls =0
        not using I-node (on process 0) routines
      KSP Object:   (sub_sub_)   1 MPI processes
        type: preonly
        maximum iterations=10000, initial guess is zero
        tolerances:  relative=1e-05, absolute=1e-50, divergence=10000.
        left preconditioning
        using NONE norm type for convergence test
      PC Object:   (sub_sub_)   1 MPI processes
        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 processes
                type: seqaij
                rows=1250, cols=1250
                package used to perform factorization: petsc
                total: nonzeros=3747, allocated nonzeros=3747
                total number of mallocs used during MatSetValues calls =0
                  not using I-node routines
        linear system matrix = precond matrix:
        Mat Object:   1 MPI processes
          type: seqaij
          rows=1250, cols=1250
          total: nonzeros=3747, allocated nonzeros=3750
          total number of mallocs used during MatSetValues calls =0
            not using I-node routines
  linear system matrix = precond matrix:
  Mat Object: 8 MPI processes
    type: mpiaij
    rows=10000, cols=10000
    total: nonzeros=29996, allocated nonzeros=60000
    total number of mallocs used during MatSetValues calls =0
      not using I-node (on process 0) routines
iter = 2,SNES Function norm 0.0229752
KSP Object: 8 MPI processes
  type: fgmres
    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.
  right preconditioning
  using UNPRECONDITIONED norm type for convergence test
PC Object: 8 MPI processes
  type: bjacobi
    number of blocks = 4
    Local solve is same for all blocks, in the following KSP and PC objects:
  KSP Object: (sub_) 2 MPI processes
    type: gmres
      restart=30, using Classical (unmodified) Gram-Schmidt Orthogonalization with no iterative refinement
      happy breakdown tolerance 1e-30
    maximum iterations=3, initial guess is zero
    tolerances:  relative=1e-05, absolute=1e-50, divergence=10000.
    left preconditioning
    using PRECONDITIONED norm type for convergence test
  PC Object: (sub_) 2 MPI processes
    type: bjacobi
      number of blocks = 2
      Local solve is same for all blocks, in the following KSP and PC objects:
    linear system matrix = precond matrix:
    Mat Object: 2 MPI processes
      type: mpiaij
      rows=2500, cols=2500
      total: nonzeros=7497, allocated nonzeros=7502
      total number of mallocs used during MatSetValues calls =0
        not using I-node (on process 0) routines
      KSP Object:   (sub_sub_)   1 MPI processes
        type: preonly
        maximum iterations=10000, initial guess is zero
        tolerances:  relative=1e-05, absolute=1e-50, divergence=10000.
        left preconditioning
        using NONE norm type for convergence test
      PC Object:   (sub_sub_)   1 MPI processes
        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 processes
                type: seqaij
                rows=1250, cols=1250
                package used to perform factorization: petsc
                total: nonzeros=3747, allocated nonzeros=3747
                total number of mallocs used during MatSetValues calls =0
                  not using I-node routines
        linear system matrix = precond matrix:
        Mat Object:   1 MPI processes
          type: seqaij
          rows=1250, cols=1250
          total: nonzeros=3747, allocated nonzeros=3750
          total number of mallocs used during MatSetValues calls =0
            not using I-node routines
  linear system matrix = precond matrix:
  Mat Object: 8 MPI processes
    type: mpiaij
    rows=10000, cols=10000
    total: nonzeros=29996, allocated nonzeros=60000
    total number of mallocs used during MatSetValues calls =0
      not using I-node (on process 0) routines
iter = 3,SNES Function norm 4.18016e-07
SNES Object: 8 MPI processes
  type: newtonls
  maximum iterations=50, maximum function evaluations=10000
  tolerances: relative=1e-08, absolute=1e-50, solution=1e-08
  total number of linear solver iterations=54
  total number of function evaluations=4
  norm schedule ALWAYS
  SNESLineSearch Object: 8 MPI processes
    type: bt
      interpolation: cubic
      alpha=1.000000e-04
    maxstep=1.000000e+08, minlambda=1.000000e-12
    tolerances: relative=1.000000e-08, absolute=1.000000e-15, lambda=1.000000e-08
    maximum iterations=40
  KSP Object: 8 MPI processes
    type: fgmres
      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.
    right preconditioning
    using UNPRECONDITIONED norm type for convergence test
  PC Object: 8 MPI processes
    type: bjacobi
      number of blocks = 4
      Local solve is same for all blocks, in the following KSP and PC objects:
    KSP Object: (sub_) 2 MPI processes
      type: gmres
        restart=30, using Classical (unmodified) Gram-Schmidt Orthogonalization with no iterative refinement
        happy breakdown tolerance 1e-30
      maximum iterations=3, initial guess is zero
      tolerances:  relative=1e-05, absolute=1e-50, divergence=10000.
      left preconditioning
      using PRECONDITIONED norm type for convergence test
    PC Object: (sub_) 2 MPI processes
      type: bjacobi
        number of blocks = 2
        Local solve is same for all blocks, in the following KSP and PC objects:
      linear system matrix = precond matrix:
      Mat Object: 2 MPI processes
        type: mpiaij
        rows=2500, cols=2500
        total: nonzeros=7497, allocated nonzeros=7502
        total number of mallocs used during MatSetValues calls =0
          not using I-node (on process 0) routines
          KSP Object:     (sub_sub_)     1 MPI processes
            type: preonly
            maximum iterations=10000, initial guess is zero
            tolerances:  relative=1e-05, absolute=1e-50, divergence=10000.
            left preconditioning
            using NONE norm type for convergence test
          PC Object:     (sub_sub_)     1 MPI processes
            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 processes
                    type: seqaij
                    rows=1250, cols=1250
                    package used to perform factorization: petsc
                    total: nonzeros=3747, allocated nonzeros=3747
                    total number of mallocs used during MatSetValues calls =0
                      not using I-node routines
            linear system matrix = precond matrix:
            Mat Object:     1 MPI processes
              type: seqaij
              rows=1250, cols=1250
              total: nonzeros=3747, allocated nonzeros=3750
              total number of mallocs used during MatSetValues calls =0
                not using I-node routines
    linear system matrix = precond matrix:
    Mat Object: 8 MPI processes
      type: mpiaij
      rows=10000, cols=10000
      total: nonzeros=29996, allocated nonzeros=60000
      total number of mallocs used during MatSetValues calls =0
        not using I-node (on process 0) routines
Number of SNES iterations = 3
Norm of error 6.72799e-09 Iterations 3