Changeset 0001f9 in git

Timestamp:

Jan 5, 2006, 7:32:19 PM (18 years ago)

Author:

Hans Schönemann <hannes@…>

Branches:

(u'spielwiese', 'fe61d9c35bf7c61f2b6cbf1b56e25e2f08d536cc')

Children:

44f7bcdefb6eab48841c3b44943126dc814d480e

Parents:

f764969054eb825a57286a74a605b9a43ee1a84c

Message:

*hannes: sun port, memory leaks


git-svn-id: file:///usr/local/Singular/svn/trunk@8883 2c84dea3-7e68-4137-9b89-c4e89433aadc

File:

• Singular/walk.cc (modified) (319 diffs)

Singular/walk.cc

@@ -2 +2 @@
 *  Computer Algebra System SINGULAR      *
 *****************************************/
-/* $Id: walk.cc,v 1.8 2005-05-31 07:42:20 bricken Exp $ */
+/* $Id: walk.cc,v 1.9 2006-01-05 18:32:19 Singular Exp $ */
 /*
 * ABSTRACT: Implementation of the Groebner walk
@@ -13 +13 @@
 
 //#define UPPER_BOUND //for the original "Tran" algorithm
-//#define REPRESENTATION_OF_SIGMA //if one perturbs sigma in Tran 
+//#define REPRESENTATION_OF_SIGMA //if one perturbs sigma in Tran
 
 //#define TEST_OVERFLOW
@@ -108 +108 @@
 clock_t xtif, xtstd, xtlift, xtred, xtnw;
 clock_t xftostd, xtextra, xftinput, to;
- 
+
 /*2
 *utilities for TSet, LSet
@@ -307 +307 @@
   strat->sevT        = initsevT();
   if (pOrdSgn == -1)   strat->honey = TRUE;
-  
-  
+
+
   //initSCC(F,Q,strat);
   initS(F,Q,strat);
@@ -354 +354 @@
 }
 
-static void TimeString(clock_t tinput, clock_t tostd, clock_t tif,clock_t tstd, 
-                       clock_t tlf,clock_t tred, clock_t tnw, int step)
-{
-  double totm = ((double) (clock() - tinput))/1000000; 
+static void TimeString(clock_t tinput, clock_t tostd, clock_t tif,clock_t tstd,
+                       clock_t tlf,clock_t tred, clock_t tnw, int step)
+{
+  double totm = ((double) (clock() - tinput))/1000000;
   double ostd,mostd, mif, mstd, mextra, mlf, mred, mnw, mxif,mxstd,mxlf,mxred,mxnw,tot;
 
@@ -388 +388 @@
   double res = (double) 100 - tot;
   Print("\n// &%d&%.2f&%.2f&%.2f&%.2f&%.2f&%.2f&%.2f&%.2f&%.2f&%.2f&%.2f&%.2f&%.2f&%.2f&%.2f(%.2f)\\ \\",
-        step, ostd, totm, mostd,mif,mstd,mlf,mred,mnw,mxif,mxstd,mxlf,mxred,mxnw,tot,res,
-        ((((double) xtextra)/1000000)/totm)*100);
-}
-
-static void TimeStringFractal(clock_t tinput, clock_t tostd, clock_t tif,clock_t tstd, 
-                       clock_t textra, clock_t tlf,clock_t tred, clock_t tnw)
-{
-  
+        step, ostd, totm, mostd,mif,mstd,mlf,mred,mnw,mxif,mxstd,mxlf,mxred,mxnw,tot,res,
+        ((((double) xtextra)/1000000)/totm)*100);
+}
+
+static void TimeStringFractal(clock_t tinput, clock_t tostd, clock_t tif,clock_t tstd,
+                       clock_t textra, clock_t tlf,clock_t tred, clock_t tnw)
+{
+
   double totm = ((double) (clock() - tinput))/1000000;
   double ostd, mostd, mif, mstd, mextra, mlf, mred, mnw, tot, res;
@@ -415 +415 @@
   tot = mostd+mif+mstd+mextra+mlf+mred+mnw;
   res = (double) 100.00-tot;
-  Print("\n// &%.2f &%.2f&%.2f &%.2f &%.2f &%.2f &%.2f &%.2f &%.2f&%.2f&%.2f\\ \\ ", 
-        ostd,totm,mostd,mif,mstd,mextra,mlf,mred,mnw,tot,res);
+  Print("\n// &%.2f &%.2f&%.2f &%.2f &%.2f &%.2f &%.2f &%.2f &%.2f&%.2f&%.2f\\ \\ ",
+        ostd,totm,mostd,mif,mstd,mextra,mlf,mred,mnw,tot,res);
 }
 
 static void idString(ideal L, char* st)
 {
-  int i, nL = IDELEMS(L); 
+  int i, nL = IDELEMS(L);
 
   Print("\n//  ideal %s =  ", st);
   for(i=0; i<nL-1; i++)
     Print(" %s, ", pString(L->m[i]));
-    
+
   Print(" %s;", pString(L->m[nL-1]));
 }
@@ -432 +432 @@
 static void headidString(ideal L, char* st)
 {
-  int i, nL = IDELEMS(L); 
+  int i, nL = IDELEMS(L);
 
   Print("\n//  ideal %s =  ", st);
   for(i=0; i<nL-1; i++)
     Print(" %s, ", pString(pHead(L->m[i])));
-    
+
   Print(" %s;", pString(pHead(L->m[nL-1])));
 }
@@ -443 +443 @@
 static void idElements(ideal L, char* st)
 {
-  int i, nL = IDELEMS(L); 
-  int K[nL];
+  int i, nL = IDELEMS(L);
+  int *K=(int *)omAlloc(nL*sizeof(int));
 
   Print("\n//  #monoms of %s =  ", st);
@@ -457 +457 @@
       nsame = 1;
       for(j=i+1; j<nL; j++){
-        if(K[j]==K[i]){
-          nsame ++;
-          K[j]=0;         
-        }
+        if(K[j]==K[i]){
+          nsame ++;
+          K[j]=0;
+        }
       }
       if(nsame == 1)
-        Print("%d, ",K[i]);
+        Print("%d, ",K[i]);
       else
-        Print("%d[%d], ", K[i], nsame);
-    }
-  }
+        Print("%d[%d], ", K[i], nsame);
+    }
+  }
+  omFree(K);
 }
 
@@ -495 +496 @@
     Print("%d, ", (*ivb)[i]);
   Print("%d) := (", (*ivb)[nV]);
-  
+
   for(i=0; i<nV; i++)
     Print("%d, ", (*ivc)[i]);
@@ -558 +559 @@
 
   int i, wgrad;
-  
+
   mpz_t zmul;
   mpz_init(zmul);
@@ -565 +566 @@
   mpz_t zsum;
   mpz_init(zsum);
-  
+
   for (i=pVariables; i>0; i--)
   {
@@ -585 +586 @@
     }
   }
-  
+
   return wgrad;
 }
@@ -602 +603 @@
     pIter(p);
 
-    if (maxtemp > max) 
+    if (maxtemp > max)
       max = maxtemp;
   }
@@ -619 +620 @@
 
   int i, wgrad;
-  
+
   mpz_t zmul;
   mpz_init(zmul);
@@ -634 +635 @@
   }
   mpz_init_set(result, ztmp);
+  mpz_clear(ztmp);
+  mpz_clear(sing_int);
+  mpz_clear(zvec);
+  mpz_clear(zmul);
 }
 
@@ -647 +652 @@
   mpz_t max; mpz_init(max);
   mpz_t maxtmp; mpz_init(maxtmp);
- 
-  poly hg, in_w_g = NULL;    
+
+  poly hg, in_w_g = NULL;
 
   while(g != NULL)
@@ -656 +661 @@
     MLmWeightedDegree_gmp(maxtmp, hg, curr_weight);
 
-    if(mpz_cmp(maxtmp, max)>0)  
+    if(mpz_cmp(maxtmp, max)>0)
     {
       mpz_init_set(max, maxtmp);
       pDelete(&in_w_g);
       in_w_g = pHead(hg);
-    } 
+    }
     else {
       if(mpz_cmp(maxtmp, max)==0)
@@ -713 +718 @@
     mi = MpolyInitialForm(G->m[i], iv);
     gi = G->m[i];
-    
+
     if(mi == NULL)
     {
       pDelete(&mi);
-  
+
       if(Overflow_Error == FALSE)
         Overflow_Error = nError;
-      
+
       return 0;
-    }  
+    }
     if(!pLmEqual(mi, gi))
     {
       pDelete(&mi);
-      
+
       if(Overflow_Error == FALSE)
         Overflow_Error = nError;
-      
+
       return 0;
     }
-    
+
     pDelete(&mi);
   }
@@ -739 +744 @@
     Overflow_Error = nError;
 
-  return 1; 
+  return 1;
 }
 
@@ -746 +751 @@
 static inline long Mlcm(long &i1, long &i2)
 {
-  long temp = gcd(i1, i2);  
+  long temp = gcd(i1, i2);
   return ((i1 / temp)* i2);
 }
@@ -759 +764 @@
   int i, n = a->length();
   long result = 0;
-  
+
   for(i=n-1; i>=0; i--)
     result += (*a)[i] * (*b)[i];
@@ -770 +775 @@
 {
   assume( a->length() ==  b->length());
-  int i, n = a->length();  
-  intvec* result = new intvec(n); 
-  
+  int i, n = a->length();
+  intvec* result = new intvec(n);
+
   for(i=n-1; i>=0; i--)
     (*result)[i] = (*a)[i] - (*b)[i];
@@ -786 +791 @@
   int i, nR = currRing->N;
   intvec* result = new intvec(nR);
-  
+
   for(i=nR-1; i>=0; i--)
     (*result)[i] = pGetExp(f,i+1);
@@ -795 +800 @@
 /* return 1, if two given intvecs are the same, otherwise 0*/
 int MivSame(intvec* u , intvec* v)
-{ 
+{
   assume(u->length() == v->length());
 
   int i, niv = u->length();
-  
+
   for (i=0; i<niv; i++)
     if ((*u)[i] != (*v)[i])
       return 0;
 
-  return 1; 
+  return 1;
 }
 
 int M3ivSame(intvec* temp, intvec* u , intvec* v)
-{ 
+{
   assume(temp->length() == u->length() && u->length() == v->length());
 
   if((MivSame(temp, u)) == 1)
-    return 0; 
+    return 0;
 
   if((MivSame(temp, v)) == 1)
     return 1;
 
-  return 2; 
+  return 2;
 }
 
@@ -828 +833 @@
   ideal G1 = kStd(G, NULL, testHomog, NULL);
   test=save_test;
-  
+
   idSkipZeroes(G1);
   return G1;
@@ -842 +847 @@
   test=save_test;
 
-  idSkipZeroes(G1);  
+  idSkipZeroes(G1);
   return G1;
 }
@@ -852 +857 @@
 intvec* MivMatrixOrder(intvec* iv)
 {
-  int i,j, nR = iv->length(); 
+  int i,j, nR = iv->length();
   intvec* ivm = new intvec(nR*nR);
 
@@ -867 +872 @@
 intvec* Mivdp(int nR)
 {
-  int i; 
+  int i;
   intvec* ivm = new intvec(nR);
 
@@ -879 +884 @@
 intvec* Mivlp(int nR)
 {
-  int i; 
+  int i;
   intvec* ivm = new intvec(nR);
   (*ivm)[0] = 1;
 
-  return ivm;  
+  return ivm;
 }
 
@@ -891 +896 @@
   int nV = currRing->N;
   int nG = IDELEMS(G);
-  intvec* ivUnit = Mivdp(nV);//19.02 
+  intvec* ivUnit = Mivdp(nV);//19.02
   int i,j, tmpdeg, maxdeg=0;
   number tmpcoeff , maxcoeff=nNULL;
@@ -898 +903 @@
   {
     tmpdeg = MwalkWeightDegree(G->m[i], ivUnit);
-    if (tmpdeg > maxdeg ) 
+    if (tmpdeg > maxdeg )
       maxdeg = tmpdeg;
   }
@@ -910 +915 @@
       tmpcoeff = pGetCoeff(p);
       if(nGreater(tmpcoeff,maxcoeff))
-         maxcoeff = nCopy(tmpcoeff);
+         maxcoeff = nCopy(tmpcoeff);
       pIter(p);
     }
@@ -934 +939 @@
 * basering.                                                                  *
 * This programm computes a perturbated vector with a p_deg perturbation      *
-* degree which smaller than the numbers of variables                         * 
+* degree which smaller than the numbers of variables                         *
 ******************************************************************************/
 /* ivtarget is a matrix order of a degree reverse lex. order */
@@ -945 +950 @@
   intvec* v_null =  new intvec(nV);
 
-  
+
   //Checking that the perturbed degree is valid
   if(pdeg > nV || pdeg <= 0)
-  {  
+  {
     WerrorS("//** The perturbed degree is wrong!!");
     return v_null;
   }
   delete v_null;
-  
+
   if(pdeg == 1)
     return ivtarget;
 
-  mpz_t pert_vector[nV];
-  
+  mpz_t *pert_vector=(mpz_t*)omAlloc(nV*sizeof(mpz_t));
+
   for(i=0; i<nV; i++)
     mpz_init_set_si(pert_vector[i], (*ivtarget)[i]);
-  
-     
+
+
   // Calculate max1 = Max(A2)+Max(A3)+...+Max(Apdeg),
   // where the Ai are the i-te rows of the matrix target_ord.
 
   int ntemp, maxAi, maxA=0;
-  for(i=1; i<pdeg; i++) 
+  for(i=1; i<pdeg; i++)
   {
     maxAi = (*ivtarget)[i*nV];
     if(maxAi<0) maxAi = -maxAi;
-    
+
     for(j=i*nV+1; j<(i+1)*nV; j++)
     {
       ntemp = (*ivtarget)[j];
       if(ntemp < 0) ntemp = -ntemp;
-      
+
       if(ntemp > maxAi)
         maxAi = ntemp;
     }
-    maxA += maxAi;    
+    maxA += maxAi;
   }
 
@@ -986 +991 @@
 
   intvec* ivUnit = Mivdp(nV);
-  
+
   mpz_t tot_deg; mpz_init(tot_deg);
   mpz_t maxdeg; mpz_init(maxdeg);
   mpz_t inveps; mpz_init(inveps);
-  
+
 
   for(i=nG-1; i>=0; i--)
   {
     mpz_set_ui(maxdeg, MwalkWeightDegree(G->m[i], ivUnit));
-    if (mpz_cmp(maxdeg,  tot_deg) > 0 ) 
+    if (mpz_cmp(maxdeg,  tot_deg) > 0 )
       mpz_set(tot_deg, maxdeg);
   }
-  
-  delete ivUnit; 
+
+  delete ivUnit;
   mpz_mul_ui(inveps, tot_deg, maxA);
   mpz_add_ui(inveps, inveps, 1);
@@ -1005 +1010 @@
 
   //xx1.06.02 takes  "small" inveps
-#ifdef INVEPS_SMALL_IN_MPERTVECTOR 
-  if(mpz_cmp_ui(inveps, pdeg)>0 && pdeg > 3) 
+#ifdef INVEPS_SMALL_IN_MPERTVECTOR
+  if(mpz_cmp_ui(inveps, pdeg)>0 && pdeg > 3)
   {
     /*
-      Print("\n// choose the\"small\" inverse epsilon := %d / %d = ",  
-      mpz_get_si(inveps), pdeg); 
+      Print("\n// choose the\"small\" inverse epsilon := %d / %d = ",
+      mpz_get_si(inveps), pdeg);
     */
-    mpz_fdiv_q_ui(inveps, inveps, pdeg); 
+    mpz_fdiv_q_ui(inveps, inveps, pdeg);
     //mpz_out_str(stdout, 10, inveps);
   }
 #else
-  //PrintS("\n// the \"big\" inverse epsilon: "); 
+  //PrintS("\n// the \"big\" inverse epsilon: ");
   mpz_out_str(stdout, 10, inveps);
-#endif  
+#endif
 
   // pert(A1) = inveps^(pdeg-1)*A1 + inveps^(pdeg-2)*A2+...+A_pdeg,
@@ -1031 +1036 @@
         mpz_add_ui(pert_vector[j], pert_vector[j],(*ivtarget)[i*nV+j]);
     }
-  
+
   mpz_t ztemp;
   mpz_init(ztemp);
@@ -1054 +1059 @@
   {
     (*result)[i] = mpz_get_si(pert_vector[i]);
-  
-    if(mpz_cmp(pert_vector[i], sing_int)>=0) 
-    {   
+
+    if(mpz_cmp(pert_vector[i], sing_int)>=0)
+    {
       ntrue++;
       if(Overflow_Error == FALSE)
@@ -1062 +1067 @@
         Overflow_Error = TRUE;
         PrintS("\n// ** OVERFLOW in \"MPertvectors\": ");
-        mpz_out_str( stdout, 10, pert_vector[i]);
+        mpz_out_str( stdout, 10, pert_vector[i]);
         PrintS(" is greater than 2147483647 (max. integer representation)");
         Print("\n//  So vector[%d] := %d is wrong!!", i+1, (*result)[i]);
-      } 
-    }   
-  }   
-  
-  if(Overflow_Error == TRUE) 
+      }
+    }
+  }
+
+  if(Overflow_Error == TRUE)
   {
     ivString(result, "pert_vector");
     Print("\n// %d element(s) of it is overflow!!", ntrue);
   }
-  
+
+  mpz_clear(ztemp);
+  mpz_clear(sing_int);
+  omFree(pert_vector);
   return result;
 }
@@ -1087 +1095 @@
   int i, j, nG = IDELEMS(G);
   intvec* pert_vector =  new intvec(nV);
-  
+
   //Checking that the perturbated degree is valid
   if(pdeg > nV || pdeg <= 0)
