1.75/1.76 YES 1.75/1.76 1.75/1.76 Solver Timeout: 4 1.75/1.76 Global Timeout: 300 1.75/1.76 No parsing errors! 1.75/1.76 Init Location: 0 1.75/1.76 Transitions: 1.75/1.76 1.75/1.76 0) /\ (arg2 > ~(1)) /\ (undef1 > 0) /\ (undef3 > ~(1)) /\ (undef4 > ~(1)) /\ (undef6 > ~(1)), par{arg1 -> undef1, arg2 -> 0, arg3 -> undef3, arg4 -> undef4, arg5 -> 0, arg6 -> undef6}> 1.75/1.76 0) /\ (undef7 > 0) /\ (undef9 > ~(1)) /\ (undef10 > ~(1)) /\ (undef12 > ~(1)), par{arg1 -> undef7, arg2 -> 0, arg3 -> undef9, arg4 -> undef10, arg5 -> 0, arg6 -> undef12}> 1.75/1.76 0) /\ (arg3 > ~(1)) /\ (arg4 > 0) /\ (arg6 > 0) /\ (undef13 > 0) /\ (undef15 > ~(1)) /\ (undef16 > ~(1)) /\ (undef18 > ~(1)), par{arg1 -> undef13, arg3 -> undef15, arg4 -> undef16, arg6 -> undef18}> 1.75/1.76 arg5) /\ ((undef20 - 1) <= arg3) /\ (undef20 <= arg4) /\ (undef20 <= arg6) /\ (undef22 <= arg3) /\ ((undef23 + 1) <= arg4) /\ ((undef23 + 1) <= arg6) /\ ((undef25 + 1) <= arg4) /\ ((undef25 + 1) <= arg6) /\ (arg1 > 0) /\ (arg3 > ~(1)) /\ (arg4 > 0) /\ (arg6 > 0) /\ (undef20 > 0) /\ (undef22 > ~(1)) /\ (undef23 > ~(1)) /\ (undef25 > ~(1)) /\ ((undef24 + 2) <= arg4) /\ ((undef24 + 2) <= arg6), par{arg1 -> undef20, arg3 -> undef22, arg4 -> undef23, arg5 -> undef24, arg6 -> undef25}> 1.75/1.76 = arg2) /\ (undef32 > 0) /\ (undef33 > 0) /\ (undef26 <= arg1) /\ ((undef26 - 1) <= arg3) /\ ((undef26 - 1) <= arg4) /\ ((undef26 - 1) <= arg6) /\ (undef28 <= arg3) /\ (undef29 <= arg3) /\ (undef31 <= arg3) /\ (arg1 > 0) /\ (arg3 > ~(1)) /\ (arg4 > ~(1)) /\ (arg6 > ~(1)) /\ (undef26 > 0) /\ (undef28 > ~(1)) /\ (undef29 > ~(1)) /\ (undef31 > ~(1)), par{arg1 -> undef26, arg2 -> (arg2 + 1), arg3 -> undef28, arg4 -> undef29, arg5 -> 0, arg6 -> undef31}> 1.75/1.76 ~(1)) /\ (undef34 > ~(1)) /\ (arg1 > 0), par{arg1 -> undef34, arg2 -> 1, arg3 -> undef36, arg4 -> undef37, arg5 -> undef38, arg6 -> undef39}> 1.75/1.76 0) /\ (arg2 > 0), par{arg1 -> (arg1 - 1), arg2 -> (arg2 + 1), arg3 -> undef42, arg4 -> undef43, arg5 -> undef44, arg6 -> undef45}> 1.75/1.76 = arg2) /\ (undef52 > 0) /\ (undef53 > 0) /\ (undef47 <= arg3) /\ (undef48 <= arg3) /\ (arg1 > 0) /\ (arg3 > ~(1)) /\ (arg4 > ~(1)) /\ (arg6 > ~(1)) /\ (undef47 > ~(1)) /\ (undef48 > ~(1)), par{arg1 -> arg2, arg2 -> undef47, arg3 -> undef48, arg4 -> undef49, arg5 -> undef50, arg6 -> undef51}> 1.75/1.76 0) /\ (arg3 > 0) /\ (undef55 > ~(1)) /\ (undef56 > ~(1)), par{arg2 -> undef55, arg3 -> undef56, arg4 -> undef57, arg5 -> undef58, arg6 -> undef59}> 1.75/1.76 arg1) /\ ((undef62 + 1) <= arg3) /\ ((undef63 + 1) <= arg2) /\ ((undef63 + 1) <= arg3) /\ (arg2 > 0) /\ (arg3 > 0) /\ (undef62 > ~(1)) /\ (undef63 > ~(1)), par{arg2 -> undef62, arg3 -> undef63, arg4 -> undef64, arg5 -> undef65, arg6 -> undef66}> 1.75/1.76 undef68, arg2 -> undef69, arg3 -> undef70, arg4 -> undef71, arg5 -> undef72, arg6 -> undef73}> 1.75/1.76 1.75/1.76 Fresh variables: 1.75/1.76 undef1, undef3, undef4, undef6, undef7, undef9, undef10, undef12, undef13, undef15, undef16, undef18, undef19, undef20, undef22, undef23, undef24, undef25, undef26, undef28, undef29, undef31, undef32, undef33, undef34, undef36, undef37, undef38, undef39, undef42, undef43, undef44, undef45, undef47, undef48, undef49, undef50, undef51, undef52, undef53, undef55, undef56, undef57, undef58, undef59, undef60, undef62, undef63, undef64, undef65, undef66, undef67, undef68, undef69, undef70, undef71, undef72, undef73, 1.75/1.76 1.75/1.76 Undef variables: 1.75/1.76 undef1, undef3, undef4, undef6, undef7, undef9, undef10, undef12, undef13, undef15, undef16, undef18, undef19, undef20, undef22, undef23, undef24, undef25, undef26, undef28, undef29, undef31, undef32, undef33, undef34, undef36, undef37, undef38, undef39, undef42, undef43, undef44, undef45, undef47, undef48, undef49, undef50, undef51, undef52, undef53, undef55, undef56, undef57, undef58, undef59, undef60, undef62, undef63, undef64, undef65, undef66, undef67, undef68, undef69, undef70, undef71, undef72, undef73, 1.75/1.76 1.75/1.76 Abstraction variables: 1.75/1.76 1.75/1.76 Exit nodes: 1.75/1.76 1.75/1.76 Accepting locations: 1.75/1.76 1.75/1.76 Asserts: 1.75/1.76 1.75/1.76 Preprocessed LLVMGraph 1.75/1.76 Init Location: 0 1.75/1.76 Transitions: 1.75/1.76 0) /\ (undef7 > 0) /\ (undef9 > ~(1)) /\ (undef10 > ~(1)) /\ (undef12 > ~(1)), par{arg1 -> undef7, arg2 -> 0, arg3 -> undef9, arg4 -> undef10, arg5 -> 0, arg6 -> undef12}> 1.75/1.76 ~(1)) /\ (undef34 > ~(1)) /\ (undef68 > 0), par{arg1 -> undef34, arg2 -> 1, arg3 -> undef36, arg4 -> undef37, arg5 -> undef38, arg6 -> undef39}> 1.75/1.76 0) /\ (arg3 > ~(1)) /\ (arg4 > 0) /\ (arg6 > 0) /\ (undef13 > 0) /\ (undef15 > ~(1)) /\ (undef16 > ~(1)) /\ (undef18 > ~(1)), par{arg1 -> undef13, arg3 -> undef15, arg4 -> undef16, arg6 -> undef18}> 1.75/1.76 arg5) /\ ((undef20 - 1) <= arg3) /\ (undef20 <= arg4) /\ (undef20 <= arg6) /\ (undef22 <= arg3) /\ ((undef23 + 1) <= arg4) /\ ((undef23 + 1) <= arg6) /\ ((undef25 + 1) <= arg4) /\ ((undef25 + 1) <= arg6) /\ (arg1 > 0) /\ (arg3 > ~(1)) /\ (arg4 > 0) /\ (arg6 > 0) /\ (undef20 > 0) /\ (undef22 > ~(1)) /\ (undef23 > ~(1)) /\ (undef25 > ~(1)) /\ ((undef24 + 2) <= arg4) /\ ((undef24 + 2) <= arg6), par{arg1 -> undef20, arg3 -> undef22, arg4 -> undef23, arg5 -> undef24, arg6 -> undef25}> 1.75/1.76 = arg2) /\ (undef32 > 0) /\ (undef33 > 0) /\ (undef26 <= arg1) /\ ((undef26 - 1) <= arg3) /\ ((undef26 - 1) <= arg4) /\ ((undef26 - 1) <= arg6) /\ (undef28 <= arg3) /\ (undef29 <= arg3) /\ (undef31 <= arg3) /\ (arg1 > 0) /\ (arg3 > ~(1)) /\ (arg4 > ~(1)) /\ (arg6 > ~(1)) /\ (undef26 > 0) /\ (undef28 > ~(1)) /\ (undef29 > ~(1)) /\ (undef31 > ~(1)), par{arg1 -> undef26, arg2 -> (arg2 + 1), arg3 -> undef28, arg4 -> undef29, arg5 -> 0, arg6 -> undef31}> 1.75/1.76 = arg2) /\ (undef52 > 0) /\ (undef53 > 0) /\ (undef47 <= arg3) /\ (undef48 <= arg3) /\ (arg1 > 0) /\ (arg3 > ~(1)) /\ (arg4 > ~(1)) /\ (arg6 > ~(1)) /\ (undef47 > ~(1)) /\ (undef48 > ~(1)), par{arg1 -> arg2, arg2 -> undef47, arg3 -> undef48, arg4 -> undef49, arg5 -> undef50, arg6 -> undef51}> 1.75/1.76 0) /\ (arg2 > 0), par{arg1 -> (arg1 - 1), arg2 -> (arg2 + 1), arg3 -> undef42, arg4 -> undef43, arg5 -> undef44, arg6 -> undef45}> 1.75/1.76 0) /\ (arg3 > 0) /\ (undef55 > ~(1)) /\ (undef56 > ~(1)), par{arg2 -> undef55, arg3 -> undef56, arg4 -> undef57, arg5 -> undef58, arg6 -> undef59}> 1.75/1.76 arg1) /\ ((undef62 + 1) <= arg3) /\ ((undef63 + 1) <= arg2) /\ ((undef63 + 1) <= arg3) /\ (arg2 > 0) /\ (arg3 > 0) /\ (undef62 > ~(1)) /\ (undef63 > ~(1)), par{arg2 -> undef62, arg3 -> undef63, arg4 -> undef64, arg5 -> undef65, arg6 -> undef66}> 1.75/1.76 1.75/1.76 Fresh variables: 1.75/1.76 undef1, undef3, undef4, undef6, undef7, undef9, undef10, undef12, undef13, undef15, undef16, undef18, undef19, undef20, undef22, undef23, undef24, undef25, undef26, undef28, undef29, undef31, undef32, undef33, undef34, undef36, undef37, undef38, undef39, undef42, undef43, undef44, undef45, undef47, undef48, undef49, undef50, undef51, undef52, undef53, undef55, undef56, undef57, undef58, undef59, undef60, undef62, undef63, undef64, undef65, undef66, undef67, undef68, undef69, undef70, undef71, undef72, undef73, 1.75/1.76 1.75/1.76 Undef variables: 1.75/1.76 undef1, undef3, undef4, undef6, undef7, undef9, undef10, undef12, undef13, undef15, undef16, undef18, undef19, undef20, undef22, undef23, undef24, undef25, undef26, undef28, undef29, undef31, undef32, undef33, undef34, undef36, undef37, undef38, undef39, undef42, undef43, undef44, undef45, undef47, undef48, undef49, undef50, undef51, undef52, undef53, undef55, undef56, undef57, undef58, undef59, undef60, undef62, undef63, undef64, undef65, undef66, undef67, undef68, undef69, undef70, undef71, undef72, undef73, 1.75/1.76 1.75/1.76 Abstraction variables: 1.75/1.76 1.75/1.76 Exit nodes: 1.75/1.76 1.75/1.76 Accepting locations: 1.75/1.76 1.75/1.76 Asserts: 1.75/1.76 1.75/1.76 ************************************************************* 1.75/1.76 ******************************************************************************************* 1.75/1.76 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 1.75/1.76 ******************************************************************************************* 1.75/1.76 1.75/1.76 Init Location: 0 1.75/1.76 Graph 0: 1.75/1.76 Transitions: 1.75/1.76 Variables: 1.75/1.76 1.75/1.76 Graph 1: 1.75/1.76 Transitions: 1.75/1.76 -1 + arg1, arg2 -> 1 + arg2, arg3 -> undef42, arg4 -> undef43, arg5 -> undef44, arg6 -> undef45, rest remain the same}> 1.75/1.76 Variables: 1.75/1.76 arg1, arg2, arg3, arg4, arg5, arg6 1.75/1.76 1.75/1.76 Graph 2: 1.75/1.76 Transitions: 1.75/1.76 undef13, arg3 -> undef15, arg4 -> undef16, arg6 -> undef18, rest remain the same}> 1.75/1.76 undef20, arg3 -> undef22, arg4 -> undef23, arg5 -> undef24, arg6 -> undef25, rest remain the same}> 1.75/1.76 undef26, arg2 -> 1 + arg2, arg3 -> undef28, arg4 -> undef29, arg5 -> 0, arg6 -> undef31, rest remain the same}> 1.75/1.76 Variables: 1.75/1.76 arg1, arg3, arg4, arg5, arg6, arg2 1.75/1.76 1.75/1.76 Graph 3: 1.75/1.76 Transitions: 1.75/1.76 undef55, arg3 -> undef56, arg4 -> undef57, arg5 -> undef58, arg6 -> undef59, rest remain the same}> 1.75/1.76 undef62, arg3 -> undef63, arg4 -> undef64, arg5 -> undef65, arg6 -> undef66, rest remain the same}> 1.75/1.76 Variables: 1.75/1.76 arg1, arg2, arg3, arg4, arg5, arg6 1.75/1.76 1.75/1.76 Precedence: 1.75/1.76 Graph 0 1.75/1.76 1.75/1.76 Graph 1 1.75/1.76 undef34, arg2 -> 1, arg3 -> undef36, arg4 -> undef37, arg5 -> undef38, arg6 -> undef39, rest remain the same}> 1.75/1.76 1.75/1.76 Graph 2 1.75/1.76 undef7, arg2 -> 0, arg3 -> undef9, arg4 -> undef10, arg5 -> 0, arg6 -> undef12, rest remain the same}> 1.75/1.76 1.75/1.76 Graph 3 1.75/1.76 arg2, arg2 -> undef47, arg3 -> undef48, arg4 -> undef49, arg5 -> undef50, arg6 -> undef51, rest remain the same}> 1.75/1.76 1.75/1.76 Map Locations to Subgraph: 1.75/1.76 ( 0 , 0 ) 1.75/1.76 ( 2 , 2 ) 1.75/1.76 ( 4 , 1 ) 1.75/1.76 ( 5 , 3 ) 1.75/1.76 1.75/1.76 ******************************************************************************************* 1.75/1.76 ******************************** CHECKING ASSERTIONS ******************************** 1.75/1.76 ******************************************************************************************* 1.75/1.76 1.75/1.76 Proving termination of subgraph 0 1.75/1.76 Proving termination of subgraph 1 1.75/1.76 Checking unfeasibility... 1.75/1.76 Time used: 0.004222 1.75/1.76 1.75/1.76 Checking conditional termination of SCC {l4}... 1.75/1.76 1.75/1.76 LOG: CALL solveLinear 1.75/1.76 1.75/1.76 LOG: RETURN solveLinear - Elapsed time: 0.001058s 1.75/1.76 Ranking function: -1 + arg1 1.75/1.76 New Graphs: 1.75/1.76 Proving termination of subgraph 2 1.75/1.76 Checking unfeasibility... 1.75/1.76 Time used: 0.024711 1.75/1.76 1.75/1.76 Checking conditional termination of SCC {l2}... 1.75/1.76 1.75/1.76 LOG: CALL solveLinear 1.75/1.76 1.75/1.76 LOG: RETURN solveLinear - Elapsed time: 0.008159s 1.75/1.76 1.75/1.76 LOG: CALL solveLinear 1.75/1.76 1.75/1.76 LOG: RETURN solveLinear - Elapsed time: 0.075314s 1.75/1.76 Trying to remove transition: undef26, arg2 -> 1 + arg2, arg3 -> undef28, arg4 -> undef29, arg5 -> 0, arg6 -> undef31, rest remain the same}> 1.75/1.76 Solving with 1 template(s). 1.75/1.76 1.75/1.76 LOG: CALL solveNonLinearGetFirstSolution 1.75/1.76 1.75/1.76 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.040961s 1.75/1.76 Time used: 0.036795 1.75/1.76 Trying to remove transition: undef20, arg3 -> undef22, arg4 -> undef23, arg5 -> undef24, arg6 -> undef25, rest remain the same}> 1.75/1.76 Solving with 1 template(s). 1.75/1.76 1.75/1.76 LOG: CALL solveNonLinearGetFirstSolution 1.75/1.76 1.75/1.76 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.069052s 1.75/1.76 Time used: 0.06515 1.75/1.76 Trying to remove transition: undef13, arg3 -> undef15, arg4 -> undef16, arg6 -> undef18, rest remain the same}> 1.75/1.76 Solving with 1 template(s). 1.75/1.76 1.75/1.76 LOG: CALL solveNonLinearGetFirstSolution 1.75/1.76 1.75/1.76 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.039235s 1.75/1.76 Time used: 0.035838 1.75/1.76 Solving with 1 template(s). 1.75/1.76 1.75/1.76 LOG: CALL solveNonLinearGetFirstSolution 1.75/1.76 1.75/1.76 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.166678s 1.75/1.76 Time used: 0.162709 1.75/1.76 Improving Solution with cost 1 ... 1.75/1.76 1.75/1.76 LOG: CALL solveNonLinearGetNextSolution 1.75/1.76 1.75/1.76 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.063535s 1.75/1.76 Time used: 1.06347 1.75/1.76 1.75/1.76 LOG: SAT solveNonLinear - Elapsed time: 1.230214s 1.75/1.76 Cost: 1; Total time: 1.22618 1.75/1.76 Failed at location 2: arg3 + arg4 <= 0 1.75/1.76 Before Improving: 1.75/1.76 Quasi-invariant at l2: arg3 + arg4 <= 0 1.75/1.76 Optimizing invariants... 1.75/1.76 1.75/1.76 LOG: CALL solveLinear 1.75/1.76 1.75/1.76 LOG: RETURN solveLinear - Elapsed time: 0.030851s 1.75/1.76 Remaining time after improvement: 0.988014 1.75/1.76 Termination implied by a set of quasi-invariant(s): 1.75/1.76 Quasi-invariant at l2: arg3 + arg4 <= 0 1.75/1.76 [ Invariant Graph ] 1.75/1.76 Strengthening and disabling transitions... 1.75/1.76 1.75/1.76 LOG: CALL solverLinear in Graph for feasibility 1.75/1.76 1.75/1.76 LOG: RETURN solveLinear in Graph for feasibility 1.75/1.76 It's unfeasible. Removing transition: 1.75/1.76 undef13, arg3 -> undef15, arg4 -> undef16, arg6 -> undef18, rest remain the same}> 1.75/1.76 1.75/1.76 LOG: CALL solverLinear in Graph for feasibility 1.75/1.76 1.75/1.76 LOG: RETURN solveLinear in Graph for feasibility 1.75/1.76 It's unfeasible. Removing transition: 1.75/1.76 undef20, arg3 -> undef22, arg4 -> undef23, arg5 -> undef24, arg6 -> undef25, rest remain the same}> 1.75/1.76 1.75/1.76 LOG: CALL solverLinear in Graph for feasibility 1.75/1.76 1.75/1.76 LOG: RETURN solveLinear in Graph for feasibility 1.75/1.76 Strengthening transition (result): 1.75/1.76 undef26, arg2 -> 1 + arg2, arg3 -> undef28, arg4 -> undef29, arg5 -> 0, arg6 -> undef31, rest remain the same}> 1.75/1.76 [ Termination Graph ] 1.75/1.76 Strengthening and disabling transitions... 1.75/1.76 > It's unfeasible. Removing transition: 1.75/1.76 undef13, arg3 -> undef15, arg4 -> undef16, arg6 -> undef18, rest remain the same}> 1.75/1.76 1.75/1.76 LOG: CALL solverLinear in Graph for feasibility 1.75/1.76 1.75/1.76 LOG: RETURN solveLinear in Graph for feasibility 1.75/1.76 It's unfeasible. Removing transition: 1.75/1.76 undef20, arg3 -> undef22, arg4 -> undef23, arg5 -> undef24, arg6 -> undef25, rest remain the same}> 1.75/1.76 1.75/1.76 LOG: CALL solverLinear in Graph for feasibility 1.75/1.76 1.75/1.76 LOG: RETURN solveLinear in Graph for feasibility 1.75/1.76 Strengthening transition (result): 1.75/1.76 undef26, arg2 -> 1 + arg2, arg3 -> undef28, arg4 -> undef29, arg5 -> 0, arg6 -> undef31, rest remain the same}> 1.75/1.76 New Graphs: 1.75/1.76 Transitions: 1.75/1.76 undef26, arg2 -> 1 + arg2, arg3 -> undef28, arg4 -> undef29, arg5 -> 0, arg6 -> undef31, rest remain the same}> 1.75/1.76 Variables: 1.75/1.76 arg1, arg2, arg3, arg4, arg5, arg6 1.75/1.76 Checking conditional termination of SCC {l2}... 1.75/1.76 1.75/1.76 LOG: CALL solveLinear 1.75/1.76 1.75/1.76 LOG: RETURN solveLinear - Elapsed time: 0.002145s 1.75/1.76 1.75/1.76 LOG: CALL solveLinear 1.75/1.76 1.75/1.76 LOG: RETURN solveLinear - Elapsed time: 0.009850s 1.75/1.76 Trying to remove transition: undef26, arg2 -> 1 + arg2, arg3 -> undef28, arg4 -> undef29, arg5 -> 0, arg6 -> undef31, rest remain the same}> 1.75/1.76 Solving with 1 template(s). 1.75/1.76 1.75/1.76 LOG: CALL solveNonLinearGetFirstSolution 1.75/1.76 1.75/1.76 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.018214s 1.75/1.76 Time used: 0.017454 1.75/1.76 Solving with 1 template(s). 1.75/1.76 1.75/1.76 LOG: CALL solveNonLinearGetFirstSolution 1.75/1.76 1.75/1.76 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.020247s 1.75/1.76 Time used: 0.018786 1.75/1.76 1.75/1.76 LOG: SAT solveNonLinear - Elapsed time: 0.020247s 1.75/1.76 Cost: 0; Total time: 0.018786 1.75/1.76 Termination implied by a set of invariant(s): 1.75/1.76 Invariant at l2: arg5 <= arg1 1.75/1.76 [ Invariant Graph ] 1.75/1.76 Strengthening and disabling transitions... 1.75/1.76 1.75/1.76 LOG: CALL solverLinear in Graph for feasibility 1.75/1.76 1.75/1.76 LOG: RETURN solveLinear in Graph for feasibility 1.75/1.76 Strengthening transition (result): 1.75/1.76 undef26, arg2 -> 1 + arg2, arg3 -> undef28, arg4 -> undef29, arg5 -> 0, arg6 -> undef31, rest remain the same}> 1.75/1.76 [ Termination Graph ] 1.75/1.76 Strengthening and disabling transitions... 1.75/1.76 1.75/1.76 LOG: CALL solverLinear in Graph for feasibility 1.75/1.76 1.75/1.76 LOG: RETURN solveLinear in Graph for feasibility 1.75/1.76 Strengthening transition (result): 1.75/1.76 undef26, arg2 -> 1 + arg2, arg3 -> undef28, arg4 -> undef29, arg5 -> 0, arg6 -> undef31, rest remain the same}> 1.75/1.76 Ranking function: arg1 - arg2 1.75/1.76 New Graphs: 1.75/1.76 Calling Safety with literal arg3 + arg4 <= 0 and entry undef7, arg2 -> 0, arg3 -> undef9, arg4 -> undef10, arg5 -> 0, arg6 -> undef12, rest remain the same}> 1.75/1.76 1.75/1.76 LOG: CALL check - Post:arg3 + arg4 <= 0 - Process 1 1.75/1.76 * Exit transition: undef7, arg2 -> 0, arg3 -> undef9, arg4 -> undef10, arg5 -> 0, arg6 -> undef12, rest remain the same}> 1.75/1.76 * Postcondition : arg3 + arg4 <= 0 1.75/1.76 1.75/1.76 LOG: CALL solveLinear 1.75/1.76 1.75/1.76 LOG: RETURN solveLinear - Elapsed time: 0.001189s 1.75/1.76 > Postcondition is not implied! 1.75/1.76 1.75/1.76 LOG: RETURN check - Elapsed time: 0.001338s 1.75/1.76 INVARIANTS: 1.75/1.76 2: 1.75/1.76 Quasi-INVARIANTS to narrow Graph: 1.75/1.76 2: arg3 + arg4 <= 0 , 1.75/1.76 INVARIANTS: 1.75/1.76 2: arg5 <= arg1 , 1.75/1.76 Quasi-INVARIANTS to narrow Graph: 1.75/1.76 2: 1.75/1.76 Narrowing transition: 1.75/1.76 undef13, arg3 -> undef15, arg4 -> undef16, arg6 -> undef18, rest remain the same}> 1.75/1.76 1.75/1.76 LOG: Narrow transition size 1 1.75/1.76 Narrowing transition: 1.75/1.76 undef20, arg3 -> undef22, arg4 -> undef23, arg5 -> undef24, arg6 -> undef25, rest remain the same}> 1.75/1.76 1.75/1.76 LOG: Narrow transition size 1 1.75/1.76 Narrowing transition: 1.75/1.76 undef26, arg2 -> 1 + arg2, arg3 -> undef28, arg4 -> undef29, arg5 -> 0, arg6 -> undef31, rest remain the same}> 1.75/1.76 1.75/1.76 LOG: Narrow transition size 1 1.75/1.76 invGraph after Narrowing: 1.75/1.76 Transitions: 1.75/1.76 undef13, arg3 -> undef15, arg4 -> undef16, arg6 -> undef18, rest remain the same}> 1.75/1.76 undef20, arg3 -> undef22, arg4 -> undef23, arg5 -> undef24, arg6 -> undef25, rest remain the same}> 1.75/1.76 undef26, arg2 -> 1 + arg2, arg3 -> undef28, arg4 -> undef29, arg5 -> 0, arg6 -> undef31, rest remain the same}> 1.75/1.76 Variables: 1.75/1.76 arg1, arg3, arg4, arg5, arg6, arg2 1.75/1.76 Checking conditional termination of SCC {l2}... 1.75/1.76 1.75/1.76 LOG: CALL solveLinear 1.75/1.76 1.75/1.76 LOG: RETURN solveLinear - Elapsed time: 0.012214s 1.75/1.76 Ranking function: arg1 - arg2 1.75/1.76 New Graphs: 1.75/1.76 Transitions: 1.75/1.76 undef13, arg3 -> undef15, arg4 -> undef16, arg6 -> undef18, rest remain the same}> 1.75/1.76 undef20, arg3 -> undef22, arg4 -> undef23, arg5 -> undef24, arg6 -> undef25, rest remain the same}> 1.75/1.76 Variables: 1.75/1.76 arg1, arg3, arg4, arg5, arg6 1.75/1.76 Checking conditional termination of SCC {l2}... 1.75/1.76 1.75/1.76 LOG: CALL solveLinear 1.75/1.76 1.75/1.76 LOG: RETURN solveLinear - Elapsed time: 0.006795s 1.75/1.76 Ranking function: -1 + (1 / 2)*arg4 + (1 / 2)*arg6 1.75/1.76 New Graphs: 1.75/1.76 Proving termination of subgraph 3 1.75/1.76 Checking unfeasibility... 1.75/1.76 Time used: 0.009817 1.75/1.76 1.75/1.76 Checking conditional termination of SCC {l5}... 1.75/1.76 1.75/1.76 LOG: CALL solveLinear 1.75/1.76 1.75/1.76 LOG: RETURN solveLinear - Elapsed time: 0.004490s 1.75/1.76 Ranking function: -1 + arg3 1.75/1.76 New Graphs: 1.75/1.76 Program Terminates 1.75/1.76 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found 1.75/1.76 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found 1.75/1.76 EOF