47.35/47.49 NO 47.35/47.49 47.35/47.49 Solver Timeout: 4 47.35/47.49 Global Timeout: 300 47.35/47.49 No parsing errors! 47.35/47.49 Init Location: 0 47.35/47.49 Transitions: 47.35/47.49 47.35/47.49 (1 + l^0)}> 47.35/47.49 47.35/47.49 47.35/47.49 47.35/47.49 47.35/47.49 (1 + i^0)}> 47.35/47.49 47.35/47.49 47.35/47.49 47.35/47.49 47.35/47.49 47.35/47.49 47.35/47.49 47.35/47.49 (~(1) + i^0)}> 47.35/47.49 undef313, k^0 -> (1 + k^0)}> 47.35/47.49 undef333, g^0 -> undef336, p^0 -> undef343, r^0 -> undef344, s^0 -> undef345}> 47.35/47.49 47.35/47.49 47.35/47.49 47.35/47.49 47.35/47.49 47.35/47.49 undef465, f^0 -> undef468, r^0 -> undef477}> 47.35/47.49 47.35/47.49 undef510, g^0 -> undef513, p^0 -> 0, s^0 -> (0 + undef510)}> 47.35/47.49 undef550, tmp___5^0 -> (0 + (~(1) * undef550))}> 47.35/47.49 undef571, tmp___5^0 -> (0 + undef571)}> 47.35/47.49 undef579, r^0 -> undef587}> 47.35/47.49 47.35/47.49 47.35/47.49 47.35/47.49 47.35/47.49 (1 + iter^0), tmp___2^0 -> (0 + iter^0)}> 47.35/47.49 47.35/47.49 47.35/47.49 47.35/47.49 47.35/47.49 (1 + m^0)}> 47.35/47.49 47.35/47.49 47.35/47.49 47.35/47.49 47.35/47.49 47.35/47.49 ((0 + undef941) + undef942), tmp^0 -> undef941, tmp___0^0 -> undef942, tmp___1^0 -> undef943}> 47.35/47.49 47.35/47.49 0}> 47.35/47.49 47.35/47.49 47.35/47.49 47.35/47.49 Fresh variables: 47.35/47.49 undef313, undef333, undef336, undef343, undef344, undef345, undef353, undef465, undef468, undef477, undef510, undef513, undef550, undef571, undef579, undef587, undef941, undef942, undef943, 47.35/47.49 47.35/47.49 Undef variables: 47.35/47.49 undef313, undef333, undef336, undef343, undef344, undef345, undef353, undef465, undef468, undef477, undef510, undef513, undef550, undef571, undef579, undef587, undef941, undef942, undef943, 47.35/47.49 47.35/47.49 Abstraction variables: 47.35/47.49 47.35/47.49 Exit nodes: 47.35/47.49 47.35/47.49 Accepting locations: 47.35/47.49 47.35/47.49 Asserts: 47.35/47.49 47.35/47.49 Preprocessed LLVMGraph 47.35/47.49 Init Location: 0 47.35/47.49 Transitions: 47.35/47.49 47.35/47.49 47.35/47.49 0}> 47.35/47.49 (1 + i^0)}> 47.35/47.49 (1 + l^0)}> 47.35/47.49 0, l^0 -> (1 + l^0)}> 47.35/47.49 47.35/47.49 47.35/47.49 (1 + l^0)}> 47.35/47.49 0, l^0 -> (1 + l^0)}> 47.35/47.49 47.35/47.49 47.35/47.49 (1 + l^0)}> 47.35/47.49 0, l^0 -> (1 + l^0)}> 47.35/47.49 47.35/47.49 47.35/47.49 (1 + l^0)}> 47.35/47.49 0, l^0 -> (1 + l^0)}> 47.35/47.49 47.35/47.49 47.35/47.49 (~(1) + i^0)}> 47.35/47.49 (~(1) + i^0), r^0 -> undef344}> 47.35/47.49 (~(1) + i^0), r^0 -> undef344}> 47.35/47.49 (~(1) + i^0), r^0 -> undef477}> 47.35/47.49 (1 + k^0)}> 47.35/47.49 (1 + l^0)}> 47.35/47.49 (1 + iter^0), tmp___2^0 -> (0 + iter^0)}> 47.35/47.49 (1 + iter^0), tmp___2^0 -> (0 + iter^0)}> 47.35/47.49 (1 + m^0)}> 47.35/47.49 (1 + m^0)}> 47.35/47.49 0, l^0 -> (1 + l^0)}> 47.35/47.49 (1 + iter^0), tmp___2^0 -> (0 + iter^0)}> 47.35/47.49 (1 + iter^0), tmp___2^0 -> (0 + iter^0)}> 47.35/47.49 undef587}> 47.35/47.49 undef344}> 47.35/47.49 undef344}> 47.35/47.49 undef477}> 47.35/47.49 undef587}> 47.35/47.49 undef344}> 47.35/47.49 undef344}> 47.35/47.49 undef477}> 47.35/47.49 undef587}> 47.35/47.49 undef344}> 47.35/47.49 undef344}> 47.35/47.49 undef477}> 47.35/47.49 undef587}> 47.35/47.49 undef344}> 47.35/47.49 undef344}> 47.35/47.49 undef477}> 47.35/47.49 undef587}> 47.35/47.49 undef344}> 47.35/47.49 undef344}> 47.35/47.49 undef477}> 47.35/47.49 undef587}> 47.35/47.49 undef344}> 47.35/47.49 undef344}> 47.35/47.49 undef477}> 47.35/47.49 47.35/47.49 Fresh variables: 47.35/47.49 undef313, undef333, undef336, undef343, undef344, undef345, undef353, undef465, undef468, undef477, undef510, undef513, undef550, undef571, undef579, undef587, undef941, undef942, undef943, 47.35/47.49 47.35/47.49 Undef variables: 47.35/47.49 undef313, undef333, undef336, undef343, undef344, undef345, undef353, undef465, undef468, undef477, undef510, undef513, undef550, undef571, undef579, undef587, undef941, undef942, undef943, 47.35/47.49 47.35/47.49 Abstraction variables: 47.35/47.49 47.35/47.49 Exit nodes: 47.35/47.49 47.35/47.49 Accepting locations: 47.35/47.49 47.35/47.49 Asserts: 47.35/47.49 47.35/47.49 ************************************************************* 47.35/47.49 ******************************************************************************************* 47.35/47.49 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 47.35/47.49 ******************************************************************************************* 47.35/47.49 47.35/47.49 Init Location: 0 47.35/47.49 Graph 0: 47.35/47.49 Transitions: 47.35/47.49 Variables: 47.35/47.49 47.35/47.49 Graph 1: 47.35/47.49 Transitions: 47.35/47.49 1 + i^0, rest remain the same}> 47.35/47.49 Variables: 47.35/47.49 i^0, n^0 47.35/47.49 47.35/47.49 Graph 2: 47.35/47.49 Transitions: 47.35/47.49 0, l^0 -> 1 + l^0, rest remain the same}> 47.35/47.49 47.35/47.49 47.35/47.49 0, l^0 -> 1 + l^0, rest remain the same}> 47.35/47.49 47.35/47.49 47.35/47.49 0, l^0 -> 1 + l^0, rest remain the same}> 47.35/47.49 47.35/47.49 47.35/47.49 0, l^0 -> 1 + l^0, rest remain the same}> 47.35/47.49 47.35/47.49 47.35/47.49 -1 + i^0, rest remain the same}> 47.35/47.49 -1 + i^0, r^0 -> undef344, rest remain the same}> 47.35/47.49 -1 + i^0, r^0 -> undef344, rest remain the same}> 47.35/47.49 -1 + i^0, r^0 -> undef477, rest remain the same}> 47.35/47.49 1 + k^0, rest remain the same}> 47.35/47.49 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 47.35/47.49 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 47.35/47.49 1 + m^0, rest remain the same}> 47.35/47.49 1 + m^0, rest remain the same}> 47.35/47.49 0, l^0 -> 1 + l^0, rest remain the same}> 47.35/47.49 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 47.35/47.49 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 47.35/47.49 undef587, rest remain the same}> 47.35/47.49 undef344, rest remain the same}> 47.35/47.49 undef344, rest remain the same}> 47.35/47.49 undef477, rest remain the same}> 47.35/47.49 undef587, rest remain the same}> 47.35/47.49 undef344, rest remain the same}> 47.35/47.49 undef344, rest remain the same}> 47.35/47.49 undef477, rest remain the same}> 47.35/47.49 undef587, rest remain the same}> 47.35/47.49 undef344, rest remain the same}> 47.35/47.49 undef344, rest remain the same}> 47.35/47.49 undef477, rest remain the same}> 47.35/47.49 undef587, rest remain the same}> 47.35/47.49 undef344, rest remain the same}> 47.35/47.49 undef344, rest remain the same}> 47.35/47.49 undef477, rest remain the same}> 47.35/47.49 undef587, rest remain the same}> 47.35/47.49 undef344, rest remain the same}> 47.35/47.49 undef344, rest remain the same}> 47.35/47.49 undef477, rest remain the same}> 47.35/47.49 undef587, rest remain the same}> 47.35/47.49 undef344, rest remain the same}> 47.35/47.49 undef344, rest remain the same}> 47.35/47.49 undef477, rest remain the same}> 47.35/47.49 Variables: 47.35/47.49 l^0, m^0, n^0, r^0, i^0, k^0, iter^0, tmp___2^0, __const_30^0 47.35/47.49 47.35/47.49 Graph 3: 47.35/47.49 Transitions: 47.35/47.49 Variables: 47.35/47.49 47.35/47.49 Precedence: 47.35/47.49 Graph 0 47.35/47.49 47.35/47.49 Graph 1 47.35/47.49 47.35/47.49 47.35/47.49 Graph 2 47.35/47.49 0, rest remain the same}> 47.35/47.49 47.35/47.49 Graph 3 47.35/47.49 47.35/47.49 1 + l^0, rest remain the same}> 47.35/47.49 1 + l^0, rest remain the same}> 47.35/47.49 1 + l^0, rest remain the same}> 47.35/47.49 1 + l^0, rest remain the same}> 47.35/47.49 1 + l^0, rest remain the same}> 47.35/47.49 47.35/47.49 Map Locations to Subgraph: 47.35/47.49 ( 0 , 0 ) 47.35/47.49 ( 6 , 1 ) 47.35/47.49 ( 9 , 2 ) 47.35/47.49 ( 13 , 2 ) 47.35/47.49 ( 15 , 2 ) 47.35/47.49 ( 22 , 2 ) 47.35/47.49 ( 28 , 3 ) 47.35/47.49 47.35/47.49 ******************************************************************************************* 47.35/47.49 ******************************** CHECKING ASSERTIONS ******************************** 47.35/47.49 ******************************************************************************************* 47.35/47.49 47.35/47.49 Proving termination of subgraph 0 47.35/47.49 Proving termination of subgraph 1 47.35/47.49 Checking unfeasibility... 47.35/47.49 Time used: 0.001859 47.35/47.49 47.35/47.49 Checking conditional termination of SCC {l6}... 47.35/47.49 47.35/47.49 LOG: CALL solveLinear 47.35/47.49 47.35/47.49 LOG: RETURN solveLinear - Elapsed time: 0.001407s 47.35/47.49 Ranking function: -i^0 + n^0 47.35/47.49 New Graphs: 47.35/47.49 Proving termination of subgraph 2 47.35/47.49 Checking unfeasibility... 47.35/47.49 Time used: 1.65456 47.35/47.49 Some transition disabled by a set of invariant(s): 47.35/47.49 Invariant at l9: l^0 <= n^0 47.35/47.49 Invariant at l13: l^0 <= n^0 47.35/47.49 Invariant at l15: l^0 <= n^0 47.35/47.49 Invariant at l22: l^0 <= n^0 47.35/47.49 47.35/47.49 Strengthening and disabling transitions... 47.35/47.49 > It's unfeasible. Removing transition: 47.35/47.49 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 47.35/47.49 47.35/47.49 LOG: CALL solverLinear in Graph for feasibility 47.35/47.49 47.35/47.49 LOG: RETURN solveLinear in Graph for feasibility 47.35/47.49 Strengthening transition (result): 47.35/47.49 0, l^0 -> 1 + l^0, rest remain the same}> 47.35/47.49 47.35/47.49 LOG: CALL solverLinear in Graph for feasibility 47.35/47.49 47.35/47.49 LOG: RETURN solveLinear in Graph for feasibility 47.35/47.49 Strengthening transition (result): 47.35/47.49 47.35/47.49 47.35/47.49 LOG: CALL solverLinear in Graph for feasibility 47.35/47.49 47.35/47.49 LOG: RETURN solveLinear in Graph for feasibility 47.35/47.49 Strengthening transition (result): 47.35/47.49 47.35/47.49 47.35/47.49 LOG: CALL solverLinear in Graph for feasibility 47.35/47.49 47.35/47.49 LOG: RETURN solveLinear in Graph for feasibility 47.35/47.49 Strengthening transition (result): 47.35/47.49 0, l^0 -> 1 + l^0, rest remain the same}> 47.35/47.49 47.35/47.49 LOG: CALL solverLinear in Graph for feasibility 47.35/47.49 47.35/47.49 LOG: RETURN solveLinear in Graph for feasibility 47.35/47.49 Strengthening transition (result): 47.35/47.49 47.35/47.49 47.35/47.49 LOG: CALL solverLinear in Graph for feasibility 47.35/47.49 47.35/47.49 LOG: RETURN solveLinear in Graph for feasibility 47.35/47.49 Strengthening transition (result): 47.35/47.49 47.35/47.49 47.35/47.49 LOG: CALL solverLinear in Graph for feasibility 47.35/47.49 47.35/47.49 LOG: RETURN solveLinear in Graph for feasibility 47.35/47.49 Strengthening transition (result): 47.35/47.49 0, l^0 -> 1 + l^0, rest remain the same}> 47.35/47.49 47.35/47.49 LOG: CALL solverLinear in Graph for feasibility 47.35/47.49 47.35/47.49 LOG: RETURN solveLinear in Graph for feasibility 47.35/47.49 Strengthening transition (result): 47.35/47.49 47.35/47.49 47.35/47.49 LOG: CALL solverLinear in Graph for feasibility 47.35/47.49 47.35/47.49 LOG: RETURN solveLinear in Graph for feasibility 47.35/47.49 Strengthening transition (result): 47.35/47.49 47.35/47.49 47.35/47.49 LOG: CALL solverLinear in Graph for feasibility 47.35/47.49 47.35/47.49 LOG: RETURN solveLinear in Graph for feasibility 47.35/47.49 Strengthening transition (result): 47.35/47.49 0, l^0 -> 1 + l^0, rest remain the same}> 47.35/47.49 47.35/47.49 LOG: CALL solverLinear in Graph for feasibility 47.35/47.49 47.35/47.49 LOG: RETURN solveLinear in Graph for feasibility 47.35/47.49 Strengthening transition (result): 47.35/47.49 47.35/47.49 47.35/47.49 LOG: CALL solverLinear in Graph for feasibility 47.35/47.49 47.35/47.49 LOG: RETURN solveLinear in Graph for feasibility 47.35/47.49 Strengthening transition (result): 47.35/47.49 47.35/47.49 47.35/47.49 LOG: CALL solverLinear in Graph for feasibility 47.35/47.49 47.35/47.49 LOG: RETURN solveLinear in Graph for feasibility 47.35/47.49 Strengthening transition (result): 47.35/47.49 -1 + i^0, rest remain the same}> 47.35/47.49 47.35/47.49 LOG: CALL solverLinear in Graph for feasibility 47.35/47.49 47.35/47.49 LOG: RETURN solveLinear in Graph for feasibility 47.35/47.49 Strengthening transition (result): 47.35/47.49 -1 + i^0, r^0 -> undef344, rest remain the same}> 47.35/47.49 47.35/47.49 LOG: CALL solverLinear in Graph for feasibility 47.35/47.49 47.35/47.49 LOG: RETURN solveLinear in Graph for feasibility 47.35/47.49 Strengthening transition (result): 47.35/47.49 -1 + i^0, r^0 -> undef344, rest remain the same}> 47.35/47.49 47.35/47.49 LOG: CALL solverLinear in Graph for feasibility 47.35/47.49 47.35/47.49 LOG: RETURN solveLinear in Graph for feasibility 47.35/47.49 Strengthening transition (result): 47.35/47.49 -1 + i^0, r^0 -> undef477, rest remain the same}> 47.35/47.49 47.35/47.49 LOG: CALL solverLinear in Graph for feasibility 47.35/47.49 47.35/47.49 LOG: RETURN solveLinear in Graph for feasibility 47.35/47.49 Strengthening transition (result): 47.35/47.49 1 + k^0, rest remain the same}> 47.35/47.49 47.35/47.49 LOG: CALL solverLinear in Graph for feasibility 47.35/47.49 47.35/47.49 LOG: RETURN solveLinear in Graph for feasibility 47.35/47.49 Strengthening transition (result): 47.35/47.49 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 47.35/47.49 47.35/47.49 LOG: CALL solverLinear in Graph for feasibility 47.35/47.49 47.35/47.49 LOG: RETURN solveLinear in Graph for feasibility 47.35/47.49 Strengthening transition (result): 47.35/47.49 1 + m^0, rest remain the same}> 47.35/47.49 47.35/47.49 LOG: CALL solverLinear in Graph for feasibility 47.35/47.49 47.35/47.49 LOG: RETURN solveLinear in Graph for feasibility 47.35/47.49 Strengthening transition (result): 47.35/47.49 1 + m^0, rest remain the same}> 47.35/47.49 47.35/47.49 LOG: CALL solverLinear in Graph for feasibility 47.35/47.49 47.35/47.49 LOG: RETURN solveLinear in Graph for feasibility 47.35/47.49 Strengthening transition (result): 47.35/47.49 0, l^0 -> 1 + l^0, rest remain the same}> 47.35/47.49 47.35/47.49 LOG: CALL solverLinear in Graph for feasibility 47.35/47.49 47.35/47.49 LOG: RETURN solveLinear in Graph for feasibility 47.35/47.49 Strengthening transition (result): 47.35/47.49 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 47.35/47.49 47.35/47.49 LOG: CALL solverLinear in Graph for feasibility 47.35/47.49 47.35/47.49 LOG: RETURN solveLinear in Graph for feasibility 47.35/47.49 Strengthening transition (result): 47.35/47.49 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 47.35/47.49 47.35/47.49 LOG: CALL solverLinear in Graph for feasibility 47.35/47.49 47.35/47.49 LOG: RETURN solveLinear in Graph for feasibility 47.35/47.49 Strengthening transition (result): 47.35/47.49 undef587, rest remain the same}> 47.35/47.49 47.35/47.49 LOG: CALL solverLinear in Graph for feasibility 47.35/47.49 47.35/47.49 LOG: RETURN solveLinear in Graph for feasibility 47.35/47.49 Strengthening transition (result): 47.35/47.49 undef344, rest remain the same}> 47.35/47.49 47.35/47.49 LOG: CALL solverLinear in Graph for feasibility 47.35/47.49 47.35/47.49 LOG: RETURN solveLinear in Graph for feasibility 47.35/47.49 Strengthening transition (result): 47.35/47.49 undef344, rest remain the same}> 47.35/47.49 47.35/47.49 LOG: CALL solverLinear in Graph for feasibility 47.35/47.49 47.35/47.49 LOG: RETURN solveLinear in Graph for feasibility 47.35/47.49 Strengthening transition (result): 47.35/47.49 undef477, rest remain the same}> 47.35/47.49 47.35/47.49 LOG: CALL solverLinear in Graph for feasibility 47.35/47.49 47.35/47.49 LOG: RETURN solveLinear in Graph for feasibility 47.35/47.49 Strengthening transition (result): 47.35/47.49 undef587, rest remain the same}> 47.35/47.49 47.35/47.49 LOG: CALL solverLinear in Graph for feasibility 47.35/47.49 47.35/47.49 LOG: RETURN solveLinear in Graph for feasibility 47.35/47.49 Strengthening transition (result): 47.35/47.49 undef344, rest remain the same}> 47.35/47.49 47.35/47.49 LOG: CALL solverLinear in Graph for feasibility 47.35/47.49 47.35/47.49 LOG: RETURN solveLinear in Graph for feasibility 47.35/47.49 Strengthening transition (result): 47.35/47.49 undef344, rest remain the same}> 47.35/47.49 47.35/47.49 LOG: CALL solverLinear in Graph for feasibility 47.35/47.49 47.35/47.49 LOG: RETURN solveLinear in Graph for feasibility 47.35/47.49 Strengthening transition (result): 47.35/47.49 undef477, rest remain the same}> 47.35/47.49 47.35/47.49 LOG: CALL solverLinear in Graph for feasibility 47.35/47.49 47.35/47.49 LOG: RETURN solveLinear in Graph for feasibility 47.35/47.49 Strengthening transition (result): 47.35/47.49 undef587, rest remain the same}> 47.35/47.49 47.35/47.49 LOG: CALL solverLinear in Graph for feasibility 47.35/47.49 47.35/47.49 LOG: RETURN solveLinear in Graph for feasibility 47.35/47.49 Strengthening transition (result): 47.35/47.49 undef344, rest remain the same}> 47.35/47.49 47.35/47.49 LOG: CALL solverLinear in Graph for feasibility 47.35/47.49 47.35/47.49 LOG: RETURN solveLinear in Graph for feasibility 47.35/47.49 Strengthening transition (result): 47.35/47.49 undef344, rest remain the same}> 47.35/47.49 47.35/47.49 LOG: CALL solverLinear in Graph for feasibility 47.35/47.49 47.35/47.49 LOG: RETURN solveLinear in Graph for feasibility 47.35/47.49 Strengthening transition (result): 47.35/47.49 undef477, rest remain the same}> 47.35/47.49 47.35/47.49 LOG: CALL solverLinear in Graph for feasibility 47.35/47.49 47.35/47.49 LOG: RETURN solveLinear in Graph for feasibility 47.35/47.49 Strengthening transition (result): 47.35/47.49 undef587, rest remain the same}> 47.35/47.49 47.35/47.49 LOG: CALL solverLinear in Graph for feasibility 47.35/47.49 47.35/47.49 LOG: RETURN solveLinear in Graph for feasibility 47.35/47.49 Strengthening transition (result): 47.35/47.49 undef344, rest remain the same}> 47.35/47.49 47.35/47.49 LOG: CALL solverLinear in Graph for feasibility 47.35/47.49 47.35/47.49 LOG: RETURN solveLinear in Graph for feasibility 47.35/47.49 Strengthening transition (result): 47.35/47.49 undef344, rest remain the same}> 47.35/47.49 47.35/47.49 LOG: CALL solverLinear in Graph for feasibility 47.35/47.49 47.35/47.49 LOG: RETURN solveLinear in Graph for feasibility 47.35/47.49 Strengthening transition (result): 47.35/47.49 undef477, rest remain the same}> 47.35/47.49 47.35/47.49 LOG: CALL solverLinear in Graph for feasibility 47.35/47.49 47.35/47.49 LOG: RETURN solveLinear in Graph for feasibility 47.35/47.49 Strengthening transition (result): 47.35/47.49 undef587, rest remain the same}> 47.35/47.49 47.35/47.49 LOG: CALL solverLinear in Graph for feasibility 47.35/47.49 47.35/47.49 LOG: RETURN solveLinear in Graph for feasibility 47.35/47.49 Strengthening transition (result): 47.35/47.49 undef344, rest remain the same}> 47.35/47.49 47.35/47.49 LOG: CALL solverLinear in Graph for feasibility 47.35/47.49 47.35/47.49 LOG: RETURN solveLinear in Graph for feasibility 47.35/47.49 Strengthening transition (result): 47.35/47.49 undef344, rest remain the same}> 47.35/47.49 47.35/47.49 LOG: CALL solverLinear in Graph for feasibility 47.35/47.49 47.35/47.49 LOG: RETURN solveLinear in Graph for feasibility 47.35/47.49 Strengthening transition (result): 47.35/47.49 undef477, rest remain the same}> 47.35/47.49 47.35/47.49 LOG: CALL solverLinear in Graph for feasibility 47.35/47.49 47.35/47.49 LOG: RETURN solveLinear in Graph for feasibility 47.35/47.49 Strengthening transition (result): 47.35/47.49 undef587, rest remain the same}> 47.35/47.49 47.35/47.49 LOG: CALL solverLinear in Graph for feasibility 47.35/47.49 47.35/47.49 LOG: RETURN solveLinear in Graph for feasibility 47.35/47.49 Strengthening transition (result): 47.35/47.49 undef344, rest remain the same}> 47.35/47.49 47.35/47.49 LOG: CALL solverLinear in Graph for feasibility 47.35/47.49 47.35/47.49 LOG: RETURN solveLinear in Graph for feasibility 47.35/47.49 Strengthening transition (result): 47.35/47.49 undef344, rest remain the same}> 47.35/47.49 47.35/47.49 LOG: CALL solverLinear in Graph for feasibility 47.35/47.49 47.35/47.49 LOG: RETURN solveLinear in Graph for feasibility 47.35/47.49 Strengthening transition (result): 47.35/47.49 undef477, rest remain the same}> 47.35/47.49 Checking unfeasibility... 47.35/47.49 Time used: 1.29243 47.35/47.49 47.35/47.49 Checking conditional termination of SCC {l9, l13, l15, l22}... 47.35/47.49 47.35/47.49 LOG: CALL solveLinear 47.35/47.49 47.35/47.49 LOG: RETURN solveLinear - Elapsed time: 0.067788s 47.35/47.49 Ranking function: -8 - 5*l^0 - 3*m^0 + 8*n^0 47.35/47.49 New Graphs: 47.35/47.49 Transitions: 47.35/47.49 47.35/47.49 47.35/47.49 47.35/47.49 47.35/47.49 47.35/47.49 47.35/47.49 47.35/47.49 47.35/47.49 -1 + i^0, rest remain the same}> 47.35/47.49 -1 + i^0, r^0 -> undef344, rest remain the same}> 47.35/47.49 -1 + i^0, r^0 -> undef344, rest remain the same}> 47.35/47.49 -1 + i^0, r^0 -> undef477, rest remain the same}> 47.35/47.49 1 + k^0, rest remain the same}> 47.35/47.49 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 47.35/47.49 1 + m^0, rest remain the same}> 47.35/47.49 1 + m^0, rest remain the same}> 47.35/47.49 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 47.35/47.49 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 47.35/47.49 undef587, rest remain the same}> 47.35/47.49 undef344, rest remain the same}> 47.35/47.49 undef344, rest remain the same}> 47.35/47.49 undef477, rest remain the same}> 47.35/47.49 undef587, rest remain the same}> 47.35/47.49 undef344, rest remain the same}> 47.35/47.49 undef344, rest remain the same}> 47.35/47.49 undef477, rest remain the same}> 47.35/47.49 undef587, rest remain the same}> 47.35/47.49 undef344, rest remain the same}> 47.35/47.49 undef344, rest remain the same}> 47.35/47.49 undef477, rest remain the same}> 47.35/47.49 undef587, rest remain the same}> 47.35/47.49 undef344, rest remain the same}> 47.35/47.49 undef344, rest remain the same}> 47.35/47.49 undef477, rest remain the same}> 47.35/47.49 undef587, rest remain the same}> 47.35/47.49 undef344, rest remain the same}> 47.35/47.49 undef344, rest remain the same}> 47.35/47.49 undef477, rest remain the same}> 47.35/47.49 undef587, rest remain the same}> 47.35/47.49 undef344, rest remain the same}> 47.35/47.49 undef344, rest remain the same}> 47.35/47.49 undef477, rest remain the same}> 47.35/47.49 Variables: 47.35/47.49 __const_30^0, i^0, iter^0, k^0, l^0, m^0, n^0, r^0, tmp___2^0 47.35/47.49 Checking conditional termination of SCC {l9, l13, l15, l22}... 47.35/47.49 47.35/47.49 LOG: CALL solveLinear 47.35/47.49 47.35/47.49 LOG: RETURN solveLinear - Elapsed time: 0.041310s 47.35/47.49 Ranking function: -5 + 5*i^0 - 5*l^0 47.35/47.49 New Graphs: 47.35/47.49 Transitions: 47.35/47.49 47.35/47.49 47.35/47.49 47.35/47.49 47.35/47.49 47.35/47.49 47.35/47.49 47.35/47.49 47.35/47.49 -1 + i^0, rest remain the same}> 47.35/47.49 1 + k^0, rest remain the same}> 47.35/47.49 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 47.35/47.49 1 + m^0, rest remain the same}> 47.35/47.49 1 + m^0, rest remain the same}> 47.35/47.49 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 47.35/47.49 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 47.35/47.49 undef587, rest remain the same}> 47.35/47.49 undef344, rest remain the same}> 47.35/47.50 undef344, rest remain the same}> 47.35/47.50 undef477, rest remain the same}> 47.35/47.50 undef587, rest remain the same}> 47.35/47.50 undef344, rest remain the same}> 47.35/47.50 undef344, rest remain the same}> 47.35/47.50 undef477, rest remain the same}> 47.35/47.50 undef587, rest remain the same}> 47.35/47.50 undef344, rest remain the same}> 47.35/47.50 undef344, rest remain the same}> 47.35/47.50 undef477, rest remain the same}> 47.35/47.50 undef587, rest remain the same}> 47.35/47.50 undef344, rest remain the same}> 47.35/47.50 undef344, rest remain the same}> 47.35/47.50 undef477, rest remain the same}> 47.35/47.50 undef587, rest remain the same}> 47.35/47.50 undef344, rest remain the same}> 47.35/47.50 undef344, rest remain the same}> 47.35/47.50 undef477, rest remain the same}> 47.35/47.50 undef587, rest remain the same}> 47.35/47.50 undef344, rest remain the same}> 47.35/47.50 undef344, rest remain the same}> 47.35/47.50 undef477, rest remain the same}> 47.35/47.50 Variables: 47.35/47.50 __const_30^0, i^0, iter^0, k^0, l^0, m^0, n^0, r^0, tmp___2^0 47.35/47.50 Checking conditional termination of SCC {l9, l13, l15, l22}... 47.35/47.50 47.35/47.50 LOG: CALL solveLinear 47.35/47.50 47.35/47.50 LOG: RETURN solveLinear - Elapsed time: 0.042501s 47.35/47.50 Ranking function: 2 - 4*k^0 - 2*l^0 + 6*n^0 47.35/47.50 New Graphs: 47.35/47.50 Transitions: 47.35/47.50 47.35/47.50 47.35/47.50 47.35/47.50 47.35/47.50 47.35/47.50 47.35/47.50 47.35/47.50 47.35/47.50 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 47.35/47.50 1 + m^0, rest remain the same}> 47.35/47.50 1 + m^0, rest remain the same}> 47.35/47.50 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 47.35/47.50 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 47.35/47.50 undef587, rest remain the same}> 47.35/47.50 -1 + i^0, r^0 -> undef344, rest remain the same}> 47.35/47.50 -1 + i^0, r^0 -> undef344, rest remain the same}> 47.35/47.50 undef477, rest remain the same}> 47.35/47.50 undef587, rest remain the same}> 47.35/47.50 -1 + i^0, r^0 -> undef344, rest remain the same}> 47.35/47.50 -1 + i^0, r^0 -> undef344, rest remain the same}> 47.35/47.50 undef477, rest remain the same}> 47.35/47.50 undef587, rest remain the same}> 47.35/47.50 -1 + i^0, r^0 -> undef344, rest remain the same}> 47.35/47.50 -1 + i^0, r^0 -> undef344, rest remain the same}> 47.35/47.50 undef477, rest remain the same}> 47.35/47.50 undef587, rest remain the same}> 47.35/47.50 -1 + i^0, r^0 -> undef344, rest remain the same}> 47.35/47.50 -1 + i^0, r^0 -> undef344, rest remain the same}> 47.35/47.50 undef477, rest remain the same}> 47.35/47.50 undef587, rest remain the same}> 47.35/47.50 -1 + i^0, r^0 -> undef344, rest remain the same}> 47.35/47.50 -1 + i^0, r^0 -> undef344, rest remain the same}> 47.35/47.50 undef477, rest remain the same}> 47.35/47.50 undef587, rest remain the same}> 47.35/47.50 -1 + i^0, r^0 -> undef344, rest remain the same}> 47.35/47.50 -1 + i^0, r^0 -> undef344, rest remain the same}> 47.35/47.50 undef477, rest remain the same}> 47.35/47.50 Variables: 47.35/47.50 __const_30^0, i^0, iter^0, k^0, l^0, m^0, n^0, r^0, tmp___2^0 47.35/47.50 Checking conditional termination of SCC {l9, l15, l22}... 47.35/47.50 47.35/47.50 LOG: CALL solveLinear 47.35/47.50 47.35/47.50 LOG: RETURN solveLinear - Elapsed time: 0.040528s 47.35/47.50 Ranking function: -6 - 6*l^0 - 7*m^0 + 13*n^0 47.35/47.50 It's unfeasible after collapsing. Removing transition: 47.35/47.50 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 47.35/47.50 It's unfeasible after collapsing. Removing transition: 47.35/47.50 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 47.35/47.50 It's unfeasible after collapsing. Removing transition: 47.35/47.50 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 47.35/47.50 It's unfeasible after collapsing. Removing transition: 47.35/47.50 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 47.35/47.50 It's unfeasible after collapsing. Removing transition: 47.35/47.50 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 47.35/47.50 It's unfeasible after collapsing. Removing transition: 47.35/47.50 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 47.35/47.50 It's unfeasible after collapsing. Removing transition: 47.35/47.50 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 47.35/47.50 It's unfeasible after collapsing. Removing transition: 47.35/47.50 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 47.35/47.50 It's unfeasible after collapsing. Removing transition: 47.35/47.50 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 47.35/47.50 It's unfeasible after collapsing. Removing transition: 47.35/47.50 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 47.35/47.50 It's unfeasible after collapsing. Removing transition: 47.35/47.50 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 47.35/47.50 It's unfeasible after collapsing. Removing transition: 47.35/47.50 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 47.35/47.50 New Graphs: 47.35/47.50 Transitions: 47.35/47.50 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 47.35/47.50 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 47.35/47.50 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 47.35/47.50 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 47.35/47.50 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 47.35/47.50 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 47.35/47.50 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 47.35/47.50 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 47.35/47.50 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 47.35/47.50 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 47.35/47.50 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 47.35/47.50 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 47.35/47.50 undef587, rest remain the same}> 47.35/47.50 -1 + i^0, r^0 -> undef344, rest remain the same}> 47.35/47.50 -1 + i^0, r^0 -> undef344, rest remain the same}> 47.35/47.50 undef477, rest remain the same}> 47.35/47.50 undef587, rest remain the same}> 47.35/47.50 -1 + i^0, r^0 -> undef344, rest remain the same}> 47.35/47.50 -1 + i^0, r^0 -> undef344, rest remain the same}> 47.35/47.50 undef477, rest remain the same}> 47.35/47.50 undef587, rest remain the same}> 47.35/47.50 -1 + i^0, r^0 -> undef344, rest remain the same}> 47.35/47.50 -1 + i^0, r^0 -> undef344, rest remain the same}> 47.35/47.50 undef477, rest remain the same}> 47.35/47.50 undef587, rest remain the same}> 47.35/47.50 -1 + i^0, r^0 -> undef344, rest remain the same}> 47.35/47.50 -1 + i^0, r^0 -> undef344, rest remain the same}> 47.35/47.50 undef477, rest remain the same}> 47.35/47.50 undef587, rest remain the same}> 47.35/47.50 -1 + i^0, r^0 -> undef344, rest remain the same}> 47.35/47.50 -1 + i^0, r^0 -> undef344, rest remain the same}> 47.35/47.50 undef477, rest remain the same}> 47.35/47.50 undef587, rest remain the same}> 47.35/47.50 -1 + i^0, r^0 -> undef344, rest remain the same}> 47.35/47.50 -1 + i^0, r^0 -> undef344, rest remain the same}> 47.35/47.50 undef477, rest remain the same}> 47.35/47.50 Variables: 47.35/47.50 __const_30^0, i^0, iter^0, k^0, l^0, m^0, n^0, r^0, tmp___2^0 47.35/47.50 Checking conditional termination of SCC {l9, l22}... 47.35/47.50 47.35/47.50 LOG: CALL solveLinear 47.35/47.50 47.35/47.50 LOG: RETURN solveLinear - Elapsed time: 0.056927s 47.35/47.50 Ranking function: -4 + i^0 + 4*k^0 - 3*l^0 - 2*n^0 47.35/47.50 New Graphs: 47.35/47.50 Transitions: 47.35/47.50 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 47.35/47.50 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 47.35/47.50 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 47.35/47.50 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 47.35/47.50 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 47.35/47.50 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 47.35/47.50 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 47.35/47.50 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 47.35/47.50 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 47.35/47.50 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 47.35/47.50 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 47.35/47.50 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 47.35/47.50 undef587, rest remain the same}> 47.35/47.50 undef477, rest remain the same}> 47.35/47.50 undef587, rest remain the same}> 47.35/47.50 undef477, rest remain the same}> 47.35/47.50 undef587, rest remain the same}> 47.35/47.50 undef477, rest remain the same}> 47.35/47.50 undef587, rest remain the same}> 47.35/47.50 undef477, rest remain the same}> 47.35/47.50 undef587, rest remain the same}> 47.35/47.50 undef477, rest remain the same}> 47.35/47.50 undef587, rest remain the same}> 47.35/47.50 undef477, rest remain the same}> 47.35/47.50 Variables: 47.35/47.50 __const_30^0, i^0, iter^0, l^0, m^0, n^0, r^0, tmp___2^0 47.35/47.50 Checking conditional termination of SCC {l9, l22}... 47.35/47.50 47.35/47.50 LOG: CALL solveLinear 47.35/47.50 47.35/47.50 LOG: RETURN solveLinear - Elapsed time: 0.023585s 47.35/47.50 47.35/47.50 LOG: CALL solveLinear 47.35/47.50 47.35/47.50 LOG: RETURN solveLinear - Elapsed time: 0.324592s 47.35/47.50 Trying to remove transition: undef477, rest remain the same}> 47.35/47.50 Solving with 1 template(s). 47.35/47.50 47.35/47.50 LOG: CALL solveNonLinearGetFirstSolution 47.35/47.50 47.35/47.50 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.096240s 47.35/47.50 Time used: 0.092504 47.35/47.50 Trying to remove transition: undef587, rest remain the same}> 47.35/47.50 Solving with 1 template(s). 47.35/47.50 47.35/47.50 LOG: CALL solveNonLinearGetFirstSolution 47.35/47.50 47.35/47.50 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.101654s 47.35/47.50 Time used: 0.098112 47.35/47.50 Trying to remove transition: undef477, rest remain the same}> 47.35/47.50 Solving with 1 template(s). 47.35/47.50 47.35/47.50 LOG: CALL solveNonLinearGetFirstSolution 47.35/47.50 47.35/47.50 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.095603s 47.35/47.50 Time used: 0.091948 47.35/47.50 Trying to remove transition: undef587, rest remain the same}> 47.35/47.50 Solving with 1 template(s). 47.35/47.50 47.35/47.50 LOG: CALL solveNonLinearGetFirstSolution 47.35/47.50 47.35/47.50 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.099799s 47.35/47.50 Time used: 0.096376 47.35/47.50 Trying to remove transition: undef477, rest remain the same}> 47.35/47.50 Solving with 1 template(s). 47.35/47.50 47.35/47.50 LOG: CALL solveNonLinearGetFirstSolution 47.35/47.50 47.35/47.50 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.101338s 47.35/47.50 Time used: 0.097927 47.35/47.50 Trying to remove transition: undef587, rest remain the same}> 47.35/47.50 Solving with 1 template(s). 47.35/47.50 47.35/47.50 LOG: CALL solveNonLinearGetFirstSolution 47.35/47.50 47.35/47.50 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.130559s 47.35/47.50 Time used: 0.127145 47.35/47.50 Trying to remove transition: undef477, rest remain the same}> 47.35/47.50 Solving with 1 template(s). 47.35/47.50 47.35/47.50 LOG: CALL solveNonLinearGetFirstSolution 47.35/47.50 47.35/47.50 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.103021s 47.35/47.50 Time used: 0.099414 47.35/47.50 Trying to remove transition: undef587, rest remain the same}> 47.35/47.50 Solving with 1 template(s). 47.35/47.50 47.35/47.50 LOG: CALL solveNonLinearGetFirstSolution 47.35/47.50 47.35/47.50 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.117622s 47.35/47.50 Time used: 0.11423 47.35/47.50 Trying to remove transition: undef477, rest remain the same}> 47.35/47.50 Solving with 1 template(s). 47.35/47.50 47.35/47.50 LOG: CALL solveNonLinearGetFirstSolution 47.35/47.50 47.35/47.50 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.104423s 47.35/47.50 Time used: 0.100735 47.35/47.50 Trying to remove transition: undef587, rest remain the same}> 47.35/47.50 Solving with 1 template(s). 47.35/47.50 47.35/47.50 LOG: CALL solveNonLinearGetFirstSolution 47.35/47.50 47.35/47.50 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.112383s 47.35/47.50 Time used: 0.108969 47.35/47.50 Trying to remove transition: undef477, rest remain the same}> 47.35/47.50 Solving with 1 template(s). 47.35/47.50 47.35/47.50 LOG: CALL solveNonLinearGetFirstSolution 47.35/47.50 47.35/47.50 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.104369s 47.35/47.50 Time used: 0.100863 47.35/47.50 Trying to remove transition: undef587, rest remain the same}> 47.35/47.50 Solving with 1 template(s). 47.35/47.50 47.35/47.50 LOG: CALL solveNonLinearGetFirstSolution 47.35/47.50 47.35/47.50 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.114366s 47.35/47.50 Time used: 0.110932 47.35/47.50 Trying to remove transition: 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 47.35/47.50 Solving with 1 template(s). 47.35/47.50 47.35/47.50 LOG: CALL solveNonLinearGetFirstSolution 47.35/47.50 47.35/47.50 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.118938s 47.35/47.50 Time used: 0.11546 47.35/47.50 Trying to remove transition: 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 47.35/47.50 Solving with 1 template(s). 47.35/47.50 47.35/47.50 LOG: CALL solveNonLinearGetFirstSolution 47.35/47.50 47.35/47.50 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.224198s 47.35/47.50 Time used: 0.220113 47.35/47.50 Trying to remove transition: 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 47.35/47.50 Solving with 1 template(s). 47.35/47.50 47.35/47.50 LOG: CALL solveNonLinearGetFirstSolution 47.35/47.50 47.35/47.50 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.119114s 47.35/47.50 Time used: 0.114931 47.35/47.50 Trying to remove transition: 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 47.35/47.50 Solving with 1 template(s). 47.35/47.50 47.35/47.50 LOG: CALL solveNonLinearGetFirstSolution 47.35/47.50 47.35/47.50 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.216259s 47.35/47.50 Time used: 0.212489 47.35/47.50 Trying to remove transition: 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 47.35/47.50 Solving with 1 template(s). 47.35/47.50 47.35/47.50 LOG: CALL solveNonLinearGetFirstSolution 47.35/47.50 47.35/47.50 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.177409s 47.35/47.50 Time used: 0.173065 47.35/47.50 Trying to remove transition: 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 47.35/47.50 Solving with 1 template(s). 47.35/47.50 47.35/47.50 LOG: CALL solveNonLinearGetFirstSolution 47.35/47.50 47.35/47.50 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.193724s 47.35/47.50 Time used: 0.189394 47.35/47.50 Trying to remove transition: 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 47.35/47.50 Solving with 1 template(s). 47.35/47.50 47.35/47.50 LOG: CALL solveNonLinearGetFirstSolution 47.35/47.50 47.35/47.50 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.163835s 47.35/47.50 Time used: 0.159553 47.35/47.50 Trying to remove transition: 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 47.35/47.50 Solving with 1 template(s). 47.35/47.50 47.35/47.50 LOG: CALL solveNonLinearGetFirstSolution 47.35/47.50 47.35/47.50 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.183825s 47.35/47.50 Time used: 0.179768 47.35/47.50 Trying to remove transition: 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 47.35/47.50 Solving with 1 template(s). 47.35/47.50 47.35/47.50 LOG: CALL solveNonLinearGetFirstSolution 47.35/47.50 47.35/47.50 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.134101s 47.35/47.50 Time used: 0.130051 47.35/47.50 Trying to remove transition: 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 47.35/47.50 Solving with 1 template(s). 47.35/47.50 47.35/47.50 LOG: CALL solveNonLinearGetFirstSolution 47.35/47.50 47.35/47.50 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.141172s 47.35/47.50 Time used: 0.137259 47.35/47.50 Trying to remove transition: 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 47.35/47.50 Solving with 1 template(s). 47.35/47.50 47.35/47.50 LOG: CALL solveNonLinearGetFirstSolution 47.35/47.50 47.35/47.50 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.185239s 47.35/47.50 Time used: 0.181427 47.35/47.50 Trying to remove transition: 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 47.35/47.50 Solving with 1 template(s). 47.35/47.50 47.35/47.50 LOG: CALL solveNonLinearGetFirstSolution 47.35/47.50 47.35/47.50 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.211030s 47.35/47.50 Time used: 0.207093 47.35/47.50 Solving with 1 template(s). 47.35/47.50 47.35/47.50 LOG: CALL solveNonLinearGetFirstSolution 47.35/47.50 47.35/47.50 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.004429s 47.35/47.50 Time used: 4.00009 47.35/47.50 Solving with 2 template(s). 47.35/47.50 47.35/47.50 LOG: CALL solveNonLinearGetFirstSolution 47.35/47.50 47.35/47.50 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.024701s 47.35/47.50 Time used: 4.00247 47.35/47.50 Solving with 3 template(s). 47.35/47.50 47.35/47.50 LOG: CALL solveNonLinearGetFirstSolution 47.35/47.50 47.35/47.50 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 2.166310s 47.35/47.50 Time used: 2.11024 47.35/47.50 Solving with 1 template(s). 47.35/47.50 47.35/47.50 LOG: CALL solveNonLinearGetFirstSolution 47.35/47.50 47.35/47.50 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.108431s 47.35/47.50 Time used: 4.00001 47.35/47.50 Termination failed. Trying to show unreachability... 47.35/47.50 Proving unreachability of entry: 0, rest remain the same}> 47.35/47.50 47.35/47.50 LOG: CALL check - Post:1 <= 0 - Process 1 47.35/47.50 * Exit transition: 0, rest remain the same}> 47.35/47.50 * Postcondition : 1 <= 0 47.35/47.50 Postcodition moved up: 1 <= 0 47.35/47.50 47.35/47.50 LOG: Try proving POST 47.35/47.50 Postcondition: 1 <= 0 47.35/47.50 47.35/47.50 LOG: CALL check - Post:1 <= 0 - Process 2 47.35/47.50 * Exit transition: 47.35/47.50 * Postcondition : 1 <= 0 47.35/47.50 47.35/47.50 LOG: CALL solveLinear 47.35/47.50 47.35/47.50 LOG: RETURN solveLinear - Elapsed time: 0.012002s 47.35/47.50 > Postcondition is not implied! 47.35/47.50 47.35/47.50 LOG: RETURN check - Elapsed time: 0.012112s 47.35/47.50 47.35/47.50 LOG: NarrowEntry size 1 47.35/47.50 Narrowing transition: 47.35/47.50 1 + i^0, rest remain the same}> 47.35/47.50 47.35/47.50 LOG: Narrow transition size 1 47.35/47.50 ENTRIES: 47.35/47.50 47.35/47.50 END ENTRIES: 47.35/47.50 GRAPH: 47.35/47.50 1 + i^0, rest remain the same}> 47.35/47.50 END GRAPH: 47.35/47.50 EXIT: 0, rest remain the same}> 47.35/47.50 POST: 1 <= 0 47.35/47.50 47.35/47.50 47.35/47.50 LOG: Try proving POST 47.35/47.50 Solving with 1 template(s). 47.35/47.50 47.35/47.50 LOG: CALL solveNonLinearGetFirstSolution 47.35/47.50 47.35/47.50 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.044217s 47.35/47.50 Time used: 0.043927 47.35/47.50 Improving Solution with cost 51 ... 47.35/47.50 47.35/47.50 LOG: CALL solveNonLinearGetNextSolution 47.35/47.50 47.35/47.50 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.008800s 47.35/47.50 Time used: 1.00867 47.35/47.50 47.35/47.50 LOG: SAT solveNonLinear - Elapsed time: 1.053017s 47.35/47.50 Cost: 51; Total time: 1.05259 47.35/47.50 Failed at location 6: 1 + n^0 <= i^0 47.35/47.50 Before Improving: 47.35/47.50 Quasi-invariant at l6: 1 + n^0 <= i^0 47.35/47.50 Optimizing invariants... 47.35/47.50 47.35/47.50 LOG: CALL solveLinear 47.35/47.50 47.35/47.50 LOG: RETURN solveLinear - Elapsed time: 0.004353s 47.35/47.50 Remaining time after improvement: 0.997756 47.35/47.50 Some transition disabled by a set of quasi-invariant(s): 47.35/47.50 Quasi-invariant at l6: 1 + n^0 <= i^0 47.35/47.50 47.35/47.50 LOG: NEXT CALL check - disable 47.35/47.50 47.35/47.50 LOG: CALL check - Post:1 + n^0 <= i^0 - Process 3 47.35/47.50 * Exit transition: 47.35/47.50 * Postcondition : 1 + n^0 <= i^0 47.35/47.50 47.35/47.50 LOG: CALL solveLinear 47.35/47.50 47.35/47.50 LOG: RETURN solveLinear - Elapsed time: 0.011620s 47.35/47.50 > Postcondition is not implied! 47.35/47.50 47.35/47.50 LOG: RETURN check - Elapsed time: 0.011755s 47.35/47.50 Solving with 2 template(s). 47.35/47.50 47.35/47.50 LOG: CALL solveNonLinearGetFirstSolution 47.35/47.50 47.35/47.50 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.216094s 47.35/47.50 Time used: 0.215752 47.35/47.50 Improving Solution with cost 51 ... 47.35/47.50 47.35/47.50 LOG: CALL solveNonLinearGetNextSolution 47.35/47.50 47.35/47.50 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.008840s 47.35/47.50 Time used: 1.00873 47.35/47.50 47.35/47.50 LOG: SAT solveNonLinear - Elapsed time: 1.224934s 47.35/47.50 Cost: 51; Total time: 1.22449 47.35/47.50 Failed at location 6: 1 + n^0 <= i^0 47.35/47.50 Before Improving: 47.35/47.50 Quasi-invariant at l6: 1 + n^0 <= i^0 47.35/47.50 Optimizing invariants... 47.35/47.50 47.35/47.50 LOG: CALL solveLinear 47.35/47.50 47.35/47.50 LOG: RETURN solveLinear - Elapsed time: 0.006636s 47.35/47.50 Remaining time after improvement: 0.997048 47.35/47.50 Some transition disabled by a set of quasi-invariant(s): 47.35/47.50 Quasi-invariant at l6: 1 + n^0 <= i^0 47.35/47.50 47.35/47.50 LOG: NEXT CALL check - disable 47.35/47.50 47.35/47.50 LOG: CALL check - Post:1 + n^0 <= i^0 - Process 4 47.35/47.50 * Exit transition: 47.35/47.50 * Postcondition : 1 + n^0 <= i^0 47.35/47.50 47.35/47.50 LOG: CALL solveLinear 47.35/47.50 47.35/47.50 LOG: RETURN solveLinear - Elapsed time: 0.011696s 47.35/47.50 > Postcondition is not implied! 47.35/47.50 47.35/47.50 LOG: RETURN check - Elapsed time: 0.011822s 47.35/47.50 Solving with 3 template(s). 47.35/47.50 47.35/47.50 LOG: CALL solveNonLinearGetFirstSolution 47.35/47.50 47.35/47.50 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.000309s 47.35/47.50 Time used: 1.00004 47.35/47.50 47.35/47.50 LOG: Postcondition is not implied - no solution 47.35/47.50 > Postcondition is not implied! 47.35/47.50 47.35/47.50 LOG: RETURN check - Elapsed time: 3.479591s 47.35/47.50 Cannot prove unreachability 47.35/47.50 47.35/47.50 Proving non-termination of subgraph 2 47.35/47.50 Transitions: 47.35/47.50 0, l^0 -> 1 + l^0, rest remain the same}> 47.35/47.50 47.35/47.50 47.35/47.50 0, l^0 -> 1 + l^0, rest remain the same}> 47.35/47.50 47.35/47.50 47.35/47.50 0, l^0 -> 1 + l^0, rest remain the same}> 47.35/47.50 47.35/47.50 47.35/47.50 0, l^0 -> 1 + l^0, rest remain the same}> 47.35/47.50 47.35/47.50 47.35/47.50 -1 + i^0, rest remain the same}> 47.35/47.50 -1 + i^0, r^0 -> undef344, rest remain the same}> 47.35/47.50 -1 + i^0, r^0 -> undef344, rest remain the same}> 47.35/47.50 -1 + i^0, r^0 -> undef477, rest remain the same}> 47.35/47.50 1 + k^0, rest remain the same}> 47.35/47.50 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 47.35/47.50 1 + m^0, rest remain the same}> 47.35/47.50 1 + m^0, rest remain the same}> 47.35/47.50 0, l^0 -> 1 + l^0, rest remain the same}> 47.35/47.50 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 47.35/47.50 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 47.35/47.50 undef587, rest remain the same}> 47.35/47.50 undef344, rest remain the same}> 47.35/47.50 undef344, rest remain the same}> 47.35/47.50 undef477, rest remain the same}> 47.35/47.50 undef587, rest remain the same}> 47.35/47.50 undef344, rest remain the same}> 47.35/47.50 undef344, rest remain the same}> 47.35/47.50 undef477, rest remain the same}> 47.35/47.50 undef587, rest remain the same}> 47.35/47.50 undef344, rest remain the same}> 47.35/47.50 undef344, rest remain the same}> 47.35/47.50 undef477, rest remain the same}> 47.35/47.50 undef587, rest remain the same}> 47.35/47.50 undef344, rest remain the same}> 47.35/47.50 undef344, rest remain the same}> 47.35/47.50 undef477, rest remain the same}> 47.35/47.50 undef587, rest remain the same}> 47.35/47.50 undef344, rest remain the same}> 47.35/47.50 undef344, rest remain the same}> 47.35/47.50 undef477, rest remain the same}> 47.35/47.50 undef587, rest remain the same}> 47.35/47.50 undef344, rest remain the same}> 47.35/47.50 undef344, rest remain the same}> 47.35/47.50 undef477, rest remain the same}> 47.35/47.50 Variables: 47.35/47.50 l^0, m^0, n^0, r^0, i^0, k^0, iter^0, tmp___2^0, __const_30^0 47.35/47.50 47.35/47.50 Checking conditional non-termination of SCC {l9, l13, l15, l22}... 47.35/47.50 EXIT TRANSITIONS: 47.35/47.50 47.35/47.50 47.35/47.50 47.35/47.50 47.35/47.50 Solving with 1 template(s). 47.35/47.50 47.35/47.50 LOG: CALL solveNonLinearGetFirstSolution 47.35/47.50 47.35/47.50 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 5.000728s 47.35/47.50 Time used: 5.00004 47.35/47.50 Solving with 2 template(s). 47.35/47.50 47.35/47.50 LOG: CALL solveNonLinearGetFirstSolution 47.35/47.50 47.35/47.50 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 5.038209s 47.35/47.50 Time used: 5.00077 47.35/47.50 Solving with 3 template(s). 47.35/47.50 47.35/47.50 LOG: CALL solveNonLinearGetFirstSolution 47.35/47.50 47.35/47.50 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 5.065047s 47.35/47.50 Time used: 5.00167 47.35/47.50 > Checking if the negation of the conditions of every pending exit is quasi-invariant... NO 47.35/47.50 47.35/47.50 Proving non-termination of subgraph 2 47.35/47.50 Transitions: 47.35/47.50 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 47.35/47.50 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 47.35/47.50 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 47.35/47.50 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 47.35/47.50 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 47.35/47.50 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 47.35/47.50 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 47.35/47.50 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 47.35/47.50 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 47.35/47.50 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 47.35/47.50 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 47.35/47.50 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 47.35/47.50 undef587, rest remain the same}> 47.35/47.50 undef477, rest remain the same}> 47.35/47.50 undef587, rest remain the same}> 47.35/47.50 undef477, rest remain the same}> 47.35/47.50 undef587, rest remain the same}> 47.35/47.50 undef477, rest remain the same}> 47.35/47.50 undef587, rest remain the same}> 47.35/47.50 undef477, rest remain the same}> 47.35/47.50 undef587, rest remain the same}> 47.35/47.50 undef477, rest remain the same}> 47.35/47.50 undef587, rest remain the same}> 47.35/47.50 undef477, rest remain the same}> 47.35/47.50 Variables: 47.35/47.50 __const_30^0, i^0, iter^0, l^0, m^0, n^0, r^0, tmp___2^0 47.35/47.50 47.35/47.50 Checking conditional non-termination of SCC {l9, l22}... 47.35/47.50 EXIT TRANSITIONS: 47.35/47.50 47.35/47.50 47.35/47.50 47.35/47.50 47.35/47.50 47.35/47.50 Solving with 1 template(s). 47.35/47.50 47.35/47.50 LOG: CALL solveNonLinearGetFirstSolution 47.35/47.50 47.35/47.50 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.264196s 47.35/47.50 Time used: 4.26359 47.35/47.50 47.35/47.50 LOG: SAT solveNonLinear - Elapsed time: 4.264196s 47.35/47.50 Cost: 0; Total time: 4.26359 47.35/47.50 Minimizing number of undef constraints... 47.35/47.50 47.35/47.50 LOG: CALL solveNonLinear 47.35/47.50 47.35/47.50 LOG: RETURN solveNonLinear - Elapsed time: 0.188172s 47.35/47.50 Number of undef constraints reduced! 47.35/47.50 47.35/47.50 Non-termination implied by a set of quasi-invariant(s): 47.35/47.50 Quasi-invariant at l9: 1 + l^0 <= m^0 47.35/47.50 Quasi-invariant at l22: 1 + l^0 <= m^0 47.35/47.50 47.35/47.50 Strengthening and disabling EXIT transitions... 47.35/47.50 Closed exits from l9: 4 47.35/47.50 47.35/47.50 Strengthening and disabling transitions... 47.35/47.50 47.35/47.50 LOG: CALL solverLinear in Graph for feasibility 47.35/47.50 47.35/47.50 LOG: RETURN solveLinear in Graph for feasibility 47.35/47.50 Strengthening transition (result): 47.35/47.50 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 47.35/47.50 47.35/47.50 LOG: CALL solverLinear in Graph for feasibility 47.35/47.50 47.35/47.50 LOG: RETURN solveLinear in Graph for feasibility 47.35/47.50 Strengthening transition (result): 47.35/47.50 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 47.35/47.50 47.35/47.50 LOG: CALL solverLinear in Graph for feasibility 47.35/47.50 47.35/47.50 LOG: RETURN solveLinear in Graph for feasibility 47.35/47.50 It's unfeasible. Removing transition: 47.35/47.50 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 47.35/47.50 47.35/47.50 LOG: CALL solverLinear in Graph for feasibility 47.35/47.50 47.35/47.50 LOG: RETURN solveLinear in Graph for feasibility 47.35/47.50 Strengthening transition (result): 47.35/47.50 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 47.35/47.50 47.35/47.50 LOG: CALL solverLinear in Graph for feasibility 47.35/47.50 47.35/47.50 LOG: RETURN solveLinear in Graph for feasibility 47.35/47.50 Strengthening transition (result): 47.35/47.50 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 47.35/47.50 47.35/47.50 LOG: CALL solverLinear in Graph for feasibility 47.35/47.50 47.35/47.50 LOG: RETURN solveLinear in Graph for feasibility 47.35/47.50 It's unfeasible. Removing transition: 47.35/47.50 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 47.35/47.50 47.35/47.50 LOG: CALL solverLinear in Graph for feasibility 47.35/47.50 47.35/47.50 LOG: RETURN solveLinear in Graph for feasibility 47.35/47.50 Strengthening transition (result): 47.35/47.50 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 47.35/47.50 47.35/47.50 LOG: CALL solverLinear in Graph for feasibility 47.35/47.50 47.35/47.50 LOG: RETURN solveLinear in Graph for feasibility 47.35/47.50 Strengthening transition (result): 47.35/47.50 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 47.35/47.50 47.35/47.50 LOG: CALL solverLinear in Graph for feasibility 47.35/47.50 47.35/47.50 LOG: RETURN solveLinear in Graph for feasibility 47.35/47.50 It's unfeasible. Removing transition: 47.35/47.50 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 47.35/47.50 47.35/47.50 LOG: CALL solverLinear in Graph for feasibility 47.35/47.50 47.35/47.50 LOG: RETURN solveLinear in Graph for feasibility 47.35/47.50 Strengthening transition (result): 47.35/47.50 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 47.35/47.50 47.35/47.50 LOG: CALL solverLinear in Graph for feasibility 47.35/47.50 47.35/47.50 LOG: RETURN solveLinear in Graph for feasibility 47.35/47.50 Strengthening transition (result): 47.35/47.50 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 47.35/47.50 47.35/47.50 LOG: CALL solverLinear in Graph for feasibility 47.35/47.50 47.35/47.50 LOG: RETURN solveLinear in Graph for feasibility 47.35/47.50 It's unfeasible. Removing transition: 47.35/47.50 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 47.35/47.50 47.35/47.50 LOG: CALL solverLinear in Graph for feasibility 47.35/47.50 47.35/47.50 LOG: RETURN solveLinear in Graph for feasibility 47.35/47.50 Strengthening transition (result): 47.35/47.50 undef587, rest remain the same}> 47.35/47.50 47.35/47.50 LOG: CALL solverLinear in Graph for feasibility 47.35/47.50 47.35/47.50 LOG: RETURN solveLinear in Graph for feasibility 47.35/47.50 Strengthening transition (result): 47.35/47.50 undef477, rest remain the same}> 47.35/47.50 47.35/47.50 LOG: CALL solverLinear in Graph for feasibility 47.35/47.50 47.35/47.50 LOG: RETURN solveLinear in Graph for feasibility 47.35/47.50 Strengthening transition (result): 47.35/47.50 undef587, rest remain the same}> 47.35/47.50 47.35/47.50 LOG: CALL solverLinear in Graph for feasibility 47.35/47.50 47.35/47.50 LOG: RETURN solveLinear in Graph for feasibility 47.35/47.50 Strengthening transition (result): 47.35/47.50 undef477, rest remain the same}> 47.35/47.50 47.35/47.50 LOG: CALL solverLinear in Graph for feasibility 47.35/47.50 47.35/47.50 LOG: RETURN solveLinear in Graph for feasibility 47.35/47.50 Strengthening transition (result): 47.35/47.50 undef587, rest remain the same}> 47.35/47.50 47.35/47.50 LOG: CALL solverLinear in Graph for feasibility 47.35/47.50 47.35/47.50 LOG: RETURN solveLinear in Graph for feasibility 47.35/47.50 Strengthening transition (result): 47.35/47.50 undef477, rest remain the same}> 47.35/47.50 47.35/47.50 LOG: CALL solverLinear in Graph for feasibility 47.35/47.50 47.35/47.50 LOG: RETURN solveLinear in Graph for feasibility 47.35/47.50 Strengthening transition (result): 47.35/47.50 undef587, rest remain the same}> 47.35/47.50 47.35/47.50 LOG: CALL solverLinear in Graph for feasibility 47.35/47.50 47.35/47.50 LOG: RETURN solveLinear in Graph for feasibility 47.35/47.50 Strengthening transition (result): 47.35/47.50 undef477, rest remain the same}> 47.35/47.50 47.35/47.50 LOG: CALL solverLinear in Graph for feasibility 47.35/47.50 47.35/47.50 LOG: RETURN solveLinear in Graph for feasibility 47.35/47.50 Strengthening transition (result): 47.35/47.50 undef587, rest remain the same}> 47.35/47.50 47.35/47.50 LOG: CALL solverLinear in Graph for feasibility 47.35/47.50 47.35/47.50 LOG: RETURN solveLinear in Graph for feasibility 47.35/47.50 Strengthening transition (result): 47.35/47.50 undef477, rest remain the same}> 47.35/47.50 47.35/47.50 LOG: CALL solverLinear in Graph for feasibility 47.35/47.50 47.35/47.50 LOG: RETURN solveLinear in Graph for feasibility 47.35/47.50 Strengthening transition (result): 47.35/47.50 undef587, rest remain the same}> 47.35/47.50 47.35/47.50 LOG: CALL solverLinear in Graph for feasibility 47.35/47.50 47.35/47.50 LOG: RETURN solveLinear in Graph for feasibility 47.35/47.50 Strengthening transition (result): 47.35/47.50 undef477, rest remain the same}> 47.35/47.50 47.35/47.50 Calling reachability with... 47.35/47.50 Transition: 47.35/47.50 Conditions: 47.35/47.50 OPEN EXITS: 47.35/47.50 47.35/47.50 47.35/47.50 --- Reachability graph --- 47.35/47.50 > Graph without transitions. 47.35/47.50 47.35/47.50 Calling reachability with... 47.35/47.50 Transition: 0, rest remain the same}> 47.35/47.50 Conditions: 47.35/47.50 OPEN EXITS: 47.35/47.50 0, rest remain the same}> (condsUp: l^0 <= n^0) 47.35/47.50 47.35/47.50 --- Reachability graph --- 47.35/47.50 > Graph without transitions. 47.35/47.50 47.35/47.50 Calling reachability with... 47.35/47.50 Transition: 47.35/47.50 Conditions: 1 + n^0 <= i^0, l^0 <= n^0, 47.35/47.50 OPEN EXITS: 47.35/47.50 47.35/47.50 47.35/47.50 > Conditions are reachable! 47.35/47.50 47.35/47.50 Program does NOT terminate 47.35/47.50 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found 47.35/47.50 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found 47.35/47.50 EOF