1  void bar (void);
       2  
       3  int toto()
       4  {
       5    int i, j, k;
       6    int a[101][100];
       7    int b[100];
       8  
       9    for (i = 1; i < 100; i++)
      10      {
      11        for (j = 1; j < 100; j += i)
      12  	for (k = 1; k < 100; k++)
      13  	  a[j][k] = a[j+1][i-1] + 2;
      14  
      15        b[i] = b[i-1] + 2;
      16  
      17        for (j = 1; j < 100; j++)
      18  	a[j][i] = a[j+1][i-1] + 2;
      19  
      20        b[i] = b[i-1] + 2;
      21      }
      22  
      23    return a[3][5] + b[1];
      24  }
      25  
      26  /* { dg-final { scan-tree-dump-times "number of SCoPs: 2" 1 "graphite" { xfail *-*-* } } } */