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