/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: ~(1)) /\ (arg2 > 1) /\ (undef1 > ~(1)) /\ (arg1 > 0), par{arg1 -> undef1, arg2 -> undef2}> arg1) /\ (arg1 > ~(1)), par{arg1 -> (arg1 + 4)}> ~(1)) /\ (arg2 > ~(1)), par{arg1 -> (arg1 + 2), arg2 -> (arg2 + 1)}> undef7, arg2 -> undef8}> Fresh variables: undef1, undef2, undef7, undef8, Undef variables: undef1, undef2, undef7, undef8, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: ~(1)) /\ (undef8 > 1) /\ (undef1 > ~(1)) /\ (undef7 > 0)> arg1) /\ (arg1 > ~(1)), par{arg1 -> (arg1 + 4)}> ~(1)) /\ (arg2 > ~(1)), par{arg1 -> (arg1 + 2), arg2 -> (arg2 + 1)}> Fresh variables: undef1, undef2, undef7, undef8, Undef variables: undef1, undef2, undef7, undef8, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: 4 + arg1, rest remain the same}> 2 + arg1, arg2 -> 1 + arg2, rest remain the same}> Variables: arg1, arg2 Precedence: Graph 0 Graph 1 Map Locations to Subgraph: ( 0 , 0 ) ( 2 , 1 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.004491 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001186s Ranking function: -arg1 + arg2 New Graphs: Transitions: 2 + arg1, arg2 -> 1 + arg2, rest remain the same}> Variables: arg1, arg2 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000545s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001856s [21368 : 21369] [21368 : 21370] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.011324s Time used: 0.010875 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.022428s Time used: 0.022422 LOG: SAT solveNonLinear - Elapsed time: 0.033751s Cost: 1; Total time: 0.033297 Termination implied by a set of invariant(s): Invariant at l2: 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): 4 + arg1, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 2 + arg1, arg2 -> 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): 2 + arg1, arg2 -> 1 + arg2, rest remain the same}> Quasi-ranking function: 50000 - arg1 New Graphs: Transitions: 2 + arg1, arg2 -> 1 + arg2, rest remain the same}> Variables: arg1, arg2 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000647s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002610s [21368 : 21374] [21368 : 21375] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.011592s Time used: 0.01116 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.038900s Time used: 0.038894 LOG: SAT solveNonLinear - Elapsed time: 0.050492s Cost: 1; Total time: 0.050054 Termination implied by a set of invariant(s): Invariant at l2: 0 <= arg2 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 4 + arg1, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 2 + arg1, arg2 -> 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): 2 + arg1, arg2 -> 1 + arg2, rest remain the same}> Quasi-ranking function: 50000 - arg2 New Graphs: Transitions: 2 + arg1, arg2 -> 1 + arg2, rest remain the same}> Variables: arg1, arg2 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000686s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003256s [21368 : 21390] [21368 : 21391] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.012260s Time used: 0.011738 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.044237s Time used: 0.044231 LOG: SAT solveNonLinear - Elapsed time: 0.056496s Cost: 1; Total time: 0.055969 Quasi-ranking function: 50000 - 2*arg1 + 2*arg2 New Graphs: Transitions: 2 + arg1, arg2 -> 1 + arg2, rest remain the same}> Variables: arg1, arg2 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000723s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.004117s [21368 : 21395] [21368 : 21396] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.012877s Time used: 0.012323 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.031058s Time used: 0.031053 LOG: SAT solveNonLinear - Elapsed time: 0.043935s Cost: 1; Total time: 0.043376 Termination implied by a set of invariant(s): Invariant at l2: 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): 4 + arg1, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 2 + arg1, arg2 -> 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): 2 + arg1, arg2 -> 1 + arg2, rest remain the same}> Quasi-ranking function: 50000 + arg1 - 3*arg2 New Graphs: Transitions: 2 + arg1, arg2 -> 1 + arg2, rest remain the same}> Variables: arg1, arg2 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000805s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.004725s [21368 : 21400] [21368 : 21401] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.012482s Time used: 0.011919 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.031513s Time used: 0.031508 LOG: SAT solveNonLinear - Elapsed time: 0.043995s Cost: 1; Total time: 0.043427 Quasi-ranking function: 50000 - arg1 - arg2 New Graphs: Transitions: 2 + arg1, arg2 -> 1 + arg2, rest remain the same}> Variables: arg1, arg2 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000841s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.004064s [21368 : 21405] [21368 : 21406] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.014042s Time used: 0.013581 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.001277s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.001389s Cannot prove unreachability [21368 : 21410] [21368 : 21414] Successful child: 21410 Program does NOT terminate