Re: troubleshooting with bnfcertify under Linux/x86-64

[Igor Schein <igor@txc.com>]

On Mon, Mar 14, 2005 at 02:32:18AM +0000, Philippe Elbaz-Vincent wrote:
> Hi,
> 
> 
> I have the following 'behavior'
> 
>                    GP/PARI CALCULATOR Version 2.2.10 (development CHANGES-1.1175)
>                          amd64 running linux (x86-64 kernel) 64-bit version
>                                 compiled: Mar 14 2005, gcc-gcc 3.3.5
>                           (readline v4.3 enabled, extended help available)
> 
>                                   Copyright (C) 2003 The PARI Group
> 
> PARI/GP is free software, covered by the GNU General Public License, and
> comes WITHOUT ANY
> WARRANTY WHATSOEVER.
> 
> Type ? for help, \q to quit.
> Type ?12 for how to get moral (and possibly technical) support.
> 
> parisize = 300000000, primelimit = 1000000
> gp > K=bnfinit(T^8 + T^6 + 6*T^4 - 4*T^2 + 1,1);
> time = 39 ms.
> gp > bnfcertify(K)
> zsh: 14145 segmentation fault  /usr/local/devel/bin/gp

Infinite loop in sqrtispec().  The problem goes away if you build
--with-gmp ( faster anyway ).

Igor