12.21/12.26 NO 12.21/12.26 12.21/12.26 Solver Timeout: 4 12.21/12.26 Global Timeout: 300 12.21/12.26 No parsing errors! 12.21/12.26 Init Location: 0 12.21/12.26 Transitions: 12.21/12.26 12.21/12.26 0) /\ (arg2 > ~(1)), par{arg1 -> arg2, arg2 -> undef2}> 12.21/12.26 5, arg2 -> undef4}> 12.21/12.26 0) /\ (arg1 < 5), par{arg1 -> (arg1 - 1), arg2 -> undef6}> 12.21/12.26 5), par{arg1 -> (arg1 - 1), arg2 -> undef8}> 12.21/12.26 undef9, arg2 -> undef10}> 12.21/12.26 12.21/12.26 Fresh variables: 12.21/12.26 undef2, undef4, undef6, undef8, undef9, undef10, 12.21/12.26 12.21/12.26 Undef variables: 12.21/12.26 undef2, undef4, undef6, undef8, undef9, undef10, 12.21/12.26 12.21/12.26 Abstraction variables: 12.21/12.26 12.21/12.26 Exit nodes: 12.21/12.26 12.21/12.26 Accepting locations: 12.21/12.26 12.21/12.26 Asserts: 12.21/12.26 12.21/12.26 Preprocessed LLVMGraph 12.21/12.26 Init Location: 0 12.21/12.26 Transitions: 12.21/12.26 0) /\ (undef10 > ~(1))> 12.21/12.26 5}> 12.21/12.26 0) /\ (arg1 < 5), par{arg1 -> (arg1 - 1)}> 12.21/12.26 5), par{arg1 -> (arg1 - 1)}> 12.21/12.26 12.21/12.26 Fresh variables: 12.21/12.26 undef2, undef4, undef6, undef8, undef9, undef10, 12.21/12.26 12.21/12.26 Undef variables: 12.21/12.26 undef2, undef4, undef6, undef8, undef9, undef10, 12.21/12.26 12.21/12.26 Abstraction variables: 12.21/12.26 12.21/12.26 Exit nodes: 12.21/12.26 12.21/12.26 Accepting locations: 12.21/12.26 12.21/12.26 Asserts: 12.21/12.26 12.21/12.26 ************************************************************* 12.21/12.26 ******************************************************************************************* 12.21/12.26 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 12.21/12.26 ******************************************************************************************* 12.21/12.26 12.21/12.26 Init Location: 0 12.21/12.26 Graph 0: 12.21/12.26 Transitions: 12.21/12.26 Variables: 12.21/12.26 12.21/12.26 Graph 1: 12.21/12.26 Transitions: 12.21/12.26 5, rest remain the same}> 12.21/12.26 -1 + arg1, rest remain the same}> 12.21/12.26 -1 + arg1, rest remain the same}> 12.21/12.26 Variables: 12.21/12.26 arg1 12.21/12.26 12.21/12.26 Precedence: 12.21/12.26 Graph 0 12.21/12.26 12.21/12.26 Graph 1 12.21/12.26 12.21/12.26 12.21/12.26 Map Locations to Subgraph: 12.21/12.26 ( 0 , 0 ) 12.21/12.26 ( 2 , 1 ) 12.21/12.26 12.21/12.26 ******************************************************************************************* 12.21/12.26 ******************************** CHECKING ASSERTIONS ******************************** 12.21/12.26 ******************************************************************************************* 12.21/12.26 12.21/12.26 Proving termination of subgraph 0 12.21/12.26 Proving termination of subgraph 1 12.21/12.26 Checking unfeasibility... 12.21/12.26 Time used: 0.004954 12.21/12.26 12.21/12.26 Checking conditional termination of SCC {l2}... 12.21/12.26 12.21/12.26 LOG: CALL solveLinear 12.21/12.26 12.21/12.26 LOG: RETURN solveLinear - Elapsed time: 0.001164s 12.21/12.26 Ranking function: -1 + arg1 12.21/12.26 New Graphs: 12.21/12.26 Transitions: 12.21/12.26 5, rest remain the same}> 12.21/12.26 Variables: 12.21/12.26 arg1 12.21/12.26 Checking conditional termination of SCC {l2}... 12.21/12.26 12.21/12.26 LOG: CALL solveLinear 12.21/12.26 12.21/12.26 LOG: RETURN solveLinear - Elapsed time: 0.000366s 12.21/12.26 12.21/12.26 LOG: CALL solveLinear 12.21/12.26 12.21/12.26 LOG: RETURN solveLinear - Elapsed time: 0.001002s 12.21/12.26 Trying to remove transition: 5, rest remain the same}> 12.21/12.26 Solving with 1 template(s). 12.21/12.26 12.21/12.26 LOG: CALL solveNonLinearGetFirstSolution 12.21/12.26 12.21/12.26 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.613803s 12.21/12.26 Time used: 0.613666 12.21/12.26 Solving with 1 template(s). 12.21/12.26 12.21/12.26 LOG: CALL solveNonLinearGetFirstSolution 12.21/12.26 12.21/12.26 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.011440s 12.21/12.26 Time used: 0.008642 12.21/12.26 Improving Solution with cost 1 ... 12.21/12.26 12.21/12.26 LOG: CALL solveNonLinearGetNextSolution 12.21/12.26 12.21/12.26 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.022374s 12.21/12.26 Time used: 0.022368 12.21/12.26 12.21/12.26 LOG: SAT solveNonLinear - Elapsed time: 0.033814s 12.21/12.26 Cost: 1; Total time: 0.03101 12.21/12.26 Failed at location 2: arg1 <= 0 12.21/12.26 Before Improving: 12.21/12.26 Quasi-invariant at l2: arg1 <= 0 12.21/12.26 Optimizing invariants... 12.21/12.26 12.21/12.26 LOG: CALL solveLinear 12.21/12.26 12.21/12.26 LOG: RETURN solveLinear - Elapsed time: 0.004117s 12.21/12.26 Remaining time after improvement: 0.998902 12.21/12.26 Termination implied by a set of quasi-invariant(s): 12.21/12.26 Quasi-invariant at l2: arg1 <= 0 12.21/12.26 [ Invariant Graph ] 12.21/12.26 Strengthening and disabling transitions... 12.21/12.26 12.21/12.26 LOG: CALL solverLinear in Graph for feasibility 12.21/12.26 12.21/12.26 LOG: RETURN solveLinear in Graph for feasibility 12.21/12.26 It's unfeasible. Removing transition: 12.21/12.26 5, rest remain the same}> 12.21/12.26 12.21/12.26 LOG: CALL solverLinear in Graph for feasibility 12.21/12.26 12.21/12.26 LOG: RETURN solveLinear in Graph for feasibility 12.21/12.26 It's unfeasible. Removing transition: 12.21/12.26 -1 + arg1, rest remain the same}> 12.21/12.26 12.21/12.26 LOG: CALL solverLinear in Graph for feasibility 12.21/12.26 12.21/12.26 LOG: RETURN solveLinear in Graph for feasibility 12.21/12.26 It's unfeasible. Removing transition: 12.21/12.26 -1 + arg1, rest remain the same}> 12.21/12.26 [ Termination Graph ] 12.21/12.26 Strengthening and disabling transitions... 12.21/12.26 > It's unfeasible. Removing transition: 12.21/12.26 5, rest remain the same}> 12.21/12.26 New Graphs: 12.21/12.26 Calling Safety with literal arg1 <= 0 and entry 12.21/12.26 12.21/12.26 LOG: CALL check - Post:arg1 <= 0 - Process 1 12.21/12.26 * Exit transition: 12.21/12.26 * Postcondition : arg1 <= 0 12.21/12.26 12.21/12.26 LOG: CALL solveLinear 12.21/12.26 12.21/12.26 LOG: RETURN solveLinear - Elapsed time: 0.000522s 12.21/12.26 > Postcondition is not implied! 12.21/12.26 12.21/12.26 LOG: RETURN check - Elapsed time: 0.000623s 12.21/12.26 INVARIANTS: 12.21/12.26 2: 12.21/12.26 Quasi-INVARIANTS to narrow Graph: 12.21/12.26 2: arg1 <= 0 , 12.21/12.26 Narrowing transition: 12.21/12.26 5, rest remain the same}> 12.21/12.26 12.21/12.26 LOG: Narrow transition size 1 12.21/12.26 Narrowing transition: 12.21/12.26 -1 + arg1, rest remain the same}> 12.21/12.26 12.21/12.26 LOG: Narrow transition size 1 12.21/12.26 Narrowing transition: 12.21/12.26 -1 + arg1, rest remain the same}> 12.21/12.26 12.21/12.26 LOG: Narrow transition size 1 12.21/12.26 invGraph after Narrowing: 12.21/12.26 Transitions: 12.21/12.26 5, rest remain the same}> 12.21/12.26 -1 + arg1, rest remain the same}> 12.21/12.26 -1 + arg1, rest remain the same}> 12.21/12.26 Variables: 12.21/12.26 arg1 12.21/12.26 Checking conditional termination of SCC {l2}... 12.21/12.26 12.21/12.26 LOG: CALL solveLinear 12.21/12.26 12.21/12.26 LOG: RETURN solveLinear - Elapsed time: 0.001063s 12.21/12.26 Ranking function: -1 + arg1 12.21/12.26 New Graphs: 12.21/12.26 Transitions: 12.21/12.26 5, rest remain the same}> 12.21/12.26 Variables: 12.21/12.26 arg1 12.21/12.26 Checking conditional termination of SCC {l2}... 12.21/12.26 12.21/12.26 LOG: CALL solveLinear 12.21/12.26 12.21/12.26 LOG: RETURN solveLinear - Elapsed time: 0.000364s 12.21/12.26 12.21/12.26 LOG: CALL solveLinear 12.21/12.26 12.21/12.26 LOG: RETURN solveLinear - Elapsed time: 0.001027s 12.21/12.26 Trying to remove transition: 5, rest remain the same}> 12.21/12.26 Solving with 1 template(s). 12.21/12.26 12.21/12.26 LOG: CALL solveNonLinearGetFirstSolution 12.21/12.26 12.21/12.26 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.608776s 12.21/12.26 Time used: 0.608633 12.21/12.26 Solving with 1 template(s). 12.21/12.26 12.21/12.26 LOG: CALL solveNonLinearGetFirstSolution 12.21/12.26 12.21/12.26 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.012939s 12.21/12.26 Time used: 0.010084 12.21/12.26 Improving Solution with cost 1 ... 12.21/12.26 12.21/12.26 LOG: CALL solveNonLinearGetNextSolution 12.21/12.26 12.21/12.26 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.025951s 12.21/12.26 Time used: 0.025945 12.21/12.26 12.21/12.26 LOG: SAT solveNonLinear - Elapsed time: 0.038890s 12.21/12.26 Cost: 1; Total time: 0.036029 12.21/12.26 Failed at location 2: arg1 <= 1 12.21/12.26 Before Improving: 12.21/12.26 Quasi-invariant at l2: arg1 <= 1 12.21/12.26 Optimizing invariants... 12.21/12.26 12.21/12.26 LOG: CALL solveLinear 12.21/12.26 12.21/12.26 LOG: RETURN solveLinear - Elapsed time: 0.004809s 12.21/12.26 Quasi-invariant improved 12.21/12.26 12.21/12.26 LOG: CALL solveLinear 12.21/12.26 12.21/12.26 LOG: RETURN solveLinear - Elapsed time: 0.001178s 12.21/12.26 Remaining time after improvement: 0.99736 12.21/12.26 Termination implied by a set of quasi-invariant(s): 12.21/12.26 Quasi-invariant at l2: arg1 <= 2 12.21/12.26 [ Invariant Graph ] 12.21/12.26 Strengthening and disabling transitions... 12.21/12.26 12.21/12.26 LOG: CALL solverLinear in Graph for feasibility 12.21/12.26 12.21/12.26 LOG: RETURN solveLinear in Graph for feasibility 12.21/12.26 It's unfeasible. Removing transition: 12.21/12.26 5, rest remain the same}> 12.21/12.26 12.21/12.26 LOG: CALL solverLinear in Graph for feasibility 12.21/12.26 12.21/12.26 LOG: RETURN solveLinear in Graph for feasibility 12.21/12.26 Strengthening transition (result): 12.21/12.26 -1 + arg1, rest remain the same}> 12.21/12.26 12.21/12.26 LOG: CALL solverLinear in Graph for feasibility 12.21/12.26 12.21/12.26 LOG: RETURN solveLinear in Graph for feasibility 12.21/12.26 It's unfeasible. Removing transition: 12.21/12.26 -1 + arg1, rest remain the same}> 12.21/12.26 [ Termination Graph ] 12.21/12.26 Strengthening and disabling transitions... 12.21/12.26 12.21/12.26 LOG: CALL solverLinear in Graph for feasibility 12.21/12.26 12.21/12.26 LOG: RETURN solveLinear in Graph for feasibility 12.21/12.26 It's unfeasible. Removing transition: 12.21/12.26 5, rest remain the same}> 12.21/12.26 New Graphs: 12.21/12.26 Calling Safety with literal arg1 <= 2 and entry 12.21/12.26 12.21/12.26 LOG: CALL check - Post:arg1 <= 2 - Process 2 12.21/12.26 * Exit transition: 12.21/12.26 * Postcondition : arg1 <= 2 12.21/12.26 12.21/12.26 LOG: CALL solveLinear 12.21/12.26 12.21/12.26 LOG: RETURN solveLinear - Elapsed time: 0.000465s 12.21/12.26 > Postcondition is not implied! 12.21/12.26 12.21/12.26 LOG: RETURN check - Elapsed time: 0.000561s 12.21/12.26 INVARIANTS: 12.21/12.26 2: 12.21/12.26 Quasi-INVARIANTS to narrow Graph: 12.21/12.26 2: arg1 <= 2 , 12.21/12.26 Narrowing transition: 12.21/12.26 5, rest remain the same}> 12.21/12.26 12.21/12.26 LOG: Narrow transition size 1 12.21/12.26 Narrowing transition: 12.21/12.26 -1 + arg1, rest remain the same}> 12.21/12.26 12.21/12.26 LOG: Narrow transition size 1 12.21/12.26 Narrowing transition: 12.21/12.26 -1 + arg1, rest remain the same}> 12.21/12.26 12.21/12.26 LOG: Narrow transition size 1 12.21/12.26 invGraph after Narrowing: 12.21/12.26 Transitions: 12.21/12.26 5, rest remain the same}> 12.21/12.26 -1 + arg1, rest remain the same}> 12.21/12.26 -1 + arg1, rest remain the same}> 12.21/12.26 Variables: 12.21/12.26 arg1 12.21/12.26 Checking conditional termination of SCC {l2}... 12.21/12.26 12.21/12.26 LOG: CALL solveLinear 12.21/12.26 12.21/12.26 LOG: RETURN solveLinear - Elapsed time: 0.001110s 12.21/12.26 Ranking function: -1 + arg1 12.21/12.26 New Graphs: 12.21/12.26 Transitions: 12.21/12.26 5, rest remain the same}> 12.21/12.26 Variables: 12.21/12.26 arg1 12.21/12.26 Checking conditional termination of SCC {l2}... 12.21/12.26 12.21/12.26 LOG: CALL solveLinear 12.21/12.26 12.21/12.26 LOG: RETURN solveLinear - Elapsed time: 0.000376s 12.21/12.26 12.21/12.26 LOG: CALL solveLinear 12.21/12.26 12.21/12.26 LOG: RETURN solveLinear - Elapsed time: 0.001055s 12.21/12.26 Trying to remove transition: 5, rest remain the same}> 12.21/12.26 Solving with 1 template(s). 12.21/12.26 12.21/12.26 LOG: CALL solveNonLinearGetFirstSolution 12.21/12.26 12.21/12.26 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.612071s 12.21/12.26 Time used: 0.611799 12.21/12.26 Solving with 1 template(s). 12.21/12.26 12.21/12.26 LOG: CALL solveNonLinearGetFirstSolution 12.21/12.26 12.21/12.26 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.055802s 12.21/12.26 Time used: 0.053079 12.21/12.26 Improving Solution with cost 1 ... 12.21/12.26 12.21/12.26 LOG: CALL solveNonLinearGetNextSolution 12.21/12.26 12.21/12.26 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.059997s 12.21/12.26 Time used: 0.059991 12.21/12.26 12.21/12.26 LOG: SAT solveNonLinear - Elapsed time: 0.115799s 12.21/12.26 Cost: 1; Total time: 0.11307 12.21/12.26 Failed at location 2: arg1 <= 4 12.21/12.26 Before Improving: 12.21/12.26 Quasi-invariant at l2: arg1 <= 4 12.21/12.26 Optimizing invariants... 12.21/12.26 12.21/12.26 LOG: CALL solveLinear 12.21/12.26 12.21/12.26 LOG: RETURN solveLinear - Elapsed time: 0.005193s 12.21/12.26 Remaining time after improvement: 0.998715 12.21/12.26 Termination implied by a set of quasi-invariant(s): 12.21/12.26 Quasi-invariant at l2: arg1 <= 4 12.21/12.26 [ Invariant Graph ] 12.21/12.26 Strengthening and disabling transitions... 12.21/12.26 12.21/12.26 LOG: CALL solverLinear in Graph for feasibility 12.21/12.26 12.21/12.26 LOG: RETURN solveLinear in Graph for feasibility 12.21/12.26 It's unfeasible. Removing transition: 12.21/12.26 5, rest remain the same}> 12.21/12.26 12.21/12.26 LOG: CALL solverLinear in Graph for feasibility 12.21/12.26 12.21/12.26 LOG: RETURN solveLinear in Graph for feasibility 12.21/12.26 Strengthening transition (result): 12.21/12.26 -1 + arg1, rest remain the same}> 12.21/12.26 12.21/12.26 LOG: CALL solverLinear in Graph for feasibility 12.21/12.26 12.21/12.26 LOG: RETURN solveLinear in Graph for feasibility 12.21/12.26 It's unfeasible. Removing transition: 12.21/12.26 -1 + arg1, rest remain the same}> 12.21/12.26 [ Termination Graph ] 12.21/12.26 Strengthening and disabling transitions... 12.21/12.26 12.21/12.26 LOG: CALL solverLinear in Graph for feasibility 12.21/12.26 12.21/12.26 LOG: RETURN solveLinear in Graph for feasibility 12.21/12.26 It's unfeasible. Removing transition: 12.21/12.26 5, rest remain the same}> 12.21/12.26 New Graphs: 12.21/12.26 Calling Safety with literal arg1 <= 4 and entry 12.21/12.26 12.21/12.26 LOG: CALL check - Post:arg1 <= 4 - Process 3 12.21/12.26 * Exit transition: 12.21/12.26 * Postcondition : arg1 <= 4 12.21/12.26 12.21/12.26 LOG: CALL solveLinear 12.21/12.26 12.21/12.26 LOG: RETURN solveLinear - Elapsed time: 0.000501s 12.21/12.26 > Postcondition is not implied! 12.21/12.26 12.21/12.26 LOG: RETURN check - Elapsed time: 0.000598s 12.21/12.26 INVARIANTS: 12.21/12.26 2: 12.21/12.26 Quasi-INVARIANTS to narrow Graph: 12.21/12.26 2: arg1 <= 4 , 12.21/12.26 Narrowing transition: 12.21/12.26 5, rest remain the same}> 12.21/12.26 12.21/12.26 LOG: Narrow transition size 1 12.21/12.26 It's unfeasible. Removing transition: 12.21/12.26 -1 + arg1, rest remain the same}> 12.21/12.26 Narrowing transition: 12.21/12.26 -1 + arg1, rest remain the same}> 12.21/12.26 12.21/12.26 LOG: Narrow transition size 1 12.21/12.26 invGraph after Narrowing: 12.21/12.26 Transitions: 12.21/12.26 5, rest remain the same}> 12.21/12.26 -1 + arg1, rest remain the same}> 12.21/12.26 Variables: 12.21/12.26 arg1 12.21/12.26 Checking conditional termination of SCC {l2}... 12.21/12.26 12.21/12.26 LOG: CALL solveLinear 12.21/12.26 12.21/12.26 LOG: RETURN solveLinear - Elapsed time: 0.000835s 12.21/12.26 Ranking function: -5 + arg1 12.21/12.26 New Graphs: 12.21/12.26 Transitions: 12.21/12.26 5, rest remain the same}> 12.21/12.26 Variables: 12.21/12.26 arg1 12.21/12.26 Checking conditional termination of SCC {l2}... 12.21/12.26 12.21/12.26 LOG: CALL solveLinear 12.21/12.26 12.21/12.26 LOG: RETURN solveLinear - Elapsed time: 0.000372s 12.21/12.26 12.21/12.26 LOG: CALL solveLinear 12.21/12.26 12.21/12.26 LOG: RETURN solveLinear - Elapsed time: 0.001058s 12.21/12.26 Trying to remove transition: 5, rest remain the same}> 12.21/12.26 Solving with 1 template(s). 12.21/12.26 12.21/12.26 LOG: CALL solveNonLinearGetFirstSolution 12.21/12.26 12.21/12.26 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.616324s 12.21/12.26 Time used: 0.616166 12.21/12.26 Solving with 1 template(s). 12.21/12.26 12.21/12.26 LOG: CALL solveNonLinearGetFirstSolution 12.21/12.26 12.21/12.26 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.004014s 12.21/12.26 Time used: 4.00086 12.21/12.26 Solving with 2 template(s). 12.21/12.26 12.21/12.26 LOG: CALL solveNonLinearGetFirstSolution 12.21/12.26 12.21/12.26 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.006691s 12.21/12.26 Time used: 4.00135 12.21/12.26 Solving with 3 template(s). 12.21/12.26 12.21/12.26 LOG: CALL solveNonLinearGetFirstSolution 12.21/12.26 12.21/12.26 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.010245s 12.21/12.26 Time used: 1.00067 12.21/12.26 Solving with 1 template(s). 12.21/12.26 12.21/12.26 LOG: CALL solveNonLinearGetFirstSolution 12.21/12.26 12.21/12.26 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.417430s 12.21/12.26 Time used: 0.410902 12.21/12.26 12.21/12.26 Proving non-termination of subgraph 1 12.21/12.26 Transitions: 12.21/12.26 5, rest remain the same}> 12.21/12.26 -1 + arg1, rest remain the same}> 12.21/12.26 Variables: 12.21/12.26 arg1 12.21/12.26 12.21/12.26 Checking conditional non-termination of SCC {l2}... 12.21/12.26 EXIT TRANSITIONS: 12.21/12.26 12.21/12.26 12.21/12.26 Solving with 1 template(s). 12.21/12.26 12.21/12.26 LOG: CALL solveNonLinearGetFirstSolution 12.21/12.26 12.21/12.26 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.025870s 12.21/12.26 Time used: 0.025697 12.21/12.26 Improving Solution with cost 1 ... 12.21/12.26 12.21/12.26 LOG: CALL solveNonLinearGetNextSolution 12.21/12.26 12.21/12.26 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.008623s 12.21/12.26 Time used: 0.008614 12.21/12.26 12.21/12.26 LOG: SAT solveNonLinear - Elapsed time: 0.034493s 12.21/12.26 Cost: 1; Total time: 0.034311 12.21/12.26 Failed at location 2: 5 <= arg1 12.21/12.26 Before Improving: 12.21/12.26 Quasi-invariant at l2: 5 <= arg1 12.21/12.26 Optimizing invariants... 12.21/12.26 12.21/12.26 LOG: CALL solveLinear 12.21/12.26 12.21/12.26 LOG: RETURN solveLinear - Elapsed time: 0.002217s 12.21/12.26 Remaining time after improvement: 0.99903 12.21/12.26 Non-termination implied by a set of quasi-invariant(s): 12.21/12.26 Quasi-invariant at l2: 5 <= arg1 12.21/12.26 12.21/12.26 Strengthening and disabling EXIT transitions... 12.21/12.26 Closed exits from l2: 1 12.21/12.26 12.21/12.26 Strengthening and disabling transitions... 12.21/12.26 12.21/12.26 LOG: CALL solverLinear in Graph for feasibility 12.21/12.26 12.21/12.26 LOG: RETURN solveLinear in Graph for feasibility 12.21/12.26 Strengthening transition (result): 12.21/12.26 5, rest remain the same}> 12.21/12.26 12.21/12.26 LOG: CALL solverLinear in Graph for feasibility 12.21/12.26 12.21/12.26 LOG: RETURN solveLinear in Graph for feasibility 12.21/12.26 Strengthening transition (result): 12.21/12.26 -1 + arg1, rest remain the same}> 12.21/12.26 12.21/12.26 Calling reachability with... 12.21/12.26 Transition: 12.21/12.26 Conditions: 5 <= arg1, 12.21/12.26 OPEN EXITS: 12.21/12.26 12.21/12.26 12.21/12.26 --- Reachability graph --- 12.21/12.26 > Graph without transitions. 12.21/12.26 12.21/12.26 Calling reachability with... 12.21/12.26 Transition: 12.21/12.26 Conditions: 5 <= arg1, 12.21/12.26 OPEN EXITS: 12.21/12.26 12.21/12.26 12.21/12.26 > Conditions are reachable! 12.21/12.26 12.21/12.26 Program does NOT terminate 12.21/12.26 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found 12.21/12.26 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found 12.21/12.26 EOF