n>0 has 2 states: 0ms
 i>=1 has 2 states: 1ms
  (i>=1&endsIn2Zeros(i)) has 2 states: 0ms
   ((i>=1&endsIn2Zeros(i))&endsIn2Zeros(n)) has 2 states: 1ms
    k<(2*n) has 3 states: 1ms
     PF[f][(i+k)]=PF[f][((i+k)+n)] has 34 states: 9ms
      (k<(2*n)=>PF[f][(i+k)]=PF[f][((i+k)+n)]) has 71 states: 4ms
       (A k (k<(2*n)=>PF[f][(i+k)]=PF[f][((i+k)+n)])) has 18 states: 76ms
        (((i>=1&endsIn2Zeros(i))&endsIn2Zeros(n))&(A k (k<(2*n)=>PF[f][(i+k)]=PF[f][((i+k)+n)]))) has 19 states: 0ms
         (E f , i (((i>=1&endsIn2Zeros(i))&endsIn2Zeros(n))&(A k (k<(2*n)=>PF[f][(i+k)]=PF[f][((i+k)+n)])))) has 2 states: 1ms
          (n>0&(E f , i (((i>=1&endsIn2Zeros(i))&endsIn2Zeros(n))&(A k (k<(2*n)=>PF[f][(i+k)]=PF[f][((i+k)+n)]))))) has 2 states: 0ms
total computation time: 94ms