/export/starexec/sandbox2/solver/bin/starexec_run_Transition /export/starexec/sandbox2/benchmark/theBenchmark.smt2 /export/starexec/sandbox2/output/output_files


--------------------------------------------------------------------------------


MAYBE

DP problem for innermost termination.
P =
  f5# -> f4# [0 <= 0]
  f4# -> f3# [0 <= 0]
  f3# -> f1# [0 <= 0]
  f1# -> f3# [0 <= 0]
  f2# -> f1# [0 <= 0]
  f1# -> f2# [0 <= 0]
R = 
  f5 -> f4 [0 <= 0]
  f4 -> f3 [0 <= 0]
  f3 -> f1 [0 <= 0]
  f1 -> f3 [0 <= 0]
  f2 -> f1 [0 <= 0]
  f1 -> f2 [0 <= 0]

The dependency graph for this problem is:
  0 -> 1
  1 -> 2
  2 -> 3, 5
  3 -> 2
  4 -> 3, 5
  5 -> 4
Where:
  0) f5# -> f4# [0 <= 0]
  1) f4# -> f3# [0 <= 0]
  2) f3# -> f1# [0 <= 0]
  3) f1# -> f3# [0 <= 0]
  4) f2# -> f1# [0 <= 0]
  5) f1# -> f2# [0 <= 0]

We have the following SCCs.
  { 2, 3, 4, 5 }

DP problem for innermost termination.
P =
  f3# -> f1# [0 <= 0]
  f1# -> f3# [0 <= 0]
  f2# -> f1# [0 <= 0]
  f1# -> f2# [0 <= 0]
R = 
  f5 -> f4 [0 <= 0]
  f4 -> f3 [0 <= 0]
  f3 -> f1 [0 <= 0]
  f1 -> f3 [0 <= 0]
  f2 -> f1 [0 <= 0]
  f1 -> f2 [0 <= 0]