#9127: BSD.py doctest failure due to timeout of Heegner index computation.
-------------------------------+--------------------------------------------
Reporter: drkirkby | Owner: cremona
Type: defect | Status: new
Priority: blocker | Milestone: sage-4.4.3
Component: elliptic curves | Keywords:
Author: | Upstream: N/A
Reviewer: | Merged:
Work_issues: |
-------------------------------+--------------------------------------------
This failure seems remarkably close to #8749, which is closed as fixed,
but this is the same sort of problem on the same doctest. Note, changing
SAGE_TIMOUT will not change this, as it appears (to me at least), Sage is
switching from one algorithm to another in a time which is independent of
the processor speed or settings of any timeout variables.
== Hardware & associated software ==
* Sun Blade 1000
* 2 x 900 MHz UltraSPARC III+ CPUs
* 2 GB RAM
* Solaris 10 03/2005 (first release of Solaris 10)
* gcc 4.4.3 (uses Sun linker and assembler)
== Sage version ==
* 4.4.3.alpha0 and 4.4.3.alpha1
== The test failure ==
A full log of all tests can be found at
http://boxen.math.washington.edu/home/kirkby/sage-4.4.3.alpha0-Sun-
Blade-1000-900MHz-Solaris-10-ptestlong.log.gz
(There are 3 failures, but I believe the other two are common to more than
one platform and work is progressing on them)
I would expect to see this fail the same way on 't2' as 't2' is slower on
single threaded tasks than the Blade 1000.
{{{
sage -t -long devel/sage/sage/schemes/elliptic_curves/BSD.py
**********************************************************************
File "/export/home/drkirkby/sage-4.4.3.alpha1/devel/sage-
main/sage/schemes/elliptic_curves/BSD.py", line 377:
sage: E.prove_BSD(verbosity=2) # long time
Expected:
p = 2: True by 2-descent...
True for p not in {2, 3} by Kolyvagin.
ALERT: p = 3 left in Kolyvagin bound
0 <= ord_p(#Sha) <= 2
ord_p(#Sha_an) = 2
Remaining primes:
p = 3: irreducible, surjective, non-split multiplicative
(0 <= ord_p <= 2)
[3]
Got:
p = 2: True by 2-descent
Timeout stopped Heegner index computation...
Proceeding to use heegner_index_bound instead.
True for p not in {2, 3} by Kolyvagin.
p = 3 may divide the Heegner index, for which only a bound was
computed.
ALERT: p = 3 left in Kolyvagin bound
0 <= ord_p(#Sha) <= 2
ord_p(#Sha_an) = 2
Remaining primes:
p = 3: irreducible, surjective, non-split multiplicative
(0 <= ord_p <= 2)
[3]
**********************************************************************
1 items had failures:
1 of 35 in __main__.example_6
***Test Failed*** 1 failures.
For whitespace errors, see the file
/export/home/drkirkby/.sage//tmp/.doctest_BSD.py
[132.1 s]
}}}
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/9127>
Sage <http://www.sagemath.org>
Sage: Creating a Viable Open Source Alternative to Magma, Maple, Mathematica,
and MATLAB
--
You received this message because you are subscribed to the Google Groups
"sage-trac" group.
To post to this group, send email to [email protected].
To unsubscribe from this group, send email to
[email protected].
For more options, visit this group at
http://groups.google.com/group/sage-trac?hl=en.
