Disproving the perfect-rate property of data-flow graphs unfolded by the least common multiple of the number of loop register

In their 1991 paper "Static Rate-Optimal Scheduling of Iterative Data-Flow Programs via Optimum Unfolding", Parhi and Messerschmidt stated a perfect-rate property on unfolded data-flow graphs (DFGs). This is disproven by a simple counter example.