/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)}> undef384}> (0 + n23^0), n1133^0 -> (0 + i24^0), ret_divides1335^0 -> undef414, tmp___026^0 -> (0 + undef414)}> undef456}> 3}> (0 + undef591), n23^0 -> undef587, n3729^0 -> 2, n527^0 -> undef591, ret_divides5931^0 -> undef596, ret_even1032^0 -> undef598, tmp25^0 -> (0 + undef598), tmp628^0 -> undef604}> (0 + ret_prime22^0)}> 1}> 0}> (2 + i10^0)}> undef959}> (0 + n9^0), n1119^0 -> (0 + i10^0), ret_divides1321^0 -> undef989, tmp___012^0 -> (0 + undef989)}> undef1031}> 3}> (0 + undef1202), n3715^0 -> 2, n513^0 -> undef1202, n9^0 -> undef1204, ret_divides5917^0 -> undef1207, ret_even1018^0 -> undef1209, tmp11^0 -> (0 + undef1209), tmp614^0 -> undef1215, tmp8^0 -> undef1217, x_promoted_1^0 -> undef1223, y_promoted_2^0 -> (0 + __const_513239^0)}> Fresh variables: undef384, undef414, undef456, undef587, undef591, undef596, undef598, undef604, undef959, undef989, undef1031, undef1202, undef1204, undef1207, undef1209, undef1215, undef1217, undef1223, Undef variables: undef384, undef414, undef456, undef587, undef591, undef596, undef598, undef604, undef959, undef989, undef1031, undef1202, undef1204, undef1207, undef1209, undef1215, undef1217, undef1223, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: 3}> undef587, tmp25^0 -> (0 + undef598)}> undef587, tmp25^0 -> (0 + undef598)}> undef587, tmp25^0 -> (0 + undef598)}> undef587, tmp25^0 -> (0 + undef598)}> (2 + i24^0)}> 3}> undef587, tmp25^0 -> (0 + undef598)}> undef587, tmp25^0 -> (0 + undef598)}> (2 + i10^0)}> Fresh variables: undef384, undef414, undef456, undef587, undef591, undef596, undef598, undef604, undef959, undef989, undef1031, undef1202, undef1204, undef1207, undef1209, undef1215, undef1217, undef1223, Undef variables: undef384, undef414, undef456, undef587, undef591, undef596, undef598, undef604, undef959, undef989, undef1031, undef1202, undef1204, undef1207, undef1209, undef1215, undef1217, undef1223, 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 undef587, tmp25^0 -> undef598, rest remain the same}> undef587, tmp25^0 -> undef598, rest remain the same}> undef587, tmp25^0 -> undef598, rest remain the same}> undef587, tmp25^0 -> undef598, rest remain the same}> undef587, tmp25^0 -> undef598, rest remain the same}> undef587, tmp25^0 -> undef598, 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.001894 Checking conditional termination of SCC {l17}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000654s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001188s [45647 : 45648] [45647 : 45649] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006486s Time used: 0.006201 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.001416s Time used: 1.00137 LOG: SAT solveNonLinear - Elapsed time: 1.007902s Cost: 1; Total time: 1.00757 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.000501s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001662s [45647 : 45688] [45647 : 45689] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.101765s Time used: 4.10129 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.006256s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.006411s Cannot prove unreachability [45647 : 45693] [45647 : 45694] Successful child: 45693 Program does NOT terminate