12.48/12.51 YES 12.48/12.51 12.48/12.51 Solver Timeout: 4 12.48/12.51 Global Timeout: 300 12.48/12.51 No parsing errors! 12.48/12.51 Init Location: 0 12.48/12.51 Transitions: 12.48/12.51 12.48/12.51 0) /\ (arg2 > ~(1)), par{arg3 -> undef3, arg4 -> undef4}> 12.48/12.51 0) /\ (arg2 > ~(1)) /\ ((arg2 - (5 * undef9)) >= 0) /\ ((arg2 - (5 * undef9)) < 5) /\ ((arg2 - (4 * undef10)) >= 0) /\ ((arg2 - (4 * undef10)) < 4) /\ ((arg2 - (5 * undef11)) >= 0) /\ ((arg2 - (5 * undef11)) < 5) /\ ((arg2 - (4 * undef12)) < 4) /\ ((arg2 - (4 * undef12)) >= 0), par{arg1 -> arg2, arg2 -> (arg2 - (5 * undef9)), arg3 -> (arg2 - (4 * undef10)), arg4 -> ((arg2 + (arg2 - (5 * undef11))) + ((3 * arg2) - (12 * undef12)))}> 12.48/12.51 ~(1)) /\ (arg2 < arg1), par{arg1 -> (arg1 - 1), arg4 -> (((arg1 - 1) + arg2) + (3 * arg3))}> 12.48/12.51 ~(1)) /\ (arg2 >= arg1), par{arg1 -> (arg1 + 1), arg2 -> (arg2 - 2), arg4 -> (((arg1 + 1) + (arg2 - 2)) + (3 * arg3))}> 12.48/12.51 ~(1)) /\ (arg3 >= arg2) /\ (arg2 >= arg1), par{arg1 -> (arg1 + 1), arg2 -> (arg2 + 1), arg3 -> (arg3 - 1), arg4 -> (((arg1 + 1) + (arg2 + 1)) + ((3 * arg3) - 3))}> 12.48/12.51 undef25, arg2 -> undef26, arg3 -> undef27, arg4 -> undef28}> 12.48/12.51 12.48/12.51 Fresh variables: 12.48/12.51 undef3, undef4, undef9, undef10, undef11, undef12, undef25, undef26, undef27, undef28, 12.48/12.51 12.48/12.51 Undef variables: 12.48/12.51 undef3, undef4, undef9, undef10, undef11, undef12, undef25, undef26, undef27, undef28, 12.48/12.51 12.48/12.51 Abstraction variables: 12.48/12.51 12.48/12.51 Exit nodes: 12.48/12.51 12.48/12.51 Accepting locations: 12.48/12.51 12.48/12.51 Asserts: 12.48/12.51 12.48/12.51 Preprocessed LLVMGraph 12.48/12.51 Init Location: 0 12.48/12.51 Transitions: 12.48/12.51 0) /\ (undef26 > ~(1)) /\ (undef25 > 0) /\ (undef26 > ~(1)) /\ ((undef26 - (5 * undef9)) >= 0) /\ ((undef26 - (5 * undef9)) < 5) /\ ((undef26 - (4 * undef10)) >= 0) /\ ((undef26 - (4 * undef10)) < 4) /\ ((undef26 - (5 * undef11)) >= 0) /\ ((undef26 - (5 * undef11)) < 5) /\ ((undef26 - (4 * undef12)) < 4) /\ ((undef26 - (4 * undef12)) >= 0)> 12.48/12.51 ~(1)) /\ (arg2 < arg1), par{arg1 -> (arg1 - 1), arg4 -> (((arg1 - 1) + arg2) + (3 * arg3))}> 12.50/12.51 ~(1)) /\ (arg2 >= arg1), par{arg1 -> (arg1 + 1), arg2 -> (arg2 - 2), arg4 -> (((arg1 + 1) + (arg2 - 2)) + (3 * arg3))}> 12.50/12.51 ~(1)) /\ (arg3 >= arg2) /\ (arg2 >= arg1), par{arg1 -> (arg1 + 1), arg2 -> (arg2 + 1), arg3 -> (arg3 - 1), arg4 -> (((arg1 + 1) + (arg2 + 1)) + ((3 * arg3) - 3))}> 12.50/12.51 12.50/12.51 Fresh variables: 12.50/12.51 undef3, undef4, undef9, undef10, undef11, undef12, undef25, undef26, undef27, undef28, 12.50/12.51 12.50/12.51 Undef variables: 12.50/12.51 undef3, undef4, undef9, undef10, undef11, undef12, undef25, undef26, undef27, undef28, 12.50/12.51 12.50/12.51 Abstraction variables: 12.50/12.51 12.50/12.51 Exit nodes: 12.50/12.51 12.50/12.51 Accepting locations: 12.50/12.51 12.50/12.51 Asserts: 12.50/12.51 12.50/12.51 ************************************************************* 12.50/12.51 ******************************************************************************************* 12.50/12.51 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 12.50/12.51 ******************************************************************************************* 12.50/12.51 12.50/12.51 Init Location: 0 12.50/12.51 Graph 0: 12.50/12.51 Transitions: 12.50/12.51 Variables: 12.50/12.51 12.50/12.51 Graph 1: 12.50/12.51 Transitions: 12.50/12.51 -1 + arg1, arg4 -> -1 + arg1 + arg2 + 3*arg3, rest remain the same}> 12.50/12.51 1 + arg1, arg2 -> -2 + arg2, arg4 -> -1 + arg1 + arg2 + 3*arg3, rest remain the same}> 12.50/12.51 1 + arg1, arg2 -> 1 + arg2, arg3 -> -1 + arg3, arg4 -> -1 + arg1 + arg2 + 3*arg3, rest remain the same}> 12.50/12.51 Variables: 12.50/12.51 arg1, arg2, arg3, arg4 12.50/12.51 12.50/12.51 Precedence: 12.50/12.51 Graph 0 12.50/12.51 12.50/12.51 Graph 1 12.50/12.51 12.50/12.51 12.50/12.51 Map Locations to Subgraph: 12.50/12.51 ( 0 , 0 ) 12.50/12.51 ( 3 , 1 ) 12.50/12.51 12.50/12.51 ******************************************************************************************* 12.50/12.51 ******************************** CHECKING ASSERTIONS ******************************** 12.50/12.51 ******************************************************************************************* 12.50/12.51 12.50/12.51 Proving termination of subgraph 0 12.50/12.51 Proving termination of subgraph 1 12.50/12.51 Checking unfeasibility... 12.50/12.51 Time used: 0.044616 12.50/12.51 12.50/12.51 Checking conditional termination of SCC {l3}... 12.50/12.51 12.50/12.51 LOG: CALL solveLinear 12.50/12.51 12.50/12.51 LOG: RETURN solveLinear - Elapsed time: 0.002754s 12.50/12.51 12.50/12.51 LOG: CALL solveLinear 12.50/12.51 12.50/12.51 LOG: RETURN solveLinear - Elapsed time: 0.054400s 12.50/12.51 Trying to remove transition: 1 + arg1, arg2 -> 1 + arg2, arg3 -> -1 + arg3, arg4 -> -1 + arg1 + arg2 + 3*arg3, rest remain the same}> 12.50/12.51 Solving with 1 template(s). 12.50/12.51 12.50/12.51 LOG: CALL solveNonLinearGetFirstSolution 12.50/12.51 12.50/12.51 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.753403s 12.50/12.51 Time used: 0.752723 12.50/12.51 Trying to remove transition: 1 + arg1, arg2 -> -2 + arg2, arg4 -> -1 + arg1 + arg2 + 3*arg3, rest remain the same}> 12.50/12.51 Solving with 1 template(s). 12.50/12.51 12.50/12.51 LOG: CALL solveNonLinearGetFirstSolution 12.50/12.51 12.50/12.51 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.006195s 12.50/12.51 Time used: 4.00062 12.50/12.51 Trying to remove transition: -1 + arg1, arg4 -> -1 + arg1 + arg2 + 3*arg3, rest remain the same}> 12.50/12.51 Solving with 1 template(s). 12.50/12.51 12.50/12.51 LOG: CALL solveNonLinearGetFirstSolution 12.50/12.51 12.50/12.51 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.153946s 12.50/12.51 Time used: 0.144377 12.50/12.51 Solving with 1 template(s). 12.50/12.51 12.50/12.51 LOG: CALL solveNonLinearGetFirstSolution 12.50/12.51 12.50/12.51 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.003927s 12.50/12.51 Time used: 4.00013 12.50/12.51 Solving with 2 template(s). 12.50/12.51 12.50/12.51 LOG: CALL solveNonLinearGetFirstSolution 12.50/12.51 12.50/12.51 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.375520s 12.50/12.51 Time used: 1.36613 12.50/12.51 Improving Solution with cost 2 ... 12.50/12.51 12.50/12.51 LOG: CALL solveNonLinearGetNextSolution 12.50/12.51 12.50/12.51 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.001905s 12.50/12.51 Time used: 1.00185 12.50/12.51 12.50/12.51 LOG: SAT solveNonLinear - Elapsed time: 2.377425s 12.50/12.51 Cost: 2; Total time: 2.36799 12.50/12.51 Failed at location 3: arg3 <= 0 12.50/12.51 Failed at location 3: arg4 <= arg1 + arg2 + arg3 12.50/12.51 Before Improving: 12.50/12.51 Quasi-invariant at l3: arg3 <= 0 12.50/12.51 Quasi-invariant at l3: arg4 <= arg1 + arg2 + arg3 12.50/12.51 Optimizing invariants... 12.50/12.51 12.50/12.51 LOG: CALL solveLinear 12.50/12.51 12.50/12.51 LOG: RETURN solveLinear - Elapsed time: 0.011270s 12.50/12.51 Quasi-invariant improved 12.50/12.51 12.50/12.51 LOG: CALL solveLinear 12.50/12.51 12.50/12.51 LOG: RETURN solveLinear - Elapsed time: 0.005643s 12.50/12.51 Quasi-invariant improved 12.50/12.51 12.50/12.51 LOG: CALL solveLinear 12.50/12.51 12.50/12.51 LOG: RETURN solveLinear - Elapsed time: 0.005208s 12.50/12.51 Quasi-invariant improved 12.50/12.51 12.50/12.51 LOG: CALL solveLinear 12.50/12.51 12.50/12.51 LOG: RETURN solveLinear - Elapsed time: 0.006425s 12.50/12.51 Quasi-invariant improved 12.50/12.51 12.50/12.51 LOG: CALL solveLinear 12.50/12.51 12.50/12.51 LOG: RETURN solveLinear - Elapsed time: 0.005690s 12.50/12.51 Quasi-invariant improved 12.50/12.51 12.50/12.51 LOG: CALL solveLinear 12.50/12.51 12.50/12.51 LOG: RETURN solveLinear - Elapsed time: 0.008066s 12.50/12.51 Quasi-invariant improved 12.50/12.51 12.50/12.51 LOG: CALL solveLinear 12.50/12.51 12.50/12.51 LOG: RETURN solveLinear - Elapsed time: 0.009196s 12.50/12.51 Quasi-invariant improved 12.50/12.51 12.50/12.51 LOG: CALL solveLinear 12.50/12.51 12.50/12.51 LOG: RETURN solveLinear - Elapsed time: 0.012005s 12.50/12.51 Quasi-invariant improved 12.50/12.51 12.50/12.51 LOG: CALL solveLinear 12.50/12.51 12.50/12.51 LOG: RETURN solveLinear - Elapsed time: 0.005324s 12.50/12.51 Quasi-invariant improved 12.50/12.51 12.50/12.51 LOG: CALL solveLinear 12.50/12.51 12.50/12.51 LOG: RETURN solveLinear - Elapsed time: 0.009999s 12.50/12.51 Quasi-invariant improved 12.50/12.51 12.50/12.51 LOG: CALL solveLinear 12.50/12.51 12.50/12.51 LOG: RETURN solveLinear - Elapsed time: 0.123669s 12.50/12.51 Quasi-invariant improved 12.50/12.51 12.50/12.51 LOG: CALL solveLinear 12.50/12.51 12.50/12.51 LOG: RETURN solveLinear - Elapsed time: 0.009002s 12.50/12.51 Quasi-invariant improved 12.50/12.51 12.50/12.51 LOG: CALL solveLinear 12.50/12.51 12.50/12.51 LOG: RETURN solveLinear - Elapsed time: 0.031084s 12.50/12.51 Quasi-invariant improved 12.50/12.51 12.50/12.51 LOG: CALL solveLinear 12.50/12.51 12.50/12.51 LOG: RETURN solveLinear - Elapsed time: 0.007808s 12.50/12.51 Quasi-invariant improved 12.50/12.51 12.50/12.51 LOG: CALL solveLinear 12.50/12.51 12.50/12.51 LOG: RETURN solveLinear - Elapsed time: 0.016140s 12.50/12.51 Quasi-invariant improved 12.50/12.51 12.50/12.51 LOG: CALL solveLinear 12.50/12.51 12.50/12.51 LOG: RETURN solveLinear - Elapsed time: 0.007657s 12.50/12.51 Quasi-invariant improved 12.50/12.51 12.50/12.51 LOG: CALL solveLinear 12.50/12.51 12.50/12.51 LOG: RETURN solveLinear - Elapsed time: 0.039880s 12.50/12.51 Quasi-invariant improved 12.50/12.51 12.50/12.51 LOG: CALL solveLinear 12.50/12.51 12.50/12.51 LOG: RETURN solveLinear - Elapsed time: 0.007829s 12.50/12.51 Quasi-invariant improved 12.50/12.51 12.50/12.51 LOG: CALL solveLinear 12.50/12.51 12.50/12.51 LOG: RETURN solveLinear - Elapsed time: 0.035386s 12.50/12.51 Quasi-invariant improved 12.50/12.51 12.50/12.51 LOG: CALL solveLinear 12.50/12.51 12.50/12.51 LOG: RETURN solveLinear - Elapsed time: 0.005534s 12.50/12.51 Quasi-invariant improved 12.50/12.51 12.50/12.51 LOG: CALL solveLinear 12.50/12.51 12.50/12.51 LOG: RETURN solveLinear - Elapsed time: 0.007704s 12.50/12.51 Quasi-invariant improved 12.50/12.51 12.50/12.51 LOG: CALL solveLinear 12.50/12.51 12.50/12.51 LOG: RETURN solveLinear - Elapsed time: 0.118437s 12.50/12.51 Quasi-invariant improved 12.50/12.51 12.50/12.51 LOG: CALL solveLinear 12.50/12.51 12.50/12.51 LOG: RETURN solveLinear - Elapsed time: 0.008483s 12.50/12.51 Quasi-invariant improved 12.50/12.51 12.50/12.51 LOG: CALL solveLinear 12.50/12.51 12.50/12.51 LOG: RETURN solveLinear - Elapsed time: 0.046741s 12.50/12.51 Quasi-invariant improved 12.50/12.51 12.50/12.51 LOG: CALL solveLinear 12.50/12.51 12.50/12.51 LOG: RETURN solveLinear - Elapsed time: 0.005742s 12.50/12.51 Quasi-invariant improved 12.50/12.51 12.50/12.51 LOG: CALL solveLinear 12.50/12.51 12.50/12.51 LOG: RETURN solveLinear - Elapsed time: 0.007790s 12.50/12.51 Quasi-invariant improved 12.50/12.51 12.50/12.51 LOG: CALL solveLinear 12.50/12.51 12.50/12.51 LOG: RETURN solveLinear - Elapsed time: 0.046186s 12.50/12.51 Quasi-invariant improved 12.50/12.51 12.50/12.51 LOG: CALL solveLinear 12.50/12.51 12.50/12.51 LOG: RETURN solveLinear - Elapsed time: 0.005678s 12.50/12.51 Quasi-invariant improved 12.50/12.51 12.50/12.51 LOG: CALL solveLinear 12.50/12.51 12.50/12.51 LOG: RETURN solveLinear - Elapsed time: 0.007727s 12.50/12.51 Quasi-invariant improved 12.50/12.51 12.50/12.51 LOG: CALL solveLinear 12.50/12.51 12.50/12.51 LOG: RETURN solveLinear - Elapsed time: 0.046071s 12.50/12.51 Quasi-invariant improved 12.50/12.51 12.50/12.51 LOG: CALL solveLinear 12.50/12.51 12.50/12.51 LOG: RETURN solveLinear - Elapsed time: 0.005626s 12.50/12.51 Quasi-invariant improved 12.50/12.51 12.50/12.51 LOG: CALL solveLinear 12.50/12.51 12.50/12.51 LOG: RETURN solveLinear - Elapsed time: 0.007697s 12.50/12.51 Quasi-invariant improved 12.50/12.51 12.50/12.51 LOG: CALL solveLinear 12.50/12.51 12.50/12.51 LOG: RETURN solveLinear - Elapsed time: 0.046016s 12.50/12.51 Quasi-invariant improved 12.50/12.51 12.50/12.51 LOG: CALL solveLinear 12.50/12.51 12.50/12.51 LOG: RETURN solveLinear - Elapsed time: 0.005616s 12.50/12.51 Quasi-invariant improved 12.50/12.51 12.50/12.51 LOG: CALL solveLinear 12.50/12.51 12.50/12.51 LOG: RETURN solveLinear - Elapsed time: 0.007708s 12.50/12.51 Quasi-invariant improved 12.50/12.51 12.50/12.51 LOG: CALL solveLinear 12.50/12.51 12.50/12.51 LOG: RETURN solveLinear - Elapsed time: 0.046021s 12.50/12.51 Quasi-invariant improved 12.50/12.51 12.50/12.51 LOG: CALL solveLinear 12.50/12.51 12.50/12.51 LOG: RETURN solveLinear - Elapsed time: 0.005779s 12.50/12.51 Quasi-invariant improved 12.50/12.51 12.50/12.51 LOG: CALL solveLinear 12.50/12.51 12.50/12.51 LOG: RETURN solveLinear - Elapsed time: 0.007999s 12.50/12.51 Quasi-invariant improved 12.50/12.51 12.50/12.51 LOG: CALL solveLinear 12.50/12.51 12.50/12.51 LOG: RETURN solveLinear - Elapsed time: 0.046047s 12.50/12.51 Quasi-invariant improved 12.50/12.51 12.50/12.51 LOG: CALL solveLinear 12.50/12.51 12.50/12.51 LOG: RETURN solveLinear - Elapsed time: 0.005668s 12.50/12.51 Quasi-invariant improved 12.50/12.51 12.50/12.51 LOG: CALL solveLinear 12.50/12.51 12.50/12.51 LOG: RETURN solveLinear - Elapsed time: 0.007725s 12.50/12.51 Quasi-invariant improved 12.50/12.51 12.50/12.51 LOG: CALL solveLinear 12.50/12.51 12.50/12.51 LOG: RETURN solveLinear - Elapsed time: 0.045980s 12.50/12.51 Quasi-invariant improved 12.50/12.51 12.50/12.51 LOG: CALL solveLinear 12.50/12.51 12.50/12.51 LOG: RETURN solveLinear - Elapsed time: 0.005642s 12.50/12.51 Quasi-invariant improved 12.50/12.51 12.50/12.51 LOG: CALL solveLinear 12.50/12.51 12.50/12.51 LOG: RETURN solveLinear - Elapsed time: 0.007749s 12.50/12.51 Quasi-invariant improved 12.50/12.51 12.50/12.51 LOG: CALL solveLinear 12.50/12.51 12.50/12.51 LOG: RETURN solveLinear - Elapsed time: 0.046353s 12.50/12.51 Quasi-invariant improved 12.50/12.51 12.50/12.51 LOG: CALL solveLinear 12.50/12.51 12.50/12.51 LOG: RETURN solveLinear - Elapsed time: 0.006017s 12.50/12.51 Quasi-invariant improved 12.50/12.51 12.50/12.51 LOG: CALL solveLinear 12.50/12.51 12.50/12.51 LOG: RETURN solveLinear - Elapsed time: 0.007931s 12.50/12.51 Quasi-invariant improved 12.50/12.51 12.50/12.51 LOG: CALL solveLinear 12.50/12.51 12.50/12.51 LOG: RETURN solveLinear - Elapsed time: 0.046046s 12.50/12.51 Quasi-invariant improved 12.50/12.51 12.50/12.51 LOG: CALL solveLinear 12.50/12.51 12.50/12.51 LOG: RETURN solveLinear - Elapsed time: 0.005650s 12.50/12.51 Quasi-invariant improved 12.50/12.51 12.50/12.51 LOG: CALL solveLinear 12.50/12.51 12.50/12.51 LOG: RETURN solveLinear - Elapsed time: 0.003747s 12.50/12.51 Remaining time after improvement: -0.000937 12.50/12.51 Termination implied by a set of quasi-invariant(s): 12.50/12.51 Quasi-invariant at l3: arg3 <= 24 12.50/12.51 Quasi-invariant at l3: arg4 <= 48 + arg1 + arg2 + arg3 12.50/12.51 [ Invariant Graph ] 12.50/12.51 Strengthening and disabling transitions... 12.50/12.51 12.50/12.51 LOG: CALL solverLinear in Graph for feasibility 12.50/12.51 12.50/12.51 LOG: RETURN solveLinear in Graph for feasibility 12.50/12.51 Strengthening transition (result): 12.50/12.51 -1 + arg1, arg4 -> -1 + arg1 + arg2 + 3*arg3, rest remain the same}> 12.50/12.51 12.50/12.51 LOG: CALL solverLinear in Graph for feasibility 12.50/12.51 12.50/12.51 LOG: RETURN solveLinear in Graph for feasibility 12.50/12.51 Strengthening transition (result): 12.50/12.51 1 + arg1, arg2 -> -2 + arg2, arg4 -> -1 + arg1 + arg2 + 3*arg3, rest remain the same}> 12.50/12.51 12.50/12.51 LOG: CALL solverLinear in Graph for feasibility 12.50/12.51 12.50/12.51 LOG: RETURN solveLinear in Graph for feasibility 12.50/12.51 Strengthening transition (result): 12.50/12.51 1 + arg1, arg2 -> 1 + arg2, arg3 -> -1 + arg3, arg4 -> -1 + arg1 + arg2 + 3*arg3, rest remain the same}> 12.50/12.51 [ Termination Graph ] 12.50/12.51 Strengthening and disabling transitions... 12.50/12.51 12.50/12.51 LOG: CALL solverLinear in Graph for feasibility 12.50/12.51 12.50/12.51 LOG: RETURN solveLinear in Graph for feasibility 12.50/12.51 Strengthening transition (result): 12.50/12.51 -1 + arg1, arg4 -> -1 + arg1 + arg2 + 3*arg3, rest remain the same}> 12.50/12.51 12.50/12.51 LOG: CALL solverLinear in Graph for feasibility 12.50/12.51 12.50/12.51 LOG: RETURN solveLinear in Graph for feasibility 12.50/12.51 Strengthening transition (result): 12.50/12.51 1 + arg1, arg2 -> -2 + arg2, arg4 -> -1 + arg1 + arg2 + 3*arg3, rest remain the same}> 12.50/12.51 12.50/12.51 LOG: CALL solverLinear in Graph for feasibility 12.50/12.51 12.50/12.51 LOG: RETURN solveLinear in Graph for feasibility 12.50/12.51 Strengthening transition (result): 12.50/12.51 1 + arg1, arg2 -> 1 + arg2, arg3 -> -1 + arg3, arg4 -> -1 + arg1 + arg2 + 3*arg3, rest remain the same}> 12.50/12.51 Ranking function: 142 + arg1 + arg2 + 3*arg3 12.50/12.51 New Graphs: 12.50/12.51 Transitions: 12.50/12.51 -1 + arg1, arg4 -> -1 + arg1 + arg2 + 3*arg3, rest remain the same}> 12.50/12.51 1 + arg1, arg2 -> -2 + arg2, arg4 -> -1 + arg1 + arg2 + 3*arg3, rest remain the same}> 12.50/12.51 Variables: 12.50/12.51 arg1, arg2, arg3, arg4 12.50/12.51 Checking conditional termination of SCC {l3}... 12.50/12.51 12.50/12.51 LOG: CALL solveLinear 12.50/12.51 12.50/12.51 LOG: RETURN solveLinear - Elapsed time: 0.002417s 12.50/12.51 Ranking function: 48 + 2*arg2 + arg3 12.50/12.51 New Graphs: 12.50/12.51 Transitions: 12.50/12.51 -1 + arg1, arg4 -> -1 + arg1 + arg2 + 3*arg3, rest remain the same}> 12.50/12.51 Variables: 12.50/12.51 arg1, arg2, arg3, arg4 12.50/12.51 Checking conditional termination of SCC {l3}... 12.50/12.51 12.50/12.51 LOG: CALL solveLinear 12.50/12.51 12.50/12.51 LOG: RETURN solveLinear - Elapsed time: 0.001402s 12.50/12.51 Ranking function: -1 + arg1 - arg2 12.50/12.51 New Graphs: 12.50/12.51 Calling Safety with literal arg3 <= 24 and entry 12.50/12.51 12.50/12.51 LOG: CALL check - Post:arg3 <= 24 - Process 1 12.50/12.51 * Exit transition: 12.50/12.51 * Postcondition : arg3 <= 24 12.50/12.51 12.50/12.51 LOG: CALL solveLinear 12.50/12.51 12.50/12.51 LOG: RETURN solveLinear - Elapsed time: 0.000491s 12.50/12.51 > Postcondition implied! 12.50/12.51 12.50/12.51 LOG: RETURN check - Elapsed time: 0.000703s 12.50/12.51 Calling Safety with literal arg4 <= 48 + arg1 + arg2 + arg3 and entry 12.50/12.51 12.50/12.51 LOG: CALL check - Post:arg4 <= 48 + arg1 + arg2 + arg3 - Process 2 12.50/12.51 * Exit transition: 12.50/12.51 * Postcondition : arg4 <= 48 + arg1 + arg2 + arg3 12.50/12.51 12.50/12.51 LOG: CALL solveLinear 12.50/12.51 12.50/12.51 LOG: RETURN solveLinear - Elapsed time: 0.000524s 12.50/12.51 > Postcondition implied! 12.50/12.51 12.50/12.51 LOG: RETURN check - Elapsed time: 0.000763s 12.50/12.51 INVARIANTS: 12.50/12.51 3: arg3 <= 24 , arg4 <= 48 + arg1 + arg2 + arg3 , 12.50/12.51 Quasi-INVARIANTS to narrow Graph: 12.50/12.51 3: 12.50/12.51 Program Terminates 12.50/12.51 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found 12.50/12.51 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found 12.50/12.51 EOF