/export/starexec/sandbox2/solver/bin/starexec_run_termcomp17 /export/starexec/sandbox2/benchmark/theBenchmark.smt2 /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- NO Solver Timeout: 4 Global Timeout: 300 Maximum number of concurrent processes: 900 No parsing errors! Init Location: 0 Transitions: undef8, y_6^0 -> undef9}> undef10, lt_8^0 -> undef15, lt_9^0 -> undef16}> (0 + cnt_15^0), lt_9^0 -> (0 + cnt_20^0)}> undef31}> undef43, lt_8^0 -> undef44, lt_9^0 -> undef45}> Fresh variables: undef8, undef9, undef10, undef15, undef16, undef19, undef20, undef31, undef43, undef44, undef45, undef48, Undef variables: undef8, undef9, undef10, undef15, undef16, undef19, undef20, undef31, undef43, undef44, undef45, undef48, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: undef31}> Fresh variables: undef8, undef9, undef10, undef15, undef16, undef19, undef20, undef31, undef43, undef44, undef45, undef48, Undef variables: undef8, undef9, undef10, undef15, undef16, undef19, undef20, undef31, undef43, undef44, undef45, undef48, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: undef31, rest remain the same}> Variables: __disjvr_0^0, cnt_15^0 Graph 2: Transitions: Variables: Precedence: Graph 0 Graph 1 Graph 2 Map Locations to Subgraph: ( 0 , 0 ) ( 2 , 1 ) ( 3 , 2 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.001792 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000523s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001652s [36450 : 36451] [36450 : 36452] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.004894s Time used: 0.004609 Termination failed. Trying to show unreachability... Proving unreachability of entry: LOG: CALL check - Post:1 <= 0 - Process 1 * Exit transition: * Postcondition : 1 <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000459s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000529s Cannot prove unreachability [36450 : 36456] [36450 : 36457] Successful child: 36456 Program does NOT terminate