/export/starexec/sandbox/solver/bin/starexec_run_termcomp17 /export/starexec/sandbox/benchmark/theBenchmark.smt2 /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- NO Solver Timeout: 4 Global Timeout: 300 Maximum number of concurrent processes: 900 No parsing errors! Init Location: 0 Transitions: 0}> (0 + ret_prime36^0)}> 1}> 0}> (2 + i24^0)}> undef362}> (0 + n23^0), n1133^0 -> (0 + i24^0), ret_divides1335^0 -> undef390, tmp___026^0 -> (0 + undef390)}> undef430}> 3}> (0 + undef557), n23^0 -> undef553, n3729^0 -> 2, n527^0 -> undef557, ret_divides5931^0 -> undef562, ret_even1032^0 -> undef564, tmp25^0 -> (0 + undef564), tmp628^0 -> undef570}> (0 + ret_prime22^0)}> 1}> 0}> (2 + i10^0)}> undef905}> (0 + n9^0), n1119^0 -> (0 + i10^0), ret_divides1321^0 -> undef933, tmp___012^0 -> (0 + undef933)}> undef973}> 3}> (0 + undef1134), n3715^0 -> 2, n513^0 -> undef1134, n9^0 -> undef1136, ret_divides5917^0 -> undef1139, ret_even1018^0 -> undef1141, tmp11^0 -> (0 + undef1141), tmp614^0 -> undef1147, tmp8^0 -> undef1149, x_promoted_1^0 -> undef1155, y_promoted_2^0 -> 513239}> Fresh variables: undef362, undef390, undef430, undef553, undef557, undef562, undef564, undef570, undef905, undef933, undef973, undef1134, undef1136, undef1139, undef1141, undef1147, undef1149, undef1155, Undef variables: undef362, undef390, undef430, undef553, undef557, undef562, undef564, undef570, undef905, undef933, undef973, undef1134, undef1136, undef1139, undef1141, undef1147, undef1149, undef1155, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: 3}> undef553, tmp25^0 -> (0 + undef564)}> undef553, tmp25^0 -> (0 + undef564)}> undef553, tmp25^0 -> (0 + undef564)}> undef553, tmp25^0 -> (0 + undef564)}> (2 + i24^0)}> 3}> undef553, tmp25^0 -> (0 + undef564)}> undef553, tmp25^0 -> (0 + undef564)}> (2 + i10^0)}> Fresh variables: undef362, undef390, undef430, undef553, undef557, undef562, undef564, undef570, undef905, undef933, undef973, undef1134, undef1136, undef1139, undef1141, undef1147, undef1149, undef1155, Undef variables: undef362, undef390, undef430, undef553, undef557, undef562, undef564, undef570, undef905, undef933, undef973, undef1134, undef1136, undef1139, undef1141, undef1147, undef1149, undef1155, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: 2 + i10^0, rest remain the same}> Variables: i10^0 Graph 2: Transitions: Variables: Graph 3: Transitions: 2 + i24^0, rest remain the same}> Variables: i24^0 Graph 4: Transitions: Variables: Precedence: Graph 0 Graph 1 3, rest remain the same}> Graph 2 undef553, tmp25^0 -> undef564, rest remain the same}> undef553, tmp25^0 -> undef564, rest remain the same}> undef553, tmp25^0 -> undef564, rest remain the same}> undef553, tmp25^0 -> undef564, rest remain the same}> undef553, tmp25^0 -> undef564, rest remain the same}> undef553, tmp25^0 -> undef564, rest remain the same}> Graph 3 3, rest remain the same}> Graph 4 Map Locations to Subgraph: ( 0 , 0 ) ( 2 , 4 ) ( 8 , 3 ) ( 11 , 2 ) ( 17 , 1 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.001937 Checking conditional termination of SCC {l17}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000645s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001180s [49647 : 49648] [49647 : 49649] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006227s Time used: 0.00594 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000729s Time used: 1.00067 LOG: SAT solveNonLinear - Elapsed time: 1.006956s Cost: 1; Total time: 1.00661 Quasi-ranking function: 50000 - i10^0 New Graphs: Transitions: 2 + i10^0, rest remain the same}> Variables: i10^0 Checking conditional termination of SCC {l17}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000506s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001649s [49647 : 49653] [49647 : 49654] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.103522s Time used: 4.10111 Termination failed. Trying to show unreachability... Proving unreachability of entry: 3, rest remain the same}> LOG: CALL check - Post:1 <= 0 - Process 1 * Exit transition: 3, rest remain the same}> * Postcondition : 1 <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.006382s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.006542s Cannot prove unreachability [49647 : 49797] [49647 : 49798] Successful child: 49797 Program does NOT terminate