Hi,

here I attach the 'problematic' polyhedron. This is the dump, when the PPL polyhedron (represented as constraints system) is represented in Polylib format. (thus the first column says if it is equality (=) (value 0) or greater than or equal (>=) (value 1)). The last column is the constant term (inhomogeneous part in the PPL terminology). There are 20 columns, thus 20-2=18 variables.

I try to call 'contains_integer_point' on this polyhedron. The polyhedron is NNC polyhedron (though I can use Closed polyhedron as well, I will try that).

I also attach the PPL ASCII dump. (I use the Pointset_Poweset of the NNC Polyhedra, but this Pointset just contains one Polyhedron thus I think it should be equivalent to NNC_Polyhedron dump).

Thank You, Konrad

2009/7/9 Roberto Bagnara bagnara@cs.unipr.it:

Michael Classen wrote:

...

On Wed, Jul 8, 2009 at 3:32 AM, Konrad Trifunovickonrad.trifunovic@gmail.com wrote:

...

I tried to reduce the size of the iteration domains and size of the matrices (in the original block-1.c). It seems that PPL is not able to deal with efficiently with big constants...

Hi Konrad,

I don't understand.  What do you mean by "PPL is not able to deal with efficiently with big constants"?  How can we reproduce your observations? All the best,

Roberto

-- Prof. Roberto Bagnara Computer Science Group Department of Mathematics, University of Parma, Italy http://www.cs.unipr.it/~bagnara/ mailto:bagnara@cs.unipr.it

--~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "GCC GRAPHITE" group. To post to this group, send email to gcc-graphite@googlegroups.com To unsubscribe from this group, send email to gcc-graphite+unsubscribe@googlegroups.com For more options, visit this group at http://groups.google.de/group/gcc-graphite?hl=en -~----------~----~----~----~------~----~------~--~---