Level 0 domain size (m)    8e+04 x    8e+04 x    1e+03, num elements 4 x 4 x 2 (32), size (m) 20000. x 20000. x 1000.
        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
        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
        Linear solve converged due to CONVERGED_RTOL iterations 1
      Nonlinear solve converged due to CONVERGED_FNORM_RELATIVE iterations 9
Level 1 domain size (m)    8e+04 x    8e+04 x    1e+03, num elements 8 x 8 x 2 (128), size (m) 10000. x 10000. x 1000.
Level 0 domain size (m)    8e+04 x    8e+04 x    1e+03, num elements 4 x 4 x 2 (32), size (m) 20000. x 20000. x 1000.
      Linear solve converged due to CONVERGED_RTOL iterations 4
      Linear solve converged due to CONVERGED_RTOL iterations 5
      Linear solve converged due to CONVERGED_RTOL iterations 5
      Linear solve converged due to CONVERGED_RTOL iterations 6
      Linear solve converged due to CONVERGED_RTOL iterations 6
      Linear solve converged due to CONVERGED_RTOL iterations 5
      Linear solve converged due to CONVERGED_RTOL iterations 6
      Linear solve converged due to CONVERGED_RTOL iterations 7
    Nonlinear solve converged due to CONVERGED_FNORM_RELATIVE iterations 8
Level 2 domain size (m)    8e+04 x    8e+04 x    1e+03, num elements 16 x 16 x 2 (512), size (m) 5000. x 5000. x 1000.
Level 1 domain size (m)    8e+04 x    8e+04 x    1e+03, num elements 8 x 8 x 2 (128), size (m) 10000. x 10000. x 1000.
Level 0 domain size (m)    8e+04 x    8e+04 x    1e+03, num elements 4 x 4 x 2 (32), size (m) 20000. x 20000. x 1000.
    Linear solve converged due to CONVERGED_RTOL iterations 5
    Linear solve converged due to CONVERGED_RTOL iterations 6
    Linear solve converged due to CONVERGED_RTOL iterations 7
    Linear solve converged due to CONVERGED_RTOL iterations 6
    Linear solve converged due to CONVERGED_RTOL iterations 2
    Linear solve converged due to CONVERGED_RTOL iterations 2
    Linear solve converged due to CONVERGED_RTOL iterations 3
    Linear solve converged due to CONVERGED_RTOL iterations 5
    Linear solve converged due to CONVERGED_RTOL iterations 6
    Linear solve converged due to CONVERGED_RTOL iterations 7
  Nonlinear solve converged due to CONVERGED_FNORM_RELATIVE iterations 10
Level 3 domain size (m)    8e+04 x    8e+04 x    1e+03, num elements 16 x 16 x 4 (1024), size (m) 5000. x 5000. x 333.333
Level 2 domain size (m)    8e+04 x    8e+04 x    1e+03, num elements 16 x 16 x 2 (512), size (m) 5000. x 5000. x 1000.
Level 1 domain size (m)    8e+04 x    8e+04 x    1e+03, num elements 8 x 8 x 2 (128), size (m) 10000. x 10000. x 1000.
Level 0 domain size (m)    8e+04 x    8e+04 x    1e+03, num elements 4 x 4 x 2 (32), size (m) 20000. x 20000. x 1000.
  Linear solve converged due to CONVERGED_RTOL iterations 2
  Linear solve converged due to CONVERGED_RTOL iterations 2
  Linear solve converged due to CONVERGED_RTOL iterations 4
  Linear solve converged due to CONVERGED_RTOL iterations 7
  Linear solve converged due to CONVERGED_RTOL iterations 7