-  {  
+  {
     WerrorS("//** The perturbed degree is wrong!!");
     return pert_vector;
@@ -1099 +1107 @@
   if(pdeg == 1)
     return pert_vector;
-     
+
   // Calculate max1 = Max(A2)+Max(A3)+...+Max(Apdeg),
   // where the Ai are the i-te rows of the matrix target_ord.
@@ -1105 +1113 @@
   for(i=1; i<pdeg; i++)
   {
-    maxAi = (*ivtarget)[i*nV]; 
+    maxAi = (*ivtarget)[i*nV];
     for(j=i*nV+1; j<(i+1)*nV; j++)
     {
@@ -1112 +1120 @@
         maxAi = ntemp;
     }
-    maxA += maxAi;    
-  }
-  
+    maxA += maxAi;
+  }
+
   // Calculate inveps := 1/eps, where 1/eps > deg(p)*max1 for all p in G.
   int inveps, tot_deg = 0, maxdeg;
 
-  intvec* ivUnit = Mivdp(nV);//19.02 
+  intvec* ivUnit = Mivdp(nV);//19.02
   for(i=nG-1; i>=0; i--)
   {
     //maxdeg = pTotaldegree(G->m[i], currRing); //it's wrong for ex1,2,rose
     maxdeg = MwalkWeightDegree(G->m[i], ivUnit);
-    if (maxdeg > tot_deg ) 
+    if (maxdeg > tot_deg )
       tot_deg = maxdeg;
   }
@@ -1129 +1137 @@
 
   inveps = (tot_deg * maxA) + 1;
-   
+
   //9.10.01
-#ifdef INVEPS_SMALL_IN_FRACTAL 
+#ifdef INVEPS_SMALL_IN_FRACTAL
   /*
-    Print("\n// choose the\"small\" inverse epsilon := %d / %d = ",  
-    inveps, pdeg); 
+    Print("\n// choose the\"small\" inverse epsilon := %d / %d = ",
+    inveps, pdeg);
   */
-  if(inveps > pdeg && pdeg > 3) 
+  if(inveps > pdeg && pdeg > 3)
     inveps = inveps / pdeg;
 
   //Print(" %d", inveps);
 #else
-  PrintS("\n// the \"big\" inverse epsilon %d", inveps); 
+  PrintS("\n// the \"big\" inverse epsilon %d", inveps);
 #endif
-  
+
   // Pert(A1) = inveps^(pdeg-1)*A1 + inveps^(pdeg-2)*A2+...+A_pdeg,
   for ( i=1; i < pdeg; i++ )
     for(j=0; j<nV; j++)
       (*pert_vector)[j] = inveps*((*pert_vector)[j]) + (*ivtarget)[i*nV+j];
-    
+
   int temp = (*pert_vector)[0];
   for(i=1; i<nV; i++)
@@ -1171 +1179 @@
   int i;
   intvec* ivM = new intvec(nV*nV);
-      
+
   for(i=0; i<nV; i++)
     (*ivM)[i*nV + i] = 1;
-  
+
   return(ivM);
 }
@@ -1183 +1191 @@
   int i;
   intvec* ivM = new intvec(nV*nV);
-      
+
   for(i=0; i<nV; i++)
     (*ivM)[i] = 1;
@@ -1189 +1197 @@
   for(i=1; i<nV; i++)
     (*ivM)[(i+1)*nV - i] = -1;
-    
+
   return(ivM);
 }
@@ -1199 +1207 @@
   int nV = ivstart->length();
   intvec* ivM = new intvec(nV*nV);
-      
+
   for(i=0; i<nV; i++)
     (*ivM)[i] = (*ivstart)[i];
@@ -1205 +1213 @@
   for(i=1; i<nV; i++)
     (*ivM)[i*nV + i-1] = 1;
-  
+
   return(ivM);
 }
@@ -1214 +1222 @@
   int nV = ivstart->length();
   intvec* ivM = new intvec(nV*nV);
-      
+
   for(i=0; i<nV; i++)
     (*ivM)[i] = (*ivstart)[i];
@@ -1223 +1231 @@
   for(i=2; i<nV; i++)
     (*ivM)[(i+1)*nV - i] = -1;
-  
+
   return(ivM);
 }
@@ -1231 +1239 @@
   int i;
   intvec* ivM = new intvec(nV*nV);
-      
+
   for(i=0; i<nV; i++)
     (*ivM)[i] = 1;
@@ -1237 +1245 @@
   for(i=1; i<nV; i++)
     (*ivM)[(i+1)*nV - i] = -1;
-  
+
   return(ivM);
 }
@@ -1245 +1253 @@
   int i;
   intvec* ivM = new intvec(nV);
-      
+
   for(i=nV-1; i>=0; i--)
     (*ivM)[i] = 1;
-  
+
   return(ivM);
 }
@@ -1267 +1275 @@
   // where the Ai are the i-te rows of the matrix 'targer_ord'.
   int ntemp, maxAi, maxA=0;
-  for(i=1; i<nV; i++) 
+  for(i=1; i<nV; i++)
   {
     maxAi = (*ivtarget)[i*nV];
@@ -1280 +1288 @@
         maxAi = ntemp;
     }
-    maxA = maxA + maxAi;    
+    maxA = maxA + maxAi;
   }
   intvec* ivUnit = Mivdp(nV);
-  
+
   // Calculate inveps = 1/eps, where 1/eps > deg(p)*max1 for all p in G.
   mpz_t tot_deg; mpz_init(tot_deg);
   mpz_t maxdeg; mpz_init(maxdeg);
   mpz_t inveps; mpz_init(inveps);
-  
+
 
   for(i=nG-1; i>=0; i--)
   {
     mpz_set_ui(maxdeg, MwalkWeightDegree(G->m[i], ivUnit));
-    if (mpz_cmp(maxdeg,  tot_deg) > 0 ) 
+    if (mpz_cmp(maxdeg,  tot_deg) > 0 )
       mpz_set(tot_deg, maxdeg);
   }
-  
-  delete ivUnit; 
-  //inveps = (tot_deg * maxA) + 1;  
+
+  delete ivUnit;
+  //inveps = (tot_deg * maxA) + 1;
   mpz_mul_ui(inveps, tot_deg, maxA);
   mpz_add_ui(inveps, inveps, 1);
 
   //xx1.06.02 takes  "small" inveps
-#ifdef INVEPS_SMALL_IN_FRACTAL  
+#ifdef INVEPS_SMALL_IN_FRACTAL
   if(mpz_cmp_ui(inveps, nV)>0 && nV > 3)
     mpz_cdiv_q_ui(inveps, inveps, nV);
 
   //PrintS("\n// choose the \"small\" inverse epsilon!");
-#endif  
+#endif
 
   // PrintLn();  mpz_out_str(stdout, 10, inveps);
- 
+
   // Calculate the perturbed target orders:
-  mpz_t ivtemp[nV];
-  mpz_t pert_vector[niv];
-  
+  mpz_t *ivtemp=(mpz_t *)omAlloc(nV*sizeof(mpz_t));
+  mpz_t *pert_vector=(mpz_t *)omAlloc(niv*sizeof(mpz_t));
+
   for(i=0; i<nV; i++)
   {
@@ -1321 +1329 @@
     mpz_init_set_si(pert_vector[i], (*ivtarget)[i]);
   }
-  
+
   mpz_t ztmp; mpz_init(ztmp);
   BOOLEAN isneg = FALSE;
@@ -1330 +1338 @@
     {
       mpz_mul(ztmp, inveps, ivtemp[j]);
-      
+
       if((*ivtarget)[i*nV+j]<0)
-        mpz_sub_ui(ivtemp[j], ztmp, -(*ivtarget)[i*nV+j]); 
-      else  
+        mpz_sub_ui(ivtemp[j], ztmp, -(*ivtarget)[i*nV+j]);
+      else
         mpz_add_ui(ivtemp[j], ztmp,(*ivtarget)[i*nV+j]);
     }
 
-    for(j=0; j<nV; j++) 
-      mpz_init_set(pert_vector[i*nV+j],ivtemp[j]);   
-  }
-  
+    for(j=0; j<nV; j++)
+      mpz_init_set(pert_vector[i*nV+j],ivtemp[j]);
+  }
+
   /* 2147483647 is max. integer representation in SINGULAR */
   mpz_t sing_int;
@@ -1347 +1355 @@
   intvec* result = new intvec(niv);
   BOOLEAN nflow = FALSE;
