NO Solver Timeout: 4 Global Timeout: 60 No parsing errors! Init Location: 0 Transitions: ~(1)) /\ (arg2 > 1) /\ ((undef4 - (2 * undef5)) = 1) /\ (undef4 > ~(1)) /\ (arg1 > 0)> ~(1)) /\ (arg2 > 1) /\ ((undef8 - (2 * undef9)) = 1) /\ (undef8 > ~(1)) /\ (arg1 > 0) /\ ((undef8 - (2 * undef9)) < 2) /\ ((undef8 - (2 * undef9)) >= 0), par{arg1 -> undef6, arg2 -> undef7}> ~(1)) /\ (arg2 > 1) /\ ((undef13 - (2 * undef14)) = 0) /\ (undef13 > ~(1)) /\ (arg1 > 0)> ~(1)) /\ (arg2 > 1) /\ ((undef18 - (2 * undef19)) = 0) /\ (undef18 > ~(1)) /\ (arg1 > 0) /\ ((undef18 - (2 * undef19)) < 2) /\ ((undef18 - (2 * undef19)) >= 0), par{arg1 -> (0 - undef17), arg2 -> undef16}> (arg1 - 1), arg2 -> undef21}> 0), par{arg1 -> (arg1 - 1), arg2 -> undef23}> undef24, arg2 -> undef25}> Fresh variables: undef3, undef4, undef5, undef6, undef7, undef8, undef9, undef12, undef13, undef14, undef16, undef17, undef18, undef19, undef21, undef23, undef24, undef25, Undef variables: undef3, undef4, undef5, undef6, undef7, undef8, undef9, undef12, undef13, undef14, undef16, undef17, undef18, undef19, undef21, undef23, undef24, undef25, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: ~(1)) /\ (undef25 > 1) /\ ((undef4 - (2 * undef5)) = 1) /\ (undef4 > ~(1)) /\ (undef24 > 0) /\ (undef6 > ~(1)) /\ (undef25 > 1) /\ ((undef8 - (2 * undef9)) = 1) /\ (undef8 > ~(1)) /\ (undef24 > 0) /\ ((undef8 - (2 * undef9)) < 2) /\ ((undef8 - (2 * undef9)) >= 0), par{arg1 -> undef6}> ~(1)) /\ (undef25 > 1) /\ ((undef4 - (2 * undef5)) = 1) /\ (undef4 > ~(1)) /\ (undef24 > 0) /\ (undef17 > ~(1)) /\ (undef25 > 1) /\ ((undef18 - (2 * undef19)) = 0) /\ (undef18 > ~(1)) /\ (undef24 > 0) /\ ((undef18 - (2 * undef19)) < 2) /\ ((undef18 - (2 * undef19)) >= 0), par{arg1 -> (0 - undef17)}> ~(1)) /\ (undef25 > 1) /\ ((undef13 - (2 * undef14)) = 0) /\ (undef13 > ~(1)) /\ (undef24 > 0) /\ (undef6 > ~(1)) /\ (undef25 > 1) /\ ((undef8 - (2 * undef9)) = 1) /\ (undef8 > ~(1)) /\ (undef24 > 0) /\ ((undef8 - (2 * undef9)) < 2) /\ ((undef8 - (2 * undef9)) >= 0), par{arg1 -> undef6}> ~(1)) /\ (undef25 > 1) /\ ((undef13 - (2 * undef14)) = 0) /\ (undef13 > ~(1)) /\ (undef24 > 0) /\ (undef17 > ~(1)) /\ (undef25 > 1) /\ ((undef18 - (2 * undef19)) = 0) /\ (undef18 > ~(1)) /\ (undef24 > 0) /\ ((undef18 - (2 * undef19)) < 2) /\ ((undef18 - (2 * undef19)) >= 0), par{arg1 -> (0 - undef17)}> (arg1 - 1)}> 0), par{arg1 -> (arg1 - 1)}> Fresh variables: undef3, undef4, undef5, undef6, undef7, undef8, undef9, undef12, undef13, undef14, undef16, undef17, undef18, undef19, undef21, undef23, undef24, undef25, Undef variables: undef3, undef4, undef5, undef6, undef7, undef8, undef9, undef12, undef13, undef14, undef16, undef17, undef18, undef19, undef21, undef23, undef24, undef25, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: -1 + arg1, rest remain the same}> -1 + arg1, rest remain the same}> Variables: arg1 Precedence: Graph 0 Graph 1 undef6, rest remain the same}> -undef17, rest remain the same}> undef6, rest remain the same}> -undef17, rest remain the same}> 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.004695 Checking conditional termination of SCC {l3}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000879s Ranking function: -1 + arg1 New Graphs: Transitions: -1 + arg1, rest remain the same}> Variables: arg1 Checking conditional termination of SCC {l3}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000382s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001134s Trying to remove transition: -1 + arg1, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.003560s Time used: 0.003436 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008580s Time used: 0.008256 Improving Solution with cost 2 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.020316s Time used: 0.0203 LOG: SAT solveNonLinear - Elapsed time: 0.028896s Cost: 2; Total time: 0.028556 Failed at location 3: 0 <= arg1 Failed at location 3: 0 <= arg1 Before Improving: Quasi-invariant at l3: 0 <= arg1 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003115s Remaining time after improvement: 0.998457 Termination implied by a set of quasi-invariant(s): Quasi-invariant at l3: 0 <= arg1 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: -1 + arg1, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + arg1, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: -1 + arg1, rest remain the same}> New Graphs: Calling Safety with literal 0 <= arg1 and entry -undef17, rest remain the same}> LOG: CALL check - Post:0 <= arg1 - Process 1 * Exit transition: -undef17, rest remain the same}> * Postcondition : 0 <= arg1 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000627s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000771s Calling Safety with literal 0 <= arg1 and entry -undef17, rest remain the same}> LOG: CALL check - Post:0 <= arg1 - Process 2 * Exit transition: -undef17, rest remain the same}> * Postcondition : 0 <= arg1 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000581s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000741s INVARIANTS: 3: Quasi-INVARIANTS to narrow Graph: 3: 0 <= arg1 , Narrowing transition: -1 + arg1, rest remain the same}> LOG: Narrow transition size 1 It's unfeasible. Removing transition: -1 + arg1, rest remain the same}> invGraph after Narrowing: Transitions: -1 + arg1, rest remain the same}> Variables: arg1 Checking conditional termination of SCC {l3}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000388s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001144s Trying to remove transition: -1 + arg1, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.003514s Time used: 0.003388 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.001703s Time used: 4.00085 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.005216s Time used: 4.00075 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.005938s Time used: 1.00049 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009342s Time used: 0.006327 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.009554s Time used: 0.009512 LOG: SAT solveNonLinear - Elapsed time: 0.018895s Cost: 1; Total time: 0.015839 Termination implied by a set of invariant(s): Invariant at l3: 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): -1 + arg1, 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 + arg1, rest remain the same}> Quasi-ranking function: 50000 + arg1 New Graphs: Transitions: -1 + arg1, rest remain the same}> Variables: arg1 Checking conditional termination of SCC {l3}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000413s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001224s Trying to remove transition: -1 + arg1, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.003601s Time used: 0.003466 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.003488s Time used: 4.0023 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.005072s Time used: 4.0008 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.006387s Time used: 1.00069 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009014s Time used: 0.005933 Proving non-termination of subgraph 1 Transitions: -1 + arg1, rest remain the same}> Variables: arg1 Checking conditional non-termination of SCC {l3}... EXIT TRANSITIONS: Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.005920s Time used: 0.005707 Improving Solution with cost 4 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.005558s Time used: 0.005551 LOG: SAT solveNonLinear - Elapsed time: 0.011477s Cost: 4; Total time: 0.011258 Failed at location 3: 1 + arg1 <= 0 Failed at location 3: 1 + arg1 <= 0 Failed at location 3: 1 + arg1 <= 0 Failed at location 3: 1 + arg1 <= 0 Before Improving: Quasi-invariant at l3: 1 + arg1 <= 0 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001906s Remaining time after improvement: 0.998726 Non-termination implied by a set of quasi-invariant(s): Quasi-invariant at l3: 1 + arg1 <= 0 Strengthening and disabling EXIT transitions... Closed exits from l3: 1 Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + arg1, rest remain the same}> Calling reachability with... Transition: Conditions: 1 + arg1 <= 0, Transition: Conditions: 1 + arg1 <= 0, Transition: Conditions: 1 + arg1 <= 0, Transition: Conditions: 1 + arg1 <= 0, OPEN EXITS: --- Reachability graph --- > Graph without transitions. Calling reachability with... Transition: undef6, rest remain the same}> Conditions: 1 + arg1 <= 0, Transition: -undef17, rest remain the same}> Conditions: 1 + arg1 <= 0, Transition: undef6, rest remain the same}> Conditions: 1 + arg1 <= 0, Transition: -undef17, rest remain the same}> Conditions: 1 + arg1 <= 0, Transition: undef6, rest remain the same}> Conditions: 1 + arg1 <= 0, Transition: -undef17, rest remain the same}> Conditions: 1 + arg1 <= 0, Transition: undef6, rest remain the same}> Conditions: 1 + arg1 <= 0, Transition: -undef17, rest remain the same}> Conditions: 1 + arg1 <= 0, Transition: undef6, rest remain the same}> Conditions: 1 + arg1 <= 0, Transition: -undef17, rest remain the same}> Conditions: 1 + arg1 <= 0, Transition: undef6, rest remain the same}> Conditions: 1 + arg1 <= 0, Transition: -undef17, rest remain the same}> Conditions: 1 + arg1 <= 0, Transition: undef6, rest remain the same}> Conditions: 1 + arg1 <= 0, Transition: -undef17, rest remain the same}> Conditions: 1 + arg1 <= 0, Transition: undef6, rest remain the same}> Conditions: 1 + arg1 <= 0, Transition: -undef17, rest remain the same}> Conditions: 1 + arg1 <= 0, OPEN EXITS: -undef17, rest remain the same}> -undef17, rest remain the same}> -undef17, rest remain the same}> -undef17, rest remain the same}> -undef17, rest remain the same}> -undef17, rest remain the same}> -undef17, rest remain the same}> -undef17, rest remain the same}> > Conditions are reachable! Program does NOT terminate