NO Solver Timeout: 4 Global Timeout: 60 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.002649 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000655s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002126s Trying to remove transition: arg2, arg2 -> -1 + arg2, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006082s Time used: 0.005897 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.001146s Time used: 4.0006 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.006176s Time used: 4.00091 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.008390s Time used: 1.00069 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.010732s Time used: 0.007495 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.020466s Time used: 0.020449 LOG: SAT solveNonLinear - Elapsed time: 0.031198s Cost: 1; Total time: 0.027944 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.000625s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002500s Trying to remove transition: arg2, arg2 -> -1 + arg2, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006394s Time used: 0.006242 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.000716s Time used: 4.00024 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.014003s Time used: 4.0008 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.012524s Time used: 1.00035 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.012146s Time used: 0.009079 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.023356s Time used: 0.02335 LOG: SAT solveNonLinear - Elapsed time: 0.035502s Cost: 1; Total time: 0.032429 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.000797s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003274s Trying to remove transition: arg2, arg2 -> -1 + arg2, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.007348s Time used: 0.007189 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.003663s Time used: 4.00299 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.060715s Time used: 4.00067 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.006345s Time used: 1.00038 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.013743s Time used: 0.010601 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.035066s Time used: 0.034897 LOG: SAT solveNonLinear - Elapsed time: 0.048808s Cost: 1; Total time: 0.045498 Termination implied by a set of invariant(s): Invariant at l2: 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 + 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.000916s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.004112s Trying to remove transition: arg2, arg2 -> -1 + arg2, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008166s Time used: 0.008005 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 2.639997s Time used: 2.63622 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.997924s Time used: 0.994534 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.997791s Time used: 0.99496 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.014889s Time used: 0.011502 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.026265s Time used: 0.02626 LOG: SAT solveNonLinear - Elapsed time: 0.041154s Cost: 1; Total time: 0.037762 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.000851s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003595s Trying to remove transition: arg2, arg2 -> -1 + arg2, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008548s Time used: 0.008342 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.935423s Time used: 0.935113 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.023137s Time used: 0.996881 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.974646s Time used: 0.972403 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.014957s Time used: 0.011797 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.022188s Time used: 0.022183 LOG: SAT solveNonLinear - Elapsed time: 0.037145s Cost: 1; Total time: 0.03398 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.000877s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003284s Trying to remove transition: arg2, arg2 -> -1 + arg2, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008582s Time used: 0.008415 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.938684s Time used: 0.938246 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.999855s Time used: 0.997632 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.999107s Time used: 0.996027 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.014540s Time used: 0.011305 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.001347s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.001450s Cannot prove unreachability Proving non-termination of subgraph 1 Transitions: arg2, arg2 -> -1 + arg2, rest remain the same}> Variables: arg1, arg2 Checking conditional non-termination of SCC {l2}... EXIT TRANSITIONS: Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009215s Time used: 0.009012 Improving Solution with cost 2 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.010041s Time used: 0.010035 LOG: SAT solveNonLinear - Elapsed time: 0.019255s Cost: 2; Total time: 0.019047 Non-termination implied by a set of quasi-invariant(s): Quasi-invariant at l2: 1 + arg2 <= arg1 Strengthening and disabling EXIT transitions... Closed exits from l2: 2 Strengthening exit transition (result): 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}> Checking conditional non-termination of SCC {l2}... EXIT TRANSITIONS: Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.005266s Time used: 0.005164 LOG: SAT solveNonLinear - Elapsed time: 0.005266s Cost: 0; Total time: 0.005164 Non-termination implied by a set of quasi-invariant(s): Quasi-invariant at l2: arg1 <= 0 Strengthening and disabling EXIT transitions... Closed exits from l2: 1 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}> Calling reachability with... Transition: Conditions: 1 + arg2 <= arg1, arg1 <= 0, OPEN EXITS: --- Reachability graph --- > Graph without transitions. Calling reachability with... Transition: Conditions: arg1 <= 0, 1 + arg2 <= arg1, OPEN EXITS: > Conditions are reachable! Program does NOT terminate