3.31/3.39 NO 3.31/3.39 3.31/3.39 Solver Timeout: 4 3.31/3.39 Global Timeout: 300 3.31/3.39 No parsing errors! 3.31/3.39 Init Location: 0 3.31/3.39 Transitions: 3.31/3.39 3.31/3.39 0) /\ (arg2 > ~(1)), par{arg1 -> arg2, arg2 -> undef2}> 3.31/3.39 19), par{arg2 -> undef4}> 3.31/3.39 0), par{arg1 -> (arg1 - 1), arg2 -> undef6}> 3.31/3.39 undef8}> 3.31/3.39 10), par{arg1 -> (arg1 + 1), arg2 -> undef10}> 3.31/3.39 39), par{arg1 -> (arg1 + 1), arg2 -> undef12}> 3.31/3.39 28), par{arg2 -> undef14}> 3.31/3.39 undef15, arg2 -> undef16}> 3.31/3.39 3.31/3.39 Fresh variables: 3.31/3.39 undef2, undef4, undef6, undef8, undef10, undef12, undef14, undef15, undef16, 3.31/3.39 3.31/3.39 Undef variables: 3.31/3.39 undef2, undef4, undef6, undef8, undef10, undef12, undef14, undef15, undef16, 3.31/3.39 3.31/3.39 Abstraction variables: 3.31/3.39 3.31/3.39 Exit nodes: 3.31/3.39 3.31/3.39 Accepting locations: 3.31/3.39 3.31/3.39 Asserts: 3.31/3.39 3.31/3.39 Preprocessed LLVMGraph 3.31/3.39 Init Location: 0 3.31/3.39 Transitions: 3.31/3.39 0) /\ (undef16 > ~(1))> 3.31/3.39 19) /\ (arg1 < 29) /\ (arg1 > 10), par{arg1 -> (arg1 + 1)}> 3.31/3.39 19) /\ (arg1 > 39), par{arg1 -> (arg1 + 1)}> 3.31/3.39 19) /\ (arg1 < 40) /\ (arg1 > 28)> 3.31/3.39 0) /\ ((arg1 - 1) < 30) /\ ((arg1 - 1) < 11), par{arg1 -> (arg1 - 1)}> 3.31/3.39 0) /\ ((arg1 - 1) < 29) /\ ((arg1 - 1) > 10), par{arg1 -> ((arg1 - 1) + 1)}> 3.31/3.39 3.31/3.39 Fresh variables: 3.31/3.39 undef2, undef4, undef6, undef8, undef10, undef12, undef14, undef15, undef16, 3.31/3.39 3.31/3.39 Undef variables: 3.31/3.39 undef2, undef4, undef6, undef8, undef10, undef12, undef14, undef15, undef16, 3.31/3.39 3.31/3.39 Abstraction variables: 3.31/3.39 3.31/3.39 Exit nodes: 3.31/3.39 3.31/3.39 Accepting locations: 3.31/3.39 3.31/3.39 Asserts: 3.31/3.39 3.31/3.39 ************************************************************* 3.31/3.39 ******************************************************************************************* 3.31/3.39 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 3.31/3.39 ******************************************************************************************* 3.31/3.39 3.31/3.39 Init Location: 0 3.31/3.39 Graph 0: 3.31/3.39 Transitions: 3.31/3.39 Variables: 3.31/3.39 3.31/3.39 Graph 1: 3.31/3.39 Transitions: 3.31/3.39 1 + arg1, rest remain the same}> 3.31/3.39 1 + arg1, rest remain the same}> 3.31/3.39 3.31/3.39 -1 + arg1, rest remain the same}> 3.31/3.39 3.31/3.39 Variables: 3.31/3.39 arg1 3.31/3.39 3.31/3.39 Precedence: 3.31/3.39 Graph 0 3.31/3.39 3.31/3.39 Graph 1 3.31/3.39 3.31/3.39 3.31/3.39 Map Locations to Subgraph: 3.31/3.39 ( 0 , 0 ) 3.31/3.39 ( 2 , 1 ) 3.31/3.39 3.31/3.39 ******************************************************************************************* 3.31/3.39 ******************************** CHECKING ASSERTIONS ******************************** 3.31/3.39 ******************************************************************************************* 3.31/3.39 3.31/3.39 Proving termination of subgraph 0 3.31/3.39 Proving termination of subgraph 1 3.31/3.39 Checking unfeasibility... 3.31/3.39 Time used: 0.007798 3.31/3.39 3.31/3.39 Checking conditional termination of SCC {l2}... 3.31/3.39 3.31/3.39 LOG: CALL solveLinear 3.31/3.39 3.31/3.39 LOG: RETURN solveLinear - Elapsed time: 0.001321s 3.31/3.39 3.31/3.39 LOG: CALL solveLinear 3.31/3.39 3.31/3.39 LOG: RETURN solveLinear - Elapsed time: 0.039676s 3.31/3.39 Piecewise ranking function: min(370,-37 + 37*arg1) 3.31/3.39 New Graphs: 3.31/3.39 Transitions: 3.31/3.39 1 + arg1, rest remain the same}> 3.31/3.39 1 + arg1, rest remain the same}> 3.31/3.39 3.31/3.39 3.31/3.39 Variables: 3.31/3.39 arg1 3.31/3.39 Checking conditional termination of SCC {l2}... 3.31/3.39 3.31/3.39 LOG: CALL solveLinear 3.31/3.39 3.31/3.39 LOG: RETURN solveLinear - Elapsed time: 0.001033s 3.31/3.39 Ranking function: 98 - 2*arg1 3.31/3.39 New Graphs: 3.31/3.39 Transitions: 3.31/3.39 3.31/3.39 3.31/3.39 Variables: 3.31/3.39 arg1 3.31/3.39 > No variable changes in termination graph. 3.31/3.39 Checking conditional unfeasibility... 3.31/3.39 Calling Safety with literal 40 <= arg1 and entry 3.31/3.39 3.31/3.39 LOG: CALL check - Post:40 <= arg1 - Process 1 3.31/3.39 * Exit transition: 3.31/3.39 * Postcondition : 40 <= arg1 3.31/3.39 Quasi-invariants: 3.31/3.39 Location 2: 40 <= arg1 ; 3.31/3.39 Postcondition: 40 <= arg1 3.31/3.39 3.31/3.39 LOG: CALL check - Post:40 <= arg1 - Process 2 3.31/3.39 * Exit transition: 3.31/3.39 * Postcondition : 40 <= arg1 3.31/3.39 3.31/3.39 LOG: CALL solveLinear 3.31/3.39 3.31/3.39 LOG: RETURN solveLinear - Elapsed time: 0.000498s 3.31/3.39 > Postcondition is not implied! 3.31/3.39 3.31/3.39 LOG: RETURN check - Elapsed time: 0.000589s 3.31/3.39 3.31/3.39 LOG: NarrowEntry size 1 3.31/3.39 Narrowing transition: 3.31/3.39 1 + arg1, rest remain the same}> 3.31/3.39 3.31/3.39 LOG: Narrow transition size 1 3.31/3.39 It's unfeasible. Removing transition: 3.31/3.39 1 + arg1, rest remain the same}> 3.31/3.39 Narrowing transition: 3.31/3.39 3.31/3.39 3.31/3.39 LOG: Narrow transition size 1 3.31/3.39 Narrowing transition: 3.31/3.39 -1 + arg1, rest remain the same}> 3.31/3.39 3.31/3.39 LOG: Narrow transition size 1 3.31/3.39 Narrowing transition: 3.31/3.39 3.31/3.39 3.31/3.39 LOG: Narrow transition size 1 3.31/3.39 ENTRIES: 3.31/3.39 3.31/3.39 END ENTRIES: 3.31/3.39 GRAPH: 3.31/3.39 1 + arg1, rest remain the same}> 3.31/3.39 3.31/3.39 -1 + arg1, rest remain the same}> 3.31/3.39 3.31/3.39 END GRAPH: 3.31/3.39 EXIT: 3.31/3.39 POST: 40 <= arg1 3.31/3.39 3.31/3.39 3.31/3.39 LOG: Try proving POST 3.31/3.39 Solving with 1 template(s). 3.31/3.39 3.31/3.39 LOG: CALL solveNonLinearGetFirstSolution 3.31/3.39 3.31/3.39 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009229s 3.31/3.39 Time used: 0.009032 3.31/3.39 Improving Solution with cost 51 ... 3.31/3.39 3.31/3.39 LOG: CALL solveNonLinearGetNextSolution 3.31/3.39 3.31/3.39 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000659s 3.31/3.39 Time used: 1.00049 3.31/3.39 3.31/3.39 LOG: SAT solveNonLinear - Elapsed time: 1.009888s 3.31/3.39 Cost: 51; Total time: 1.00952 3.31/3.39 Failed at location 2: arg1 <= 0 3.31/3.39 Before Improving: 3.31/3.39 Quasi-invariant at l2: arg1 <= 0 3.31/3.39 Optimizing invariants... 3.31/3.39 3.31/3.39 LOG: CALL solveLinear 3.31/3.39 3.31/3.39 LOG: RETURN solveLinear - Elapsed time: 0.006838s 3.31/3.39 Quasi-invariant improved 3.31/3.39 3.31/3.39 LOG: CALL solveLinear 3.31/3.39 3.31/3.39 LOG: RETURN solveLinear - Elapsed time: 0.001740s 3.31/3.39 Quasi-invariant improved 3.31/3.39 3.31/3.39 LOG: CALL solveLinear 3.31/3.39 3.31/3.39 LOG: RETURN solveLinear - Elapsed time: 0.001720s 3.31/3.39 Quasi-invariant improved 3.31/3.39 3.31/3.39 LOG: CALL solveLinear 3.31/3.39 3.31/3.39 LOG: RETURN solveLinear - Elapsed time: 0.001740s 3.31/3.39 Quasi-invariant improved 3.31/3.39 3.31/3.39 LOG: CALL solveLinear 3.31/3.39 3.31/3.39 LOG: RETURN solveLinear - Elapsed time: 0.001727s 3.31/3.39 Quasi-invariant improved 3.31/3.39 3.31/3.39 LOG: CALL solveLinear 3.31/3.39 3.31/3.39 LOG: RETURN solveLinear - Elapsed time: 0.001723s 3.31/3.39 Quasi-invariant improved 3.31/3.39 3.31/3.39 LOG: CALL solveLinear 3.31/3.39 3.31/3.39 LOG: RETURN solveLinear - Elapsed time: 0.001729s 3.31/3.39 Quasi-invariant improved 3.31/3.39 3.31/3.39 LOG: CALL solveLinear 3.31/3.39 3.31/3.39 LOG: RETURN solveLinear - Elapsed time: 0.001732s 3.31/3.39 Quasi-invariant improved 3.31/3.39 3.31/3.39 LOG: CALL solveLinear 3.31/3.39 3.31/3.39 LOG: RETURN solveLinear - Elapsed time: 0.001729s 3.31/3.39 Quasi-invariant improved 3.31/3.39 3.31/3.39 LOG: CALL solveLinear 3.31/3.39 3.31/3.39 LOG: RETURN solveLinear - Elapsed time: 0.001721s 3.31/3.39 Quasi-invariant improved 3.31/3.39 3.31/3.39 LOG: CALL solveLinear 3.31/3.39 3.31/3.39 LOG: RETURN solveLinear - Elapsed time: 0.001342s 3.31/3.39 Remaining time after improvement: 0.982928 3.31/3.39 Some transition disabled by a set of quasi-invariant(s): 3.31/3.39 Quasi-invariant at l2: arg1 <= 19 3.31/3.39 3.31/3.39 LOG: NEXT CALL check - disable 3.31/3.39 3.31/3.39 LOG: CALL check - Post:arg1 <= 19 - Process 3 3.31/3.39 * Exit transition: 3.31/3.39 * Postcondition : arg1 <= 19 3.31/3.39 3.31/3.39 LOG: CALL solveLinear 3.31/3.39 3.31/3.39 LOG: RETURN solveLinear - Elapsed time: 0.000660s 3.31/3.39 > Postcondition is not implied! 3.31/3.39 3.31/3.39 LOG: RETURN check - Elapsed time: 0.000760s 3.31/3.39 Solving with 2 template(s). 3.31/3.39 3.31/3.39 LOG: CALL solveNonLinearGetFirstSolution 3.31/3.39 3.31/3.39 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.033313s 3.31/3.39 Time used: 0.033026 3.31/3.39 Improving Solution with cost 51 ... 3.31/3.39 3.31/3.39 LOG: CALL solveNonLinearGetNextSolution 3.31/3.39 3.31/3.39 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000570s 3.31/3.39 Time used: 1.00055 3.31/3.39 3.31/3.39 LOG: SAT solveNonLinear - Elapsed time: 1.033883s 3.31/3.39 Cost: 51; Total time: 1.03357 3.31/3.39 Failed at location 2: arg1 <= 0 3.31/3.39 Before Improving: 3.31/3.39 Quasi-invariant at l2: arg1 <= 0 3.31/3.39 Optimizing invariants... 3.31/3.39 3.31/3.39 LOG: CALL solveLinear 3.31/3.39 3.31/3.39 LOG: RETURN solveLinear - Elapsed time: 0.013672s 3.31/3.39 Quasi-invariant improved 3.31/3.39 3.31/3.39 LOG: CALL solveLinear 3.31/3.39 3.31/3.39 LOG: RETURN solveLinear - Elapsed time: 0.002476s 3.31/3.39 Quasi-invariant improved 3.31/3.39 3.31/3.39 LOG: CALL solveLinear 3.31/3.39 3.31/3.39 LOG: RETURN solveLinear - Elapsed time: 0.002358s 3.31/3.39 Quasi-invariant improved 3.31/3.39 3.31/3.39 LOG: CALL solveLinear 3.31/3.39 3.31/3.39 LOG: RETURN solveLinear - Elapsed time: 0.002349s 3.31/3.39 Quasi-invariant improved 3.31/3.39 3.31/3.39 LOG: CALL solveLinear 3.31/3.39 3.31/3.39 LOG: RETURN solveLinear - Elapsed time: 0.002348s 3.31/3.39 Quasi-invariant improved 3.31/3.39 3.31/3.39 LOG: CALL solveLinear 3.31/3.39 3.31/3.39 LOG: RETURN solveLinear - Elapsed time: 0.002332s 3.31/3.39 Quasi-invariant improved 3.31/3.39 3.31/3.39 LOG: CALL solveLinear 3.31/3.39 3.31/3.39 LOG: RETURN solveLinear - Elapsed time: 0.002335s 3.31/3.39 Quasi-invariant improved 3.31/3.39 3.31/3.39 LOG: CALL solveLinear 3.31/3.39 3.31/3.39 LOG: RETURN solveLinear - Elapsed time: 0.002346s 3.31/3.39 Quasi-invariant improved 3.31/3.39 3.31/3.39 LOG: CALL solveLinear 3.31/3.39 3.31/3.39 LOG: RETURN solveLinear - Elapsed time: 0.002320s 3.31/3.39 Quasi-invariant improved 3.31/3.39 3.31/3.39 LOG: CALL solveLinear 3.31/3.39 3.31/3.39 LOG: RETURN solveLinear - Elapsed time: 0.001778s 3.31/3.39 Remaining time after improvement: 0.97847 3.31/3.39 Some transition disabled by a set of quasi-invariant(s): 3.31/3.39 Quasi-invariant at l2: arg1 <= 9 3.31/3.39 3.31/3.39 LOG: NEXT CALL check - disable 3.31/3.39 3.31/3.39 LOG: CALL check - Post:arg1 <= 9 - Process 4 3.31/3.39 * Exit transition: 3.31/3.39 * Postcondition : arg1 <= 9 3.31/3.39 3.31/3.39 LOG: CALL solveLinear 3.31/3.39 3.31/3.39 LOG: RETURN solveLinear - Elapsed time: 0.000768s 3.31/3.39 > Postcondition is not implied! 3.31/3.39 3.31/3.39 LOG: RETURN check - Elapsed time: 0.000868s 3.31/3.39 Solving with 3 template(s). 3.31/3.39 3.31/3.39 LOG: CALL solveNonLinearGetFirstSolution 3.31/3.39 3.31/3.39 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.084983s 3.31/3.39 Time used: 0.084603 3.31/3.39 Improving Solution with cost 51 ... 3.31/3.39 3.31/3.39 LOG: CALL solveNonLinearGetNextSolution 3.31/3.39 3.31/3.39 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.916158s 3.31/3.39 Time used: 0.916127 3.31/3.39 3.31/3.39 LOG: SAT solveNonLinear - Elapsed time: 1.001141s 3.31/3.39 Cost: 51; Total time: 1.00073 3.31/3.39 Failed at location 2: arg1 <= 0 3.31/3.39 Before Improving: 3.31/3.39 Quasi-invariant at l2: 0 <= arg1 3.31/3.39 Quasi-invariant at l2: arg1 <= 0 3.31/3.39 Optimizing invariants... 3.31/3.39 3.31/3.39 LOG: CALL solveLinear 3.31/3.39 3.31/3.39 LOG: RETURN solveLinear - Elapsed time: 0.033389s 3.31/3.39 Quasi-invariant improved 3.31/3.39 3.31/3.39 LOG: CALL solveLinear 3.31/3.39 3.31/3.39 LOG: RETURN solveLinear - Elapsed time: 0.003320s 3.31/3.39 Quasi-invariant improved 3.31/3.39 3.31/3.39 LOG: CALL solveLinear 3.31/3.39 3.31/3.39 LOG: RETURN solveLinear - Elapsed time: 0.003094s 3.31/3.39 Quasi-invariant improved 3.31/3.39 3.31/3.39 LOG: CALL solveLinear 3.31/3.39 3.31/3.39 LOG: RETURN solveLinear - Elapsed time: 0.003032s 3.31/3.39 Quasi-invariant improved 3.31/3.39 3.31/3.39 LOG: CALL solveLinear 3.31/3.39 3.31/3.39 LOG: RETURN solveLinear - Elapsed time: 0.003086s 3.31/3.39 Quasi-invariant improved 3.31/3.39 3.31/3.39 LOG: CALL solveLinear 3.31/3.39 3.31/3.39 LOG: RETURN solveLinear - Elapsed time: 0.003113s 3.31/3.39 Quasi-invariant improved 3.31/3.39 3.31/3.39 LOG: CALL solveLinear 3.31/3.39 3.31/3.39 LOG: RETURN solveLinear - Elapsed time: 0.003062s 3.31/3.39 Quasi-invariant improved 3.31/3.39 3.31/3.39 LOG: CALL solveLinear 3.31/3.39 3.31/3.39 LOG: RETURN solveLinear - Elapsed time: 0.003035s 3.31/3.39 Quasi-invariant improved 3.31/3.39 3.31/3.39 LOG: CALL solveLinear 3.31/3.39 3.31/3.39 LOG: RETURN solveLinear - Elapsed time: 0.003066s 3.31/3.39 Quasi-invariant improved 3.31/3.39 3.31/3.39 LOG: CALL solveLinear 3.31/3.39 3.31/3.39 LOG: RETURN solveLinear - Elapsed time: 0.002346s 3.31/3.39 Remaining time after improvement: 0.971531 3.31/3.39 Some transition disabled by a set of quasi-invariant(s): 3.31/3.39 Quasi-invariant at l2: 0 <= arg1 3.31/3.39 Quasi-invariant at l2: arg1 <= 9 3.31/3.39 3.31/3.39 LOG: NEXT CALL check - disable 3.31/3.39 3.31/3.39 LOG: CALL check - Post:arg1 <= 9 - Process 5 3.31/3.39 * Exit transition: 3.31/3.39 * Postcondition : arg1 <= 9 3.31/3.39 3.31/3.39 LOG: CALL solveLinear 3.31/3.39 3.31/3.39 LOG: RETURN solveLinear - Elapsed time: 0.000876s 3.31/3.39 > Postcondition is not implied! 3.31/3.39 3.31/3.39 LOG: RETURN check - Elapsed time: 0.000976s 3.31/3.39 3.31/3.39 LOG: Postcondition is not implied - no solution 3.31/3.39 > Postcondition is not implied! 3.31/3.39 3.31/3.39 LOG: RETURN check - Elapsed time: 3.183589s 3.31/3.39 3.31/3.39 Proving non-termination of subgraph 1 3.31/3.39 Transitions: 3.31/3.39 1 + arg1, rest remain the same}> 3.31/3.39 1 + arg1, rest remain the same}> 3.31/3.39 3.31/3.39 -1 + arg1, rest remain the same}> 3.31/3.39 3.31/3.39 Variables: 3.31/3.39 arg1 3.31/3.39 3.31/3.39 Checking conditional non-termination of SCC {l2}... 3.31/3.39 EXIT TRANSITIONS: 3.31/3.39 3.31/3.39 3.31/3.39 3.31/3.39 Solving with 1 template(s). 3.31/3.39 3.31/3.39 LOG: CALL solveNonLinearGetFirstSolution 3.31/3.39 3.31/3.39 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.010437s 3.31/3.39 Time used: 0.010211 3.31/3.39 Improving Solution with cost 2 ... 3.31/3.39 3.31/3.39 LOG: CALL solveNonLinearGetNextSolution 3.31/3.39 3.31/3.39 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.015217s 3.31/3.39 Time used: 0.015211 3.31/3.39 3.31/3.39 LOG: SAT solveNonLinear - Elapsed time: 0.025654s 3.31/3.39 Cost: 2; Total time: 0.025422 3.31/3.39 Failed at location 2: arg1 <= 1 3.31/3.39 Before Improving: 3.31/3.39 Quasi-invariant at l2: arg1 <= 1 3.31/3.39 Optimizing invariants... 3.31/3.39 3.31/3.39 LOG: CALL solveLinear 3.31/3.39 3.31/3.39 LOG: RETURN solveLinear - Elapsed time: 0.005540s 3.31/3.39 Quasi-invariant improved 3.31/3.39 3.31/3.39 LOG: CALL solveLinear 3.31/3.39 3.31/3.39 LOG: RETURN solveLinear - Elapsed time: 0.002390s 3.31/3.39 Quasi-invariant improved 3.31/3.39 3.31/3.39 LOG: CALL solveLinear 3.31/3.39 3.31/3.39 LOG: RETURN solveLinear - Elapsed time: 0.002375s 3.31/3.39 Quasi-invariant improved 3.31/3.39 3.31/3.39 LOG: CALL solveLinear 3.31/3.39 3.31/3.39 LOG: RETURN solveLinear - Elapsed time: 0.002356s 3.31/3.39 Quasi-invariant improved 3.31/3.39 3.31/3.39 LOG: CALL solveLinear 3.31/3.39 3.31/3.39 LOG: RETURN solveLinear - Elapsed time: 0.002339s 3.31/3.39 Quasi-invariant improved 3.31/3.39 3.31/3.39 LOG: CALL solveLinear 3.31/3.39 3.31/3.39 LOG: RETURN solveLinear - Elapsed time: 0.002343s 3.31/3.39 Quasi-invariant improved 3.31/3.39 3.31/3.39 LOG: CALL solveLinear 3.31/3.39 3.31/3.39 LOG: RETURN solveLinear - Elapsed time: 0.002341s 3.31/3.39 Quasi-invariant improved 3.31/3.39 3.31/3.39 LOG: CALL solveLinear 3.31/3.39 3.31/3.39 LOG: RETURN solveLinear - Elapsed time: 0.002347s 3.31/3.39 Quasi-invariant improved 3.31/3.39 3.31/3.39 LOG: CALL solveLinear 3.31/3.39 3.31/3.39 LOG: RETURN solveLinear - Elapsed time: 0.002331s 3.31/3.39 Quasi-invariant improved 3.31/3.39 3.31/3.39 LOG: CALL solveLinear 3.31/3.39 3.31/3.39 LOG: RETURN solveLinear - Elapsed time: 0.001607s 3.31/3.39 Remaining time after improvement: 0.978804 3.31/3.39 Non-termination implied by a set of quasi-invariant(s): 3.31/3.39 Quasi-invariant at l2: arg1 <= 19 3.31/3.39 3.31/3.39 Strengthening and disabling EXIT transitions... 3.31/3.39 Closed exits from l2: 1 3.31/3.39 Strengthening exit transition (result): 3.31/3.39 3.31/3.39 3.31/3.39 Strengthening and disabling transitions... 3.31/3.39 3.31/3.39 LOG: CALL solverLinear in Graph for feasibility 3.31/3.39 3.31/3.39 LOG: RETURN solveLinear in Graph for feasibility 3.31/3.39 It's unfeasible. Removing transition: 3.31/3.39 1 + arg1, rest remain the same}> 3.31/3.39 3.31/3.39 LOG: CALL solverLinear in Graph for feasibility 3.31/3.39 3.31/3.39 LOG: RETURN solveLinear in Graph for feasibility 3.31/3.39 It's unfeasible. Removing transition: 3.31/3.39 1 + arg1, rest remain the same}> 3.31/3.39 3.31/3.39 LOG: CALL solverLinear in Graph for feasibility 3.31/3.39 3.31/3.39 LOG: RETURN solveLinear in Graph for feasibility 3.31/3.39 It's unfeasible. Removing transition: 3.31/3.39 3.31/3.39 3.31/3.39 LOG: CALL solverLinear in Graph for feasibility 3.31/3.39 3.31/3.39 LOG: RETURN solveLinear in Graph for feasibility 3.31/3.39 Strengthening transition (result): 3.31/3.39 -1 + arg1, rest remain the same}> 3.31/3.39 3.31/3.39 LOG: CALL solverLinear in Graph for feasibility 3.31/3.39 3.31/3.39 LOG: RETURN solveLinear in Graph for feasibility 3.31/3.39 Strengthening transition (result): 3.31/3.39 3.31/3.39 3.31/3.39 Checking conditional non-termination of SCC {l2}... 3.31/3.39 EXIT TRANSITIONS: 3.31/3.39 3.31/3.39 3.31/3.39 Solving with 1 template(s). 3.31/3.39 3.31/3.39 LOG: CALL solveNonLinearGetFirstSolution 3.31/3.39 3.31/3.39 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.013729s 3.31/3.39 Time used: 0.01354 3.31/3.39 Improving Solution with cost 1 ... 3.31/3.39 3.31/3.39 LOG: CALL solveNonLinearGetNextSolution 3.31/3.39 3.31/3.39 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.007423s 3.31/3.39 Time used: 0.007418 3.31/3.39 3.31/3.39 LOG: SAT solveNonLinear - Elapsed time: 0.021153s 3.31/3.39 Cost: 1; Total time: 0.020958 3.31/3.39 Failed at location 2: 12 <= arg1 3.31/3.39 Before Improving: 3.31/3.39 Quasi-invariant at l2: 12 <= arg1 3.31/3.39 Optimizing invariants... 3.31/3.39 3.31/3.39 LOG: CALL solveLinear 3.31/3.39 3.31/3.39 LOG: RETURN solveLinear - Elapsed time: 0.001939s 3.31/3.39 Remaining time after improvement: 0.999075 3.31/3.39 Non-termination implied by a set of quasi-invariant(s): 3.31/3.39 Quasi-invariant at l2: 12 <= arg1 3.31/3.39 3.31/3.39 Strengthening and disabling EXIT transitions... 3.31/3.39 Closed exits from l2: 1 3.31/3.39 3.31/3.39 Strengthening and disabling transitions... 3.31/3.39 3.31/3.39 LOG: CALL solverLinear in Graph for feasibility 3.31/3.39 3.31/3.39 LOG: RETURN solveLinear in Graph for feasibility 3.31/3.39 It's unfeasible. Removing transition: 3.31/3.39 -1 + arg1, rest remain the same}> 3.31/3.39 3.31/3.39 LOG: CALL solverLinear in Graph for feasibility 3.31/3.39 3.31/3.39 LOG: RETURN solveLinear in Graph for feasibility 3.31/3.39 Strengthening transition (result): 3.31/3.39 3.31/3.39 3.31/3.39 Calling reachability with... 3.31/3.39 Transition: 3.31/3.39 Conditions: arg1 <= 19, 12 <= arg1, 3.31/3.39 OPEN EXITS: 3.31/3.39 3.31/3.39 3.31/3.39 --- Reachability graph --- 3.31/3.39 > Graph without transitions. 3.31/3.39 3.31/3.39 Calling reachability with... 3.31/3.39 Transition: 3.31/3.39 Conditions: arg1 <= 19, 12 <= arg1, 3.31/3.39 OPEN EXITS: 3.31/3.39 3.31/3.39 3.31/3.39 > Conditions are reachable! 3.31/3.39 3.31/3.39 Program does NOT terminate 3.31/3.39 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found 3.31/3.39 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found 3.31/3.39 EOF