About the output when running on a ResNet18 pretrained model about alpha-beta-crown HOT 3 CLOSED

# This is an example configuration file that contains most useful parameter settings.
model:
  name: partial(ResNet18, in_planes=64)
  path: checkpoints/GAT_CIFAR10_ResNet18.pkl
data:
  dataset: CIFAR
  mean: [0.0, 0.0, 0.0]  # Mean for normalization.
  std: [1.0, 1.0, 1.0]  # Std for normalization.
  start: 0  # First example to verify in dataset.
  end: 1000  # Last example to verify in dataset.
specification:
  norm: .inf  # Linf norm (can also be 2 or 1).
  epsilon: 0.00784313725490196  # epsilon=2./255.
attack:  # Currently attack is only implemented for Linf norm.
  pgd_steps: 100  # Increase for a stronger attack. A PGD attack will be used before verification to filter on non-robust data examples.
  pgd_restarts: 30  # Increase for a stronger attack.
solver:
  batch_size: 8  # Number of subdomains to compute in parallel in bound solver. Decrease if you run out of memory.
  crown:
    batch_size: 8
    max_crown_size: 8
  alpha-crown:
    iteration: 100   # Number of iterations for alpha-CROWN optimization. Alpha-CROWN is used to compute all intermediate layer bounds before branch and bound starts.
    lr_alpha: 0.1    # Learning rate for alpha in alpha-CROWN. The default (0.1) is typically ok.
  beta-crown:
    lr_alpha: 0.01  # Learning rate for optimizing the alpha parameters, the default (0.01) is typically ok, but you can try to tune this parameter to get better lower bound.
    lr_beta: 0.05  # Learning rate for optimizing the beta parameters, the default (0.05) is typically ok, but you can try to tune this parameter to get better lower bound.
    iteration: 20  # Number of iterations for beta-CROWN optimization. 20 is often sufficient, 50 or 100 can also be used.
bab:
  timeout: 120  # Timeout threshold for branch and bound. Increase for verifying more points.
  branching:  # Parameters for branching heuristics.
    reduceop: min  # Reduction function for the branching heuristic scores, min or max. Using max can be better on some models.
    method: kfsb  # babsr is fast but less accurate; fsb is slow but most accurate; kfsb is usually a balance.
    candidates: 3  # Number of candidates to consider in fsb and kfsb. More leads to slower but better branching. 3 is typically good enough.

Result: unknown in 121.7578 seconds