-  
-  // computes gcd 
-  mpz_set(ztmp, pert_vector[0]); 
+
+  // computes gcd
+  mpz_set(ztmp, pert_vector[0]);
   for(i=0; i<niv; i++)
   {
@@ -1358 +1366 @@
 
   for(i=0; i<niv; i++)
-  { 
+  {
     mpz_divexact(pert_vector[i], pert_vector[i], ztmp);
     (* result)[i] = mpz_get_si(pert_vector[i]);
-   
+
     if(mpz_cmp(pert_vector[i], sing_int)>0)
       if(nflow == FALSE)
@@ -1379 +1387 @@
   if(Overflow_Error == TRUE)
     ivString(result, "new_vector");
-  
+
+  omFree(pert_vector);
+  omFree(ivtemp);
+  mpz_clear(ztmp);
+
   return result;
 }
@@ -1395 +1407 @@
     return NULL;
 
-  if(mB < mA)    
+  if(mB < mA)
     mA = mB;
 
@@ -1402 +1414 @@
   int i, k=0;
   for(i=0; i<mA; i++)
-    {  
+    {
       result->m[k] = pMult(A->m[i], pCopy(B->m[i]));
       A->m[i]=NULL;
       if (result->m[k]!=NULL) k++;
     }
-  
+
   idDelete(&A);
   idSkipZeroes(result);
-  return result;  
+  return result;
 }
 
@@ -1422 +1434 @@
  ********************************************************************/
 static ideal MLifttwoIdeal(ideal Gw, ideal M, ideal G)
-{     
+{
   ideal Mtmp = idLift(Gw, M, NULL, FALSE, TRUE, TRUE, NULL);
 
@@ -1428 +1440 @@
   //So, it is better, if one tests whether Gw is a GB
   //in ideals.cc:
-  //idLift (ideal mod, ideal submod,ideal * rest, BOOLEAN goodShape, 
+  //idLift (ideal mod, ideal submod,ideal * rest, BOOLEAN goodShape,
   //           BOOLEAN isSB,BOOLEAN divide,matrix * unit)
-  
+
   /* Let be Mtmp = {m1,...,ms}, where mi=sum hij.in_gj, for all i=1,...,s
      We compute F = {f1,...,fs}, where fi=sum hij.gj */
@@ -1436 +1448 @@
   ideal idpol, idLG;
   ideal F = idInit(nM, 1);
-  
+
   for(i=0; i<nM; i++)
   {
      idpol = idVec2Ideal(Mtmp->m[i]);
      idLG = MidMult(idpol, G);
-     idpol = NULL; 
+     idpol = NULL;
      F->m[i] = NULL;
      for(j=IDELEMS(idLG)-1; j>=0; j--)
@@ -1461 +1473 @@
   int n = nG-1;
   Print("\n//** Ideal %s besteht aus %d Polynomen mit ", Ch, nG);
-  
+
   for(i=0; i<nG; i++)
   {
@@ -1477 +1489 @@
 }
 
-static void HeadidString(ideal L, char* st)  
-{ 
-  int i, nL = IDELEMS(L)-1; 
+static void HeadidString(ideal L, char* st)
+{
+  int i, nL = IDELEMS(L)-1;
 
   Print("//  The head terms of the ideal %s = ", st);
   for(i=0; i<nL; i++)
     Print(" %s, ", pString(pHead(L->m[i])));
-    
+
   Print(" %s;\n", pString(pHead(L->m[nL])));
 }
@@ -1505 +1517 @@
   with respect to an ideal G.
 */
-static intvec* MwalkNextWeightCC(intvec* curr_weight, intvec* target_weight, 
+static intvec* MwalkNextWeightCC(intvec* curr_weight, intvec* target_weight,
                                  ideal G)
 {
@@ -1511 +1523 @@
   Overflow_Error = FALSE;
 
-  assume(currRing != NULL && curr_weight != NULL && 
+  assume(currRing != NULL && curr_weight != NULL &&
          target_weight != NULL && G != NULL);
 
@@ -1522 +1534 @@
   mpz_init(t_nenner);
 
-  mpz_t s_zaehler, s_nenner, temp, MwWd; 
+  mpz_t s_zaehler, s_nenner, temp, MwWd;
   mpz_init(s_zaehler);
   mpz_init(s_nenner);
@@ -1529 +1541 @@
 
 
-  mpz_t deg_w0_p1, deg_d0_p1; 
+  mpz_t deg_w0_p1, deg_d0_p1;
   mpz_init(deg_w0_p1);
   mpz_init(deg_d0_p1);
@@ -1540 +1552 @@
 
   mpz_t ggt;
- 
+
   int tn0, tn1, tz1, ncmp, gcd_tmp, ntmp;
   intvec* diff_weight = MivSub(target_weight, curr_weight);
-  
+
   poly g, gw;
   for (j=0; j<nG; j++)
   {
-    g = G->m[j]; 
-    if (g != NULL)  
+    g = G->m[j];
+    if (g != NULL)
     {
       ivtemp = MExpPol(g);
@@ -1554 +1566 @@
       mpz_set_si(deg_d0_p1, MivDotProduct(ivtemp, diff_weight));
       delete ivtemp;
-      
+
       pIter(g);
       while (g != NULL)
@@ -1566 +1578 @@
           mpz_set_si(MwWd, MivDotProduct(ivtemp, diff_weight));
           mpz_sub(s_nenner, MwWd, deg_d0_p1);
-          
+
           // check for 0 < s <= 1
-          if( (mpz_cmp(s_zaehler,t_null) > 0 && 
+          if( (mpz_cmp(s_zaehler,t_null) > 0 &&
                mpz_cmp(s_nenner, s_zaehler)>=0) ||
-              (mpz_cmp(s_zaehler, t_null) < 0 && 
+              (mpz_cmp(s_zaehler, t_null) < 0 &&
                mpz_cmp(s_nenner, s_zaehler)<=0))
           {
@@ -1579 +1591 @@
               mpz_neg(s_nenner, s_nenner);
             }
-        
+
             //compute a simply fraction of s
             cancel(s_zaehler, s_nenner);
-            
+
             if(mpz_cmp(t_nenner, t_null) != 0)
-            { 
+            {
               mpz_mul(sztn, s_zaehler, t_nenner);
               mpz_mul(sntz, s_nenner, t_zaehler);
-                   
+
               if(mpz_cmp(sztn,sntz) < 0)
-              { 
+              {
                 mpz_add(t_nenner, t_null, s_nenner);
                 mpz_add(t_zaehler,t_null, s_zaehler);
-              }       
+              }
             }
             else
@@ -1607 +1619 @@
   }
 
-  mpz_t vec[nRing];
-
-  /* there is no 0<t<1 and define the next weight vector that is equal to 
+  mpz_t *vec=(mpz_t*)omAlloc(nRing*sizeof(mpz_t));
+
+  /* there is no 0<t<1 and define the next weight vector that is equal to
      the current weight vector */
   if(mpz_cmp(t_nenner, t_null) == 0)
-  {    
-    delete diff_weight; 
+  {
+    delete diff_weight;
     diff_weight = ivCopy(curr_weight);//take memory
     goto FINISH;
   }
 
-  /* define the target vector as the next weight vector, if t = 1 */ 
+  /* define the target vector as the next weight vector, if t = 1 */
   if(mpz_cmp_si(t_nenner, 1)==0 && mpz_cmp_si(t_zaehler,1)==0)
   {
-    delete diff_weight; 
+    delete diff_weight;
     diff_weight = ivCopy(target_weight); //this takes memory
     goto FINISH;
@@ -1629 +1641 @@
   //14.08.03 simplify the both vectors  curr_weight and diff_weight (C-int)
   gcd_tmp = (*curr_weight)[0];
-  
+
   for (j=1; j<nRing; j++)
   {
@@ -1636 +1648 @@
       break;
   }
-  
+
   if(gcd_tmp != 1)
     for (j=0; j<nRing; j++)
@@ -1658 +1670 @@
   PrintS("\n// t_zaehler: ");  mpz_out_str( stdout, 10, t_zaehler);
   PrintS(", t_nenner: ");  mpz_out_str( stdout, 10, t_nenner);
-#endif   
+#endif
 
   mpz_t ddf; mpz_init(ddf);
   mpz_t dcw; mpz_init(dcw);
   BOOLEAN isdwpos;
-  
+
   // construct a new weight vector
   for (j=0; j<nRing; j++)
-  { 
+  {
     mpz_set_si(dcw, (*curr_weight)[j]);
     mpz_mul(s_nenner, t_nenner, dcw);
 
     if( (*diff_weight)[j]>0)
-      mpz_mul_ui(s_zaehler, t_zaehler, (*diff_weight)[j]); 
+      mpz_mul_ui(s_zaehler, t_zaehler, (*diff_weight)[j]);
     else
     {
-      mpz_mul_ui(s_zaehler, t_zaehler, -(*diff_weight)[j]); 
-      mpz_neg(s_zaehler, s_zaehler);    
-    }
-    
-    mpz_add(sntz, s_nenner, s_zaehler); 
+      mpz_mul_ui(s_zaehler, t_zaehler, -(*diff_weight)[j]);
+      mpz_neg(s_zaehler, s_zaehler);
+    }
+
+    mpz_add(sntz, s_nenner, s_zaehler);
 
     mpz_init_set(vec[j], sntz);
@@ -1685 +1697 @@
     Print("\n//   j = %d ==> ", j);
     PrintS("(");
-    mpz_out_str( stdout, 10, t_nenner); 
-    Print(" * %d)", (*curr_weight)[j]); 
-    Print(" + ("); mpz_out_str( stdout, 10, t_zaehler); 
+    mpz_out_str( stdout, 10, t_nenner);
+    Print(" * %d)", (*curr_weight)[j]);
+    Print(" + ("); mpz_out_str( stdout, 10, t_zaehler);
     Print(" * %d) =  ",  (*diff_weight)[j]);
     mpz_out_str( stdout, 10, s_nenner);
     PrintS(" + ");
     mpz_out_str( stdout, 10, s_zaehler);
-    PrintS(" = "); mpz_out_str( stdout, 10, sntz); 
+    PrintS(" = "); mpz_out_str( stdout, 10, sntz);
     Print(" ==> vector[%d]: ", j); mpz_out_str(stdout, 10, vec[j]);
-#endif   
- 
-    if(j==0) 
+#endif
+
+    if(j==0)
       mpz_init_set(ggt, sntz);
-    else    
+    else
       if(mpz_cmp_si(ggt,1) != 0)
-        mpz_gcd(ggt, ggt, sntz); 
-    
+        mpz_gcd(ggt, ggt, sntz);
+
   }
 
 #ifdef  NEXT_VECTORS_CC
   PrintS("\n// gcd of elements of the vector: ");
-  mpz_out_str( stdout, 10, ggt);          
-#endif   
- 
+  mpz_out_str( stdout, 10, ggt);
+#endif
+
   mpz_t omega;
   mpz_t sing_int;
   mpz_init_set_ui(sing_int,  2147483647);
-  
-  /* construct a new weight vector and check whether vec[j] is overflow!! 
+
+  /* construct a new weight vector and check whether vec[j] is overflow!!
      i.e. vec[j] > 2^31.
      If vec[j] doesn't overflow, define a weight vector
-     otherwise, report that overflow appears.   
-     In the second case test whether the defined new vector correct is 
+     otherwise, report that overflow appears.
+     In the second case test whether the defined new vector correct is
      plays an important rolle */
 
@@ -1728 +1740 @@
       mpz_divexact(vec[j], vec[j], ggt);
       (*diff_weight)[j] = mpz_get_si(vec[j]);
-    } 
-
-    if(mpz_cmp(vec[j], sing_int)>=0) 
+    }
+
+    if(mpz_cmp(vec[j], sing_int)>=0)
       if(Overflow_Error == FALSE)
       {
-        Overflow_Error = TRUE;
-        
-        PrintS("\n// ** OVERFLOW in \"NextVector\": ");
-        mpz_out_str( stdout, 10, vec[j]);
-        PrintS(" is greater than 2147483647 (max. integer representation)");
-        Print("\n//  So vector[%d] := %d is wrong!!\n",j+1, (*diff_weight)[j]); 
-      } 
-  } 
-  
+        Overflow_Error = TRUE;
+
+        PrintS("\n// ** OVERFLOW in \"NextVector\": ");
+        mpz_out_str( stdout, 10, vec[j]);
+        PrintS(" is greater than 2147483647 (max. integer representation)");
+        Print("\n//  So vector[%d] := %d is wrong!!\n",j+1, (*diff_weight)[j]);
+      }
+  }
+
  FINISH:
 
@@ -1752 +1764 @@
    mpz_clear(deg_w0_p1);
    mpz_clear(deg_d0_p1);
+   omFree(vec);
 
   if(Overflow_Error == FALSE)
@@ -1759 +1772 @@
 }
 
-/* 
-   compute an intermediate weight vector from iva to ivb w.r.t. 
+/*
+   compute an intermediate weight vector from iva to ivb w.r.t.
    the reduced Groebner basis G.
-   Return NULL, if it is equal to iva or iva = avb. 
+   Return NULL, if it is equal to iva or iva = avb.
 */
 intvec* MkInterRedNextWeight(intvec* iva, intvec* ivb, ideal G)
@@ -1782 +1795 @@
     return tmp;
   }
-  
+
   delete tmp;
-  return result; 
+  return result;
 }
 
@@ -1794 +1807 @@
   //3.11.01
 
-  if (ppNoether!=NULL)  
-    pDelete(&ppNoether);  
-      
-  if (((sLastPrinted.rtyp>BEGIN_RING) && (sLastPrinted.rtyp<END_RING)) || 
-      ((sLastPrinted.rtyp==LIST_CMD)&&(lRingDependend((lists)sLastPrinted.data)))) 
-
-  {
-    sLastPrinted.CleanUp(); 
-    memset(&sLastPrinted,0,sizeof(sleftv)); 
-  } 
+  if (ppNoether!=NULL)
+    pDelete(&ppNoether);
+
+  if (((sLastPrinted.rtyp>BEGIN_RING) && (sLastPrinted.rtyp<END_RING)) ||
+      ((sLastPrinted.rtyp==LIST_CMD)&&(lRingDependend((lists)sLastPrinted.data))))
+
+  {
+    sLastPrinted.CleanUp();
+    memset(&sLastPrinted,0,sizeof(sleftv));
+  }
 
   ring r = IDRING(tmp);
@@ -1834 +1847 @@
 
   /* ringorder a for the first block: var 1..nv */
-  r->order[0]  = ringorder_a; 
+  r->order[0]  = ringorder_a;
   r->block0[0] = 1;
   r->block1[0] = nv;
-  
+
   /* ringorder lp for the second block: var 1..nv */
   r->order[1]  = ringorder_lp;
   r->block0[1] = 1;
   r->block1[1] = nv;
-  
-  /* ringorder C for the third block */ 
-  // it is very important within "idLift", 
+
+  /* ringorder C for the third block */
+  // it is very important within "idLift",
   // especially, by ring syz_ring=rCurrRingAssure_SyzComp();
   // therefore, nb  must be (nBlocks(currRing)  + 1)
-  r->order[2]  = ringorder_C; 
+  r->order[2]  = ringorder_C;
 
   /* the last block: everything is 0 */
@@ -1857 +1870 @@
   /* complete ring intializations */
   rComplete(r);
-  
+
   rChangeCurrRing(r);
   currRingHdl = tmp;
@@ -1867 +1880 @@
 {
   idhdl tmp = enterid(IDID(currRingHdl),IDLEV(currRingHdl)+1,RING_CMD,&IDROOT,TRUE);
-  
-
-  if (ppNoether!=NULL)  
-    pDelete(&ppNoether);  
-      
-  if (((sLastPrinted.rtyp>BEGIN_RING) && (sLastPrinted.rtyp<END_RING)) || 
-      ((sLastPrinted.rtyp==LIST_CMD)&&(lRingDependend((lists)sLastPrinted.data)))) 
-
-  {
-    sLastPrinted.CleanUp(); 
-    memset(&sLastPrinted,0,sizeof(sleftv)); 
-  } 
+
+
+  if (ppNoether!=NULL)
+    pDelete(&ppNoether);
+
+  if (((sLastPrinted.rtyp>BEGIN_RING) && (sLastPrinted.rtyp<END_RING)) ||
+      ((sLastPrinted.rtyp==LIST_CMD)&&(lRingDependend((lists)sLastPrinted.data))))
+
+  {
+    sLastPrinted.CleanUp();
+    memset(&sLastPrinted,0,sizeof(sleftv));
+  }
 
   ring r = IDRING(tmp);
@@ -1897 +1910 @@
 
   /*weights: entries for 3 blocks: NULL Made:???*/
-  
+
   r->wvhdl = (int **)omAlloc0(nb * sizeof(int_ptr));
 
@@ -1909 +1922 @@
   r->block0[0] = 1;
   r->block1[0] = nv;
-  
-  /* ringorder C for the second block */ 
-  r->order[1]  = ringorder_C; 
+
+  /* ringorder C for the second block */
+  r->order[1]  = ringorder_C;
 
   /* the last block: everything is 0 */
@@ -1921 +1934 @@
   /* complete ring intializations */
   rComplete(r);
-  
+
   //rSetHdl(tmp);
 
@@ -1935 +1948 @@
   int i, nv = currRing->N;
   int nb = rBlocks(currRing) + 1;
-    
+
   ring res=(ring)omAllocBin(ip_sring_bin);
-  
+
   memcpy4(res,currRing,sizeof(ip_sring));
- 
+
   res->VarOffset = NULL;
   res->ref=0;
@@ -1950 +1963 @@
     int l=rPar(currRing);
     res->parameter=(char **)omAlloc(l*sizeof(char_ptr));
-    
+
     for(i=l-1;i>=0;i--)
       res->parameter[i]=omStrDup(currRing->parameter[i]);
   }
 
-  intvec* iva = va;  
+  intvec* iva = va;
 
   /*weights: entries for 3 blocks: NULL Made:???*/
@@ -1967 +1980 @@
   res->block0 = (int *)omAlloc0(nb * sizeof(int *));
   res->block1 = (int *)omAlloc0(nb * sizeof(int *));
-  
+
   /* ringorder a for the first block: var 1..nv */
-  res->order[0]  = ringorder_a; 
+  res->order[0]  = ringorder_a;
   res->block0[0] = 1;
   res->block1[0] = nv;
-  
+
   /* ringorder lp for the second block: var 1..nv */
   res->order[1]  = ringorder_lp;
   res->block0[1] = 1;
   res->block1[1] = nv;
-  
-  /* ringorder C for the third block */ 
-  // it is very important within "idLift", 
+
+  /* ringorder C for the third block */
+  // it is very important within "idLift",
   // especially, by ring syz_ring=rCurrRingAssure_SyzComp();
   // therefore, nb  must be (nBlocks(currRing)  + 1)
-  res->order[2]  = ringorder_C; 
+  res->order[2]  = ringorder_C;
 
   /* the last block: everything is 0 */
@@ -1990 +2003 @@
   res->OrdSgn    = 1;
 
-  
+
   res->names   = (char **)omAlloc0(nv * sizeof(char_ptr));
   for (i=nv-1; i>=0; i--)
@@ -1997 +2010 @@
   /* complete ring intializations */
    rComplete(res);
-  
-   
+
+
   // clean up history
   if (sLastPrinted.RingDependend())
@@ -2005 +2018 @@
     memset(&sLastPrinted,0,sizeof(sleftv));
   }
-  
+
 
   /* execute the created ring */
@@ -2017 +2030 @@
 
   ring r=(ring)omAllocBin(ip_sring_bin);
-  
+
   memcpy4(r,currRing,sizeof(ip_sring));
- 
+
   r->VarOffset = NULL;
   r->ref=0;
@@ -2030 +2043 @@
     int l=rPar(currRing);
     r->parameter=(char **)omAlloc(l*sizeof(char_ptr));
-    
+
     for(i=l-1;i>=0;i--)
       r->parameter[i]=omStrDup(currRing->parameter[i]);
@@ -2050 +2063 @@
 
   /*weights: entries for 3 blocks: NULL Made:???*/
-  
+
   r->wvhdl = (int **)omAlloc0(nb * sizeof(int_ptr));
 
@@ -2062 +2075 @@
   r->block0[0] = 1;
   r->block1[0] = nv;
-  
-  /* ringorder C for the second block */ 
-  r->order[1]  = ringorder_C; 
+
+  /* ringorder C for the second block */
+  r->order[1]  = ringorder_C;
 
   /* the last block: everything is 0 */
@@ -2078 +2091 @@
     int l=rPar(currRing);
     r->parameter=(char **)omAlloc(l*sizeof(char_ptr));
-    
+
     for(i=l-1;i>=0;i--)
       r->parameter[i]=omStrDup(currRing->parameter[i]);
@@ -2085 +2098 @@
   /* complete ring intializations */
   rComplete(r);
-  
+
   // clean up history
   if (sLastPrinted.RingDependend())
@@ -2104 +2117 @@
     if((* hilb)[i]==0)
       return 1;
-  
+
   return 0;
 }
@@ -2119 +2132 @@
  **************************************************************************/
 
-static ideal LastGB(ideal G, intvec* curr_weight,int tp_deg) 
+static ideal LastGB(ideal G, intvec* curr_weight,int tp_deg)
 {
   BOOLEAN nError = Overflow_Error;
@@ -2132 +2145 @@
   intvec* target_weight;
   intvec* iv_lp = Mivlp(nV); //define (1,0,...,0)
-  intvec* pert_target_vector; 
+  intvec* pert_target_vector;
   intvec* ivNull = new intvec(nV);
   intvec* extra_curr_weight = new intvec(nV);
@@ -2172 +2185 @@
 
   while(1)
-  { 
+  {
     nwalk++;
     nstep++;
@@ -2179 +2192 @@
     next_weight = MkInterRedNextWeight(curr_weight,target_weight, G);
     xtnw=xtnw+clock()-to;
-#ifdef PRINT_VECTORS 
+#ifdef PRINT_VECTORS
     MivString(curr_weight, target_weight, next_weight);
 #endif
@@ -2189 +2202 @@
         nlast = 1;
       delete next_weight;
-      
+
       //idElements(G, "G");
       //Print("\n// ring r%d_%d = %s;\n", tp_deg, nwalk, rString(currRing));
-      
+
       break;
     }
@@ -2219 +2232 @@
     xtif=xtif+clock()-to;
 
-#ifdef ENDWALKS    
-    if(endwalks == 1){  
-      Print("\n// ring r%d_%d = %s;\n", tp_deg, nwalk, rString(currRing));  
-      idElements(Gomega, "Gw");  
-      headidString(Gomega, "Gw"); 
-    }
-#endif    
-    
+#ifdef ENDWALKS
+    if(endwalks == 1){
+      Print("\n// ring r%d_%d = %s;\n", tp_deg, nwalk, rString(currRing));
+      idElements(Gomega, "Gw");
+      headidString(Gomega, "Gw");
+    }
+#endif
+
 #ifndef  BUCHBERGER_ALG
     if(isNolVector(curr_weight) == 0)
@@ -2233 +2246 @@
       hilb_func = hFirstSeries(Gomega,NULL,NULL,last_omega,currRing);
 #endif // BUCHBERGER_ALG
-    
+
     /* define a new ring that its ordering is "(a(curr_weight),lp) */
     //..25.03.03 VMrDefault(curr_weight);
@@ -2241 +2254 @@
       VMrDefault(curr_weight);
 
-    newRing = currRing; 
+    newRing = currRing;
     Gomega1 = idrMoveR(Gomega, oldRing);
 
@@ -2250 +2263 @@
 #else
     M=kStd(Gomega1,NULL,isHomog,NULL,hilb_func,0,NULL,curr_weight);
-    delete hilb_func;    
+    delete hilb_func;
 #endif // BUCHBERGER_ALG
     xtstd=xtstd+clock()-to;
-    /* change the ring to oldRing */ 
+    /* change the ring to oldRing */
     rChangeCurrRing(oldRing);
     M1 =  idrMoveR(M, newRing);
-    Gomega2 =  idrMoveR(Gomega1, newRing); 
-   
+    Gomega2 =  idrMoveR(Gomega1, newRing);
+
     to=clock();
     /* compute a reduced Groebner basis of <G> w.r.t. "newRing" */
@@ -2263 +2276 @@
     xtlift=xtlift+clock()-to;
 
-    idDelete(&M1);  
+    idDelete(&M1);
     idDelete(&G);
 
-    /* change the ring to newRing */ 
+    /* change the ring to newRing */
     rChangeCurrRing(newRing);
     F1 = idrMoveR(F, oldRing);
 
     to=clock();
-    /* reduce the Groebner basis <G> w.r.t. new ring */   
+    /* reduce the Groebner basis <G> w.r.t. new ring */
     G = kInterRedCC(F1, NULL);
     xtred=xtred+clock()-to;
     idDelete(&F1);
-   
+
     if(endwalks == 1){
       //Print("\n// ring r%d_%d = %s;\n", tp_deg, nwalk, rString(currRing));
@@ -2295 +2308 @@
 
     F1 = idrMoveR(G, newRing);
-    
+
     if(nnwinC == 0 || test_w_in_ConeCC(F1, pert_target_vector) != 1)
     {
@@ -2301 +2314 @@
       rChangeCurrRing(newRing);
       G = idrMoveR(F1, oldRing);
-      Print("\n// takes %d steps and calls the recursion of level %d:", 
-             nwalk, tp_deg-1);
+      Print("\n// takes %d steps and calls the recursion of level %d:",
+             nwalk, tp_deg-1);
 
       F1 = LastGB(G,curr_weight, tp_deg-1);
     }
-    
+
     TargetRing = currRing;
     rChangeCurrRing(EXXRing);
@@ -2314 +2327 @@
   {
     if(nlast == 1)
-    {            
+    {
       //OMEGA_OVERFLOW_LASTGB:
       /*
-      if(MivSame(curr_weight, iv_lp) == 1) 
-        if (currRing->parameter != NULL) 
-          DefRingParlp(); 
-        else 
+      if(MivSame(curr_weight, iv_lp) == 1)
+        if (currRing->parameter != NULL)
+          DefRingParlp();
+        else
           VMrDefaultlp();
-      else 
-        if (currRing->parameter != NULL) 
-          DefRingPar(curr_weight); 
-        else 
-          VMrDefault(curr_weight); 
+      else
+        if (currRing->parameter != NULL)
+          DefRingPar(curr_weight);
+        else
+          VMrDefault(curr_weight);
       */
-      
-        //..25.03.03 VMrDefaultlp();//define and execute the ring "lp"
-        if (currRing->parameter != NULL) 
-          DefRingParlp(); 
-        else 
-          VMrDefaultlp(); 
-        
-      
+
+        //..25.03.03 VMrDefaultlp();//define and execute the ring "lp"
+        if (currRing->parameter != NULL)
+          DefRingParlp();
+        else
+          VMrDefaultlp();
+
+
       F1 = idrMoveR(G, newRing);
       //Print("\n// Apply \"std\" in ring r%d_%d = %s;\n", tp_deg, nwalk, rString(currRing));
@@ -2346 +2359 @@
     rChangeCurrRing(EXXRing);
     result = idrMoveR(G, newRing);
-  } 
+  }
   delete target_weight;
   delete last_omega;
@@ -2354 +2367 @@
     Overflow_Error = nError;
 
-  return(result);  
+  return(result);
 }
 
@@ -2363 +2376 @@
   int i;
   for(i=IDELEMS(G)-1; i>=0; i--)
-#if 0  
+#if 0
     if(pLength(G->m[i])>2)
       return 1;
@@ -2373 +2386 @@
       //&& (G->m[i]->next->next->next->next!=NULL) /* len >=4 */
        ) return 1;
-#endif    
+#endif
   return 0;
 }
@@ -2392 +2405 @@
 
 
-/* Implementation of the improved Groebner walk algorithm which is written 
+/* Implementation of the improved Groebner walk algorithm which is written
    by Quoc-Nam Tran (2000).
-   One perturbs the original target weight vector, only if 
-   the next intermediate weight vector is equal to the current target weight 
+   One perturbs the original target weight vector, only if
+   the next intermediate weight vector is equal to the current target weight
    vector. This must be repeated until the wanted reduced Groebner basis
    to reach.
-   If the numbers of variables is big enough, the representation of the origin 
-   weight vector may be very big. Therefore, it is possible the intermediate 
-   weight vector doesn't stay in the correct Groebner cone. 
-   In this case we have just a reduced Groebner basis of the given ideal 
-   with respect to another monomial order. Then we have to compute 
+   If the numbers of variables is big enough, the representation of the origin
+   weight vector may be very big. Therefore, it is possible the intermediate
+   weight vector doesn't stay in the correct Groebner cone.
+   In this case we have just a reduced Groebner basis of the given ideal
+   with respect to another monomial order. Then we have to compute
    a wanted reduced Groebner basis of it with respect to the given order.
    At the following subroutine we use the improved Buchberger algorithm or
@@ -2414 +2427 @@
 {
   int i, nH =IDELEMS(h);
-  
+
   ideal m = idInit(nH,h->rank);
-  
+
   for (i=nH-1;i>=0; i--)
   {
-    if (h->m[i]!=NULL) 
+    if (h->m[i]!=NULL)
       m->m[i]=pHead(h->m[i]);
   }
@@ -2432 +2445 @@
   if(nG != IDELEMS(H1))
     return 0;
-  
+
   for(i=nG-1; i>=0; i--)
-  {  
-#if 0    
+  {
+#if 0
     poly t;
     if((t=pSub(pCopy(H0->m[i]), pCopy(H1->m[i]))) != NULL)
@@ -2446 +2459 @@
     if(!pEqualPolys(H0->m[i],H1->m[i]))
       return 0;
-#endif    
+#endif
   }
 
@@ -2460 +2473 @@
   int degtmp, result = 0;
   intvec* ivUnit = Mivdp(nV);
-   
+
   for(i=nG-1; i>=0; i--)
   {
@@ -2472 +2485 @@
 }
 
-/* perturb the weight vector iva w.r.t. the ideal G. 
+/* perturb the weight vector iva w.r.t. the ideal G.
    the monomial order of the current ring is the w_1 weight lex. order.
    define w := d^(n-1)w_1+ d^(n-2)w_2, ...+ dw_(n-1)+ w_n
@@ -2490 +2503 @@
   // define the sequence which expresses the current monomial ordering
   // w_1 = iva; w_2 = (1,0,..,0); w_n = (0,...,0,1,0)
-  intvec* ivMat = MivMatrixOrder(iva);  
+  intvec* ivMat = MivMatrixOrder(iva);
 
   int  mtmp, m=(*iva)[0];
@@ -2497 +2510 @@
   {
     mtmp = (*ivMat)[i];
-    
+
     if(mtmp <0) mtmp = -mtmp;
 
@@ -2503 +2516 @@
       m = mtmp;
   }
-  
+
   /* define the maximal total degree of polynomials of G */
   mpz_t ndeg;
@@ -2520 +2533 @@
   //ndeg = (2*maxdeg*maxdeg + (nV+1)*maxdeg)*m;//Kalkbrenner (1999)
   mpz_pow_ui(ztmp, maxdeg, 2);
-  mpz_mul_ui(ztmp, ztmp, 2); 
+  mpz_mul_ui(ztmp, ztmp, 2);
   mpz_mul_ui(maxdeg, maxdeg, nV+1);
   mpz_add(ndeg, ztmp, maxdeg);
   mpz_mul_ui(ndeg, ndeg, m);
-  
+
   //PrintS("\n// with the new upper degree bound (2d^2+(n+1)d)*m ");
   //Print("\n//         where d = %d, n = %d and bound = %d", maxdeg, nV, ndeg);
@@ -2530 +2543 @@
 
   /* 29.08.03*/
-#ifdef INVEPS_SMALL_IN_TRAN 
+#ifdef INVEPS_SMALL_IN_TRAN
  if(mpz_cmp_ui(ndeg, nV)>0 && nV > 3)
     mpz_cdiv_q_ui(ndeg, ndeg, nV);
@@ -2539 +2552 @@
   mpz_t deg_tmp;
   mpz_init_set(deg_tmp, ndeg);
-  
-  mpz_t ivres[nV];
+
+  mpz_t *ivres=( mpz_t *) omAlloc(nV*sizeof(mpz_t));
   mpz_init_set_si(ivres[nV-1],1);
-  
+
   for(i=nV-2; i>=0; i--)
   {
@@ -2549 +2562 @@
   }
 
-  mpz_t ivtmp[nV];
+  mpz_t *ivtmp=(mpz_t *)omAlloc(nV*sizeof(mpz_t));
   for(i=0; i<nV; i++)
     mpz_init(ivtmp[i]);
-  
+
   mpz_t sing_int;
   mpz_init_set_ui(sing_int,  2147483647);
 
   intvec* repr_vector = new intvec(nV);
-  
+
   /* define ivtmp := ndeg^(n-1).w_1 + ndeg^(n-2).w_2 + ... + w_n */
   for(i=0; i<nV; i++)
@@ -2584 +2597 @@
       {
         Overflow_Error = TRUE;
-        
+
         PrintS("\n// ** OVERFLOW in \"Repr.Vector\": ");
         mpz_out_str( stdout, 10, ivtmp[i]);
@@ -2592 +2605 @@
     }
   }
-  if(Overflow_Error == TRUE) 
+  if(Overflow_Error == TRUE)
   {
     ivString(repr_vector, "repvector");
@@ -2598 +2611 @@
   }
 
-  if(Overflow_Error == FALSE) 
+  if(Overflow_Error == FALSE)
     Overflow_Error=nError;
 
+  omFree(ivres);
+  omFree(ivtmp);
   return repr_vector;
 }
@@ -2630 +2645 @@
   //ndeg = (2*maxdeg*maxdeg + (nV+1)*maxdeg);//Kalkbrenner (1999)
   mpz_pow_ui(ztmp, maxdeg, 2);
-  mpz_mul_ui(ztmp, ztmp, 2); 
+  mpz_mul_ui(ztmp, ztmp, 2);
   mpz_mul_ui(maxdeg, maxdeg, nV+1);
   mpz_add(ndeg, ztmp, maxdeg);
   /*
     PrintS("\n// with the new upper degree bound (2d^2+(n+1)d)*m ");
-    Print("\n//         where d = %d, n = %d and bound = %d", 
+    Print("\n//         where d = %d, n = %d and bound = %d",
     mpz_get_si(maxdeg), nV, mpz_get_si(ndeg));
   */
 #endif //UPPER_BOUND
 
-#ifdef INVEPS_SMALL_IN_TRAN 
+#ifdef INVEPS_SMALL_IN_TRAN
  if(mpz_cmp_ui(ndeg, nV)>0 && nV > 3)
     mpz_cdiv_q_ui(ndeg, ndeg, nV);
@@ -2650 +2665 @@
   mpz_t deg_tmp;
   mpz_init_set(deg_tmp, ndeg);
-  
-  mpz_t ivres[nV];
+
+  mpz_t *ivres=(mpz_t *)omAlloc(nV*sizeof(mpz_t));
   mpz_init_set_si(ivres[nV-1], 1);
-  
+
   for(i=nV-2; i>=0; i--)
   {
@@ -2680 +2695 @@
         Print("\n//  So vector[%d] := %d is wrong!!\n",i+1,(*repr_vector)[i]);
       }
-    }   
-  }
-  if(Overflow_Error == TRUE) 
+    }
+  }
+  if(Overflow_Error == TRUE)
   {
     ivString(repr_vector, "repvector");
     Print("\n// %d element(s) of it are overflow!!", ntrue);
   }
-  if(Overflow_Error == FALSE) 
+  if(Overflow_Error == FALSE)
     Overflow_Error = nError;
 
+  omFree(ivres);
   return repr_vector;
 }
