/export/starexec/sandbox/solver/bin/starexec_run_termcomp17 /export/starexec/sandbox/benchmark/theBenchmark.smt2 /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES Solver Timeout: 4 Global Timeout: 300 Maximum number of concurrent processes: 900 No parsing errors! Init Location: 0 Transitions: (1 + k^0), scale^0 -> ((0 + scale^0) + undef81), tmp___5^0 -> undef81}> (0 + undef327), s^0 -> undef327, scale^0 -> undef328}> (1 + k^0)}> (1 + j^0)}> (1 + k^0)}> undef620}> (1 + k^0), s^0 -> undef679}> (0 + (~(1) * tmp___4^0)), h^0 -> undef843}> undef914, tmp___3^0 -> undef915, tmp___4^0 -> (0 + (~(1) * undef915))}> undef946, tmp___1^0 -> undef957, tmp___4^0 -> (0 + undef957)}> undef1016}> (1 + k^0), s^0 -> undef1075}> (1 + k^0), scale^0 -> ((0 + scale^0) + undef1341), tmp^0 -> undef1341}> (0 + undef1515), l^0 -> (1 + i^0), s^0 -> undef1515, scale^0 -> undef1516}> (~(1) + k^0)}> (1 + j^0)}> (1 + jj^0), y^0 -> undef1891, z^0 -> undef1892}> undef1940, x^0 -> undef1978}> undef1983, s^0 -> undef1999, z^0 -> undef2024}> undef2244}> (1 + jj^0), x^0 -> undef2286, z^0 -> undef2288}> (1 + its^0)}> undef2379, f^0 -> undef2380, g^0 -> undef2382, h^0 -> undef2383, i^0 -> (1 + j^0), s^0 -> undef2395, y^0 -> undef2419, z^0 -> undef2420}> (0 + undef2531), f^0 -> undef2516, s^0 -> undef2531}> undef2587, tmp___19^0 -> (0 + (~(1) * undef2587))}> undef2630, tmp___19^0 -> (0 + undef2630)}> undef2692, g^0 -> undef2694, h^0 -> undef2695, nm^0 -> (~(1) + k^0), x^0 -> undef2730, y^0 -> undef2731}> (1 + j^0)}> undef3349}> (1 + i^0)}> (1 + j^0), y^0 -> undef3480, z^0 -> undef3481}> undef3528, g^0 -> undef3531, h^0 -> undef3532, s^0 -> undef3544}> undef3750, tmp___16^0 -> undef3775}> 0, s^0 -> 1}> (~(1) + l^0)}> undef4258}> 0}> (~(1) + l^0), tmp___14^0 -> undef4521}> 1}> (1 + j^0)}> (~(1) + i^0)}> (1 + j^0)}> (1 + j^0)}> (1 + k^0)}> undef5158}> (1 + k^0), s^0 -> undef5217}> undef5336}> (1 + j^0)}> undef5732, l^0 -> (1 + i^0)}> undef5820, i^0 -> (~(1) + i^0), l^0 -> (0 + i^0)}> (1 + j^0), tmp___13^0 -> 0}> (1 + j^0)}> (1 + k^0)}> (1 + k^0), s^0 -> undef6185}> (1 + j^0)}> (1 + i^0)}> (0 + maxarg2^0)}> (0 + maxarg1^0)}> (0 + anorm^0), maxarg2^0 -> ((0 + undef6938) + undef6939), tmp___11^0 -> undef6938, tmp___12^0 -> undef6939}> (1 + k^0)}> (1 + j^0)}> (1 + k^0)}> (1 + k^0), s^0 -> undef7241}> (1 + k^0)}> (0 + (~(1) * tmp___10^0)), h^0 -> undef7537}> (0 + (~(1) * undef7615)), tmp___8^0 -> undef7614, tmp___9^0 -> undef7615}> (0 + undef7657), tmp___6^0 -> undef7656, tmp___7^0 -> undef7657}> undef7710}> (1 + k^0), s^0 -> undef7769}> undef7972, g^0 -> (0 + undef7990), scale^0 -> undef7990}> Fresh variables: undef81, undef327, undef328, undef620, undef679, undef843, undef914, undef915, undef946, undef957, undef1016, undef1075, undef1341, undef1515, undef1516, undef1891, undef1892, undef1940, undef1978, undef1983, undef1999, undef2024, undef2244, undef2286, undef2288, undef2379, undef2380, undef2382, undef2383, undef2395, undef2419, undef2420, undef2421, undef2422, undef2423, undef2424, undef2516, undef2531, undef2587, undef2630, undef2692, undef2694, undef2695, undef2730, undef2731, undef2733, undef3349, undef3480, undef3481, undef3528, undef3531, undef3532, undef3544, undef3570, undef3750, undef3775, undef4258, undef4521, undef5158, undef5217, undef5336, undef5732, undef5820, undef6185, undef6938, undef6939, undef7241, undef7537, undef7614, undef7615, undef7656, undef7657, undef7710, undef7769, undef7972, undef7990, Undef variables: undef81, undef327, undef328, undef620, undef679, undef843, undef914, undef915, undef946, undef957, undef1016, undef1075, undef1341, undef1515, undef1516, undef1891, undef1892, undef1940, undef1978, undef1983, undef1999, undef2024, undef2244, undef2286, undef2288, undef2379, undef2380, undef2382, undef2383, undef2395, undef2419, undef2420, undef2421, undef2422, undef2423, undef2424, undef2516, undef2531, undef2587, undef2630, undef2692, undef2694, undef2695, undef2730, undef2731, undef2733, undef3349, undef3480, undef3481, undef3528, undef3531, undef3532, undef3544, undef3570, undef3750, undef3775, undef4258, undef4521, undef5158, undef5217, undef5336, undef5732, undef5820, undef6185, undef6938, undef6939, undef7241, undef7537, undef7614, undef7615, undef7656, undef7657, undef7710, undef7769, undef7972, undef7990, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: (0 + ((0 + undef6938) + undef6939)), i^0 -> (1 + i^0)}> (0 + (0 + anorm^0)), i^0 -> (1 + i^0)}> (1 + k^0), scale^0 -> ((0 + scale^0) + undef81)}> (0 + ((0 + undef6938) + undef6939)), g^0 -> (0 + undef327), i^0 -> (1 + i^0), scale^0 -> undef328}> (0 + (0 + anorm^0)), g^0 -> (0 + undef327), i^0 -> (1 + i^0), scale^0 -> undef328}> (0 + ((0 + undef6938) + undef6939)), g^0 -> (0 + undef327), i^0 -> (1 + i^0), scale^0 -> undef328}> (0 + (0 + anorm^0)), g^0 -> (0 + undef327), i^0 -> (1 + i^0), scale^0 -> undef328}> (0 + undef327), scale^0 -> undef328}> (0 + undef327), scale^0 -> undef328}> (1 + k^0)}> (1 + j^0)}> (1 + j^0)}> (1 + k^0)}> (~(1) + l^0), nm^0 -> (~(1) + l^0)}> (~(1) + l^0), nm^0 -> (~(1) + l^0)}> (~(1) + l^0)}> (~(1) + l^0), nm^0 -> (~(1) + l^0)}> (~(1) + l^0), nm^0 -> (~(1) + l^0)}> (~(1) + l^0)}> 0, nm^0 -> (~(1) + l^0)}> (1 + k^0)}> (1 + i^0), z^0 -> undef3349}> (1 + i^0), z^0 -> undef3349}> (1 + i^0), k^0 -> (~(1) + k^0), z^0 -> undef3349}> (1 + i^0), z^0 -> undef3349}> undef3531, i^0 -> (1 + i^0)}> undef3531, i^0 -> (1 + i^0)}> (1 + i^0), z^0 -> undef3349}> (1 + i^0), z^0 -> undef3349}> (1 + i^0), k^0 -> (~(1) + k^0), z^0 -> undef3349}> (1 + i^0), z^0 -> undef3349}> (1 + j^0), z^0 -> undef3481}> (0 + (~(1) * (0 + (~(1) * undef915))))}> (0 + (~(1) * (0 + (~(1) * undef915))))}> (0 + (~(1) * (0 + undef957)))}> (0 + (~(1) * (0 + undef957)))}> (1 + k^0)}> (~(1) + k^0)}> (1 + j^0)}> (0 + ((0 + undef6938) + undef6939)), g^0 -> (0 + undef327), i^0 -> (1 + i^0), scale^0 -> undef328}> (0 + (0 + anorm^0)), g^0 -> (0 + undef327), i^0 -> (1 + i^0), scale^0 -> undef328}> (0 + ((0 + undef6938) + undef6939)), g^0 -> (0 + undef327), i^0 -> (1 + i^0), scale^0 -> undef328}> (0 + (0 + anorm^0)), g^0 -> (0 + undef327), i^0 -> (1 + i^0), scale^0 -> undef328}> (0 + undef327), scale^0 -> undef328}> (0 + undef327), scale^0 -> undef328}> (1 + k^0), scale^0 -> ((0 + scale^0) + undef1341)}> undef5820, i^0 -> (~(1) + i^0), l^0 -> (0 + i^0)}> (0 + ((0 + undef6938) + undef6939)), g^0 -> (0 + undef327), i^0 -> (1 + i^0), l^0 -> (1 + i^0), scale^0 -> undef328}> (0 + (0 + anorm^0)), g^0 -> (0 + undef327), i^0 -> (1 + i^0), l^0 -> (1 + i^0), scale^0 -> undef328}> (0 + undef1515), l^0 -> (1 + i^0), scale^0 -> undef1516}> (~(1) + k^0)}> 1}> (1 + its^0), j^0 -> (1 + j^0), k^0 -> (~(1) + k^0)}> 1, its^0 -> (1 + its^0), j^0 -> (1 + j^0)}> undef2382, i^0 -> (1 + (1 + j^0)), j^0 -> (1 + j^0), z^0 -> undef2420}> (1 + jj^0), z^0 -> undef1892}> undef2244}> undef2024}> undef2024}> (1 + jj^0), z^0 -> undef2288}> (0 + (~(1) * (0 + (~(1) * undef7615))))}> (0 + (~(1) * (0 + undef7657)))}> (1 + k^0)}> undef2694, its^0 -> (1 + its^0), k^0 -> (~(1) + k^0), nm^0 -> (~(1) + k^0)}> undef2382, i^0 -> (1 + j^0), nm^0 -> (~(1) + k^0), z^0 -> undef2420}> undef2694, its^0 -> (1 + its^0), k^0 -> (~(1) + k^0), nm^0 -> (~(1) + k^0)}> undef2382, i^0 -> (1 + j^0), nm^0 -> (~(1) + k^0), z^0 -> undef2420}> 1, g^0 -> undef2694, its^0 -> (1 + its^0), nm^0 -> (~(1) + k^0)}> undef2382, i^0 -> (1 + j^0), nm^0 -> (~(1) + k^0), z^0 -> undef2420}> 1, g^0 -> undef2694, its^0 -> (1 + its^0), nm^0 -> (~(1) + k^0)}> undef2382, i^0 -> (1 + j^0), nm^0 -> (~(1) + k^0), z^0 -> undef2420}> undef2694, its^0 -> (1 + its^0), k^0 -> (~(1) + k^0), nm^0 -> (~(1) + k^0)}> undef2382, i^0 -> (1 + j^0), nm^0 -> (~(1) + k^0), z^0 -> undef2420}> undef2694, its^0 -> (1 + its^0), k^0 -> (~(1) + k^0), nm^0 -> (~(1) + k^0)}> undef2382, i^0 -> (1 + j^0), nm^0 -> (~(1) + k^0), z^0 -> undef2420}> (1 + k^0)}> (1 + k^0)}> (1 + j^0)}> (1 + j^0)}> (1 + k^0)}> undef3349}> undef3349}> (~(1) + k^0), z^0 -> undef3349}> undef3349}> undef3349}> undef3349}> (~(1) + k^0), z^0 -> undef3349}> undef3349}> undef3531}> undef3531}> undef3349}> undef3349}> (~(1) + k^0), z^0 -> undef3349}> undef3349}> undef3349}> undef3349}> (~(1) + k^0), z^0 -> undef3349}> undef3349}> undef3531}> undef3531}> undef3349}> undef3349}> (~(1) + k^0), z^0 -> undef3349}> undef3349}> (0 + ((0 + undef6938) + undef6939)), i^0 -> (1 + i^0)}> (0 + (0 + anorm^0)), i^0 -> (1 + i^0)}> (1 + k^0)}> (1 + j^0)}> undef5820, i^0 -> (~(1) + i^0), l^0 -> (0 + i^0)}> (1 + j^0)}> Fresh variables: undef81, undef327, undef328, undef620, undef679, undef843, undef914, undef915, undef946, undef957, undef1016, undef1075, undef1341, undef1515, undef1516, undef1891, undef1892, undef1940, undef1978, undef1983, undef1999, undef2024, undef2244, undef2286, undef2288, undef2379, undef2380, undef2382, undef2383, undef2395, undef2419, undef2420, undef2421, undef2422, undef2423, undef2424, undef2516, undef2531, undef2587, undef2630, undef2692, undef2694, undef2695, undef2730, undef2731, undef2733, undef3349, undef3480, undef3481, undef3528, undef3531, undef3532, undef3544, undef3570, undef3750, undef3775, undef4258, undef4521, undef5158, undef5217, undef5336, undef5732, undef5820, undef6185, undef6938, undef6939, undef7241, undef7537, undef7614, undef7615, undef7656, undef7657, undef7710, undef7769, undef7972, undef7990, Undef variables: undef81, undef327, undef328, undef620, undef679, undef843, undef914, undef915, undef946, undef957, undef1016, undef1075, undef1341, undef1515, undef1516, undef1891, undef1892, undef1940, undef1978, undef1983, undef1999, undef2024, undef2244, undef2286, undef2288, undef2379, undef2380, undef2382, undef2383, undef2395, undef2419, undef2420, undef2421, undef2422, undef2423, undef2424, undef2516, undef2531, undef2587, undef2630, undef2692, undef2694, undef2695, undef2730, undef2731, undef2733, undef3349, undef3480, undef3481, undef3528, undef3531, undef3532, undef3544, undef3570, undef3750, undef3775, undef4258, undef4521, undef5158, undef5217, undef5336, undef5732, undef5820, undef6185, undef6938, undef6939, undef7241, undef7537, undef7614, undef7615, undef7656, undef7657, undef7710, undef7769, undef7972, undef7990, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: undef6938 + undef6939, i^0 -> 1 + i^0, rest remain the same}> 1 + i^0, rest remain the same}> 1 + k^0, scale^0 -> scale^0 + undef81, rest remain the same}> undef6938 + undef6939, g^0 -> undef327, i^0 -> 1 + i^0, scale^0 -> undef328, rest remain the same}> undef327, i^0 -> 1 + i^0, scale^0 -> undef328, rest remain the same}> undef6938 + undef6939, g^0 -> undef327, i^0 -> 1 + i^0, scale^0 -> undef328, rest remain the same}> undef327, i^0 -> 1 + i^0, scale^0 -> undef328, rest remain the same}> undef327, scale^0 -> undef328, rest remain the same}> undef327, scale^0 -> undef328, rest remain the same}> 1 + k^0, rest remain the same}> 1 + j^0, rest remain the same}> 1 + j^0, rest remain the same}> 1 + k^0, rest remain the same}> 1 + k^0, rest remain the same}> undef915, rest remain the same}> undef915, rest remain the same}> -undef957, rest remain the same}> -undef957, rest remain the same}> 1 + k^0, rest remain the same}> undef6938 + undef6939, g^0 -> undef327, i^0 -> 1 + i^0, scale^0 -> undef328, rest remain the same}> undef327, i^0 -> 1 + i^0, scale^0 -> undef328, rest remain the same}> undef6938 + undef6939, g^0 -> undef327, i^0 -> 1 + i^0, scale^0 -> undef328, rest remain the same}> undef327, i^0 -> 1 + i^0, scale^0 -> undef328, rest remain the same}> undef327, scale^0 -> undef328, rest remain the same}> undef327, scale^0 -> undef328, rest remain the same}> 1 + k^0, scale^0 -> scale^0 + undef1341, rest remain the same}> undef6938 + undef6939, g^0 -> undef327, i^0 -> 1 + i^0, l^0 -> 1 + i^0, scale^0 -> undef328, rest remain the same}> undef327, i^0 -> 1 + i^0, l^0 -> 1 + i^0, scale^0 -> undef328, rest remain the same}> undef1515, l^0 -> 1 + i^0, scale^0 -> undef1516, rest remain the same}> undef7615, rest remain the same}> -undef7657, rest remain the same}> 1 + k^0, rest remain the same}> 1 + k^0, rest remain the same}> 1 + k^0, rest remain the same}> 1 + j^0, rest remain the same}> 1 + j^0, rest remain the same}> 1 + k^0, rest remain the same}> undef6938 + undef6939, i^0 -> 1 + i^0, rest remain the same}> 1 + i^0, rest remain the same}> 1 + k^0, rest remain the same}> Variables: anorm^0, i^0, k^0, n^0, scale^0, g^0, m^0, j^0, l^0 Graph 2: Transitions: undef5820, i^0 -> -1 + i^0, l^0 -> i^0, rest remain the same}> 1 + j^0, rest remain the same}> undef5820, i^0 -> -1 + i^0, l^0 -> i^0, rest remain the same}> 1 + j^0, rest remain the same}> Variables: g^0, i^0, l^0, n^0, j^0 Graph 3: Transitions: -1 + l^0, nm^0 -> -1 + l^0, rest remain the same}> -1 + l^0, nm^0 -> -1 + l^0, rest remain the same}> -1 + l^0, rest remain the same}> -1 + l^0, nm^0 -> -1 + l^0, rest remain the same}> -1 + l^0, nm^0 -> -1 + l^0, rest remain the same}> -1 + l^0, rest remain the same}> 0, nm^0 -> -1 + l^0, rest remain the same}> 1 + i^0, z^0 -> undef3349, rest remain the same}> 1 + i^0, z^0 -> undef3349, rest remain the same}> 1 + i^0, k^0 -> -1 + k^0, z^0 -> undef3349, rest remain the same}> 1 + i^0, z^0 -> undef3349, rest remain the same}> undef3531, i^0 -> 1 + i^0, rest remain the same}> undef3531, i^0 -> 1 + i^0, rest remain the same}> 1 + i^0, z^0 -> undef3349, rest remain the same}> 1 + i^0, z^0 -> undef3349, rest remain the same}> 1 + i^0, k^0 -> -1 + k^0, z^0 -> undef3349, rest remain the same}> 1 + i^0, z^0 -> undef3349, rest remain the same}> 1 + j^0, z^0 -> undef3481, rest remain the same}> -1 + k^0, rest remain the same}> 1 + j^0, rest remain the same}> -1 + k^0, rest remain the same}> 1, rest remain the same}> 1 + its^0, j^0 -> 1 + j^0, k^0 -> -1 + k^0, rest remain the same}> 1, its^0 -> 1 + its^0, j^0 -> 1 + j^0, rest remain the same}> undef2382, i^0 -> 2 + j^0, j^0 -> 1 + j^0, z^0 -> undef2420, rest remain the same}> 1 + jj^0, z^0 -> undef1892, rest remain the same}> undef2244, rest remain the same}> undef2024, rest remain the same}> undef2024, rest remain the same}> 1 + jj^0, z^0 -> undef2288, rest remain the same}> undef2694, its^0 -> 1 + its^0, k^0 -> -1 + k^0, nm^0 -> -1 + k^0, rest remain the same}> undef2382, i^0 -> 1 + j^0, nm^0 -> -1 + k^0, z^0 -> undef2420, rest remain the same}> undef2694, its^0 -> 1 + its^0, k^0 -> -1 + k^0, nm^0 -> -1 + k^0, rest remain the same}> undef2382, i^0 -> 1 + j^0, nm^0 -> -1 + k^0, z^0 -> undef2420, rest remain the same}> 1, g^0 -> undef2694, its^0 -> 1 + its^0, nm^0 -> -1 + k^0, rest remain the same}> undef2382, i^0 -> 1 + j^0, nm^0 -> -1 + k^0, z^0 -> undef2420, rest remain the same}> 1, g^0 -> undef2694, its^0 -> 1 + its^0, nm^0 -> -1 + k^0, rest remain the same}> undef2382, i^0 -> 1 + j^0, nm^0 -> -1 + k^0, z^0 -> undef2420, rest remain the same}> undef2694, its^0 -> 1 + its^0, k^0 -> -1 + k^0, nm^0 -> -1 + k^0, rest remain the same}> undef2382, i^0 -> 1 + j^0, nm^0 -> -1 + k^0, z^0 -> undef2420, rest remain the same}> undef2694, its^0 -> 1 + its^0, k^0 -> -1 + k^0, nm^0 -> -1 + k^0, rest remain the same}> undef2382, i^0 -> 1 + j^0, nm^0 -> -1 + k^0, z^0 -> undef2420, rest remain the same}> undef3349, rest remain the same}> undef3349, rest remain the same}> -1 + k^0, z^0 -> undef3349, rest remain the same}> undef3349, rest remain the same}> undef3349, rest remain the same}> undef3349, rest remain the same}> -1 + k^0, z^0 -> undef3349, rest remain the same}> undef3349, rest remain the same}> undef3531, rest remain the same}> undef3531, rest remain the same}> undef3349, rest remain the same}> undef3349, rest remain the same}> -1 + k^0, z^0 -> undef3349, rest remain the same}> undef3349, rest remain the same}> undef3349, rest remain the same}> undef3349, rest remain the same}> -1 + k^0, z^0 -> undef3349, rest remain the same}> undef3349, rest remain the same}> undef3531, rest remain the same}> undef3531, rest remain the same}> undef3349, rest remain the same}> undef3349, rest remain the same}> -1 + k^0, z^0 -> undef3349, rest remain the same}> undef3349, rest remain the same}> Variables: l^0, nm^0, i^0, j^0, k^0, m^0, z^0, g^0, n^0, __const_30^0, its^0, jj^0, flag^0 Graph 4: Transitions: Variables: Precedence: Graph 0 Graph 1 Graph 2 Graph 3 Graph 4 Map Locations to Subgraph: ( 0 , 0 ) ( 3 , 1 ) ( 11 , 1 ) ( 14 , 1 ) ( 15 , 3 ) ( 18 , 1 ) ( 24 , 3 ) ( 27 , 1 ) ( 29 , 3 ) ( 32 , 1 ) ( 35 , 2 ) ( 38 , 1 ) ( 40 , 3 ) ( 42 , 3 ) ( 47 , 3 ) ( 50 , 1 ) ( 53 , 3 ) ( 55 , 1 ) ( 63 , 1 ) ( 67 , 1 ) ( 71 , 3 ) ( 75 , 1 ) ( 79 , 4 ) ( 85 , 2 ) ( 107 , 2 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.943196 Some transition disabled by a set of invariant(s): Invariant at l11: 1 + m^0 + n^0 <= j^0 + k^0 Invariant at l14: 1 + m^0 <= k^0 Invariant at l18: 1 + m^0 <= k^0 Invariant at l27: m^0 <= 1 + k^0 Invariant at l32: i^0 <= m^0 Invariant at l50: 1 + n^0 <= k^0 Invariant at l63: j^0 <= 1 + m^0 Invariant at l67: n^0 <= 1 + k^0 Invariant at l75: n^0 <= 1 + k^0 Strengthening and disabling transitions... > It's unfeasible. Removing transition: 1 + k^0, rest remain the same}> > It's unfeasible. Removing transition: 1 + k^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef6938 + undef6939, g^0 -> undef327, i^0 -> 1 + i^0, scale^0 -> undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef327, i^0 -> 1 + i^0, scale^0 -> undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef6938 + undef6939, g^0 -> undef327, i^0 -> 1 + i^0, scale^0 -> undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef327, i^0 -> 1 + i^0, scale^0 -> undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef327, scale^0 -> undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef327, scale^0 -> undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + k^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + j^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + j^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + k^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef915, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef915, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -undef957, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -undef957, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + k^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef6938 + undef6939, g^0 -> undef327, i^0 -> 1 + i^0, scale^0 -> undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef327, i^0 -> 1 + i^0, scale^0 -> undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef6938 + undef6939, g^0 -> undef327, i^0 -> 1 + i^0, scale^0 -> undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef327, i^0 -> 1 + i^0, scale^0 -> undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef327, scale^0 -> undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef327, scale^0 -> undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + k^0, scale^0 -> scale^0 + undef1341, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef7615, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -undef7657, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + k^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + j^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + j^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + k^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef6938 + undef6939, i^0 -> 1 + i^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + i^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + k^0, rest remain the same}> Checking unfeasibility... Time used: 0.703511 Some transition disabled by a set of invariant(s): Invariant at l3: g^0 <= 1 Invariant at l18: m^0 <= 1 + k^0 Invariant at l32: 1 + i^0 <= l^0 Invariant at l50: n^0 <= k^0 Invariant at l63: 1 + n^0 <= k^0 Invariant at l67: 1 + n^0 <= k^0 Invariant at l75: m^0 + n^0 <= j^0 + k^0 Strengthening and disabling transitions... > It's unfeasible. Removing transition: 1 + k^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef6938 + undef6939, i^0 -> 1 + i^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + i^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + k^0, scale^0 -> scale^0 + undef81, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef6938 + undef6939, g^0 -> undef327, i^0 -> 1 + i^0, scale^0 -> undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef327, i^0 -> 1 + i^0, scale^0 -> undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef327, scale^0 -> undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef327, scale^0 -> undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + k^0, scale^0 -> scale^0 + undef1341, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef7615, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -undef7657, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + k^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + j^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + j^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef6938 + undef6939, i^0 -> 1 + i^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + i^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + k^0, rest remain the same}> Checking unfeasibility... Time used: 1.26597 Some transition disabled by a set of invariant(s): Invariant at l3: i^0 <= n^0 Invariant at l11: i^0 <= n^0 Invariant at l14: i^0 <= n^0 Invariant at l18: i^0 <= n^0 Invariant at l27: i^0 <= n^0 Invariant at l32: l^0 <= 1 + n^0 Invariant at l50: i^0 <= k^0 Invariant at l67: j^0 <= 1 + m^0 Invariant at l75: n^0 <= 1 + k^0 Strengthening and disabling transitions... > It's unfeasible. Removing transition: undef327, scale^0 -> undef328, rest remain the same}> > It's unfeasible. Removing transition: undef327, scale^0 -> undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef6938 + undef6939, i^0 -> 1 + i^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + i^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + k^0, scale^0 -> scale^0 + undef81, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef6938 + undef6939, g^0 -> undef327, i^0 -> 1 + i^0, scale^0 -> undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef327, i^0 -> 1 + i^0, scale^0 -> undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef6938 + undef6939, g^0 -> undef327, i^0 -> 1 + i^0, scale^0 -> undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef327, i^0 -> 1 + i^0, scale^0 -> undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef327, scale^0 -> undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + k^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + j^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + j^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef915, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef915, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -undef957, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -undef957, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + k^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef6938 + undef6939, g^0 -> undef327, i^0 -> 1 + i^0, scale^0 -> undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef327, i^0 -> 1 + i^0, scale^0 -> undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef327, scale^0 -> undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + k^0, scale^0 -> scale^0 + undef1341, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef7615, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -undef7657, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + j^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + j^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef6938 + undef6939, i^0 -> 1 + i^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + i^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + k^0, rest remain the same}> Checking unfeasibility... Time used: 0.877453 Some transition disabled by a set of invariant(s): Invariant at l3: 1 + i^0 <= k^0 Invariant at l11: m^0 + n^0 <= j^0 + k^0 Invariant at l14: i^0 + m^0 <= k^0 + n^0 Invariant at l18: i^0 + m^0 <= 1 + k^0 + n^0 Invariant at l27: 1 + m^0 <= k^0 Invariant at l50: 1 + i^0 <= k^0 Invariant at l55: 1 + i^0 <= k^0 Invariant at l63: j^0 <= 1 + m^0 Invariant at l67: j^0 + n^0 <= k^0 + m^0 Invariant at l75: m^0 + n^0 <= 1 + j^0 + k^0 Strengthening and disabling transitions... > It's unfeasible. Removing transition: 1 + k^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef6938 + undef6939, i^0 -> 1 + i^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + i^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + k^0, scale^0 -> scale^0 + undef81, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef6938 + undef6939, g^0 -> undef327, i^0 -> 1 + i^0, scale^0 -> undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef327, i^0 -> 1 + i^0, scale^0 -> undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef6938 + undef6939, g^0 -> undef327, i^0 -> 1 + i^0, scale^0 -> undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef327, i^0 -> 1 + i^0, scale^0 -> undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef327, scale^0 -> undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + k^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + j^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + j^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef915, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef915, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -undef957, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -undef957, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef7615, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -undef7657, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + k^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + j^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + j^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef6938 + undef6939, i^0 -> 1 + i^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + i^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + k^0, rest remain the same}> Checking unfeasibility... Time used: 0.913695 Some transition disabled by a set of invariant(s): Invariant at l3: g^0 + i^0 <= 1 + n^0 Invariant at l11: i^0 <= 1 + n^0 Invariant at l14: i^0 <= 1 + n^0 Invariant at l18: i^0 <= n^0 Invariant at l27: i^0 <= m^0 Invariant at l50: g^0 + i^0 <= k^0 Invariant at l55: i^0 <= k^0 Invariant at l63: n^0 <= k^0 Invariant at l67: 1 + n^0 <= k^0 Invariant at l75: 1 + n^0 <= k^0 Strengthening and disabling transitions... > It's unfeasible. Removing transition: 1 + k^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef6938 + undef6939, i^0 -> 1 + i^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + i^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + k^0, scale^0 -> scale^0 + undef81, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef6938 + undef6939, g^0 -> undef327, i^0 -> 1 + i^0, scale^0 -> undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef327, i^0 -> 1 + i^0, scale^0 -> undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef6938 + undef6939, g^0 -> undef327, i^0 -> 1 + i^0, scale^0 -> undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef327, i^0 -> 1 + i^0, scale^0 -> undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef327, scale^0 -> undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + k^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + j^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + j^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef915, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef915, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -undef957, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -undef957, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef7615, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -undef7657, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + k^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + j^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + j^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef6938 + undef6939, i^0 -> 1 + i^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + i^0, rest remain the same}> Checking unfeasibility... Time used: 0.923079 Some transition disabled by a set of invariant(s): Invariant at l3: 1 + i^0 <= n^0 Invariant at l11: 1 + i^0 + m^0 <= k^0 + n^0 Invariant at l14: j^0 + m^0 <= 1 + k^0 + n^0 Invariant at l18: j^0 <= n^0 Invariant at l27: l^0 + m^0 <= k^0 + n^0 Invariant at l32: i^0 <= l^0 Invariant at l50: 1 + n^0 <= k^0 Invariant at l55: 1 + n^0 <= k^0 Invariant at l75: 1 + n^0 <= k^0 Strengthening and disabling transitions... > It's unfeasible. Removing transition: 1 + k^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef6938 + undef6939, i^0 -> 1 + i^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + i^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + k^0, scale^0 -> scale^0 + undef81, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef6938 + undef6939, g^0 -> undef327, i^0 -> 1 + i^0, scale^0 -> undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef327, i^0 -> 1 + i^0, scale^0 -> undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef6938 + undef6939, g^0 -> undef327, i^0 -> 1 + i^0, scale^0 -> undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef327, i^0 -> 1 + i^0, scale^0 -> undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef327, scale^0 -> undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + k^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + j^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + j^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef915, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef915, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -undef957, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -undef957, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef6938 + undef6939, g^0 -> undef327, i^0 -> 1 + i^0, scale^0 -> undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef327, i^0 -> 1 + i^0, scale^0 -> undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef327, scale^0 -> undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + k^0, scale^0 -> scale^0 + undef1341, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef7615, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -undef7657, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef6938 + undef6939, i^0 -> 1 + i^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + i^0, rest remain the same}> Checking unfeasibility... Time used: 1.27244 Some transition disabled by a set of invariant(s): Invariant at l3: 0 <= 1 + g^0 Invariant at l11: i^0 <= m^0 Invariant at l14: i^0 <= m^0 Invariant at l18: i^0 <= m^0 Invariant at l27: i^0 + l^0 <= k^0 + n^0 Invariant at l32: i^0 <= m^0 Invariant at l50: 1 + i^0 <= n^0 Invariant at l63: j^0 <= 1 + m^0 Invariant at l67: j^0 <= 1 + m^0 Invariant at l75: m^0 + n^0 <= 1 + j^0 + k^0 Strengthening and disabling transitions... > It's unfeasible. Removing transition: undef6938 + undef6939, g^0 -> undef327, i^0 -> 1 + i^0, scale^0 -> undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef6938 + undef6939, i^0 -> 1 + i^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + i^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + k^0, scale^0 -> scale^0 + undef81, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef327, i^0 -> 1 + i^0, scale^0 -> undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef6938 + undef6939, g^0 -> undef327, i^0 -> 1 + i^0, scale^0 -> undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef327, i^0 -> 1 + i^0, scale^0 -> undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef327, scale^0 -> undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + k^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + j^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + j^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef915, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef915, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -undef957, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -undef957, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef6938 + undef6939, g^0 -> undef327, i^0 -> 1 + i^0, scale^0 -> undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef327, i^0 -> 1 + i^0, scale^0 -> undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef327, scale^0 -> undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + k^0, scale^0 -> scale^0 + undef1341, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef7615, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -undef7657, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + j^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + j^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef6938 + undef6939, i^0 -> 1 + i^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + i^0, rest remain the same}> Checking unfeasibility... Time used: 1.3186 Some transition disabled by a set of invariant(s): Invariant at l3: 1 + m^0 <= k^0 Invariant at l11: 1 + m^0 <= k^0 Invariant at l18: 1 + i^0 <= k^0 Invariant at l32: l^0 <= 1 + i^0 Invariant at l50: 1 + n^0 <= k^0 Invariant at l55: 1 + i^0 <= n^0 Invariant at l75: 1 + m^0 <= j^0 Strengthening and disabling transitions... > It's unfeasible. Removing transition: 1 + k^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef6938 + undef6939, i^0 -> 1 + i^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + i^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + k^0, scale^0 -> scale^0 + undef81, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef6938 + undef6939, g^0 -> undef327, i^0 -> 1 + i^0, scale^0 -> undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef327, i^0 -> 1 + i^0, scale^0 -> undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef327, scale^0 -> undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef6938 + undef6939, g^0 -> undef327, i^0 -> 1 + i^0, scale^0 -> undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef327, i^0 -> 1 + i^0, scale^0 -> undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef327, scale^0 -> undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + k^0, scale^0 -> scale^0 + undef1341, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef7615, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -undef7657, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef6938 + undef6939, i^0 -> 1 + i^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + i^0, rest remain the same}> Checking unfeasibility... Time used: 4.10116 Checking conditional termination of SCC {l3, l11, l14, l18, l27, l32, l38, l50, l55, l63, l67, l75}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.077541s Ranking function: -5 - 5*i^0 + 5*n^0 New Graphs: Transitions: undef6938 + undef6939, g^0 -> undef7615, i^0 -> 1 + i^0, rest remain the same}> undef7615, i^0 -> 1 + i^0, rest remain the same}> undef7615, rest remain the same}> undef6938 + undef6939, g^0 -> -undef7657, i^0 -> 1 + i^0, rest remain the same}> -undef7657, i^0 -> 1 + i^0, rest remain the same}> -undef7657, rest remain the same}> undef6938 + undef6939, g^0 -> undef7615, i^0 -> 1 + i^0, rest remain the same}> undef7615, i^0 -> 1 + i^0, rest remain the same}> undef7615, rest remain the same}> undef6938 + undef6939, g^0 -> -undef7657, i^0 -> 1 + i^0, rest remain the same}> -undef7657, i^0 -> 1 + i^0, rest remain the same}> -undef7657, rest remain the same}> 1 + k^0, scale^0 -> scale^0 + undef81, rest remain the same}> undef6938 + undef6939, g^0 -> undef327, i^0 -> 1 + i^0, scale^0 -> undef328, rest remain the same}> undef327, i^0 -> 1 + i^0, scale^0 -> undef328, rest remain the same}> undef327, scale^0 -> undef328, rest remain the same}> 1 + j^0, rest remain the same}> 1 + j^0, rest remain the same}> undef6938 + undef6939, g^0 -> undef327, i^0 -> 1 + i^0, scale^0 -> undef328, rest remain the same}> undef327, i^0 -> 1 + i^0, scale^0 -> undef328, rest remain the same}> undef327, scale^0 -> undef328, rest remain the same}> undef915, rest remain the same}> undef915, rest remain the same}> -undef957, rest remain the same}> -undef957, rest remain the same}> undef915, rest remain the same}> undef915, rest remain the same}> -undef957, rest remain the same}> -undef957, rest remain the same}> 1 + k^0, scale^0 -> scale^0 + undef1341, rest remain the same}> undef6938 + undef6939, g^0 -> undef327, i^0 -> 1 + i^0, l^0 -> 1 + i^0, scale^0 -> undef328, rest remain the same}> undef327, i^0 -> 1 + i^0, l^0 -> 1 + i^0, scale^0 -> undef328, rest remain the same}> undef1515, l^0 -> 1 + i^0, scale^0 -> undef1516, rest remain the same}> undef6938 + undef6939, i^0 -> 1 + i^0, j^0 -> 1 + j^0, rest remain the same}> 1 + i^0, j^0 -> 1 + j^0, rest remain the same}> 1 + j^0, rest remain the same}> Variables: anorm^0, g^0, i^0, j^0, k^0, l^0, m^0, n^0, scale^0 Checking conditional termination of SCC {l3, l11, l18, l32, l38, l63}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.372705s Ranking function: -6 - 6*i^0 + 6*n^0 New Graphs: Transitions: undef7615, rest remain the same}> -undef7657, rest remain the same}> undef7615, rest remain the same}> -undef7657, rest remain the same}> 1 + k^0, scale^0 -> scale^0 + undef81, rest remain the same}> undef6938 + undef6939, g^0 -> undef327, i^0 -> 1 + i^0, j^0 -> ((0 + 1) + 0) + j^0, scale^0 -> undef328, rest remain the same}> undef327, i^0 -> 1 + i^0, j^0 -> ((0 + 1) + 0) + j^0, scale^0 -> undef328, rest remain the same}> undef327, j^0 -> ((0 + 1) + 0) + j^0, scale^0 -> undef328, rest remain the same}> 1 + j^0, rest remain the same}> undef6938 + undef6939, g^0 -> undef327, i^0 -> 1 + i^0, scale^0 -> undef328, rest remain the same}> undef327, i^0 -> 1 + i^0, scale^0 -> undef328, rest remain the same}> undef327, scale^0 -> undef328, rest remain the same}> undef6938 + undef6939, g^0 -> undef327, i^0 -> 1 + i^0, scale^0 -> undef328, rest remain the same}> undef327, i^0 -> 1 + i^0, scale^0 -> undef328, rest remain the same}> undef327, scale^0 -> undef328, rest remain the same}> undef915, rest remain the same}> undef6938 + undef6939, g^0 -> undef327, i^0 -> 1 + i^0, scale^0 -> undef328, rest remain the same}> undef327, i^0 -> 1 + i^0, scale^0 -> undef328, rest remain the same}> undef327, scale^0 -> undef328, rest remain the same}> -undef957, rest remain the same}> undef6938 + undef6939, g^0 -> undef327, i^0 -> 1 + i^0, scale^0 -> undef328, rest remain the same}> undef327, i^0 -> 1 + i^0, scale^0 -> undef328, rest remain the same}> undef327, scale^0 -> undef328, rest remain the same}> undef915, rest remain the same}> undef6938 + undef6939, g^0 -> undef327, i^0 -> 1 + i^0, scale^0 -> undef328, rest remain the same}> undef327, i^0 -> 1 + i^0, scale^0 -> undef328, rest remain the same}> undef327, scale^0 -> undef328, rest remain the same}> -undef957, rest remain the same}> 1 + k^0, scale^0 -> scale^0 + undef1341, rest remain the same}> undef6938 + undef6939, g^0 -> undef327, i^0 -> 1 + i^0, l^0 -> 1 + i^0, scale^0 -> undef328, rest remain the same}> undef327, i^0 -> 1 + i^0, l^0 -> 1 + i^0, scale^0 -> undef328, rest remain the same}> undef1515, l^0 -> 1 + i^0, scale^0 -> undef1516, rest remain the same}> undef6938 + undef6939, i^0 -> 1 + i^0, j^0 -> 1 + j^0, rest remain the same}> 1 + i^0, j^0 -> 1 + j^0, rest remain the same}> 1 + j^0, rest remain the same}> Variables: anorm^0, g^0, i^0, j^0, k^0, l^0, m^0, n^0, scale^0 Checking conditional termination of SCC {l3, l18, l32, l38, l63}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.138213s Ranking function: -13 - 10*i^0 - 6*k^0 - 3*m^0 + 19*n^0 New Graphs: Transitions: undef7615, rest remain the same}> -undef7657, rest remain the same}> undef7615, rest remain the same}> -undef7657, rest remain the same}> undef6938 + undef6939, g^0 -> undef327, i^0 -> 1 + i^0, j^0 -> ((0 + 1) + 0) + j^0, scale^0 -> undef328, rest remain the same}> undef327, i^0 -> 1 + i^0, j^0 -> ((0 + 1) + 0) + j^0, scale^0 -> undef328, rest remain the same}> undef327, j^0 -> ((0 + 1) + 0) + j^0, scale^0 -> undef328, rest remain the same}> 1 + j^0, rest remain the same}> undef6938 + undef6939, g^0 -> undef327, i^0 -> 1 + i^0, scale^0 -> undef328, rest remain the same}> undef327, i^0 -> 1 + i^0, scale^0 -> undef328, rest remain the same}> undef327, scale^0 -> undef328, rest remain the same}> undef6938 + undef6939, g^0 -> undef327, i^0 -> 1 + i^0, scale^0 -> undef328, rest remain the same}> undef327, i^0 -> 1 + i^0, scale^0 -> undef328, rest remain the same}> undef327, scale^0 -> undef328, rest remain the same}> undef915, rest remain the same}> undef6938 + undef6939, g^0 -> undef327, i^0 -> 1 + i^0, scale^0 -> undef328, rest remain the same}> undef327, i^0 -> 1 + i^0, scale^0 -> undef328, rest remain the same}> undef327, scale^0 -> undef328, rest remain the same}> -undef957, rest remain the same}> undef6938 + undef6939, g^0 -> undef327, i^0 -> 1 + i^0, scale^0 -> undef328, rest remain the same}> undef327, i^0 -> 1 + i^0, scale^0 -> undef328, rest remain the same}> undef327, scale^0 -> undef328, rest remain the same}> undef915, rest remain the same}> undef6938 + undef6939, g^0 -> undef327, i^0 -> 1 + i^0, scale^0 -> undef328, rest remain the same}> undef327, i^0 -> 1 + i^0, scale^0 -> undef328, rest remain the same}> undef327, scale^0 -> undef328, rest remain the same}> -undef957, rest remain the same}> 1 + k^0, scale^0 -> scale^0 + undef1341, rest remain the same}> undef6938 + undef6939, g^0 -> undef327, i^0 -> 1 + i^0, l^0 -> 1 + i^0, scale^0 -> undef328, rest remain the same}> undef327, i^0 -> 1 + i^0, l^0 -> 1 + i^0, scale^0 -> undef328, rest remain the same}> undef1515, l^0 -> 1 + i^0, scale^0 -> undef1516, rest remain the same}> undef6938 + undef6939, i^0 -> 1 + i^0, j^0 -> 1 + j^0, rest remain the same}> 1 + i^0, j^0 -> 1 + j^0, rest remain the same}> 1 + j^0, rest remain the same}> Variables: anorm^0, g^0, i^0, j^0, k^0, l^0, m^0, n^0, scale^0 Checking conditional termination of SCC {l3, l18, l32, l38, l63}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.108426s Ranking function: -i^0 - 8*j^0 + 18*m^0 - 9*n^0 New Graphs: Transitions: undef7615, rest remain the same}> -undef7657, rest remain the same}> undef7615, rest remain the same}> -undef7657, rest remain the same}> undef327, j^0 -> ((0 + 1) + 0) + j^0, scale^0 -> undef328, rest remain the same}> 1 + j^0, rest remain the same}> undef6938 + undef6939, g^0 -> undef327, i^0 -> 1 + i^0, scale^0 -> undef328, rest remain the same}> undef327, i^0 -> 1 + i^0, scale^0 -> undef328, rest remain the same}> undef327, scale^0 -> undef328, rest remain the same}> undef6938 + undef6939, g^0 -> undef327, i^0 -> 1 + i^0, scale^0 -> undef328, rest remain the same}> undef327, i^0 -> 1 + i^0, scale^0 -> undef328, rest remain the same}> undef327, scale^0 -> undef328, rest remain the same}> undef915, rest remain the same}> undef6938 + undef6939, g^0 -> undef327, i^0 -> 1 + i^0, scale^0 -> undef328, rest remain the same}> undef327, i^0 -> 1 + i^0, scale^0 -> undef328, rest remain the same}> undef327, scale^0 -> undef328, rest remain the same}> -undef957, rest remain the same}> undef6938 + undef6939, g^0 -> undef327, i^0 -> 1 + i^0, scale^0 -> undef328, rest remain the same}> undef327, i^0 -> 1 + i^0, scale^0 -> undef328, rest remain the same}> undef327, scale^0 -> undef328, rest remain the same}> undef915, rest remain the same}> undef6938 + undef6939, g^0 -> undef327, i^0 -> 1 + i^0, scale^0 -> undef328, rest remain the same}> undef327, i^0 -> 1 + i^0, scale^0 -> undef328, rest remain the same}> undef327, scale^0 -> undef328, rest remain the same}> -undef957, rest remain the same}> 1 + k^0, scale^0 -> scale^0 + undef1341, rest remain the same}> undef6938 + undef6939, g^0 -> undef327, i^0 -> 1 + i^0, l^0 -> 1 + i^0, scale^0 -> undef328, rest remain the same}> undef327, i^0 -> 1 + i^0, l^0 -> 1 + i^0, scale^0 -> undef328, rest remain the same}> undef1515, l^0 -> 1 + i^0, scale^0 -> undef1516, rest remain the same}> undef6938 + undef6939, i^0 -> 1 + i^0, j^0 -> 1 + j^0, rest remain the same}> 1 + i^0, j^0 -> 1 + j^0, rest remain the same}> 1 + j^0, rest remain the same}> Variables: anorm^0, g^0, i^0, j^0, k^0, l^0, m^0, n^0, scale^0 Checking conditional termination of SCC {l3, l18, l32, l38, l63}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.107339s Ranking function: -6 - 8*i^0 - 4*j^0 + 2*m^0 + 10*n^0 New Graphs: Transitions: undef7615, rest remain the same}> -undef7657, rest remain the same}> undef7615, rest remain the same}> -undef7657, rest remain the same}> undef6938 + undef6939, g^0 -> undef327, i^0 -> 1 + i^0, scale^0 -> undef328, rest remain the same}> undef327, i^0 -> 1 + i^0, scale^0 -> undef328, rest remain the same}> undef327, scale^0 -> undef328, rest remain the same}> undef6938 + undef6939, g^0 -> undef327, i^0 -> 1 + i^0, scale^0 -> undef328, rest remain the same}> undef327, i^0 -> 1 + i^0, scale^0 -> undef328, rest remain the same}> undef327, scale^0 -> undef328, rest remain the same}> undef6938 + undef6939, g^0 -> undef327, i^0 -> 1 + i^0, scale^0 -> undef328, rest remain the same}> undef327, i^0 -> 1 + i^0, scale^0 -> undef328, rest remain the same}> undef327, scale^0 -> undef328, rest remain the same}> undef6938 + undef6939, g^0 -> undef327, i^0 -> 1 + i^0, scale^0 -> undef328, rest remain the same}> undef327, i^0 -> 1 + i^0, scale^0 -> undef328, rest remain the same}> undef327, scale^0 -> undef328, rest remain the same}> undef6938 + undef6939, g^0 -> undef327, i^0 -> 1 + i^0, scale^0 -> undef328, rest remain the same}> undef327, i^0 -> 1 + i^0, scale^0 -> undef328, rest remain the same}> undef327, scale^0 -> undef328, rest remain the same}> 1 + k^0, scale^0 -> scale^0 + undef1341, rest remain the same}> undef6938 + undef6939, g^0 -> undef327, i^0 -> 1 + i^0, l^0 -> 1 + i^0, scale^0 -> undef328, rest remain the same}> undef327, i^0 -> 1 + i^0, l^0 -> 1 + i^0, scale^0 -> undef328, rest remain the same}> undef1515, l^0 -> 1 + i^0, scale^0 -> undef1516, rest remain the same}> undef6938 + undef6939, i^0 -> 1 + i^0, j^0 -> 1 + j^0, rest remain the same}> 1 + i^0, j^0 -> 1 + j^0, rest remain the same}> 1 + j^0, rest remain the same}> Variables: anorm^0, g^0, i^0, j^0, k^0, l^0, m^0, n^0, scale^0 Transitions: 1 + j^0, rest remain the same}> Variables: i^0, j^0, k^0, m^0, n^0 Checking conditional termination of SCC {l3, l32, l38, l63}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.071982s Ranking function: -i^0 + 6*m^0 - 5*n^0 New Graphs: Transitions: 1 + j^0, rest remain the same}> Variables: i^0, j^0, k^0, m^0, n^0 Transitions: undef7615, rest remain the same}> -undef7657, rest remain the same}> undef7615, rest remain the same}> -undef7657, rest remain the same}> undef327, scale^0 -> undef328, rest remain the same}> undef327, scale^0 -> undef328, rest remain the same}> undef327, scale^0 -> undef328, rest remain the same}> undef327, scale^0 -> undef328, rest remain the same}> undef327, scale^0 -> undef328, rest remain the same}> 1 + k^0, scale^0 -> scale^0 + undef1341, rest remain the same}> undef6938 + undef6939, g^0 -> undef327, i^0 -> 1 + i^0, l^0 -> 1 + i^0, scale^0 -> undef328, rest remain the same}> undef327, i^0 -> 1 + i^0, l^0 -> 1 + i^0, scale^0 -> undef328, rest remain the same}> undef1515, l^0 -> 1 + i^0, scale^0 -> undef1516, rest remain the same}> undef6938 + undef6939, i^0 -> 1 + i^0, j^0 -> 1 + j^0, rest remain the same}> 1 + i^0, j^0 -> 1 + j^0, rest remain the same}> 1 + j^0, rest remain the same}> Variables: anorm^0, g^0, i^0, j^0, k^0, l^0, m^0, n^0, scale^0 Checking conditional termination of SCC {l18}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.008850s Ranking function: -1 - j^0 + n^0 New Graphs: Transitions: undef7615, rest remain the same}> -undef7657, rest remain the same}> undef7615, rest remain the same}> -undef7657, rest remain the same}> undef327, scale^0 -> undef328, rest remain the same}> undef327, scale^0 -> undef328, rest remain the same}> undef327, scale^0 -> undef328, rest remain the same}> undef327, scale^0 -> undef328, rest remain the same}> undef327, scale^0 -> undef328, rest remain the same}> 1 + k^0, scale^0 -> scale^0 + undef1341, rest remain the same}> undef6938 + undef6939, g^0 -> undef327, i^0 -> 1 + i^0, l^0 -> 1 + i^0, scale^0 -> undef328, rest remain the same}> undef327, i^0 -> 1 + i^0, l^0 -> 1 + i^0, scale^0 -> undef328, rest remain the same}> undef1515, l^0 -> 1 + i^0, scale^0 -> undef1516, rest remain the same}> undef6938 + undef6939, i^0 -> 1 + i^0, j^0 -> 1 + j^0, rest remain the same}> 1 + i^0, j^0 -> 1 + j^0, rest remain the same}> 1 + j^0, rest remain the same}> Variables: anorm^0, g^0, i^0, j^0, k^0, l^0, m^0, n^0, scale^0 Checking conditional termination of SCC {l3, l32, l38, l63}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.037731s Ranking function: 2 - 13*i^0 - 9*k^0 + 15*m^0 + 7*n^0 It's unfeasible after collapsing. Removing transition: undef327, l^0 -> ((0 + 1) + 0) + i^0, scale^0 -> undef328, rest remain the same}> It's unfeasible after collapsing. Removing transition: undef327, l^0 -> ((0 + 1) + 0) + i^0, scale^0 -> undef328, rest remain the same}> It's unfeasible after collapsing. Removing transition: undef327, l^0 -> ((0 + 1) + 0) + i^0, scale^0 -> undef328, rest remain the same}> It's unfeasible after collapsing. Removing transition: undef327, l^0 -> ((0 + 1) + 0) + i^0, scale^0 -> undef328, rest remain the same}> New Graphs: Transitions: undef7615, rest remain the same}> -undef7657, rest remain the same}> undef7615, rest remain the same}> -undef7657, rest remain the same}> undef6938 + undef6939, g^0 -> undef327, i^0 -> 1 + i^0, l^0 -> 1 + i^0, scale^0 -> undef328, rest remain the same}> undef327, i^0 -> 1 + i^0, l^0 -> 1 + i^0, scale^0 -> undef328, rest remain the same}> undef327, l^0 -> ((0 + 1) + 0) + i^0, scale^0 -> undef328, rest remain the same}> undef6938 + undef6939, i^0 -> 1 + i^0, j^0 -> 1 + j^0, rest remain the same}> 1 + i^0, j^0 -> 1 + j^0, rest remain the same}> 1 + j^0, rest remain the same}> Variables: anorm^0, g^0, i^0, j^0, k^0, l^0, m^0, n^0, scale^0 Checking conditional termination of SCC {l3, l38, l63}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.024766s Ranking function: -3 - i^0 - 3*m^0 + 4*n^0 New Graphs: Transitions: undef7615, rest remain the same}> -undef7657, rest remain the same}> undef7615, rest remain the same}> -undef7657, rest remain the same}> ((0 + 0) + 0) + undef6938 + undef6939, g^0 -> undef327, i^0 -> ((0 + 1) + 0) + i^0, j^0 -> ((0 + 1) + 0) + j^0, l^0 -> 2 + i^0, scale^0 -> undef328, rest remain the same}> undef327, i^0 -> ((0 + 1) + 0) + i^0, j^0 -> ((0 + 1) + 0) + j^0, l^0 -> 2 + i^0, scale^0 -> undef328, rest remain the same}> 1 + j^0, rest remain the same}> Variables: anorm^0, g^0, i^0, j^0, k^0, l^0, m^0, n^0, scale^0 Checking conditional termination of SCC {l3, l63}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.023186s Ranking function: -5 - i^0 - j^0 + 4*k^0 - 3*m^0 + n^0 New Graphs: Transitions: 1 + j^0, rest remain the same}> Variables: j^0, k^0, m^0, n^0 Checking conditional termination of SCC {l63}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.008487s Ranking function: -1 - j^0 + m^0 New Graphs: Proving termination of subgraph 2 Checking unfeasibility... Time used: 0.060575 Checking conditional termination of SCC {l35, l85, l107}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.014959s Ranking function: -j^0 + n^0 New Graphs: Transitions: undef5820, i^0 -> -1 + i^0, l^0 -> i^0, rest remain the same}> undef5820, i^0 -> -1 + i^0, l^0 -> i^0, rest remain the same}> undef5820, i^0 -> -1 + i^0, l^0 -> i^0, rest remain the same}> undef5820, i^0 -> -1 + i^0, l^0 -> i^0, rest remain the same}> Variables: g^0, i^0, j^0, l^0, n^0 Checking conditional termination of SCC {l35}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.011867s Ranking function: 8*i^0 - 8*n^0 New Graphs: Transitions: undef5820, i^0 -> -1 + i^0, l^0 -> i^0, rest remain the same}> undef5820, i^0 -> -1 + i^0, l^0 -> i^0, rest remain the same}> undef5820, i^0 -> -1 + i^0, l^0 -> i^0, rest remain the same}> Variables: g^0, i^0, j^0, l^0, n^0 Checking conditional termination of SCC {l35}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.011179s Ranking function: -1 + i^0 New Graphs: Proving termination of subgraph 3 Checking unfeasibility... Time used: 4.10004 Checking conditional termination of SCC {l15, l24, l29, l40, l42, l47, l53, l71}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.115660s Ranking function: -5 + 5*l^0 New Graphs: Transitions: -1 + l^0, rest remain the same}> -1 + l^0, rest remain the same}> 0, nm^0 -> -1 + l^0, rest remain the same}> 1 + i^0, z^0 -> undef3349, rest remain the same}> 1 + i^0, z^0 -> undef3349, rest remain the same}> 1 + i^0, k^0 -> -1 + k^0, z^0 -> undef3349, rest remain the same}> 1 + i^0, z^0 -> undef3349, rest remain the same}> undef3531, i^0 -> 1 + i^0, rest remain the same}> undef3531, i^0 -> 1 + i^0, rest remain the same}> 1 + i^0, z^0 -> undef3349, rest remain the same}> 1 + i^0, z^0 -> undef3349, rest remain the same}> 1 + i^0, k^0 -> -1 + k^0, z^0 -> undef3349, rest remain the same}> 1 + i^0, z^0 -> undef3349, rest remain the same}> 1 + j^0, z^0 -> undef3481, rest remain the same}> -1 + k^0, rest remain the same}> 1 + j^0, rest remain the same}> -1 + k^0, rest remain the same}> 1, rest remain the same}> 1 + its^0, j^0 -> 1 + j^0, k^0 -> -1 + k^0, rest remain the same}> 1, its^0 -> 1 + its^0, j^0 -> 1 + j^0, rest remain the same}> undef2382, i^0 -> 2 + j^0, j^0 -> 1 + j^0, z^0 -> undef2420, rest remain the same}> 1 + jj^0, z^0 -> undef1892, rest remain the same}> undef2244, rest remain the same}> undef2024, rest remain the same}> undef2024, rest remain the same}> 1 + jj^0, z^0 -> undef2288, rest remain the same}> undef2694, its^0 -> 1 + its^0, k^0 -> -1 + k^0, nm^0 -> -1 + k^0, rest remain the same}> undef2382, i^0 -> 1 + j^0, nm^0 -> -1 + k^0, z^0 -> undef2420, rest remain the same}> undef2694, its^0 -> 1 + its^0, k^0 -> -1 + k^0, nm^0 -> -1 + k^0, rest remain the same}> undef2382, i^0 -> 1 + j^0, nm^0 -> -1 + k^0, z^0 -> undef2420, rest remain the same}> 1, g^0 -> undef2694, its^0 -> 1 + its^0, nm^0 -> -1 + k^0, rest remain the same}> undef2382, i^0 -> 1 + j^0, nm^0 -> -1 + k^0, z^0 -> undef2420, rest remain the same}> 1, g^0 -> undef2694, its^0 -> 1 + its^0, nm^0 -> -1 + k^0, rest remain the same}> undef2382, i^0 -> 1 + j^0, nm^0 -> -1 + k^0, z^0 -> undef2420, rest remain the same}> undef2694, its^0 -> 1 + its^0, k^0 -> -1 + k^0, nm^0 -> -1 + k^0, rest remain the same}> undef2382, i^0 -> 1 + j^0, nm^0 -> -1 + k^0, z^0 -> undef2420, rest remain the same}> undef2694, its^0 -> 1 + its^0, k^0 -> -1 + k^0, nm^0 -> -1 + k^0, rest remain the same}> undef2382, i^0 -> 1 + j^0, nm^0 -> -1 + k^0, z^0 -> undef2420, rest remain the same}> undef3349, rest remain the same}> undef3349, rest remain the same}> -1 + k^0, z^0 -> undef3349, rest remain the same}> undef3349, rest remain the same}> undef3349, rest remain the same}> undef3349, rest remain the same}> -1 + k^0, z^0 -> undef3349, rest remain the same}> undef3349, rest remain the same}> undef3531, rest remain the same}> undef3531, rest remain the same}> undef3349, rest remain the same}> undef3349, rest remain the same}> -1 + k^0, z^0 -> undef3349, rest remain the same}> undef3349, rest remain the same}> undef3349, rest remain the same}> undef3349, rest remain the same}> -1 + k^0, z^0 -> undef3349, rest remain the same}> undef3349, rest remain the same}> undef3531, rest remain the same}> undef3531, rest remain the same}> undef3349, rest remain the same}> undef3349, rest remain the same}> -1 + k^0, z^0 -> undef3349, rest remain the same}> undef3349, rest remain the same}> Variables: __const_30^0, flag^0, g^0, i^0, its^0, j^0, jj^0, k^0, l^0, m^0, n^0, nm^0, z^0 Checking conditional termination of SCC {l15, l24, l29, l40, l42, l47, l53, l71}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.085242s Ranking function: 1 + 4*k^0 - 4*l^0 New Graphs: Transitions: -1 + l^0, rest remain the same}> -1 + l^0, rest remain the same}> 0, nm^0 -> -1 + l^0, rest remain the same}> 1 + i^0, z^0 -> undef3349, rest remain the same}> 1 + i^0, z^0 -> undef3349, rest remain the same}> 1 + i^0, z^0 -> undef3349, rest remain the same}> undef3531, i^0 -> 1 + i^0, rest remain the same}> undef3531, i^0 -> 1 + i^0, rest remain the same}> 1 + i^0, z^0 -> undef3349, rest remain the same}> 1 + i^0, z^0 -> undef3349, rest remain the same}> 1 + i^0, z^0 -> undef3349, rest remain the same}> 1 + j^0, z^0 -> undef3481, rest remain the same}> -1 + k^0, rest remain the same}> 1 + j^0, rest remain the same}> -1 + k^0, rest remain the same}> 1, rest remain the same}> 1 + its^0, j^0 -> 1 + j^0, k^0 -> -1 + k^0, rest remain the same}> 1, its^0 -> 1 + its^0, j^0 -> 1 + j^0, rest remain the same}> undef2382, i^0 -> 2 + j^0, j^0 -> 1 + j^0, z^0 -> undef2420, rest remain the same}> 1 + jj^0, z^0 -> undef1892, rest remain the same}> undef2244, rest remain the same}> undef2024, rest remain the same}> undef2024, rest remain the same}> 1 + jj^0, z^0 -> undef2288, rest remain the same}> undef2694, its^0 -> 1 + its^0, k^0 -> -1 + k^0, nm^0 -> -1 + k^0, rest remain the same}> undef2382, i^0 -> 1 + j^0, nm^0 -> -1 + k^0, z^0 -> undef2420, rest remain the same}> undef2694, its^0 -> 1 + its^0, k^0 -> -1 + k^0, nm^0 -> -1 + k^0, rest remain the same}> undef2382, i^0 -> 1 + j^0, nm^0 -> -1 + k^0, z^0 -> undef2420, rest remain the same}> 1, g^0 -> undef2694, its^0 -> 1 + its^0, nm^0 -> -1 + k^0, rest remain the same}> undef2382, i^0 -> 1 + j^0, nm^0 -> -1 + k^0, z^0 -> undef2420, rest remain the same}> 1, g^0 -> undef2694, its^0 -> 1 + its^0, nm^0 -> -1 + k^0, rest remain the same}> undef2382, i^0 -> 1 + j^0, nm^0 -> -1 + k^0, z^0 -> undef2420, rest remain the same}> undef2694, its^0 -> 1 + its^0, k^0 -> -1 + k^0, nm^0 -> -1 + k^0, rest remain the same}> undef2382, i^0 -> 1 + j^0, nm^0 -> -1 + k^0, z^0 -> undef2420, rest remain the same}> undef2694, its^0 -> 1 + its^0, k^0 -> -1 + k^0, nm^0 -> -1 + k^0, rest remain the same}> undef2382, i^0 -> 1 + j^0, nm^0 -> -1 + k^0, z^0 -> undef2420, rest remain the same}> undef3349, rest remain the same}> undef3349, rest remain the same}> undef3349, rest remain the same}> undef3349, rest remain the same}> undef3349, rest remain the same}> undef3349, rest remain the same}> undef3531, rest remain the same}> undef3531, rest remain the same}> undef3349, rest remain the same}> undef3349, rest remain the same}> undef3349, rest remain the same}> undef3349, rest remain the same}> undef3349, rest remain the same}> undef3349, rest remain the same}> undef3531, rest remain the same}> undef3531, rest remain the same}> undef3349, rest remain the same}> undef3349, rest remain the same}> undef3349, rest remain the same}> Variables: __const_30^0, flag^0, g^0, i^0, its^0, j^0, jj^0, k^0, l^0, m^0, n^0, nm^0, z^0 Checking conditional termination of SCC {l15, l24, l29, l40, l42, l47, l53, l71}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.068331s Ranking function: 1 - 3*j^0 + 3*m^0 New Graphs: Transitions: -1 + l^0, rest remain the same}> -1 + l^0, rest remain the same}> 0, nm^0 -> -1 + l^0, rest remain the same}> 1 + i^0, z^0 -> undef3349, rest remain the same}> 1 + i^0, z^0 -> undef3349, rest remain the same}> 1 + i^0, z^0 -> undef3349, rest remain the same}> undef3531, i^0 -> 1 + i^0, rest remain the same}> undef3531, i^0 -> 1 + i^0, rest remain the same}> 1 + i^0, z^0 -> undef3349, rest remain the same}> 1 + i^0, z^0 -> undef3349, rest remain the same}> 1 + i^0, z^0 -> undef3349, rest remain the same}> -1 + k^0, rest remain the same}> 1 + j^0, rest remain the same}> -1 + k^0, rest remain the same}> 1, rest remain the same}> 1 + its^0, j^0 -> 1 + j^0, k^0 -> -1 + k^0, rest remain the same}> 1, its^0 -> 1 + its^0, j^0 -> 1 + j^0, rest remain the same}> undef2382, i^0 -> 2 + j^0, j^0 -> 1 + j^0, z^0 -> undef2420, rest remain the same}> 1 + jj^0, z^0 -> undef1892, rest remain the same}> undef2244, rest remain the same}> undef2024, rest remain the same}> undef2024, rest remain the same}> 1 + jj^0, z^0 -> undef2288, rest remain the same}> undef2694, its^0 -> 1 + its^0, k^0 -> -1 + k^0, nm^0 -> -1 + k^0, rest remain the same}> undef2382, i^0 -> 1 + j^0, nm^0 -> -1 + k^0, z^0 -> undef2420, rest remain the same}> undef2694, its^0 -> 1 + its^0, k^0 -> -1 + k^0, nm^0 -> -1 + k^0, rest remain the same}> undef2382, i^0 -> 1 + j^0, nm^0 -> -1 + k^0, z^0 -> undef2420, rest remain the same}> 1, g^0 -> undef2694, its^0 -> 1 + its^0, nm^0 -> -1 + k^0, rest remain the same}> undef2382, i^0 -> 1 + j^0, nm^0 -> -1 + k^0, z^0 -> undef2420, rest remain the same}> 1, g^0 -> undef2694, its^0 -> 1 + its^0, nm^0 -> -1 + k^0, rest remain the same}> undef2382, i^0 -> 1 + j^0, nm^0 -> -1 + k^0, z^0 -> undef2420, rest remain the same}> undef2694, its^0 -> 1 + its^0, k^0 -> -1 + k^0, nm^0 -> -1 + k^0, rest remain the same}> undef2382, i^0 -> 1 + j^0, nm^0 -> -1 + k^0, z^0 -> undef2420, rest remain the same}> undef2694, its^0 -> 1 + its^0, k^0 -> -1 + k^0, nm^0 -> -1 + k^0, rest remain the same}> undef2382, i^0 -> 1 + j^0, nm^0 -> -1 + k^0, z^0 -> undef2420, rest remain the same}> undef3349, rest remain the same}> undef3349, rest remain the same}> undef3349, rest remain the same}> undef3349, rest remain the same}> undef3349, rest remain the same}> undef3349, rest remain the same}> undef3531, rest remain the same}> undef3531, rest remain the same}> undef3349, rest remain the same}> undef3349, rest remain the same}> undef3349, rest remain the same}> undef3349, rest remain the same}> undef3349, rest remain the same}> undef3349, rest remain the same}> undef3531, rest remain the same}> undef3531, rest remain the same}> undef3349, rest remain the same}> undef3349, rest remain the same}> undef3349, rest remain the same}> Variables: __const_30^0, flag^0, g^0, i^0, its^0, j^0, jj^0, k^0, l^0, m^0, n^0, nm^0, z^0 Checking conditional termination of SCC {l15, l24, l29, l40, l42, l47, l53, l71}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.074467s Ranking function: -4 + 4*k^0 It's unfeasible after collapsing. Removing transition: 1, its^0 -> ((0 + 1) + 0) + its^0, j^0 -> ((0 + 1) + 0) + j^0, k^0 -> ((0 + ~(1)) + 0) + k^0, rest remain the same}> It's unfeasible after collapsing. Removing transition: 1, g^0 -> undef2694, its^0 -> ((0 + 1) + 0) + its^0, k^0 -> ((0 + ~(1)) + 0) + k^0, nm^0 -> ((0 + ~(1)) + 0) + k^0, rest remain the same}> It's unfeasible after collapsing. Removing transition: 1, g^0 -> undef2694, its^0 -> ((0 + 1) + 0) + its^0, k^0 -> ((0 + ~(1)) + 0) + k^0, nm^0 -> ((0 + ~(1)) + 0) + k^0, rest remain the same}> It's unfeasible after collapsing. Removing transition: 1, g^0 -> undef2694, its^0 -> ((0 + 1) + 0) + its^0, k^0 -> ((0 + ~(1)) + 0) + k^0, nm^0 -> ((0 + ~(1)) + 0) + k^0, rest remain the same}> It's unfeasible after collapsing. Removing transition: 1, g^0 -> undef2694, its^0 -> ((0 + 1) + 0) + its^0, k^0 -> ((0 + ~(1)) + 0) + k^0, nm^0 -> ((0 + ~(1)) + 0) + k^0, rest remain the same}> New Graphs: Transitions: -1 + l^0, rest remain the same}> -1 + l^0, rest remain the same}> 0, nm^0 -> -1 + l^0, rest remain the same}> 1 + i^0, z^0 -> undef3349, rest remain the same}> 1 + i^0, z^0 -> undef3349, rest remain the same}> 1 + i^0, z^0 -> undef3349, rest remain the same}> undef3531, i^0 -> 1 + i^0, rest remain the same}> undef3531, i^0 -> 1 + i^0, rest remain the same}> 1 + i^0, z^0 -> undef3349, rest remain the same}> 1 + i^0, z^0 -> undef3349, rest remain the same}> 1 + i^0, z^0 -> undef3349, rest remain the same}> 1, k^0 -> ((0 + ~(1)) + 0) + k^0, rest remain the same}> 1 + j^0, rest remain the same}> 1, its^0 -> 1 + its^0, j^0 -> 1 + j^0, rest remain the same}> undef2382, i^0 -> 2 + j^0, j^0 -> 1 + j^0, z^0 -> undef2420, rest remain the same}> 1 + jj^0, z^0 -> undef1892, rest remain the same}> undef2244, rest remain the same}> undef2024, rest remain the same}> undef2024, rest remain the same}> 1 + jj^0, z^0 -> undef2288, rest remain the same}> undef2382, i^0 -> 1 + j^0, nm^0 -> -1 + k^0, z^0 -> undef2420, rest remain the same}> undef2382, i^0 -> 1 + j^0, nm^0 -> -1 + k^0, z^0 -> undef2420, rest remain the same}> 1, g^0 -> undef2694, its^0 -> 1 + its^0, nm^0 -> -1 + k^0, rest remain the same}> undef2382, i^0 -> 1 + j^0, nm^0 -> -1 + k^0, z^0 -> undef2420, rest remain the same}> 1, g^0 -> undef2694, its^0 -> 1 + its^0, nm^0 -> -1 + k^0, rest remain the same}> undef2382, i^0 -> 1 + j^0, nm^0 -> -1 + k^0, z^0 -> undef2420, rest remain the same}> undef2382, i^0 -> 1 + j^0, nm^0 -> -1 + k^0, z^0 -> undef2420, rest remain the same}> undef2382, i^0 -> 1 + j^0, nm^0 -> -1 + k^0, z^0 -> undef2420, rest remain the same}> undef3349, rest remain the same}> undef3349, rest remain the same}> undef3349, rest remain the same}> undef3349, rest remain the same}> undef3349, rest remain the same}> undef3349, rest remain the same}> undef3531, rest remain the same}> undef3531, rest remain the same}> undef3349, rest remain the same}> undef3349, rest remain the same}> undef3349, rest remain the same}> undef3349, rest remain the same}> undef3349, rest remain the same}> undef3349, rest remain the same}> undef3531, rest remain the same}> undef3531, rest remain the same}> undef3349, rest remain the same}> undef3349, rest remain the same}> undef3349, rest remain the same}> Variables: __const_30^0, flag^0, g^0, i^0, its^0, j^0, jj^0, k^0, l^0, m^0, n^0, nm^0, z^0 Checking conditional termination of SCC {l15, l24, l29, l42, l47, l53, l71}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.063678s Ranking function: -10 + 5*k^0 New Graphs: Transitions: -1 + l^0, rest remain the same}> -1 + l^0, rest remain the same}> 0, nm^0 -> -1 + l^0, rest remain the same}> 1 + i^0, z^0 -> undef3349, rest remain the same}> 1 + i^0, z^0 -> undef3349, rest remain the same}> undef3531, i^0 -> 1 + i^0, rest remain the same}> undef3531, i^0 -> 1 + i^0, rest remain the same}> 1 + i^0, z^0 -> undef3349, rest remain the same}> 1 + i^0, z^0 -> undef3349, rest remain the same}> 1, its^0 -> 1 + its^0, j^0 -> 1 + j^0, rest remain the same}> undef2382, i^0 -> 2 + j^0, j^0 -> 1 + j^0, z^0 -> undef2420, rest remain the same}> 1 + jj^0, z^0 -> undef1892, rest remain the same}> undef2244, rest remain the same}> undef2024, rest remain the same}> undef2024, rest remain the same}> 1 + jj^0, z^0 -> undef2288, rest remain the same}> undef2382, i^0 -> 1 + j^0, nm^0 -> -1 + k^0, z^0 -> undef2420, rest remain the same}> undef2382, i^0 -> 1 + j^0, nm^0 -> -1 + k^0, z^0 -> undef2420, rest remain the same}> 1, g^0 -> undef2694, its^0 -> 1 + its^0, nm^0 -> -1 + k^0, rest remain the same}> undef2382, i^0 -> 1 + j^0, nm^0 -> -1 + k^0, z^0 -> undef2420, rest remain the same}> 1, g^0 -> undef2694, its^0 -> 1 + its^0, nm^0 -> -1 + k^0, rest remain the same}> undef2382, i^0 -> 1 + j^0, nm^0 -> -1 + k^0, z^0 -> undef2420, rest remain the same}> undef2382, i^0 -> 1 + j^0, nm^0 -> -1 + k^0, z^0 -> undef2420, rest remain the same}> undef2382, i^0 -> 1 + j^0, nm^0 -> -1 + k^0, z^0 -> undef2420, rest remain the same}> undef3349, rest remain the same}> undef3349, rest remain the same}> undef3349, rest remain the same}> undef3349, rest remain the same}> undef3531, rest remain the same}> undef3531, rest remain the same}> undef3349, rest remain the same}> undef3349, rest remain the same}> undef3349, rest remain the same}> undef3349, rest remain the same}> undef3531, rest remain the same}> undef3531, rest remain the same}> undef3349, rest remain the same}> undef3349, rest remain the same}> Variables: __const_30^0, flag^0, g^0, i^0, its^0, j^0, jj^0, k^0, l^0, m^0, n^0, nm^0, z^0 Transitions: 1 + j^0, rest remain the same}> Variables: j^0, n^0 Checking conditional termination of SCC {l15, l24, l42, l47, l53, l71}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.054485s Ranking function: -3*jj^0 + 3*m^0 New Graphs: Transitions: 1 + j^0, rest remain the same}> Variables: j^0, n^0 Transitions: -1 + l^0, rest remain the same}> -1 + l^0, rest remain the same}> 0, nm^0 -> -1 + l^0, rest remain the same}> 1 + i^0, z^0 -> undef3349, rest remain the same}> 1 + i^0, z^0 -> undef3349, rest remain the same}> undef3531, i^0 -> 1 + i^0, rest remain the same}> undef3531, i^0 -> 1 + i^0, rest remain the same}> 1 + i^0, z^0 -> undef3349, rest remain the same}> 1 + i^0, z^0 -> undef3349, rest remain the same}> 1, its^0 -> 1 + its^0, j^0 -> 1 + j^0, z^0 -> undef2244, rest remain the same}> undef2382, i^0 -> 2 + j^0, j^0 -> 1 + j^0, z^0 -> undef2420, rest remain the same}> 1, its^0 -> 1 + its^0, j^0 -> 1 + j^0, z^0 -> undef2024, rest remain the same}> undef2382, i^0 -> 2 + j^0, j^0 -> 1 + j^0, z^0 -> undef2420, rest remain the same}> 1, its^0 -> 1 + its^0, j^0 -> 1 + j^0, z^0 -> undef2024, rest remain the same}> undef2382, i^0 -> 2 + j^0, j^0 -> 1 + j^0, z^0 -> undef2420, rest remain the same}> 1 + jj^0, z^0 -> undef2288, rest remain the same}> undef2382, i^0 -> 1 + j^0, nm^0 -> -1 + k^0, z^0 -> undef2420, rest remain the same}> undef2382, i^0 -> 1 + j^0, nm^0 -> -1 + k^0, z^0 -> undef2420, rest remain the same}> 1, g^0 -> undef2694, its^0 -> 1 + its^0, nm^0 -> -1 + k^0, rest remain the same}> undef2382, i^0 -> 1 + j^0, nm^0 -> -1 + k^0, z^0 -> undef2420, rest remain the same}> 1, g^0 -> undef2694, its^0 -> 1 + its^0, nm^0 -> -1 + k^0, rest remain the same}> undef2382, i^0 -> 1 + j^0, nm^0 -> -1 + k^0, z^0 -> undef2420, rest remain the same}> undef2382, i^0 -> 1 + j^0, nm^0 -> -1 + k^0, z^0 -> undef2420, rest remain the same}> undef2382, i^0 -> 1 + j^0, nm^0 -> -1 + k^0, z^0 -> undef2420, rest remain the same}> undef3349, rest remain the same}> undef3349, rest remain the same}> undef3349, rest remain the same}> undef3349, rest remain the same}> undef3531, rest remain the same}> undef3531, rest remain the same}> undef3349, rest remain the same}> undef3349, rest remain the same}> undef3349, rest remain the same}> undef3349, rest remain the same}> undef3531, rest remain the same}> undef3531, rest remain the same}> undef3349, rest remain the same}> undef3349, rest remain the same}> Variables: __const_30^0, flag^0, g^0, i^0, its^0, j^0, jj^0, k^0, l^0, m^0, n^0, nm^0, z^0 Checking conditional termination of SCC {l29}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.011497s Ranking function: -j^0 + n^0 New Graphs: Transitions: -1 + l^0, rest remain the same}> -1 + l^0, rest remain the same}> 0, nm^0 -> -1 + l^0, rest remain the same}> 1 + i^0, z^0 -> undef3349, rest remain the same}> 1 + i^0, z^0 -> undef3349, rest remain the same}> undef3531, i^0 -> 1 + i^0, rest remain the same}> undef3531, i^0 -> 1 + i^0, rest remain the same}> 1 + i^0, z^0 -> undef3349, rest remain the same}> 1 + i^0, z^0 -> undef3349, rest remain the same}> 1, its^0 -> 1 + its^0, j^0 -> 1 + j^0, z^0 -> undef2244, rest remain the same}> undef2382, i^0 -> 2 + j^0, j^0 -> 1 + j^0, z^0 -> undef2420, rest remain the same}> 1, its^0 -> 1 + its^0, j^0 -> 1 + j^0, z^0 -> undef2024, rest remain the same}> undef2382, i^0 -> 2 + j^0, j^0 -> 1 + j^0, z^0 -> undef2420, rest remain the same}> 1, its^0 -> 1 + its^0, j^0 -> 1 + j^0, z^0 -> undef2024, rest remain the same}> undef2382, i^0 -> 2 + j^0, j^0 -> 1 + j^0, z^0 -> undef2420, rest remain the same}> 1 + jj^0, z^0 -> undef2288, rest remain the same}> undef2382, i^0 -> 1 + j^0, nm^0 -> -1 + k^0, z^0 -> undef2420, rest remain the same}> undef2382, i^0 -> 1 + j^0, nm^0 -> -1 + k^0, z^0 -> undef2420, rest remain the same}> 1, g^0 -> undef2694, its^0 -> 1 + its^0, nm^0 -> -1 + k^0, rest remain the same}> undef2382, i^0 -> 1 + j^0, nm^0 -> -1 + k^0, z^0 -> undef2420, rest remain the same}> 1, g^0 -> undef2694, its^0 -> 1 + its^0, nm^0 -> -1 + k^0, rest remain the same}> undef2382, i^0 -> 1 + j^0, nm^0 -> -1 + k^0, z^0 -> undef2420, rest remain the same}> undef2382, i^0 -> 1 + j^0, nm^0 -> -1 + k^0, z^0 -> undef2420, rest remain the same}> undef2382, i^0 -> 1 + j^0, nm^0 -> -1 + k^0, z^0 -> undef2420, rest remain the same}> undef3349, rest remain the same}> undef3349, rest remain the same}> undef3349, rest remain the same}> undef3349, rest remain the same}> undef3531, rest remain the same}> undef3531, rest remain the same}> undef3349, rest remain the same}> undef3349, rest remain the same}> undef3349, rest remain the same}> undef3349, rest remain the same}> undef3531, rest remain the same}> undef3531, rest remain the same}> undef3349, rest remain the same}> undef3349, rest remain the same}> Variables: __const_30^0, flag^0, g^0, i^0, its^0, j^0, jj^0, k^0, l^0, m^0, n^0, nm^0, z^0 Checking conditional termination of SCC {l15, l24, l47, l53, l71}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.053455s Ranking function: 2 - jj^0 + n^0 New Graphs: Transitions: -1 + l^0, rest remain the same}> -1 + l^0, rest remain the same}> 0, nm^0 -> -1 + l^0, rest remain the same}> 1 + i^0, z^0 -> undef3349, rest remain the same}> 1 + i^0, z^0 -> undef3349, rest remain the same}> undef3531, i^0 -> 1 + i^0, rest remain the same}> undef3531, i^0 -> 1 + i^0, rest remain the same}> 1 + i^0, z^0 -> undef3349, rest remain the same}> 1 + i^0, z^0 -> undef3349, rest remain the same}> 1, its^0 -> 1 + its^0, j^0 -> 1 + j^0, z^0 -> undef2244, rest remain the same}> undef2382, i^0 -> 2 + j^0, j^0 -> 1 + j^0, z^0 -> undef2420, rest remain the same}> 1, its^0 -> 1 + its^0, j^0 -> 1 + j^0, z^0 -> undef2024, rest remain the same}> undef2382, i^0 -> 2 + j^0, j^0 -> 1 + j^0, z^0 -> undef2420, rest remain the same}> 1, its^0 -> 1 + its^0, j^0 -> 1 + j^0, z^0 -> undef2024, rest remain the same}> undef2382, i^0 -> 2 + j^0, j^0 -> 1 + j^0, z^0 -> undef2420, rest remain the same}> undef2382, i^0 -> 1 + j^0, nm^0 -> -1 + k^0, z^0 -> undef2420, rest remain the same}> undef2382, i^0 -> 1 + j^0, nm^0 -> -1 + k^0, z^0 -> undef2420, rest remain the same}> 1, g^0 -> undef2694, its^0 -> 1 + its^0, nm^0 -> -1 + k^0, rest remain the same}> undef2382, i^0 -> 1 + j^0, nm^0 -> -1 + k^0, z^0 -> undef2420, rest remain the same}> 1, g^0 -> undef2694, its^0 -> 1 + its^0, nm^0 -> -1 + k^0, rest remain the same}> undef2382, i^0 -> 1 + j^0, nm^0 -> -1 + k^0, z^0 -> undef2420, rest remain the same}> undef2382, i^0 -> 1 + j^0, nm^0 -> -1 + k^0, z^0 -> undef2420, rest remain the same}> undef2382, i^0 -> 1 + j^0, nm^0 -> -1 + k^0, z^0 -> undef2420, rest remain the same}> undef3349, rest remain the same}> undef3349, rest remain the same}> undef3349, rest remain the same}> undef3349, rest remain the same}> undef3531, rest remain the same}> undef3531, rest remain the same}> undef3349, rest remain the same}> undef3349, rest remain the same}> undef3349, rest remain the same}> undef3349, rest remain the same}> undef3531, rest remain the same}> undef3531, rest remain the same}> undef3349, rest remain the same}> undef3349, rest remain the same}> Variables: __const_30^0, flag^0, g^0, i^0, its^0, j^0, jj^0, k^0, l^0, m^0, n^0, nm^0, z^0 Checking conditional termination of SCC {l15, l24, l47, l53, l71}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.052923s Ranking function: -9 + 4*__const_30^0 - 4*its^0 + 5*jj^0 - 5*n^0 New Graphs: Transitions: -1 + l^0, rest remain the same}> -1 + l^0, rest remain the same}> 0, nm^0 -> -1 + l^0, rest remain the same}> 1, g^0 -> undef2694, i^0 -> ((0 + 1) + 0) + i^0, its^0 -> 1 + its^0, nm^0 -> -1 + k^0, z^0 -> undef3349, rest remain the same}> 1, g^0 -> undef2694, i^0 -> ((0 + 1) + 0) + i^0, its^0 -> 1 + its^0, nm^0 -> -1 + k^0, z^0 -> undef3349, rest remain the same}> 1, g^0 -> undef2694, i^0 -> ((0 + 1) + 0) + i^0, its^0 -> 1 + its^0, nm^0 -> -1 + k^0, z^0 -> undef3349, rest remain the same}> 1, g^0 -> undef2694, i^0 -> ((0 + 1) + 0) + i^0, its^0 -> 1 + its^0, nm^0 -> -1 + k^0, z^0 -> undef3349, rest remain the same}> undef3531, i^0 -> 1 + i^0, rest remain the same}> undef3531, i^0 -> 1 + i^0, rest remain the same}> 1, g^0 -> undef2694, i^0 -> ((0 + 1) + 0) + i^0, its^0 -> 1 + its^0, nm^0 -> -1 + k^0, z^0 -> undef3349, rest remain the same}> 1, g^0 -> undef2694, i^0 -> ((0 + 1) + 0) + i^0, its^0 -> 1 + its^0, nm^0 -> -1 + k^0, z^0 -> undef3349, rest remain the same}> 1, g^0 -> undef2694, i^0 -> ((0 + 1) + 0) + i^0, its^0 -> 1 + its^0, nm^0 -> -1 + k^0, z^0 -> undef3349, rest remain the same}> 1, g^0 -> undef2694, i^0 -> ((0 + 1) + 0) + i^0, its^0 -> 1 + its^0, nm^0 -> -1 + k^0, z^0 -> undef3349, rest remain the same}> 1, g^0 -> undef2694, its^0 -> 1 + its^0, nm^0 -> -1 + k^0, z^0 -> undef3349, rest remain the same}> 1, g^0 -> undef2694, its^0 -> 1 + its^0, nm^0 -> -1 + k^0, z^0 -> undef3349, rest remain the same}> 1, g^0 -> undef2694, its^0 -> 1 + its^0, nm^0 -> -1 + k^0, z^0 -> undef3349, rest remain the same}> 1, g^0 -> undef2694, its^0 -> 1 + its^0, nm^0 -> -1 + k^0, z^0 -> undef3349, rest remain the same}> 1, g^0 -> undef2694, its^0 -> 1 + its^0, nm^0 -> -1 + k^0, z^0 -> undef3349, rest remain the same}> 1, g^0 -> undef2694, its^0 -> 1 + its^0, nm^0 -> -1 + k^0, z^0 -> undef3349, rest remain the same}> 1, g^0 -> undef2694, its^0 -> 1 + its^0, nm^0 -> -1 + k^0, z^0 -> undef3349, rest remain the same}> 1, g^0 -> undef2694, its^0 -> 1 + its^0, nm^0 -> -1 + k^0, z^0 -> undef3349, rest remain the same}> undef3531, rest remain the same}> undef3531, rest remain the same}> 1, g^0 -> undef2694, its^0 -> 1 + its^0, nm^0 -> -1 + k^0, z^0 -> undef3349, rest remain the same}> 1, g^0 -> undef2694, its^0 -> 1 + its^0, nm^0 -> -1 + k^0, z^0 -> undef3349, rest remain the same}> 1, g^0 -> undef2694, its^0 -> 1 + its^0, nm^0 -> -1 + k^0, z^0 -> undef3349, rest remain the same}> 1, g^0 -> undef2694, its^0 -> 1 + its^0, nm^0 -> -1 + k^0, z^0 -> undef3349, rest remain the same}> 1, g^0 -> undef2694, its^0 -> 1 + its^0, nm^0 -> -1 + k^0, z^0 -> undef3349, rest remain the same}> 1, g^0 -> undef2694, its^0 -> 1 + its^0, nm^0 -> -1 + k^0, z^0 -> undef3349, rest remain the same}> 1, g^0 -> undef2694, its^0 -> 1 + its^0, nm^0 -> -1 + k^0, z^0 -> undef3349, rest remain the same}> 1, g^0 -> undef2694, its^0 -> 1 + its^0, nm^0 -> -1 + k^0, z^0 -> undef3349, rest remain the same}> undef3531, rest remain the same}> undef3531, rest remain the same}> 1, g^0 -> undef2694, its^0 -> 1 + its^0, nm^0 -> -1 + k^0, z^0 -> undef3349, rest remain the same}> 1, g^0 -> undef2694, its^0 -> 1 + its^0, nm^0 -> -1 + k^0, z^0 -> undef3349, rest remain the same}> 1, g^0 -> undef2694, its^0 -> 1 + its^0, nm^0 -> -1 + k^0, z^0 -> undef3349, rest remain the same}> 1, g^0 -> undef2694, its^0 -> 1 + its^0, nm^0 -> -1 + k^0, z^0 -> undef3349, rest remain the same}> Variables: __const_30^0, flag^0, g^0, i^0, its^0, j^0, k^0, l^0, m^0, nm^0, z^0 Transitions: undef2382, i^0 -> 2 + j^0, j^0 -> 1 + j^0, z^0 -> undef2420, rest remain the same}> undef2382, i^0 -> 2 + j^0, j^0 -> 1 + j^0, z^0 -> undef2420, rest remain the same}> undef2382, i^0 -> 2 + j^0, j^0 -> 1 + j^0, z^0 -> undef2420, rest remain the same}> Variables: g^0, i^0, j^0, jj^0, m^0, n^0, nm^0, z^0 Checking conditional termination of SCC {l15, l24, l71}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.106596s Ranking function: -4 + __const_30^0 - its^0 + j^0 - 4*k^0 + 4*l^0 - m^0 New Graphs: Transitions: undef2382, i^0 -> 2 + j^0, j^0 -> 1 + j^0, z^0 -> undef2420, rest remain the same}> undef2382, i^0 -> 2 + j^0, j^0 -> 1 + j^0, z^0 -> undef2420, rest remain the same}> undef2382, i^0 -> 2 + j^0, j^0 -> 1 + j^0, z^0 -> undef2420, rest remain the same}> Variables: g^0, i^0, j^0, jj^0, m^0, n^0, nm^0, z^0 Transitions: -1 + l^0, rest remain the same}> -1 + l^0, rest remain the same}> 0, nm^0 -> -1 + l^0, rest remain the same}> 1, g^0 -> undef2694, i^0 -> ((0 + 1) + 0) + i^0, its^0 -> 1 + its^0, nm^0 -> -1 + k^0, z^0 -> undef3349, rest remain the same}> 1, g^0 -> undef2694, i^0 -> ((0 + 1) + 0) + i^0, its^0 -> 1 + its^0, nm^0 -> -1 + k^0, z^0 -> undef3349, rest remain the same}> undef3531, i^0 -> 1 + i^0, rest remain the same}> undef3531, i^0 -> 1 + i^0, rest remain the same}> 1, g^0 -> undef2694, i^0 -> ((0 + 1) + 0) + i^0, its^0 -> 1 + its^0, nm^0 -> -1 + k^0, z^0 -> undef3349, rest remain the same}> 1, g^0 -> undef2694, i^0 -> ((0 + 1) + 0) + i^0, its^0 -> 1 + its^0, nm^0 -> -1 + k^0, z^0 -> undef3349, rest remain the same}> 1, g^0 -> undef2694, its^0 -> 1 + its^0, nm^0 -> -1 + k^0, z^0 -> undef3349, rest remain the same}> 1, g^0 -> undef2694, its^0 -> 1 + its^0, nm^0 -> -1 + k^0, z^0 -> undef3349, rest remain the same}> 1, g^0 -> undef2694, its^0 -> 1 + its^0, nm^0 -> -1 + k^0, z^0 -> undef3349, rest remain the same}> 1, g^0 -> undef2694, its^0 -> 1 + its^0, nm^0 -> -1 + k^0, z^0 -> undef3349, rest remain the same}> 1, g^0 -> undef2694, its^0 -> 1 + its^0, nm^0 -> -1 + k^0, z^0 -> undef3349, rest remain the same}> 1, g^0 -> undef2694, its^0 -> 1 + its^0, nm^0 -> -1 + k^0, z^0 -> undef3349, rest remain the same}> 1, g^0 -> undef2694, its^0 -> 1 + its^0, nm^0 -> -1 + k^0, z^0 -> undef3349, rest remain the same}> 1, g^0 -> undef2694, its^0 -> 1 + its^0, nm^0 -> -1 + k^0, z^0 -> undef3349, rest remain the same}> undef3531, rest remain the same}> undef3531, rest remain the same}> 1, g^0 -> undef2694, its^0 -> 1 + its^0, nm^0 -> -1 + k^0, z^0 -> undef3349, rest remain the same}> 1, g^0 -> undef2694, its^0 -> 1 + its^0, nm^0 -> -1 + k^0, z^0 -> undef3349, rest remain the same}> 1, g^0 -> undef2694, its^0 -> 1 + its^0, nm^0 -> -1 + k^0, z^0 -> undef3349, rest remain the same}> 1, g^0 -> undef2694, its^0 -> 1 + its^0, nm^0 -> -1 + k^0, z^0 -> undef3349, rest remain the same}> 1, g^0 -> undef2694, its^0 -> 1 + its^0, nm^0 -> -1 + k^0, z^0 -> undef3349, rest remain the same}> 1, g^0 -> undef2694, its^0 -> 1 + its^0, nm^0 -> -1 + k^0, z^0 -> undef3349, rest remain the same}> 1, g^0 -> undef2694, its^0 -> 1 + its^0, nm^0 -> -1 + k^0, z^0 -> undef3349, rest remain the same}> 1, g^0 -> undef2694, its^0 -> 1 + its^0, nm^0 -> -1 + k^0, z^0 -> undef3349, rest remain the same}> undef3531, rest remain the same}> undef3531, rest remain the same}> 1, g^0 -> undef2694, its^0 -> 1 + its^0, nm^0 -> -1 + k^0, z^0 -> undef3349, rest remain the same}> 1, g^0 -> undef2694, its^0 -> 1 + its^0, nm^0 -> -1 + k^0, z^0 -> undef3349, rest remain the same}> 1, g^0 -> undef2694, its^0 -> 1 + its^0, nm^0 -> -1 + k^0, z^0 -> undef3349, rest remain the same}> 1, g^0 -> undef2694, its^0 -> 1 + its^0, nm^0 -> -1 + k^0, z^0 -> undef3349, rest remain the same}> Variables: __const_30^0, flag^0, g^0, i^0, its^0, j^0, k^0, l^0, m^0, nm^0, z^0 Checking conditional termination of SCC {l47}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.013727s Ranking function: -1 - j^0 + nm^0 New Graphs: Transitions: -1 + l^0, rest remain the same}> -1 + l^0, rest remain the same}> 0, nm^0 -> -1 + l^0, rest remain the same}> 1, g^0 -> undef2694, i^0 -> ((0 + 1) + 0) + i^0, its^0 -> 1 + its^0, nm^0 -> -1 + k^0, z^0 -> undef3349, rest remain the same}> 1, g^0 -> undef2694, i^0 -> ((0 + 1) + 0) + i^0, its^0 -> 1 + its^0, nm^0 -> -1 + k^0, z^0 -> undef3349, rest remain the same}> undef3531, i^0 -> 1 + i^0, rest remain the same}> undef3531, i^0 -> 1 + i^0, rest remain the same}> 1, g^0 -> undef2694, i^0 -> ((0 + 1) + 0) + i^0, its^0 -> 1 + its^0, nm^0 -> -1 + k^0, z^0 -> undef3349, rest remain the same}> 1, g^0 -> undef2694, i^0 -> ((0 + 1) + 0) + i^0, its^0 -> 1 + its^0, nm^0 -> -1 + k^0, z^0 -> undef3349, rest remain the same}> 1, g^0 -> undef2694, its^0 -> 1 + its^0, nm^0 -> -1 + k^0, z^0 -> undef3349, rest remain the same}> 1, g^0 -> undef2694, its^0 -> 1 + its^0, nm^0 -> -1 + k^0, z^0 -> undef3349, rest remain the same}> 1, g^0 -> undef2694, its^0 -> 1 + its^0, nm^0 -> -1 + k^0, z^0 -> undef3349, rest remain the same}> 1, g^0 -> undef2694, its^0 -> 1 + its^0, nm^0 -> -1 + k^0, z^0 -> undef3349, rest remain the same}> 1, g^0 -> undef2694, its^0 -> 1 + its^0, nm^0 -> -1 + k^0, z^0 -> undef3349, rest remain the same}> 1, g^0 -> undef2694, its^0 -> 1 + its^0, nm^0 -> -1 + k^0, z^0 -> undef3349, rest remain the same}> 1, g^0 -> undef2694, its^0 -> 1 + its^0, nm^0 -> -1 + k^0, z^0 -> undef3349, rest remain the same}> 1, g^0 -> undef2694, its^0 -> 1 + its^0, nm^0 -> -1 + k^0, z^0 -> undef3349, rest remain the same}> undef3531, rest remain the same}> undef3531, rest remain the same}> 1, g^0 -> undef2694, its^0 -> 1 + its^0, nm^0 -> -1 + k^0, z^0 -> undef3349, rest remain the same}> 1, g^0 -> undef2694, its^0 -> 1 + its^0, nm^0 -> -1 + k^0, z^0 -> undef3349, rest remain the same}> 1, g^0 -> undef2694, its^0 -> 1 + its^0, nm^0 -> -1 + k^0, z^0 -> undef3349, rest remain the same}> 1, g^0 -> undef2694, its^0 -> 1 + its^0, nm^0 -> -1 + k^0, z^0 -> undef3349, rest remain the same}> 1, g^0 -> undef2694, its^0 -> 1 + its^0, nm^0 -> -1 + k^0, z^0 -> undef3349, rest remain the same}> 1, g^0 -> undef2694, its^0 -> 1 + its^0, nm^0 -> -1 + k^0, z^0 -> undef3349, rest remain the same}> 1, g^0 -> undef2694, its^0 -> 1 + its^0, nm^0 -> -1 + k^0, z^0 -> undef3349, rest remain the same}> 1, g^0 -> undef2694, its^0 -> 1 + its^0, nm^0 -> -1 + k^0, z^0 -> undef3349, rest remain the same}> undef3531, rest remain the same}> undef3531, rest remain the same}> 1, g^0 -> undef2694, its^0 -> 1 + its^0, nm^0 -> -1 + k^0, z^0 -> undef3349, rest remain the same}> 1, g^0 -> undef2694, its^0 -> 1 + its^0, nm^0 -> -1 + k^0, z^0 -> undef3349, rest remain the same}> 1, g^0 -> undef2694, its^0 -> 1 + its^0, nm^0 -> -1 + k^0, z^0 -> undef3349, rest remain the same}> 1, g^0 -> undef2694, its^0 -> 1 + its^0, nm^0 -> -1 + k^0, z^0 -> undef3349, rest remain the same}> Variables: __const_30^0, flag^0, g^0, i^0, its^0, j^0, k^0, l^0, m^0, nm^0, z^0 Checking conditional termination of SCC {l15, l24, l71}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.097253s Ranking function: -4 + __const_30^0 - its^0 + 5*j^0 - 2*k^0 - 2*l^0 - m^0 New Graphs: Transitions: -1 + l^0, rest remain the same}> -1 + l^0, rest remain the same}> 0, nm^0 -> -1 + l^0, rest remain the same}> 1, g^0 -> undef2694, its^0 -> 1 + its^0, nm^0 -> -1 + k^0, z^0 -> undef3349, rest remain the same}> 1, g^0 -> undef2694, its^0 -> 1 + its^0, nm^0 -> -1 + k^0, z^0 -> undef3349, rest remain the same}> 1, g^0 -> undef2694, its^0 -> 1 + its^0, nm^0 -> -1 + k^0, z^0 -> undef3349, rest remain the same}> 1, g^0 -> undef2694, its^0 -> 1 + its^0, nm^0 -> -1 + k^0, z^0 -> undef3349, rest remain the same}> 1, g^0 -> undef2694, its^0 -> 1 + its^0, nm^0 -> -1 + k^0, z^0 -> undef3349, rest remain the same}> 1, g^0 -> undef2694, its^0 -> 1 + its^0, nm^0 -> -1 + k^0, z^0 -> undef3349, rest remain the same}> 1, g^0 -> undef2694, its^0 -> 1 + its^0, nm^0 -> -1 + k^0, z^0 -> undef3349, rest remain the same}> 1, g^0 -> undef2694, its^0 -> 1 + its^0, nm^0 -> -1 + k^0, z^0 -> undef3349, rest remain the same}> 1, g^0 -> undef2694, its^0 -> 1 + its^0, nm^0 -> -1 + k^0, z^0 -> undef3349, rest remain the same}> 1, g^0 -> undef2694, its^0 -> 1 + its^0, nm^0 -> -1 + k^0, z^0 -> undef3349, rest remain the same}> 1, g^0 -> undef2694, its^0 -> 1 + its^0, nm^0 -> -1 + k^0, z^0 -> undef3349, rest remain the same}> 1, g^0 -> undef2694, its^0 -> 1 + its^0, nm^0 -> -1 + k^0, z^0 -> undef3349, rest remain the same}> 1, g^0 -> undef2694, its^0 -> 1 + its^0, nm^0 -> -1 + k^0, z^0 -> undef3349, rest remain the same}> 1, g^0 -> undef2694, its^0 -> 1 + its^0, nm^0 -> -1 + k^0, z^0 -> undef3349, rest remain the same}> 1, g^0 -> undef2694, its^0 -> 1 + its^0, nm^0 -> -1 + k^0, z^0 -> undef3349, rest remain the same}> 1, g^0 -> undef2694, its^0 -> 1 + its^0, nm^0 -> -1 + k^0, z^0 -> undef3349, rest remain the same}> 1, g^0 -> undef2694, its^0 -> 1 + its^0, nm^0 -> -1 + k^0, z^0 -> undef3349, rest remain the same}> 1, g^0 -> undef2694, its^0 -> 1 + its^0, nm^0 -> -1 + k^0, z^0 -> undef3349, rest remain the same}> 1, g^0 -> undef2694, its^0 -> 1 + its^0, nm^0 -> -1 + k^0, z^0 -> undef3349, rest remain the same}> 1, g^0 -> undef2694, its^0 -> 1 + its^0, nm^0 -> -1 + k^0, z^0 -> undef3349, rest remain the same}> Variables: __const_30^0, flag^0, g^0, i^0, its^0, j^0, k^0, l^0, nm^0, z^0 Transitions: undef3531, i^0 -> 1 + i^0, rest remain the same}> undef3531, i^0 -> 1 + i^0, rest remain the same}> Variables: g^0, i^0, j^0, k^0, m^0 Checking conditional termination of SCC {l15, l71}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.046983s Ranking function: __const_30^0 - its^0 New Graphs: Transitions: undef3531, i^0 -> 1 + i^0, rest remain the same}> undef3531, i^0 -> 1 + i^0, rest remain the same}> Variables: g^0, i^0, j^0, k^0, m^0 Checking conditional termination of SCC {l24}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.012661s Ranking function: -1 - i^0 + k^0 New Graphs: Proving termination of subgraph 4 Analyzing SCC {l79}... No cycles found. Program Terminates