49.49/49.57 NO 49.49/49.57 49.49/49.57 Solver Timeout: 4 49.49/49.57 Global Timeout: 300 49.49/49.57 No parsing errors! 49.49/49.57 Init Location: 0 49.49/49.57 Transitions: 49.49/49.57 49.49/49.57 0) /\ (arg2 > ~(1)), par{arg1 -> arg2, arg2 -> undef2}> 49.49/49.57 10), par{arg1 -> (arg1 - 1), arg2 -> undef4}> 49.49/49.57 25), par{arg1 -> (arg1 - 1), arg2 -> undef6}> 49.49/49.57 29, arg2 -> undef8}> 49.49/49.57 30), par{arg1 -> 20, arg2 -> undef10}> 49.49/49.57 undef11, arg2 -> undef12}> 49.49/49.57 49.49/49.57 Fresh variables: 49.49/49.57 undef2, undef4, undef6, undef8, undef10, undef11, undef12, 49.49/49.57 49.49/49.57 Undef variables: 49.49/49.57 undef2, undef4, undef6, undef8, undef10, undef11, undef12, 49.49/49.57 49.49/49.57 Abstraction variables: 49.49/49.57 49.49/49.57 Exit nodes: 49.49/49.57 49.49/49.57 Accepting locations: 49.49/49.57 49.49/49.57 Asserts: 49.49/49.57 49.49/49.57 Preprocessed LLVMGraph 49.49/49.57 Init Location: 0 49.49/49.57 Transitions: 49.49/49.57 0) /\ (undef12 > ~(1))> 49.49/49.57 10), par{arg1 -> (arg1 - 1)}> 49.49/49.57 25), par{arg1 -> (arg1 - 1)}> 49.49/49.57 29}> 49.49/49.57 30), par{arg1 -> 20}> 49.49/49.57 49.49/49.57 Fresh variables: 49.49/49.57 undef2, undef4, undef6, undef8, undef10, undef11, undef12, 49.49/49.57 49.49/49.57 Undef variables: 49.49/49.57 undef2, undef4, undef6, undef8, undef10, undef11, undef12, 49.49/49.57 49.49/49.57 Abstraction variables: 49.49/49.57 49.49/49.57 Exit nodes: 49.49/49.57 49.49/49.57 Accepting locations: 49.49/49.57 49.49/49.57 Asserts: 49.49/49.57 49.49/49.57 ************************************************************* 49.49/49.57 ******************************************************************************************* 49.49/49.57 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 49.49/49.57 ******************************************************************************************* 49.49/49.57 49.49/49.57 Init Location: 0 49.49/49.57 Graph 0: 49.49/49.57 Transitions: 49.49/49.57 Variables: 49.49/49.57 49.49/49.57 Graph 1: 49.49/49.57 Transitions: 49.49/49.57 -1 + arg1, rest remain the same}> 49.49/49.57 -1 + arg1, rest remain the same}> 49.49/49.57 29, rest remain the same}> 49.49/49.57 20, rest remain the same}> 49.49/49.57 Variables: 49.49/49.57 arg1 49.49/49.57 49.49/49.57 Precedence: 49.49/49.57 Graph 0 49.49/49.57 49.49/49.57 Graph 1 49.49/49.57 49.49/49.57 49.49/49.57 Map Locations to Subgraph: 49.49/49.57 ( 0 , 0 ) 49.49/49.57 ( 2 , 1 ) 49.49/49.57 49.49/49.57 ******************************************************************************************* 49.49/49.57 ******************************** CHECKING ASSERTIONS ******************************** 49.49/49.57 ******************************************************************************************* 49.49/49.57 49.49/49.57 Proving termination of subgraph 0 49.49/49.57 Proving termination of subgraph 1 49.49/49.57 Checking unfeasibility... 49.49/49.57 Time used: 0.007629 49.49/49.57 49.49/49.57 Checking conditional termination of SCC {l2}... 49.49/49.57 49.49/49.57 LOG: CALL solveLinear 49.49/49.57 49.49/49.57 LOG: RETURN solveLinear - Elapsed time: 0.001479s 49.49/49.57 49.49/49.57 LOG: CALL solveLinear 49.49/49.57 49.49/49.57 LOG: RETURN solveLinear - Elapsed time: 0.007554s 49.49/49.57 Piecewise ranking function: min(-418 + 38*arg1,532) 49.49/49.57 New Graphs: 49.49/49.57 Transitions: 49.49/49.57 -1 + arg1, rest remain the same}> 49.49/49.57 29, rest remain the same}> 49.49/49.57 Variables: 49.49/49.57 arg1 49.49/49.57 Checking conditional termination of SCC {l2}... 49.49/49.57 49.49/49.57 LOG: CALL solveLinear 49.49/49.57 49.49/49.57 LOG: RETURN solveLinear - Elapsed time: 0.000700s 49.49/49.57 49.49/49.57 LOG: CALL solveLinear 49.49/49.57 49.49/49.57 LOG: RETURN solveLinear - Elapsed time: 0.010355s 49.49/49.57 Trying to remove transition: 29, rest remain the same}> 49.49/49.57 Solving with 1 template(s). 49.49/49.57 49.49/49.57 LOG: CALL solveNonLinearGetFirstSolution 49.49/49.57 49.49/49.57 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.001566s 49.49/49.57 Time used: 4.00092 49.49/49.57 Trying to remove transition: -1 + arg1, rest remain the same}> 49.49/49.57 Solving with 1 template(s). 49.49/49.57 49.49/49.57 LOG: CALL solveNonLinearGetFirstSolution 49.49/49.57 49.49/49.57 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.049158s 49.49/49.57 Time used: 4.0016 49.49/49.57 Solving with 1 template(s). 49.49/49.57 49.49/49.57 LOG: CALL solveNonLinearGetFirstSolution 49.49/49.57 49.49/49.57 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.024385s 49.49/49.57 Time used: 0.019581 49.49/49.57 Improving Solution with cost 1 ... 49.49/49.57 49.49/49.57 LOG: CALL solveNonLinearGetNextSolution 49.49/49.57 49.49/49.57 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.091644s 49.49/49.57 Time used: 0.091635 49.49/49.57 49.49/49.57 LOG: SAT solveNonLinear - Elapsed time: 0.116030s 49.49/49.57 Cost: 1; Total time: 0.111216 49.49/49.57 Failed at location 2: arg1 <= 1 49.49/49.57 Before Improving: 49.49/49.57 Quasi-invariant at l2: arg1 <= 1 49.49/49.57 Optimizing invariants... 49.49/49.57 49.49/49.57 LOG: CALL solveLinear 49.49/49.57 49.49/49.57 LOG: RETURN solveLinear - Elapsed time: 0.014063s 49.49/49.57 Quasi-invariant improved 49.49/49.57 49.49/49.57 LOG: CALL solveLinear 49.49/49.57 49.49/49.57 LOG: RETURN solveLinear - Elapsed time: 0.002481s 49.49/49.57 Quasi-invariant improved 49.49/49.57 49.49/49.57 LOG: CALL solveLinear 49.49/49.57 49.49/49.57 LOG: RETURN solveLinear - Elapsed time: 0.002381s 49.49/49.57 Quasi-invariant improved 49.49/49.57 49.49/49.57 LOG: CALL solveLinear 49.49/49.57 49.49/49.57 LOG: RETURN solveLinear - Elapsed time: 0.002362s 49.49/49.57 Quasi-invariant improved 49.49/49.57 49.49/49.57 LOG: CALL solveLinear 49.49/49.57 49.49/49.57 LOG: RETURN solveLinear - Elapsed time: 0.002354s 49.49/49.57 Quasi-invariant improved 49.49/49.57 49.49/49.57 LOG: CALL solveLinear 49.49/49.57 49.49/49.57 LOG: RETURN solveLinear - Elapsed time: 0.002435s 49.49/49.57 Quasi-invariant improved 49.49/49.57 49.49/49.57 LOG: CALL solveLinear 49.49/49.57 49.49/49.57 LOG: RETURN solveLinear - Elapsed time: 0.002353s 49.49/49.57 Quasi-invariant improved 49.49/49.57 49.49/49.57 LOG: CALL solveLinear 49.49/49.57 49.49/49.57 LOG: RETURN solveLinear - Elapsed time: 0.002349s 49.49/49.57 Quasi-invariant improved 49.49/49.57 49.49/49.57 LOG: CALL solveLinear 49.49/49.57 49.49/49.57 LOG: RETURN solveLinear - Elapsed time: 0.002344s 49.49/49.57 Quasi-invariant improved 49.49/49.57 49.49/49.57 LOG: CALL solveLinear 49.49/49.57 49.49/49.57 LOG: RETURN solveLinear - Elapsed time: 0.002333s 49.49/49.57 Quasi-invariant improved 49.49/49.57 49.49/49.57 LOG: CALL solveLinear 49.49/49.57 49.49/49.57 LOG: RETURN solveLinear - Elapsed time: 0.002350s 49.49/49.57 Quasi-invariant improved 49.49/49.57 49.49/49.57 LOG: CALL solveLinear 49.49/49.57 49.49/49.57 LOG: RETURN solveLinear - Elapsed time: 0.002343s 49.49/49.57 Quasi-invariant improved 49.49/49.57 49.49/49.57 LOG: CALL solveLinear 49.49/49.57 49.49/49.57 LOG: RETURN solveLinear - Elapsed time: 0.002335s 49.49/49.57 Quasi-invariant improved 49.49/49.57 49.49/49.57 LOG: CALL solveLinear 49.49/49.57 49.49/49.57 LOG: RETURN solveLinear - Elapsed time: 0.002352s 49.49/49.57 Quasi-invariant improved 49.49/49.57 49.49/49.57 LOG: CALL solveLinear 49.49/49.57 49.49/49.57 LOG: RETURN solveLinear - Elapsed time: 0.001837s 49.49/49.57 Remaining time after improvement: 0.967377 49.49/49.57 Termination implied by a set of quasi-invariant(s): 49.49/49.57 Quasi-invariant at l2: arg1 <= 15 49.49/49.57 [ Invariant Graph ] 49.49/49.57 Strengthening and disabling transitions... 49.49/49.57 49.49/49.57 LOG: CALL solverLinear in Graph for feasibility 49.49/49.57 49.49/49.57 LOG: RETURN solveLinear in Graph for feasibility 49.49/49.57 Strengthening transition (result): 49.49/49.57 -1 + arg1, rest remain the same}> 49.49/49.57 49.49/49.57 LOG: CALL solverLinear in Graph for feasibility 49.49/49.57 49.49/49.57 LOG: RETURN solveLinear in Graph for feasibility 49.49/49.57 It's unfeasible. Removing transition: 49.49/49.57 -1 + arg1, rest remain the same}> 49.49/49.57 49.49/49.57 LOG: CALL solverLinear in Graph for feasibility 49.49/49.57 49.49/49.57 LOG: RETURN solveLinear in Graph for feasibility 49.49/49.57 It's unfeasible. Removing transition: 49.49/49.57 29, rest remain the same}> 49.49/49.57 49.49/49.57 LOG: CALL solverLinear in Graph for feasibility 49.49/49.57 49.49/49.57 LOG: RETURN solveLinear in Graph for feasibility 49.49/49.57 It's unfeasible. Removing transition: 49.49/49.57 20, rest remain the same}> 49.49/49.57 [ Termination Graph ] 49.49/49.57 Strengthening and disabling transitions... 49.49/49.57 49.49/49.57 LOG: CALL solverLinear in Graph for feasibility 49.49/49.57 49.49/49.57 LOG: RETURN solveLinear in Graph for feasibility 49.49/49.57 It's unfeasible. Removing transition: 49.49/49.57 -1 + arg1, rest remain the same}> 49.49/49.57 49.49/49.57 LOG: CALL solverLinear in Graph for feasibility 49.49/49.57 49.49/49.57 LOG: RETURN solveLinear in Graph for feasibility 49.49/49.57 It's unfeasible. Removing transition: 49.49/49.57 29, rest remain the same}> 49.49/49.57 New Graphs: 49.49/49.57 Calling Safety with literal arg1 <= 15 and entry 49.49/49.57 49.49/49.57 LOG: CALL check - Post:arg1 <= 15 - Process 1 49.49/49.57 * Exit transition: 49.49/49.57 * Postcondition : arg1 <= 15 49.49/49.57 49.49/49.57 LOG: CALL solveLinear 49.49/49.57 49.49/49.57 LOG: RETURN solveLinear - Elapsed time: 0.000586s 49.49/49.57 > Postcondition is not implied! 49.49/49.57 49.49/49.57 LOG: RETURN check - Elapsed time: 0.000680s 49.49/49.57 INVARIANTS: 49.49/49.57 2: 49.49/49.57 Quasi-INVARIANTS to narrow Graph: 49.49/49.57 2: arg1 <= 15 , 49.49/49.57 Narrowing transition: 49.49/49.57 -1 + arg1, rest remain the same}> 49.49/49.57 49.49/49.57 LOG: Narrow transition size 1 49.49/49.57 Narrowing transition: 49.49/49.57 -1 + arg1, rest remain the same}> 49.49/49.57 49.49/49.57 LOG: Narrow transition size 1 49.49/49.57 Narrowing transition: 49.49/49.57 29, rest remain the same}> 49.49/49.57 49.49/49.57 LOG: Narrow transition size 1 49.49/49.57 Narrowing transition: 49.49/49.57 20, rest remain the same}> 49.49/49.57 49.49/49.57 LOG: Narrow transition size 1 49.49/49.57 invGraph after Narrowing: 49.49/49.57 Transitions: 49.49/49.57 -1 + arg1, rest remain the same}> 49.49/49.57 -1 + arg1, rest remain the same}> 49.49/49.57 29, rest remain the same}> 49.49/49.57 20, rest remain the same}> 49.49/49.57 Variables: 49.49/49.57 arg1 49.49/49.57 Checking conditional termination of SCC {l2}... 49.49/49.57 49.49/49.57 LOG: CALL solveLinear 49.49/49.57 49.49/49.57 LOG: RETURN solveLinear - Elapsed time: 0.001361s 49.49/49.57 49.49/49.57 LOG: CALL solveLinear 49.49/49.57 49.49/49.57 LOG: RETURN solveLinear - Elapsed time: 0.008636s 49.49/49.57 Piecewise ranking function: min(-528 + 33*arg1,297) 49.49/49.57 New Graphs: 49.49/49.57 Transitions: 49.49/49.57 -1 + arg1, rest remain the same}> 49.49/49.57 29, rest remain the same}> 49.49/49.57 Variables: 49.49/49.57 arg1 49.49/49.57 Checking conditional termination of SCC {l2}... 49.49/49.57 49.49/49.57 LOG: CALL solveLinear 49.49/49.57 49.49/49.57 LOG: RETURN solveLinear - Elapsed time: 0.000770s 49.49/49.57 49.49/49.57 LOG: CALL solveLinear 49.49/49.57 49.49/49.57 LOG: RETURN solveLinear - Elapsed time: 0.010435s 49.49/49.57 Trying to remove transition: 29, rest remain the same}> 49.49/49.57 Solving with 1 template(s). 49.49/49.57 49.49/49.57 LOG: CALL solveNonLinearGetFirstSolution 49.49/49.57 49.49/49.57 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.002774s 49.49/49.57 Time used: 4.00216 49.49/49.57 Trying to remove transition: -1 + arg1, rest remain the same}> 49.49/49.57 Solving with 1 template(s). 49.49/49.57 49.49/49.57 LOG: CALL solveNonLinearGetFirstSolution 49.49/49.57 49.49/49.57 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.049437s 49.49/49.57 Time used: 4.00199 49.49/49.57 Solving with 1 template(s). 49.49/49.57 49.49/49.57 LOG: CALL solveNonLinearGetFirstSolution 49.49/49.57 49.49/49.57 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.793377s 49.49/49.57 Time used: 0.788138 49.49/49.57 Improving Solution with cost 1 ... 49.49/49.57 49.49/49.57 LOG: CALL solveNonLinearGetNextSolution 49.49/49.57 49.49/49.57 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.035467s 49.49/49.57 Time used: 1.0354 49.49/49.57 49.49/49.57 LOG: SAT solveNonLinear - Elapsed time: 1.828844s 49.49/49.57 Cost: 1; Total time: 1.82354 49.49/49.57 Failed at location 2: arg1 <= 24 49.49/49.57 Before Improving: 49.49/49.57 Quasi-invariant at l2: arg1 <= 24 49.49/49.57 Optimizing invariants... 49.49/49.57 49.49/49.57 LOG: CALL solveLinear 49.49/49.57 49.49/49.57 LOG: RETURN solveLinear - Elapsed time: 0.032365s 49.49/49.57 Remaining time after improvement: 0.997783 49.49/49.57 Termination implied by a set of quasi-invariant(s): 49.49/49.57 Quasi-invariant at l2: arg1 <= 24 49.49/49.57 [ Invariant Graph ] 49.49/49.57 Strengthening and disabling transitions... 49.49/49.57 49.49/49.57 LOG: CALL solverLinear in Graph for feasibility 49.49/49.57 49.49/49.57 LOG: RETURN solveLinear in Graph for feasibility 49.49/49.57 Strengthening transition (result): 49.49/49.57 -1 + arg1, rest remain the same}> 49.49/49.57 49.49/49.57 LOG: CALL solverLinear in Graph for feasibility 49.49/49.57 49.49/49.57 LOG: RETURN solveLinear in Graph for feasibility 49.49/49.57 It's unfeasible. Removing transition: 49.49/49.57 -1 + arg1, rest remain the same}> 49.49/49.57 49.49/49.57 LOG: CALL solverLinear in Graph for feasibility 49.49/49.57 49.49/49.57 LOG: RETURN solveLinear in Graph for feasibility 49.49/49.57 It's unfeasible. Removing transition: 49.49/49.57 29, rest remain the same}> 49.49/49.57 49.49/49.57 LOG: CALL solverLinear in Graph for feasibility 49.49/49.57 49.49/49.57 LOG: RETURN solveLinear in Graph for feasibility 49.49/49.57 It's unfeasible. Removing transition: 49.49/49.57 20, rest remain the same}> 49.49/49.57 [ Termination Graph ] 49.49/49.57 Strengthening and disabling transitions... 49.49/49.57 > It's unfeasible. Removing transition: 49.49/49.57 -1 + arg1, rest remain the same}> 49.49/49.57 49.49/49.57 LOG: CALL solverLinear in Graph for feasibility 49.49/49.57 49.49/49.57 LOG: RETURN solveLinear in Graph for feasibility 49.49/49.57 It's unfeasible. Removing transition: 49.49/49.57 29, rest remain the same}> 49.49/49.57 New Graphs: 49.49/49.57 Calling Safety with literal arg1 <= 24 and entry 49.49/49.57 49.49/49.57 LOG: CALL check - Post:arg1 <= 24 - Process 2 49.49/49.57 * Exit transition: 49.49/49.57 * Postcondition : arg1 <= 24 49.49/49.57 49.49/49.57 LOG: CALL solveLinear 49.49/49.57 49.49/49.57 LOG: RETURN solveLinear - Elapsed time: 0.000611s 49.49/49.57 > Postcondition is not implied! 49.49/49.57 49.49/49.57 LOG: RETURN check - Elapsed time: 0.000709s 49.49/49.57 INVARIANTS: 49.49/49.57 2: 49.49/49.57 Quasi-INVARIANTS to narrow Graph: 49.49/49.57 2: arg1 <= 24 , 49.49/49.57 It's unfeasible. Removing transition: 49.49/49.57 -1 + arg1, rest remain the same}> 49.49/49.57 Narrowing transition: 49.49/49.57 -1 + arg1, rest remain the same}> 49.49/49.57 49.49/49.57 LOG: Narrow transition size 1 49.49/49.57 Narrowing transition: 49.49/49.57 29, rest remain the same}> 49.49/49.57 49.49/49.57 LOG: Narrow transition size 1 49.49/49.57 It's unfeasible. Removing transition: 49.49/49.57 20, rest remain the same}> 49.49/49.57 invGraph after Narrowing: 49.49/49.57 Transitions: 49.49/49.57 -1 + arg1, rest remain the same}> 49.49/49.57 29, rest remain the same}> 49.49/49.57 Variables: 49.49/49.57 arg1 49.49/49.57 Checking conditional termination of SCC {l2}... 49.49/49.57 49.49/49.57 LOG: CALL solveLinear 49.49/49.57 49.49/49.57 LOG: RETURN solveLinear - Elapsed time: 0.000823s 49.49/49.57 49.49/49.57 LOG: CALL solveLinear 49.49/49.57 49.49/49.57 LOG: RETURN solveLinear - Elapsed time: 0.010643s 49.49/49.57 Trying to remove transition: 29, rest remain the same}> 49.49/49.57 Solving with 1 template(s). 49.49/49.57 49.49/49.57 LOG: CALL solveNonLinearGetFirstSolution 49.49/49.57 49.49/49.57 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.005369s 49.49/49.57 Time used: 4.00473 49.49/49.57 Trying to remove transition: -1 + arg1, rest remain the same}> 49.49/49.57 Solving with 1 template(s). 49.49/49.57 49.49/49.57 LOG: CALL solveNonLinearGetFirstSolution 49.49/49.57 49.49/49.57 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.101908s 49.49/49.57 Time used: 4.00242 49.49/49.57 Solving with 1 template(s). 49.49/49.57 49.49/49.57 LOG: CALL solveNonLinearGetFirstSolution 49.49/49.57 49.49/49.57 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.747257s 49.49/49.57 Time used: 0.741328 49.49/49.57 Improving Solution with cost 1 ... 49.49/49.57 49.49/49.57 LOG: CALL solveNonLinearGetNextSolution 49.49/49.57 49.49/49.57 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.046277s 49.49/49.57 Time used: 1.0454 49.49/49.57 49.49/49.57 LOG: SAT solveNonLinear - Elapsed time: 1.793534s 49.49/49.57 Cost: 1; Total time: 1.78673 49.49/49.57 Failed at location 2: 31 <= arg1 49.49/49.57 Before Improving: 49.49/49.57 Quasi-invariant at l2: 31 <= arg1 49.49/49.57 Optimizing invariants... 49.49/49.57 49.49/49.57 LOG: CALL solveLinear 49.49/49.57 49.49/49.57 LOG: RETURN solveLinear - Elapsed time: 0.026654s 49.49/49.57 Remaining time after improvement: 0.997878 49.49/49.57 Termination implied by a set of quasi-invariant(s): 49.49/49.57 Quasi-invariant at l2: 31 <= arg1 49.49/49.57 [ Invariant Graph ] 49.49/49.57 Strengthening and disabling transitions... 49.49/49.57 49.49/49.57 LOG: CALL solverLinear in Graph for feasibility 49.49/49.57 49.49/49.57 LOG: RETURN solveLinear in Graph for feasibility 49.49/49.57 It's unfeasible. Removing transition: 49.49/49.57 -1 + arg1, rest remain the same}> 49.49/49.57 49.49/49.57 LOG: CALL solverLinear in Graph for feasibility 49.49/49.57 49.49/49.57 LOG: RETURN solveLinear in Graph for feasibility 49.49/49.57 It's unfeasible. Removing transition: 49.49/49.57 29, rest remain the same}> 49.49/49.57 [ Termination Graph ] 49.49/49.57 Strengthening and disabling transitions... 49.49/49.57 49.49/49.57 LOG: CALL solverLinear in Graph for feasibility 49.49/49.57 49.49/49.57 LOG: RETURN solveLinear in Graph for feasibility 49.49/49.57 It's unfeasible. Removing transition: 49.49/49.57 -1 + arg1, rest remain the same}> 49.49/49.57 49.49/49.57 LOG: CALL solverLinear in Graph for feasibility 49.49/49.57 49.49/49.57 LOG: RETURN solveLinear in Graph for feasibility 49.49/49.57 It's unfeasible. Removing transition: 49.49/49.57 29, rest remain the same}> 49.49/49.57 New Graphs: 49.49/49.57 Calling Safety with literal 31 <= arg1 and entry 49.49/49.57 49.49/49.57 LOG: CALL check - Post:31 <= arg1 - Process 3 49.49/49.57 * Exit transition: 49.49/49.57 * Postcondition : 31 <= arg1 49.49/49.57 49.49/49.57 LOG: CALL solveLinear 49.49/49.57 49.49/49.57 LOG: RETURN solveLinear - Elapsed time: 0.001600s 49.49/49.57 > Postcondition is not implied! 49.49/49.57 49.49/49.57 LOG: RETURN check - Elapsed time: 0.001701s 49.49/49.57 INVARIANTS: 49.49/49.57 2: 49.49/49.57 Quasi-INVARIANTS to narrow Graph: 49.49/49.57 2: 31 <= arg1 , 49.49/49.57 Narrowing transition: 49.49/49.57 -1 + arg1, rest remain the same}> 49.49/49.57 49.49/49.57 LOG: Narrow transition size 1 49.49/49.57 Narrowing transition: 49.49/49.57 29, rest remain the same}> 49.49/49.57 49.49/49.57 LOG: Narrow transition size 1 49.49/49.57 invGraph after Narrowing: 49.49/49.57 Transitions: 49.49/49.57 -1 + arg1, rest remain the same}> 49.49/49.57 29, rest remain the same}> 49.49/49.57 Variables: 49.49/49.57 arg1 49.49/49.57 Checking conditional termination of SCC {l2}... 49.49/49.57 49.49/49.57 LOG: CALL solveLinear 49.49/49.57 49.49/49.57 LOG: RETURN solveLinear - Elapsed time: 0.000888s 49.49/49.57 49.49/49.57 LOG: CALL solveLinear 49.49/49.57 49.49/49.57 LOG: RETURN solveLinear - Elapsed time: 0.010799s 49.49/49.57 Trying to remove transition: 29, rest remain the same}> 49.49/49.57 Solving with 1 template(s). 49.49/49.57 49.49/49.57 LOG: CALL solveNonLinearGetFirstSolution 49.49/49.57 49.49/49.57 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.007249s 49.49/49.57 Time used: 4.00208 49.49/49.57 Trying to remove transition: -1 + arg1, rest remain the same}> 49.49/49.57 Solving with 1 template(s). 49.49/49.57 49.49/49.57 LOG: CALL solveNonLinearGetFirstSolution 49.49/49.57 49.49/49.57 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.054108s 49.49/49.57 Time used: 4.00294 49.49/49.57 Solving with 1 template(s). 49.49/49.57 49.49/49.57 LOG: CALL solveNonLinearGetFirstSolution 49.49/49.57 49.49/49.57 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.010674s 49.49/49.57 Time used: 4.00544 49.49/49.57 Solving with 2 template(s). 49.49/49.57 49.49/49.57 LOG: CALL solveNonLinearGetFirstSolution 49.49/49.57 49.49/49.57 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.013771s 49.49/49.57 Time used: 4.00217 49.49/49.57 Solving with 3 template(s). 49.49/49.57 49.49/49.57 LOG: CALL solveNonLinearGetFirstSolution 49.49/49.57 49.49/49.57 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.011876s 49.49/49.57 Time used: 1.00132 49.49/49.57 Solving with 1 template(s). 49.49/49.57 49.49/49.57 LOG: CALL solveNonLinearGetFirstSolution 49.49/49.57 49.49/49.57 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.011219s 49.49/49.57 Time used: 4.00268 49.49/49.57 49.49/49.57 Proving non-termination of subgraph 1 49.49/49.57 Transitions: 49.49/49.57 -1 + arg1, rest remain the same}> 49.49/49.57 29, rest remain the same}> 49.49/49.57 Variables: 49.49/49.57 arg1 49.49/49.57 49.49/49.57 Checking conditional non-termination of SCC {l2}... 49.49/49.57 EXIT TRANSITIONS: 49.49/49.57 49.49/49.57 49.49/49.57 49.49/49.57 Solving with 1 template(s). 49.49/49.57 49.49/49.57 LOG: CALL solveNonLinearGetFirstSolution 49.49/49.57 49.49/49.57 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.035090s 49.49/49.57 Time used: 0.034896 49.49/49.57 Improving Solution with cost 2 ... 49.49/49.57 49.49/49.57 LOG: CALL solveNonLinearGetNextSolution 49.49/49.57 49.49/49.57 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.028932s 49.49/49.57 Time used: 0.028922 49.49/49.57 49.49/49.57 LOG: SAT solveNonLinear - Elapsed time: 0.064022s 49.49/49.57 Cost: 2; Total time: 0.063818 49.49/49.57 Failed at location 2: arg1 <= 29 49.49/49.57 Before Improving: 49.49/49.57 Quasi-invariant at l2: arg1 <= 29 49.49/49.57 Optimizing invariants... 49.49/49.57 49.49/49.57 LOG: CALL solveLinear 49.49/49.57 49.49/49.57 LOG: RETURN solveLinear - Elapsed time: 0.007024s 49.49/49.57 Remaining time after improvement: 0.998766 49.49/49.57 Non-termination implied by a set of quasi-invariant(s): 49.49/49.57 Quasi-invariant at l2: arg1 <= 29 49.49/49.57 49.49/49.57 Strengthening and disabling EXIT transitions... 49.49/49.57 Closed exits from l2: 1 49.49/49.57 Strengthening exit transition (result): 49.49/49.57 49.49/49.57 49.49/49.57 Strengthening and disabling transitions... 49.49/49.57 49.49/49.57 LOG: CALL solverLinear in Graph for feasibility 49.49/49.57 49.49/49.57 LOG: RETURN solveLinear in Graph for feasibility 49.49/49.57 Strengthening transition (result): 49.49/49.57 -1 + arg1, rest remain the same}> 49.49/49.57 49.49/49.57 LOG: CALL solverLinear in Graph for feasibility 49.49/49.57 49.49/49.57 LOG: RETURN solveLinear in Graph for feasibility 49.49/49.57 Strengthening transition (result): 49.49/49.57 29, rest remain the same}> 49.49/49.57 49.49/49.57 Checking conditional non-termination of SCC {l2}... 49.49/49.57 EXIT TRANSITIONS: 49.49/49.57 49.49/49.57 49.49/49.57 Solving with 1 template(s). 49.49/49.57 49.49/49.57 LOG: CALL solveNonLinearGetFirstSolution 49.49/49.57 49.49/49.57 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.027226s 49.49/49.57 Time used: 0.027032 49.49/49.57 Improving Solution with cost 1 ... 49.49/49.57 49.49/49.57 LOG: CALL solveNonLinearGetNextSolution 49.49/49.57 49.49/49.57 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.016634s 49.49/49.57 Time used: 0.016609 49.49/49.57 49.49/49.57 LOG: SAT solveNonLinear - Elapsed time: 0.043859s 49.49/49.57 Cost: 1; Total time: 0.043641 49.49/49.57 Failed at location 2: 25 <= arg1 49.49/49.57 Before Improving: 49.49/49.57 Quasi-invariant at l2: 25 <= arg1 49.49/49.57 Optimizing invariants... 49.49/49.57 49.49/49.57 LOG: CALL solveLinear 49.49/49.57 49.49/49.57 LOG: RETURN solveLinear - Elapsed time: 0.005463s 49.49/49.57 Remaining time after improvement: 0.998837 49.49/49.57 Non-termination implied by a set of quasi-invariant(s): 49.49/49.57 Quasi-invariant at l2: 25 <= arg1 49.49/49.57 49.49/49.57 Strengthening and disabling EXIT transitions... 49.49/49.57 Closed exits from l2: 1 49.49/49.57 49.49/49.57 Strengthening and disabling transitions... 49.49/49.57 49.49/49.57 LOG: CALL solverLinear in Graph for feasibility 49.49/49.57 49.49/49.57 LOG: RETURN solveLinear in Graph for feasibility 49.49/49.57 Strengthening transition (result): 49.49/49.57 -1 + arg1, rest remain the same}> 49.49/49.57 49.49/49.57 LOG: CALL solverLinear in Graph for feasibility 49.49/49.57 49.49/49.57 LOG: RETURN solveLinear in Graph for feasibility 49.49/49.57 Strengthening transition (result): 49.49/49.57 29, rest remain the same}> 49.49/49.57 49.49/49.57 Calling reachability with... 49.49/49.57 Transition: 49.49/49.57 Conditions: arg1 <= 29, 25 <= arg1, 49.49/49.57 OPEN EXITS: 49.49/49.57 49.49/49.57 49.49/49.57 --- Reachability graph --- 49.49/49.57 > Graph without transitions. 49.49/49.57 49.49/49.57 Calling reachability with... 49.49/49.57 Transition: 49.49/49.57 Conditions: 25 <= arg1, arg1 <= 29, 49.49/49.57 OPEN EXITS: 49.49/49.57 49.49/49.57 49.49/49.57 > Conditions are reachable! 49.49/49.57 49.49/49.57 Program does NOT terminate 49.49/49.57 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found 49.49/49.57 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found 49.49/49.58 EOF