@@ -2705 +2721 @@
   intvec* ivUnit = Mivdp(nV);
   int degtmp, maxdeg = 0;
-  
+
   for(i=IDELEMS(G)-1; i>=0; i--)
   {
@@ -2716 +2732 @@
   mpz_t ztmp;
   mpz_init_set_si(ztmp, maxdeg);
-  mpz_t ivres[nV];
+  mpz_t *ivres=(mpz_t *)omAlloc(nV*sizeof(mpz_t));
   mpz_init_set_si(ivres[nV-1], 1); // (*ivres)[nV-1] = 1;
 
@@ -2725 +2741 @@
   }
 
-  mpz_t ivtmp[nV];
+  mpz_t *ivtmp=(mpz_t*)omAlloc(nV*sizeof(mpz_t));
   for(i=0; i<nV; i++)
     mpz_init(ivtmp[i]);
@@ -2738 +2754 @@
         mpz_neg(ztmp, ztmp);
       }
-      else  
+      else
         mpz_mul_ui(ztmp, ivres[i], (*M)[i*nV+j]);
 
-      mpz_add(ivtmp[j], ivtmp[j], ztmp);    
+      mpz_add(ivtmp[j], ivtmp[j], ztmp);
     }
 
@@ -2762 +2778 @@
         PrintS(" is greater than 2147483647 (max. integer representation)");
         Print("\n//  So vector[%d] := %d is wrong!!\n",i+1,(*repvector)[i]);
-      }   
-    }
-  }
-  if(Overflow_Error == TRUE) 
+      }
+    }
+  }
+  if(Overflow_Error == TRUE)
   {
     ivString(repvector, "repvector");
@@ -2771 +2787 @@
   }
 
-  if(Overflow_Error == FALSE) 
+  if(Overflow_Error == FALSE)
     Overflow_Error = nError;
 
+  mpz_clear(ztmp);
+  omFree(ivtmp);
+  omFree(ivres);
   return repvector;
 }
@@ -2781 +2800 @@
 
 
-/* The following subroutine is the implementation of our first improved 
+/* The following subroutine is the implementation of our first improved
    Groebner walk algorithm, i.e. the first altervative algorithm.
    First we use the Grobner walk algorithm and then we call the changed
    perturbation walk algorithm with decreased degree, if an intermediate
-   weight vector is equal to the current target weight vector. 
-   This call will be only repeated until we get the wanted reduced Groebner 
+   weight vector is equal to the current target weight vector.
+   This call will be only repeated until we get the wanted reduced Groebner
    basis or n times, where n is the numbers of variables.
 */
@@ -2805 +2824 @@
 /* 7 Februar 2002 */
 /* npwinc = 0, if curr_weight doesn't stay in the correct Groebner cone */
-static ideal Rec_LastGB(ideal G, intvec* curr_weight, 
-                        intvec* orig_target_weight, int tp_deg, int npwinc) 
+static ideal Rec_LastGB(ideal G, intvec* curr_weight,
+                        intvec* orig_target_weight, int tp_deg, int npwinc)
 {
   BOOLEAN nError = Overflow_Error;
@@ -2829 +2848 @@
 
   //08 Juli 03
-  intvec* hilb_func; 
+  intvec* hilb_func;
   /* to avoid (1,0,...,0) as the target vector */
   intvec* last_omega = new intvec(nV);
@@ -2856 +2875 @@
        cone(k-1) is equal to cone(k) */
     if(test_G_GB_walk(H0_tmp,H1)==1) {
-      idDelete(&H0_tmp); 
+      idDelete(&H0_tmp);
       idDelete(&H1);
       G = ssG;
@@ -2862 +2881 @@
       newRing = currRing;
       delete ivNull;
-    
+
       if(npwinc != 0)
         goto LastGB_Finish;
@@ -2870 +2889 @@
       }
     }
-    idDelete(&H0_tmp);   
+    idDelete(&H0_tmp);
     idDelete(&H1);
-    
+
     iv_M_lp = MivMatrixOrderlp(nV);
     target_weight  = MPertVectors(ssG, iv_M_lp, tp_deg);
@@ -2881 +2900 @@
 
     if(Overflow_Error == TRUE)  {
-      nOverflow_Error = Overflow_Error; 
+      nOverflow_Error = Overflow_Error;
       NEG = 1;
       newRing = currRing;
@@ -2889 +2908 @@
 
   while(1)
-  { 
+  {
     nwalk ++;
     nstep++;
 
-    if(nwalk==1) 
+    if(nwalk==1)
       goto FIRST_STEP;
 
@@ -2909 +2928 @@
 
     oldRing = currRing;
-    
+
     /* defiNe a new ring that its ordering is "(a(curr_weight),lp) */
     if (currRing->parameter != NULL)
@@ -2916 +2935 @@
       VMrDefault(curr_weight);
 
-    newRing = currRing; 
+    newRing = currRing;
     Gomega1 = idrMoveR(Gomega, oldRing);
     to=clock();
@@ -2924 +2943 @@
 #else
     M=kStd(Gomega1,NULL,isHomog,NULL,hilb_func,0,NULL,curr_weight);
-    delete hilb_func;    
+    delete hilb_func;
 #endif // BUCHBERGER_ALG
     xtstd=xtstd+clock()-to;
-    /* change the ring to oldRing */ 
+    /* change the ring to oldRing */
     rChangeCurrRing(oldRing);
     M1 =  idrMoveR(M, newRing);
-    Gomega2 =  idrMoveR(Gomega1, newRing); 
-   
+    Gomega2 =  idrMoveR(Gomega1, newRing);
+
      to=clock();
-    /* compute a reduced Groebner basis of <G> w.r.t. "newRing" by the 
+    /* compute a reduced Groebner basis of <G> w.r.t. "newRing" by the
        lifting process*/
     F = MLifttwoIdeal(Gomega2, M1, G);
     xtlift=xtlift+clock()-to;
-    idDelete(&M1);  
-    idDelete(&Gomega2); 
+    idDelete(&M1);
+    idDelete(&Gomega2);
     idDelete(&G);
-    
-    /* change the ring to newRing */ 
+
+    /* change the ring to newRing */
     rChangeCurrRing(newRing);
     F1 = idrMoveR(F, oldRing);
 
     to=clock();
-    /* reduce the Groebner basis <G> w.r.t. new ring */   
+    /* reduce the Groebner basis <G> w.r.t. new ring */
     G = kInterRedCC(F1, NULL);
     xtred=xtred+clock()-to;
     idDelete(&F1);
-   
+
     if(endwalks == 1)
       break;
@@ -2960 +2979 @@
     next_weight = MkInterRedNextWeight(curr_weight,target_weight, G);
     xtnw=xtnw+clock()-to;
-#ifdef PRINT_VECTORS 
+#ifdef PRINT_VECTORS
     MivString(curr_weight, target_weight, next_weight);
 #endif
- 
+
     if(Overflow_Error == TRUE) {
       //PrintS("\n// ** The next vector does NOT stay in Cone!!\n");
@@ -2973 +2992 @@
       if(tp_deg == nV)
         nlast = 1;
-      
+
       delete next_weight;
       break;
@@ -2983 +3002 @@
       break;
     }
-    
+
     if(MivComp(next_weight, target_weight) == 1)  {
       if(tp_deg == nV)
@@ -2989 +3008 @@
       else {
       REC_LAST_GB_ALT2:
-        nOverflow_Error = Overflow_Error;
-        tproc=tproc+clock()-tinput;
-        /*
-          Print("\n// takes %d steps and calls \"Rec_LastGB\" (%d):", 
-          nwalk, tp_deg+1);
-        */
+        nOverflow_Error = Overflow_Error;
+        tproc=tproc+clock()-tinput;
+        /*
+          Print("\n// takes %d steps and calls \"Rec_LastGB\" (%d):",
+          nwalk, tp_deg+1);
+        */
         G = Rec_LastGB(G,curr_weight, orig_target_weight, tp_deg+1,nnwinC);
         newRing = currRing;
@@ -3001 +3020 @@
       }
     }
-    
+
     for(i=nV-1; i>=0; i--) {
       //(*extra_curr_weight)[i] = (*curr_weight)[i];
       (*curr_weight)[i] = (*next_weight)[i];
-    }    
-    delete next_weight; 
-  }//while  
+    }
+    delete next_weight;
+  }//while
 
   delete ivNull;
@@ -3020 +3039 @@
 
     F1 = idrMoveR(G, newRing);
-    
+
     if(nnwinC == 0 || test_w_in_ConeCC(F1, target_weight) != 1 ) {
       nOverflow_Error = Overflow_Error;
       //Print("\n//  takes %d steps and calls \"Rec_LastGB (%d):", tp_deg+1);
       tproc=tproc+clock()-tinput;
-      F1 = Rec_LastGB(F1,curr_weight, orig_target_weight, tp_deg+1,nnwinC); 
-    }    
+      F1 = Rec_LastGB(F1,curr_weight, orig_target_weight, tp_deg+1,nnwinC);
+    }
     delete target_weight;
 
