64.99/65.15 YES 64.99/65.15 64.99/65.15 Solver Timeout: 4 64.99/65.15 Global Timeout: 300 64.99/65.15 No parsing errors! 64.99/65.15 Init Location: 0 64.99/65.15 Transitions: 64.99/65.15 64.99/65.15 0) /\ (undef1 > 0) /\ (0 = arg2), par{arg1 -> undef1, arg2 -> 0, arg3 -> 0, arg4 -> 0, arg5 -> 0, arg6 -> 0, arg7 -> 0}> 64.99/65.15 ~(1)) /\ (arg1 > 0) /\ (undef8 > 0) /\ (1 = arg2), par{arg1 -> undef8, arg2 -> undef9, arg3 -> 0, arg4 -> 0, arg5 -> 1, arg6 -> 1, arg7 -> 1}> 64.99/65.15 ~(1)) /\ (undef18 > ~(1)) /\ (undef15 <= arg1) /\ (arg1 > 0) /\ (undef15 > 0) /\ (2 = arg2), par{arg1 -> undef15, arg2 -> undef16, arg3 -> 0, arg4 -> undef18, arg5 -> 2, arg6 -> 2, arg7 -> 2}> 64.99/65.15 ~(1)) /\ (arg2 > 2) /\ (undef29 > ~(1)) /\ (undef24 > ~(1)) /\ (arg1 >= undef22) /\ (arg1 > 0) /\ (undef22 > 0), par{arg1 -> undef22, arg2 -> undef23, arg3 -> undef24, arg4 -> (undef29 - undef24), arg5 -> arg2, arg6 -> 3, arg7 -> arg2}> 64.99/65.15 0) /\ (arg2 > ~(1)) /\ (arg6 >= arg5) /\ (arg5 > ~(1)) /\ (undef30 <= arg1) /\ (arg1 > 0) /\ (undef30 > 0) /\ (arg2 = arg3) /\ (arg5 = arg7), par{arg1 -> undef30, arg2 -> (arg2 + 1), arg3 -> (arg2 + 1), arg4 -> (10 - (arg2 + 1)), arg7 -> arg5}> 64.99/65.15 ~(1)) /\ (arg4 > 0) /\ (arg6 > ~(1)) /\ (arg6 < arg5) /\ (undef44 > ~(1)) /\ (arg2 > ~(1)) /\ (((arg2 + 1) + undef44) >= 0) /\ (undef37 <= arg1) /\ (arg1 > 0) /\ (undef37 > 0) /\ (arg2 = arg3) /\ (arg5 = arg7), par{arg1 -> undef37, arg2 -> ((arg2 + 1) + undef44), arg3 -> ((arg2 + 1) + undef44), arg4 -> (10 - ((arg2 + 1) + undef44)), arg6 -> (arg6 + 1), arg7 -> arg5}> 64.99/65.15 undef45, arg2 -> undef46, arg3 -> undef47, arg4 -> undef48, arg5 -> undef49, arg6 -> undef50, arg7 -> undef51}> 64.99/65.15 64.99/65.15 Fresh variables: 64.99/65.15 undef1, undef8, undef9, undef15, undef16, undef18, undef22, undef23, undef24, undef29, undef30, undef37, undef44, undef45, undef46, undef47, undef48, undef49, undef50, undef51, 64.99/65.15 64.99/65.15 Undef variables: 64.99/65.15 undef1, undef8, undef9, undef15, undef16, undef18, undef22, undef23, undef24, undef29, undef30, undef37, undef44, undef45, undef46, undef47, undef48, undef49, undef50, undef51, 64.99/65.15 64.99/65.15 Abstraction variables: 64.99/65.15 64.99/65.15 Exit nodes: 64.99/65.15 64.99/65.15 Accepting locations: 64.99/65.15 64.99/65.15 Asserts: 64.99/65.15 64.99/65.15 Preprocessed LLVMGraph 64.99/65.15 Init Location: 0 64.99/65.15 Transitions: 64.99/65.15 0) /\ (undef1 > 0) /\ (0 = undef46), par{arg1 -> undef1, arg2 -> 0, arg3 -> 0, arg4 -> 0, arg5 -> 0, arg6 -> 0, arg7 -> 0}> 64.99/65.15 ~(1)) /\ (undef45 > 0) /\ (undef8 > 0) /\ (1 = undef46), par{arg1 -> undef8, arg2 -> undef9, arg3 -> 0, arg4 -> 0, arg5 -> 1, arg6 -> 1, arg7 -> 1}> 64.99/65.15 ~(1)) /\ (undef18 > ~(1)) /\ (undef15 <= undef45) /\ (undef45 > 0) /\ (undef15 > 0) /\ (2 = undef46), par{arg1 -> undef15, arg2 -> undef16, arg3 -> 0, arg4 -> undef18, arg5 -> 2, arg6 -> 2, arg7 -> 2}> 64.99/65.15 ~(1)) /\ (undef46 > 2) /\ (undef29 > ~(1)) /\ (undef24 > ~(1)) /\ (undef45 >= undef22) /\ (undef45 > 0) /\ (undef22 > 0), par{arg1 -> undef22, arg2 -> undef23, arg3 -> undef24, arg4 -> (undef29 - undef24), arg5 -> undef46, arg6 -> 3, arg7 -> undef46}> 64.99/65.15 0) /\ (arg2 > ~(1)) /\ (arg6 >= arg5) /\ (arg5 > ~(1)) /\ (undef30 <= arg1) /\ (arg1 > 0) /\ (undef30 > 0) /\ (arg2 = arg3) /\ (arg5 = arg7), par{arg1 -> undef30, arg2 -> (arg2 + 1), arg3 -> (arg2 + 1), arg4 -> (10 - (arg2 + 1)), arg7 -> arg5}> 64.99/65.15 ~(1)) /\ (arg4 > 0) /\ (arg6 > ~(1)) /\ (arg6 < arg5) /\ (undef44 > ~(1)) /\ (arg2 > ~(1)) /\ (((arg2 + 1) + undef44) >= 0) /\ (undef37 <= arg1) /\ (arg1 > 0) /\ (undef37 > 0) /\ (arg2 = arg3) /\ (arg5 = arg7), par{arg1 -> undef37, arg2 -> ((arg2 + 1) + undef44), arg3 -> ((arg2 + 1) + undef44), arg4 -> (10 - ((arg2 + 1) + undef44)), arg6 -> (arg6 + 1), arg7 -> arg5}> 64.99/65.15 64.99/65.15 Fresh variables: 64.99/65.15 undef1, undef8, undef9, undef15, undef16, undef18, undef22, undef23, undef24, undef29, undef30, undef37, undef44, undef45, undef46, undef47, undef48, undef49, undef50, undef51, 64.99/65.15 64.99/65.15 Undef variables: 64.99/65.15 undef1, undef8, undef9, undef15, undef16, undef18, undef22, undef23, undef24, undef29, undef30, undef37, undef44, undef45, undef46, undef47, undef48, undef49, undef50, undef51, 64.99/65.15 64.99/65.15 Abstraction variables: 64.99/65.15 64.99/65.15 Exit nodes: 64.99/65.15 64.99/65.15 Accepting locations: 64.99/65.15 64.99/65.15 Asserts: 64.99/65.15 64.99/65.15 ************************************************************* 64.99/65.15 ******************************************************************************************* 64.99/65.15 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 64.99/65.15 ******************************************************************************************* 64.99/65.15 64.99/65.15 Init Location: 0 64.99/65.15 Graph 0: 64.99/65.15 Transitions: 64.99/65.15 Variables: 64.99/65.15 64.99/65.15 Graph 1: 64.99/65.15 Transitions: 64.99/65.15 undef30, arg2 -> 1 + arg2, arg3 -> 1 + arg2, arg4 -> 9 - arg2, arg7 -> arg5, rest remain the same}> 64.99/65.15 undef37, arg2 -> 1 + arg2 + undef44, arg3 -> 1 + arg2 + undef44, arg4 -> 9 - arg2 - undef44, arg6 -> 1 + arg6, arg7 -> arg5, rest remain the same}> 64.99/65.15 Variables: 64.99/65.15 arg1, arg2, arg3, arg4, arg5, arg6, arg7 64.99/65.15 64.99/65.15 Precedence: 64.99/65.15 Graph 0 64.99/65.15 64.99/65.15 Graph 1 64.99/65.15 undef1, arg2 -> 0, arg3 -> 0, arg4 -> 0, arg5 -> 0, arg6 -> 0, arg7 -> 0, rest remain the same}> 64.99/65.15 undef8, arg2 -> undef9, arg3 -> 0, arg4 -> 0, arg5 -> 1, arg6 -> 1, arg7 -> 1, rest remain the same}> 64.99/65.15 undef15, arg2 -> undef16, arg3 -> 0, arg4 -> undef18, arg5 -> 2, arg6 -> 2, arg7 -> 2, rest remain the same}> 64.99/65.15 undef22, arg2 -> undef23, arg3 -> undef24, arg4 -> -undef24 + undef29, arg5 -> undef46, arg6 -> 3, arg7 -> undef46, rest remain the same}> 64.99/65.15 64.99/65.15 Map Locations to Subgraph: 64.99/65.15 ( 0 , 0 ) 64.99/65.15 ( 2 , 1 ) 64.99/65.15 64.99/65.15 ******************************************************************************************* 64.99/65.15 ******************************** CHECKING ASSERTIONS ******************************** 64.99/65.15 ******************************************************************************************* 64.99/65.15 64.99/65.15 Proving termination of subgraph 0 64.99/65.15 Proving termination of subgraph 1 64.99/65.15 Checking unfeasibility... 64.99/65.15 Time used: 0.635529 64.99/65.15 64.99/65.15 Checking conditional termination of SCC {l2}... 64.99/65.15 64.99/65.15 LOG: CALL solveLinear 64.99/65.15 64.99/65.15 LOG: RETURN solveLinear - Elapsed time: 0.005873s 64.99/65.15 Ranking function: -4 + 4*arg5 - 4*arg6 64.99/65.15 New Graphs: 64.99/65.15 Transitions: 64.99/65.15 undef30, arg2 -> 1 + arg2, arg3 -> 1 + arg2, arg4 -> 9 - arg2, arg7 -> arg5, rest remain the same}> 64.99/65.15 Variables: 64.99/65.15 arg1, arg2, arg3, arg4, arg5, arg6, arg7 64.99/65.15 Checking conditional termination of SCC {l2}... 64.99/65.15 64.99/65.15 LOG: CALL solveLinear 64.99/65.15 64.99/65.15 LOG: RETURN solveLinear - Elapsed time: 0.001226s 64.99/65.15 64.99/65.15 LOG: CALL solveLinear 64.99/65.15 64.99/65.15 LOG: RETURN solveLinear - Elapsed time: 0.006469s 64.99/65.15 Trying to remove transition: undef30, arg2 -> 1 + arg2, arg3 -> 1 + arg2, arg4 -> 9 - arg2, arg7 -> arg5, rest remain the same}> 64.99/65.15 Solving with 1 template(s). 64.99/65.15 64.99/65.15 LOG: CALL solveNonLinearGetFirstSolution 64.99/65.15 64.99/65.15 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 2.908359s 64.99/65.15 Time used: 2.90743 64.99/65.15 Solving with 1 template(s). 64.99/65.15 64.99/65.15 LOG: CALL solveNonLinearGetFirstSolution 64.99/65.15 64.99/65.15 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.183684s 64.99/65.15 Time used: 0.177864 64.99/65.15 Improving Solution with cost 2 ... 64.99/65.15 64.99/65.15 LOG: CALL solveNonLinearGetNextSolution 64.99/65.15 64.99/65.15 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.001202s 64.99/65.15 Time used: 1.00095 64.99/65.15 64.99/65.15 LOG: SAT solveNonLinear - Elapsed time: 1.184885s 64.99/65.15 Cost: 2; Total time: 1.17882 64.99/65.15 Failed at location 2: arg3 + arg4 <= 0 64.99/65.15 Failed at location 2: arg3 + arg4 <= 0 64.99/65.15 Before Improving: 64.99/65.15 Quasi-invariant at l2: arg3 + arg4 <= 0 64.99/65.15 Optimizing invariants... 64.99/65.15 64.99/65.15 LOG: CALL solveLinear 64.99/65.15 64.99/65.15 LOG: RETURN solveLinear - Elapsed time: 0.074886s 64.99/65.15 Remaining time after improvement: 0.995522 64.99/65.15 Termination implied by a set of quasi-invariant(s): 64.99/65.15 Quasi-invariant at l2: arg3 + arg4 <= 0 64.99/65.15 [ Invariant Graph ] 64.99/65.15 Strengthening and disabling transitions... 64.99/65.15 64.99/65.15 LOG: CALL solverLinear in Graph for feasibility 64.99/65.15 64.99/65.15 LOG: RETURN solveLinear in Graph for feasibility 64.99/65.15 It's unfeasible. Removing transition: 64.99/65.15 undef30, arg2 -> 1 + arg2, arg3 -> 1 + arg2, arg4 -> 9 - arg2, arg7 -> arg5, rest remain the same}> 64.99/65.15 64.99/65.15 LOG: CALL solverLinear in Graph for feasibility 64.99/65.15 64.99/65.15 LOG: RETURN solveLinear in Graph for feasibility 64.99/65.15 It's unfeasible. Removing transition: 64.99/65.15 undef37, arg2 -> 1 + arg2 + undef44, arg3 -> 1 + arg2 + undef44, arg4 -> 9 - arg2 - undef44, arg6 -> 1 + arg6, arg7 -> arg5, rest remain the same}> 64.99/65.15 [ Termination Graph ] 64.99/65.15 Strengthening and disabling transitions... 64.99/65.15 64.99/65.15 LOG: CALL solverLinear in Graph for feasibility 64.99/65.15 64.99/65.15 LOG: RETURN solveLinear in Graph for feasibility 64.99/65.15 It's unfeasible. Removing transition: 64.99/65.15 undef30, arg2 -> 1 + arg2, arg3 -> 1 + arg2, arg4 -> 9 - arg2, arg7 -> arg5, rest remain the same}> 64.99/65.15 New Graphs: 64.99/65.15 Calling Safety with literal arg3 + arg4 <= 0 and entry undef15, arg2 -> undef16, arg3 -> 0, arg4 -> undef18, arg5 -> 2, arg6 -> 2, arg7 -> 2, rest remain the same}> 64.99/65.15 64.99/65.15 LOG: CALL check - Post:arg3 + arg4 <= 0 - Process 1 64.99/65.15 * Exit transition: undef15, arg2 -> undef16, arg3 -> 0, arg4 -> undef18, arg5 -> 2, arg6 -> 2, arg7 -> 2, rest remain the same}> 64.99/65.15 * Postcondition : arg3 + arg4 <= 0 64.99/65.15 64.99/65.15 LOG: CALL solveLinear 64.99/65.15 64.99/65.15 LOG: RETURN solveLinear - Elapsed time: 0.001125s 64.99/65.15 > Postcondition is not implied! 64.99/65.15 64.99/65.15 LOG: RETURN check - Elapsed time: 0.001267s 64.99/65.15 Calling Safety with literal arg3 + arg4 <= 0 and entry undef22, arg2 -> undef23, arg3 -> undef24, arg4 -> -undef24 + undef29, arg5 -> undef46, arg6 -> 3, arg7 -> undef46, rest remain the same}> 64.99/65.15 64.99/65.15 LOG: CALL check - Post:arg3 + arg4 <= 0 - Process 2 64.99/65.15 * Exit transition: undef22, arg2 -> undef23, arg3 -> undef24, arg4 -> -undef24 + undef29, arg5 -> undef46, arg6 -> 3, arg7 -> undef46, rest remain the same}> 64.99/65.15 * Postcondition : arg3 + arg4 <= 0 64.99/65.15 64.99/65.15 LOG: CALL solveLinear 64.99/65.15 64.99/65.15 LOG: RETURN solveLinear - Elapsed time: 0.000880s 64.99/65.15 > Postcondition is not implied! 64.99/65.15 64.99/65.15 LOG: RETURN check - Elapsed time: 0.001030s 64.99/65.15 INVARIANTS: 64.99/65.15 2: 64.99/65.15 Quasi-INVARIANTS to narrow Graph: 64.99/65.15 2: arg3 + arg4 <= 0 , 64.99/65.15 Narrowing transition: 64.99/65.15 undef30, arg2 -> 1 + arg2, arg3 -> 1 + arg2, arg4 -> 9 - arg2, arg7 -> arg5, rest remain the same}> 64.99/65.15 64.99/65.15 LOG: Narrow transition size 1 64.99/65.15 Narrowing transition: 64.99/65.15 undef37, arg2 -> 1 + arg2 + undef44, arg3 -> 1 + arg2 + undef44, arg4 -> 9 - arg2 - undef44, arg6 -> 1 + arg6, arg7 -> arg5, rest remain the same}> 64.99/65.15 64.99/65.15 LOG: Narrow transition size 1 64.99/65.15 invGraph after Narrowing: 64.99/65.15 Transitions: 64.99/65.15 undef30, arg2 -> 1 + arg2, arg3 -> 1 + arg2, arg4 -> 9 - arg2, arg7 -> arg5, rest remain the same}> 64.99/65.15 undef37, arg2 -> 1 + arg2 + undef44, arg3 -> 1 + arg2 + undef44, arg4 -> 9 - arg2 - undef44, arg6 -> 1 + arg6, arg7 -> arg5, rest remain the same}> 64.99/65.15 Variables: 64.99/65.15 arg1, arg2, arg3, arg4, arg5, arg6, arg7 64.99/65.15 Checking conditional termination of SCC {l2}... 64.99/65.15 64.99/65.15 LOG: CALL solveLinear 64.99/65.15 64.99/65.15 LOG: RETURN solveLinear - Elapsed time: 0.003672s 64.99/65.15 Ranking function: arg5 - arg6 64.99/65.15 New Graphs: 64.99/65.15 Transitions: 64.99/65.15 undef30, arg2 -> 1 + arg2, arg3 -> 1 + arg2, arg4 -> 9 - arg2, arg7 -> arg5, rest remain the same}> 64.99/65.15 Variables: 64.99/65.15 arg1, arg2, arg3, arg4, arg5, arg6, arg7 64.99/65.15 Checking conditional termination of SCC {l2}... 64.99/65.15 64.99/65.15 LOG: CALL solveLinear 64.99/65.15 64.99/65.15 LOG: RETURN solveLinear - Elapsed time: 0.001356s 64.99/65.15 64.99/65.15 LOG: CALL solveLinear 64.99/65.15 64.99/65.15 LOG: RETURN solveLinear - Elapsed time: 0.006926s 64.99/65.15 Trying to remove transition: undef30, arg2 -> 1 + arg2, arg3 -> 1 + arg2, arg4 -> 9 - arg2, arg7 -> arg5, rest remain the same}> 64.99/65.15 Solving with 1 template(s). 64.99/65.15 64.99/65.15 LOG: CALL solveNonLinearGetFirstSolution 64.99/65.15 64.99/65.15 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 2.977464s 64.99/65.15 Time used: 2.97646 64.99/65.15 Solving with 1 template(s). 64.99/65.15 64.99/65.15 LOG: CALL solveNonLinearGetFirstSolution 64.99/65.15 64.99/65.15 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.096142s 64.99/65.15 Time used: 0.090672 64.99/65.15 Improving Solution with cost 2 ... 64.99/65.15 64.99/65.15 LOG: CALL solveNonLinearGetNextSolution 64.99/65.15 64.99/65.15 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000806s 64.99/65.15 Time used: 1.00056 64.99/65.15 64.99/65.15 LOG: SAT solveNonLinear - Elapsed time: 1.096948s 64.99/65.15 Cost: 2; Total time: 1.09124 64.99/65.15 Failed at location 2: 1 + arg3 + arg5 + arg6 <= arg2 + arg7 64.99/65.15 Failed at location 2: 1 + arg3 + arg5 + arg6 <= arg2 + arg7 64.99/65.15 Before Improving: 64.99/65.15 Quasi-invariant at l2: 1 + arg3 + arg5 + arg6 <= arg2 + arg7 64.99/65.15 Optimizing invariants... 64.99/65.15 64.99/65.15 LOG: CALL solveLinear 64.99/65.15 64.99/65.15 LOG: RETURN solveLinear - Elapsed time: 0.031479s 64.99/65.15 Remaining time after improvement: 0.995786 64.99/65.15 Termination implied by a set of quasi-invariant(s): 64.99/65.15 Quasi-invariant at l2: 1 + arg3 + arg5 + arg6 <= arg2 + arg7 64.99/65.15 [ Invariant Graph ] 64.99/65.15 Strengthening and disabling transitions... 64.99/65.15 64.99/65.15 LOG: CALL solverLinear in Graph for feasibility 64.99/65.15 64.99/65.15 LOG: RETURN solveLinear in Graph for feasibility 64.99/65.15 It's unfeasible. Removing transition: 64.99/65.15 undef30, arg2 -> 1 + arg2, arg3 -> 1 + arg2, arg4 -> 9 - arg2, arg7 -> arg5, rest remain the same}> 64.99/65.15 64.99/65.15 LOG: CALL solverLinear in Graph for feasibility 64.99/65.15 64.99/65.15 LOG: RETURN solveLinear in Graph for feasibility 64.99/65.15 It's unfeasible. Removing transition: 64.99/65.15 undef37, arg2 -> 1 + arg2 + undef44, arg3 -> 1 + arg2 + undef44, arg4 -> 9 - arg2 - undef44, arg6 -> 1 + arg6, arg7 -> arg5, rest remain the same}> 64.99/65.15 [ Termination Graph ] 64.99/65.15 Strengthening and disabling transitions... 64.99/65.15 64.99/65.15 LOG: CALL solverLinear in Graph for feasibility 64.99/65.15 64.99/65.15 LOG: RETURN solveLinear in Graph for feasibility 64.99/65.15 It's unfeasible. Removing transition: 64.99/65.15 undef30, arg2 -> 1 + arg2, arg3 -> 1 + arg2, arg4 -> 9 - arg2, arg7 -> arg5, rest remain the same}> 64.99/65.15 New Graphs: 64.99/65.15 Calling Safety with literal 1 + arg3 + arg5 + arg6 <= arg2 + arg7 and entry undef15, arg2 -> undef16, arg3 -> 0, arg4 -> undef18, arg5 -> 2, arg6 -> 2, arg7 -> 2, rest remain the same}> 64.99/65.15 64.99/65.15 LOG: CALL check - Post:1 + arg3 + arg5 + arg6 <= arg2 + arg7 - Process 3 64.99/65.15 * Exit transition: undef15, arg2 -> undef16, arg3 -> 0, arg4 -> undef18, arg5 -> 2, arg6 -> 2, arg7 -> 2, rest remain the same}> 64.99/65.15 * Postcondition : 1 + arg3 + arg5 + arg6 <= arg2 + arg7 64.99/65.15 64.99/65.15 LOG: CALL solveLinear 64.99/65.15 64.99/65.15 LOG: RETURN solveLinear - Elapsed time: 0.001207s 64.99/65.15 > Postcondition is not implied! 64.99/65.15 64.99/65.15 LOG: RETURN check - Elapsed time: 0.001353s 64.99/65.15 Calling Safety with literal 1 + arg3 + arg5 + arg6 <= arg2 + arg7 and entry undef22, arg2 -> undef23, arg3 -> undef24, arg4 -> -undef24 + undef29, arg5 -> undef46, arg6 -> 3, arg7 -> undef46, rest remain the same}> 64.99/65.15 64.99/65.15 LOG: CALL check - Post:1 + arg3 + arg5 + arg6 <= arg2 + arg7 - Process 4 64.99/65.15 * Exit transition: undef22, arg2 -> undef23, arg3 -> undef24, arg4 -> -undef24 + undef29, arg5 -> undef46, arg6 -> 3, arg7 -> undef46, rest remain the same}> 64.99/65.15 * Postcondition : 1 + arg3 + arg5 + arg6 <= arg2 + arg7 64.99/65.15 64.99/65.15 LOG: CALL solveLinear 64.99/65.15 64.99/65.15 LOG: RETURN solveLinear - Elapsed time: 0.001061s 64.99/65.15 > Postcondition is not implied! 64.99/65.15 64.99/65.15 LOG: RETURN check - Elapsed time: 0.001225s 64.99/65.15 INVARIANTS: 64.99/65.15 2: 64.99/65.15 Quasi-INVARIANTS to narrow Graph: 64.99/65.15 2: 1 + arg3 + arg5 + arg6 <= arg2 + arg7 , 64.99/65.15 Narrowing transition: 64.99/65.15 undef30, arg2 -> 1 + arg2, arg3 -> 1 + arg2, arg4 -> 9 - arg2, arg7 -> arg5, rest remain the same}> 64.99/65.15 64.99/65.15 LOG: Narrow transition size 1 64.99/65.15 Narrowing transition: 64.99/65.15 undef37, arg2 -> 1 + arg2 + undef44, arg3 -> 1 + arg2 + undef44, arg4 -> 9 - arg2 - undef44, arg6 -> 1 + arg6, arg7 -> arg5, rest remain the same}> 64.99/65.15 64.99/65.15 LOG: Narrow transition size 1 64.99/65.15 invGraph after Narrowing: 64.99/65.15 Transitions: 64.99/65.15 undef30, arg2 -> 1 + arg2, arg3 -> 1 + arg2, arg4 -> 9 - arg2, arg7 -> arg5, rest remain the same}> 64.99/65.15 undef37, arg2 -> 1 + arg2 + undef44, arg3 -> 1 + arg2 + undef44, arg4 -> 9 - arg2 - undef44, arg6 -> 1 + arg6, arg7 -> arg5, rest remain the same}> 64.99/65.15 Variables: 64.99/65.15 arg1, arg2, arg3, arg4, arg5, arg6, arg7 64.99/65.15 Checking conditional termination of SCC {l2}... 64.99/65.15 64.99/65.15 LOG: CALL solveLinear 64.99/65.15 64.99/65.15 LOG: RETURN solveLinear - Elapsed time: 0.004099s 64.99/65.15 Ranking function: arg5 - arg6 64.99/65.15 New Graphs: 64.99/65.15 Transitions: 64.99/65.15 undef30, arg2 -> 1 + arg2, arg3 -> 1 + arg2, arg4 -> 9 - arg2, arg7 -> arg5, rest remain the same}> 64.99/65.15 Variables: 64.99/65.15 arg1, arg2, arg3, arg4, arg5, arg6, arg7 64.99/65.15 Checking conditional termination of SCC {l2}... 64.99/65.15 64.99/65.15 LOG: CALL solveLinear 64.99/65.15 64.99/65.15 LOG: RETURN solveLinear - Elapsed time: 0.001516s 64.99/65.15 64.99/65.15 LOG: CALL solveLinear 64.99/65.15 64.99/65.15 LOG: RETURN solveLinear - Elapsed time: 0.008123s 64.99/65.15 Trying to remove transition: undef30, arg2 -> 1 + arg2, arg3 -> 1 + arg2, arg4 -> 9 - arg2, arg7 -> arg5, rest remain the same}> 64.99/65.15 Solving with 1 template(s). 64.99/65.15 64.99/65.15 LOG: CALL solveNonLinearGetFirstSolution 64.99/65.15 64.99/65.15 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 2.867437s 64.99/65.15 Time used: 2.86645 64.99/65.15 Solving with 1 template(s). 64.99/65.15 64.99/65.15 LOG: CALL solveNonLinearGetFirstSolution 64.99/65.15 64.99/65.15 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.089981s 64.99/65.15 Time used: 0.083689 64.99/65.15 Improving Solution with cost 2 ... 64.99/65.15 64.99/65.15 LOG: CALL solveNonLinearGetNextSolution 64.99/65.15 64.99/65.15 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000819s 64.99/65.15 Time used: 1.00058 64.99/65.15 64.99/65.15 LOG: SAT solveNonLinear - Elapsed time: 1.090801s 64.99/65.15 Cost: 2; Total time: 1.08427 64.99/65.15 Failed at location 2: arg2 + arg4 + arg5 + arg6 <= 0 64.99/65.15 Failed at location 2: arg2 + arg4 + arg5 + arg6 <= 0 64.99/65.15 Before Improving: 64.99/65.15 Quasi-invariant at l2: arg2 + arg4 + arg5 + arg6 <= 0 64.99/65.15 Optimizing invariants... 64.99/65.15 64.99/65.15 LOG: CALL solveLinear 64.99/65.15 64.99/65.15 LOG: RETURN solveLinear - Elapsed time: 0.032029s 64.99/65.15 Remaining time after improvement: 0.995505 64.99/65.15 Termination implied by a set of quasi-invariant(s): 64.99/65.15 Quasi-invariant at l2: arg2 + arg4 + arg5 + arg6 <= 0 64.99/65.15 [ Invariant Graph ] 64.99/65.15 Strengthening and disabling transitions... 64.99/65.15 64.99/65.15 LOG: CALL solverLinear in Graph for feasibility 64.99/65.15 64.99/65.15 LOG: RETURN solveLinear in Graph for feasibility 64.99/65.15 It's unfeasible. Removing transition: 64.99/65.15 undef30, arg2 -> 1 + arg2, arg3 -> 1 + arg2, arg4 -> 9 - arg2, arg7 -> arg5, rest remain the same}> 64.99/65.15 64.99/65.15 LOG: CALL solverLinear in Graph for feasibility 64.99/65.15 64.99/65.15 LOG: RETURN solveLinear in Graph for feasibility 64.99/65.15 It's unfeasible. Removing transition: 64.99/65.15 undef37, arg2 -> 1 + arg2 + undef44, arg3 -> 1 + arg2 + undef44, arg4 -> 9 - arg2 - undef44, arg6 -> 1 + arg6, arg7 -> arg5, rest remain the same}> 64.99/65.15 [ Termination Graph ] 64.99/65.15 Strengthening and disabling transitions... 64.99/65.15 > It's unfeasible. Removing transition: 64.99/65.15 undef30, arg2 -> 1 + arg2, arg3 -> 1 + arg2, arg4 -> 9 - arg2, arg7 -> arg5, rest remain the same}> 64.99/65.15 New Graphs: 64.99/65.15 Calling Safety with literal arg2 + arg4 + arg5 + arg6 <= 0 and entry undef15, arg2 -> undef16, arg3 -> 0, arg4 -> undef18, arg5 -> 2, arg6 -> 2, arg7 -> 2, rest remain the same}> 64.99/65.15 64.99/65.15 LOG: CALL check - Post:arg2 + arg4 + arg5 + arg6 <= 0 - Process 5 64.99/65.15 * Exit transition: undef15, arg2 -> undef16, arg3 -> 0, arg4 -> undef18, arg5 -> 2, arg6 -> 2, arg7 -> 2, rest remain the same}> 64.99/65.15 * Postcondition : arg2 + arg4 + arg5 + arg6 <= 0 64.99/65.15 64.99/65.15 LOG: CALL solveLinear 64.99/65.15 64.99/65.15 LOG: RETURN solveLinear - Elapsed time: 0.001282s 64.99/65.15 > Postcondition is not implied! 64.99/65.15 64.99/65.15 LOG: RETURN check - Elapsed time: 0.001438s 64.99/65.15 Calling Safety with literal arg2 + arg4 + arg5 + arg6 <= 0 and entry undef22, arg2 -> undef23, arg3 -> undef24, arg4 -> -undef24 + undef29, arg5 -> undef46, arg6 -> 3, arg7 -> undef46, rest remain the same}> 64.99/65.15 64.99/65.15 LOG: CALL check - Post:arg2 + arg4 + arg5 + arg6 <= 0 - Process 6 64.99/65.15 * Exit transition: undef22, arg2 -> undef23, arg3 -> undef24, arg4 -> -undef24 + undef29, arg5 -> undef46, arg6 -> 3, arg7 -> undef46, rest remain the same}> 64.99/65.15 * Postcondition : arg2 + arg4 + arg5 + arg6 <= 0 64.99/65.15 64.99/65.15 LOG: CALL solveLinear 64.99/65.15 64.99/65.15 LOG: RETURN solveLinear - Elapsed time: 0.001197s 64.99/65.15 > Postcondition is not implied! 64.99/65.15 64.99/65.15 LOG: RETURN check - Elapsed time: 0.001375s 64.99/65.15 INVARIANTS: 64.99/65.15 2: 64.99/65.15 Quasi-INVARIANTS to narrow Graph: 64.99/65.15 2: arg2 + arg4 + arg5 + arg6 <= 0 , 64.99/65.15 Narrowing transition: 64.99/65.15 undef30, arg2 -> 1 + arg2, arg3 -> 1 + arg2, arg4 -> 9 - arg2, arg7 -> arg5, rest remain the same}> 64.99/65.15 64.99/65.15 LOG: Narrow transition size 1 64.99/65.15 Narrowing transition: 64.99/65.15 undef37, arg2 -> 1 + arg2 + undef44, arg3 -> 1 + arg2 + undef44, arg4 -> 9 - arg2 - undef44, arg6 -> 1 + arg6, arg7 -> arg5, rest remain the same}> 64.99/65.15 64.99/65.15 LOG: Narrow transition size 1 64.99/65.15 invGraph after Narrowing: 64.99/65.15 Transitions: 64.99/65.15 undef30, arg2 -> 1 + arg2, arg3 -> 1 + arg2, arg4 -> 9 - arg2, arg7 -> arg5, rest remain the same}> 64.99/65.15 undef37, arg2 -> 1 + arg2 + undef44, arg3 -> 1 + arg2 + undef44, arg4 -> 9 - arg2 - undef44, arg6 -> 1 + arg6, arg7 -> arg5, rest remain the same}> 64.99/65.15 Variables: 64.99/65.15 arg1, arg2, arg3, arg4, arg5, arg6, arg7 64.99/65.15 Checking conditional termination of SCC {l2}... 64.99/65.15 64.99/65.15 LOG: CALL solveLinear 64.99/65.15 64.99/65.15 LOG: RETURN solveLinear - Elapsed time: 0.004624s 64.99/65.15 Ranking function: -5 + 5*arg5 - arg6 64.99/65.15 New Graphs: 64.99/65.15 Transitions: 64.99/65.15 undef30, arg2 -> 1 + arg2, arg3 -> 1 + arg2, arg4 -> 9 - arg2, arg7 -> arg5, rest remain the same}> 64.99/65.15 Variables: 64.99/65.15 arg1, arg2, arg3, arg4, arg5, arg6, arg7 64.99/65.15 Checking conditional termination of SCC {l2}... 64.99/65.15 64.99/65.15 LOG: CALL solveLinear 64.99/65.15 64.99/65.15 LOG: RETURN solveLinear - Elapsed time: 0.001595s 64.99/65.15 64.99/65.15 LOG: CALL solveLinear 64.99/65.15 64.99/65.15 LOG: RETURN solveLinear - Elapsed time: 0.008656s 64.99/65.15 Trying to remove transition: undef30, arg2 -> 1 + arg2, arg3 -> 1 + arg2, arg4 -> 9 - arg2, arg7 -> arg5, rest remain the same}> 64.99/65.15 Solving with 1 template(s). 64.99/65.15 64.99/65.15 LOG: CALL solveNonLinearGetFirstSolution 64.99/65.15 64.99/65.15 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 2.964381s 64.99/65.15 Time used: 2.96337 64.99/65.15 Solving with 1 template(s). 64.99/65.15 64.99/65.15 LOG: CALL solveNonLinearGetFirstSolution 64.99/65.15 64.99/65.15 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.106699s 64.99/65.15 Time used: 0.100365 64.99/65.15 Improving Solution with cost 2 ... 64.99/65.15 64.99/65.15 LOG: CALL solveNonLinearGetNextSolution 64.99/65.15 64.99/65.15 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000723s 64.99/65.15 Time used: 1.00061 64.99/65.15 64.99/65.15 LOG: SAT solveNonLinear - Elapsed time: 1.107422s 64.99/65.15 Cost: 2; Total time: 1.10097 64.99/65.15 Failed at location 2: 1 + arg3 + arg5 <= arg2 + arg7 64.99/65.15 Failed at location 2: 1 + arg3 + arg5 <= arg2 + arg7 64.99/65.15 Before Improving: 64.99/65.15 Quasi-invariant at l2: 1 + arg3 + arg5 <= arg2 + arg7 64.99/65.15 Optimizing invariants... 64.99/65.15 64.99/65.15 LOG: CALL solveLinear 64.99/65.15 64.99/65.15 LOG: RETURN solveLinear - Elapsed time: 0.032749s 64.99/65.15 Remaining time after improvement: 0.995046 64.99/65.15 Termination implied by a set of quasi-invariant(s): 64.99/65.15 Quasi-invariant at l2: 1 + arg3 + arg5 <= arg2 + arg7 64.99/65.15 [ Invariant Graph ] 64.99/65.15 Strengthening and disabling transitions... 64.99/65.15 64.99/65.15 LOG: CALL solverLinear in Graph for feasibility 64.99/65.15 64.99/65.15 LOG: RETURN solveLinear in Graph for feasibility 64.99/65.15 It's unfeasible. Removing transition: 64.99/65.15 undef30, arg2 -> 1 + arg2, arg3 -> 1 + arg2, arg4 -> 9 - arg2, arg7 -> arg5, rest remain the same}> 64.99/65.15 64.99/65.15 LOG: CALL solverLinear in Graph for feasibility 64.99/65.15 64.99/65.15 LOG: RETURN solveLinear in Graph for feasibility 64.99/65.15 It's unfeasible. Removing transition: 64.99/65.15 undef37, arg2 -> 1 + arg2 + undef44, arg3 -> 1 + arg2 + undef44, arg4 -> 9 - arg2 - undef44, arg6 -> 1 + arg6, arg7 -> arg5, rest remain the same}> 64.99/65.15 [ Termination Graph ] 64.99/65.15 Strengthening and disabling transitions... 64.99/65.15 64.99/65.15 LOG: CALL solverLinear in Graph for feasibility 64.99/65.15 64.99/65.15 LOG: RETURN solveLinear in Graph for feasibility 64.99/65.15 It's unfeasible. Removing transition: 64.99/65.15 undef30, arg2 -> 1 + arg2, arg3 -> 1 + arg2, arg4 -> 9 - arg2, arg7 -> arg5, rest remain the same}> 64.99/65.15 New Graphs: 64.99/65.15 Calling Safety with literal 1 + arg3 + arg5 <= arg2 + arg7 and entry undef15, arg2 -> undef16, arg3 -> 0, arg4 -> undef18, arg5 -> 2, arg6 -> 2, arg7 -> 2, rest remain the same}> 64.99/65.15 64.99/65.15 LOG: CALL check - Post:1 + arg3 + arg5 <= arg2 + arg7 - Process 7 64.99/65.15 * Exit transition: undef15, arg2 -> undef16, arg3 -> 0, arg4 -> undef18, arg5 -> 2, arg6 -> 2, arg7 -> 2, rest remain the same}> 64.99/65.15 * Postcondition : 1 + arg3 + arg5 <= arg2 + arg7 64.99/65.15 64.99/65.15 LOG: CALL solveLinear 64.99/65.15 64.99/65.15 LOG: RETURN solveLinear - Elapsed time: 0.001443s 64.99/65.15 > Postcondition is not implied! 64.99/65.15 64.99/65.15 LOG: RETURN check - Elapsed time: 0.001618s 64.99/65.15 Calling Safety with literal 1 + arg3 + arg5 <= arg2 + arg7 and entry undef22, arg2 -> undef23, arg3 -> undef24, arg4 -> -undef24 + undef29, arg5 -> undef46, arg6 -> 3, arg7 -> undef46, rest remain the same}> 64.99/65.15 64.99/65.15 LOG: CALL check - Post:1 + arg3 + arg5 <= arg2 + arg7 - Process 8 64.99/65.15 * Exit transition: undef22, arg2 -> undef23, arg3 -> undef24, arg4 -> -undef24 + undef29, arg5 -> undef46, arg6 -> 3, arg7 -> undef46, rest remain the same}> 64.99/65.15 * Postcondition : 1 + arg3 + arg5 <= arg2 + arg7 64.99/65.15 64.99/65.15 LOG: CALL solveLinear 64.99/65.15 64.99/65.15 LOG: RETURN solveLinear - Elapsed time: 0.001319s 64.99/65.15 > Postcondition is not implied! 64.99/65.15 64.99/65.15 LOG: RETURN check - Elapsed time: 0.001527s 64.99/65.15 INVARIANTS: 64.99/65.15 2: 64.99/65.15 Quasi-INVARIANTS to narrow Graph: 64.99/65.15 2: 1 + arg3 + arg5 <= arg2 + arg7 , 64.99/65.15 Narrowing transition: 64.99/65.15 undef30, arg2 -> 1 + arg2, arg3 -> 1 + arg2, arg4 -> 9 - arg2, arg7 -> arg5, rest remain the same}> 64.99/65.15 64.99/65.15 LOG: Narrow transition size 1 64.99/65.15 Narrowing transition: 64.99/65.15 undef37, arg2 -> 1 + arg2 + undef44, arg3 -> 1 + arg2 + undef44, arg4 -> 9 - arg2 - undef44, arg6 -> 1 + arg6, arg7 -> arg5, rest remain the same}> 64.99/65.15 64.99/65.15 LOG: Narrow transition size 1 64.99/65.15 invGraph after Narrowing: 64.99/65.15 Transitions: 64.99/65.15 undef30, arg2 -> 1 + arg2, arg3 -> 1 + arg2, arg4 -> 9 - arg2, arg7 -> arg5, rest remain the same}> 64.99/65.15 undef37, arg2 -> 1 + arg2 + undef44, arg3 -> 1 + arg2 + undef44, arg4 -> 9 - arg2 - undef44, arg6 -> 1 + arg6, arg7 -> arg5, rest remain the same}> 64.99/65.15 Variables: 64.99/65.15 arg1, arg2, arg3, arg4, arg5, arg6, arg7 64.99/65.15 Checking conditional termination of SCC {l2}... 64.99/65.15 64.99/65.15 LOG: CALL solveLinear 64.99/65.15 64.99/65.15 LOG: RETURN solveLinear - Elapsed time: 0.005210s 64.99/65.15 Ranking function: arg5 - arg6 64.99/65.15 New Graphs: 64.99/65.15 Transitions: 64.99/65.15 undef30, arg2 -> 1 + arg2, arg3 -> 1 + arg2, arg4 -> 9 - arg2, arg7 -> arg5, rest remain the same}> 64.99/65.15 Variables: 64.99/65.15 arg1, arg2, arg3, arg4, arg5, arg6, arg7 64.99/65.15 Checking conditional termination of SCC {l2}... 64.99/65.15 64.99/65.15 LOG: CALL solveLinear 64.99/65.15 64.99/65.15 LOG: RETURN solveLinear - Elapsed time: 0.001740s 64.99/65.15 64.99/65.15 LOG: CALL solveLinear 64.99/65.15 64.99/65.15 LOG: RETURN solveLinear - Elapsed time: 0.009393s 64.99/65.15 Trying to remove transition: undef30, arg2 -> 1 + arg2, arg3 -> 1 + arg2, arg4 -> 9 - arg2, arg7 -> arg5, rest remain the same}> 64.99/65.15 Solving with 1 template(s). 64.99/65.15 64.99/65.15 LOG: CALL solveNonLinearGetFirstSolution 64.99/65.15 64.99/65.15 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 2.852158s 64.99/65.15 Time used: 2.85098 64.99/65.15 Solving with 1 template(s). 64.99/65.15 64.99/65.15 LOG: CALL solveNonLinearGetFirstSolution 64.99/65.15 64.99/65.15 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.118058s 64.99/65.15 Time used: 0.111521 64.99/65.15 Improving Solution with cost 2 ... 64.99/65.15 64.99/65.15 LOG: CALL solveNonLinearGetNextSolution 64.99/65.15 64.99/65.15 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000985s 64.99/65.15 Time used: 1.00087 64.99/65.15 64.99/65.15 LOG: SAT solveNonLinear - Elapsed time: 1.119043s 64.99/65.15 Cost: 2; Total time: 1.11239 64.99/65.15 Failed at location 2: 1 + arg1 + arg3 + arg4 + arg5 <= arg2 + arg7 64.99/65.15 Failed at location 2: 1 + arg1 + arg3 + arg4 + arg5 <= arg2 + arg7 64.99/65.15 Before Improving: 64.99/65.15 Quasi-invariant at l2: 1 + arg1 + arg3 + arg4 + arg5 <= arg2 + arg7 64.99/65.15 Optimizing invariants... 64.99/65.15 64.99/65.15 LOG: CALL solveLinear 64.99/65.15 64.99/65.15 LOG: RETURN solveLinear - Elapsed time: 0.033082s 64.99/65.15 Remaining time after improvement: 0.994612 64.99/65.15 Termination implied by a set of quasi-invariant(s): 64.99/65.15 Quasi-invariant at l2: 1 + arg1 + arg3 + arg4 + arg5 <= arg2 + arg7 64.99/65.15 [ Invariant Graph ] 64.99/65.15 Strengthening and disabling transitions... 64.99/65.15 64.99/65.15 LOG: CALL solverLinear in Graph for feasibility 64.99/65.15 64.99/65.15 LOG: RETURN solveLinear in Graph for feasibility 64.99/65.15 It's unfeasible. Removing transition: 64.99/65.15 undef30, arg2 -> 1 + arg2, arg3 -> 1 + arg2, arg4 -> 9 - arg2, arg7 -> arg5, rest remain the same}> 64.99/65.15 64.99/65.15 LOG: CALL solverLinear in Graph for feasibility 64.99/65.15 64.99/65.15 LOG: RETURN solveLinear in Graph for feasibility 64.99/65.15 It's unfeasible. Removing transition: 64.99/65.15 undef37, arg2 -> 1 + arg2 + undef44, arg3 -> 1 + arg2 + undef44, arg4 -> 9 - arg2 - undef44, arg6 -> 1 + arg6, arg7 -> arg5, rest remain the same}> 64.99/65.15 [ Termination Graph ] 64.99/65.15 Strengthening and disabling transitions... 64.99/65.15 64.99/65.15 LOG: CALL solverLinear in Graph for feasibility 64.99/65.15 64.99/65.15 LOG: RETURN solveLinear in Graph for feasibility 64.99/65.15 It's unfeasible. Removing transition: 64.99/65.15 undef30, arg2 -> 1 + arg2, arg3 -> 1 + arg2, arg4 -> 9 - arg2, arg7 -> arg5, rest remain the same}> 64.99/65.15 New Graphs: 64.99/65.15 Calling Safety with literal 1 + arg1 + arg3 + arg4 + arg5 <= arg2 + arg7 and entry undef15, arg2 -> undef16, arg3 -> 0, arg4 -> undef18, arg5 -> 2, arg6 -> 2, arg7 -> 2, rest remain the same}> 64.99/65.15 64.99/65.15 LOG: CALL check - Post:1 + arg1 + arg3 + arg4 + arg5 <= arg2 + arg7 - Process 9 64.99/65.15 * Exit transition: undef15, arg2 -> undef16, arg3 -> 0, arg4 -> undef18, arg5 -> 2, arg6 -> 2, arg7 -> 2, rest remain the same}> 64.99/65.15 * Postcondition : 1 + arg1 + arg3 + arg4 + arg5 <= arg2 + arg7 64.99/65.15 64.99/65.15 LOG: CALL solveLinear 64.99/65.15 64.99/65.15 LOG: RETURN solveLinear - Elapsed time: 0.001548s 64.99/65.15 > Postcondition is not implied! 64.99/65.15 64.99/65.15 LOG: RETURN check - Elapsed time: 0.001720s 64.99/65.15 Calling Safety with literal 1 + arg1 + arg3 + arg4 + arg5 <= arg2 + arg7 and entry undef22, arg2 -> undef23, arg3 -> undef24, arg4 -> -undef24 + undef29, arg5 -> undef46, arg6 -> 3, arg7 -> undef46, rest remain the same}> 64.99/65.15 64.99/65.15 LOG: CALL check - Post:1 + arg1 + arg3 + arg4 + arg5 <= arg2 + arg7 - Process 10 64.99/65.15 * Exit transition: undef22, arg2 -> undef23, arg3 -> undef24, arg4 -> -undef24 + undef29, arg5 -> undef46, arg6 -> 3, arg7 -> undef46, rest remain the same}> 64.99/65.15 * Postcondition : 1 + arg1 + arg3 + arg4 + arg5 <= arg2 + arg7 64.99/65.15 64.99/65.15 LOG: CALL solveLinear 64.99/65.15 64.99/65.15 LOG: RETURN solveLinear - Elapsed time: 0.001456s 64.99/65.15 > Postcondition is not implied! 64.99/65.15 64.99/65.15 LOG: RETURN check - Elapsed time: 0.001680s 64.99/65.15 INVARIANTS: 64.99/65.15 2: 64.99/65.15 Quasi-INVARIANTS to narrow Graph: 64.99/65.15 2: 1 + arg1 + arg3 + arg4 + arg5 <= arg2 + arg7 , 64.99/65.15 Narrowing transition: 64.99/65.15 undef30, arg2 -> 1 + arg2, arg3 -> 1 + arg2, arg4 -> 9 - arg2, arg7 -> arg5, rest remain the same}> 64.99/65.15 64.99/65.15 LOG: Narrow transition size 1 64.99/65.15 Narrowing transition: 64.99/65.15 undef37, arg2 -> 1 + arg2 + undef44, arg3 -> 1 + arg2 + undef44, arg4 -> 9 - arg2 - undef44, arg6 -> 1 + arg6, arg7 -> arg5, rest remain the same}> 64.99/65.15 64.99/65.15 LOG: Narrow transition size 1 64.99/65.15 invGraph after Narrowing: 64.99/65.15 Transitions: 64.99/65.15 undef30, arg2 -> 1 + arg2, arg3 -> 1 + arg2, arg4 -> 9 - arg2, arg7 -> arg5, rest remain the same}> 64.99/65.15 undef37, arg2 -> 1 + arg2 + undef44, arg3 -> 1 + arg2 + undef44, arg4 -> 9 - arg2 - undef44, arg6 -> 1 + arg6, arg7 -> arg5, rest remain the same}> 64.99/65.15 Variables: 64.99/65.15 arg1, arg2, arg3, arg4, arg5, arg6, arg7 64.99/65.15 Checking conditional termination of SCC {l2}... 64.99/65.15 64.99/65.15 LOG: CALL solveLinear 64.99/65.15 64.99/65.15 LOG: RETURN solveLinear - Elapsed time: 0.005271s 64.99/65.15 Ranking function: 4 + arg5 - arg6 64.99/65.15 New Graphs: 64.99/65.15 Transitions: 64.99/65.15 undef30, arg2 -> 1 + arg2, arg3 -> 1 + arg2, arg4 -> 9 - arg2, arg7 -> arg5, rest remain the same}> 64.99/65.15 Variables: 64.99/65.15 arg1, arg2, arg3, arg4, arg5, arg6, arg7 64.99/65.15 Checking conditional termination of SCC {l2}... 64.99/65.16 64.99/65.16 LOG: CALL solveLinear 64.99/65.16 64.99/65.16 LOG: RETURN solveLinear - Elapsed time: 0.001845s 64.99/65.16 64.99/65.16 LOG: CALL solveLinear 64.99/65.16 64.99/65.16 LOG: RETURN solveLinear - Elapsed time: 0.011322s 64.99/65.16 Trying to remove transition: undef30, arg2 -> 1 + arg2, arg3 -> 1 + arg2, arg4 -> 9 - arg2, arg7 -> arg5, rest remain the same}> 64.99/65.16 Solving with 1 template(s). 64.99/65.16 64.99/65.16 LOG: CALL solveNonLinearGetFirstSolution 64.99/65.16 64.99/65.16 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 3.246195s 64.99/65.16 Time used: 3.24498 64.99/65.16 Solving with 1 template(s). 64.99/65.16 64.99/65.16 LOG: CALL solveNonLinearGetFirstSolution 64.99/65.16 64.99/65.16 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.132373s 64.99/65.16 Time used: 0.125865 64.99/65.16 Improving Solution with cost 2 ... 64.99/65.16 64.99/65.16 LOG: CALL solveNonLinearGetNextSolution 64.99/65.16 64.99/65.16 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000853s 64.99/65.16 Time used: 1.00075 64.99/65.16 64.99/65.16 LOG: SAT solveNonLinear - Elapsed time: 1.133226s 64.99/65.16 Cost: 2; Total time: 1.12662 64.99/65.16 Failed at location 2: arg2 + arg4 + arg5 <= arg7 64.99/65.16 Failed at location 2: arg2 + arg4 + arg5 <= arg7 64.99/65.16 Before Improving: 64.99/65.16 Quasi-invariant at l2: arg2 + arg4 + arg5 <= arg7 64.99/65.16 Optimizing invariants... 64.99/65.16 64.99/65.16 LOG: CALL solveLinear 64.99/65.16 64.99/65.16 LOG: RETURN solveLinear - Elapsed time: 0.034647s 64.99/65.16 Remaining time after improvement: 0.993231 64.99/65.16 Termination implied by a set of quasi-invariant(s): 64.99/65.16 Quasi-invariant at l2: arg2 + arg4 + arg5 <= arg7 64.99/65.16 [ Invariant Graph ] 64.99/65.16 Strengthening and disabling transitions... 64.99/65.16 64.99/65.16 LOG: CALL solverLinear in Graph for feasibility 64.99/65.16 64.99/65.16 LOG: RETURN solveLinear in Graph for feasibility 64.99/65.16 It's unfeasible. Removing transition: 64.99/65.16 undef30, arg2 -> 1 + arg2, arg3 -> 1 + arg2, arg4 -> 9 - arg2, arg7 -> arg5, rest remain the same}> 64.99/65.16 64.99/65.16 LOG: CALL solverLinear in Graph for feasibility 64.99/65.16 64.99/65.16 LOG: RETURN solveLinear in Graph for feasibility 64.99/65.16 It's unfeasible. Removing transition: 64.99/65.16 undef37, arg2 -> 1 + arg2 + undef44, arg3 -> 1 + arg2 + undef44, arg4 -> 9 - arg2 - undef44, arg6 -> 1 + arg6, arg7 -> arg5, rest remain the same}> 64.99/65.16 [ Termination Graph ] 64.99/65.16 Strengthening and disabling transitions... 64.99/65.16 > It's unfeasible. Removing transition: 64.99/65.16 undef30, arg2 -> 1 + arg2, arg3 -> 1 + arg2, arg4 -> 9 - arg2, arg7 -> arg5, rest remain the same}> 64.99/65.16 New Graphs: 64.99/65.16 Calling Safety with literal arg2 + arg4 + arg5 <= arg7 and entry undef15, arg2 -> undef16, arg3 -> 0, arg4 -> undef18, arg5 -> 2, arg6 -> 2, arg7 -> 2, rest remain the same}> 64.99/65.16 64.99/65.16 LOG: CALL check - Post:arg2 + arg4 + arg5 <= arg7 - Process 11 64.99/65.16 * Exit transition: undef15, arg2 -> undef16, arg3 -> 0, arg4 -> undef18, arg5 -> 2, arg6 -> 2, arg7 -> 2, rest remain the same}> 64.99/65.16 * Postcondition : arg2 + arg4 + arg5 <= arg7 64.99/65.16 64.99/65.16 LOG: CALL solveLinear 64.99/65.16 64.99/65.16 LOG: RETURN solveLinear - Elapsed time: 0.001629s 64.99/65.16 > Postcondition is not implied! 64.99/65.16 64.99/65.16 LOG: RETURN check - Elapsed time: 0.001811s 64.99/65.16 Calling Safety with literal arg2 + arg4 + arg5 <= arg7 and entry undef22, arg2 -> undef23, arg3 -> undef24, arg4 -> -undef24 + undef29, arg5 -> undef46, arg6 -> 3, arg7 -> undef46, rest remain the same}> 64.99/65.16 64.99/65.16 LOG: CALL check - Post:arg2 + arg4 + arg5 <= arg7 - Process 12 64.99/65.16 * Exit transition: undef22, arg2 -> undef23, arg3 -> undef24, arg4 -> -undef24 + undef29, arg5 -> undef46, arg6 -> 3, arg7 -> undef46, rest remain the same}> 64.99/65.16 * Postcondition : arg2 + arg4 + arg5 <= arg7 64.99/65.16 64.99/65.16 LOG: CALL solveLinear 64.99/65.16 64.99/65.16 LOG: RETURN solveLinear - Elapsed time: 0.001419s 64.99/65.16 > Postcondition is not implied! 64.99/65.16 64.99/65.16 LOG: RETURN check - Elapsed time: 0.001648s 64.99/65.16 INVARIANTS: 64.99/65.16 2: 64.99/65.16 Quasi-INVARIANTS to narrow Graph: 64.99/65.16 2: arg2 + arg4 + arg5 <= arg7 , 64.99/65.16 Narrowing transition: 64.99/65.16 undef30, arg2 -> 1 + arg2, arg3 -> 1 + arg2, arg4 -> 9 - arg2, arg7 -> arg5, rest remain the same}> 64.99/65.16 64.99/65.16 LOG: Narrow transition size 1 64.99/65.16 Narrowing transition: 64.99/65.16 undef37, arg2 -> 1 + arg2 + undef44, arg3 -> 1 + arg2 + undef44, arg4 -> 9 - arg2 - undef44, arg6 -> 1 + arg6, arg7 -> arg5, rest remain the same}> 64.99/65.16 64.99/65.16 LOG: Narrow transition size 1 64.99/65.16 invGraph after Narrowing: 64.99/65.16 Transitions: 64.99/65.16 undef30, arg2 -> 1 + arg2, arg3 -> 1 + arg2, arg4 -> 9 - arg2, arg7 -> arg5, rest remain the same}> 64.99/65.16 undef37, arg2 -> 1 + arg2 + undef44, arg3 -> 1 + arg2 + undef44, arg4 -> 9 - arg2 - undef44, arg6 -> 1 + arg6, arg7 -> arg5, rest remain the same}> 64.99/65.16 Variables: 64.99/65.16 arg1, arg2, arg3, arg4, arg5, arg6, arg7 64.99/65.16 Checking conditional termination of SCC {l2}... 64.99/65.16 64.99/65.16 LOG: CALL solveLinear 64.99/65.16 64.99/65.16 LOG: RETURN solveLinear - Elapsed time: 0.006956s 64.99/65.16 Ranking function: -6 + 6*arg5 - 6*arg6 64.99/65.16 New Graphs: 64.99/65.16 Transitions: 64.99/65.16 undef30, arg2 -> 1 + arg2, arg3 -> 1 + arg2, arg4 -> 9 - arg2, arg7 -> arg5, rest remain the same}> 64.99/65.16 Variables: 64.99/65.16 arg1, arg2, arg3, arg4, arg5, arg6, arg7 64.99/65.16 Checking conditional termination of SCC {l2}... 64.99/65.16 64.99/65.16 LOG: CALL solveLinear 64.99/65.16 64.99/65.16 LOG: RETURN solveLinear - Elapsed time: 0.001943s 64.99/65.16 64.99/65.16 LOG: CALL solveLinear 64.99/65.16 64.99/65.16 LOG: RETURN solveLinear - Elapsed time: 0.010643s 64.99/65.16 Trying to remove transition: undef30, arg2 -> 1 + arg2, arg3 -> 1 + arg2, arg4 -> 9 - arg2, arg7 -> arg5, rest remain the same}> 64.99/65.16 Solving with 1 template(s). 64.99/65.16 64.99/65.16 LOG: CALL solveNonLinearGetFirstSolution 64.99/65.16 64.99/65.16 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 3.353512s 64.99/65.16 Time used: 3.35224 64.99/65.16 Solving with 1 template(s). 64.99/65.16 64.99/65.16 LOG: CALL solveNonLinearGetFirstSolution 64.99/65.16 64.99/65.16 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.134318s 64.99/65.16 Time used: 0.127924 64.99/65.16 Improving Solution with cost 2 ... 64.99/65.16 64.99/65.16 LOG: CALL solveNonLinearGetNextSolution 64.99/65.16 64.99/65.16 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.001050s 64.99/65.16 Time used: 1.00082 64.99/65.16 64.99/65.16 LOG: SAT solveNonLinear - Elapsed time: 1.135368s 64.99/65.16 Cost: 2; Total time: 1.12874 64.99/65.16 Failed at location 2: 1 + arg2 + arg5 <= arg3 + arg7 64.99/65.16 Failed at location 2: 1 + arg2 + arg5 <= arg3 + arg7 64.99/65.16 Before Improving: 64.99/65.16 Quasi-invariant at l2: 1 + arg2 + arg5 <= arg3 + arg7 64.99/65.16 Optimizing invariants... 64.99/65.16 64.99/65.16 LOG: CALL solveLinear 64.99/65.16 64.99/65.16 LOG: RETURN solveLinear - Elapsed time: 0.034915s 64.99/65.16 Remaining time after improvement: 0.993117 64.99/65.16 Termination implied by a set of quasi-invariant(s): 64.99/65.16 Quasi-invariant at l2: 1 + arg2 + arg5 <= arg3 + arg7 64.99/65.16 [ Invariant Graph ] 64.99/65.16 Strengthening and disabling transitions... 64.99/65.16 64.99/65.16 LOG: CALL solverLinear in Graph for feasibility 64.99/65.16 64.99/65.16 LOG: RETURN solveLinear in Graph for feasibility 64.99/65.16 It's unfeasible. Removing transition: 64.99/65.16 undef30, arg2 -> 1 + arg2, arg3 -> 1 + arg2, arg4 -> 9 - arg2, arg7 -> arg5, rest remain the same}> 64.99/65.16 64.99/65.16 LOG: CALL solverLinear in Graph for feasibility 64.99/65.16 64.99/65.16 LOG: RETURN solveLinear in Graph for feasibility 64.99/65.16 It's unfeasible. Removing transition: 64.99/65.16 undef37, arg2 -> 1 + arg2 + undef44, arg3 -> 1 + arg2 + undef44, arg4 -> 9 - arg2 - undef44, arg6 -> 1 + arg6, arg7 -> arg5, rest remain the same}> 64.99/65.16 [ Termination Graph ] 64.99/65.16 Strengthening and disabling transitions... 64.99/65.16 > It's unfeasible. Removing transition: 64.99/65.16 undef30, arg2 -> 1 + arg2, arg3 -> 1 + arg2, arg4 -> 9 - arg2, arg7 -> arg5, rest remain the same}> 64.99/65.16 New Graphs: 64.99/65.16 Calling Safety with literal 1 + arg2 + arg5 <= arg3 + arg7 and entry undef15, arg2 -> undef16, arg3 -> 0, arg4 -> undef18, arg5 -> 2, arg6 -> 2, arg7 -> 2, rest remain the same}> 64.99/65.16 64.99/65.16 LOG: CALL check - Post:1 + arg2 + arg5 <= arg3 + arg7 - Process 13 64.99/65.16 * Exit transition: undef15, arg2 -> undef16, arg3 -> 0, arg4 -> undef18, arg5 -> 2, arg6 -> 2, arg7 -> 2, rest remain the same}> 64.99/65.16 * Postcondition : 1 + arg2 + arg5 <= arg3 + arg7 64.99/65.16 64.99/65.16 LOG: CALL solveLinear 64.99/65.16 64.99/65.16 LOG: RETURN solveLinear - Elapsed time: 0.001736s 64.99/65.16 > Postcondition is not implied! 64.99/65.16 64.99/65.16 LOG: RETURN check - Elapsed time: 0.001900s 64.99/65.16 Calling Safety with literal 1 + arg2 + arg5 <= arg3 + arg7 and entry undef22, arg2 -> undef23, arg3 -> undef24, arg4 -> -undef24 + undef29, arg5 -> undef46, arg6 -> 3, arg7 -> undef46, rest remain the same}> 64.99/65.16 64.99/65.16 LOG: CALL check - Post:1 + arg2 + arg5 <= arg3 + arg7 - Process 14 64.99/65.16 * Exit transition: undef22, arg2 -> undef23, arg3 -> undef24, arg4 -> -undef24 + undef29, arg5 -> undef46, arg6 -> 3, arg7 -> undef46, rest remain the same}> 64.99/65.16 * Postcondition : 1 + arg2 + arg5 <= arg3 + arg7 64.99/65.16 64.99/65.16 LOG: CALL solveLinear 64.99/65.16 64.99/65.16 LOG: RETURN solveLinear - Elapsed time: 0.001517s 64.99/65.16 > Postcondition is not implied! 64.99/65.16 64.99/65.16 LOG: RETURN check - Elapsed time: 0.001737s 64.99/65.16 INVARIANTS: 64.99/65.16 2: 64.99/65.16 Quasi-INVARIANTS to narrow Graph: 64.99/65.16 2: 1 + arg2 + arg5 <= arg3 + arg7 , 64.99/65.16 Narrowing transition: 64.99/65.16 undef30, arg2 -> 1 + arg2, arg3 -> 1 + arg2, arg4 -> 9 - arg2, arg7 -> arg5, rest remain the same}> 64.99/65.16 64.99/65.16 LOG: Narrow transition size 1 64.99/65.16 Narrowing transition: 64.99/65.16 undef37, arg2 -> 1 + arg2 + undef44, arg3 -> 1 + arg2 + undef44, arg4 -> 9 - arg2 - undef44, arg6 -> 1 + arg6, arg7 -> arg5, rest remain the same}> 64.99/65.16 64.99/65.16 LOG: Narrow transition size 1 64.99/65.16 invGraph after Narrowing: 64.99/65.16 Transitions: 64.99/65.16 undef30, arg2 -> 1 + arg2, arg3 -> 1 + arg2, arg4 -> 9 - arg2, arg7 -> arg5, rest remain the same}> 64.99/65.16 undef37, arg2 -> 1 + arg2 + undef44, arg3 -> 1 + arg2 + undef44, arg4 -> 9 - arg2 - undef44, arg6 -> 1 + arg6, arg7 -> arg5, rest remain the same}> 64.99/65.16 Variables: 64.99/65.16 arg1, arg2, arg3, arg4, arg5, arg6, arg7 64.99/65.16 Checking conditional termination of SCC {l2}... 64.99/65.16 64.99/65.16 LOG: CALL solveLinear 64.99/65.16 64.99/65.16 LOG: RETURN solveLinear - Elapsed time: 0.006553s 64.99/65.16 Ranking function: arg5 - arg6 64.99/65.16 New Graphs: 64.99/65.16 Transitions: 64.99/65.16 undef30, arg2 -> 1 + arg2, arg3 -> 1 + arg2, arg4 -> 9 - arg2, arg7 -> arg5, rest remain the same}> 64.99/65.16 Variables: 64.99/65.16 arg1, arg2, arg3, arg4, arg5, arg6, arg7 64.99/65.16 Checking conditional termination of SCC {l2}... 64.99/65.16 64.99/65.16 LOG: CALL solveLinear 64.99/65.16 64.99/65.16 LOG: RETURN solveLinear - Elapsed time: 0.002051s 64.99/65.16 64.99/65.16 LOG: CALL solveLinear 64.99/65.16 64.99/65.16 LOG: RETURN solveLinear - Elapsed time: 0.010626s 64.99/65.16 Trying to remove transition: undef30, arg2 -> 1 + arg2, arg3 -> 1 + arg2, arg4 -> 9 - arg2, arg7 -> arg5, rest remain the same}> 64.99/65.16 Solving with 1 template(s). 64.99/65.16 64.99/65.16 LOG: CALL solveNonLinearGetFirstSolution 64.99/65.16 64.99/65.16 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.002859s 64.99/65.16 Time used: 4.00152 64.99/65.16 Solving with 1 template(s). 64.99/65.16 64.99/65.16 LOG: CALL solveNonLinearGetFirstSolution 64.99/65.16 64.99/65.16 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.153189s 64.99/65.16 Time used: 0.146303 64.99/65.16 Improving Solution with cost 2 ... 64.99/65.16 64.99/65.16 LOG: CALL solveNonLinearGetNextSolution 64.99/65.16 64.99/65.16 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000953s 64.99/65.16 Time used: 1.00085 64.99/65.16 64.99/65.16 LOG: SAT solveNonLinear - Elapsed time: 1.154142s 64.99/65.16 Cost: 2; Total time: 1.14715 64.99/65.16 Failed at location 2: 1 + arg2 + arg4 + arg5 + arg6 <= arg3 + arg7 64.99/65.16 Failed at location 2: 1 + arg2 + arg4 + arg5 + arg6 <= arg3 + arg7 64.99/65.16 Before Improving: 64.99/65.16 Quasi-invariant at l2: 1 + arg2 + arg4 + arg5 + arg6 <= arg3 + arg7 64.99/65.16 Optimizing invariants... 64.99/65.16 64.99/65.16 LOG: CALL solveLinear 64.99/65.16 64.99/65.16 LOG: RETURN solveLinear - Elapsed time: 0.035674s 64.99/65.16 Remaining time after improvement: 0.992559 64.99/65.16 Termination implied by a set of quasi-invariant(s): 64.99/65.16 Quasi-invariant at l2: 1 + arg2 + arg4 + arg5 + arg6 <= arg3 + arg7 64.99/65.16 [ Invariant Graph ] 64.99/65.16 Strengthening and disabling transitions... 64.99/65.16 64.99/65.16 LOG: CALL solverLinear in Graph for feasibility 64.99/65.16 64.99/65.16 LOG: RETURN solveLinear in Graph for feasibility 64.99/65.16 It's unfeasible. Removing transition: 64.99/65.16 undef30, arg2 -> 1 + arg2, arg3 -> 1 + arg2, arg4 -> 9 - arg2, arg7 -> arg5, rest remain the same}> 64.99/65.16 64.99/65.16 LOG: CALL solverLinear in Graph for feasibility 64.99/65.16 64.99/65.16 LOG: RETURN solveLinear in Graph for feasibility 64.99/65.16 It's unfeasible. Removing transition: 64.99/65.16 undef37, arg2 -> 1 + arg2 + undef44, arg3 -> 1 + arg2 + undef44, arg4 -> 9 - arg2 - undef44, arg6 -> 1 + arg6, arg7 -> arg5, rest remain the same}> 64.99/65.16 [ Termination Graph ] 64.99/65.16 Strengthening and disabling transitions... 64.99/65.16 64.99/65.16 LOG: CALL solverLinear in Graph for feasibility 64.99/65.16 64.99/65.16 LOG: RETURN solveLinear in Graph for feasibility 64.99/65.16 It's unfeasible. Removing transition: 64.99/65.16 undef30, arg2 -> 1 + arg2, arg3 -> 1 + arg2, arg4 -> 9 - arg2, arg7 -> arg5, rest remain the same}> 64.99/65.16 New Graphs: 64.99/65.16 Calling Safety with literal 1 + arg2 + arg4 + arg5 + arg6 <= arg3 + arg7 and entry undef15, arg2 -> undef16, arg3 -> 0, arg4 -> undef18, arg5 -> 2, arg6 -> 2, arg7 -> 2, rest remain the same}> 64.99/65.16 64.99/65.16 LOG: CALL check - Post:1 + arg2 + arg4 + arg5 + arg6 <= arg3 + arg7 - Process 15 64.99/65.16 * Exit transition: undef15, arg2 -> undef16, arg3 -> 0, arg4 -> undef18, arg5 -> 2, arg6 -> 2, arg7 -> 2, rest remain the same}> 64.99/65.16 * Postcondition : 1 + arg2 + arg4 + arg5 + arg6 <= arg3 + arg7 64.99/65.16 64.99/65.16 LOG: CALL solveLinear 64.99/65.16 64.99/65.16 LOG: RETURN solveLinear - Elapsed time: 0.001857s 64.99/65.16 > Postcondition is not implied! 64.99/65.16 64.99/65.16 LOG: RETURN check - Elapsed time: 0.002034s 64.99/65.16 Calling Safety with literal 1 + arg2 + arg4 + arg5 + arg6 <= arg3 + arg7 and entry undef22, arg2 -> undef23, arg3 -> undef24, arg4 -> -undef24 + undef29, arg5 -> undef46, arg6 -> 3, arg7 -> undef46, rest remain the same}> 64.99/65.16 64.99/65.16 LOG: CALL check - Post:1 + arg2 + arg4 + arg5 + arg6 <= arg3 + arg7 - Process 16 64.99/65.16 * Exit transition: undef22, arg2 -> undef23, arg3 -> undef24, arg4 -> -undef24 + undef29, arg5 -> undef46, arg6 -> 3, arg7 -> undef46, rest remain the same}> 64.99/65.16 * Postcondition : 1 + arg2 + arg4 + arg5 + arg6 <= arg3 + arg7 64.99/65.16 64.99/65.16 LOG: CALL solveLinear 64.99/65.16 64.99/65.16 LOG: RETURN solveLinear - Elapsed time: 0.001652s 64.99/65.16 > Postcondition is not implied! 64.99/65.16 64.99/65.16 LOG: RETURN check - Elapsed time: 0.001876s 64.99/65.16 INVARIANTS: 64.99/65.16 2: 64.99/65.16 Quasi-INVARIANTS to narrow Graph: 64.99/65.16 2: 1 + arg2 + arg4 + arg5 + arg6 <= arg3 + arg7 , 64.99/65.16 Narrowing transition: 64.99/65.16 undef30, arg2 -> 1 + arg2, arg3 -> 1 + arg2, arg4 -> 9 - arg2, arg7 -> arg5, rest remain the same}> 64.99/65.16 64.99/65.16 LOG: Narrow transition size 1 64.99/65.16 Narrowing transition: 64.99/65.16 undef37, arg2 -> 1 + arg2 + undef44, arg3 -> 1 + arg2 + undef44, arg4 -> 9 - arg2 - undef44, arg6 -> 1 + arg6, arg7 -> arg5, rest remain the same}> 64.99/65.16 64.99/65.16 LOG: Narrow transition size 1 64.99/65.16 invGraph after Narrowing: 64.99/65.16 Transitions: 64.99/65.16 undef30, arg2 -> 1 + arg2, arg3 -> 1 + arg2, arg4 -> 9 - arg2, arg7 -> arg5, rest remain the same}> 64.99/65.16 undef37, arg2 -> 1 + arg2 + undef44, arg3 -> 1 + arg2 + undef44, arg4 -> 9 - arg2 - undef44, arg6 -> 1 + arg6, arg7 -> arg5, rest remain the same}> 64.99/65.16 Variables: 64.99/65.16 arg1, arg2, arg3, arg4, arg5, arg6, arg7 64.99/65.16 Checking conditional termination of SCC {l2}... 64.99/65.16 64.99/65.16 LOG: CALL solveLinear 64.99/65.16 64.99/65.16 LOG: RETURN solveLinear - Elapsed time: 0.006968s 64.99/65.16 Ranking function: arg5 - arg6 64.99/65.16 New Graphs: 64.99/65.16 Transitions: 64.99/65.16 undef30, arg2 -> 1 + arg2, arg3 -> 1 + arg2, arg4 -> 9 - arg2, arg7 -> arg5, rest remain the same}> 64.99/65.16 Variables: 64.99/65.16 arg1, arg2, arg3, arg4, arg5, arg6, arg7 64.99/65.16 Checking conditional termination of SCC {l2}... 64.99/65.16 64.99/65.16 LOG: CALL solveLinear 64.99/65.16 64.99/65.16 LOG: RETURN solveLinear - Elapsed time: 0.002189s 64.99/65.16 64.99/65.16 LOG: CALL solveLinear 64.99/65.16 64.99/65.16 LOG: RETURN solveLinear - Elapsed time: 0.011938s 64.99/65.16 Trying to remove transition: undef30, arg2 -> 1 + arg2, arg3 -> 1 + arg2, arg4 -> 9 - arg2, arg7 -> arg5, rest remain the same}> 64.99/65.16 Solving with 1 template(s). 64.99/65.16 64.99/65.16 LOG: CALL solveNonLinearGetFirstSolution 64.99/65.16 64.99/65.16 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 3.707303s 64.99/65.16 Time used: 3.70596 64.99/65.16 Solving with 1 template(s). 64.99/65.16 64.99/65.16 LOG: CALL solveNonLinearGetFirstSolution 64.99/65.16 64.99/65.16 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.136349s 64.99/65.16 Time used: 0.129537 64.99/65.16 Improving Solution with cost 2 ... 64.99/65.16 64.99/65.16 LOG: CALL solveNonLinearGetNextSolution 64.99/65.16 64.99/65.16 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.002248s 64.99/65.16 Time used: 1.00201 64.99/65.16 64.99/65.16 LOG: SAT solveNonLinear - Elapsed time: 1.138596s 64.99/65.16 Cost: 2; Total time: 1.13154 64.99/65.16 Failed at location 2: 1 + arg4 + arg7 <= arg5 64.99/65.16 Failed at location 2: 1 + arg4 + arg7 <= arg5 64.99/65.16 Before Improving: 64.99/65.16 Quasi-invariant at l2: 1 + arg4 + arg7 <= arg5 64.99/65.16 Optimizing invariants... 64.99/65.16 64.99/65.16 LOG: CALL solveLinear 64.99/65.16 64.99/65.16 LOG: RETURN solveLinear - Elapsed time: 0.072002s 64.99/65.16 Remaining time after improvement: 0.991834 64.99/65.16 Termination implied by a set of quasi-invariant(s): 64.99/65.16 Quasi-invariant at l2: 1 + arg4 + arg7 <= arg5 64.99/65.16 [ Invariant Graph ] 64.99/65.16 Strengthening and disabling transitions... 64.99/65.16 64.99/65.16 LOG: CALL solverLinear in Graph for feasibility 64.99/65.16 64.99/65.16 LOG: RETURN solveLinear in Graph for feasibility 64.99/65.16 It's unfeasible. Removing transition: 64.99/65.16 undef30, arg2 -> 1 + arg2, arg3 -> 1 + arg2, arg4 -> 9 - arg2, arg7 -> arg5, rest remain the same}> 64.99/65.16 64.99/65.16 LOG: CALL solverLinear in Graph for feasibility 64.99/65.16 64.99/65.16 LOG: RETURN solveLinear in Graph for feasibility 64.99/65.16 It's unfeasible. Removing transition: 64.99/65.16 undef37, arg2 -> 1 + arg2 + undef44, arg3 -> 1 + arg2 + undef44, arg4 -> 9 - arg2 - undef44, arg6 -> 1 + arg6, arg7 -> arg5, rest remain the same}> 64.99/65.16 [ Termination Graph ] 64.99/65.16 Strengthening and disabling transitions... 64.99/65.16 64.99/65.16 LOG: CALL solverLinear in Graph for feasibility 64.99/65.16 64.99/65.16 LOG: RETURN solveLinear in Graph for feasibility 64.99/65.16 It's unfeasible. Removing transition: 64.99/65.16 undef30, arg2 -> 1 + arg2, arg3 -> 1 + arg2, arg4 -> 9 - arg2, arg7 -> arg5, rest remain the same}> 64.99/65.16 New Graphs: 64.99/65.16 Calling Safety with literal 1 + arg4 + arg7 <= arg5 and entry undef15, arg2 -> undef16, arg3 -> 0, arg4 -> undef18, arg5 -> 2, arg6 -> 2, arg7 -> 2, rest remain the same}> 64.99/65.16 64.99/65.16 LOG: CALL check - Post:1 + arg4 + arg7 <= arg5 - Process 17 64.99/65.16 * Exit transition: undef15, arg2 -> undef16, arg3 -> 0, arg4 -> undef18, arg5 -> 2, arg6 -> 2, arg7 -> 2, rest remain the same}> 64.99/65.16 * Postcondition : 1 + arg4 + arg7 <= arg5 64.99/65.16 64.99/65.16 LOG: CALL solveLinear 64.99/65.16 64.99/65.16 LOG: RETURN solveLinear - Elapsed time: 0.002272s 64.99/65.16 > Postcondition is not implied! 64.99/65.16 64.99/65.16 LOG: RETURN check - Elapsed time: 0.002436s 64.99/65.16 Calling Safety with literal 1 + arg4 + arg7 <= arg5 and entry undef22, arg2 -> undef23, arg3 -> undef24, arg4 -> -undef24 + undef29, arg5 -> undef46, arg6 -> 3, arg7 -> undef46, rest remain the same}> 64.99/65.16 64.99/65.16 LOG: CALL check - Post:1 + arg4 + arg7 <= arg5 - Process 18 64.99/65.16 * Exit transition: undef22, arg2 -> undef23, arg3 -> undef24, arg4 -> -undef24 + undef29, arg5 -> undef46, arg6 -> 3, arg7 -> undef46, rest remain the same}> 64.99/65.16 * Postcondition : 1 + arg4 + arg7 <= arg5 64.99/65.16 64.99/65.16 LOG: CALL solveLinear 64.99/65.16 64.99/65.16 LOG: RETURN solveLinear - Elapsed time: 0.001758s 64.99/65.16 > Postcondition is not implied! 64.99/65.16 64.99/65.16 LOG: RETURN check - Elapsed time: 0.001981s 64.99/65.16 INVARIANTS: 64.99/65.16 2: 64.99/65.16 Quasi-INVARIANTS to narrow Graph: 64.99/65.16 2: 1 + arg4 + arg7 <= arg5 , 64.99/65.16 Narrowing transition: 64.99/65.16 undef30, arg2 -> 1 + arg2, arg3 -> 1 + arg2, arg4 -> 9 - arg2, arg7 -> arg5, rest remain the same}> 64.99/65.16 64.99/65.16 LOG: Narrow transition size 1 64.99/65.16 Narrowing transition: 64.99/65.16 undef37, arg2 -> 1 + arg2 + undef44, arg3 -> 1 + arg2 + undef44, arg4 -> 9 - arg2 - undef44, arg6 -> 1 + arg6, arg7 -> arg5, rest remain the same}> 64.99/65.16 64.99/65.16 LOG: Narrow transition size 1 64.99/65.16 invGraph after Narrowing: 64.99/65.16 Transitions: 64.99/65.16 undef30, arg2 -> 1 + arg2, arg3 -> 1 + arg2, arg4 -> 9 - arg2, arg7 -> arg5, rest remain the same}> 64.99/65.16 undef37, arg2 -> 1 + arg2 + undef44, arg3 -> 1 + arg2 + undef44, arg4 -> 9 - arg2 - undef44, arg6 -> 1 + arg6, arg7 -> arg5, rest remain the same}> 64.99/65.16 Variables: 64.99/65.16 arg1, arg2, arg3, arg4, arg5, arg6, arg7 64.99/65.16 Checking conditional termination of SCC {l2}... 64.99/65.16 64.99/65.16 LOG: CALL solveLinear 64.99/65.16 64.99/65.16 LOG: RETURN solveLinear - Elapsed time: 0.006978s 64.99/65.16 Ranking function: 5 + arg5 - arg6 64.99/65.16 New Graphs: 64.99/65.16 Transitions: 64.99/65.16 undef30, arg2 -> 1 + arg2, arg3 -> 1 + arg2, arg4 -> 9 - arg2, arg7 -> arg5, rest remain the same}> 64.99/65.16 Variables: 64.99/65.16 arg1, arg2, arg3, arg4, arg5, arg6, arg7 64.99/65.16 Checking conditional termination of SCC {l2}... 64.99/65.16 64.99/65.16 LOG: CALL solveLinear 64.99/65.16 64.99/65.16 LOG: RETURN solveLinear - Elapsed time: 0.002327s 64.99/65.16 64.99/65.16 LOG: CALL solveLinear 64.99/65.16 64.99/65.16 LOG: RETURN solveLinear - Elapsed time: 0.013268s 64.99/65.16 Trying to remove transition: undef30, arg2 -> 1 + arg2, arg3 -> 1 + arg2, arg4 -> 9 - arg2, arg7 -> arg5, rest remain the same}> 64.99/65.16 Solving with 1 template(s). 64.99/65.16 64.99/65.16 LOG: CALL solveNonLinearGetFirstSolution 64.99/65.16 64.99/65.16 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 3.684480s 64.99/65.16 Time used: 3.683 64.99/65.16 Solving with 1 template(s). 64.99/65.16 64.99/65.16 LOG: CALL solveNonLinearGetFirstSolution 64.99/65.16 64.99/65.16 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.230258s 64.99/65.16 Time used: 0.223378 64.99/65.16 Improving Solution with cost 2 ... 64.99/65.16 64.99/65.16 LOG: CALL solveNonLinearGetNextSolution 64.99/65.16 64.99/65.16 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.001124s 64.99/65.16 Time used: 1.00102 64.99/65.16 64.99/65.16 LOG: SAT solveNonLinear - Elapsed time: 1.231382s 64.99/65.16 Cost: 2; Total time: 1.2244 64.99/65.16 Failed at location 2: arg1 + arg3 + arg4 + arg7 <= 1 + arg2 + arg5 64.99/65.16 Failed at location 2: arg1 + arg3 + arg4 + arg7 <= 1 + arg2 + arg5 64.99/65.16 Before Improving: 64.99/65.16 Quasi-invariant at l2: arg1 + arg3 + arg4 + arg7 <= 1 + arg2 + arg5 64.99/65.16 Optimizing invariants... 64.99/65.16 64.99/65.16 LOG: CALL solveLinear 64.99/65.16 64.99/65.16 LOG: RETURN solveLinear - Elapsed time: 0.037116s 64.99/65.16 Remaining time after improvement: 0.991472 64.99/65.16 Termination implied by a set of quasi-invariant(s): 64.99/65.16 Quasi-invariant at l2: arg1 + arg3 + arg4 + arg7 <= 1 + arg2 + arg5 64.99/65.16 [ Invariant Graph ] 64.99/65.16 Strengthening and disabling transitions... 64.99/65.16 64.99/65.16 LOG: CALL solverLinear in Graph for feasibility 64.99/65.16 64.99/65.16 LOG: RETURN solveLinear in Graph for feasibility 64.99/65.16 It's unfeasible. Removing transition: 64.99/65.16 undef30, arg2 -> 1 + arg2, arg3 -> 1 + arg2, arg4 -> 9 - arg2, arg7 -> arg5, rest remain the same}> 64.99/65.16 64.99/65.16 LOG: CALL solverLinear in Graph for feasibility 64.99/65.16 64.99/65.16 LOG: RETURN solveLinear in Graph for feasibility 64.99/65.16 It's unfeasible. Removing transition: 64.99/65.16 undef37, arg2 -> 1 + arg2 + undef44, arg3 -> 1 + arg2 + undef44, arg4 -> 9 - arg2 - undef44, arg6 -> 1 + arg6, arg7 -> arg5, rest remain the same}> 64.99/65.16 [ Termination Graph ] 64.99/65.16 Strengthening and disabling transitions... 64.99/65.16 64.99/65.16 LOG: CALL solverLinear in Graph for feasibility 64.99/65.16 64.99/65.16 LOG: RETURN solveLinear in Graph for feasibility 64.99/65.16 It's unfeasible. Removing transition: 64.99/65.16 undef30, arg2 -> 1 + arg2, arg3 -> 1 + arg2, arg4 -> 9 - arg2, arg7 -> arg5, rest remain the same}> 64.99/65.16 New Graphs: 64.99/65.16 Calling Safety with literal arg1 + arg3 + arg4 + arg7 <= 1 + arg2 + arg5 and entry undef15, arg2 -> undef16, arg3 -> 0, arg4 -> undef18, arg5 -> 2, arg6 -> 2, arg7 -> 2, rest remain the same}> 64.99/65.16 64.99/65.16 LOG: CALL check - Post:arg1 + arg3 + arg4 + arg7 <= 1 + arg2 + arg5 - Process 19 64.99/65.16 * Exit transition: undef15, arg2 -> undef16, arg3 -> 0, arg4 -> undef18, arg5 -> 2, arg6 -> 2, arg7 -> 2, rest remain the same}> 64.99/65.16 * Postcondition : arg1 + arg3 + arg4 + arg7 <= 1 + arg2 + arg5 64.99/65.16 64.99/65.16 LOG: CALL solveLinear 64.99/65.16 64.99/65.16 LOG: RETURN solveLinear - Elapsed time: 0.002058s 64.99/65.16 > Postcondition is not implied! 64.99/65.16 64.99/65.16 LOG: RETURN check - Elapsed time: 0.002253s 64.99/65.16 Calling Safety with literal arg1 + arg3 + arg4 + arg7 <= 1 + arg2 + arg5 and entry undef22, arg2 -> undef23, arg3 -> undef24, arg4 -> -undef24 + undef29, arg5 -> undef46, arg6 -> 3, arg7 -> undef46, rest remain the same}> 64.99/65.16 64.99/65.16 LOG: CALL check - Post:arg1 + arg3 + arg4 + arg7 <= 1 + arg2 + arg5 - Process 20 64.99/65.16 * Exit transition: undef22, arg2 -> undef23, arg3 -> undef24, arg4 -> -undef24 + undef29, arg5 -> undef46, arg6 -> 3, arg7 -> undef46, rest remain the same}> 64.99/65.16 * Postcondition : arg1 + arg3 + arg4 + arg7 <= 1 + arg2 + arg5 64.99/65.16 64.99/65.16 LOG: CALL solveLinear 64.99/65.16 64.99/65.16 LOG: RETURN solveLinear - Elapsed time: 0.001877s 64.99/65.16 > Postcondition is not implied! 64.99/65.16 64.99/65.16 LOG: RETURN check - Elapsed time: 0.002128s 64.99/65.16 INVARIANTS: 64.99/65.16 2: 64.99/65.16 Quasi-INVARIANTS to narrow Graph: 64.99/65.16 2: arg1 + arg3 + arg4 + arg7 <= 1 + arg2 + arg5 , 64.99/65.16 Narrowing transition: 64.99/65.16 undef30, arg2 -> 1 + arg2, arg3 -> 1 + arg2, arg4 -> 9 - arg2, arg7 -> arg5, rest remain the same}> 64.99/65.16 64.99/65.16 LOG: Narrow transition size 1 64.99/65.16 Narrowing transition: 64.99/65.16 undef37, arg2 -> 1 + arg2 + undef44, arg3 -> 1 + arg2 + undef44, arg4 -> 9 - arg2 - undef44, arg6 -> 1 + arg6, arg7 -> arg5, rest remain the same}> 64.99/65.16 64.99/65.16 LOG: Narrow transition size 1 64.99/65.16 invGraph after Narrowing: 64.99/65.16 Transitions: 64.99/65.16 undef30, arg2 -> 1 + arg2, arg3 -> 1 + arg2, arg4 -> 9 - arg2, arg7 -> arg5, rest remain the same}> 64.99/65.16 undef37, arg2 -> 1 + arg2 + undef44, arg3 -> 1 + arg2 + undef44, arg4 -> 9 - arg2 - undef44, arg6 -> 1 + arg6, arg7 -> arg5, rest remain the same}> 64.99/65.16 Variables: 64.99/65.16 arg1, arg2, arg3, arg4, arg5, arg6, arg7 64.99/65.16 Checking conditional termination of SCC {l2}... 64.99/65.16 64.99/65.16 LOG: CALL solveLinear 64.99/65.16 64.99/65.16 LOG: RETURN solveLinear - Elapsed time: 0.007634s 64.99/65.16 Ranking function: 1 + arg5 - arg6 64.99/65.16 New Graphs: 64.99/65.16 Transitions: 64.99/65.16 undef30, arg2 -> 1 + arg2, arg3 -> 1 + arg2, arg4 -> 9 - arg2, arg7 -> arg5, rest remain the same}> 64.99/65.16 Variables: 64.99/65.16 arg1, arg2, arg3, arg4, arg5, arg6, arg7 64.99/65.16 Checking conditional termination of SCC {l2}... 64.99/65.16 64.99/65.16 LOG: CALL solveLinear 64.99/65.16 64.99/65.16 LOG: RETURN solveLinear - Elapsed time: 0.002549s 64.99/65.16 64.99/65.16 LOG: CALL solveLinear 64.99/65.16 64.99/65.16 LOG: RETURN solveLinear - Elapsed time: 0.016104s 64.99/65.16 Trying to remove transition: undef30, arg2 -> 1 + arg2, arg3 -> 1 + arg2, arg4 -> 9 - arg2, arg7 -> arg5, rest remain the same}> 64.99/65.16 Solving with 1 template(s). 64.99/65.16 64.99/65.16 LOG: CALL solveNonLinearGetFirstSolution 64.99/65.16 64.99/65.16 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.003109s 64.99/65.16 Time used: 4.00167 64.99/65.16 Solving with 1 template(s). 64.99/65.16 64.99/65.16 LOG: CALL solveNonLinearGetFirstSolution 64.99/65.16 64.99/65.16 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.178544s 64.99/65.16 Time used: 0.170695 64.99/65.16 Improving Solution with cost 2 ... 64.99/65.16 64.99/65.16 LOG: CALL solveNonLinearGetNextSolution 64.99/65.16 64.99/65.16 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.001249s 64.99/65.16 Time used: 1.00102 64.99/65.16 64.99/65.16 LOG: SAT solveNonLinear - Elapsed time: 1.179794s 64.99/65.16 Cost: 2; Total time: 1.17172 64.99/65.16 Failed at location 2: arg4 <= 0 64.99/65.16 Failed at location 2: arg4 <= 0 64.99/65.16 Before Improving: 64.99/65.16 Quasi-invariant at l2: arg4 <= 0 64.99/65.16 Optimizing invariants... 64.99/65.16 64.99/65.16 LOG: CALL solveLinear 64.99/65.16 64.99/65.16 LOG: RETURN solveLinear - Elapsed time: 0.037694s 64.99/65.16 Remaining time after improvement: 0.991193 64.99/65.16 Termination implied by a set of quasi-invariant(s): 64.99/65.16 Quasi-invariant at l2: arg4 <= 0 64.99/65.16 [ Invariant Graph ] 64.99/65.16 Strengthening and disabling transitions... 64.99/65.16 64.99/65.16 LOG: CALL solverLinear in Graph for feasibility 64.99/65.16 64.99/65.16 LOG: RETURN solveLinear in Graph for feasibility 64.99/65.16 It's unfeasible. Removing transition: 64.99/65.16 undef30, arg2 -> 1 + arg2, arg3 -> 1 + arg2, arg4 -> 9 - arg2, arg7 -> arg5, rest remain the same}> 64.99/65.16 64.99/65.16 LOG: CALL solverLinear in Graph for feasibility 64.99/65.16 64.99/65.16 LOG: RETURN solveLinear in Graph for feasibility 64.99/65.16 It's unfeasible. Removing transition: 64.99/65.16 undef37, arg2 -> 1 + arg2 + undef44, arg3 -> 1 + arg2 + undef44, arg4 -> 9 - arg2 - undef44, arg6 -> 1 + arg6, arg7 -> arg5, rest remain the same}> 64.99/65.16 [ Termination Graph ] 64.99/65.16 Strengthening and disabling transitions... 64.99/65.16 > It's unfeasible. Removing transition: 64.99/65.16 undef30, arg2 -> 1 + arg2, arg3 -> 1 + arg2, arg4 -> 9 - arg2, arg7 -> arg5, rest remain the same}> 64.99/65.16 New Graphs: 64.99/65.16 Calling Safety with literal arg4 <= 0 and entry undef15, arg2 -> undef16, arg3 -> 0, arg4 -> undef18, arg5 -> 2, arg6 -> 2, arg7 -> 2, rest remain the same}> 64.99/65.16 64.99/65.16 LOG: CALL check - Post:arg4 <= 0 - Process 21 64.99/65.16 * Exit transition: undef15, arg2 -> undef16, arg3 -> 0, arg4 -> undef18, arg5 -> 2, arg6 -> 2, arg7 -> 2, rest remain the same}> 64.99/65.16 * Postcondition : arg4 <= 0 64.99/65.16 64.99/65.16 LOG: CALL solveLinear 64.99/65.16 64.99/65.16 LOG: RETURN solveLinear - Elapsed time: 0.002151s 64.99/65.16 > Postcondition is not implied! 64.99/65.16 64.99/65.16 LOG: RETURN check - Elapsed time: 0.002318s 64.99/65.16 Calling Safety with literal arg4 <= 0 and entry undef22, arg2 -> undef23, arg3 -> undef24, arg4 -> -undef24 + undef29, arg5 -> undef46, arg6 -> 3, arg7 -> undef46, rest remain the same}> 64.99/65.16 64.99/65.16 LOG: CALL check - Post:arg4 <= 0 - Process 22 64.99/65.16 * Exit transition: undef22, arg2 -> undef23, arg3 -> undef24, arg4 -> -undef24 + undef29, arg5 -> undef46, arg6 -> 3, arg7 -> undef46, rest remain the same}> 64.99/65.16 * Postcondition : arg4 <= 0 64.99/65.16 64.99/65.16 LOG: CALL solveLinear 64.99/65.16 64.99/65.16 LOG: RETURN solveLinear - Elapsed time: 0.002065s 64.99/65.16 > Postcondition is not implied! 64.99/65.16 64.99/65.16 LOG: RETURN check - Elapsed time: 0.002285s 64.99/65.16 INVARIANTS: 64.99/65.16 2: 64.99/65.16 Quasi-INVARIANTS to narrow Graph: 64.99/65.16 2: arg4 <= 0 , 64.99/65.16 Narrowing transition: 64.99/65.16 undef30, arg2 -> 1 + arg2, arg3 -> 1 + arg2, arg4 -> 9 - arg2, arg7 -> arg5, rest remain the same}> 64.99/65.16 64.99/65.16 LOG: Narrow transition size 1 64.99/65.16 Narrowing transition: 64.99/65.16 undef37, arg2 -> 1 + arg2 + undef44, arg3 -> 1 + arg2 + undef44, arg4 -> 9 - arg2 - undef44, arg6 -> 1 + arg6, arg7 -> arg5, rest remain the same}> 64.99/65.16 64.99/65.16 LOG: Narrow transition size 1 64.99/65.16 invGraph after Narrowing: 64.99/65.16 Transitions: 64.99/65.16 undef30, arg2 -> 1 + arg2, arg3 -> 1 + arg2, arg4 -> 9 - arg2, arg7 -> arg5, rest remain the same}> 64.99/65.16 undef37, arg2 -> 1 + arg2 + undef44, arg3 -> 1 + arg2 + undef44, arg4 -> 9 - arg2 - undef44, arg6 -> 1 + arg6, arg7 -> arg5, rest remain the same}> 64.99/65.16 Variables: 64.99/65.16 arg1, arg2, arg3, arg4, arg5, arg6, arg7 64.99/65.16 Checking conditional termination of SCC {l2}... 64.99/65.16 64.99/65.16 LOG: CALL solveLinear 64.99/65.16 64.99/65.16 LOG: RETURN solveLinear - Elapsed time: 0.008129s 64.99/65.16 Ranking function: 1 + arg5 - arg6 64.99/65.16 New Graphs: 64.99/65.16 Transitions: 64.99/65.16 undef30, arg2 -> 1 + arg2, arg3 -> 1 + arg2, arg4 -> 9 - arg2, arg7 -> arg5, rest remain the same}> 64.99/65.16 Variables: 64.99/65.16 arg1, arg2, arg3, arg4, arg5, arg6, arg7 64.99/65.16 Checking conditional termination of SCC {l2}... 64.99/65.16 64.99/65.16 LOG: CALL solveLinear 64.99/65.16 64.99/65.16 LOG: RETURN solveLinear - Elapsed time: 0.002585s 64.99/65.16 64.99/65.16 LOG: CALL solveLinear 64.99/65.16 64.99/65.16 LOG: RETURN solveLinear - Elapsed time: 0.016338s 64.99/65.16 Trying to remove transition: undef30, arg2 -> 1 + arg2, arg3 -> 1 + arg2, arg4 -> 9 - arg2, arg7 -> arg5, rest remain the same}> 64.99/65.16 Solving with 1 template(s). 64.99/65.16 64.99/65.16 LOG: CALL solveNonLinearGetFirstSolution 64.99/65.16 64.99/65.16 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.003326s 64.99/65.16 Time used: 4.00187 64.99/65.16 Solving with 1 template(s). 64.99/65.16 64.99/65.16 LOG: CALL solveNonLinearGetFirstSolution 64.99/65.16 64.99/65.16 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.009286s 64.99/65.16 Time used: 4.0013 64.99/65.16 Solving with 2 template(s). 64.99/65.16 64.99/65.16 LOG: CALL solveNonLinearGetFirstSolution 64.99/65.16 64.99/65.16 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.007928s 64.99/65.16 Time used: 4.00016 64.99/65.16 Solving with 3 template(s). 64.99/65.16 64.99/65.16 LOG: CALL solveNonLinearGetFirstSolution 64.99/65.16 64.99/65.16 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.016246s 64.99/65.16 Time used: 1.00013 64.99/65.16 Solving with 1 template(s). 64.99/65.16 64.99/65.16 LOG: CALL solveNonLinearGetFirstSolution 64.99/65.16 64.99/65.16 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.072290s 64.99/65.16 Time used: 0.066595 64.99/65.16 Improving Solution with cost 1 ... 64.99/65.16 64.99/65.16 LOG: CALL solveNonLinearGetNextSolution 64.99/65.16 64.99/65.16 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.001292s 64.99/65.16 Time used: 1.00117 64.99/65.16 64.99/65.16 LOG: SAT solveNonLinear - Elapsed time: 1.073582s 64.99/65.16 Cost: 1; Total time: 1.06777 64.99/65.16 Termination implied by a set of invariant(s): 64.99/65.16 Invariant at l2: arg5 <= arg2 + arg3 + arg4 + arg7 64.99/65.16 [ Invariant Graph ] 64.99/65.16 Strengthening and disabling transitions... 64.99/65.16 64.99/65.16 LOG: CALL solverLinear in Graph for feasibility 64.99/65.16 64.99/65.16 LOG: RETURN solveLinear in Graph for feasibility 64.99/65.16 Strengthening transition (result): 64.99/65.16 undef30, arg2 -> 1 + arg2, arg3 -> 1 + arg2, arg4 -> 9 - arg2, arg7 -> arg5, rest remain the same}> 64.99/65.16 64.99/65.16 LOG: CALL solverLinear in Graph for feasibility 64.99/65.16 64.99/65.16 LOG: RETURN solveLinear in Graph for feasibility 64.99/65.16 Strengthening transition (result): 64.99/65.16 undef37, arg2 -> 1 + arg2 + undef44, arg3 -> 1 + arg2 + undef44, arg4 -> 9 - arg2 - undef44, arg6 -> 1 + arg6, arg7 -> arg5, rest remain the same}> 64.99/65.16 [ Termination Graph ] 64.99/65.16 Strengthening and disabling transitions... 64.99/65.16 64.99/65.16 LOG: CALL solverLinear in Graph for feasibility 64.99/65.16 64.99/65.16 LOG: RETURN solveLinear in Graph for feasibility 64.99/65.16 Strengthening transition (result): 64.99/65.16 undef30, arg2 -> 1 + arg2, arg3 -> 1 + arg2, arg4 -> 9 - arg2, arg7 -> arg5, rest remain the same}> 64.99/65.16 Quasi-ranking function: 50000 - arg2 - 8*arg3 + arg4 + 10*arg6 64.99/65.16 New Graphs: 64.99/65.16 Transitions: 64.99/65.16 undef30, arg2 -> 1 + arg2, arg3 -> 1 + arg2, arg4 -> 9 - arg2, arg7 -> arg5, rest remain the same}> 64.99/65.16 Variables: 64.99/65.16 arg1, arg2, arg3, arg4, arg5, arg6, arg7 64.99/65.16 Checking conditional termination of SCC {l2}... 64.99/65.16 64.99/65.16 LOG: CALL solveLinear 64.99/65.16 64.99/65.16 LOG: RETURN solveLinear - Elapsed time: 0.004699s 64.99/65.16 Ranking function: (9 / 10)*arg1 + (24951 / 5)*arg2 + (9 / 5)*arg3 + (9 / 10)*arg4 + arg5 - arg7 64.99/65.16 New Graphs: 64.99/65.16 INVARIANTS: 64.99/65.16 2: arg5 <= arg2 + arg3 + arg4 + arg7 , 64.99/65.16 Quasi-INVARIANTS to narrow Graph: 64.99/65.16 2: 64.99/65.16 Program Terminates 64.99/65.16 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found 64.99/65.16 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found 64.99/65.16 EOF