29.51/29.59 NO 29.51/29.59 29.51/29.59 Solver Timeout: 4 29.51/29.59 Global Timeout: 300 29.51/29.59 No parsing errors! 29.51/29.59 Init Location: 0 29.51/29.59 Transitions: 29.51/29.59 29.51/29.59 0) /\ (arg2 > ~(1)), par{arg1 -> arg2, arg2 -> undef2}> 29.51/29.59 10, arg2 -> undef4}> 29.51/29.59 5), par{arg1 -> (arg1 - 1), arg2 -> undef6}> 29.51/29.59 10), par{arg1 -> (arg1 - 1), arg2 -> undef8}> 29.51/29.59 undef9, arg2 -> undef10}> 29.51/29.59 29.51/29.59 Fresh variables: 29.51/29.59 undef2, undef4, undef6, undef8, undef9, undef10, 29.51/29.59 29.51/29.59 Undef variables: 29.51/29.59 undef2, undef4, undef6, undef8, undef9, undef10, 29.51/29.59 29.51/29.59 Abstraction variables: 29.51/29.59 29.51/29.59 Exit nodes: 29.51/29.59 29.51/29.59 Accepting locations: 29.51/29.59 29.51/29.59 Asserts: 29.51/29.59 29.51/29.59 Preprocessed LLVMGraph 29.51/29.59 Init Location: 0 29.51/29.59 Transitions: 29.51/29.59 0) /\ (undef10 > ~(1))> 29.51/29.59 10}> 29.51/29.59 5), par{arg1 -> (arg1 - 1)}> 29.51/29.59 10), par{arg1 -> (arg1 - 1)}> 29.51/29.59 29.51/29.59 Fresh variables: 29.51/29.59 undef2, undef4, undef6, undef8, undef9, undef10, 29.51/29.59 29.51/29.59 Undef variables: 29.51/29.59 undef2, undef4, undef6, undef8, undef9, undef10, 29.51/29.59 29.51/29.59 Abstraction variables: 29.51/29.59 29.51/29.59 Exit nodes: 29.51/29.59 29.51/29.59 Accepting locations: 29.51/29.59 29.51/29.59 Asserts: 29.51/29.59 29.51/29.59 ************************************************************* 29.51/29.59 ******************************************************************************************* 29.51/29.59 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 29.51/29.59 ******************************************************************************************* 29.51/29.59 29.51/29.59 Init Location: 0 29.51/29.59 Graph 0: 29.51/29.59 Transitions: 29.51/29.59 Variables: 29.51/29.59 29.51/29.59 Graph 1: 29.51/29.59 Transitions: 29.51/29.59 10, rest remain the same}> 29.51/29.59 -1 + arg1, rest remain the same}> 29.51/29.59 -1 + arg1, rest remain the same}> 29.51/29.59 Variables: 29.51/29.59 arg1 29.51/29.59 29.51/29.59 Precedence: 29.51/29.59 Graph 0 29.51/29.59 29.51/29.59 Graph 1 29.51/29.59 29.51/29.59 29.51/29.59 Map Locations to Subgraph: 29.51/29.59 ( 0 , 0 ) 29.51/29.59 ( 2 , 1 ) 29.51/29.59 29.51/29.59 ******************************************************************************************* 29.51/29.59 ******************************** CHECKING ASSERTIONS ******************************** 29.51/29.59 ******************************************************************************************* 29.51/29.59 29.51/29.59 Proving termination of subgraph 0 29.51/29.59 Proving termination of subgraph 1 29.51/29.59 Checking unfeasibility... 29.51/29.59 Time used: 0.004962 29.51/29.59 29.51/29.59 Checking conditional termination of SCC {l2}... 29.51/29.59 29.51/29.59 LOG: CALL solveLinear 29.51/29.59 29.51/29.59 LOG: RETURN solveLinear - Elapsed time: 0.001187s 29.51/29.59 Ranking function: -1 + arg1 29.51/29.59 New Graphs: 29.51/29.59 Transitions: 29.51/29.59 10, rest remain the same}> 29.51/29.59 Variables: 29.51/29.59 arg1 29.51/29.59 Checking conditional termination of SCC {l2}... 29.51/29.59 29.51/29.59 LOG: CALL solveLinear 29.51/29.59 29.51/29.59 LOG: RETURN solveLinear - Elapsed time: 0.000361s 29.51/29.59 29.51/29.59 LOG: CALL solveLinear 29.51/29.59 29.51/29.59 LOG: RETURN solveLinear - Elapsed time: 0.001014s 29.51/29.59 Trying to remove transition: 10, rest remain the same}> 29.51/29.59 Solving with 1 template(s). 29.51/29.59 29.51/29.59 LOG: CALL solveNonLinearGetFirstSolution 29.51/29.59 29.51/29.59 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 3.537320s 29.51/29.59 Time used: 3.53668 29.51/29.59 Solving with 1 template(s). 29.51/29.59 29.51/29.59 LOG: CALL solveNonLinearGetFirstSolution 29.51/29.59 29.51/29.59 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.033582s 29.51/29.59 Time used: 0.008927 29.51/29.59 Improving Solution with cost 1 ... 29.51/29.59 29.51/29.59 LOG: CALL solveNonLinearGetNextSolution 29.51/29.59 29.51/29.59 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.036875s 29.51/29.59 Time used: 0.036866 29.51/29.59 29.51/29.59 LOG: SAT solveNonLinear - Elapsed time: 0.070456s 29.51/29.59 Cost: 1; Total time: 0.045793 29.51/29.59 Failed at location 2: arg1 <= 0 29.51/29.59 Before Improving: 29.51/29.59 Quasi-invariant at l2: arg1 <= 0 29.51/29.59 Optimizing invariants... 29.51/29.59 29.51/29.59 LOG: CALL solveLinear 29.51/29.59 29.51/29.59 LOG: RETURN solveLinear - Elapsed time: 0.005674s 29.51/29.59 Remaining time after improvement: 0.998847 29.51/29.59 Termination implied by a set of quasi-invariant(s): 29.51/29.59 Quasi-invariant at l2: arg1 <= 0 29.51/29.59 [ Invariant Graph ] 29.51/29.59 Strengthening and disabling transitions... 29.51/29.59 29.51/29.59 LOG: CALL solverLinear in Graph for feasibility 29.51/29.59 29.51/29.59 LOG: RETURN solveLinear in Graph for feasibility 29.51/29.59 It's unfeasible. Removing transition: 29.51/29.59 10, rest remain the same}> 29.51/29.59 29.51/29.59 LOG: CALL solverLinear in Graph for feasibility 29.51/29.59 29.51/29.59 LOG: RETURN solveLinear in Graph for feasibility 29.51/29.59 It's unfeasible. Removing transition: 29.51/29.59 -1 + arg1, rest remain the same}> 29.51/29.59 29.51/29.59 LOG: CALL solverLinear in Graph for feasibility 29.51/29.59 29.51/29.59 LOG: RETURN solveLinear in Graph for feasibility 29.51/29.59 It's unfeasible. Removing transition: 29.51/29.59 -1 + arg1, rest remain the same}> 29.51/29.59 [ Termination Graph ] 29.51/29.59 Strengthening and disabling transitions... 29.51/29.59 > It's unfeasible. Removing transition: 29.51/29.59 10, rest remain the same}> 29.51/29.59 New Graphs: 29.51/29.59 Calling Safety with literal arg1 <= 0 and entry 29.51/29.59 29.51/29.59 LOG: CALL check - Post:arg1 <= 0 - Process 1 29.51/29.59 * Exit transition: 29.51/29.59 * Postcondition : arg1 <= 0 29.51/29.59 29.51/29.59 LOG: CALL solveLinear 29.51/29.59 29.51/29.59 LOG: RETURN solveLinear - Elapsed time: 0.000605s 29.51/29.59 > Postcondition is not implied! 29.51/29.59 29.51/29.59 LOG: RETURN check - Elapsed time: 0.000704s 29.51/29.59 INVARIANTS: 29.51/29.59 2: 29.51/29.59 Quasi-INVARIANTS to narrow Graph: 29.51/29.59 2: arg1 <= 0 , 29.51/29.59 Narrowing transition: 29.51/29.59 10, rest remain the same}> 29.51/29.59 29.51/29.59 LOG: Narrow transition size 1 29.51/29.59 Narrowing transition: 29.51/29.59 -1 + arg1, rest remain the same}> 29.51/29.59 29.51/29.59 LOG: Narrow transition size 1 29.51/29.59 Narrowing transition: 29.51/29.59 -1 + arg1, rest remain the same}> 29.51/29.59 29.51/29.59 LOG: Narrow transition size 1 29.51/29.59 invGraph after Narrowing: 29.51/29.59 Transitions: 29.51/29.59 10, rest remain the same}> 29.51/29.59 -1 + arg1, rest remain the same}> 29.51/29.59 -1 + arg1, rest remain the same}> 29.51/29.59 Variables: 29.51/29.59 arg1 29.51/29.59 Checking conditional termination of SCC {l2}... 29.51/29.59 29.51/29.59 LOG: CALL solveLinear 29.51/29.59 29.51/29.59 LOG: RETURN solveLinear - Elapsed time: 0.001098s 29.51/29.59 Ranking function: -1 + arg1 29.51/29.59 New Graphs: 29.51/29.59 Transitions: 29.51/29.59 10, rest remain the same}> 29.51/29.59 Variables: 29.51/29.59 arg1 29.51/29.59 Checking conditional termination of SCC {l2}... 29.51/29.59 29.51/29.59 LOG: CALL solveLinear 29.51/29.59 29.51/29.59 LOG: RETURN solveLinear - Elapsed time: 0.000367s 29.51/29.59 29.51/29.59 LOG: CALL solveLinear 29.51/29.59 29.51/29.59 LOG: RETURN solveLinear - Elapsed time: 0.001037s 29.51/29.59 Trying to remove transition: 10, rest remain the same}> 29.51/29.59 Solving with 1 template(s). 29.51/29.59 29.51/29.59 LOG: CALL solveNonLinearGetFirstSolution 29.51/29.59 29.51/29.59 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 3.480766s 29.51/29.59 Time used: 3.48013 29.51/29.59 Solving with 1 template(s). 29.51/29.59 29.51/29.59 LOG: CALL solveNonLinearGetFirstSolution 29.51/29.59 29.51/29.59 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.035215s 29.51/29.59 Time used: 0.010157 29.51/29.59 Improving Solution with cost 1 ... 29.51/29.59 29.51/29.59 LOG: CALL solveNonLinearGetNextSolution 29.51/29.59 29.51/29.59 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.042054s 29.51/29.59 Time used: 0.042045 29.51/29.59 29.51/29.59 LOG: SAT solveNonLinear - Elapsed time: 0.077269s 29.51/29.59 Cost: 1; Total time: 0.052202 29.51/29.59 Failed at location 2: arg1 <= 1 29.51/29.59 Before Improving: 29.51/29.59 Quasi-invariant at l2: arg1 <= 1 29.51/29.59 Optimizing invariants... 29.51/29.59 29.51/29.59 LOG: CALL solveLinear 29.51/29.59 29.51/29.59 LOG: RETURN solveLinear - Elapsed time: 0.006484s 29.51/29.59 Quasi-invariant improved 29.51/29.59 29.51/29.59 LOG: CALL solveLinear 29.51/29.59 29.51/29.59 LOG: RETURN solveLinear - Elapsed time: 0.001560s 29.51/29.59 Quasi-invariant improved 29.51/29.59 29.51/29.59 LOG: CALL solveLinear 29.51/29.59 29.51/29.59 LOG: RETURN solveLinear - Elapsed time: 0.001141s 29.51/29.59 Remaining time after improvement: 0.995702 29.51/29.59 Termination implied by a set of quasi-invariant(s): 29.51/29.59 Quasi-invariant at l2: arg1 <= 3 29.51/29.59 [ Invariant Graph ] 29.51/29.59 Strengthening and disabling transitions... 29.51/29.59 29.51/29.59 LOG: CALL solverLinear in Graph for feasibility 29.51/29.59 29.51/29.59 LOG: RETURN solveLinear in Graph for feasibility 29.51/29.59 It's unfeasible. Removing transition: 29.51/29.59 10, rest remain the same}> 29.51/29.59 29.51/29.59 LOG: CALL solverLinear in Graph for feasibility 29.51/29.59 29.51/29.59 LOG: RETURN solveLinear in Graph for feasibility 29.51/29.59 It's unfeasible. Removing transition: 29.51/29.59 -1 + arg1, rest remain the same}> 29.51/29.59 29.51/29.59 LOG: CALL solverLinear in Graph for feasibility 29.51/29.59 29.51/29.59 LOG: RETURN solveLinear in Graph for feasibility 29.51/29.59 It's unfeasible. Removing transition: 29.51/29.59 -1 + arg1, rest remain the same}> 29.51/29.59 [ Termination Graph ] 29.51/29.59 Strengthening and disabling transitions... 29.51/29.59 29.51/29.59 LOG: CALL solverLinear in Graph for feasibility 29.51/29.59 29.51/29.59 LOG: RETURN solveLinear in Graph for feasibility 29.51/29.59 It's unfeasible. Removing transition: 29.51/29.59 10, rest remain the same}> 29.51/29.59 New Graphs: 29.51/29.59 Calling Safety with literal arg1 <= 3 and entry 29.51/29.59 29.51/29.59 LOG: CALL check - Post:arg1 <= 3 - Process 2 29.51/29.59 * Exit transition: 29.51/29.59 * Postcondition : arg1 <= 3 29.51/29.59 29.51/29.59 LOG: CALL solveLinear 29.51/29.59 29.51/29.59 LOG: RETURN solveLinear - Elapsed time: 0.000507s 29.51/29.59 > Postcondition is not implied! 29.51/29.59 29.51/29.59 LOG: RETURN check - Elapsed time: 0.000605s 29.51/29.59 INVARIANTS: 29.51/29.59 2: 29.51/29.59 Quasi-INVARIANTS to narrow Graph: 29.51/29.59 2: arg1 <= 3 , 29.51/29.59 Narrowing transition: 29.51/29.59 10, rest remain the same}> 29.51/29.59 29.51/29.59 LOG: Narrow transition size 1 29.51/29.59 Narrowing transition: 29.51/29.59 -1 + arg1, rest remain the same}> 29.51/29.59 29.51/29.59 LOG: Narrow transition size 1 29.51/29.59 Narrowing transition: 29.51/29.59 -1 + arg1, rest remain the same}> 29.51/29.59 29.51/29.59 LOG: Narrow transition size 1 29.51/29.59 invGraph after Narrowing: 29.51/29.59 Transitions: 29.51/29.59 10, rest remain the same}> 29.51/29.59 -1 + arg1, rest remain the same}> 29.51/29.59 -1 + arg1, rest remain the same}> 29.51/29.59 Variables: 29.51/29.59 arg1 29.51/29.59 Checking conditional termination of SCC {l2}... 29.51/29.59 29.51/29.59 LOG: CALL solveLinear 29.51/29.59 29.51/29.59 LOG: RETURN solveLinear - Elapsed time: 0.001137s 29.51/29.59 Ranking function: -1 + arg1 29.51/29.59 New Graphs: 29.51/29.59 Transitions: 29.51/29.59 10, rest remain the same}> 29.51/29.59 Variables: 29.51/29.59 arg1 29.51/29.59 Checking conditional termination of SCC {l2}... 29.51/29.59 29.51/29.59 LOG: CALL solveLinear 29.51/29.59 29.51/29.59 LOG: RETURN solveLinear - Elapsed time: 0.000382s 29.51/29.59 29.51/29.59 LOG: CALL solveLinear 29.51/29.59 29.51/29.59 LOG: RETURN solveLinear - Elapsed time: 0.001072s 29.51/29.59 Trying to remove transition: 10, rest remain the same}> 29.51/29.59 Solving with 1 template(s). 29.51/29.59 29.51/29.59 LOG: CALL solveNonLinearGetFirstSolution 29.51/29.59 29.51/29.59 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 3.490954s 29.51/29.59 Time used: 3.49031 29.51/29.59 Solving with 1 template(s). 29.51/29.59 29.51/29.59 LOG: CALL solveNonLinearGetFirstSolution 29.51/29.59 29.51/29.59 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.123954s 29.51/29.59 Time used: 0.098616 29.51/29.59 Improving Solution with cost 1 ... 29.51/29.59 29.51/29.59 LOG: CALL solveNonLinearGetNextSolution 29.51/29.59 29.51/29.59 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.406961s 29.51/29.59 Time used: 0.406931 29.51/29.59 29.51/29.59 LOG: SAT solveNonLinear - Elapsed time: 0.530915s 29.51/29.59 Cost: 1; Total time: 0.505547 29.51/29.59 Failed at location 2: arg1 <= 8 29.51/29.59 Before Improving: 29.51/29.59 Quasi-invariant at l2: arg1 <= 8 29.51/29.59 Optimizing invariants... 29.51/29.59 29.51/29.59 LOG: CALL solveLinear 29.51/29.59 29.51/29.59 LOG: RETURN solveLinear - Elapsed time: 0.011443s 29.51/29.59 Remaining time after improvement: 0.998726 29.51/29.59 Termination implied by a set of quasi-invariant(s): 29.51/29.59 Quasi-invariant at l2: arg1 <= 8 29.51/29.59 [ Invariant Graph ] 29.51/29.59 Strengthening and disabling transitions... 29.51/29.59 29.51/29.59 LOG: CALL solverLinear in Graph for feasibility 29.51/29.59 29.51/29.59 LOG: RETURN solveLinear in Graph for feasibility 29.51/29.59 It's unfeasible. Removing transition: 29.51/29.59 10, rest remain the same}> 29.51/29.59 29.51/29.59 LOG: CALL solverLinear in Graph for feasibility 29.51/29.59 29.51/29.59 LOG: RETURN solveLinear in Graph for feasibility 29.51/29.59 Strengthening transition (result): 29.51/29.59 -1 + arg1, rest remain the same}> 29.51/29.59 29.51/29.59 LOG: CALL solverLinear in Graph for feasibility 29.51/29.59 29.51/29.59 LOG: RETURN solveLinear in Graph for feasibility 29.51/29.59 It's unfeasible. Removing transition: 29.51/29.59 -1 + arg1, rest remain the same}> 29.51/29.59 [ Termination Graph ] 29.51/29.59 Strengthening and disabling transitions... 29.51/29.59 > It's unfeasible. Removing transition: 29.51/29.59 10, rest remain the same}> 29.51/29.59 New Graphs: 29.51/29.59 Calling Safety with literal arg1 <= 8 and entry 29.51/29.59 29.51/29.59 LOG: CALL check - Post:arg1 <= 8 - Process 3 29.51/29.59 * Exit transition: 29.51/29.59 * Postcondition : arg1 <= 8 29.51/29.59 29.51/29.59 LOG: CALL solveLinear 29.51/29.59 29.51/29.59 LOG: RETURN solveLinear - Elapsed time: 0.000515s 29.51/29.59 > Postcondition is not implied! 29.51/29.59 29.51/29.59 LOG: RETURN check - Elapsed time: 0.000613s 29.51/29.59 INVARIANTS: 29.51/29.59 2: 29.51/29.59 Quasi-INVARIANTS to narrow Graph: 29.51/29.59 2: arg1 <= 8 , 29.51/29.59 Narrowing transition: 29.51/29.59 10, rest remain the same}> 29.51/29.59 29.51/29.59 LOG: Narrow transition size 1 29.51/29.59 It's unfeasible. Removing transition: 29.51/29.59 -1 + arg1, rest remain the same}> 29.51/29.59 Narrowing transition: 29.51/29.59 -1 + arg1, rest remain the same}> 29.51/29.59 29.51/29.59 LOG: Narrow transition size 1 29.51/29.59 invGraph after Narrowing: 29.51/29.59 Transitions: 29.51/29.59 10, rest remain the same}> 29.51/29.59 -1 + arg1, rest remain the same}> 29.51/29.59 Variables: 29.51/29.59 arg1 29.51/29.59 Checking conditional termination of SCC {l2}... 29.51/29.59 29.51/29.59 LOG: CALL solveLinear 29.51/29.59 29.51/29.59 LOG: RETURN solveLinear - Elapsed time: 0.000860s 29.51/29.59 Ranking function: -10 + arg1 29.51/29.59 New Graphs: 29.51/29.59 Transitions: 29.51/29.59 10, rest remain the same}> 29.51/29.59 Variables: 29.51/29.59 arg1 29.51/29.59 Checking conditional termination of SCC {l2}... 29.51/29.59 29.51/29.59 LOG: CALL solveLinear 29.51/29.59 29.51/29.59 LOG: RETURN solveLinear - Elapsed time: 0.000380s 29.51/29.59 29.51/29.59 LOG: CALL solveLinear 29.51/29.59 29.51/29.59 LOG: RETURN solveLinear - Elapsed time: 0.001092s 29.51/29.59 Trying to remove transition: 10, rest remain the same}> 29.51/29.59 Solving with 1 template(s). 29.51/29.59 29.51/29.59 LOG: CALL solveNonLinearGetFirstSolution 29.51/29.59 29.51/29.59 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 3.444642s 29.51/29.59 Time used: 3.44398 29.51/29.59 Solving with 1 template(s). 29.51/29.59 29.51/29.59 LOG: CALL solveNonLinearGetFirstSolution 29.51/29.59 29.51/29.59 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.143351s 29.51/29.59 Time used: 0.117807 29.51/29.59 Improving Solution with cost 1 ... 29.51/29.59 29.51/29.59 LOG: CALL solveNonLinearGetNextSolution 29.51/29.59 29.51/29.59 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000703s 29.51/29.59 Time used: 1.00063 29.51/29.59 29.51/29.59 LOG: SAT solveNonLinear - Elapsed time: 1.144054s 29.51/29.59 Cost: 1; Total time: 1.11844 29.51/29.59 Failed at location 2: arg1 <= 9 29.51/29.59 Before Improving: 29.51/29.59 Quasi-invariant at l2: arg1 <= 9 29.51/29.59 Optimizing invariants... 29.51/29.59 29.51/29.59 LOG: CALL solveLinear 29.51/29.59 29.51/29.59 LOG: RETURN solveLinear - Elapsed time: 0.014421s 29.51/29.59 Remaining time after improvement: 0.998677 29.51/29.59 Termination implied by a set of quasi-invariant(s): 29.51/29.59 Quasi-invariant at l2: arg1 <= 9 29.51/29.59 [ Invariant Graph ] 29.51/29.59 Strengthening and disabling transitions... 29.51/29.59 29.51/29.59 LOG: CALL solverLinear in Graph for feasibility 29.51/29.59 29.51/29.59 LOG: RETURN solveLinear in Graph for feasibility 29.51/29.59 It's unfeasible. Removing transition: 29.51/29.59 10, rest remain the same}> 29.51/29.59 29.51/29.59 LOG: CALL solverLinear in Graph for feasibility 29.51/29.59 29.51/29.59 LOG: RETURN solveLinear in Graph for feasibility 29.51/29.59 It's unfeasible. Removing transition: 29.51/29.59 -1 + arg1, rest remain the same}> 29.51/29.59 [ Termination Graph ] 29.51/29.59 Strengthening and disabling transitions... 29.51/29.59 29.51/29.59 LOG: CALL solverLinear in Graph for feasibility 29.51/29.59 29.51/29.59 LOG: RETURN solveLinear in Graph for feasibility 29.51/29.59 It's unfeasible. Removing transition: 29.51/29.59 10, rest remain the same}> 29.51/29.59 New Graphs: 29.51/29.59 Calling Safety with literal arg1 <= 9 and entry 29.51/29.59 29.51/29.59 LOG: CALL check - Post:arg1 <= 9 - Process 4 29.51/29.59 * Exit transition: 29.51/29.59 * Postcondition : arg1 <= 9 29.51/29.59 29.51/29.59 LOG: CALL solveLinear 29.51/29.59 29.51/29.59 LOG: RETURN solveLinear - Elapsed time: 0.001131s 29.51/29.59 > Postcondition is not implied! 29.51/29.59 29.51/29.59 LOG: RETURN check - Elapsed time: 0.001228s 29.51/29.59 INVARIANTS: 29.51/29.59 2: 29.51/29.59 Quasi-INVARIANTS to narrow Graph: 29.51/29.59 2: arg1 <= 9 , 29.51/29.59 Narrowing transition: 29.51/29.59 10, rest remain the same}> 29.51/29.59 29.51/29.59 LOG: Narrow transition size 1 29.51/29.59 Narrowing transition: 29.51/29.59 -1 + arg1, rest remain the same}> 29.51/29.59 29.51/29.59 LOG: Narrow transition size 1 29.51/29.59 invGraph after Narrowing: 29.51/29.59 Transitions: 29.51/29.59 10, rest remain the same}> 29.51/29.59 -1 + arg1, rest remain the same}> 29.51/29.59 Variables: 29.51/29.59 arg1 29.51/29.59 Checking conditional termination of SCC {l2}... 29.51/29.59 29.51/29.59 LOG: CALL solveLinear 29.51/29.59 29.51/29.59 LOG: RETURN solveLinear - Elapsed time: 0.000897s 29.51/29.59 Ranking function: -10 + arg1 29.51/29.59 New Graphs: 29.51/29.59 Transitions: 29.51/29.59 10, rest remain the same}> 29.51/29.59 Variables: 29.51/29.59 arg1 29.51/29.59 Checking conditional termination of SCC {l2}... 29.51/29.59 29.51/29.59 LOG: CALL solveLinear 29.51/29.59 29.51/29.59 LOG: RETURN solveLinear - Elapsed time: 0.000391s 29.51/29.59 29.51/29.59 LOG: CALL solveLinear 29.51/29.59 29.51/29.59 LOG: RETURN solveLinear - Elapsed time: 0.001130s 29.51/29.59 Trying to remove transition: 10, rest remain the same}> 29.51/29.59 Solving with 1 template(s). 29.51/29.59 29.51/29.59 LOG: CALL solveNonLinearGetFirstSolution 29.51/29.59 29.51/29.59 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 3.509061s 29.51/29.59 Time used: 3.50844 29.51/29.59 Solving with 1 template(s). 29.51/29.59 29.51/29.59 LOG: CALL solveNonLinearGetFirstSolution 29.51/29.59 29.51/29.59 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.028163s 29.51/29.59 Time used: 4.00203 29.51/29.59 Solving with 2 template(s). 29.51/29.59 29.51/29.59 LOG: CALL solveNonLinearGetFirstSolution 29.51/29.59 29.51/29.59 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.037373s 29.51/29.59 Time used: 4.00122 29.51/29.59 Solving with 3 template(s). 29.51/29.59 29.51/29.59 LOG: CALL solveNonLinearGetFirstSolution 29.51/29.59 29.51/29.59 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.010646s 29.51/29.59 Time used: 1.00095 29.51/29.59 Solving with 1 template(s). 29.51/29.59 29.51/29.59 LOG: CALL solveNonLinearGetFirstSolution 29.51/29.59 29.51/29.59 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.989501s 29.51/29.59 Time used: 0.981607 29.51/29.59 29.51/29.59 Proving non-termination of subgraph 1 29.51/29.59 Transitions: 29.51/29.59 10, rest remain the same}> 29.51/29.59 -1 + arg1, rest remain the same}> 29.51/29.59 Variables: 29.51/29.59 arg1 29.51/29.59 29.51/29.59 Checking conditional non-termination of SCC {l2}... 29.51/29.59 EXIT TRANSITIONS: 29.51/29.59 29.51/29.59 29.51/29.59 Solving with 1 template(s). 29.51/29.59 29.51/29.59 LOG: CALL solveNonLinearGetFirstSolution 29.51/29.59 29.51/29.59 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.027564s 29.51/29.59 Time used: 0.027383 29.51/29.59 Improving Solution with cost 1 ... 29.51/29.59 29.51/29.59 LOG: CALL solveNonLinearGetNextSolution 29.51/29.59 29.51/29.59 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.011952s 29.51/29.59 Time used: 0.011945 29.51/29.59 29.51/29.59 LOG: SAT solveNonLinear - Elapsed time: 0.039516s 29.51/29.59 Cost: 1; Total time: 0.039328 29.51/29.59 Failed at location 2: 10 <= arg1 29.51/29.59 Before Improving: 29.51/29.59 Quasi-invariant at l2: 10 <= arg1 29.51/29.59 Optimizing invariants... 29.51/29.59 29.51/29.59 LOG: CALL solveLinear 29.51/29.59 29.51/29.59 LOG: RETURN solveLinear - Elapsed time: 0.003674s 29.51/29.59 Remaining time after improvement: 0.998964 29.51/29.59 Non-termination implied by a set of quasi-invariant(s): 29.51/29.59 Quasi-invariant at l2: 10 <= arg1 29.51/29.59 29.51/29.59 Strengthening and disabling EXIT transitions... 29.51/29.59 Closed exits from l2: 1 29.51/29.59 29.51/29.59 Strengthening and disabling transitions... 29.51/29.59 29.51/29.59 LOG: CALL solverLinear in Graph for feasibility 29.51/29.59 29.51/29.59 LOG: RETURN solveLinear in Graph for feasibility 29.51/29.59 Strengthening transition (result): 29.51/29.59 10, rest remain the same}> 29.51/29.59 29.51/29.59 LOG: CALL solverLinear in Graph for feasibility 29.51/29.59 29.51/29.59 LOG: RETURN solveLinear in Graph for feasibility 29.51/29.59 Strengthening transition (result): 29.51/29.59 -1 + arg1, rest remain the same}> 29.51/29.59 29.51/29.59 Calling reachability with... 29.51/29.59 Transition: 29.51/29.59 Conditions: 10 <= arg1, 29.51/29.59 OPEN EXITS: 29.51/29.59 29.51/29.59 29.51/29.59 --- Reachability graph --- 29.51/29.59 > Graph without transitions. 29.51/29.59 29.51/29.59 Calling reachability with... 29.51/29.59 Transition: 29.51/29.59 Conditions: 10 <= arg1, 29.51/29.59 OPEN EXITS: 29.51/29.59 29.51/29.59 29.51/29.59 > Conditions are reachable! 29.51/29.59 29.51/29.59 Program does NOT terminate 29.51/29.59 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found 29.51/29.59 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found 29.51/29.59 EOF