@@ -3034 +3053 @@
   }
   else  {
-    if(nlast == 1) {      
+    if(nlast == 1) {
       JUNI_STD:
-      
+
       newRing = currRing;
       if (currRing->parameter != NULL)
@@ -3054 +3073 @@
       xtextra=xtextra+clock()-to;
 
-      
+
       idDelete(&F1);
       newRing = currRing;
     }
-    
+
     LastGB_Finish:
     rChangeCurrRing(EXXRing);
-    result = idrMoveR(G, newRing);  
-  } 
-
-  if(Overflow_Error == FALSE) 
+    result = idrMoveR(G, newRing);
+  }
+
+  if(Overflow_Error == FALSE)
     Overflow_Error=nError;
   /*
   Print("\n// \"Rec_LastGB\" (%d) took %d steps and %.2f sec.Overflow_Error (%d)", tp_deg,
-        nwalk, ((double) tproc)/1000000, nOverflow_Error);
+        nwalk, ((double) tproc)/1000000, nOverflow_Error);
   */
-  return(result);  
-}
-
-/* The following subroutine is the implementation of our second improved 
+  return(result);
+}
+
+/* The following subroutine is the implementation of our second improved
    Groebner walk algorithm, i.e. the second altervative algorithm.
    First we use the Grobner walk algorithm and then we call the changed
    perturbation walk algorithm with increased degree, if an intermediate
-   weight vector is equal to the current target weight vector. 
-   This call will be only repeated until we get the wanted reduced Groebner 
+   weight vector is equal to the current target weight vector.
+   This call will be only repeated until we get the wanted reduced Groebner
    basis or n times, where n is the numbers of variables.
 */
@@ -3096 +3115 @@
   int i, nV = currRing->N;
   int nwalk=0, endwalks=0, nhilb=1;
-  
+
   ideal Gomega, M, F, Gomega1, Gomega2, M1, F1, G, G1;
   ring endRing, newRing, oldRing;
@@ -3106 +3125 @@
 
   ring XXRing = currRing;
-        
+
   //Print("\n// ring r_input = %s;", rString(currRing));
-  to = clock();  
-  /* compute the reduced Groebner basis of the given ideal w.r.t. 
-     a "fast" monomial order, e.g. degree reverse lex. order (dp) */ 
+  to = clock();
+  /* compute the reduced Groebner basis of the given ideal w.r.t.
+     a "fast" monomial order, e.g. degree reverse lex. order (dp) */
   G = MstdCC(Go);
   tostd=clock()-to;
-  
+
   /*
-  Print("\n// Computation of the first std took = %.2f sec", 
+  Print("\n// Computation of the first std took = %.2f sec",
         ((double) tostd)/1000000);
   */
   if(currRing->order[0] == ringorder_a)
     goto NEXT_VECTOR;
-  
+
   while(1)
-  { 
+  {
     nwalk ++;
     nstep ++;
-    to = clock(); 
+    to = clock();
     /* compute an initial form ideal of <G> w.r.t. "curr_vector" */
     Gomega = MwalkInitialForm(G, curr_weight);
@@ -3137 +3156 @@
       goto LAST_GB_ALT2;
     }
-#endif 
+#endif
     oldRing = currRing;
-    
+
     /* define a new ring that its ordering is "(a(curr_weight),lp) */
     if (currRing->parameter != NULL)
@@ -3146 +3165 @@
       VMrDefault(curr_weight);
 
-    newRing = currRing; 
+    newRing = currRing;
     Gomega1 = idrMoveR(Gomega, oldRing);
-    to = clock(); 
+    to = clock();
     /* compute a reduced Groebner basis of <Gomega> w.r.t. "newRing" */
     M = MstdhomCC(Gomega1);
     xtstd=xtstd+clock()-to;
-    /* change the ring to oldRing */ 
+    /* change the ring to oldRing */
     rChangeCurrRing(oldRing);
     M1 =  idrMoveR(M, newRing);
     Gomega2 =  idrMoveR(Gomega1, newRing);
 
-    to = clock(); 
-    /* compute the reduced Groebner basis of <G> w.r.t. "newRing" 
+    to = clock();
+    /* compute the reduced Groebner basis of <G> w.r.t. "newRing"
        by the liftig process */
     F = MLifttwoIdeal(Gomega2, M1, G);
     xtlift=xtlift+clock()-to;
-    idDelete(&M1);  
-    idDelete(&Gomega2); 
-    idDelete(&G); 
-
-    /* change the ring to newRing */ 
+    idDelete(&M1);
+    idDelete(&Gomega2);
+    idDelete(&G);
+
+    /* change the ring to newRing */
     rChangeCurrRing(newRing);
-    F1 = idrMoveR(F, oldRing); 
-
-    to = clock(); 
-    /* reduce the Groebner basis <G> w.r.t. newRing */   
+    F1 = idrMoveR(F, oldRing);
+
+    to = clock();
+    /* reduce the Groebner basis <G> w.r.t. newRing */
     G = kInterRedCC(F1, NULL);
     xtred=xtred+clock()-to;
     idDelete(&F1);
-        
+
     if(endwalks == 1)
       break;
 
   NEXT_VECTOR:
-    to = clock(); 
+    to = clock();
     /* compute a next weight vector */
     next_weight = MkInterRedNextWeight(curr_weight,target_weight, G);
     xtnw=xtnw+clock()-to;
-#ifdef PRINT_VECTORS 
+#ifdef PRINT_VECTORS
     MivString(curr_weight, target_weight, next_weight);
 #endif
-    
+
     if(Overflow_Error == TRUE)
     {
       /*
-        ivString(next_weight, "omega");
-        PrintS("\n// ** The weight vector does NOT stay in Cone!!\n");
+        ivString(next_weight, "omega");
+        PrintS("\n// ** The weight vector does NOT stay in Cone!!\n");
       */
 #ifdef TEST_OVERFLOW
@@ -3198 +3217 @@
 #endif
 
-    
+
       newRing = currRing;
       if (currRing->parameter != NULL)
@@ -3205 +3224 @@
         VMrDefault(target_weight);
 
-      F1 = idrMoveR(G, newRing); 
+      F1 = idrMoveR(G, newRing);
       G = MstdCC(F1);
       idDelete(&F1);
@@ -3218 +3237 @@
       break;
     }
-    
+
     if(MivComp(next_weight, target_weight) == 1)
     {
       if(MivSame(target_weight, exivlp)==1)
       {
-      LAST_GB_ALT2: 
-        nOverflow_Error = Overflow_Error;
-        tproc = clock()-xftinput;
+      LAST_GB_ALT2:
+        nOverflow_Error = Overflow_Error;
+        tproc = clock()-xftinput;
         //Print("\n// takes %d steps and calls the recursion of level 2:",  nwalk);
         /* call the changed perturbation walk algorithm with degree 2 */
@@ -3235 +3254 @@
       endwalks = 1;
     }
-    
+
     for(i=nV-1; i>=0; i--)
     {
@@ -3251 +3270 @@
 #ifdef TIME_TEST
   Print("\n// \"Main procedure\"  took %d steps dnd %.2f sec. Overflow_Error (%d)", nwalk,
-        ((double) tproc)/1000000, nOverflow_Error);
+        ((double) tproc)/1000000, nOverflow_Error);
 
   TimeStringFractal(xftinput, tostd, xtif, xtstd, xtextra,xtlift, xtred,xtnw);
@@ -3259 +3278 @@
   Print("\n// Awalk2 took %d steps!!", nstep);
 #endif
- 
+
   return(G);
 }
@@ -3267 +3286 @@
 /* The implementation of the fractal walk algorithmus */
 
-/* The main procedur Mfwalk calls the recursive Subroutine 
+/* The main procedur Mfwalk calls the recursive Subroutine
    rec_fractal_call to compute the wanted Gröbner basis.
    At the main procedur we compute the reduced Gröbner basis w.r.t. a "fast"
-   order, e.g. "dp" and a sequence of weight vectors which are row vectors 
+   order, e.g. "dp" and a sequence of weight vectors which are row vectors
    of a matrix. This matrix defines the given monomial order, e.g. "lp"
 */
@@ -3297 +3316 @@
 
 /***********************************************************************
-  The procedur REC_GB_Mwalk computes a GB for <G> w.r.t. the weight order 
+  The procedur REC_GB_Mwalk computes a GB for <G> w.r.t. the weight order
   otw, where G is a reduced GB w.r.t. the weight order cw.
   The new procedur Mwalk calls REC_GB.
 ************************************************************************/
-static ideal REC_GB_Mwalk(ideal G, intvec* curr_weight, intvec* orig_target_weight, 
-                          int tp_deg, int npwinc) 
+static ideal REC_GB_Mwalk(ideal G, intvec* curr_weight, intvec* orig_target_weight,
+                          int tp_deg, int npwinc)
 {
   BOOLEAN nError = Overflow_Error;
   Overflow_Error = FALSE;
-  
+
   int i,  nV = currRing->N, ntwC,  npwinC;
   int nwalk=0, endwalks=0, nnwinC=1, nlast = 0;
@@ -3313 +3332 @@
   intvec* iv_M_lp;
   intvec* target_weight;
-  intvec* ivNull = new intvec(nV); 
+  intvec* ivNull = new intvec(nV);
   intvec* hilb_func;
   BOOLEAN isGB = FALSE;
@@ -3336 +3355 @@
     TargetRing = currRing;
     ssG = idrMoveR(G,EXXRing);
-    
+
     ideal H0_tmp = idrMoveR(H0,EXXRing);
     ideal H1 = idHeadCC(ssG);
@@ -3356 +3375 @@
       else
         goto LastGB_Finish;
-    }   
+    }
     idDelete(&H0_tmp);   idDelete(&H1);
-    
+
     intvec* ivlp = Mivlp(nV);
     if( MivSame(orig_target_weight, ivlp)==1 )
@@ -3367 +3386 @@
     //target_weight  = MPertVectorslp(ssG, iv_M_lp, tp_deg);
     target_weight  = MPertVectors(ssG, iv_M_lp, tp_deg);
-    
+
     delete ivlp;
     delete iv_M_lp;
@@ -3374 +3393 @@
     G = idrMoveR(ssG, TargetRing);
   }
- 
+
   while(1)
-  { 
+  {
     nwalk ++;
     nstep++;
@@ -3394 +3413 @@
       hilb_func = hFirstSeries(Gomega,NULL,NULL,last_omega,currRing);
 #endif // BUCHBERGER_ALG
-    
+
     oldRing = currRing;
 
@@ -3403 +3422 @@
       VMrDefault(curr_weight);
 
-    newRing = currRing; 
+    newRing = currRing;
     Gomega1 = idrMoveR(Gomega, oldRing);
 
@@ -3412 +3431 @@
 #else
     M=kStd(Gomega1,NULL,isHomog,NULL,hilb_func,0,NULL,curr_weight);
-    delete hilb_func;    
+    delete hilb_func;
 #endif // BUCHBERGER_ALG
     xtstd = xtstd + clock() - to;
 
-    /* change the ring to oldRing */ 
+    /* change the ring to oldRing */
     rChangeCurrRing(oldRing);
-   
+
     M1 =  idrMoveR(M, newRing);
-    Gomega2 =  idrMoveR(Gomega1, newRing); 
-    
+    Gomega2 =  idrMoveR(Gomega1, newRing);
+
     to = clock();
     F = MLifttwoIdeal(Gomega2, M1, G);
     xtlift = xtlift + clock() -to;
 
-    idDelete(&M1);  
-    idDelete(&Gomega2); 
+    idDelete(&M1);
+    idDelete(&Gomega2);
     idDelete(&G);
 
 
-    /* change the ring to newRing */ 
+    /* change the ring to newRing */
     rChangeCurrRing(newRing);
     F1 = idrMoveR(F, oldRing);
 
-    to = clock(); 
-    /* reduce the Groebner basis <G> w.r.t. new ring */   
+    to = clock();
+    /* reduce the Groebner basis <G> w.r.t. new ring */
     G = kInterRedCC(F1, NULL);
     xtred = xtred + clock() -to;
@@ -3451 +3470 @@
     xtnw = xtnw + clock() - to;
 
-#ifdef PRINT_VECTORS 
+#ifdef PRINT_VECTORS
     MivString(curr_weight, target_weight, next_weight);
 #endif
 
-    /*check whether the computed vector does in the correct cone */ 
+    /*check whether the computed vector does in the correct cone */
     //ntwC = test_w_in_ConeCC(G, next_weight);
     //if(ntwC != 1)
@@ -3473 +3492 @@
       break;
     }
-    
+
     if(MivComp(next_weight, target_weight) == 1)
     {
@@ -3490 +3509 @@
       (*curr_weight)[i] = (*next_weight)[i];
 
-    delete next_weight; 
-  }//while  
+    delete next_weight;
+  }//while
 
   delete ivNull;
@@ -3499 +3518 @@
     //28.07.03
     newRing = currRing;
-    
+
     if (currRing->parameter != NULL)
       //  DefRingParlp(); //
@@ -3508 +3527 @@
 
     F1 = idrMoveR(G, newRing);
-    
+
     if(nnwinC == 0)
       F1 = REC_GB_Mwalk(F1,curr_weight, orig_target_weight, tp_deg+1,nnwinC);
@@ -3514 +3533 @@
       if(test_w_in_ConeCC(F1, target_weight) != 1)
         F1 = REC_GB_Mwalk(F1,curr_weight, orig_target_weight,tp_deg+1,nnwinC);
-    
+
     delete target_weight;
 
@@ -3524 +3543 @@
   {
     if(nlast == 1)
-    {            
+    {
       if (currRing->parameter != NULL)
         DefRingPar(orig_target_weight);
@@ -3543 +3562 @@
       newRing = currRing;
     }
-    
+
   LastGB_Finish:
     rChangeCurrRing(EXXRing);
     result = idrMoveR(G, newRing);
-  } 
-  
+  }
+
   if(Overflow_Error == FALSE)
     Overflow_Error = nError;
-  
-  return(result);  
+
+  return(result);
 }
 
@@ -3558 +3577 @@
 /* 08.09.02 */
 /******** THE NEW GRÖBNER WALK ALGORITHM **********/
-/* Gröbnerwalk with a recursive "second" alternative GW, REC_GB_Mwalk 
+/* Gröbnerwalk with a recursive "second" alternative GW, REC_GB_Mwalk
    that only computes the last reduced GB */
 ideal Mwalk(ideal Go, intvec* curr_weight, intvec* target_weight)
@@ -3589 +3608 @@
     (*last_omega)[i] = 1;
   (*last_omega)[0] = 10000;
-  
+
   ring XXRing = currRing;
 
@@ -3599 +3618 @@
   if(currRing->order[0] == ringorder_a)
     goto NEXT_VECTOR;
-  
+
   while(1)
-  { 
+  {
     nwalk ++;
     nstep ++;
@@ -3616 +3635 @@
       tim = clock();
       /*
-        Print("\n// **** Gröbnerwalk took %d steps and ", nwalk);
-        PrintS("\n// **** call the rec. Pert. Walk to compute a red GB of:");
-        idElements(Gomega, "G_omega");
+        Print("\n// **** Gröbnerwalk took %d steps and ", nwalk);
+        PrintS("\n// **** call the rec. Pert. Walk to compute a red GB of:");
+        idElements(Gomega, "G_omega");
       */
 
       if(MivSame(exivlp, target_weight)==1)
-        M = REC_GB_Mwalk(idCopy(Gomega), tmp_weight, curr_weight, 2,1); 
+        M = REC_GB_Mwalk(idCopy(Gomega), tmp_weight, curr_weight, 2,1);
       else
         goto NORMAL_GW;
       /*
-        Print("\n//  time for the last std(Gw)  = %.2f sec", 
-        ((double) (clock()-tim)/1000000));
-        PrintS("\n// ***************************************************\n");
+        Print("\n//  time for the last std(Gw)  = %.2f sec",
+        ((double) (clock()-tim)/1000000));
+        PrintS("\n// ***************************************************\n");
       */
-#ifdef CHECK_IDEAL_MWALK 
+#ifdef CHECK_IDEAL_MWALK
       idElements(Gomega, "G_omega");
       headidString(Gomega, "Gw");
       idElements(M, "M");
       //headidString(M, "M");
-#endif      
+#endif
       to = clock();
       F = MLifttwoIdeal(Gomega, M, G);
@@ -3646 +3665 @@
       oldRing = currRing;
 
-      /* create a new ring newRing */ 
+      /* create a new ring newRing */
        if (currRing->parameter != NULL)
          DefRingPar(curr_weight);
@@ -3652 +3671 @@
          VMrDefault(curr_weight);
 
-      newRing = currRing;       
-      F1 = idrMoveR(F, oldRing); 
+      newRing = currRing;
+      F1 = idrMoveR(F, oldRing);
     }
     else
@@ -3660 +3679 @@
 #ifndef  BUCHBERGER_ALG
       if(isNolVector(curr_weight) == 0)
-        hilb_func = hFirstSeries(Gomega,NULL,NULL,curr_weight,currRing);
+        hilb_func = hFirstSeries(Gomega,NULL,NULL,curr_weight,currRing);
       else
-        hilb_func = hFirstSeries(Gomega,NULL,NULL,last_omega,currRing);
+        hilb_func = hFirstSeries(Gomega,NULL,NULL,last_omega,currRing);
 #endif // BUCHBERGER_ALG
 
       /* define a new ring that its ordering is "(a(curr_weight),lp) */
       if (currRing->parameter != NULL)
-        DefRingPar(curr_weight);
+        DefRingPar(curr_weight);
       else
-        VMrDefault(curr_weight);
-
-      newRing = currRing;       
+        VMrDefault(curr_weight);
+
+      newRing = currRing;
       Gomega1 = idrMoveR(Gomega, oldRing);
- 
+
       to = clock();
       /* compute a reduced Groebner basis of <Gomega> w.r.t. "newRing" */
@@ -3680 +3699 @@
 #else
       M=kStd(Gomega1,NULL,isHomog,NULL,hilb_func,0,NULL,curr_weight);
-      delete hilb_func;    
+      delete hilb_func;
 #endif // BUCHBERGER_ALG
       tstd = tstd + clock() - to;
 
-      /* change the ring to oldRing */ 
+      /* change the ring to oldRing */
       rChangeCurrRing(oldRing);
       M1 =  idrMoveR(M, newRing);
@@ -3691 +3710 @@
       to = clock();
       /* compute a representation of the generators of submod (M)
-         with respect to those of mod (Gomega). 
+         with respect to those of mod (Gomega).
          Gomega is a reduced Groebner basis w.r.t. the current ring */
       F = MLifttwoIdeal(Gomega2, M1, G);
       tlift = tlift + clock() - to;
 
-      idDelete(&M1);  
-      idDelete(&Gomega2); 
-      idDelete(&G); 
-
-      /* change the ring to newRing */ 
+      idDelete(&M1);
+      idDelete(&Gomega2);
+      idDelete(&G);
+
+      /* change the ring to newRing */
       rChangeCurrRing(newRing);
-      F1 = idrMoveR(F, oldRing); 
+      F1 = idrMoveR(F, oldRing);
     }
 
     to = clock();
