9 for (i = 1; i < 100; i++)
11 for (j = 1; j < 100; j++)
12 b[i+j] = b[i+j-1] + 2;
18 for (j = 1; j < 100; j++)
19 b[i+j] = b[i+j-1] + 2;
23 for (k = 1; k < 100; k++)
24 b[i+k] = b[i+k-5] + 2;
27 return a[3][5] + b[1];
30 /* { dg-final { scan-tree-dump-times "number of SCoPs: 3" 1 "graphite"} } */
31 /* { dg-final { cleanup-tree-dump "graphite" } } */