/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) /\ (arg2 > ~(1)), par{arg1 -> arg2, arg2 -> undef2, arg3 -> undef3}> arg1, arg3 -> arg1}> (arg1 + 1), arg2 -> undef8, arg3 -> undef9}> 0) /\ (arg2 = arg3), par{arg2 -> (arg2 + 1), arg3 -> (arg2 + 1)}> undef13, arg2 -> undef14, arg3 -> undef15}> Fresh variables: undef2, undef3, undef8, undef9, undef13, undef14, undef15, Undef variables: undef2, undef3, undef8, undef9, undef13, undef14, undef15, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: 0) /\ (undef14 > ~(1)) /\ (undef14 < 10)> (arg1 + 1), arg2 -> (arg1 + 1), arg3 -> (arg1 + 1)}> 0) /\ (arg2 = arg3), par{arg2 -> (arg2 + 1), arg3 -> (arg2 + 1)}> Fresh variables: undef2, undef3, undef8, undef9, undef13, undef14, undef15, Undef variables: undef2, undef3, undef8, undef9, undef13, undef14, undef15, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: 1 + arg1, arg2 -> 1 + arg1, arg3 -> 1 + arg1, rest remain the same}> 1 + arg2, arg3 -> 1 + arg2, rest remain the same}> Variables: arg1, arg2, arg3 Precedence: Graph 0 Graph 1 Map Locations to Subgraph: ( 0 , 0 ) ( 3 , 1 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.005136 Checking conditional termination of SCC {l3}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001359s Ranking function: 8 - arg1 New Graphs: Transitions: 1 + arg2, arg3 -> 1 + arg2, rest remain the same}> Variables: arg2, arg3 Checking conditional termination of SCC {l3}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000506s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001709s [53520 : 53521] [53520 : 53522] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.014094s Time used: 0.013648 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000492s Time used: 1.00044 LOG: SAT solveNonLinear - Elapsed time: 1.014586s Cost: 1; Total time: 1.01409 Termination implied by a set of invariant(s): Invariant at l3: 0 <= arg1 + arg2 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + arg1, arg2 -> 1 + arg1, arg3 -> 1 + arg1, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + arg2, arg3 -> 1 + arg2, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + arg2, arg3 -> 1 + arg2, rest remain the same}> Quasi-ranking function: 50000 - arg2 New Graphs: Transitions: 1 + arg2, arg3 -> 1 + arg2, rest remain the same}> Variables: arg2, arg3 Checking conditional termination of SCC {l3}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000612s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002286s [53520 : 53529] [53520 : 53530] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.013895s Time used: 0.013363 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.003689s Time used: 1.00362 LOG: SAT solveNonLinear - Elapsed time: 1.017584s Cost: 1; Total time: 1.01699 Termination implied by a set of invariant(s): Invariant at l3: arg2 <= arg3 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + arg1, arg2 -> 1 + arg1, arg3 -> 1 + arg1, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + arg2, arg3 -> 1 + arg2, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + arg2, arg3 -> 1 + arg2, rest remain the same}> Quasi-ranking function: 50000 - arg3 New Graphs: Transitions: 1 + arg2, arg3 -> 1 + arg2, rest remain the same}> Variables: arg2, arg3 Checking conditional termination of SCC {l3}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000683s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002587s [53520 : 53534] [53520 : 53535] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.100989s Time used: 4.10002 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.015514s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.015664s Cannot prove unreachability [53520 : 53539] [53520 : 53543] Successful child: 53539 Program does NOT terminate