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


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


YES

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

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

We have the following SCCs.