isl_pw_qpolynomial_intersect_domain: simplify polynomials using equalities

[platform/upstream/isl.git] / polyhedron_minimize.c

diff --git a/polyhedron_minimize.c b/polyhedron_minimize.c
index fbd0e1a..53a35d5 100644 (file)
--- a/polyhedron_minimize.c
+++ b/polyhedron_minimize.c
@@ -1,3 +1,12 @@
+/*
+ * Copyright 2008-2009 Katholieke Universiteit Leuven
+ *
+ * Use of this software is governed by the GNU LGPLv2.1 license
+ *
+ * Written by Sven Verdoolaege, K.U.Leuven, Departement
+ * Computerwetenschappen, Celestijnenlaan 200A, B-3001 Leuven, Belgium
+ */
+
 #include <assert.h>
 #include "isl_set.h"
 #include "isl_vec.h"
@@ -55,7 +64,7 @@ int main(int argc, char **argv)
        enum isl_lp_result res;
 
        isl_int_init(opt);
-       bset = isl_basic_set_read_from_file(ctx, stdin, 0, ISL_FORMAT_POLYLIB);
+       bset = isl_basic_set_read_from_file(ctx, stdin, 0);
        assert(bset);
        obj = isl_vec_read_from_file(ctx, stdin, ISL_FORMAT_POLYLIB);
        assert(obj);
@@ -66,8 +75,10 @@ int main(int argc, char **argv)
        else
                obj = vec_ror(obj);
        res = isl_basic_set_solve_ilp(bset, 0, obj->el, &opt, &sol);
-       assert(res != isl_lp_error);
        switch (res) {
+       case isl_lp_error:
+               fprintf(stderr, "error\n");
+               return -1;
        case isl_lp_empty:
                fprintf(stdout, "empty\n");
                break;