-    /* reduce the Groebner basis <G> w.r.t. new ring */   
+    /* reduce the Groebner basis <G> w.r.t. new ring */
     G = kInterRedCC(F1, NULL);
     if(endwalks != 1)
@@ -3716 +3735 @@
     if(endwalks == 1)
       break;
-    
+
   NEXT_VECTOR:
     to = clock();
@@ -3722 +3741 @@
     intvec* next_weight = MkInterRedNextWeight(curr_weight,target_weight,G);
     tnw = tnw + clock() - to;
-#ifdef PRINT_VECTORS 
+#ifdef PRINT_VECTORS
     MivString(curr_weight, target_weight, next_weight);
 #endif
@@ -3736 +3755 @@
       else
         VMrDefault(target_weight);
-      
-      F1 = idrMoveR(G, newRing); 
+
+      F1 = idrMoveR(G, newRing);
       G = MstdCC(F1);
       idDelete(&F1);
-      
+
       newRing = currRing;
       break;
@@ -3765 +3784 @@
   delete tmp_weight;
   delete ivNull;
-  delete exivlp; 
- 
+  delete exivlp;
+
 #ifdef TIME_TEST
   TimeString(tinput, tostd, tif, tstd, tlift, tred, tnw, nstep);
@@ -3783 +3802 @@
   int i, nV = currRing->N;
   int nwalk=0, endwalks=0;
-  
+
   ideal Gomega, M, F, Gomega1, Gomega2, M1, F1, G, G1;
   ring endRing, newRing, oldRing;
@@ -3805 +3824 @@
 
   while(1)
-  { 
+  {
     nwalk ++;
     //Print("\n// Entering the %d-th step:", nwalk);
     //Print("\n// ring r[%d] = %s;", nwalk, rString(currRing));
-    idString(G,"G"); 
+    idString(G,"G");
     /* compute an initial form ideal of <G> w.r.t. "curr_vector" */
     Gomega = MwalkInitialForm(G, curr_weight);
     //ivString(curr_weight, "omega");
-    idString(Gomega,"Gw"); 
+    idString(Gomega,"Gw");
 
 #ifndef  BUCHBERGER_ALG
@@ -3824 +3843 @@
 
     oldRing = currRing;
-    
+
     /* define a new ring that its ordering is "(a(curr_weight),lp) */
     VMrDefault(curr_weight);
-    newRing = currRing; 
-    
+    newRing = currRing;
+
     Gomega1 = idrMoveR(Gomega, oldRing);
- 
+
     /* compute a reduced Groebner basis of <Gomega> w.r.t. "newRing" */
 #ifdef  BUCHBERGER_ALG
@@ -3836 +3855 @@
 #else
     M=kStd(Gomega1,NULL,isHomog,NULL,hilb_func,0,NULL,curr_weight);
-    delete hilb_func;    
+    delete hilb_func;
 #endif // BUCHBERGER_ALG
 
     idString(M,"M");
 
-      /* change the ring to oldRing */ 
+      /* change the ring to oldRing */
     rChangeCurrRing(oldRing);
     M1 =  idrMoveR(M, newRing);
@@ -3847 +3866 @@
 
       /* compute a representation of the generators of submod (M)
-         with respect to those of mod (Gomega). 
-         Gomega is a reduced Groebner basis w.r.t. the current ring */
+         with respect to those of mod (Gomega).
+         Gomega is a reduced Groebner basis w.r.t. the current ring */
     F = MLifttwoIdeal(Gomega2, M1, G);
-    idDelete(&M1);  
-    idDelete(&Gomega2); 
-    idDelete(&G); 
+    idDelete(&M1);
+    idDelete(&Gomega2);
+    idDelete(&G);
     idString(F,"F");
-    
-    /* change the ring to newRing */ 
+
+    /* change the ring to newRing */
     rChangeCurrRing(newRing);
-    F1 = idrMoveR(F, oldRing); 
-    
-    /* reduce the Groebner basis <G> w.r.t. new ring */   
+    F1 = idrMoveR(F, oldRing);
+
+    /* reduce the Groebner basis <G> w.r.t. new ring */
     G = kInterRedCC(F1, NULL);
     //idSkipZeroes(G);//done by kInterRed
@@ -3866 +3885 @@
     if(endwalks == 1)
       break;
-    
+
     /* compute a next weight vector */
     intvec* next_weight = MkInterRedNextWeight(curr_weight,target_weight,G);
-#ifdef PRINT_VECTORS 
+#ifdef PRINT_VECTORS
     MivString(curr_weight, target_weight, next_weight);
 #endif
@@ -3904 +3923 @@
 /**************************************************************/
 /* If the perturbed target weight vector or an intermediate weight vector
-   doesn't stay in the correct Groebner cone, we have only 
-   a reduced Groebner basis for the given ideal with respect to 
+   doesn't stay in the correct Groebner cone, we have only
+   a reduced Groebner basis for the given ideal with respect to
    a monomial order which differs to the given order.
    Then we have to compute the wanted  reduced Groebner basis for it.
@@ -3914 +3933 @@
 /* use kStd, if nP = 0, else call LastGB */
 ideal Mpwalk(ideal Go, int op_deg, int tp_deg,intvec* curr_weight,
-             intvec* target_weight, int nP)
-{ 
+             intvec* target_weight, int nP)
+{
   Set_Error(FALSE  );
   Overflow_Error = FALSE;
@@ -3930 +3949 @@
   int i, ntwC=1, ntestw=1,  nV = currRing->N, op_tmp = op_deg;
   int endwalks=0, nhilb=0, ntestomega=0;
-  
+
   ideal Gomega, M, F, G, Gomega1, Gomega2, M1,F1,Eresult,ssG;
   ring newRing, oldRing, TargetRing;
@@ -3938 +3957 @@
   intvec* orig_target = target_weight;
   intvec* pert_target_vector = target_weight;
-  intvec* ivNull = new intvec(nV); 
+  intvec* ivNull = new intvec(nV);
   intvec* iv_dp = MivUnit(nV);// define (1,1,...,1)
   intvec* cw_tmp = curr_weight;
@@ -3944 +3963 @@
   intvec* next_weight;
   intvec* extra_curr_weight = new intvec(nV);
-  
+
   /* to avoid (1,0,...,0) as the target vector */
   intvec* last_omega = new intvec(nV);
@@ -3950 +3969 @@
     (*last_omega)[i] = 1;
   (*last_omega)[0] = 10000;
-  
+
   ring XXRing = currRing;
 
@@ -3965 +3984 @@
       curr_weight = MPertVectors(G, iv_M_dp, op_deg);
     }
-  }     
+  }
   else
   {
-    //ring order := (a(curr_weight),lp); 
+    //ring order := (a(curr_weight),lp);
     if (currRing->parameter != NULL)
       DefRingPar(curr_weight);
     else
       VMrDefault(curr_weight);
-    
+
     G = idrMoveR(Go, XXRing);
     G = MstdCC(G);
@@ -3984 +4003 @@
   delete iv_dp;
   if(op_deg != 1) delete iv_M_dp;
-  
+
   ring HelpRing = currRing;
 
@@ -4008 +4027 @@
       iv_M_lp = MivMatrixOrder(target_weight);
       //target_weight = MPertVectorslp(ssG, iv_M_lp, tp_deg);
-      target_weight = MPertVectors(ssG, iv_M_lp, tp_deg); 
-    }  
+      target_weight = MPertVectors(ssG, iv_M_lp, tp_deg);
+    }
     delete iv_M_lp;
     pert_target_vector = target_weight; //vor 19. mai 2003//test 19 Junu 03
@@ -4021 +4040 @@
   */
   while(1)
-  { 
+  {
     nstep ++;
     to = clock();
-    /* compute an initial form ideal of <G> w.r.t. the weight vector 
+    /* compute an initial form ideal of <G> w.r.t. the weight vector
        "curr_weight" */
     Gomega = MwalkInitialForm(G, curr_weight);
-    
+
 
 #ifdef ENDWALKS
-    if(endwalks == 1){ 
-      Print("\n// ring r%d = %s;\n", nstep, rString(currRing)); 
+    if(endwalks == 1){
+      Print("\n// ring r%d = %s;\n", nstep, rString(currRing));
       idElements(G, "G");
       // idElements(Gomega, "Gw");
@@ -4056 +4075 @@
       VMrDefault(curr_weight);
 
-    newRing = currRing; 
+    newRing = currRing;
     Gomega1 = idrMoveR(Gomega, oldRing);
 
-#ifdef ENDWALKS    
+#ifdef ENDWALKS
     if(endwalks==1)
     {
       Print("\n// ring r%d = %s;\n", nstep, rString(currRing));
       idElements(Gomega1, "Gw");
-      headidString(Gomega1, "headGw"); 
+      headidString(Gomega1, "headGw");
       PrintS("\n// compute a rGB of Gw:\n");
 
-#ifndef  BUCHBERGER_ALG   
+#ifndef  BUCHBERGER_ALG
       ivString(hilb_func, "w");
-#endif 
-    }
 #endif
-    
+    }
+#endif
+
     tim = clock();
     to = clock();
@@ -4080 +4099 @@
 #else
     M=kStd(Gomega1,NULL,isHomog,NULL,hilb_func,0,NULL,curr_weight);
-    delete hilb_func;    
+    delete hilb_func;
 #endif // BUCHBERGER_ALG
 
     if(endwalks == 1){
       xtstd = xtstd+clock()-to;
-#ifdef ENDWALKS    
-      Print("\n// time for the last std(Gw)  = %.2f sec\n", 
+#ifdef ENDWALKS
+      Print("\n// time for the last std(Gw)  = %.2f sec\n",
             ((double) clock())/1000000 -((double)tim) /1000000);
 #endif
@@ -4093 +4112 @@
       tstd=tstd+clock()-to;
 
-    /* change the ring to oldRing */ 
+    /* change the ring to oldRing */
     rChangeCurrRing(oldRing);
     M1 =  idrMoveR(M, newRing);
-    Gomega2 =  idrMoveR(Gomega1, newRing); 
-   
+    Gomega2 =  idrMoveR(Gomega1, newRing);
+
     //if(endwalks==1)  PrintS("\n// Lifting is working:..");
 
     to=clock();
     /* compute a representation of the generators of submod (M)
-       with respect to those of mod (Gomega). 
+       with respect to those of mod (Gomega).
        Gomega is a reduced Groebner basis w.r.t. the current ring */
     F = MLifttwoIdeal(Gomega2, M1, G);
@@ -4110 +4129 @@
       xtlift=clock()-to;
 
-    idDelete(&M1);  
-    idDelete(&Gomega2); 
+    idDelete(&M1);
+    idDelete(&Gomega2);
     idDelete(&G);
 
-    /* change the ring to newRing */ 
+    /* change the ring to newRing */
     rChangeCurrRing(newRing);
     F1 = idrMoveR(F, oldRing);
@@ -4121 +4140 @@
 
     to=clock();
-    /* reduce the Groebner basis <G> w.r.t. new ring */   
+    /* reduce the Groebner basis <G> w.r.t. new ring */
     G = kInterRedCC(F1, NULL);
     if(endwalks != 1)
@@ -4129 +4148 @@
 
     idDelete(&F1);
-   
+
     if(endwalks == 1)
       break;
-    
+
     to=clock();
     /* compute a next weight vector */
     next_weight = MkInterRedNextWeight(curr_weight,target_weight, G);
     tnw=tnw+clock()-to;
-#ifdef PRINT_VECTORS 
+#ifdef PRINT_VECTORS
     MivString(curr_weight, target_weight, next_weight);
 #endif
@@ -4145 +4164 @@
       ntwC = 0;
       ntestomega = 1;
-      //Print("\n// ring r%d = %s;\n", nstep, rString(currRing)); 
+      //Print("\n// ring r%d = %s;\n", nstep, rString(currRing));
       //idElements(G, "G");
       delete next_weight;
-      goto FINISH_160302; 
+      goto FINISH_160302;
     }
     if(MivComp(next_weight, ivNull) == 1){
@@ -4159 +4178 @@
       endwalks = 1;
 
-    for(i=nV-1; i>=0; i--) 
+    for(i=nV-1; i>=0; i--)
       (*curr_weight)[i] = (*next_weight)[i];
-    
+
     delete next_weight;
   }//while
@@ -4168 +4187 @@
   {
   FINISH_160302://16.03.02
-    if(MivSame(orig_target, exivlp) == 1) 
+    if(MivSame(orig_target, exivlp) == 1)
       if (currRing->parameter != NULL)
         DefRingParlp();
@@ -4178 +4197 @@
       else
         VMrDefault(orig_target);
-    
+
     TargetRing=currRing;
     F1 = idrMoveR(G, newRing);
@@ -4184 +4203 @@
       headidString(G, "G");
 #endif
-        
+
 
     // check whether the pertubed target vector stays in the correct cone
@@ -4194 +4213 @@
     {
       /*
-      if(ntestw != 1){ 
-        ivString(pert_target_vector, "tau"); 
-        PrintS("\n// ** perturbed target vector doesn't stay in cone!!"); 
-        Print("\n// ring r%d = %s;\n", nstep, rString(currRing)); 
-        idElements(F1, "G"); 
+      if(ntestw != 1){
+        ivString(pert_target_vector, "tau");
+        PrintS("\n// ** perturbed target vector doesn't stay in cone!!");
+        Print("\n// ring r%d = %s;\n", nstep, rString(currRing));
+        idElements(F1, "G");
       }
       */
@@ -4205 +4224 @@
       ideal eF1;
       if(nP == 0 || tp_deg == 1 || MivSame(orig_target, exivlp) != 1){
-        // PrintS("\n// ** calls \"std\" to compute a GB"); 
+        // PrintS("\n// ** calls \"std\" to compute a GB");
         eF1 = MstdCC(F1);
         idDelete(&F1);
       }
       else {
-        // PrintS("\n// ** calls \"LastGB\" to compute a GB"); 
-        rChangeCurrRing(newRing);
-        ideal F2 = idrMoveR(F1, TargetRing);
-        eF1 = LastGB(F2, curr_weight, tp_deg-1);
-        F2=NULL;
+        // PrintS("\n// ** calls \"LastGB\" to compute a GB");
+        rChangeCurrRing(newRing);
+        ideal F2 = idrMoveR(F1, TargetRing);
+        eF1 = LastGB(F2, curr_weight, tp_deg-1);
+        F2=NULL;
       }
       xtextra=clock()-to;
@@ -4221 +4240 @@
       rChangeCurrRing(XXRing);
       Eresult = idrMoveR(eF1, exTargetRing);
-    }    
+    }
     else{
       rChangeCurrRing(XXRing);
@@ -4230 +4249 @@
     rChangeCurrRing(XXRing);
     Eresult = idrMoveR(G, newRing);
-  } 
+  }
   delete ivNull;
   if(tp_deg != 1)
@@ -4242 +4261 @@
 
 #ifdef TIME_TEST
-  TimeStringFractal(tinput, tostd, tif+xtif, tstd+xtstd,0, tlift+xtlift, tred+xtred, 
-             tnw+xtnw);
+  TimeStringFractal(tinput, tostd, tif+xtif, tstd+xtstd,0, tlift+xtlift, tred+xtred,
+             tnw+xtnw);
 
   Print("\n// pSetm_Error = (%d)", ErrorCheck());
   Print("\n// It took %d steps and Overflow_Error? (%d)\n", nstep,  Overflow_Error);
 #endif
-  return(Eresult);  
+  return(Eresult);
 }
 
@@ -4258 +4277 @@
   int i,j;
   intvec* ivM = new intvec(nV*nV);
-      
+
   for(i=0; i<nV; i++)
     for(j=0; j<nV; j++)
     (*ivM)[i*nV + j] = 1;
-  
+
   return(ivM);
 }
@@ -4303 +4322 @@
       (*omega)[i] = (*Xsigma)[(nV*(nlev-1))+i];
 
-    (*omega2)[i] = (*Xtau)[(nlev-1)*nV+i]; 
-  }
-   
+    (*omega2)[i] = (*Xtau)[(nlev-1)*nV+i];
+  }
+
    if(nlev == 1)  Xcall = 1;
    else Xcall = 0;
 
   ring oRing = currRing;
