NO Solver Timeout: 4 Global Timeout: 300 No parsing errors! Init Location: 0 Transitions: ~(1)) /\ (undef1 > ~(1)), par{arg1 -> undef1, arg2 -> undef2}> 0) /\ (undef3 > ~(1)), par{arg1 -> undef3, arg2 -> undef4}> 0) /\ (arg1 > 0) /\ (undef5 > 0), par{arg1 -> undef5, arg2 -> undef6}> ~(1)) /\ (undef8 > ~(1)) /\ (arg1 > 0), par{arg1 -> undef8, arg2 -> 1}> 0) /\ (arg2 > 0), par{arg1 -> (arg1 - 1), arg2 -> (arg2 + 1)}> undef12, arg2 -> undef13}> Fresh variables: undef1, undef2, undef3, undef4, undef5, undef6, undef7, undef8, undef12, undef13, Undef variables: undef1, undef2, undef3, undef4, undef5, undef6, undef7, undef8, undef12, undef13, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: 0) /\ (undef3 > ~(1)), par{arg1 -> undef3, arg2 -> undef4}> ~(1)) /\ (undef8 > ~(1)) /\ (undef12 > 0), par{arg1 -> undef8, arg2 -> 1}> 0) /\ (arg1 > 0) /\ (undef5 > 0), par{arg1 -> undef5, arg2 -> undef6}> 0) /\ (arg2 > 0), par{arg1 -> (arg1 - 1), arg2 -> (arg2 + 1)}> Fresh variables: undef1, undef2, undef3, undef4, undef5, undef6, undef7, undef8, undef12, undef13, Undef variables: undef1, undef2, undef3, undef4, undef5, undef6, undef7, undef8, undef12, undef13, 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 + arg2, rest remain the same}> Variables: arg1, arg2 Graph 2: Transitions: undef5, arg2 -> undef6, rest remain the same}> Variables: arg1, arg2 Precedence: Graph 0 Graph 1 undef8, arg2 -> 1, rest remain the same}> Graph 2 undef3, arg2 -> undef4, rest remain the same}> Map Locations to Subgraph: ( 0 , 0 ) ( 2 , 2 ) ( 4 , 1 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.002309 Checking conditional termination of SCC {l4}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000477s Ranking function: -1 + arg1 New Graphs: Proving termination of subgraph 2 Checking unfeasibility... Time used: 0.001399 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000493s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001698s Trying to remove transition: undef5, arg2 -> undef6, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.003883s Time used: 0.003743 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.004234s Time used: 0.003934 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.005968s Time used: 0.005967 LOG: SAT solveNonLinear - Elapsed time: 0.010203s Cost: 1; Total time: 0.009901 Failed at location 2: arg1 <= 0 Before Improving: Quasi-invariant at l2: arg1 <= 0 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001112s Remaining time after improvement: 0.999421 Termination implied by a set of quasi-invariant(s): Quasi-invariant at l2: arg1 <= 0 [ 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: undef5, arg2 -> undef6, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: undef5, arg2 -> undef6, rest remain the same}> New Graphs: Calling Safety with literal arg1 <= 0 and entry undef3, arg2 -> undef4, rest remain the same}> LOG: CALL check - Post:arg1 <= 0 - Process 1 * Exit transition: undef3, arg2 -> undef4, rest remain the same}> * Postcondition : arg1 <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000201s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000236s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: arg1 <= 0 , Narrowing transition: undef5, arg2 -> undef6, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: undef5, arg2 -> undef6, rest remain the same}> Variables: arg1, arg2 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000326s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001173s Trying to remove transition: undef5, arg2 -> undef6, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.002578s Time used: 0.002497 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.003699s Time used: 0.003502 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.000484s Time used: 4.00028 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.002221s Time used: 1.0002 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.004530s Time used: 0.00278 Proving non-termination of subgraph 2 Transitions: undef5, arg2 -> undef6, rest remain the same}> Variables: arg1, arg2 Checking that every undef value has an assignment... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000473s Checking conditional non-termination of SCC {l2}... EXIT TRANSITIONS: Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008442s Time used: 0.008294 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.024024s Time used: 0.024023 LOG: SAT solveNonLinear - Elapsed time: 0.032466s Cost: 1; Total time: 0.032317 Failed at location 2: 1 <= arg1 Before Improving: Quasi-invariant at l2: 1 <= arg1 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.005491s Remaining time after improvement: 0.999019 Minimizing number of undef constraints... LOG: CALL solveNonLinear LOG: RETURN solveNonLinear - Elapsed time: 0.001554s Number of undef constraints reduced! Non-termination implied by a set of quasi-invariant(s): Quasi-invariant at l2: 1 <= arg1 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): undef5, arg2 -> undef6, rest remain the same}> Calling reachability with... Transition: Conditions: 1 <= arg1, OPEN EXITS: --- Reachability graph --- > Graph without transitions. Calling reachability with... Transition: undef3, arg2 -> undef4, rest remain the same}> Conditions: 1 <= arg1, OPEN EXITS: undef3, arg2 -> undef4, rest remain the same}> > Conditions are reachable! Program does NOT terminate