Memory leaks (Valgrind) in elina_poly about elina HOT 7 CLOSED

BEGIN opt_poly_asssub_linexpr_det
nbrows: 0
nbvertex: 0
nbline: 1
poly[res]->intdim: 1
BEGIN opt_poly_asssub_linexpr_det
free(): invalid next size (fast)

poly_a[k] data:
intdim: 1
realdim: 0
nbeq: 1
nbline: 0
is_minimized: 0
status: 0
C.nbcolumns: 3
C.nbrows: 1
F.nbcolumns: 3
F.nbrows: 1
satC.nbcolumns: 1
satC.nbrows: 1
calling opt_poly_clear(poly_a[k]); ...
free(): invalid next size (fast)

for(k=0; k < num_compa;k++){
	printf("poly_a[k] data for k=%d, num_compa=%d:\n", k, num_compa);
	printf("intdim: %d\n", poly_a[k]->intdim);
	printf("realdim: %d\n", poly_a[k]->realdim);
	printf("nbeq: %ld\n", poly_a[k]->nbeq);
	printf("nbline: %ld\n", poly_a[k]->nbline);
	printf("is_minimized: %d\n", poly_a[k]->is_minimized);
	printf("status: %d\n", poly_a[k]->status);
	printf("C->nbcolumns: %d\n", poly_a[k]->C->nbcolumns);
	printf("C->nbrows: %ld\n", poly_a[k]->C->nbrows);
	printf("F->nbcolumns: %d\n", poly_a[k]->F->nbcolumns);
	printf("F->nbrows: %ld\n", poly_a[k]->F->nbrows);
	printf("satC->nbcolumns: %ld\n", poly_a[k]->satC->nbcolumns);
	printf("satC->nbrows: %ld\n", poly_a[k]->satC->nbrows);
	if(!disjoint_map[k]){
		printf("calling opt_poly_clear(poly_a[k])...\n");
		opt_poly_clear(poly_a[k]);
		printf("Call to opt_poly_clear(poly_a[k]) completed\n");
	}
	free(poly_a[k]);
}

    op->poly = poly;
    op->acl = acl;
    free(exc_map);
    printf("ASSIGN OUTPUT\n");
    // print_array_comp_list(acl,op->maxcols);
    elina_lincons0_array_t arr1 = opt_pk_to_lincons_array(man,op);
    elina_lincons0_array_fprint(stdout, &arr1, NULL);
    // elina_lincons0_array_clear(&arr1);
    fflush(stdout);
    printf("Exiting from opt_poly_asssub_linexpr_det");
    return op;

ASSIGN INPUT
0
empty array of constraints
x0:= 2147483648
ASSIGN OUTPUT
1
array of constraints of size 1
 0: -x0 + 2147483648 = 0
Exiting from opt_poly_asssub_linexpr_det
ASSIGN INPUT
1
array of constraints of size 1
 0: -x0 + 2147483648 = 0
x1:= x0
1
c
3 

poly_a[k] data for k=0, num_compa=1:
intdim: 1
realdim: 0
nbeq: 1
nbline: 0
is_minimized: 0
status: 0
C->nbcolumns: 3
C->nbrows: 1
F->nbcolumns: 3
F->nbrows: 1
satC->nbcolumns: 1
satC->nbrows: 1
calling opt_poly_clear(poly_a[k])...
free(): invalid next size (fast)

elina_dim_t * tdim = (elina_dim_t *)malloc(sizeof(elina_dim_t));
tdim[0] = 0;
elina_linexpr0_t ** expr_array = (elina_linexpr0_t**)malloc(sizeof(elina_linexpr0_t*));
//elina_linexpr0_t * linexpr0 = generate_random_linexpr0(dim);
elina_coeff_t *cst, *coeff;
elina_linexpr0_t * linexpr0 = elina_linexpr0_alloc(ELINA_LINEXPR_SPARSE,0);
cst = &linexpr0->cst;
elina_scalar_set_to_int(cst->val.scalar,2147483648,ELINA_SCALAR_MPQ);

expr_array[0] = linexpr0;
printf("ELINA Input Polyhedron\n");
elina_lincons0_array_t arr1 = opt_pk_to_lincons_array(man,oa1);
elina_lincons0_array_fprint(stdout,&arr1,NULL);
printf("Assignment statement\n");
printf("x%d = ",tdim[0]);
elina_linexpr0_fprint(stdout,linexpr0,NULL);
printf("\n");
fflush(stdout);
elina_lincons0_array_clear(&arr1);
//assign;
opt_pk_assign_linexpr_array(man,true,oa1,tdim, expr_array,1,NULL);
elina_linexpr0_free(linexpr0);

// Print the result
printf("ELINA Output Polyhedron\n");
elina_lincons0_array_t arr = opt_pk_to_lincons_array(man,oa1);
elina_lincons0_array_fprint(stdout,&arr,NULL);
printf("\n");
fflush(stdout);
elina_lincons0_array_clear(&arr);

tdim[0] = 1;
linexpr0 = elina_linexpr0_alloc(ELINA_LINEXPR_SPARSE,1);
cst = &linexpr0->cst;
//int r = rand()%10;
elina_scalar_set_to_int(cst->val.scalar,0,ELINA_SCALAR_MPQ);
elina_linterm_t * linterm = &linexpr0->p.linterm[0];
linterm->dim = 0;
coeff = &linterm->coeff;
elina_scalar_set_to_int(coeff->val.scalar,1,ELINA_SCALAR_MPQ);
expr_array[0] = linexpr0;
//opt_pk_array_t * oa3 = 
opt_pk_assign_linexpr_array(man,true,oa1,tdim, expr_array,1,NULL);

printf("ELINA Output Polyhedron\n");
arr = opt_pk_to_lincons_array(man,oa1);
elina_lincons0_array_fprint(stdout,&arr,NULL);
printf("\n");
fflush(stdout);
elina_lincons0_array_clear(&arr);

free(expr_array);
free(tdim);

opt_pk_free(man,oa1);
elina_manager_free(man);