NO Solver Timeout: 4 Global Timeout: 60 No parsing errors! Init Location: 0 Transitions: arg2) /\ (arg2 > ~(1)) /\ (arg1 > 0), par{arg1 -> (arg2 + 28), arg2 -> undef2}> 35), par{arg1 -> 0, arg2 -> undef4}> 0), par{arg1 -> (arg1 - 1), arg2 -> undef6}> 30) /\ (arg1 < 36), par{arg1 -> 35, 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: undef10) /\ (undef10 > ~(1)) /\ (undef9 > 0)> 35), par{arg1 -> 0}> 0), par{arg1 -> (arg1 - 1)}> 30) /\ (arg1 < 36), par{arg1 -> 35}> 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: 0, rest remain the same}> -1 + arg1, rest remain the same}> 35, rest remain the same}> Variables: arg1 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.006339 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001186s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.014643s Piecewise ranking function: min(60,-2 + 2*arg1) New Graphs: Transitions: 35, rest remain the same}> Variables: arg1 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000473s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001505s Trying to remove transition: 35, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.038550s Time used: 4.03808 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.040462s Time used: 0.03679 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.066512s Time used: 0.066507 LOG: SAT solveNonLinear - Elapsed time: 0.106974s Cost: 1; Total time: 0.103297 Failed at location 2: arg1 <= 30 Before Improving: Quasi-invariant at l2: arg1 <= 30 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.012155s Remaining time after improvement: 0.99805 Termination implied by a set of quasi-invariant(s): Quasi-invariant at l2: arg1 <= 30 [ 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: 0, 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}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 35, 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: 35, rest remain the same}> New Graphs: Calling Safety with literal arg1 <= 30 and entry LOG: CALL check - Post:arg1 <= 30 - Process 1 * Exit transition: * Postcondition : arg1 <= 30 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000528s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000624s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: arg1 <= 30 , It's unfeasible. Removing transition: 0, rest remain the same}> It's unfeasible. Removing transition: -1 + arg1, rest remain the same}> Narrowing transition: 35, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: 35, rest remain the same}> Variables: arg1 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000482s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001569s Trying to remove transition: 35, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.002292s Time used: 4.00182 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.310722s Time used: 0.306428 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000542s Time used: 1.00054 LOG: SAT solveNonLinear - Elapsed time: 1.311264s Cost: 1; Total time: 1.30696 Failed at location 2: 36 <= arg1 Before Improving: Quasi-invariant at l2: 36 <= arg1 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.022648s Remaining time after improvement: 0.998498 Termination implied by a set of quasi-invariant(s): Quasi-invariant at l2: 36 <= 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: 35, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: 35, rest remain the same}> New Graphs: Calling Safety with literal 36 <= arg1 and entry LOG: CALL check - Post:36 <= arg1 - Process 2 * Exit transition: * Postcondition : 36 <= arg1 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001089s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.001191s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: 36 <= arg1 , Narrowing transition: 35, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: 35, rest remain the same}> Variables: arg1 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000487s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001622s Trying to remove transition: 35, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.001829s Time used: 4.00165 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.006435s Time used: 4.00189 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.045641s Time used: 4.00144 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.033153s Time used: 1.01372 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.008867s Time used: 4.00277 Proving non-termination of subgraph 1 Transitions: 35, 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.108182s Time used: 0.108008 Improving Solution with cost 2 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.001592s Time used: 1.00141 LOG: SAT solveNonLinear - Elapsed time: 1.109774s Cost: 2; Total time: 1.10942 Failed at location 2: 31 <= arg1 Before Improving: Quasi-invariant at l2: 31 <= arg1 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.039694s Remaining time after improvement: 0.998181 Non-termination implied by a set of quasi-invariant(s): Quasi-invariant at l2: 31 <= arg1 Strengthening and disabling EXIT transitions... Closed exits from l2: 1 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): 35, 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.014020s Time used: 0.013854 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.016002s Time used: 0.015996 LOG: SAT solveNonLinear - Elapsed time: 0.030021s Cost: 1; Total time: 0.02985 Failed at location 2: arg1 <= 35 Before Improving: Quasi-invariant at l2: arg1 <= 35 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003747s Remaining time after improvement: 0.998989 Non-termination implied by a set of quasi-invariant(s): Quasi-invariant at l2: arg1 <= 35 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): 35, rest remain the same}> Calling reachability with... Transition: Conditions: 31 <= arg1, arg1 <= 35, OPEN EXITS: --- Reachability graph --- > Graph without transitions. Calling reachability with... Transition: Conditions: 31 <= arg1, arg1 <= 35, OPEN EXITS: > Conditions are reachable! Program does NOT terminate