Simulation gets stuck during profiling in Linux

[joaquimg]

Simulation gets stuck during profiling in Linux.

The linux fail happens consistently in CI (see jump-dev/open-energy-modeling-benchmarks#36 (comment)) and in my WSL virtual machine.

On Windows, things run smoothly.

MWE:

# necessary sienna stack
import PowerSystems
import PowerSimulations
import HydroPowerSimulations
import PowerSystemCaseBuilder
# solver
import JuMP
import HiGHS
# julia base
import Dates
import Logging
# profile
import Profile

# Profile.init() # default fails
# @show Profile.init(n = 10^6, delay = 0.001) #fails
# @show Profile.init(n = 10^6, delay = 0.1) # works

function build_and_solve(problem)
    PowerSimulations.build!(
        problem;
        output_dir = mktempdir(),
        console_level = Logging.Info,
    )
    PowerSimulations.solve!(problem; console_level = Logging.Info)
    return
end

function main()

    # case data is downloaded from a julia artifcat
    sys = PowerSystemCaseBuilder.build_system(
        PowerSystemCaseBuilder.PSISystems,
        "modified_RTS_GMLC_DA_sys",
    )

    template_uc = PowerSimulations.ProblemTemplate()

    PowerSimulations.set_device_model!(
        template_uc,
        PowerSystems.Line,
        PowerSimulations.StaticBranch,
    )
    PowerSimulations.set_device_model!(
        template_uc,
        PowerSystems.Transformer2W,
        PowerSimulations.StaticBranch,
    )
    PowerSimulations.set_device_model!(
        template_uc,
        PowerSystems.TapTransformer,
        PowerSimulations.StaticBranch,
    )

    PowerSimulations.set_device_model!(
        template_uc,
        PowerSystems.ThermalStandard,
        PowerSimulations.ThermalStandardUnitCommitment,
    )
    PowerSimulations.set_device_model!(
        template_uc,
        PowerSystems.RenewableDispatch,
        PowerSimulations.RenewableFullDispatch,
    )
    PowerSimulations.set_device_model!(
        template_uc,
        PowerSystems.PowerLoad,
        PowerSimulations.StaticPowerLoad,
    )
    PowerSimulations.set_device_model!(
        template_uc,
        PowerSystems.HydroDispatch,
        HydroPowerSimulations.HydroDispatchRunOfRiver,
    )
    PowerSimulations.set_device_model!(
        template_uc,
        PowerSystems.RenewableNonDispatch,
        PowerSimulations.FixedOutput,
    )

    PowerSimulations.set_service_model!(
        template_uc,
        PowerSystems.VariableReserve{PowerSystems.ReserveUp},
        PowerSimulations.RangeReserve,
    )
    PowerSimulations.set_service_model!(
        template_uc,
        PowerSystems.VariableReserve{PowerSystems.ReserveDown},
        PowerSimulations.RangeReserve,
    )

    solver =
        JuMP.optimizer_with_attributes(HiGHS.Optimizer, "mip_rel_gap" => 0.5)

    PowerSimulations.set_network_model!(
        template_uc,
        PowerSimulations.NetworkModel(PowerSimulations.CopperPlatePowerModel),
    )

    problem = PowerSimulations.DecisionModel(
        template_uc,
        sys;
        optimizer = solver,
        horizon = Dates.Hour(12),
        initial_time = Dates.DateTime("2020-01-01T00:00:00") +
                       Dates.Hour((29 - 1) * 24),
        optimizer_solve_log_print = true,
    )

    @show 1
    # precompile
    build_and_solve(problem)
    @show 2
    Profile.@profile build_and_solve(problem) # stuck here
    @show 3

    return
end

main()

see: jump-dev/open-energy-modeling-benchmarks#36 (comment)

[jd-lara]

@joaquimg I will make a new release of the packages and re-test

[jd-lara]

@joaquimg you should test this again with PowerSimulations @v0.29.1

[joaquimg]

The issue persists even on latest versions:

  [08572546] FlameGraphs v1.0.1
  [87dc4568] HiGHS v1.13.0
  [fc1677e0] HydroPowerSimulations v0.10.0
  [682c06a0] JSON v0.21.4
  [4076af6c] JuMP v1.23.6
  [e690365d] PowerSimulations v0.29.1
  [f00506e0] PowerSystemCaseBuilder v1.3.10
  [bcd98974] PowerSystems v4.4.1
  [ade2ca70] Dates
  [56ddb016] Logging
  [ea8e919c] SHA v0.7.0

[jd-lara]

@joaquimg I ran this in the cluster that uses Linux and it worked out fine. I can't reproduce the problem.

[ Info: Initializing Optimization Container For a DecisionModel
[ Info: Initializing ModelStoreParams
[ Info: Instantiating Network Model
[ Info: Validating connectivity with depth first search (network traversal)
[ Info: Make Initial Conditions Model
[ Info: Solving Initialization Model for GenericOpProblem
Running HiGHS 1.9.0 (git hash: 66f735e60): Copyright (c) 2024 HiGHS under MIT licence terms
Coefficient ranges:
  Matrix [2e-01, 4e+00]
  Cost   [7e+02, 6e+04]
  Bound  [5e-01, 8e+00]
  RHS    [9e-02, 3e+01]
Assessing feasibility of MIP using primal feasibility and integrality tolerance of       1e-06
WARNING: Row    162 has         infeasibility of        0.55 from [lower, value, upper] = [              0;            0.55;               0]
WARNING: Row    168 has         infeasibility of        3.55 from [lower, value, upper] = [              0;            3.55;               0]
WARNING: Row    486 has         infeasibility of       27.08 from [lower, value, upper] = [       32.48306;         59.5597;        32.48306]
Solution has               num          max          sum
Col     infeasibilities      0            0            0
Integer infeasibilities      0            0            0
Row     infeasibilities    243        27.79        381.1
Row     residuals            0            0            0
Attempting to find feasible solution by solving LP for user-supplied values of discrete variables
Coefficient ranges:
  Matrix [2e-01, 4e+00]
  Cost   [7e+02, 6e+04]
  Bound  [5e-01, 8e+00]
  RHS    [9e-02, 3e+01]
Presolving model
363 rows, 615 cols, 1335 nonzeros  0s
243 rows, 603 cols, 1203 nonzeros  0s
Presolve : Reductions: rows 243(-828); columns 603(-783); elements 1203(-2331)
Solving the presolved LP
Using EKK dual simplex solver - serial
  Iteration        Objective     Infeasibilities num(sum)
          0     7.0342175375e-04 Pr: 243(216.221) 0s
        254     2.8071944412e+05 Pr: 0(0); Du: 0(4.54747e-13) 0s
Solving the original LP from the solution after postsolve
Model status        : Optimal
Simplex   iterations: 254
Objective value     :  2.8071944412e+05
Relative P-D gap    :  8.2940689905e-16
HiGHS run time      :          0.09
Presolving model
975 rows, 1311 cols, 3363 nonzeros  0s
759 rows, 1095 cols, 3849 nonzeros  0s
411 rows, 1029 cols, 2229 nonzeros  0s
411 rows, 1029 cols, 2229 nonzeros  0s

MIP start solution is feasible, objective value is 280719.444124

Solving MIP model with:
   411 rows
   1029 cols (378 binary, 0 integer, 0 implied int., 651 continuous)
   2229 nonzeros

Src: B => Branching; C => Central rounding; F => Feasibility pump; H => Heuristic; L => Sub-MIP;
     P => Empty MIP; R => Randomized rounding; S => Solve LP; T => Evaluate node; U => Unbounded;
     z => Trivial zero; l => Trivial lower; u => Trivial upper; p => Trivial point

        Nodes      |    B&B Tree     |            Objective Bounds              |  Dynamic Constraints |       Work      
Src  Proc. InQueue |  Leaves   Expl. | BestBound       BestSol              Gap |   Cuts   InLp Confl. | LpIters     Time

         0       0         0   0.00%   0               280719.444124    100.00%        0      0      0         0     0.0s
 T       0       0         0   0.00%   0               246151.695016    100.00%        0      0      0       206     0.0s
         1       0         1 100.00%   246151.695016   246151.695016      0.00%        0      0      0       206     0.1s

Solving report
  Status            Optimal
  Primal bound      246151.695016
  Dual bound        246151.695016
  Gap               0% (tolerance: 50%)
  P-D integral      0.00224900245667
  Solution status   feasible
                    246151.695016 (objective)
                    0 (bound viol.)
                    0 (int. viol.)
                    0 (row viol.)
  Timing            0.07 (total)
                    0.00 (presolve)
                    0.00 (solve)
                    0.00 (postsolve)
  Max sub-MIP depth 0
  Nodes             1
  Repair LPs        0 (0 feasible; 0 iterations)
  LP iterations     206 (total)
                    0 (strong br.)
                    0 (separation)
                    0 (heuristics)
[ Info: Serialized initial conditions to /tmp/scratch/6687432/jl_3oIrX3/initial_conditions.bin
┌ Info: 
│ ─────────────────────────────────────────────────────────────────────────────────────────────────────
│                                                             Time                    Allocations      
│                                                    ───────────────────────   ────────────────────────
│                  Tot / % measured:                      24.9s /  88.1%           2.49GiB /  99.1%    
│ 
│ Section                                    ncalls     time    %tot     avg     alloc    %tot      avg
│ ─────────────────────────────────────────────────────────────────────────────────────────────────────
│ Problem GenericOpProblem                        1    22.0s  100.0%   22.0s   2.47GiB  100.0%  2.47GiB
│   Model Initialization                          1    15.8s   71.8%   15.8s   1.81GiB   73.2%  1.81GiB
│   Services                                      2    2.18s    9.9%   1.09s    340MiB   13.5%   170MiB
│   PowerSystems.ThermalStandard                  2    2.09s    9.5%   1.05s    181MiB    7.2%  90.3MiB
│   Build pre-step                                1    474ms    2.2%   474ms   31.6MiB    1.3%  31.6MiB
│   PowerSystems.RenewableDispatch                2   14.9ms    0.1%  7.46ms   2.34MiB    0.1%  1.17MiB
│   PowerSystems.RenewableNonDispatch             2   14.3ms    0.1%  7.15ms   2.31MiB    0.1%  1.15MiB
│   PowerSystems.Line                             2   7.36ms    0.0%  3.68ms   1.20MiB    0.0%   613KiB
│   PowerSystems.PowerLoad                        2   4.82ms    0.0%  2.41ms   2.81MiB    0.1%  1.41MiB
│   PowerSystems.HydroDispatch                    2   1.19ms    0.0%   594μs    156KiB    0.0%  78.1KiB
│   PowerSystems.TapTransformer                   2    798μs    0.0%   399μs    139KiB    0.0%  69.3KiB
│   Objective                                     1    281μs    0.0%   281μs    630KiB    0.0%   630KiB
│   PowerSimulations.CopperPlatePowerModel        1    109μs    0.0%   109μs    126KiB    0.0%   126KiB
│   PowerSystems.Transformer2W                    2   20.7μs    0.0%  10.4μs      736B    0.0%     368B
└ ─────────────────────────────────────────────────────────────────────────────────────────────────────
[ Info: GenericOpProblem optimizer set to: HiGHS
[ Info: Checking Numerical Bounds
[ Info: Variable bounds range is [0.0 8.47]
[ Info: Constraint coefficient bounds range is [-0.3 1.0]
[ Info: Constraint right-hand-side bounds [0.06 39.05484874999999]
Running HiGHS 1.9.0 (git hash: 66f735e60): Copyright (c) 2024 HiGHS under MIT licence terms
Coefficient ranges:
  Matrix [2e-01, 4e+00]
  Cost   [1e-02, 6e+04]
  Bound  [5e-01, 8e+00]
  RHS    [6e-02, 4e+01]
Assessing feasibility of MIP using primal feasibility and integrality tolerance of       1e-06
WARNING: Row      0 has         infeasibility of           1 from [lower, value, upper] = [              0;               1;               0]
WARNING: Row    672 has         infeasibility of        3.55 from [lower, value, upper] = [              0;            3.55;               0]
WARNING: Row   1944 has         infeasibility of       27.08 from [lower, value, upper] = [       32.48306;         59.5597;        32.48306]
Solution has               num          max          sum
Col     infeasibilities      0            0            0
Integer infeasibilities      0            0            0
Row     infeasibilities   1068        27.79         1554
Row     residuals            0            0            0
Attempting to find feasible solution by solving LP for user-supplied values of discrete variables
Coefficient ranges:
  Matrix [2e-01, 4e+00]
  Cost   [1e-02, 6e+04]
  Bound  [5e-01, 8e+00]
  RHS    [6e-02, 4e+01]
Presolving model
Problem status detected on presolve: Infeasible
Model status        : Infeasible
Objective value     :  0.0000000000e+00
HiGHS run time      :          0.00
Presolving model
5664 rows, 7205 cols, 25553 nonzeros  0s
4586 rows, 6270 cols, 28383 nonzeros  0s
3626 rows, 5739 cols, 22447 nonzeros  0s

Solving MIP model with:
   3626 rows
   5739 cols (1157 binary, 0 integer, 0 implied int., 4582 continuous)
   22446 nonzeros

Src: B => Branching; C => Central rounding; F => Feasibility pump; H => Heuristic; L => Sub-MIP;
     P => Empty MIP; R => Randomized rounding; S => Solve LP; T => Evaluate node; U => Unbounded;
     z => Trivial zero; l => Trivial lower; u => Trivial upper; p => Trivial point

        Nodes      |    B&B Tree     |            Objective Bounds              |  Dynamic Constraints |       Work      
Src  Proc. InQueue |  Leaves   Expl. | BestBound       BestSol              Gap |   Cuts   InLp Confl. | LpIters     Time

         0       0         0   0.00%   38507.832       inf                  inf        0      0      0         0     0.1s
         0       0         0   0.00%   298053.9894     inf                  inf        0      0      3      2938     0.3s
 C       0       0         0   0.00%   302974.049367   421407.103184     28.10%     1920    129     29      4367     0.7s
         1       0         1 100.00%   302974.049367   421407.103184     28.10%     1920    129     29      4367     0.7s

Solving report
  Status            Optimal
  Primal bound      421407.103184
  Dual bound        302974.049367
  Gap               28.1% (tolerance: 50%)
  P-D integral      0.00010593587092
  Solution status   feasible
                    421407.103184 (objective)
                    0 (bound viol.)
                    0 (int. viol.)
                    0 (row viol.)
  Timing            0.66 (total)
                    0.00 (presolve)
                    0.00 (solve)
                    0.00 (postsolve)
  Max sub-MIP depth 0
  Nodes             1
  Repair LPs        0 (0 feasible; 0 iterations)
  LP iterations     4367 (total)
                    0 (strong br.)
                    1429 (separation)
                    0 (heuristics)
[ Info: Serialized time series data to /tmp/scratch/6687432/jl_3oIrX3/system-a7a49c93-2eb6-4cfc-8264-8fca6614c581_time_series_storage.h5.
[ Info: Serialized System to /tmp/scratch/6687432/jl_3oIrX3/system-a7a49c93-2eb6-4cfc-8264-8fca6614c581.json
[ Info: Serialized System metadata to /tmp/scratch/6687432/jl_3oIrX3/system-a7a49c93-2eb6-4cfc-8264-8fca6614c581_metadata.json
┌ Info: Serialized OperationModel to
└   bin_file_name = "/tmp/scratch/6687432/jl_3oIrX3/model.bin"
[ Info: Serialize OptimizationProblemResults to /tmp/scratch/6687432/jl_3oIrX3/problem_results.bin
┌ Info: 
│ ───────────────────────────────────────────────────────────────────────────────
│                                       Time                    Allocations      
│                              ───────────────────────   ────────────────────────
│       Tot / % measured:           12.4s /  72.9%           1.20GiB /  95.3%    
│ 
│ Section              ncalls     time    %tot     avg     alloc    %tot      avg
│ ───────────────────────────────────────────────────────────────────────────────
│ Serialize                 1    4.09s   45.2%   4.09s    758MiB   64.7%   758MiB
│ Solve                     1    2.79s   30.8%   2.79s    148MiB   12.6%   148MiB
│ Results processing        1    2.17s   24.0%   2.17s    267MiB   22.7%   267MiB
└ ───────────────────────────────────────────────────────────────────────────────
2 = 2
[ Info: OptimizationProblem status not ModelBuildStatus.EMPTY. Resetting
[ Info: Initializing Optimization Container For a DecisionModel
[ Info: Initializing ModelStoreParams
[ Info: Instantiating Network Model
[ Info: Make Initial Conditions Model
[ Info: Solving Initialization Model for GenericOpProblem
Running HiGHS 1.9.0 (git hash: 66f735e60): Copyright (c) 2024 HiGHS under MIT licence terms
Coefficient ranges:
  Matrix [2e-01, 4e+00]
  Cost   [7e+02, 6e+04]
  Bound  [5e-01, 8e+00]
  RHS    [9e-02, 3e+01]
Assessing feasibility of MIP using primal feasibility and integrality tolerance of       1e-06
WARNING: Row    162 has         infeasibility of        0.55 from [lower, value, upper] = [              0;            0.55;               0]
WARNING: Row    168 has         infeasibility of        3.55 from [lower, value, upper] = [              0;            3.55;               0]
WARNING: Row    486 has         infeasibility of       27.08 from [lower, value, upper] = [       32.48306;         59.5597;        32.48306]
Solution has               num          max          sum
Col     infeasibilities      0            0            0
Integer infeasibilities      0            0            0
Row     infeasibilities    243        27.79        381.1
Row     residuals            0            0            0
Attempting to find feasible solution by solving LP for user-supplied values of discrete variables
Coefficient ranges:
  Matrix [2e-01, 4e+00]
  Cost   [7e+02, 6e+04]
  Bound  [5e-01, 8e+00]
  RHS    [9e-02, 3e+01]
Presolving model
363 rows, 615 cols, 1335 nonzeros  0s
243 rows, 603 cols, 1203 nonzeros  0s
Presolve : Reductions: rows 243(-828); columns 603(-783); elements 1203(-2331)
Solving the presolved LP
Using EKK dual simplex solver - serial
  Iteration        Objective     Infeasibilities num(sum)
          0     7.0342175375e-04 Pr: 243(216.221) 0s
        254     2.8071944412e+05 Pr: 0(0); Du: 0(4.54747e-13) 0s
Solving the original LP from the solution after postsolve
Model status        : Optimal
Simplex   iterations: 254
Objective value     :  2.8071944412e+05
Relative P-D gap    :  8.2940689905e-16
HiGHS run time      :          0.01
Presolving model
975 rows, 1311 cols, 3363 nonzeros  0s
759 rows, 1095 cols, 3849 nonzeros  0s
411 rows, 1029 cols, 2229 nonzeros  0s
411 rows, 1029 cols, 2229 nonzeros  0s

MIP start solution is feasible, objective value is 280719.444124

Solving MIP model with:
   411 rows
   1029 cols (378 binary, 0 integer, 0 implied int., 651 continuous)
   2229 nonzeros

Src: B => Branching; C => Central rounding; F => Feasibility pump; H => Heuristic; L => Sub-MIP;
     P => Empty MIP; R => Randomized rounding; S => Solve LP; T => Evaluate node; U => Unbounded;
     z => Trivial zero; l => Trivial lower; u => Trivial upper; p => Trivial point

        Nodes      |    B&B Tree     |            Objective Bounds              |  Dynamic Constraints |       Work      
Src  Proc. InQueue |  Leaves   Expl. | BestBound       BestSol              Gap |   Cuts   InLp Confl. | LpIters     Time

         0       0         0   0.00%   0               280719.444124    100.00%        0      0      0         0     0.0s
 T       0       0         0   0.00%   0               246151.695016    100.00%        0      0      0       206     0.0s
         1       0         1 100.00%   246151.695016   246151.695016      0.00%        0      0      0       206     0.0s

Solving report
  Status            Optimal
  Primal bound      246151.695016
  Dual bound        246151.695016
  Gap               0% (tolerance: 50%)
  P-D integral      0.0147755146027
  Solution status   feasible
                    246151.695016 (objective)
                    0 (bound viol.)
                    0 (int. viol.)
                    0 (row viol.)
  Timing            0.04 (total)
                    0.00 (presolve)
                    0.00 (solve)
                    0.00 (postsolve)
  Max sub-MIP depth 0
  Nodes             1
  Repair LPs        0 (0 feasible; 0 iterations)
  LP iterations     206 (total)
                    0 (strong br.)
                    0 (separation)
                    0 (heuristics)
[ Info: Serialized initial conditions to /tmp/scratch/6687432/jl_m99jhF/initial_conditions.bin
┌ Info: 
│ ─────────────────────────────────────────────────────────────────────────────────────────────────────
│                                                             Time                    Allocations      
│                                                    ───────────────────────   ────────────────────────
│                  Tot / % measured:                      778ms / 100.0%           57.8MiB / 100.0%    
│ 
│ Section                                    ncalls     time    %tot     avg     alloc    %tot      avg
│ ─────────────────────────────────────────────────────────────────────────────────────────────────────
│ Problem GenericOpProblem                        1    778ms  100.0%   778ms   57.7MiB  100.0%  57.7MiB
│   Build pre-step                                1    288ms   37.1%   288ms   4.72MiB    8.2%  4.72MiB
│   Model Initialization                          1    255ms   32.7%   255ms   14.5MiB   25.1%  14.5MiB
│   PowerSystems.RenewableNonDispatch             2   72.3ms    9.3%  36.2ms   2.33MiB    4.0%  1.17MiB
│   PowerSystems.ThermalStandard                  2   47.4ms    6.1%  23.7ms   19.2MiB   33.2%  9.59MiB
│   PowerSystems.RenewableDispatch                2   38.5ms    4.9%  19.2ms   2.34MiB    4.1%  1.17MiB
│   Services                                      2   24.3ms    3.1%  12.1ms   9.11MiB   15.8%  4.55MiB
│   PowerSystems.Line                             2   19.5ms    2.5%  9.76ms   1.20MiB    2.1%   613KiB
│   PowerSystems.PowerLoad                        2   8.52ms    1.1%  4.26ms   2.81MiB    4.9%  1.41MiB
│   PowerSystems.HydroDispatch                    2   6.77ms    0.9%  3.39ms    156KiB    0.3%  78.1KiB
│   PowerSystems.TapTransformer                   2   1.33ms    0.2%   666μs    139KiB    0.2%  69.3KiB
│   Objective                                     1    306μs    0.0%   306μs    630KiB    1.1%   630KiB
│   PowerSimulations.CopperPlatePowerModel        1    103μs    0.0%   103μs    126KiB    0.2%   126KiB
│   PowerSystems.Transformer2W                    2   15.8μs    0.0%  7.88μs      736B    0.0%     368B
└ ─────────────────────────────────────────────────────────────────────────────────────────────────────
[ Info: GenericOpProblem optimizer set to: HiGHS
[ Info: Checking Numerical Bounds
[ Info: Variable bounds range is [0.0 8.47]
[ Info: Constraint coefficient bounds range is [-0.3 1.0]
[ Info: Constraint right-hand-side bounds [0.06 39.05484874999999]
Running HiGHS 1.9.0 (git hash: 66f735e60): Copyright (c) 2024 HiGHS under MIT licence terms
Coefficient ranges:
  Matrix [2e-01, 4e+00]
  Cost   [1e-02, 6e+04]
  Bound  [5e-01, 8e+00]
  RHS    [6e-02, 4e+01]
Assessing feasibility of MIP using primal feasibility and integrality tolerance of       1e-06
WARNING: Row      0 has         infeasibility of           1 from [lower, value, upper] = [              0;               1;               0]
WARNING: Row    672 has         infeasibility of        3.55 from [lower, value, upper] = [              0;            3.55;               0]
WARNING: Row   1944 has         infeasibility of       27.08 from [lower, value, upper] = [       32.48306;         59.5597;        32.48306]
Solution has               num          max          sum
Col     infeasibilities      0            0            0
Integer infeasibilities      0            0            0
Row     infeasibilities   1068        27.79         1554
Row     residuals            0            0            0
Attempting to find feasible solution by solving LP for user-supplied values of discrete variables
Coefficient ranges:
  Matrix [2e-01, 4e+00]
  Cost   [1e-02, 6e+04]
  Bound  [5e-01, 8e+00]
  RHS    [6e-02, 4e+01]
Presolving model
Problem status detected on presolve: Infeasible
Model status        : Infeasible
Objective value     :  0.0000000000e+00
HiGHS run time      :          0.00
Presolving model
5664 rows, 7205 cols, 25553 nonzeros  0s
4586 rows, 6270 cols, 28383 nonzeros  0s
3626 rows, 5739 cols, 22447 nonzeros  0s

Solving MIP model with:
   3626 rows
   5739 cols (1157 binary, 0 integer, 0 implied int., 4582 continuous)
   22446 nonzeros

Src: B => Branching; C => Central rounding; F => Feasibility pump; H => Heuristic; L => Sub-MIP;
     P => Empty MIP; R => Randomized rounding; S => Solve LP; T => Evaluate node; U => Unbounded;
     z => Trivial zero; l => Trivial lower; u => Trivial upper; p => Trivial point

        Nodes      |    B&B Tree     |            Objective Bounds              |  Dynamic Constraints |       Work      
Src  Proc. InQueue |  Leaves   Expl. | BestBound       BestSol              Gap |   Cuts   InLp Confl. | LpIters     Time

         0       0         0   0.00%   38507.832       inf                  inf        0      0      0         0     0.2s
         0       0         0   0.00%   298053.9894     inf                  inf        0      0      3      2938     0.4s
 C       0       0         0   0.00%   302974.049367   421407.103184     28.10%     1920    129     29      4367     1.2s
         1       0         1 100.00%   302974.049367   421407.103184     28.10%     1920    129     29      4367     1.2s

Solving report
  Status            Optimal
  Primal bound      421407.103184
  Dual bound        302974.049367
  Gap               28.1% (tolerance: 50%)
  P-D integral      0.000748050640706
  Solution status   feasible
                    421407.103184 (objective)
                    0 (bound viol.)
                    0 (int. viol.)
                    0 (row viol.)
  Timing            1.17 (total)
                    0.00 (presolve)
                    0.00 (solve)
                    0.00 (postsolve)
  Max sub-MIP depth 0
  Nodes             1
  Repair LPs        0 (0 feasible; 0 iterations)
  LP iterations     4367 (total)
                    0 (strong br.)
                    1429 (separation)
                    0 (heuristics)
[ Info: Serialized time series data to /tmp/scratch/6687432/jl_m99jhF/system-a7a49c93-2eb6-4cfc-8264-8fca6614c581_time_series_storage.h5.
[ Info: Serialized System to /tmp/scratch/6687432/jl_m99jhF/system-a7a49c93-2eb6-4cfc-8264-8fca6614c581.json
[ Info: Serialized System metadata to /tmp/scratch/6687432/jl_m99jhF/system-a7a49c93-2eb6-4cfc-8264-8fca6614c581_metadata.json
┌ Info: Serialized OperationModel to
└   bin_file_name = "/tmp/scratch/6687432/jl_m99jhF/model.bin"
[ Info: Serialize OptimizationProblemResults to /tmp/scratch/6687432/jl_m99jhF/problem_results.bin
┌ Info: 
│ ───────────────────────────────────────────────────────────────────────────────
│                                       Time                    Allocations      
│                              ───────────────────────   ────────────────────────
│       Tot / % measured:           1.59s /  99.9%            148MiB /  99.8%    
│ 
│ Section              ncalls     time    %tot     avg     alloc    %tot      avg
│ ───────────────────────────────────────────────────────────────────────────────
│ Solve                     1    1.26s   79.3%   1.26s   31.7MiB   21.4%  31.7MiB
│ Serialize                 1    322ms   20.3%   322ms    116MiB   78.1%   116MiB
│ Results processing        1   7.47ms    0.5%  7.47ms    802KiB    0.5%   802KiB
└ ───────────────────────────────────────────────────────────────────────────────
3 = 3