-  
+
   while(1)
   {
 #ifdef FIRST_STEP_FRACTAL
-    // perturb the current weight vector only on the top level or 
+    // perturb the current weight vector only on the top level or
     // after perturbation of the both vectors, nlev = 2 as the top level
     if((nlev == 1 && Xcall == 0) || (nlev == 2 && Xngleich == 1))
       if(islengthpoly2(G) == 1)
       {
-        Mwlp = MivWeightOrderlp(omega);
-        Xsigma = Mfpertvector(G, Mwlp);
-        delete Mwlp;
-        Overflow_Error = FALSE;
+        Mwlp = MivWeightOrderlp(omega);
+        Xsigma = Mfpertvector(G, Mwlp);
+        delete Mwlp;
+        Overflow_Error = FALSE;
       }
 #endif
@@ -4331 +4350 @@
     next_vect = MkInterRedNextWeight(omega,omega2,G);
     xtnw=xtnw+clock()-to;
-#ifdef PRINT_VECTORS 
+#ifdef PRINT_VECTORS
     MivString(omega, omega2, next_vect);
 #endif
     oRing = currRing;
-    
+
     /* We only perturb the current target vector at the recursion  level 1 */
-    if(Xngleich == 0 && nlev == 1) //(ngleich == 0) important, e.g. ex2, ex3 
-      if (MivComp(next_vect, omega2) == 1) 
+    if(Xngleich == 0 && nlev == 1) //(ngleich == 0) important, e.g. ex2, ex3
+      if (MivComp(next_vect, omega2) == 1)
       {
         /* to dispense with taking initial (and lifting/interreducing
            after the call of recursion */
         //Print("\n\n// ** Perturb the both vectors with degree %d with",nlev);
-        //idElements(G, "G");
+        //idElements(G, "G");
 
         Xngleich = 1;
@@ -4350 +4369 @@
         if (currRing->parameter != NULL)
           DefRingPar(omtmp);
-        else    
+        else
           VMrDefault(omtmp);
 
         testring = currRing;
         Gt = idrMoveR(G, oRing);
-      
+
         /* perturb the original target vector w.r.t. the current GB */
-        delete Xtau; 
+        delete Xtau;
         Xtau = NewVectorlp(Gt);
-            
-        rChangeCurrRing(oRing); 
+
+        rChangeCurrRing(oRing);
         G = idrMoveR(Gt, testring);
 
@@ -4367 +4386 @@
         Xsigma = Mfpertvector(G, Mwlp);
         delete Mwlp;
-        
+
         for(i=nV-1; i>=0; i--) {
           (*omega2)[i] = (*Xtau)[nV+i];
           (*omega)[i] = (*Xsigma)[nV+i];
         }
-        
+
         delete next_vect;
-        to=clock();
-
-        /* to avoid the value of Overflow_Error that occur in Mfpertvector*/
-        Overflow_Error = FALSE;
-
-        next_vect = MkInterRedNextWeight(omega,omega2,G); 
-        xtnw=xtnw+clock()-to;
-
-#ifdef PRINT_VECTORS 
+        to=clock();
+
+        /* to avoid the value of Overflow_Error that occur in Mfpertvector*/
+        Overflow_Error = FALSE;
+
+        next_vect = MkInterRedNextWeight(omega,omega2,G);
+        xtnw=xtnw+clock()-to;
+
+#ifdef PRINT_VECTORS
         MivString(omega, omega2, next_vect);
 #endif
       }
-    
-    
+
+
     /* check whether the the computed vector is in the correct cone */
-    /* If no, the reduced GB of an omega-homogeneous ideal will be 
+    /* If no, the reduced GB of an omega-homogeneous ideal will be
        computed by Buchberger algorithm and stop this recursion step*/
     //if(test_w_in_ConeCC(G, next_vect) != 1) //e.g. Example s7, cyc6
@@ -4414 +4433 @@
       Gt = NULL;
 
-      delete omega2;     
-      delete altomega; 
+      delete omega2;
+      delete altomega;
 
       //Print("\n// Leaving the %d-th recursion with %d steps", nlev, nwalks);
       //Print("  ** Overflow_Error? (%d)", Overflow_Error);
       nnflow ++;
-      
+
       Overflow_Error = FALSE;
       return (G1);
     }
 
- 
-    /* If the perturbed target vector stays in the correct cone, 
+
+    /* If the perturbed target vector stays in the correct cone,
        return the current GB,
-       otherwise, return the computed  GB by the Buchberger-algorithm. 
-       Then we update the perturbed target vectors w.r.t. this GB. */ 
-    
+       otherwise, return the computed  GB by the Buchberger-algorithm.
+       Then we update the perturbed target vectors w.r.t. this GB. */
+
     /* the computed vector is equal to the origin vector, since
        t is not defined */
-    if (MivComp(next_vect, XivNull) == 1) 
+    if (MivComp(next_vect, XivNull) == 1)
     {
       if (currRing->parameter != NULL)
@@ -4444 +4463 @@
 
       if(test_w_in_ConeCC(Gt, omega2) == 1) {
-        delete omega2;   
+        delete omega2;
         delete next_vect;
         delete altomega;
         //Print("\n// Leaving the %d-th recursion with %d steps ",nlev, nwalks);
         //Print(" ** Overflow_Error? (%d)", Overflow_Error);
-        
+
         return (Gt);
       }
@@ -4456 +4475 @@
         //ivString(omega2, "tau'");
         //Print("\n//  tau' doesn't stay in the correct cone!!");
- 
+
 #ifndef  MSTDCC_FRACTAL
         //07.08.03
@@ -4475 +4494 @@
         Xtau = Xtautmp;
         Xtautmp = NULL;
-        //ivString(Xtau, "new  Xtau");    
-        
-        for(i=nV-1; i>=0; i--)  
+        //ivString(Xtau, "new  Xtau");
+
+        for(i=nV-1; i>=0; i--)
           (*omega2)[i] = (*Xtau)[(nlev-1)*nV+i];
- 
+
         //Print("\n//  ring tau = %s;", rString(currRing));
         rChangeCurrRing(oRing);
@@ -4491 +4510 @@
         to=clock();
         G = MstdCC(Gt);
-        xtextra=xtextra+clock()-to;
-
-        oRing = currRing; 
-
-        // update the original target vector w.r.t. the current GB 
+        xtextra=xtextra+clock()-to;
+
+        oRing = currRing;
+
+        // update the original target vector w.r.t. the current GB
         if(MivSame(Xivinput, Xivlp) == 1)
           if (currRing->parameter != NULL)
@@ -4515 +4534 @@
         rChangeCurrRing(oRing);
         G = idrMoveR(Gt, testring);
-                
-        delete omega2;   
+
+        delete omega2;
         delete next_vect;
-        delete altomega; 
-        /*    
-          Print("\n// Leaving the %d-th recursion with %d steps,", nlev,nwalks);
-          Print(" ** Overflow_Error? (%d)", Overflow_Error);
-        */
+        delete altomega;
+        /*
+          Print("\n// Leaving the %d-th recursion with %d steps,", nlev,nwalks);
+          Print(" ** Overflow_Error? (%d)", Overflow_Error);
+        */
         if(Overflow_Error == TRUE)
           nnflow ++;
@@ -4529 +4548 @@
         return(G);
       }
-    }   
-
-    for(i=nV-1; i>=0; i--) { 
+    }
+
+    for(i=nV-1; i>=0; i--) {
       (*altomega)[i] = (*omega)[i];
       (*omega)[i] = (*next_vect)[i];
@@ -4541 +4560 @@
     Gomega = MwalkInitialForm(G, omega);
     xtif=xtif+clock()-to;
-    
+
 #ifndef  BUCHBERGER_ALG
     if(isNolVector(omega) == 0)
@@ -4548 +4567 @@
       hilb_func = hFirstSeries(Gomega,NULL,NULL,last_omega,currRing);
 #endif // BUCHBERGER_ALG
-        
+
     if (currRing->parameter != NULL)
       DefRingPar(omega);
@@ -4555 +4574 @@
 
     Gomega1 = idrMoveR(Gomega, oRing);
-    
-    /* Maximal recursion depth, to compute a red. GB */  
+
+    /* Maximal recursion depth, to compute a red. GB */
     /* Fractal walk with the alternative recursion */
     /* alternative recursion */
@@ -4564 +4583 @@
     {
       /*
-      if(Xnlev != nV) 
-      { 
-        Print("\n// ** Xnlev = %d", Xnlev); 
-        ivString(Xtau, "Xtau"); 
-      } 
+      if(Xnlev != nV)
+      {
+        Print("\n// ** Xnlev = %d", Xnlev);
+        ivString(Xtau, "Xtau");
+      }
       */
       to=clock();
@@ -4575 +4594 @@
 #else
       Gresult =kStd(Gomega1,NULL,isHomog,NULL,hilb_func,0,NULL,omega);
-      delete hilb_func;    
+      delete hilb_func;
 #endif // BUCHBERGER_ALG
       xtstd=xtstd+clock()-to;
-    } 
+    }
     else {
       rChangeCurrRing(oRing);
@@ -4585 +4604 @@
     }
 
-    //convert a Groebner basis from a ring to another ring, 
+    //convert a Groebner basis from a ring to another ring,
     new_ring = currRing;
-    
-    rChangeCurrRing(oRing);  
+
+    rChangeCurrRing(oRing);
     Gresult1 = idrMoveR(Gresult, new_ring);
     Gomega2 = idrMoveR(Gomega1, new_ring);
-        
+
     to=clock();
     /* Lifting process */
     F = MLifttwoIdeal(Gomega2, Gresult1, G);
     xtlift=xtlift+clock()-to;
-    idDelete(&Gresult1);  
-    idDelete(&Gomega2); 
+    idDelete(&Gresult1);
+    idDelete(&Gomega2);
     idDelete(&G);
-    
+
     rChangeCurrRing(new_ring);
     F1 = idrMoveR(F, oRing);
@@ -4608 +4627 @@
     xtred=xtred+clock()-to;
     idDelete(&F1);
-  }  
+  }
 }
 
@@ -4617 +4636 @@
   //Print("// pSetm_Error = (%d)", ErrorCheck());
   //Print("\n// ring ro = %s;", rString(currRing));
-  
+
   nnflow = 0;
   Xngleich = 0;
@@ -4623 +4642 @@
   xtif=0; xtstd=0; xtlift=0; xtred=0; xtnw=0; xtextra=0;
   xftinput = clock();
-  
+
   ring  oldRing = currRing;
   int i, nV = currRing->N;
@@ -4644 +4663 @@
     && (Gw->m[i]->next!=NULL) /* len >=1 */
     && (Gw->m[i]->next->next!=NULL)) /* len >=2 */
