45.46/45.50 NO 45.46/45.50 45.46/45.50 Solver Timeout: 4 45.46/45.50 Global Timeout: 300 45.46/45.50 No parsing errors! 45.46/45.50 Init Location: 0 45.46/45.50 Transitions: 45.46/45.50 45.46/45.50 (1 + l^0)}> 45.46/45.50 45.46/45.50 45.46/45.50 45.46/45.50 45.46/45.50 (1 + i^0)}> 45.46/45.50 45.46/45.50 45.46/45.50 45.46/45.50 45.46/45.50 45.46/45.50 45.46/45.50 45.46/45.50 (~(1) + i^0)}> 45.46/45.50 undef298, k^0 -> (1 + k^0)}> 45.46/45.50 undef317, g^0 -> undef320, p^0 -> undef327, r^0 -> undef328, s^0 -> undef329}> 45.46/45.50 45.46/45.50 45.46/45.50 45.46/45.50 45.46/45.50 45.46/45.50 undef443, f^0 -> undef446, r^0 -> undef455}> 45.46/45.50 45.46/45.50 undef486, g^0 -> undef489, p^0 -> 0, s^0 -> (0 + undef486)}> 45.46/45.50 undef525, tmp___5^0 -> (0 + (~(1) * undef525))}> 45.46/45.50 undef545, tmp___5^0 -> (0 + undef545)}> 45.46/45.50 undef552, r^0 -> undef560}> 45.46/45.50 45.46/45.50 45.46/45.50 45.46/45.50 45.46/45.50 (1 + iter^0), tmp___2^0 -> (0 + iter^0)}> 45.46/45.50 45.46/45.50 45.46/45.50 45.46/45.50 45.46/45.50 (1 + m^0)}> 45.46/45.50 45.46/45.50 45.46/45.50 45.46/45.50 45.46/45.50 45.46/45.50 ((0 + undef898) + undef899), tmp^0 -> undef898, tmp___0^0 -> undef899, tmp___1^0 -> undef900}> 45.46/45.50 45.46/45.50 0}> 45.46/45.50 45.46/45.50 45.46/45.50 45.46/45.50 Fresh variables: 45.46/45.50 undef298, undef317, undef320, undef327, undef328, undef329, undef337, undef443, undef446, undef455, undef486, undef489, undef525, undef545, undef552, undef560, undef898, undef899, undef900, 45.46/45.50 45.46/45.50 Undef variables: 45.46/45.50 undef298, undef317, undef320, undef327, undef328, undef329, undef337, undef443, undef446, undef455, undef486, undef489, undef525, undef545, undef552, undef560, undef898, undef899, undef900, 45.46/45.50 45.46/45.50 Abstraction variables: 45.46/45.50 45.46/45.50 Exit nodes: 45.46/45.50 45.46/45.50 Accepting locations: 45.46/45.50 45.46/45.50 Asserts: 45.46/45.50 45.46/45.50 Preprocessed LLVMGraph 45.46/45.50 Init Location: 0 45.46/45.50 Transitions: 45.46/45.50 45.46/45.50 45.46/45.50 0}> 45.46/45.50 (1 + i^0)}> 45.46/45.50 (1 + l^0)}> 45.46/45.50 0, l^0 -> (1 + l^0)}> 45.46/45.50 45.46/45.50 45.46/45.50 (1 + l^0)}> 45.46/45.50 0, l^0 -> (1 + l^0)}> 45.46/45.50 45.46/45.50 45.46/45.50 (1 + l^0)}> 45.46/45.50 0, l^0 -> (1 + l^0)}> 45.46/45.50 45.46/45.50 45.46/45.50 (1 + l^0)}> 45.46/45.50 0, l^0 -> (1 + l^0)}> 45.46/45.50 45.46/45.50 45.46/45.50 (~(1) + i^0)}> 45.46/45.50 (~(1) + i^0), r^0 -> undef328}> 45.46/45.50 (~(1) + i^0), r^0 -> undef328}> 45.46/45.50 (~(1) + i^0), r^0 -> undef455}> 45.46/45.50 (1 + k^0)}> 45.46/45.50 (1 + l^0)}> 45.46/45.50 (1 + iter^0), tmp___2^0 -> (0 + iter^0)}> 45.46/45.50 (1 + iter^0), tmp___2^0 -> (0 + iter^0)}> 45.46/45.50 (1 + m^0)}> 45.46/45.50 (1 + m^0)}> 45.46/45.50 0, l^0 -> (1 + l^0)}> 45.46/45.50 (1 + iter^0), tmp___2^0 -> (0 + iter^0)}> 45.46/45.50 (1 + iter^0), tmp___2^0 -> (0 + iter^0)}> 45.46/45.50 undef560}> 45.46/45.50 undef328}> 45.46/45.50 undef328}> 45.46/45.50 undef455}> 45.46/45.50 undef560}> 45.46/45.50 undef328}> 45.46/45.50 undef328}> 45.46/45.50 undef455}> 45.46/45.50 undef560}> 45.46/45.50 undef328}> 45.46/45.50 undef328}> 45.46/45.50 undef455}> 45.46/45.50 undef560}> 45.46/45.50 undef328}> 45.46/45.50 undef328}> 45.46/45.50 undef455}> 45.46/45.50 undef560}> 45.46/45.50 undef328}> 45.46/45.50 undef328}> 45.46/45.50 undef455}> 45.46/45.50 undef560}> 45.46/45.50 undef328}> 45.46/45.50 undef328}> 45.46/45.50 undef455}> 45.46/45.50 45.46/45.50 Fresh variables: 45.46/45.50 undef298, undef317, undef320, undef327, undef328, undef329, undef337, undef443, undef446, undef455, undef486, undef489, undef525, undef545, undef552, undef560, undef898, undef899, undef900, 45.46/45.50 45.46/45.50 Undef variables: 45.46/45.50 undef298, undef317, undef320, undef327, undef328, undef329, undef337, undef443, undef446, undef455, undef486, undef489, undef525, undef545, undef552, undef560, undef898, undef899, undef900, 45.46/45.50 45.46/45.50 Abstraction variables: 45.46/45.50 45.46/45.50 Exit nodes: 45.46/45.50 45.46/45.50 Accepting locations: 45.46/45.50 45.46/45.50 Asserts: 45.46/45.50 45.46/45.50 ************************************************************* 45.46/45.50 ******************************************************************************************* 45.46/45.50 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 45.46/45.50 ******************************************************************************************* 45.46/45.50 45.46/45.50 Init Location: 0 45.46/45.50 Graph 0: 45.46/45.50 Transitions: 45.46/45.50 Variables: 45.46/45.50 45.46/45.50 Graph 1: 45.46/45.50 Transitions: 45.46/45.50 1 + i^0, rest remain the same}> 45.46/45.50 Variables: 45.46/45.50 i^0, n^0 45.46/45.50 45.46/45.50 Graph 2: 45.46/45.50 Transitions: 45.46/45.50 0, l^0 -> 1 + l^0, rest remain the same}> 45.46/45.50 45.46/45.50 45.46/45.50 0, l^0 -> 1 + l^0, rest remain the same}> 45.46/45.50 45.46/45.50 45.46/45.50 0, l^0 -> 1 + l^0, rest remain the same}> 45.46/45.50 45.46/45.50 45.46/45.50 0, l^0 -> 1 + l^0, rest remain the same}> 45.46/45.50 45.46/45.50 45.46/45.50 -1 + i^0, rest remain the same}> 45.46/45.50 -1 + i^0, r^0 -> undef328, rest remain the same}> 45.46/45.50 -1 + i^0, r^0 -> undef328, rest remain the same}> 45.46/45.50 -1 + i^0, r^0 -> undef455, rest remain the same}> 45.46/45.50 1 + k^0, rest remain the same}> 45.46/45.50 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 45.46/45.50 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 45.46/45.50 1 + m^0, rest remain the same}> 45.46/45.50 1 + m^0, rest remain the same}> 45.46/45.50 0, l^0 -> 1 + l^0, rest remain the same}> 45.46/45.50 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 45.46/45.50 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 45.46/45.50 undef560, rest remain the same}> 45.46/45.50 undef328, rest remain the same}> 45.46/45.50 undef328, rest remain the same}> 45.46/45.50 undef455, rest remain the same}> 45.46/45.50 undef560, rest remain the same}> 45.46/45.50 undef328, rest remain the same}> 45.46/45.50 undef328, rest remain the same}> 45.46/45.50 undef455, rest remain the same}> 45.46/45.50 undef560, rest remain the same}> 45.46/45.50 undef328, rest remain the same}> 45.46/45.50 undef328, rest remain the same}> 45.46/45.50 undef455, rest remain the same}> 45.46/45.50 undef560, rest remain the same}> 45.46/45.50 undef328, rest remain the same}> 45.46/45.50 undef328, rest remain the same}> 45.46/45.50 undef455, rest remain the same}> 45.46/45.50 undef560, rest remain the same}> 45.46/45.50 undef328, rest remain the same}> 45.46/45.50 undef328, rest remain the same}> 45.46/45.50 undef455, rest remain the same}> 45.46/45.50 undef560, rest remain the same}> 45.46/45.50 undef328, rest remain the same}> 45.46/45.50 undef328, rest remain the same}> 45.46/45.50 undef455, rest remain the same}> 45.46/45.50 Variables: 45.46/45.50 l^0, m^0, n^0, r^0, i^0, k^0, iter^0, tmp___2^0 45.46/45.50 45.46/45.50 Graph 3: 45.46/45.50 Transitions: 45.46/45.50 Variables: 45.46/45.50 45.46/45.50 Precedence: 45.46/45.50 Graph 0 45.46/45.50 45.46/45.50 Graph 1 45.46/45.50 45.46/45.50 45.46/45.50 Graph 2 45.46/45.50 0, rest remain the same}> 45.46/45.50 45.46/45.50 Graph 3 45.46/45.50 45.46/45.50 1 + l^0, rest remain the same}> 45.46/45.50 1 + l^0, rest remain the same}> 45.46/45.50 1 + l^0, rest remain the same}> 45.46/45.50 1 + l^0, rest remain the same}> 45.46/45.50 1 + l^0, rest remain the same}> 45.46/45.50 45.46/45.50 Map Locations to Subgraph: 45.46/45.50 ( 0 , 0 ) 45.46/45.50 ( 6 , 1 ) 45.46/45.51 ( 9 , 2 ) 45.46/45.51 ( 13 , 2 ) 45.46/45.51 ( 15 , 2 ) 45.46/45.51 ( 22 , 2 ) 45.46/45.51 ( 28 , 3 ) 45.46/45.51 45.46/45.51 ******************************************************************************************* 45.46/45.51 ******************************** CHECKING ASSERTIONS ******************************** 45.46/45.51 ******************************************************************************************* 45.46/45.51 45.46/45.51 Proving termination of subgraph 0 45.46/45.51 Proving termination of subgraph 1 45.46/45.51 Checking unfeasibility... 45.46/45.51 Time used: 0.001873 45.46/45.51 45.46/45.51 Checking conditional termination of SCC {l6}... 45.46/45.51 45.46/45.51 LOG: CALL solveLinear 45.46/45.51 45.46/45.51 LOG: RETURN solveLinear - Elapsed time: 0.001374s 45.46/45.51 Ranking function: -i^0 + n^0 45.46/45.51 New Graphs: 45.46/45.51 Proving termination of subgraph 2 45.46/45.51 Checking unfeasibility... 45.46/45.51 Time used: 1.43142 45.46/45.51 Some transition disabled by a set of invariant(s): 45.46/45.51 Invariant at l9: l^0 <= n^0 45.46/45.51 Invariant at l13: l^0 <= n^0 45.46/45.51 Invariant at l15: l^0 <= n^0 45.46/45.51 Invariant at l22: l^0 <= n^0 45.46/45.51 45.46/45.51 Strengthening and disabling transitions... 45.46/45.51 > It's unfeasible. Removing transition: 45.46/45.51 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 45.46/45.51 45.46/45.51 LOG: CALL solverLinear in Graph for feasibility 45.46/45.51 45.46/45.51 LOG: RETURN solveLinear in Graph for feasibility 45.46/45.51 Strengthening transition (result): 45.46/45.51 0, l^0 -> 1 + l^0, rest remain the same}> 45.46/45.51 45.46/45.51 LOG: CALL solverLinear in Graph for feasibility 45.46/45.51 45.46/45.51 LOG: RETURN solveLinear in Graph for feasibility 45.46/45.51 Strengthening transition (result): 45.46/45.51 45.46/45.51 45.46/45.51 LOG: CALL solverLinear in Graph for feasibility 45.46/45.51 45.46/45.51 LOG: RETURN solveLinear in Graph for feasibility 45.46/45.51 Strengthening transition (result): 45.46/45.51 45.46/45.51 45.46/45.51 LOG: CALL solverLinear in Graph for feasibility 45.46/45.51 45.46/45.51 LOG: RETURN solveLinear in Graph for feasibility 45.46/45.51 Strengthening transition (result): 45.46/45.51 0, l^0 -> 1 + l^0, rest remain the same}> 45.46/45.51 45.46/45.51 LOG: CALL solverLinear in Graph for feasibility 45.46/45.51 45.46/45.51 LOG: RETURN solveLinear in Graph for feasibility 45.46/45.51 Strengthening transition (result): 45.46/45.51 45.46/45.51 45.46/45.51 LOG: CALL solverLinear in Graph for feasibility 45.46/45.51 45.46/45.51 LOG: RETURN solveLinear in Graph for feasibility 45.46/45.51 Strengthening transition (result): 45.46/45.51 45.46/45.51 45.46/45.51 LOG: CALL solverLinear in Graph for feasibility 45.46/45.51 45.46/45.51 LOG: RETURN solveLinear in Graph for feasibility 45.46/45.51 Strengthening transition (result): 45.46/45.51 0, l^0 -> 1 + l^0, rest remain the same}> 45.46/45.51 45.46/45.51 LOG: CALL solverLinear in Graph for feasibility 45.46/45.51 45.46/45.51 LOG: RETURN solveLinear in Graph for feasibility 45.46/45.51 Strengthening transition (result): 45.46/45.51 45.46/45.51 45.46/45.51 LOG: CALL solverLinear in Graph for feasibility 45.46/45.51 45.46/45.51 LOG: RETURN solveLinear in Graph for feasibility 45.46/45.51 Strengthening transition (result): 45.46/45.51 45.46/45.51 45.46/45.51 LOG: CALL solverLinear in Graph for feasibility 45.46/45.51 45.46/45.51 LOG: RETURN solveLinear in Graph for feasibility 45.46/45.51 Strengthening transition (result): 45.46/45.51 0, l^0 -> 1 + l^0, rest remain the same}> 45.46/45.51 45.46/45.51 LOG: CALL solverLinear in Graph for feasibility 45.46/45.51 45.46/45.51 LOG: RETURN solveLinear in Graph for feasibility 45.46/45.51 Strengthening transition (result): 45.46/45.51 45.46/45.51 45.46/45.51 LOG: CALL solverLinear in Graph for feasibility 45.46/45.51 45.46/45.51 LOG: RETURN solveLinear in Graph for feasibility 45.46/45.51 Strengthening transition (result): 45.46/45.51 45.46/45.51 45.46/45.51 LOG: CALL solverLinear in Graph for feasibility 45.46/45.51 45.46/45.51 LOG: RETURN solveLinear in Graph for feasibility 45.46/45.51 Strengthening transition (result): 45.46/45.51 -1 + i^0, rest remain the same}> 45.46/45.51 45.46/45.51 LOG: CALL solverLinear in Graph for feasibility 45.46/45.51 45.46/45.51 LOG: RETURN solveLinear in Graph for feasibility 45.46/45.51 Strengthening transition (result): 45.46/45.51 -1 + i^0, r^0 -> undef328, rest remain the same}> 45.46/45.51 45.46/45.51 LOG: CALL solverLinear in Graph for feasibility 45.46/45.51 45.46/45.51 LOG: RETURN solveLinear in Graph for feasibility 45.46/45.51 Strengthening transition (result): 45.46/45.51 -1 + i^0, r^0 -> undef328, rest remain the same}> 45.46/45.51 45.46/45.51 LOG: CALL solverLinear in Graph for feasibility 45.46/45.51 45.46/45.51 LOG: RETURN solveLinear in Graph for feasibility 45.46/45.51 Strengthening transition (result): 45.46/45.51 -1 + i^0, r^0 -> undef455, rest remain the same}> 45.46/45.51 45.46/45.51 LOG: CALL solverLinear in Graph for feasibility 45.46/45.51 45.46/45.51 LOG: RETURN solveLinear in Graph for feasibility 45.46/45.51 Strengthening transition (result): 45.46/45.51 1 + k^0, rest remain the same}> 45.46/45.51 45.46/45.51 LOG: CALL solverLinear in Graph for feasibility 45.46/45.51 45.46/45.51 LOG: RETURN solveLinear in Graph for feasibility 45.46/45.51 Strengthening transition (result): 45.46/45.51 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 45.46/45.51 45.46/45.51 LOG: CALL solverLinear in Graph for feasibility 45.46/45.51 45.46/45.51 LOG: RETURN solveLinear in Graph for feasibility 45.46/45.51 Strengthening transition (result): 45.46/45.51 1 + m^0, rest remain the same}> 45.46/45.51 45.46/45.51 LOG: CALL solverLinear in Graph for feasibility 45.46/45.51 45.46/45.51 LOG: RETURN solveLinear in Graph for feasibility 45.46/45.51 Strengthening transition (result): 45.46/45.51 1 + m^0, rest remain the same}> 45.46/45.51 45.46/45.51 LOG: CALL solverLinear in Graph for feasibility 45.46/45.51 45.46/45.51 LOG: RETURN solveLinear in Graph for feasibility 45.46/45.51 Strengthening transition (result): 45.46/45.51 0, l^0 -> 1 + l^0, rest remain the same}> 45.46/45.51 45.46/45.51 LOG: CALL solverLinear in Graph for feasibility 45.46/45.51 45.46/45.51 LOG: RETURN solveLinear in Graph for feasibility 45.46/45.51 Strengthening transition (result): 45.46/45.51 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 45.46/45.51 45.46/45.51 LOG: CALL solverLinear in Graph for feasibility 45.46/45.51 45.46/45.51 LOG: RETURN solveLinear in Graph for feasibility 45.46/45.51 Strengthening transition (result): 45.46/45.51 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 45.46/45.51 45.46/45.51 LOG: CALL solverLinear in Graph for feasibility 45.46/45.51 45.46/45.51 LOG: RETURN solveLinear in Graph for feasibility 45.46/45.51 Strengthening transition (result): 45.46/45.51 undef560, rest remain the same}> 45.46/45.51 45.46/45.51 LOG: CALL solverLinear in Graph for feasibility 45.46/45.51 45.46/45.51 LOG: RETURN solveLinear in Graph for feasibility 45.46/45.51 Strengthening transition (result): 45.46/45.51 undef328, rest remain the same}> 45.46/45.51 45.46/45.51 LOG: CALL solverLinear in Graph for feasibility 45.46/45.51 45.46/45.51 LOG: RETURN solveLinear in Graph for feasibility 45.46/45.51 Strengthening transition (result): 45.46/45.51 undef328, rest remain the same}> 45.46/45.51 45.46/45.51 LOG: CALL solverLinear in Graph for feasibility 45.46/45.51 45.46/45.51 LOG: RETURN solveLinear in Graph for feasibility 45.46/45.51 Strengthening transition (result): 45.46/45.51 undef455, rest remain the same}> 45.46/45.51 45.46/45.51 LOG: CALL solverLinear in Graph for feasibility 45.46/45.51 45.46/45.51 LOG: RETURN solveLinear in Graph for feasibility 45.46/45.51 Strengthening transition (result): 45.46/45.51 undef560, rest remain the same}> 45.46/45.51 45.46/45.51 LOG: CALL solverLinear in Graph for feasibility 45.46/45.51 45.46/45.51 LOG: RETURN solveLinear in Graph for feasibility 45.46/45.51 Strengthening transition (result): 45.46/45.51 undef328, rest remain the same}> 45.46/45.51 45.46/45.51 LOG: CALL solverLinear in Graph for feasibility 45.46/45.51 45.46/45.51 LOG: RETURN solveLinear in Graph for feasibility 45.46/45.51 Strengthening transition (result): 45.46/45.51 undef328, rest remain the same}> 45.46/45.51 45.46/45.51 LOG: CALL solverLinear in Graph for feasibility 45.46/45.51 45.46/45.51 LOG: RETURN solveLinear in Graph for feasibility 45.46/45.51 Strengthening transition (result): 45.46/45.51 undef455, rest remain the same}> 45.46/45.51 45.46/45.51 LOG: CALL solverLinear in Graph for feasibility 45.46/45.51 45.46/45.51 LOG: RETURN solveLinear in Graph for feasibility 45.46/45.51 Strengthening transition (result): 45.46/45.51 undef560, rest remain the same}> 45.46/45.51 45.46/45.51 LOG: CALL solverLinear in Graph for feasibility 45.46/45.51 45.46/45.51 LOG: RETURN solveLinear in Graph for feasibility 45.46/45.51 Strengthening transition (result): 45.46/45.51 undef328, rest remain the same}> 45.46/45.51 45.46/45.51 LOG: CALL solverLinear in Graph for feasibility 45.46/45.51 45.46/45.51 LOG: RETURN solveLinear in Graph for feasibility 45.46/45.51 Strengthening transition (result): 45.46/45.51 undef328, rest remain the same}> 45.46/45.51 45.46/45.51 LOG: CALL solverLinear in Graph for feasibility 45.46/45.51 45.46/45.51 LOG: RETURN solveLinear in Graph for feasibility 45.46/45.51 Strengthening transition (result): 45.46/45.51 undef455, rest remain the same}> 45.46/45.51 45.46/45.51 LOG: CALL solverLinear in Graph for feasibility 45.46/45.51 45.46/45.51 LOG: RETURN solveLinear in Graph for feasibility 45.46/45.51 Strengthening transition (result): 45.46/45.51 undef560, rest remain the same}> 45.46/45.51 45.46/45.51 LOG: CALL solverLinear in Graph for feasibility 45.46/45.51 45.46/45.51 LOG: RETURN solveLinear in Graph for feasibility 45.46/45.51 Strengthening transition (result): 45.46/45.51 undef328, rest remain the same}> 45.46/45.51 45.46/45.51 LOG: CALL solverLinear in Graph for feasibility 45.46/45.51 45.46/45.51 LOG: RETURN solveLinear in Graph for feasibility 45.46/45.51 Strengthening transition (result): 45.46/45.51 undef328, rest remain the same}> 45.46/45.51 45.46/45.51 LOG: CALL solverLinear in Graph for feasibility 45.46/45.51 45.46/45.51 LOG: RETURN solveLinear in Graph for feasibility 45.46/45.51 Strengthening transition (result): 45.46/45.51 undef455, rest remain the same}> 45.46/45.51 45.46/45.51 LOG: CALL solverLinear in Graph for feasibility 45.46/45.51 45.46/45.51 LOG: RETURN solveLinear in Graph for feasibility 45.46/45.51 Strengthening transition (result): 45.46/45.51 undef560, rest remain the same}> 45.46/45.51 45.46/45.51 LOG: CALL solverLinear in Graph for feasibility 45.46/45.51 45.46/45.51 LOG: RETURN solveLinear in Graph for feasibility 45.46/45.51 Strengthening transition (result): 45.46/45.51 undef328, rest remain the same}> 45.46/45.51 45.46/45.51 LOG: CALL solverLinear in Graph for feasibility 45.46/45.51 45.46/45.51 LOG: RETURN solveLinear in Graph for feasibility 45.46/45.51 Strengthening transition (result): 45.46/45.51 undef328, rest remain the same}> 45.46/45.51 45.46/45.51 LOG: CALL solverLinear in Graph for feasibility 45.46/45.51 45.46/45.51 LOG: RETURN solveLinear in Graph for feasibility 45.46/45.51 Strengthening transition (result): 45.46/45.51 undef455, rest remain the same}> 45.46/45.51 45.46/45.51 LOG: CALL solverLinear in Graph for feasibility 45.46/45.51 45.46/45.51 LOG: RETURN solveLinear in Graph for feasibility 45.46/45.51 Strengthening transition (result): 45.46/45.51 undef560, rest remain the same}> 45.46/45.51 45.46/45.51 LOG: CALL solverLinear in Graph for feasibility 45.46/45.51 45.46/45.51 LOG: RETURN solveLinear in Graph for feasibility 45.46/45.51 Strengthening transition (result): 45.46/45.51 undef328, rest remain the same}> 45.46/45.51 45.46/45.51 LOG: CALL solverLinear in Graph for feasibility 45.46/45.51 45.46/45.51 LOG: RETURN solveLinear in Graph for feasibility 45.46/45.51 Strengthening transition (result): 45.46/45.51 undef328, rest remain the same}> 45.46/45.51 45.46/45.51 LOG: CALL solverLinear in Graph for feasibility 45.46/45.51 45.46/45.51 LOG: RETURN solveLinear in Graph for feasibility 45.46/45.51 Strengthening transition (result): 45.46/45.51 undef455, rest remain the same}> 45.46/45.51 Checking unfeasibility... 45.46/45.51 Time used: 1.6173 45.46/45.51 45.46/45.51 Checking conditional termination of SCC {l9, l13, l15, l22}... 45.46/45.51 45.46/45.51 LOG: CALL solveLinear 45.46/45.51 45.46/45.51 LOG: RETURN solveLinear - Elapsed time: 0.061649s 45.46/45.51 Ranking function: -38 - 35*l^0 - 3*m^0 + 38*n^0 45.46/45.51 New Graphs: 45.46/45.51 Transitions: 45.46/45.51 45.46/45.51 45.46/45.51 45.46/45.51 45.46/45.51 45.46/45.51 45.46/45.51 45.46/45.51 45.46/45.51 -1 + i^0, rest remain the same}> 45.46/45.51 -1 + i^0, r^0 -> undef328, rest remain the same}> 45.46/45.51 -1 + i^0, r^0 -> undef328, rest remain the same}> 45.46/45.51 -1 + i^0, r^0 -> undef455, rest remain the same}> 45.46/45.51 1 + k^0, rest remain the same}> 45.46/45.51 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 45.46/45.51 1 + m^0, rest remain the same}> 45.46/45.51 1 + m^0, rest remain the same}> 45.46/45.51 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 45.46/45.51 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 45.46/45.51 undef560, rest remain the same}> 45.46/45.51 undef328, rest remain the same}> 45.46/45.51 undef328, rest remain the same}> 45.46/45.51 undef455, rest remain the same}> 45.46/45.51 undef560, rest remain the same}> 45.46/45.51 undef328, rest remain the same}> 45.46/45.51 undef328, rest remain the same}> 45.46/45.51 undef455, rest remain the same}> 45.46/45.51 undef560, rest remain the same}> 45.46/45.51 undef328, rest remain the same}> 45.46/45.51 undef328, rest remain the same}> 45.46/45.51 undef455, rest remain the same}> 45.46/45.51 undef560, rest remain the same}> 45.46/45.51 undef328, rest remain the same}> 45.46/45.51 undef328, rest remain the same}> 45.46/45.51 undef455, rest remain the same}> 45.46/45.51 undef560, rest remain the same}> 45.46/45.51 undef328, rest remain the same}> 45.46/45.51 undef328, rest remain the same}> 45.46/45.51 undef455, rest remain the same}> 45.46/45.51 undef560, rest remain the same}> 45.46/45.51 undef328, rest remain the same}> 45.46/45.51 undef328, rest remain the same}> 45.46/45.51 undef455, rest remain the same}> 45.46/45.51 Variables: 45.46/45.51 i^0, iter^0, k^0, l^0, m^0, n^0, r^0, tmp___2^0 45.46/45.51 Checking conditional termination of SCC {l9, l13, l15, l22}... 45.46/45.51 45.46/45.51 LOG: CALL solveLinear 45.46/45.51 45.46/45.51 LOG: RETURN solveLinear - Elapsed time: 0.042739s 45.46/45.51 Ranking function: -35 + 35*i^0 - 35*l^0 45.46/45.51 New Graphs: 45.46/45.51 Transitions: 45.46/45.51 45.46/45.51 45.46/45.51 45.46/45.51 45.46/45.51 45.46/45.51 45.46/45.51 45.46/45.51 45.46/45.51 -1 + i^0, rest remain the same}> 45.46/45.51 1 + k^0, rest remain the same}> 45.46/45.51 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 45.46/45.51 1 + m^0, rest remain the same}> 45.46/45.51 1 + m^0, rest remain the same}> 45.46/45.51 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 45.46/45.51 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 45.46/45.51 undef560, rest remain the same}> 45.46/45.51 undef328, rest remain the same}> 45.46/45.51 undef328, rest remain the same}> 45.46/45.51 undef455, rest remain the same}> 45.46/45.51 undef560, rest remain the same}> 45.46/45.51 undef328, rest remain the same}> 45.46/45.51 undef328, rest remain the same}> 45.46/45.51 undef455, rest remain the same}> 45.46/45.51 undef560, rest remain the same}> 45.46/45.51 undef328, rest remain the same}> 45.46/45.51 undef328, rest remain the same}> 45.46/45.51 undef455, rest remain the same}> 45.46/45.51 undef560, rest remain the same}> 45.46/45.51 undef328, rest remain the same}> 45.46/45.51 undef328, rest remain the same}> 45.46/45.51 undef455, rest remain the same}> 45.46/45.51 undef560, rest remain the same}> 45.46/45.51 undef328, rest remain the same}> 45.46/45.51 undef328, rest remain the same}> 45.46/45.51 undef455, rest remain the same}> 45.46/45.51 undef560, rest remain the same}> 45.46/45.51 undef328, rest remain the same}> 45.46/45.51 undef328, rest remain the same}> 45.46/45.51 undef455, rest remain the same}> 45.46/45.51 Variables: 45.46/45.51 i^0, iter^0, k^0, l^0, m^0, n^0, r^0, tmp___2^0 45.46/45.51 Checking conditional termination of SCC {l9, l13, l15, l22}... 45.46/45.51 45.46/45.51 LOG: CALL solveLinear 45.46/45.51 45.46/45.51 LOG: RETURN solveLinear - Elapsed time: 0.040515s 45.46/45.51 Ranking function: 2 - k^0 - l^0 + 2*n^0 45.46/45.51 New Graphs: 45.46/45.51 Transitions: 45.46/45.51 45.46/45.51 45.46/45.51 45.46/45.51 45.46/45.51 45.46/45.51 45.46/45.51 45.46/45.51 45.46/45.51 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 45.46/45.51 1 + m^0, rest remain the same}> 45.46/45.51 1 + m^0, rest remain the same}> 45.46/45.51 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 45.46/45.51 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 45.46/45.51 undef560, rest remain the same}> 45.46/45.51 -1 + i^0, r^0 -> undef328, rest remain the same}> 45.46/45.51 -1 + i^0, r^0 -> undef328, rest remain the same}> 45.46/45.51 undef455, rest remain the same}> 45.46/45.51 undef560, rest remain the same}> 45.46/45.51 -1 + i^0, r^0 -> undef328, rest remain the same}> 45.46/45.51 -1 + i^0, r^0 -> undef328, rest remain the same}> 45.46/45.51 undef455, rest remain the same}> 45.46/45.51 undef560, rest remain the same}> 45.46/45.51 -1 + i^0, r^0 -> undef328, rest remain the same}> 45.46/45.51 -1 + i^0, r^0 -> undef328, rest remain the same}> 45.46/45.51 undef455, rest remain the same}> 45.46/45.51 undef560, rest remain the same}> 45.46/45.51 -1 + i^0, r^0 -> undef328, rest remain the same}> 45.46/45.51 -1 + i^0, r^0 -> undef328, rest remain the same}> 45.46/45.51 undef455, rest remain the same}> 45.46/45.51 undef560, rest remain the same}> 45.46/45.51 -1 + i^0, r^0 -> undef328, rest remain the same}> 45.46/45.51 -1 + i^0, r^0 -> undef328, rest remain the same}> 45.46/45.51 undef455, rest remain the same}> 45.46/45.51 undef560, rest remain the same}> 45.46/45.51 -1 + i^0, r^0 -> undef328, rest remain the same}> 45.46/45.51 -1 + i^0, r^0 -> undef328, rest remain the same}> 45.46/45.51 undef455, rest remain the same}> 45.46/45.51 Variables: 45.46/45.51 i^0, iter^0, k^0, l^0, m^0, n^0, r^0, tmp___2^0 45.46/45.51 Checking conditional termination of SCC {l9, l15, l22}... 45.46/45.51 45.46/45.51 LOG: CALL solveLinear 45.46/45.51 45.46/45.51 LOG: RETURN solveLinear - Elapsed time: 0.044605s 45.46/45.51 Ranking function: -34 - 34*l^0 - 35*m^0 + 69*n^0 45.46/45.51 It's unfeasible after collapsing. Removing transition: 45.46/45.51 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 45.46/45.51 It's unfeasible after collapsing. Removing transition: 45.46/45.51 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 45.46/45.51 It's unfeasible after collapsing. Removing transition: 45.46/45.51 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 45.46/45.51 It's unfeasible after collapsing. Removing transition: 45.46/45.51 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 45.46/45.51 It's unfeasible after collapsing. Removing transition: 45.46/45.51 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 45.46/45.51 It's unfeasible after collapsing. Removing transition: 45.46/45.51 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 45.46/45.51 It's unfeasible after collapsing. Removing transition: 45.46/45.51 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 45.46/45.51 It's unfeasible after collapsing. Removing transition: 45.46/45.51 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 45.46/45.51 It's unfeasible after collapsing. Removing transition: 45.46/45.51 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 45.46/45.51 It's unfeasible after collapsing. Removing transition: 45.46/45.51 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 45.46/45.51 It's unfeasible after collapsing. Removing transition: 45.46/45.51 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 45.46/45.51 It's unfeasible after collapsing. Removing transition: 45.46/45.51 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 45.46/45.51 New Graphs: 45.46/45.51 Transitions: 45.46/45.51 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 45.46/45.51 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 45.46/45.51 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 45.46/45.51 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 45.46/45.51 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 45.46/45.51 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 45.46/45.51 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 45.46/45.51 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 45.46/45.51 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 45.46/45.51 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 45.46/45.51 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 45.46/45.51 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 45.46/45.51 undef560, rest remain the same}> 45.46/45.51 -1 + i^0, r^0 -> undef328, rest remain the same}> 45.46/45.51 -1 + i^0, r^0 -> undef328, rest remain the same}> 45.46/45.51 undef455, rest remain the same}> 45.46/45.51 undef560, rest remain the same}> 45.46/45.51 -1 + i^0, r^0 -> undef328, rest remain the same}> 45.46/45.51 -1 + i^0, r^0 -> undef328, rest remain the same}> 45.46/45.51 undef455, rest remain the same}> 45.46/45.51 undef560, rest remain the same}> 45.46/45.51 -1 + i^0, r^0 -> undef328, rest remain the same}> 45.46/45.51 -1 + i^0, r^0 -> undef328, rest remain the same}> 45.46/45.51 undef455, rest remain the same}> 45.46/45.51 undef560, rest remain the same}> 45.46/45.51 -1 + i^0, r^0 -> undef328, rest remain the same}> 45.46/45.51 -1 + i^0, r^0 -> undef328, rest remain the same}> 45.46/45.51 undef455, rest remain the same}> 45.46/45.51 undef560, rest remain the same}> 45.46/45.51 -1 + i^0, r^0 -> undef328, rest remain the same}> 45.46/45.51 -1 + i^0, r^0 -> undef328, rest remain the same}> 45.46/45.51 undef455, rest remain the same}> 45.46/45.51 undef560, rest remain the same}> 45.46/45.51 -1 + i^0, r^0 -> undef328, rest remain the same}> 45.46/45.51 -1 + i^0, r^0 -> undef328, rest remain the same}> 45.46/45.51 undef455, rest remain the same}> 45.46/45.51 Variables: 45.46/45.51 i^0, iter^0, k^0, l^0, m^0, n^0, r^0, tmp___2^0 45.46/45.51 Checking conditional termination of SCC {l9, l22}... 45.46/45.51 45.46/45.51 LOG: CALL solveLinear 45.46/45.51 45.46/45.51 LOG: RETURN solveLinear - Elapsed time: 0.052786s 45.46/45.51 Ranking function: -34 + i^0 + 34*k^0 - 33*l^0 - 2*n^0 45.46/45.51 New Graphs: 45.46/45.51 Transitions: 45.46/45.51 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 45.46/45.51 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 45.46/45.51 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 45.46/45.51 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 45.46/45.51 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 45.46/45.51 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 45.46/45.51 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 45.46/45.51 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 45.46/45.51 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 45.46/45.51 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 45.46/45.51 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 45.46/45.51 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 45.46/45.51 undef560, rest remain the same}> 45.46/45.51 undef455, rest remain the same}> 45.46/45.51 undef560, rest remain the same}> 45.46/45.51 undef455, rest remain the same}> 45.46/45.51 undef560, rest remain the same}> 45.46/45.51 undef455, rest remain the same}> 45.46/45.51 undef560, rest remain the same}> 45.46/45.51 undef455, rest remain the same}> 45.46/45.51 undef560, rest remain the same}> 45.46/45.51 undef455, rest remain the same}> 45.46/45.51 undef560, rest remain the same}> 45.46/45.51 undef455, rest remain the same}> 45.46/45.51 Variables: 45.46/45.51 i^0, iter^0, l^0, m^0, n^0, r^0, tmp___2^0 45.46/45.51 Checking conditional termination of SCC {l9, l22}... 45.46/45.51 45.46/45.51 LOG: CALL solveLinear 45.46/45.51 45.46/45.51 LOG: RETURN solveLinear - Elapsed time: 0.022896s 45.46/45.51 45.46/45.51 LOG: CALL solveLinear 45.46/45.51 45.46/45.51 LOG: RETURN solveLinear - Elapsed time: 0.366786s 45.46/45.51 Trying to remove transition: undef455, rest remain the same}> 45.46/45.51 Solving with 1 template(s). 45.46/45.51 45.46/45.51 LOG: CALL solveNonLinearGetFirstSolution 45.46/45.51 45.46/45.51 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.185050s 45.46/45.51 Time used: 0.181409 45.46/45.51 Trying to remove transition: undef560, rest remain the same}> 45.46/45.51 Solving with 1 template(s). 45.46/45.51 45.46/45.51 LOG: CALL solveNonLinearGetFirstSolution 45.46/45.51 45.46/45.51 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.111338s 45.46/45.51 Time used: 0.107687 45.46/45.51 Trying to remove transition: undef455, rest remain the same}> 45.46/45.51 Solving with 1 template(s). 45.46/45.51 45.46/45.51 LOG: CALL solveNonLinearGetFirstSolution 45.46/45.51 45.46/45.51 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.198872s 45.46/45.51 Time used: 0.195539 45.46/45.51 Trying to remove transition: undef560, rest remain the same}> 45.46/45.51 Solving with 1 template(s). 45.46/45.51 45.46/45.51 LOG: CALL solveNonLinearGetFirstSolution 45.46/45.51 45.46/45.51 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.175605s 45.46/45.51 Time used: 0.172113 45.46/45.51 Trying to remove transition: undef455, rest remain the same}> 45.46/45.51 Solving with 1 template(s). 45.46/45.51 45.46/45.51 LOG: CALL solveNonLinearGetFirstSolution 45.46/45.51 45.46/45.51 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.085744s 45.46/45.51 Time used: 0.082276 45.46/45.51 Trying to remove transition: undef560, rest remain the same}> 45.46/45.51 Solving with 1 template(s). 45.46/45.51 45.46/45.51 LOG: CALL solveNonLinearGetFirstSolution 45.46/45.51 45.46/45.51 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.089747s 45.46/45.51 Time used: 0.086639 45.46/45.51 Trying to remove transition: undef455, rest remain the same}> 45.46/45.51 Solving with 1 template(s). 45.46/45.51 45.46/45.51 LOG: CALL solveNonLinearGetFirstSolution 45.46/45.51 45.46/45.51 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.085990s 45.46/45.51 Time used: 0.082908 45.46/45.51 Trying to remove transition: undef560, rest remain the same}> 45.46/45.51 Solving with 1 template(s). 45.46/45.51 45.46/45.51 LOG: CALL solveNonLinearGetFirstSolution 45.46/45.51 45.46/45.51 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.090439s 45.46/45.51 Time used: 0.087426 45.46/45.51 Trying to remove transition: undef455, rest remain the same}> 45.46/45.51 Solving with 1 template(s). 45.46/45.51 45.46/45.51 LOG: CALL solveNonLinearGetFirstSolution 45.46/45.51 45.46/45.51 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.093457s 45.46/45.51 Time used: 0.090328 45.46/45.51 Trying to remove transition: undef560, rest remain the same}> 45.46/45.51 Solving with 1 template(s). 45.46/45.51 45.46/45.51 LOG: CALL solveNonLinearGetFirstSolution 45.46/45.51 45.46/45.51 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.097979s 45.46/45.51 Time used: 0.094832 45.46/45.51 Trying to remove transition: undef455, rest remain the same}> 45.46/45.51 Solving with 1 template(s). 45.46/45.51 45.46/45.51 LOG: CALL solveNonLinearGetFirstSolution 45.46/45.51 45.46/45.51 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.093676s 45.46/45.51 Time used: 0.090434 45.46/45.51 Trying to remove transition: undef560, rest remain the same}> 45.46/45.51 Solving with 1 template(s). 45.46/45.51 45.46/45.51 LOG: CALL solveNonLinearGetFirstSolution 45.46/45.51 45.46/45.51 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.098604s 45.46/45.51 Time used: 0.095376 45.46/45.51 Trying to remove transition: 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 45.46/45.51 Solving with 1 template(s). 45.46/45.51 45.46/45.51 LOG: CALL solveNonLinearGetFirstSolution 45.46/45.51 45.46/45.51 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.119467s 45.46/45.51 Time used: 0.116101 45.46/45.51 Trying to remove transition: 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 45.46/45.51 Solving with 1 template(s). 45.46/45.51 45.46/45.51 LOG: CALL solveNonLinearGetFirstSolution 45.46/45.51 45.46/45.51 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.241649s 45.46/45.51 Time used: 0.237821 45.46/45.51 Trying to remove transition: 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 45.46/45.51 Solving with 1 template(s). 45.46/45.51 45.46/45.51 LOG: CALL solveNonLinearGetFirstSolution 45.46/45.51 45.46/45.51 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.117911s 45.46/45.51 Time used: 0.113668 45.46/45.51 Trying to remove transition: 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 45.46/45.51 Solving with 1 template(s). 45.46/45.51 45.46/45.51 LOG: CALL solveNonLinearGetFirstSolution 45.46/45.51 45.46/45.51 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.338345s 45.46/45.51 Time used: 0.334611 45.46/45.51 Trying to remove transition: 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 45.46/45.51 Solving with 1 template(s). 45.46/45.51 45.46/45.51 LOG: CALL solveNonLinearGetFirstSolution 45.46/45.51 45.46/45.51 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.252640s 45.46/45.51 Time used: 0.248216 45.46/45.51 Trying to remove transition: 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 45.46/45.51 Solving with 1 template(s). 45.46/45.51 45.46/45.51 LOG: CALL solveNonLinearGetFirstSolution 45.46/45.51 45.46/45.51 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.240214s 45.46/45.51 Time used: 0.235819 45.46/45.51 Trying to remove transition: 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 45.46/45.51 Solving with 1 template(s). 45.46/45.51 45.46/45.51 LOG: CALL solveNonLinearGetFirstSolution 45.46/45.51 45.46/45.51 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.134749s 45.46/45.51 Time used: 0.130282 45.46/45.51 Trying to remove transition: 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 45.46/45.51 Solving with 1 template(s). 45.46/45.51 45.46/45.51 LOG: CALL solveNonLinearGetFirstSolution 45.46/45.51 45.46/45.51 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.183770s 45.46/45.51 Time used: 0.179702 45.46/45.51 Trying to remove transition: 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 45.46/45.51 Solving with 1 template(s). 45.46/45.51 45.46/45.51 LOG: CALL solveNonLinearGetFirstSolution 45.46/45.51 45.46/45.51 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.145559s 45.46/45.51 Time used: 0.141513 45.46/45.51 Trying to remove transition: 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 45.46/45.51 Solving with 1 template(s). 45.46/45.51 45.46/45.51 LOG: CALL solveNonLinearGetFirstSolution 45.46/45.51 45.46/45.51 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.131231s 45.46/45.51 Time used: 0.127287 45.46/45.51 Trying to remove transition: 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 45.46/45.51 Solving with 1 template(s). 45.46/45.51 45.46/45.51 LOG: CALL solveNonLinearGetFirstSolution 45.46/45.51 45.46/45.51 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.329569s 45.46/45.51 Time used: 0.325774 45.46/45.51 Trying to remove transition: 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 45.46/45.51 Solving with 1 template(s). 45.46/45.51 45.46/45.51 LOG: CALL solveNonLinearGetFirstSolution 45.46/45.51 45.46/45.51 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.324882s 45.46/45.51 Time used: 0.32072 45.46/45.51 Solving with 1 template(s). 45.46/45.51 45.46/45.51 LOG: CALL solveNonLinearGetFirstSolution 45.46/45.51 45.46/45.51 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.005137s 45.46/45.51 Time used: 4.00012 45.46/45.51 Solving with 2 template(s). 45.46/45.51 45.46/45.51 LOG: CALL solveNonLinearGetFirstSolution 45.46/45.51 45.46/45.51 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.022831s 45.46/45.51 Time used: 4.00426 45.46/45.51 Solving with 3 template(s). 45.46/45.51 45.46/45.51 LOG: CALL solveNonLinearGetFirstSolution 45.46/45.51 45.46/45.51 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.846955s 45.46/45.51 Time used: 1.79297 45.46/45.51 Solving with 1 template(s). 45.46/45.51 45.46/45.51 LOG: CALL solveNonLinearGetFirstSolution 45.46/45.51 45.46/45.51 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.091554s 45.46/45.51 Time used: 4.00016 45.46/45.51 Termination failed. Trying to show unreachability... 45.46/45.51 Proving unreachability of entry: 0, rest remain the same}> 45.46/45.51 45.46/45.51 LOG: CALL check - Post:1 <= 0 - Process 1 45.46/45.51 * Exit transition: 0, rest remain the same}> 45.46/45.51 * Postcondition : 1 <= 0 45.46/45.51 Postcodition moved up: 1 <= 0 45.46/45.51 45.46/45.51 LOG: Try proving POST 45.46/45.51 Postcondition: 1 <= 0 45.46/45.51 45.46/45.51 LOG: CALL check - Post:1 <= 0 - Process 2 45.46/45.51 * Exit transition: 45.46/45.51 * Postcondition : 1 <= 0 45.46/45.51 45.46/45.51 LOG: CALL solveLinear 45.46/45.51 45.46/45.51 LOG: RETURN solveLinear - Elapsed time: 0.010790s 45.46/45.51 > Postcondition is not implied! 45.46/45.51 45.46/45.51 LOG: RETURN check - Elapsed time: 0.010912s 45.46/45.51 45.46/45.51 LOG: NarrowEntry size 1 45.46/45.51 Narrowing transition: 45.46/45.51 1 + i^0, rest remain the same}> 45.46/45.51 45.46/45.51 LOG: Narrow transition size 1 45.46/45.51 ENTRIES: 45.46/45.51 45.46/45.51 END ENTRIES: 45.46/45.51 GRAPH: 45.46/45.51 1 + i^0, rest remain the same}> 45.46/45.51 END GRAPH: 45.46/45.51 EXIT: 0, rest remain the same}> 45.46/45.51 POST: 1 <= 0 45.46/45.51 45.46/45.51 45.46/45.51 LOG: Try proving POST 45.46/45.51 Solving with 1 template(s). 45.46/45.51 45.46/45.51 LOG: CALL solveNonLinearGetFirstSolution 45.46/45.51 45.46/45.51 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.040892s 45.46/45.51 Time used: 0.04061 45.46/45.51 Improving Solution with cost 51 ... 45.46/45.51 45.46/45.51 LOG: CALL solveNonLinearGetNextSolution 45.46/45.51 45.46/45.51 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.009104s 45.46/45.51 Time used: 1.00903 45.46/45.51 45.46/45.51 LOG: SAT solveNonLinear - Elapsed time: 1.049996s 45.46/45.51 Cost: 51; Total time: 1.04964 45.46/45.51 Failed at location 6: 1 + n^0 <= i^0 45.46/45.51 Before Improving: 45.46/45.51 Quasi-invariant at l6: 1 + n^0 <= i^0 45.46/45.51 Optimizing invariants... 45.46/45.51 45.46/45.51 LOG: CALL solveLinear 45.46/45.51 45.46/45.51 LOG: RETURN solveLinear - Elapsed time: 0.004304s 45.46/45.51 Remaining time after improvement: 0.997732 45.46/45.51 Some transition disabled by a set of quasi-invariant(s): 45.46/45.51 Quasi-invariant at l6: 1 + n^0 <= i^0 45.46/45.51 45.46/45.51 LOG: NEXT CALL check - disable 45.46/45.51 45.46/45.51 LOG: CALL check - Post:1 + n^0 <= i^0 - Process 3 45.46/45.51 * Exit transition: 45.46/45.51 * Postcondition : 1 + n^0 <= i^0 45.46/45.51 45.46/45.51 LOG: CALL solveLinear 45.46/45.51 45.46/45.51 LOG: RETURN solveLinear - Elapsed time: 0.010334s 45.46/45.51 > Postcondition is not implied! 45.46/45.51 45.46/45.51 LOG: RETURN check - Elapsed time: 0.010488s 45.46/45.51 Solving with 2 template(s). 45.46/45.51 45.46/45.51 LOG: CALL solveNonLinearGetFirstSolution 45.46/45.51 45.46/45.51 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.209157s 45.46/45.51 Time used: 0.208805 45.46/45.51 Improving Solution with cost 51 ... 45.46/45.51 45.46/45.51 LOG: CALL solveNonLinearGetNextSolution 45.46/45.51 45.46/45.51 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.007828s 45.46/45.51 Time used: 1.00776 45.46/45.51 45.46/45.51 LOG: SAT solveNonLinear - Elapsed time: 1.216985s 45.46/45.51 Cost: 51; Total time: 1.21656 45.46/45.51 Failed at location 6: 1 + n^0 <= i^0 45.46/45.51 Before Improving: 45.46/45.51 Quasi-invariant at l6: 1 + n^0 <= i^0 45.46/45.51 Optimizing invariants... 45.46/45.51 45.46/45.51 LOG: CALL solveLinear 45.46/45.51 45.46/45.51 LOG: RETURN solveLinear - Elapsed time: 0.006048s 45.46/45.51 Remaining time after improvement: 0.997577 45.46/45.51 Some transition disabled by a set of quasi-invariant(s): 45.46/45.51 Quasi-invariant at l6: 1 + n^0 <= i^0 45.46/45.51 45.46/45.51 LOG: NEXT CALL check - disable 45.46/45.51 45.46/45.51 LOG: CALL check - Post:1 + n^0 <= i^0 - Process 4 45.46/45.51 * Exit transition: 45.46/45.51 * Postcondition : 1 + n^0 <= i^0 45.46/45.51 45.46/45.51 LOG: CALL solveLinear 45.46/45.51 45.46/45.51 LOG: RETURN solveLinear - Elapsed time: 0.012369s 45.46/45.51 > Postcondition is not implied! 45.46/45.51 45.46/45.51 LOG: RETURN check - Elapsed time: 0.012504s 45.46/45.51 Solving with 3 template(s). 45.46/45.51 45.46/45.51 LOG: CALL solveNonLinearGetFirstSolution 45.46/45.51 45.46/45.51 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.000496s 45.46/45.51 Time used: 1.0001 45.46/45.51 45.46/45.51 LOG: Postcondition is not implied - no solution 45.46/45.51 > Postcondition is not implied! 45.46/45.51 45.46/45.51 LOG: RETURN check - Elapsed time: 3.477175s 45.46/45.51 Cannot prove unreachability 45.46/45.51 45.46/45.51 Proving non-termination of subgraph 2 45.46/45.51 Transitions: 45.46/45.51 0, l^0 -> 1 + l^0, rest remain the same}> 45.46/45.51 45.46/45.51 45.46/45.51 0, l^0 -> 1 + l^0, rest remain the same}> 45.46/45.51 45.46/45.51 45.46/45.51 0, l^0 -> 1 + l^0, rest remain the same}> 45.46/45.51 45.46/45.51 45.46/45.51 0, l^0 -> 1 + l^0, rest remain the same}> 45.46/45.51 45.46/45.51 45.46/45.51 -1 + i^0, rest remain the same}> 45.46/45.51 -1 + i^0, r^0 -> undef328, rest remain the same}> 45.46/45.51 -1 + i^0, r^0 -> undef328, rest remain the same}> 45.46/45.51 -1 + i^0, r^0 -> undef455, rest remain the same}> 45.46/45.51 1 + k^0, rest remain the same}> 45.46/45.51 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 45.46/45.51 1 + m^0, rest remain the same}> 45.46/45.51 1 + m^0, rest remain the same}> 45.46/45.51 0, l^0 -> 1 + l^0, rest remain the same}> 45.46/45.51 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 45.46/45.51 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 45.46/45.51 undef560, rest remain the same}> 45.46/45.51 undef328, rest remain the same}> 45.46/45.51 undef328, rest remain the same}> 45.46/45.51 undef455, rest remain the same}> 45.46/45.51 undef560, rest remain the same}> 45.46/45.51 undef328, rest remain the same}> 45.46/45.51 undef328, rest remain the same}> 45.46/45.51 undef455, rest remain the same}> 45.46/45.51 undef560, rest remain the same}> 45.46/45.51 undef328, rest remain the same}> 45.46/45.51 undef328, rest remain the same}> 45.46/45.51 undef455, rest remain the same}> 45.46/45.51 undef560, rest remain the same}> 45.46/45.51 undef328, rest remain the same}> 45.46/45.51 undef328, rest remain the same}> 45.46/45.51 undef455, rest remain the same}> 45.46/45.51 undef560, rest remain the same}> 45.46/45.51 undef328, rest remain the same}> 45.46/45.51 undef328, rest remain the same}> 45.46/45.51 undef455, rest remain the same}> 45.46/45.51 undef560, rest remain the same}> 45.46/45.51 undef328, rest remain the same}> 45.46/45.51 undef328, rest remain the same}> 45.46/45.51 undef455, rest remain the same}> 45.46/45.51 Variables: 45.46/45.51 l^0, m^0, n^0, r^0, i^0, k^0, iter^0, tmp___2^0 45.46/45.51 45.46/45.51 Checking conditional non-termination of SCC {l9, l13, l15, l22}... 45.46/45.51 EXIT TRANSITIONS: 45.46/45.51 45.46/45.51 45.46/45.51 45.46/45.51 45.46/45.51 Solving with 1 template(s). 45.46/45.51 45.46/45.51 LOG: CALL solveNonLinearGetFirstSolution 45.46/45.51 45.46/45.51 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 5.000848s 45.46/45.51 Time used: 5.00005 45.46/45.51 Solving with 2 template(s). 45.46/45.51 45.46/45.51 LOG: CALL solveNonLinearGetFirstSolution 45.46/45.51 45.46/45.51 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 5.030476s 45.46/45.51 Time used: 5.00024 45.46/45.51 Solving with 3 template(s). 45.46/45.51 45.46/45.51 LOG: CALL solveNonLinearGetFirstSolution 45.46/45.51 45.46/45.51 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 5.055537s 45.46/45.51 Time used: 5.00056 45.46/45.51 > Checking if the negation of the conditions of every pending exit is quasi-invariant... NO 45.46/45.51 45.46/45.51 Proving non-termination of subgraph 2 45.46/45.51 Transitions: 45.46/45.51 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 45.46/45.51 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 45.46/45.51 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 45.46/45.51 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 45.46/45.51 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 45.46/45.51 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 45.46/45.51 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 45.46/45.51 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 45.46/45.51 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 45.46/45.51 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 45.46/45.51 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 45.46/45.51 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 45.46/45.51 undef560, rest remain the same}> 45.46/45.51 undef455, rest remain the same}> 45.46/45.51 undef560, rest remain the same}> 45.46/45.51 undef455, rest remain the same}> 45.46/45.51 undef560, rest remain the same}> 45.46/45.51 undef455, rest remain the same}> 45.46/45.51 undef560, rest remain the same}> 45.46/45.51 undef455, rest remain the same}> 45.46/45.51 undef560, rest remain the same}> 45.46/45.51 undef455, rest remain the same}> 45.46/45.51 undef560, rest remain the same}> 45.46/45.51 undef455, rest remain the same}> 45.46/45.51 Variables: 45.46/45.51 i^0, iter^0, l^0, m^0, n^0, r^0, tmp___2^0 45.46/45.51 45.46/45.51 Checking conditional non-termination of SCC {l9, l22}... 45.46/45.51 EXIT TRANSITIONS: 45.46/45.51 45.46/45.51 45.46/45.51 45.46/45.51 45.46/45.51 45.46/45.51 Solving with 1 template(s). 45.46/45.51 45.46/45.51 LOG: CALL solveNonLinearGetFirstSolution 45.46/45.51 45.46/45.51 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 2.192308s 45.46/45.51 Time used: 2.19185 45.46/45.51 45.46/45.51 LOG: SAT solveNonLinear - Elapsed time: 2.192308s 45.46/45.51 Cost: 0; Total time: 2.19185 45.46/45.51 Minimizing number of undef constraints... 45.46/45.51 45.46/45.51 LOG: CALL solveNonLinear 45.46/45.51 45.46/45.51 LOG: RETURN solveNonLinear - Elapsed time: 0.173627s 45.46/45.51 Number of undef constraints reduced! 45.46/45.51 45.46/45.51 Non-termination implied by a set of quasi-invariant(s): 45.46/45.51 Quasi-invariant at l9: 1 + l^0 <= m^0 45.46/45.51 Quasi-invariant at l22: 1 + l^0 <= m^0 45.46/45.51 45.46/45.51 Strengthening and disabling EXIT transitions... 45.46/45.51 Closed exits from l9: 4 45.46/45.51 45.46/45.51 Strengthening and disabling transitions... 45.46/45.51 45.46/45.51 LOG: CALL solverLinear in Graph for feasibility 45.46/45.51 45.46/45.51 LOG: RETURN solveLinear in Graph for feasibility 45.46/45.51 Strengthening transition (result): 45.46/45.51 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 45.46/45.51 45.46/45.51 LOG: CALL solverLinear in Graph for feasibility 45.46/45.51 45.46/45.51 LOG: RETURN solveLinear in Graph for feasibility 45.46/45.51 Strengthening transition (result): 45.46/45.51 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 45.46/45.51 45.46/45.51 LOG: CALL solverLinear in Graph for feasibility 45.46/45.51 45.46/45.51 LOG: RETURN solveLinear in Graph for feasibility 45.46/45.51 It's unfeasible. Removing transition: 45.46/45.51 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 45.46/45.51 45.46/45.51 LOG: CALL solverLinear in Graph for feasibility 45.46/45.51 45.46/45.51 LOG: RETURN solveLinear in Graph for feasibility 45.46/45.51 Strengthening transition (result): 45.46/45.51 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 45.46/45.51 45.46/45.51 LOG: CALL solverLinear in Graph for feasibility 45.46/45.51 45.46/45.51 LOG: RETURN solveLinear in Graph for feasibility 45.46/45.51 Strengthening transition (result): 45.46/45.51 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 45.46/45.51 45.46/45.51 LOG: CALL solverLinear in Graph for feasibility 45.46/45.51 45.46/45.51 LOG: RETURN solveLinear in Graph for feasibility 45.46/45.51 It's unfeasible. Removing transition: 45.46/45.51 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 45.46/45.51 45.46/45.51 LOG: CALL solverLinear in Graph for feasibility 45.46/45.51 45.46/45.51 LOG: RETURN solveLinear in Graph for feasibility 45.46/45.51 Strengthening transition (result): 45.46/45.51 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 45.46/45.51 45.46/45.51 LOG: CALL solverLinear in Graph for feasibility 45.46/45.51 45.46/45.51 LOG: RETURN solveLinear in Graph for feasibility 45.46/45.51 Strengthening transition (result): 45.46/45.51 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 45.46/45.51 45.46/45.51 LOG: CALL solverLinear in Graph for feasibility 45.46/45.51 45.46/45.51 LOG: RETURN solveLinear in Graph for feasibility 45.46/45.51 It's unfeasible. Removing transition: 45.46/45.51 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 45.46/45.51 45.46/45.51 LOG: CALL solverLinear in Graph for feasibility 45.46/45.51 45.46/45.51 LOG: RETURN solveLinear in Graph for feasibility 45.46/45.51 Strengthening transition (result): 45.46/45.51 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 45.46/45.51 45.46/45.51 LOG: CALL solverLinear in Graph for feasibility 45.46/45.51 45.46/45.51 LOG: RETURN solveLinear in Graph for feasibility 45.46/45.51 Strengthening transition (result): 45.46/45.51 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 45.46/45.51 45.46/45.51 LOG: CALL solverLinear in Graph for feasibility 45.46/45.51 45.46/45.51 LOG: RETURN solveLinear in Graph for feasibility 45.46/45.51 It's unfeasible. Removing transition: 45.46/45.51 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 45.46/45.51 45.46/45.51 LOG: CALL solverLinear in Graph for feasibility 45.46/45.51 45.46/45.51 LOG: RETURN solveLinear in Graph for feasibility 45.46/45.51 Strengthening transition (result): 45.46/45.51 undef560, rest remain the same}> 45.46/45.51 45.46/45.51 LOG: CALL solverLinear in Graph for feasibility 45.46/45.51 45.46/45.51 LOG: RETURN solveLinear in Graph for feasibility 45.46/45.51 Strengthening transition (result): 45.46/45.51 undef455, rest remain the same}> 45.46/45.51 45.46/45.51 LOG: CALL solverLinear in Graph for feasibility 45.46/45.51 45.46/45.51 LOG: RETURN solveLinear in Graph for feasibility 45.46/45.51 Strengthening transition (result): 45.46/45.51 undef560, rest remain the same}> 45.46/45.51 45.46/45.51 LOG: CALL solverLinear in Graph for feasibility 45.46/45.51 45.46/45.51 LOG: RETURN solveLinear in Graph for feasibility 45.46/45.51 Strengthening transition (result): 45.46/45.51 undef455, rest remain the same}> 45.46/45.51 45.46/45.51 LOG: CALL solverLinear in Graph for feasibility 45.46/45.51 45.46/45.51 LOG: RETURN solveLinear in Graph for feasibility 45.46/45.51 Strengthening transition (result): 45.46/45.51 undef560, rest remain the same}> 45.46/45.51 45.46/45.51 LOG: CALL solverLinear in Graph for feasibility 45.46/45.51 45.46/45.51 LOG: RETURN solveLinear in Graph for feasibility 45.46/45.51 Strengthening transition (result): 45.46/45.51 undef455, rest remain the same}> 45.46/45.51 45.46/45.51 LOG: CALL solverLinear in Graph for feasibility 45.46/45.51 45.46/45.51 LOG: RETURN solveLinear in Graph for feasibility 45.46/45.51 Strengthening transition (result): 45.46/45.51 undef560, rest remain the same}> 45.46/45.51 45.46/45.51 LOG: CALL solverLinear in Graph for feasibility 45.46/45.51 45.46/45.51 LOG: RETURN solveLinear in Graph for feasibility 45.46/45.51 Strengthening transition (result): 45.46/45.51 undef455, rest remain the same}> 45.46/45.51 45.46/45.51 LOG: CALL solverLinear in Graph for feasibility 45.46/45.51 45.46/45.51 LOG: RETURN solveLinear in Graph for feasibility 45.46/45.51 Strengthening transition (result): 45.46/45.51 undef560, rest remain the same}> 45.46/45.51 45.46/45.51 LOG: CALL solverLinear in Graph for feasibility 45.46/45.51 45.46/45.51 LOG: RETURN solveLinear in Graph for feasibility 45.46/45.51 Strengthening transition (result): 45.46/45.51 undef455, rest remain the same}> 45.46/45.51 45.46/45.51 LOG: CALL solverLinear in Graph for feasibility 45.46/45.51 45.46/45.51 LOG: RETURN solveLinear in Graph for feasibility 45.46/45.51 Strengthening transition (result): 45.46/45.51 undef560, rest remain the same}> 45.46/45.51 45.46/45.51 LOG: CALL solverLinear in Graph for feasibility 45.46/45.51 45.46/45.51 LOG: RETURN solveLinear in Graph for feasibility 45.46/45.51 Strengthening transition (result): 45.46/45.51 undef455, rest remain the same}> 45.46/45.51 45.46/45.51 Calling reachability with... 45.46/45.51 Transition: 45.46/45.51 Conditions: 45.46/45.51 OPEN EXITS: 45.46/45.51 45.46/45.51 45.46/45.51 --- Reachability graph --- 45.46/45.51 > Graph without transitions. 45.46/45.51 45.46/45.51 Calling reachability with... 45.46/45.51 Transition: 0, rest remain the same}> 45.46/45.51 Conditions: 45.46/45.51 OPEN EXITS: 45.46/45.51 0, rest remain the same}> (condsUp: l^0 <= n^0) 45.46/45.51 45.46/45.51 --- Reachability graph --- 45.46/45.51 > Graph without transitions. 45.46/45.51 45.46/45.51 Calling reachability with... 45.46/45.51 Transition: 45.46/45.51 Conditions: 1 + n^0 <= i^0, l^0 <= n^0, 45.46/45.51 OPEN EXITS: 45.46/45.51 45.46/45.51 45.46/45.51 > Conditions are reachable! 45.46/45.51 45.46/45.51 Program does NOT terminate 45.46/45.51 /export/starexec/sandbox2/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found 45.46/45.51 /export/starexec/sandbox2/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found 45.46/45.51 EOF