/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)) /\ (arg2 > ~(1)) /\ (2 > (~(1) * arg2)) /\ (1 > (~(1) * arg2)) /\ (arg1 > 0), par{arg1 -> ((~(1) * arg2) - 1), arg2 -> ((~(1) * arg2) - 2)}> arg2, arg2 -> (arg2 - 1)}> undef5, arg2 -> undef6}> Fresh variables: undef5, undef6, Undef variables: undef5, undef6, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: = (~(1) * undef6)) /\ (undef6 > ~(1)) /\ (2 > (~(1) * undef6)) /\ (1 > (~(1) * undef6)) /\ (undef5 > 0)> arg2, arg2 -> (arg2 - 1)}> Fresh variables: undef5, undef6, Undef variables: undef5, undef6, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: arg2, 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.002442 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000645s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002070s [34985 : 34986] [34985 : 34987] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.007806s Time used: 0.007423 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.021902s Time used: 0.021898 LOG: SAT solveNonLinear - Elapsed time: 0.029708s Cost: 1; Total time: 0.029321 Termination implied by a set of invariant(s): Invariant at l2: arg1 <= 1 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): arg2, 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): arg2, arg2 -> -1 + arg2, rest remain the same}> Quasi-ranking function: 50000 + arg1 New Graphs: Transitions: arg2, 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.000610s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002430s [34985 : 34991] [34985 : 34992] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009084s Time used: 0.008657 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.023682s Time used: 0.023678 LOG: SAT solveNonLinear - Elapsed time: 0.032766s Cost: 1; Total time: 0.032335 Termination implied by a set of invariant(s): Invariant at l2: 1 + arg1 + arg2 <= 0 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): arg2, 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): arg2, arg2 -> -1 + arg2, rest remain the same}> Quasi-ranking function: 50000 + arg1 + arg2 New Graphs: Transitions: arg2, 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.000768s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003183s [34985 : 35092] [34985 : 35093] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009867s Time used: 0.009441 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.022902s Time used: 0.022899 LOG: SAT solveNonLinear - Elapsed time: 0.032770s Cost: 1; Total time: 0.03234 Termination implied by a set of invariant(s): Invariant at l2: arg2 <= 1 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): arg2, 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): arg2, arg2 -> -1 + arg2, rest remain the same}> Quasi-ranking function: 50000 + 2*arg1 - arg2 New Graphs: Transitions: arg2, 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.000887s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.004005s [34985 : 35107] [34985 : 35108] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.010520s Time used: 0.010045 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.021842s Time used: 0.021837 LOG: SAT solveNonLinear - Elapsed time: 0.032362s Cost: 1; Total time: 0.031882 Termination implied by a set of invariant(s): Invariant at l2: 1 + arg1 <= 0 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): arg2, 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): arg2, arg2 -> -1 + arg2, rest remain the same}> Quasi-ranking function: 50000 + arg2 New Graphs: Transitions: arg2, 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.000831s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003531s [34985 : 35138] [34985 : 35139] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.011850s Time used: 0.011366 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.020236s Time used: 0.020232 LOG: SAT solveNonLinear - Elapsed time: 0.032086s Cost: 1; Total time: 0.031598 Termination implied by a set of invariant(s): Invariant at l2: arg1 <= 1 + arg2 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): arg2, 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): arg2, arg2 -> -1 + arg2, rest remain the same}> Quasi-ranking function: 50000 - arg1 + 2*arg2 New Graphs: Transitions: arg2, 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.000847s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003198s [34985 : 35147] [34985 : 35148] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.012002s Time used: 0.011613 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.000880s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000981s Cannot prove unreachability [34985 : 35163] [34985 : 35167] Successful child: 35163 Program does NOT terminate