source: CIVL/examples/contracts/contractsMPI/diffusion1d_dev-bad-update.c@ 3f4612f

#include<mpi.h>
#include<civlc.cvh>
int left, right, nxl, nx, rank, nprocs;
double * u, * u_new, k;

#define OWNER(index) ((nprocs*(index+1)-1)/nx)

#define LOCAL_OF(index)  u[index - (OWNER(index)*nx/nprocs)]

/*@ \mpi_collective(MPI_COMM_WORLD, P2P):
  @   requires rank == \mpi_comm_rank;
  @   requires nxl > 0 && nxl < 5;         //nxl shall not equal to zero
  @   requires \mpi_valid(u, nxl + 2, MPI_DOUBLE);
  @   behavior maxrank:
  @     assumes rank == \mpi_comm_size - 1;
  @     requires right == MPI_PROC_NULL && left == rank - 1;
  @     assigns  \mpi_region(u, 1, MPI_DOUBLE);
  @     ensures  \on(left, u[nxl]) == u[0];       
  @     waitsfor left;
  @   behavior minrank:
  @     assumes rank == 0;
  @     requires left == MPI_PROC_NULL && right == rank + 1;
  @     assigns  \mpi_region(&u[nxl+1], 1, MPI_DOUBLE);
  @     ensures  \on(right, u[1]) == u[nxl + 1];        
  @     waitsfor right;
  @   behavior others:
  @     assumes 0 < rank && rank < \mpi_comm_size - 1;
  @     requires left == rank - 1 && right == rank + 1;
  @     assigns  \mpi_region(u, 1, MPI_DOUBLE), 
  @              \mpi_region(&u[nxl+1], 1, MPI_DOUBLE);
  @     ensures  \on(left, u[nxl]) == u[0];             
  @     ensures  \on(right, u[1]) == u[nxl + 1];        
  @     waitsfor left, right;      
  @*/
void exchange_ghost_cells() {
  MPI_Sendrecv(&u[1], 1, MPI_DOUBLE, left, 0,
               &u[nxl+1], 1, MPI_DOUBLE, right, 0,
               MPI_COMM_WORLD, MPI_STATUS_IGNORE);
  MPI_Sendrecv(&u[nxl], 1, MPI_DOUBLE, right, 0,
               &u[0], 1, MPI_DOUBLE, left, 0,
               MPI_COMM_WORLD, MPI_STATUS_IGNORE);
}

// \valid(u + (0 .. (nxl + 2))) is too weak for caller function, bad.

/*@ requires \valid(u + (0 .. (nxl + 2)));
  @ requires \valid(u_new + (0 .. (nxl + 2)));
  @ requires nxl > 0 && nxl <= 4;
  @ requires k > 0;
  @ assigns  u[1 .. (nxl + 1)];
  @ ensures  \forall int i; 0< i && i <= nxl
  @           ==> 
  @          u[i] == \old(u[i] + k*(u[i+1] + u[i-1] - 2*u[i]));
  @*/
void update() {
  for (int i = 1; i <= nxl; i++)
    u_new[i] = u[i] + k*(u[i+1] + u[i-1] - 2*u[i]);
  double * tmp = u_new; u_new=u; u=tmp;
}

/*@ 
  @ \mpi_collective(MPI_COMM_WORLD, P2P):
  @   requires rank == \mpi_comm_rank;
  @   requires nprocs == \mpi_comm_size;
  @   requires nxl > 0 && nxl < 5 && nxl < nx && nx < 10 && 5 < nx;
  @   requires \mpi_valid(u, nxl + 2, MPI_DOUBLE);
  @   requires \mpi_valid(u_new, nxl + 2, MPI_DOUBLE);
  @   requires  nx == \sum(0, \mpi_comm_size - 1, 
  @                    (\lambda int k; \on(k, nxl)));
  @   requires k > 0.0;
  @   requires \mpi_agree(nx) && \mpi_agree(k);
  @   ensures 
  @            \on(OWNER(1), LOCAL_OF(1)) == 
  @            \old( \on(OWNER(1), LOCAL_OF(1)) + k* (\on(OWNER(1+1), LOCAL_OF(1+1)) + \on(OWNER(1-1), LOCAL_OF(1-1)) - 2*\on(OWNER(1), LOCAL_OF(1))) ); 
  @   behavior maxrank:
  @     assumes rank == \mpi_comm_size - 1;
  @     requires right == MPI_PROC_NULL && left == rank - 1;
  @   behavior minrank:
  @     assumes rank == 0;
  @     requires left == MPI_PROC_NULL && right == 1;
  @   behavior others:
  @     assumes 0 < rank && rank < \mpi_comm_size - 1;
  @     requires left == rank - 1 && right == rank + 1;
  @*/
void diff1dIter() {
  $elaborate(nxl);
  exchange_ghost_cells();
  update();
}