NO Solver Timeout: 4 Global Timeout: 60 No parsing errors! Init Location: 0 Transitions: 0) /\ (arg2 > ~(1)), par{arg1 -> 0}> 0) /\ (arg2 < 11) /\ (0 = arg1), par{arg1 -> 0, arg2 -> (arg2 - 1)}> 0) /\ (1 = arg1), par{arg1 -> 1, arg2 -> (arg2 + 1)}> 0, arg2 -> 9}> 1, arg2 -> 1}> undef11, arg2 -> undef12}> Fresh variables: undef11, undef12, Undef variables: undef11, undef12, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: 0) /\ (undef12 > ~(1))> 0) /\ (arg2 < 11) /\ (0 = arg1), par{arg1 -> 0, arg2 -> (arg2 - 1)}> 0) /\ (1 = arg1), par{arg1 -> 1, arg2 -> (arg2 + 1)}> 0, arg2 -> 9}> 1, arg2 -> 1}> Fresh variables: undef11, undef12, Undef variables: undef11, undef12, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: 0, arg2 -> -1 + arg2, rest remain the same}> 1, arg2 -> 1 + arg2, rest remain the same}> 0, arg2 -> 9, rest remain the same}> 1, arg2 -> 1, 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.159788 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002403s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.011703s Trying to remove transition: 1, arg2 -> 1, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.785348s Time used: 0.784859 Trying to remove transition: 0, arg2 -> 9, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.007921s Time used: 4.00168 Trying to remove transition: 1, arg2 -> 1 + arg2, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.084293s Time used: 4.00139 Trying to remove transition: 0, arg2 -> -1 + arg2, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.040645s Time used: 4.00185 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.362060s Time used: 1.31886 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.483018s Time used: 0.48304 LOG: SAT solveNonLinear - Elapsed time: 1.845078s Cost: 1; Total time: 1.8019 Failed at location 2: 11 <= arg2 Before Improving: Quasi-invariant at l2: 11 <= arg2 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.040926s Remaining time after improvement: 0.996946 Termination implied by a set of quasi-invariant(s): Quasi-invariant at l2: 11 <= arg2 [ 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, arg2 -> -1 + arg2, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1, arg2 -> 1 + arg2, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 0, arg2 -> 9, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1, arg2 -> 1, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: 1, arg2 -> 1 + arg2, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 0, arg2 -> -1 + arg2, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 0, arg2 -> 9, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1, arg2 -> 1, rest remain the same}> New Graphs: Calling Safety with literal 11 <= arg2 and entry LOG: CALL check - Post:11 <= arg2 - Process 1 * Exit transition: * Postcondition : 11 <= arg2 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001155s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.001257s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: 11 <= arg2 , Narrowing transition: 0, arg2 -> -1 + arg2, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1, arg2 -> 1 + arg2, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 0, arg2 -> 9, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1, arg2 -> 1, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: 0, arg2 -> -1 + arg2, rest remain the same}> 1, arg2 -> 1 + arg2, rest remain the same}> 0, arg2 -> 9, rest remain the same}> 1, arg2 -> 1, rest remain the same}> Variables: arg1, arg2 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001403s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.012133s Trying to remove transition: 1, arg2 -> 1, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.781510s Time used: 0.780957 Trying to remove transition: 0, arg2 -> 9, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.008545s Time used: 4.00202 Trying to remove transition: 1, arg2 -> 1 + arg2, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.042911s Time used: 4.00229 Trying to remove transition: 0, arg2 -> -1 + arg2, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.041468s Time used: 4.00184 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 2.154108s Time used: 2.10984 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.939103s Time used: 0.928537 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.986762s Time used: 0.965239 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.007850s Time used: 0.973677 Proving non-termination of subgraph 1 Transitions: 0, arg2 -> -1 + arg2, rest remain the same}> 1, arg2 -> 1 + arg2, rest remain the same}> 0, arg2 -> 9, rest remain the same}> 1, arg2 -> 1, 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.026331s Time used: 0.026054 Improving Solution with cost 6 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.001536s Time used: 1.00156 LOG: SAT solveNonLinear - Elapsed time: 1.027868s Cost: 6; Total time: 1.02762 Non-termination implied by a set of quasi-invariant(s): Quasi-invariant at l2: 0 <= arg2 Strengthening and disabling EXIT transitions... Closed exits from l2: 2 Strengthening exit transition (result): Strengthening exit transition (result): Strengthening exit transition (result): 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): 0, arg2 -> -1 + arg2, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, arg2 -> 1 + arg2, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, arg2 -> 9, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, arg2 -> 1, 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.025378s Time used: 0.025102 Improving Solution with cost 5 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.470353s Time used: 0.470237 Improving Solution with cost 3 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.198674s Time used: 0.19868 LOG: SAT solveNonLinear - Elapsed time: 0.694405s Cost: 3; Total time: 0.694019 Failed at location 2: arg2 <= 10 Before Improving: Quasi-invariant at l2: arg2 <= 10 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.018447s Remaining time after improvement: 0.997876 Non-termination implied by a set of quasi-invariant(s): Quasi-invariant at l2: arg2 <= 10 Strengthening and disabling EXIT transitions... Closed exits from l2: 2 Strengthening exit transition (result): 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): 0, arg2 -> -1 + arg2, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, arg2 -> 1 + arg2, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, arg2 -> 9, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, arg2 -> 1, 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.017158s Time used: 0.016917 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.048274s Time used: 0.04827 LOG: SAT solveNonLinear - Elapsed time: 0.065433s Cost: 1; Total time: 0.065187 Non-termination implied by a set of quasi-invariant(s): Quasi-invariant at l2: 0 <= 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): 0, arg2 -> -1 + arg2, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, arg2 -> 1 + arg2, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, arg2 -> 9, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, arg2 -> 1, 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.013864s Time used: 0.013763 LOG: SAT solveNonLinear - Elapsed time: 0.013864s Cost: 0; Total time: 0.013763 Non-termination implied by a set of quasi-invariant(s): Quasi-invariant at l2: arg1 <= 1 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): 0, arg2 -> -1 + arg2, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, arg2 -> 1 + arg2, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, arg2 -> 9, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, arg2 -> 1, rest remain the same}> Calling reachability with... Transition: Conditions: 0 <= arg2, arg2 <= 10, 0 <= arg1, arg1 <= 1, OPEN EXITS: --- Reachability graph --- > Graph without transitions. Calling reachability with... Transition: Conditions: 0 <= arg1, 0 <= arg2, arg1 <= 1, arg2 <= 10, OPEN EXITS: > Conditions are reachable! Program does NOT terminate