NO Solver Timeout: 4 Global Timeout: 300 No parsing errors! Init Location: 0 Transitions: 0) /\ (arg2 > ~(1)), par{arg1 -> arg2, arg2 -> undef2}> 0), par{arg2 -> undef4}> 0), par{arg1 -> (arg1 + 1), arg2 -> undef6}> 0) /\ ((arg1 - 1) < arg1), par{arg1 -> (arg1 - 1), arg2 -> undef8}> undef9, arg2 -> undef10}> Fresh variables: undef2, undef4, undef6, undef8, undef9, undef10, Undef variables: undef2, undef4, undef6, undef8, undef9, undef10, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: 0) /\ (undef10 > ~(1))> 0)> 0), par{arg1 -> (arg1 + 1)}> 0) /\ ((arg1 - 1) < arg1), par{arg1 -> (arg1 - 1)}> Fresh variables: undef2, undef4, undef6, undef8, undef9, undef10, Undef variables: undef2, undef4, undef6, undef8, undef9, undef10, 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}> Variables: arg1 Graph 2: Transitions: -1 + arg1, rest remain the same}> Variables: arg1 Precedence: Graph 0 Graph 1 Graph 2 Map Locations to Subgraph: ( 0 , 0 ) ( 2 , 1 ) ( 3 , 2 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.001626 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000568s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001297s Trying to remove transition: 1 + arg1, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.002730s Time used: 0.002594 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.003326s Time used: 0.003134 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.007922s Time used: 0.007921 LOG: SAT solveNonLinear - Elapsed time: 0.011249s Cost: 1; Total time: 0.011055 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.000780s Remaining time after improvement: 0.999641 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: 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 It's unfeasible. Removing transition: 1 + arg1, rest remain the same}> New Graphs: Calling Safety with literal arg1 <= 0 and entry LOG: CALL check - Post:arg1 <= 0 - Process 1 * Exit transition: * Postcondition : arg1 <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000208s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000244s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: arg1 <= 0 , Narrowing transition: 1 + arg1, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: 1 + arg1, rest remain the same}> Variables: arg1 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000244s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000598s Trying to remove transition: 1 + arg1, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.001614s Time used: 0.001545 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.001384s Time used: 4.00124 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.005132s Time used: 4.00079 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.004339s Time used: 1.00054 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.004761s Time used: 0.002794 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.005526s Time used: 0.005524 LOG: SAT solveNonLinear - Elapsed time: 0.010287s Cost: 1; Total time: 0.008318 Quasi-ranking function: 50000 - arg1 New Graphs: Transitions: 1 + arg1, rest remain the same}> Variables: arg1 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000204s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000562s Trying to remove transition: 1 + arg1, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.001686s Time used: 0.001621 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.001294s Time used: 4.00117 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.004199s Time used: 4.00064 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.004481s Time used: 1.00057 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.004688s Time used: 0.002626 Proving non-termination of subgraph 1 Transitions: 1 + arg1, rest remain the same}> Variables: arg1 Checking conditional non-termination of SCC {l2}... EXIT TRANSITIONS: Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.001661s Time used: 0.001564 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.002081s Time used: 0.002079 LOG: SAT solveNonLinear - Elapsed time: 0.003742s Cost: 1; Total time: 0.003643 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.000844s Remaining time after improvement: 0.999414 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): 1 + arg1, rest remain the same}> Calling reachability with... Transition: Conditions: 1 <= arg1, OPEN EXITS: --- Reachability graph --- > Graph without transitions. Calling reachability with... Transition: Conditions: 1 <= arg1, OPEN EXITS: > Conditions are reachable! Program does NOT terminate