source: CIVL/mods/dev.civl.com/examples/bench/assignments.cvl@ cb4d4f4

#ifdef SIMPLIFY  // run CIVL with simplify, slow, so smaller N
#define N 3000  
#else
#define N 10000
#endif
#define M 100

#include <stdio.h>

int main() {
  int x[N][M];
  
  printf("N = %d\n", N);
  
  for (int i = 0; i < N; i++) 
    x[i] = (int[M])$lambda(int j)i;

  $assert(x[N-1][M-1] == N-1);
}