1  /* { dg-require-effective-target size32plus } */
       2  
       3  #define N 10000
       4  void foo (int);
       5  int test ()
       6  {
       7    int a[N][N];
       8    int i, j;
       9  
      10    for (i = 0; i < N; i++) 
      11      for (j = 0; j < N; j++)
      12  	a[i][j] = i*j;
      13  
      14    for (i = 1; i < N; i++) 
      15      for (j = 1; j < (N-1) ; j++)
      16  	a[i][j] = a[i-1][j+1] * a[i-1][j+1]/2;
      17  
      18    for (i = 0; i < N; i++) 
      19      for (j = 0; j < N; j++)
      20        foo (a[i][j]); 
      21  }
      22  
      23  /* { dg-final { scan-tree-dump-times "number of SCoPs: 1" 1 "graphite"} } */