Nonlinear solve converged due to CONVERGED_FNORM_RELATIVE iterations 5
SNES Object: 6 MPI processes
  type: newtonls
  maximum iterations=50, maximum function evaluations=10000
  tolerances: relative=1e-08, absolute=1e-50, solution=1e-12
  total number of linear solver iterations=22
  total number of function evaluations=6
  norm schedule ALWAYS
  total number of grid sequence refinements=3
  Jacobian is built using a DMDA local Jacobian
  SNESLineSearch Object: 6 MPI processes
    type: bt
      interpolation: cubic
      alpha=1.000000e-04
    maxlambda=1.000000e+00, minlambda=1.000000e-12
    tolerances: relative=1.000000e-08, absolute=1.000000e-15, lambda=1.000000e-08
    maximum iterations=40
  KSP Object: 6 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=0.01, absolute=-1., divergence=10000.
    right preconditioning
    using UNPRECONDITIONED norm type for convergence test
  PC Object: 6 MPI processes
    type: mg
      type is MULTIPLICATIVE, levels=4 cycles=v
        Cycles per PCApply=1
        Not using Galerkin computed coarse grid matrices
    Coarse grid solver -- level 0 -------------------------------
      KSP Object: (mg_coarse_) 6 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: (mg_coarse_) 6 MPI processes
        type: redundant
          First (color=0) of 6 PCs follows
          KSP Object: (mg_coarse_redundant_) 1 MPI process
            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: (mg_coarse_redundant_) 1 MPI process
            type: lu
              out-of-place factorization
              tolerance for zero pivot 2.22045e-14
              using diagonal shift on blocks to prevent zero pivot [INBLOCKS]
              matrix ordering: nd
              factor fill ratio given 5., needed 1.41667
                Factored matrix follows:
                  Mat Object: (mg_coarse_redundant_) 1 MPI process
                    type: seqaij
                    rows=64, cols=64, bs=2
                    package used to perform factorization: petsc
                    total: nonzeros=3264, allocated nonzeros=3264
                      using I-node routines: found 16 nodes, limit used is 5
            linear system matrix = precond matrix:
            Mat Object: 1 MPI process
              type: seqaij
              rows=64, cols=64, bs=2
              total: nonzeros=2304, allocated nonzeros=2304
              total number of mallocs used during MatSetValues calls=0
                using I-node routines: found 16 nodes, limit used is 5
        linear system matrix = precond matrix:
        Mat Object: 6 MPI processes
          type: mpiaij
          rows=64, cols=64, bs=2
          total: nonzeros=2304, allocated nonzeros=2304
          total number of mallocs used during MatSetValues calls=0
    Down solver (pre-smoother) on level 1 -------------------------------
      KSP Object: (mg_levels_1_) 6 MPI processes
        type: gmres
          restart=30, using Classical (unmodified) Gram-Schmidt Orthogonalization with no iterative refinement
          happy breakdown tolerance 1e-30
        maximum iterations=1, nonzero initial guess
        tolerances: relative=1e-05, absolute=1e-50, divergence=10000.
        left preconditioning
        using NONE norm type for convergence test
      PC Object: (mg_levels_1_) 6 MPI processes
        type: bjacobi
          number of blocks = 6
          Local solver information for first block is in the following KSP and PC objects on rank 0:
          Use -mg_levels_1_ksp_view ::ascii_info_detail to display information for all blocks
        KSP Object: (mg_levels_1_sub_) 1 MPI process
          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: (mg_levels_1_sub_) 1 MPI process
          type: cholesky
            out-of-place factorization
            tolerance for zero pivot 2.22045e-14
            matrix ordering: natural
            factor fill ratio given 5., needed 1.32237
              Factored matrix follows:
                Mat Object: (mg_levels_1_sub_) 1 MPI process
                  type: seqsbaij
                  rows=48, cols=48, bs=2
                  package used to perform factorization: petsc
                  total: nonzeros=804, allocated nonzeros=804
                      block size is 2
          linear system matrix = precond matrix:
          Mat Object: (mg_levels_1_sub_) 1 MPI process
            type: seqsbaij
            rows=48, cols=48, bs=2
            total: nonzeros=608, allocated nonzeros=608
            total number of mallocs used during MatSetValues calls=0
                block size is 2
        linear system matrix = precond matrix:
        Mat Object: 6 MPI processes
          type: mpisbaij
          rows=256, cols=256, bs=2
          total: nonzeros=4864, allocated nonzeros=4864
          total number of mallocs used during MatSetValues calls=0
    Up solver (post-smoother) same as down solver (pre-smoother)
    Down solver (pre-smoother) on level 2 -------------------------------
      KSP Object: (mg_levels_2_) 6 MPI processes
        type: gmres
          restart=30, using Classical (unmodified) Gram-Schmidt Orthogonalization with no iterative refinement
          happy breakdown tolerance 1e-30
        maximum iterations=1, nonzero initial guess
        tolerances: relative=1e-05, absolute=1e-50, divergence=10000.
        left preconditioning
        using NONE norm type for convergence test
      PC Object: (mg_levels_2_) 6 MPI processes
        type: bjacobi
          number of blocks = 6
          Local solver information for first block is in the following KSP and PC objects on rank 0:
          Use -mg_levels_2_ksp_view ::ascii_info_detail to display information for all blocks
        KSP Object: (mg_levels_2_sub_) 1 MPI process
          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: (mg_levels_2_sub_) 1 MPI process
          type: icc
            out-of-place factorization
            0 levels of fill
            tolerance for zero pivot 2.22045e-14
            using Manteuffel shift [POSITIVE_DEFINITE]
            matrix ordering: natural
            factor fill ratio given 1., needed 1.00133
              Factored matrix follows:
                Mat Object: (mg_levels_2_sub_) 1 MPI process
                  type: seqsbaij
                  rows=192, cols=192, bs=2
                  package used to perform factorization: petsc
                  total: nonzeros=3012, allocated nonzeros=3012
                      block size is 2
          linear system matrix = precond matrix:
          Mat Object: (mg_levels_2_sub_) 1 MPI process
            type: seqsbaij
            rows=192, cols=192, bs=2
            total: nonzeros=3008, allocated nonzeros=3008
            total number of mallocs used during MatSetValues calls=0
                block size is 2
        linear system matrix = precond matrix:
        Mat Object: 6 MPI processes
          type: mpisbaij
          rows=1024, cols=1024, bs=2
          total: nonzeros=19456, allocated nonzeros=19456
          total number of mallocs used during MatSetValues calls=0
    Up solver (post-smoother) same as down solver (pre-smoother)
    Down solver (pre-smoother) on level 3 -------------------------------
      KSP Object: (mg_levels_3_) 6 MPI processes
        type: gmres
          restart=30, using Classical (unmodified) Gram-Schmidt Orthogonalization with no iterative refinement
          happy breakdown tolerance 1e-30
        maximum iterations=1, nonzero initial guess
        tolerances: relative=1e-05, absolute=1e-50, divergence=10000.
        left preconditioning
        using NONE norm type for convergence test
      PC Object: (mg_levels_3_) 6 MPI processes
        type: bjacobi
          number of blocks = 6
          Local solver information for first block is in the following KSP and PC objects on rank 0:
          Use -mg_levels_3_ksp_view ::ascii_info_detail to display information for all blocks
        KSP Object: (mg_levels_3_sub_) 1 MPI process
          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: (mg_levels_3_sub_) 1 MPI process
          type: icc
            out-of-place factorization
            0 levels of fill
            tolerance for zero pivot 2.22045e-14
            using Manteuffel shift [POSITIVE_DEFINITE]
            matrix ordering: natural
            factor fill ratio given 1., needed 1.00054
              Factored matrix follows:
                Mat Object: (mg_levels_3_sub_) 1 MPI process
                  type: seqsbaij
                  rows=384, cols=384, bs=2
                  package used to perform factorization: petsc
                  total: nonzeros=7428, allocated nonzeros=7428
                      block size is 2
          linear system matrix = precond matrix:
          Mat Object: (mg_levels_3_sub_) 1 MPI process
            type: seqsbaij
            rows=384, cols=384, bs=2
            total: nonzeros=7424, allocated nonzeros=7424
            total number of mallocs used during MatSetValues calls=0
                block size is 2
        linear system matrix = precond matrix:
        Mat Object: 6 MPI processes
          type: mpisbaij
          rows=2048, cols=2048, bs=2
          total: nonzeros=48128, allocated nonzeros=48128
          total number of mallocs used during MatSetValues calls=0
    Up solver (post-smoother) same as down solver (pre-smoother)
    linear system matrix = precond matrix:
    Mat Object: 6 MPI processes
      type: mpisbaij
      rows=2048, cols=2048, bs=2
      total: nonzeros=48128, allocated nonzeros=48128
      total number of mallocs used during MatSetValues calls=0
Solution statistics after solve: Full
CONVERGED_FNORM_RELATIVE: Number of SNES iterations = 5, total linear iterations = 22
|X|_2 564267.   -187.04 <= u <=  23814.8   -979.938 <= v <=  5720.23   3.24766 <= c <=  23904.5 
Surface statistics: u in [-6.945709e+01, 2.381387e+04] mean 1.520632e+04
Global eta range   2.50736e+09 to 9.2273e+12 converged range 2.50736e+09 to 3.8249e+10
Global beta2 range 0. to 4.97763e+09 converged range 0. to 4.97763e+09
