MAYBE

DP problem for innermost termination.
P =
  init# -> f1# 
  f2# -> f2# 
  f1# -> f2# 
R = 
  init -> f1 
  f2 -> f2 
  f1 -> f2 

The dependency graph for this problem is:
  0 -> 2
  1 -> 1
  2 -> 1
Where:
  0) init# -> f1# 
  1) f2# -> f2# 
  2) f1# -> f2# 

We have the following SCCs.
  { 1 }

DP problem for innermost termination.
P =
  f2# -> f2# 
R = 
  init -> f1 
  f2 -> f2 
  f1 -> f2