2.1.4.1 New copy of a list

C code 
Spl encoding

#include "intlist.h"

/* acyclic(x) and l[x]==_l and data(x)  */
intlist listCopy(intlist x) {
  intlist xi = x;
  intlist y = NULL;
  intlist yi = NULL;;
  intlist z = NULL;
  while (xi != NULL) {
    z = new();
    z->data = xi->data;
    z->next = NULL;
    if (y == NULL) 
      y = z;
    else
      yi->next = z;
    yi = z;
    xi = xi->next;
  }
  return y;
}


var _data:real, _free:real, _len:real, 
    _new:real, _next:real, _null:real,
    x:real, xi:real, y:real, yi:real, z:real,
    _l:int, _k:int, S: int;
begin
  assume (x == 0);
  xi = _null; z = _null;
  yi = _null; y = _null;
  xi = x;
  while xi != _null do
    z = _new;
    z = (xi* _data)/ _data;
    z = (_null)/_next;
    if (y == _null) then
      y = z;
    else
      yi = z / _next;
    endif;
    yi = _null;
    yi = z;
    z = _null;
    z = xi * _next;
    xi = _null;
    xi = z;
    z = _null;
  done;
end

Results

Domain 
Param. 
Log file 
Interesting constraint

LSUM-PRD
Anon=(0,1)
log/intlist-newCopy-lsum-prd-01
x(n1) and y(n2) and yi(n3) and
l=l[n1]=l[n2]+1 and l[n3]=1 and
d(n1)=d(n2) and S(n3)=0 and S[n1]=S[n2]+d(n3)

LSUM-REL
Anon=(0,1)
log/intlist-newCopy-lsum-rel-01
x(n1) and y(n2) and yi(n3) and
l=l[n1]=l[n2]+1 and l[n3]=1 and
d(n1)=d(n2) and S(n3)=0 and S[n1]=S[n2]+d(n3)

MSET
TODO
TODO
x(n1) and y(n2) and yi(n3) and
M[n1]=M[n2]+M[n3]

UCONS
Anon=(0,2)
TODO
x(n1) and y(n2) and yi(n3) and
l=l[n1]=l[n2]+1 and l[n3]=1 and
d(n1)=d(n2) and \forall y1\in n1, y2\in n2. y1=y2 \implies d(y1)=d(y2)