-    { 
+    {
       intvec* iv_dp = MivUnit(nV);// define (1,1,...,1)
       intvec* Mdp;
 
       if(MivSame(ivstart, iv_dp) != 1)
-        Mdp = MivWeightOrderdp(ivstart);
-      else 
-        Mdp = MivMatrixOrderdp(nV);
+        Mdp = MivWeightOrderdp(ivstart);
+      else
+        Mdp = MivMatrixOrderdp(nV);
 
       Xsigma = Mfpertvector(I, Mdp);
@@ -4668 +4687 @@
   Xivlp = Mivlp(nV);
 
-  if(MivComp(ivtarget, Xivlp)  != 1) 
+  if(MivComp(ivtarget, Xivlp)  != 1)
   {
     if (currRing->parameter != NULL)
@@ -4698 +4717 @@
   id_Delete(&I, oldRing);
   ring tRing = currRing;
-  
+
   if (currRing->parameter != NULL)
     DefRingPar(ivstart);
@@ -4712 +4731 @@
   ideal resF;
   ring helpRing = currRing;
-  
-  J = rec_fractal_call(J, 1, ivtarget); 
-
-  rChangeCurrRing(oldRing);  
+
+  J = rec_fractal_call(J, 1, ivtarget);
+
+  rChangeCurrRing(oldRing);
   resF = idrMoveR(J, helpRing);
   idSkipZeroes(resF);
@@ -4725 +4744 @@
 
 #ifdef TIME_TEST
-  TimeStringFractal(xftinput, xftostd, xtif, xtstd, xtextra,  
-                    xtlift, xtred, xtnw); 
+  TimeStringFractal(xftinput, xftostd, xtif, xtstd, xtextra,
+                    xtlift, xtred, xtnw);
 
 
@@ -4732 +4751 @@
   Print("\n// Overflow_Error? (%d)\n", Overflow_Error);
   Print("\n// the numbers of Overflow_Error (%d)", nnflow);
-#endif 
- 
+#endif
+
   return(resF);
 }
@@ -4751 +4770 @@
 
   int nsteppert=0, i, nV = currRing->N, nwalk=0, npert_tmp=0;
-  int npert[2*nV];
+  int *npert=(int*)omAlloc(2*nV*sizeof(int));
   ideal Gomega, M,F,  G1, Gomega1, Gomega2, M1, F1;
   ring endRing, newRing, oldRing, lpRing;
@@ -4774 +4793 @@
   for(i=nV-1; i>=0; i--)
     (*target_weight)[i] = (*target_tmp)[i];
-  
+
   ring XXRing = currRing;
   newRing = currRing;
@@ -4796 +4815 @@
 #ifdef REPRESENTATION_OF_SIGMA
   ideal Gw = MwalkInitialForm(G, curr_weight);
-    
+
   if(islengthpoly2(Gw)==1)
   {
     intvec* MDp;
     if(MivComp(curr_weight, iv_dp) == 1)
-      MDp = MatrixOrderdp(nV); //MivWeightOrderlp(iv_dp); 
+      MDp = MatrixOrderdp(nV); //MivWeightOrderlp(iv_dp);
     else
       MDp = MivWeightOrderlp(curr_weight);
-    
+
     curr_weight = RepresentationMatrix_Dp(G, MDp);
 
@@ -4810 +4829 @@
 
     ring exring = currRing;
-  
+
     if (currRing->parameter != NULL)
       DefRingPar(curr_weight);
-    else  
+    else
       VMrDefault(curr_weight);
     to=clock();
     Gw = idrMoveR(G, exring);
-    G = MstdCC(Gw); 
+    G = MstdCC(Gw);
     Gw = NULL;
     tostd=tostd+clock()-to;
@@ -4823 +4842 @@
     goto COMPUTE_NEW_VECTOR;
   }
-    
+
   idDelete(&Gw);
   delete iv_dp;
@@ -4830 +4849 @@
 
   while(1)
-  { 
+  {
     to=clock();
     /* compute an initial form ideal of <G> w.r.t. "curr_vector" */
@@ -4851 +4870 @@
       VMrDefault(curr_weight);
 
-    newRing = currRing; 
-    Gomega1 = idrMoveR(Gomega, oldRing); 
-    
+    newRing = currRing;
+    Gomega1 = idrMoveR(Gomega, oldRing);
+
     to=clock();
     /* compute a reduced Groebner basis of <Gomega> w.r.t. "newRing" */
@@ -4860 +4879 @@
 #else
     M=kStd(Gomega1,NULL,isHomog,NULL,hilb_func,0,NULL,curr_weight);
-    delete hilb_func;    
+    delete hilb_func;
 #endif // BUCHBERGER_ALG
     tstd=tstd+clock()-to;
 
-    /* change the ring to oldRing */ 
+    /* change the ring to oldRing */
     rChangeCurrRing(oldRing);
     M1 =  idrMoveR(M, newRing);
-    Gomega2 =  idrMoveR(Gomega1, newRing); 
+    Gomega2 =  idrMoveR(Gomega1, newRing);
 
     to=clock();
     /* compute a representation of the generators of submod (M)
-       with respect to those of mod (Gomega). 
+       with respect to those of mod (Gomega).
        Gomega is a reduced Groebner basis w.r.t. the current ring */
     F = MLifttwoIdeal(Gomega2, M1, G);
     tlift=tlift+clock()-to;
 
-    idDelete(&M1);   
-    idDelete(&Gomega2);  
+    idDelete(&M1);
+    idDelete(&Gomega2);
     idDelete(&G);
-    
-    /* change the ring to newRing */ 
+
+    /* change the ring to newRing */
     rChangeCurrRing(newRing);
     F1 = idrMoveR(F, oldRing);
 
     to=clock();
-    /* reduce the Groebner basis <G> w.r.t. new ring */   
+    /* reduce the Groebner basis <G> w.r.t. new ring */
     G = kInterRedCC(F1, NULL);
     tred=tred+clock()-to;
     idDelete(&F1);
 
-    
+
   COMPUTE_NEW_VECTOR:
     newRing = currRing;
@@ -4899 +4918 @@
     next_weight = MwalkNextWeightCC(curr_weight,target_weight, G);
     tnw=tnw+clock()-to;
-#ifdef PRINT_VECTORS 
+#ifdef PRINT_VECTORS
     MivString(curr_weight, target_weight, next_weight);
 #endif
 
- 
-    /* check whether the computed intermediate weight vector in 
+
+    /* check whether the computed intermediate weight vector in
        the correct cone is, since sometimes it is very big e.g. s7, cyc7.
-       If it is NOT in the cone, then one has directly to compute 
+       If it is NOT in the cone, then one has directly to compute
        a reduced Groebner basis with respect to the lexicographic ordering
        for the known Groebner basis that it is computed in the last step.
@@ -4942 +4961 @@
       /*apply kStd or LastGB to compute  a lex. red. Groebner basis of <G>*/
       if(nP == 0 || MivSame(target_tmp, iv_lp) == 0){
-        //Print("\n\n// calls \"std in ring r_%d = %s;", nwalk, rString(currRing)); 
+        //Print("\n\n// calls \"std in ring r_%d = %s;", nwalk, rString(currRing));
         G = MstdCC(G1);//no result for qnt1
       }
       else {
-        rChangeCurrRing(newRing);
-        G1 = idrMoveR(G1, lpRing);
-        
-        //Print("\n\n// calls \"LastGB\" (%d) to compute a GB", nV-1);
-        G = LastGB(G1, curr_weight, nV-1); //no result for kats7
-        
-        rChangeCurrRing(lpRing);
-        G = idrMoveR(G, newRing);
+        rChangeCurrRing(newRing);
+        G1 = idrMoveR(G1, lpRing);
+
+        //Print("\n\n// calls \"LastGB\" (%d) to compute a GB", nV-1);
+        G = LastGB(G1, curr_weight, nV-1); //no result for kats7
+
+        rChangeCurrRing(lpRing);
+        G = idrMoveR(G, newRing);
       }
       textra=clock()-to;
@@ -4959 +4978 @@
       npert_tmp = nwalk;
       endwalks ++;
-      break;      
-    }  
-   
-    /* check whether the computed Groebner basis a really Groebner basis is. 
-       if no, we perturb the target vector with the maximal "perturbation" 
+      break;
+    }
+
+    /* check whether the computed Groebner basis a really Groebner basis is.
+       if no, we perturb the target vector with the maximal "perturbation"
        degree.*/
-    if(MivComp(next_weight, target_weight) == 1 || 
+    if(MivComp(next_weight, target_weight) == 1 ||
        MivComp(next_weight, curr_weight) == 1 )
-    { 
+    {
       //Print("\n//ring r_%d = %s;", nwalk, rString(currRing));
 
@@ -4974 +4993 @@
       npert[endwalks]=nwalk-npert_tmp;
       npert_tmp = nwalk;
-      
+
       endwalks ++;
 
-      /*it is very important if the walk only uses one step, e.g. Fate, liu*/ 
+      /*it is very important if the walk only uses one step, e.g. Fate, liu*/
       if(endwalks == 1 && MivComp(next_weight, curr_weight) == 1){
         rChangeCurrRing(XXRing);
@@ -4983 +5002 @@
         goto FINISH;
       }
-      H0 = idHead(G); 
+      H0 = idHead(G);
 
       if(MivSame(target_tmp, iv_lp) == 1)
@@ -4995 +5014 @@
         else
           VMrDefault(target_tmp);
-      
-      lpRing = currRing; 
-      Glp = idrMoveR(G, newRing); 
+
+      lpRing = currRing;
+      Glp = idrMoveR(G, newRing);
       H2 = idrMoveR(H0, newRing);
-      
+
       /* Apply Lemma 2.2 in Collart et. al (1997) to check whether
          cone(k-1) is equal to cone(k) */
@@ -5007 +5026 @@
         poly t;
         if((t=pSub(pHead(Glp->m[i]), pCopy(H2->m[i]))) != NULL)
-        {   
+        {
           pDelete(&t);
           idDelete(&H2);//5.5.02
@@ -5019 +5038 @@
 
       if(nGB == 1)
-      {       
+      {
         G = Glp;
         Glp = NULL;
@@ -5037 +5056 @@
         {
           Overflow_Error = FALSE;
-          
-          for(i=0; i<nV; i++)
-            (*vector_tmp)[i] = (*target_weight)[i];
-
-          delete target_weight;
-          target_weight = MPertVectors(Glp, Mlp, nV);             
-
-          if(MivComp(vector_tmp, target_weight)==1)
-          {
-            //PrintS("\n// The old and new representaion vector are the same!!");
-            G = Glp;
-            newRing = currRing;
-            goto OMEGA_OVERFLOW_TRAN_NEW;
-          }
-
-          if(Overflow_Error == TRUE)
+
+          for(i=0; i<nV; i++)
+            (*vector_tmp)[i] = (*target_weight)[i];
+
+          delete target_weight;
+          target_weight = MPertVectors(Glp, Mlp, nV);
+
+          if(MivComp(vector_tmp, target_weight)==1)
+          {
+            //PrintS("\n// The old and new representaion vector are the same!!");
+            G = Glp;
+            newRing = currRing;
+            goto OMEGA_OVERFLOW_TRAN_NEW;
+           }
+
+          if(Overflow_Error == TRUE)
           {
             rChangeCurrRing(newRing);
             G = idrMoveR(Glp, lpRing);
-            goto OMEGA_OVERFLOW_TRAN_NEW;
+            goto OMEGA_OVERFLOW_TRAN_NEW;
           }
-          
+
           plength3 = TRUE;
           pDelete(&p);
@@ -5072 +5091 @@
         goto TRAN_LIFTING;
       }
-      
+
 
       npertstep = nwalk;
       nwalkpert = 1;
       nsteppert ++;
-      
+
       /*
-      Print("\n// Subroutine needs (%d) steps.", nwalk); 
-      idElements(Glp, "last G in walk:"); 
+      Print("\n// Subroutine needs (%d) steps.", nwalk);
+      idElements(Glp, "last G in walk:");
       PrintS("\n//****************************************");
       Print("\n// Perturb the original target vector (%d): ", nsteppert);
-      ivString(target_weight, "new target"); 
-      PrintS("\n//****************************************\n"); 
+      ivString(target_weight, "new target");
+      PrintS("\n//****************************************\n");
       */
       rChangeCurrRing(newRing);
@@ -5090 +5109 @@
 
       delete next_weight;
-      
+
       //Print("\n// ring rNEW = %s;", rString(currRing));
       goto COMPUTE_NEW_VECTOR;
@@ -5098 +5117 @@
     for(i=nV-1; i>=0; i--)
       (*curr_weight)[i] = (*next_weight)[i];
-    
+
     delete next_weight;
   }//while
@@ -5106 +5125 @@
   G = idrMoveR(G, lpRing);
 
- FINISH: 
+ FINISH:
   delete ivNull;
   delete next_weight;
   delete iv_lp;
+  omFree(npert);
 
 #ifdef TIME_TEST
-  Print("\n// Computation took %d steps and %.2f sec", 
+  Print("\n// Computation took %d steps and %.2f sec",
         nwalk, ((double) (clock()-mtim)/1000000));
 
@@ -5133 +5153 @@
   clock_t tinput=clock();
   int i, nV = currRing->N;
-  int nwalk=0, endwalks=0, ntestwinC=1; 
+  int nwalk=0, endwalks=0, ntestwinC=1;
   int tp_deg_tmp = tp_deg;
   ideal Gomega, M, F, G, M1, F1, Gomega1, Gomega2, G1;
   ring endRing, newRing, oldRing, TargetRing;
   intvec* next_weight;
-  intvec* ivNull = new intvec(nV); 
+  intvec* ivNull = new intvec(nV);
   intvec* extra_curr_weight = new intvec(nV);
 
   ring YXXRing = currRing;
-  
+
   intvec* iv_M_dpp = MivMatrixOrderlp(nV);
   intvec* target_weight;// = Mivlp(nV);
@@ -5170 +5190 @@
     if(Overflow_Error == FALSE)
       break;
-  
+
     Overflow_Error = TRUE;
     tp_deg --;
@@ -5182 +5202 @@
   //  Print("\n// tp_deg = %d", tp_deg);
   // ivString(target_weight, "pert target");
-  
-  delete iv_M_dpp; 
+
+  delete iv_M_dpp;
   intvec* hilb_func;
 
@@ -5196 +5216 @@
 
   while(1)
-  { 
+  {
     nwalk ++;
     nstep ++;
 
-    if(nwalk==1) 
+    if(nwalk==1)
       goto FIRST_STEP;
 
@@ -5231 +5251 @@
       VMrDefault(curr_weight);
 
-    newRing = currRing; 
+    newRing = currRing;
     Gomega1 = idrMoveR(Gomega, oldRing);
-    
-#ifdef ENDWALKS    
-    if(endwalks == 1)   
-    {   
-      Print("\n//  it is  %d-th step!!", nwalk);  
-      idElements(Gomega1, "Gw");  
-      PrintS("\n//  compute a rGB of Gw:");  
-    }  
+
+#ifdef ENDWALKS
+    if(endwalks == 1)
+    {
+      Print("\n//  it is  %d-th step!!", nwalk);
+      idElements(Gomega1, "Gw");
+      PrintS("\n//  compute a rGB of Gw:");
+    }
 #endif
 
@@ -5249 +5269 @@
 #else
     M=kStd(Gomega1,NULL,isHomog,NULL,hilb_func,0,NULL,curr_weight);
-    delete hilb_func;    
+    delete hilb_func;
 #endif // BUCHBERGER_ALG
     xtstd=xtstd+clock()-to;
@@ -5256 +5276 @@
     rChangeCurrRing(oldRing);
     M1 =  idrMoveR(M, newRing);
-    Gomega2 =  idrMoveR(Gomega1, newRing); 
-    to=clock();    
+    Gomega2 =  idrMoveR(Gomega1, newRing);
+    to=clock();
 
     // if(endwalks == 1) PrintS("\n//  Lifting is still working:");
@@ -5266 +5286 @@
     xtlift=xtlift+clock()-to;
 
-    idDelete(&M1);  
-    idDelete(&Gomega2); 
+    idDelete(&M1);
+    idDelete(&Gomega2);
     idDelete(&G);
 
-    /* change the ring to newRing */ 
+    /* change the ring to newRing */
     rChangeCurrRing(newRing);
     F1 = idrMoveR(F, oldRing);
@@ -5278 +5298 @@
     G = kInterRedCC(F1, NULL);
     xtred=xtred+clock()-to;
-    idDelete(&F1); 
+    idDelete(&F1);
 
     if(endwalks == 1)
       break;
-    
+
   FIRST_STEP:
     Overflow_Error=FALSE;
@@ -5289 +5309 @@
     next_weight = MkInterRedNextWeight(curr_weight,target_weight, G);
     xtnw=xtnw+clock()-to;
-#ifdef PRINT_VECTORS 
+#ifdef PRINT_VECTORS
     MivString(curr_weight, target_weight, next_weight);
 #endif
@@ -5297 +5317 @@
       delete next_weight;
 
-      LASTGB_ALT1:  
+      LASTGB_ALT1:
       if(tp_deg > 1){
-        nOverflow_Error = Overflow_Error;
-        tproc = tproc+clock()-tinput;
+        nOverflow_Error = Overflow_Error;
+        tproc = tproc+clock()-tinput;
         /*
-          Print("\n// A subroutine takes %d steps and calls \"Mpwalk\" (1,%d):", 
-          nwalk, tp_deg-1);
-        */
+          Print("\n// A subroutine takes %d steps and calls \"Mpwalk\" (1,%d):",
+          nwalk, tp_deg-1);
+        */
         G1 = Mpwalk_MAltwalk1(G, curr_weight, tp_deg-1);
         goto MPW_Finish;
@@ -5311 +5331 @@
         newRing = currRing;
         ntestwinC = 0;
-        break;  
+        break;
       }
     }
 
     if(MivComp(next_weight, ivNull) == 1)
-    { 
+    {
       newRing = currRing;
       delete next_weight;
@@ -5345 +5365 @@
   {
     PrintS("\n// The perturbed target vector doesn't STAY in the correct cone!!");
-    if(tp_deg == 1){ 
+    if(tp_deg == 1){
       //Print("\n// subroutine takes %d steps and applys \"std\"", nwalk);
       to=clock();
@@ -5358 +5378 @@
       tproc = tproc+clock()-tinput;
       /*
-        Print("\n// B subroutine takes %d steps and calls \"Mpwalk\" (1,%d) :", 
-            nwalk,  tp_deg-1);
+        Print("\n// B subroutine takes %d steps and calls \"Mpwalk\" (1,%d) :",
+            nwalk,  tp_deg-1);
       */
       G1 = Mpwalk_MAltwalk1(G1, curr_weight, tp_deg-1);
     }
-  }    
+  }
 
  MPW_Finish:
@@ -5369 +5389 @@
   rChangeCurrRing(YXXRing);
   ideal result = idrMoveR(G1, newRing);
-    
+
   delete ivNull;
   delete target_weight;
@@ -5375 +5395 @@
   /*
   Print("\n// \"Mpwalk\" (1,%d) took %d steps and %.2f sec. Overflow_Error (%d)", tp_deg,
-        nwalk, ((double) clock()-tinput)/1000000, nOverflow_Error);
+        nwalk, ((double) clock()-tinput)/1000000, nOverflow_Error);
   */
 
@@ -5397 +5417 @@
   int i, nV = currRing->N;
   int nwalk=0, endwalks=0;
-  int op_tmp = op_deg;  
+  int op_tmp = op_deg;
   ideal Gomega, M, F, G, G1, Gomega1, Gomega2, M1, F1;
   ring endRing, newRing, oldRing, TargetRing;
   intvec* next_weight;
   intvec* iv_M_dp;
-  intvec* ivNull = new intvec(nV); 
+  intvec* ivNull = new intvec(nV);
   intvec* iv_dp = MivUnit(nV);// define (1,1,...,1)
   intvec* exivlp = Mivlp(nV);
@@ -5415 +5435 @@
     (*last_omega)[i] = 1;
   (*last_omega)[0] = 10000;
-  
+
   ring XXRing = currRing;
-  
+
   to=clock();
   /* compute a pertubed weight vector of the original weight vector.
      The perturbation degree is recursive decrease until that vector
      stays inn the correct cone. */
-  while(1) 
+  while(1)
   {
     if(Overflow_Error == FALSE)
@@ -5441 +5461 @@
         else
           VMrDefault(cw_tmp);
-        
+
         G = idrMoveR(Go, XXRing);
         G = MstdCC(G);
@@ -5457 +5477 @@
     if(Overflow_Error == FALSE)
       break;
-    
+
     Overflow_Error = TRUE;
     op_deg --;
@@ -5471 +5491 @@
 
   while(1)
-  { 
+  {
     nwalk ++;
     nstep ++;
@@ -5485 +5505 @@
         (*curr_weight)[i] = (*extra_curr_weight)[i];
       delete extra_curr_weight;
-      
+
       newRing = currRing;
       goto MSTD_ALT1;
@@ -5505 +5525 @@
       VMrDefault(curr_weight);
 
-    newRing = currRing; 
-    Gomega1 = idrMoveR(Gomega, oldRing); 
-    
+    newRing = currRing;
+    Gomega1 = idrMoveR(Gomega, oldRing);
+
     to=clock();
     /* compute a reduced Groebner basis of <Gomega> w.r.t. "newRing" */
@@ -5514 +5534 @@
 #else
     M=kStd(Gomega1,NULL,isHomog,NULL,hilb_func,0,NULL,curr_weight);
-    delete hilb_func;    
+    delete hilb_func;
 #endif // BUCHBERGER_ALG
     xtstd=xtstd+clock()-to;
 
-    /* change the ring to oldRing */ 
+    /* change the ring to oldRing */
     rChangeCurrRing(oldRing);
     M1 =  idrMoveR(M, newRing);
@@ -5529 +5549 @@
     xtlift=xtlift+clock()-to;
 
-    idDelete(&M1);  
-    idDelete(&Gomega2); 
-    idDelete(&G);    
-
-   /* change the ring to newRing */ 
+    idDelete(&M1);
+    idDelete(&Gomega2);
+    idDelete(&G);
+
+   /* change the ring to newRing */
     rChangeCurrRing(newRing);
     F1 = idrMoveR(F, oldRing);
 
     to=clock();
-    /* reduce the Groebner basis <G> w.r.t. new ring */   
+    /* reduce the Groebner basis <G> w.r.t. new ring */
     G = kInterRedCC(F1, NULL);
     xtred=xtred+clock()-to;
@@ -5551 +5571 @@
     next_weight = MkInterRedNextWeight(curr_weight,target_weight, G);
     xtnw=xtnw+clock()-to;
-#ifdef PRINT_VECTORS 
+#ifdef PRINT_VECTORS
     MivString(curr_weight, target_weight, next_weight);
 #endif
-    
+
     if(Overflow_Error == TRUE)
     {
       newRing = currRing;
-      
+
       if (currRing->parameter != NULL)
         DefRingPar(target_weight);
@@ -5564 +5584 @@
         VMrDefault(target_weight);
 
-      F1 = idrMoveR(G, newRing); 
+      F1 = idrMoveR(G, newRing);
       G = MstdCC(F1);
       idDelete(&F1);
@@ -5587 +5607 @@
       {
         MSTD_ALT1:
-        nOverflow_Error = Overflow_Error;
-        tproc = clock()-xftinput;
-        /*
-        Print("\n//  main routine takes %d steps and calls \"Mpwalk\" (1,%d):", 
-              nwalk,  tp_deg); 
-        */
-        // compute the red. GB of <G> w.r.t. the lex order by
-        // the "recursive-modified" perturbation walk alg (1,tp_deg) 
+        nOverflow_Error = Overflow_Error;
+        tproc = clock()-xftinput;
+        /*
+        Print("\n//  main routine takes %d steps and calls \"Mpwalk\" (1,%d):",
+              nwalk,  tp_deg);
+        */
+        // compute the red. GB of <G> w.r.t. the lex order by
+        // the "recursive-modified" perturbation walk alg (1,tp_deg)
         G = Mpwalk_MAltwalk1(G, curr_weight, tp_deg);
         delete next_weight;
@@ -5621 +5641 @@
 #ifdef TIME_TEST
 
-  Print("\n// \"Main procedure\"  took %d steps, %.2f sec. and Overflow_Error(%d)", 
-        nwalk, ((double) tproc)/1000000, nOverflow_Error);
+  Print("\n// \"Main procedure\"  took %d steps, %.2f sec. and Overflow_Error(%d)",
+        nwalk, ((double) tproc)/1000000, nOverflow_Error);
 
   TimeStringFractal(xftinput, tostd, xtif, xtstd,xtextra, xtlift, xtred, xtnw);
@@ -5629 +5649 @@
   Print("\n// Overflow_Error? (%d)", Overflow_Error);
   Print("\n// Awalk1 took %d steps.\n", nstep);
-#endif  
+#endif
   return(result);
 }