/export/starexec/sandbox2/solver/bin/starexec_run_termcomp17 /export/starexec/sandbox2/benchmark/theBenchmark.smt2 /export/starexec/sandbox2/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) + undef79), tmp___5^0 -> undef79}> (0 + undef319), s^0 -> undef319, scale^0 -> undef320}> (1 + k^0)}> (1 + j^0)}> (1 + k^0)}> undef605}> (1 + k^0), s^0 -> undef663}> (0 + (~(1) * tmp___4^0)), h^0 -> undef823}> undef893, tmp___3^0 -> undef894, tmp___4^0 -> (0 + (~(1) * undef894))}> undef924, tmp___1^0 -> undef935, tmp___4^0 -> (0 + undef935)}> undef992}> (1 + k^0), s^0 -> undef1050}> (1 + k^0), scale^0 -> ((0 + scale^0) + undef1310), tmp^0 -> undef1310}> (0 + undef1480), l^0 -> (1 + i^0), s^0 -> undef1480, scale^0 -> undef1481}> (~(1) + k^0)}> (1 + j^0)}> (1 + jj^0), y^0 -> undef1848, z^0 -> undef1849}> undef1895, x^0 -> undef1933}> undef1937, s^0 -> undef1953, z^0 -> undef1978}> undef2193}> (1 + jj^0), x^0 -> undef2234, z^0 -> undef2236}> (1 + its^0)}> undef2324, f^0 -> undef2325, g^0 -> undef2327, h^0 -> undef2328, i^0 -> (1 + j^0), s^0 -> undef2340, y^0 -> undef2364, z^0 -> undef2365}> (0 + undef2473), f^0 -> undef2458, s^0 -> undef2473}> undef2528, tmp___19^0 -> (0 + (~(1) * undef2528))}> undef2570, tmp___19^0 -> (0 + undef2570)}> undef2630, g^0 -> undef2632, h^0 -> undef2633, nm^0 -> (~(1) + k^0), x^0 -> undef2668, y^0 -> undef2669}> (1 + j^0)}> undef3273}> (1 + i^0)}> (1 + j^0), y^0 -> undef3401, z^0 -> undef3402}> undef3447, g^0 -> undef3450, h^0 -> undef3451, s^0 -> undef3463}> undef3664, tmp___16^0 -> undef3689}> 0, s^0 -> 1}> (~(1) + l^0)}> undef4161}> 0}> (~(1) + l^0), tmp___14^0 -> undef4418}> 1}> (1 + j^0)}> (~(1) + i^0)}> (1 + j^0)}> (1 + j^0)}> (1 + k^0)}> undef5040}> (1 + k^0), s^0 -> undef5098}> undef5214}> (1 + j^0)}> undef5601, l^0 -> (1 + i^0)}> undef5687, 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 -> undef6044}> (1 + j^0)}> (1 + i^0)}> (0 + maxarg2^0)}> (0 + maxarg1^0)}> (0 + anorm^0), maxarg2^0 -> ((0 + undef6780) + undef6781), tmp___11^0 -> undef6780, tmp___12^0 -> undef6781}> (1 + k^0)}> (1 + j^0)}> (1 + k^0)}> (1 + k^0), s^0 -> undef7076}> (1 + k^0)}> (0 + (~(1) * tmp___10^0)), h^0 -> undef7365}> (0 + (~(1) * undef7442)), tmp___8^0 -> undef7441, tmp___9^0 -> undef7442}> (0 + undef7483), tmp___6^0 -> undef7482, tmp___7^0 -> undef7483}> undef7534}> (1 + k^0), s^0 -> undef7592}> undef7790, g^0 -> (0 + undef7808), scale^0 -> undef7808}> Fresh variables: undef79, undef319, undef320, undef605, undef663, undef823, undef893, undef894, undef924, undef935, undef992, undef1050, undef1310, undef1480, undef1481, undef1848, undef1849, undef1895, undef1933, undef1937, undef1953, undef1978, undef2193, undef2234, undef2236, undef2324, undef2325, undef2327, undef2328, undef2340, undef2364, undef2365, undef2366, undef2367, undef2368, undef2369, undef2458, undef2473, undef2528, undef2570, undef2630, undef2632, undef2633, undef2668, undef2669, undef2671, undef3273, undef3401, undef3402, undef3447, undef3450, undef3451, undef3463, undef3489, undef3664, undef3689, undef4161, undef4418, undef5040, undef5098, undef5214, undef5601, undef5687, undef6044, undef6780, undef6781, undef7076, undef7365, undef7441, undef7442, undef7482, undef7483, undef7534, undef7592, undef7790, undef7808, Undef variables: undef79, undef319, undef320, undef605, undef663, undef823, undef893, undef894, undef924, undef935, undef992, undef1050, undef1310, undef1480, undef1481, undef1848, undef1849, undef1895, undef1933, undef1937, undef1953, undef1978, undef2193, undef2234, undef2236, undef2324, undef2325, undef2327, undef2328, undef2340, undef2364, undef2365, undef2366, undef2367, undef2368, undef2369, undef2458, undef2473, undef2528, undef2570, undef2630, undef2632, undef2633, undef2668, undef2669, undef2671, undef3273, undef3401, undef3402, undef3447, undef3450, undef3451, undef3463, undef3489, undef3664, undef3689, undef4161, undef4418, undef5040, undef5098, undef5214, undef5601, undef5687, undef6044, undef6780, undef6781, undef7076, undef7365, undef7441, undef7442, undef7482, undef7483, undef7534, undef7592, undef7790, undef7808, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: (0 + ((0 + undef6780) + undef6781)), i^0 -> (1 + i^0)}> (0 + (0 + anorm^0)), i^0 -> (1 + i^0)}> (1 + k^0), scale^0 -> ((0 + scale^0) + undef79)}> (0 + ((0 + undef6780) + undef6781)), g^0 -> (0 + undef319), i^0 -> (1 + i^0), scale^0 -> undef320}> (0 + (0 + anorm^0)), g^0 -> (0 + undef319), i^0 -> (1 + i^0), scale^0 -> undef320}> (0 + ((0 + undef6780) + undef6781)), g^0 -> (0 + undef319), i^0 -> (1 + i^0), scale^0 -> undef320}> (0 + (0 + anorm^0)), g^0 -> (0 + undef319), i^0 -> (1 + i^0), scale^0 -> undef320}> (0 + undef319), scale^0 -> undef320}> (0 + undef319), scale^0 -> undef320}> (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 -> undef3273}> (1 + i^0), z^0 -> undef3273}> (1 + i^0), k^0 -> (~(1) + k^0), z^0 -> undef3273}> (1 + i^0), z^0 -> undef3273}> undef3450, i^0 -> (1 + i^0)}> undef3450, i^0 -> (1 + i^0)}> (1 + i^0), z^0 -> undef3273}> (1 + i^0), z^0 -> undef3273}> (1 + i^0), k^0 -> (~(1) + k^0), z^0 -> undef3273}> (1 + i^0), z^0 -> undef3273}> (1 + j^0), z^0 -> undef3402}> (0 + (~(1) * (0 + (~(1) * undef894))))}> (0 + (~(1) * (0 + (~(1) * undef894))))}> (0 + (~(1) * (0 + undef935)))}> (0 + (~(1) * (0 + undef935)))}> (1 + k^0)}> (~(1) + k^0)}> (1 + j^0)}> (0 + ((0 + undef6780) + undef6781)), g^0 -> (0 + undef319), i^0 -> (1 + i^0), scale^0 -> undef320}> (0 + (0 + anorm^0)), g^0 -> (0 + undef319), i^0 -> (1 + i^0), scale^0 -> undef320}> (0 + ((0 + undef6780) + undef6781)), g^0 -> (0 + undef319), i^0 -> (1 + i^0), scale^0 -> undef320}> (0 + (0 + anorm^0)), g^0 -> (0 + undef319), i^0 -> (1 + i^0), scale^0 -> undef320}> (0 + undef319), scale^0 -> undef320}> (0 + undef319), scale^0 -> undef320}> (1 + k^0), scale^0 -> ((0 + scale^0) + undef1310)}> undef5687, i^0 -> (~(1) + i^0), l^0 -> (0 + i^0)}> (0 + ((0 + undef6780) + undef6781)), g^0 -> (0 + undef319), i^0 -> (1 + i^0), l^0 -> (1 + i^0), scale^0 -> undef320}> (0 + (0 + anorm^0)), g^0 -> (0 + undef319), i^0 -> (1 + i^0), l^0 -> (1 + i^0), scale^0 -> undef320}> (0 + undef1480), l^0 -> (1 + i^0), scale^0 -> undef1481}> (~(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)}> undef2327, i^0 -> (1 + (1 + j^0)), j^0 -> (1 + j^0), z^0 -> undef2365}> (1 + jj^0), z^0 -> undef1849}> undef2193}> undef1978}> undef1978}> (1 + jj^0), z^0 -> undef2236}> (0 + (~(1) * (0 + (~(1) * undef7442))))}> (0 + (~(1) * (0 + undef7483)))}> (1 + k^0)}> undef2632, its^0 -> (1 + its^0), k^0 -> (~(1) + k^0), nm^0 -> (~(1) + k^0)}> undef2327, i^0 -> (1 + j^0), nm^0 -> (~(1) + k^0), z^0 -> undef2365}> undef2632, its^0 -> (1 + its^0), k^0 -> (~(1) + k^0), nm^0 -> (~(1) + k^0)}> undef2327, i^0 -> (1 + j^0), nm^0 -> (~(1) + k^0), z^0 -> undef2365}> 1, g^0 -> undef2632, its^0 -> (1 + its^0), nm^0 -> (~(1) + k^0)}> undef2327, i^0 -> (1 + j^0), nm^0 -> (~(1) + k^0), z^0 -> undef2365}> 1, g^0 -> undef2632, its^0 -> (1 + its^0), nm^0 -> (~(1) + k^0)}> undef2327, i^0 -> (1 + j^0), nm^0 -> (~(1) + k^0), z^0 -> undef2365}> undef2632, its^0 -> (1 + its^0), k^0 -> (~(1) + k^0), nm^0 -> (~(1) + k^0)}> undef2327, i^0 -> (1 + j^0), nm^0 -> (~(1) + k^0), z^0 -> undef2365}> undef2632, its^0 -> (1 + its^0), k^0 -> (~(1) + k^0), nm^0 -> (~(1) + k^0)}> undef2327, i^0 -> (1 + j^0), nm^0 -> (~(1) + k^0), z^0 -> undef2365}> (1 + k^0)}> (1 + k^0)}> (1 + j^0)}> (1 + j^0)}> (1 + k^0)}> undef3273}> undef3273}> (~(1) + k^0), z^0 -> undef3273}> undef3273}> undef3273}> undef3273}> (~(1) + k^0), z^0 -> undef3273}> undef3273}> undef3450}> undef3450}> undef3273}> undef3273}> (~(1) + k^0), z^0 -> undef3273}> undef3273}> undef3273}> undef3273}> (~(1) + k^0), z^0 -> undef3273}> undef3273}> undef3450}> undef3450}> undef3273}> undef3273}> (~(1) + k^0), z^0 -> undef3273}> undef3273}> (0 + ((0 + undef6780) + undef6781)), i^0 -> (1 + i^0)}> (0 + (0 + anorm^0)), i^0 -> (1 + i^0)}> (1 + k^0)}> (1 + j^0)}> undef5687, i^0 -> (~(1) + i^0), l^0 -> (0 + i^0)}> (1 + j^0)}> Fresh variables: undef79, undef319, undef320, undef605, undef663, undef823, undef893, undef894, undef924, undef935, undef992, undef1050, undef1310, undef1480, undef1481, undef1848, undef1849, undef1895, undef1933, undef1937, undef1953, undef1978, undef2193, undef2234, undef2236, undef2324, undef2325, undef2327, undef2328, undef2340, undef2364, undef2365, undef2366, undef2367, undef2368, undef2369, undef2458, undef2473, undef2528, undef2570, undef2630, undef2632, undef2633, undef2668, undef2669, undef2671, undef3273, undef3401, undef3402, undef3447, undef3450, undef3451, undef3463, undef3489, undef3664, undef3689, undef4161, undef4418, undef5040, undef5098, undef5214, undef5601, undef5687, undef6044, undef6780, undef6781, undef7076, undef7365, undef7441, undef7442, undef7482, undef7483, undef7534, undef7592, undef7790, undef7808, Undef variables: undef79, undef319, undef320, undef605, undef663, undef823, undef893, undef894, undef924, undef935, undef992, undef1050, undef1310, undef1480, undef1481, undef1848, undef1849, undef1895, undef1933, undef1937, undef1953, undef1978, undef2193, undef2234, undef2236, undef2324, undef2325, undef2327, undef2328, undef2340, undef2364, undef2365, undef2366, undef2367, undef2368, undef2369, undef2458, undef2473, undef2528, undef2570, undef2630, undef2632, undef2633, undef2668, undef2669, undef2671, undef3273, undef3401, undef3402, undef3447, undef3450, undef3451, undef3463, undef3489, undef3664, undef3689, undef4161, undef4418, undef5040, undef5098, undef5214, undef5601, undef5687, undef6044, undef6780, undef6781, undef7076, undef7365, undef7441, undef7442, undef7482, undef7483, undef7534, undef7592, undef7790, undef7808, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: undef6780 + undef6781, i^0 -> 1 + i^0, rest remain the same}> 1 + i^0, rest remain the same}> 1 + k^0, scale^0 -> scale^0 + undef79, rest remain the same}> undef6780 + undef6781, g^0 -> undef319, i^0 -> 1 + i^0, scale^0 -> undef320, rest remain the same}> undef319, i^0 -> 1 + i^0, scale^0 -> undef320, rest remain the same}> undef6780 + undef6781, g^0 -> undef319, i^0 -> 1 + i^0, scale^0 -> undef320, rest remain the same}> undef319, i^0 -> 1 + i^0, scale^0 -> undef320, rest remain the same}> undef319, scale^0 -> undef320, rest remain the same}> undef319, scale^0 -> undef320, 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}> undef894, rest remain the same}> undef894, rest remain the same}> -undef935, rest remain the same}> -undef935, rest remain the same}> 1 + k^0, rest remain the same}> undef6780 + undef6781, g^0 -> undef319, i^0 -> 1 + i^0, scale^0 -> undef320, rest remain the same}> undef319, i^0 -> 1 + i^0, scale^0 -> undef320, rest remain the same}> undef6780 + undef6781, g^0 -> undef319, i^0 -> 1 + i^0, scale^0 -> undef320, rest remain the same}> undef319, i^0 -> 1 + i^0, scale^0 -> undef320, rest remain the same}> undef319, scale^0 -> undef320, rest remain the same}> undef319, scale^0 -> undef320, rest remain the same}> 1 + k^0, scale^0 -> scale^0 + undef1310, rest remain the same}> undef6780 + undef6781, g^0 -> undef319, i^0 -> 1 + i^0, l^0 -> 1 + i^0, scale^0 -> undef320, rest remain the same}> undef319, i^0 -> 1 + i^0, l^0 -> 1 + i^0, scale^0 -> undef320, rest remain the same}> undef1480, l^0 -> 1 + i^0, scale^0 -> undef1481, rest remain the same}> undef7442, rest remain the same}> -undef7483, 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}> undef6780 + undef6781, 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: undef5687, i^0 -> -1 + i^0, l^0 -> i^0, rest remain the same}> 1 + j^0, rest remain the same}> undef5687, 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 -> undef3273, rest remain the same}> 1 + i^0, z^0 -> undef3273, rest remain the same}> 1 + i^0, k^0 -> -1 + k^0, z^0 -> undef3273, rest remain the same}> 1 + i^0, z^0 -> undef3273, rest remain the same}> undef3450, i^0 -> 1 + i^0, rest remain the same}> undef3450, i^0 -> 1 + i^0, rest remain the same}> 1 + i^0, z^0 -> undef3273, rest remain the same}> 1 + i^0, z^0 -> undef3273, rest remain the same}> 1 + i^0, k^0 -> -1 + k^0, z^0 -> undef3273, rest remain the same}> 1 + i^0, z^0 -> undef3273, rest remain the same}> 1 + j^0, z^0 -> undef3402, 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}> undef2327, i^0 -> 2 + j^0, j^0 -> 1 + j^0, z^0 -> undef2365, rest remain the same}> 1 + jj^0, z^0 -> undef1849, rest remain the same}> undef2193, rest remain the same}> undef1978, rest remain the same}> undef1978, rest remain the same}> 1 + jj^0, z^0 -> undef2236, rest remain the same}> undef2632, its^0 -> 1 + its^0, k^0 -> -1 + k^0, nm^0 -> -1 + k^0, rest remain the same}> undef2327, i^0 -> 1 + j^0, nm^0 -> -1 + k^0, z^0 -> undef2365, rest remain the same}> undef2632, its^0 -> 1 + its^0, k^0 -> -1 + k^0, nm^0 -> -1 + k^0, rest remain the same}> undef2327, i^0 -> 1 + j^0, nm^0 -> -1 + k^0, z^0 -> undef2365, rest remain the same}> 1, g^0 -> undef2632, its^0 -> 1 + its^0, nm^0 -> -1 + k^0, rest remain the same}> undef2327, i^0 -> 1 + j^0, nm^0 -> -1 + k^0, z^0 -> undef2365, rest remain the same}> 1, g^0 -> undef2632, its^0 -> 1 + its^0, nm^0 -> -1 + k^0, rest remain the same}> undef2327, i^0 -> 1 + j^0, nm^0 -> -1 + k^0, z^0 -> undef2365, rest remain the same}> undef2632, its^0 -> 1 + its^0, k^0 -> -1 + k^0, nm^0 -> -1 + k^0, rest remain the same}> undef2327, i^0 -> 1 + j^0, nm^0 -> -1 + k^0, z^0 -> undef2365, rest remain the same}> undef2632, its^0 -> 1 + its^0, k^0 -> -1 + k^0, nm^0 -> -1 + k^0, rest remain the same}> undef2327, i^0 -> 1 + j^0, nm^0 -> -1 + k^0, z^0 -> undef2365, rest remain the same}> undef3273, rest remain the same}> undef3273, rest remain the same}> -1 + k^0, z^0 -> undef3273, rest remain the same}> undef3273, rest remain the same}> undef3273, rest remain the same}> undef3273, rest remain the same}> -1 + k^0, z^0 -> undef3273, rest remain the same}> undef3273, rest remain the same}> undef3450, rest remain the same}> undef3450, rest remain the same}> undef3273, rest remain the same}> undef3273, rest remain the same}> -1 + k^0, z^0 -> undef3273, rest remain the same}> undef3273, rest remain the same}> undef3273, rest remain the same}> undef3273, rest remain the same}> -1 + k^0, z^0 -> undef3273, rest remain the same}> undef3273, rest remain the same}> undef3450, rest remain the same}> undef3450, rest remain the same}> undef3273, rest remain the same}> undef3273, rest remain the same}> -1 + k^0, z^0 -> undef3273, rest remain the same}> undef3273, rest remain the same}> Variables: l^0, nm^0, i^0, j^0, k^0, m^0, z^0, g^0, n^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.93606 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): undef6780 + undef6781, g^0 -> undef319, i^0 -> 1 + i^0, scale^0 -> undef320, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef319, i^0 -> 1 + i^0, scale^0 -> undef320, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef6780 + undef6781, g^0 -> undef319, i^0 -> 1 + i^0, scale^0 -> undef320, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef319, i^0 -> 1 + i^0, scale^0 -> undef320, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef319, scale^0 -> undef320, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef319, scale^0 -> undef320, 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): undef894, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef894, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -undef935, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -undef935, 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: undef6780 + undef6781, g^0 -> undef319, i^0 -> 1 + i^0, scale^0 -> undef320, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef319, i^0 -> 1 + i^0, scale^0 -> undef320, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef6780 + undef6781, g^0 -> undef319, i^0 -> 1 + i^0, scale^0 -> undef320, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef319, i^0 -> 1 + i^0, scale^0 -> undef320, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef319, scale^0 -> undef320, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef319, scale^0 -> undef320, 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 + undef1310, 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): undef7442, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -undef7483, 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): undef6780 + undef6781, 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.698967 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): undef6780 + undef6781, 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 + undef79, 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): undef6780 + undef6781, g^0 -> undef319, i^0 -> 1 + i^0, scale^0 -> undef320, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef319, i^0 -> 1 + i^0, scale^0 -> undef320, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef319, scale^0 -> undef320, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef319, scale^0 -> undef320, 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 + undef1310, 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): undef7442, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -undef7483, 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): undef6780 + undef6781, 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.26125 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: undef319, scale^0 -> undef320, rest remain the same}> > It's unfeasible. Removing transition: undef319, scale^0 -> undef320, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef6780 + undef6781, 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 + undef79, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef6780 + undef6781, g^0 -> undef319, i^0 -> 1 + i^0, scale^0 -> undef320, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef319, i^0 -> 1 + i^0, scale^0 -> undef320, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef6780 + undef6781, g^0 -> undef319, i^0 -> 1 + i^0, scale^0 -> undef320, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef319, i^0 -> 1 + i^0, scale^0 -> undef320, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef319, scale^0 -> undef320, 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): undef894, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef894, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -undef935, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -undef935, 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): undef6780 + undef6781, g^0 -> undef319, i^0 -> 1 + i^0, scale^0 -> undef320, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef319, i^0 -> 1 + i^0, scale^0 -> undef320, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef319, scale^0 -> undef320, 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 + undef1310, 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): undef7442, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -undef7483, 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): undef6780 + undef6781, 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.871899 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): undef6780 + undef6781, 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 + undef79, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef6780 + undef6781, g^0 -> undef319, i^0 -> 1 + i^0, scale^0 -> undef320, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef319, i^0 -> 1 + i^0, scale^0 -> undef320, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef6780 + undef6781, g^0 -> undef319, i^0 -> 1 + i^0, scale^0 -> undef320, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef319, i^0 -> 1 + i^0, scale^0 -> undef320, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef319, scale^0 -> undef320, 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): undef894, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef894, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -undef935, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -undef935, 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): undef7442, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -undef7483, 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): undef6780 + undef6781, 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.908634 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): undef6780 + undef6781, 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 + undef79, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef6780 + undef6781, g^0 -> undef319, i^0 -> 1 + i^0, scale^0 -> undef320, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef319, i^0 -> 1 + i^0, scale^0 -> undef320, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef6780 + undef6781, g^0 -> undef319, i^0 -> 1 + i^0, scale^0 -> undef320, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef319, i^0 -> 1 + i^0, scale^0 -> undef320, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef319, scale^0 -> undef320, 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): undef894, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef894, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -undef935, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -undef935, 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): undef7442, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -undef7483, 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): undef6780 + undef6781, 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.926661 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): undef6780 + undef6781, 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 + undef79, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef6780 + undef6781, g^0 -> undef319, i^0 -> 1 + i^0, scale^0 -> undef320, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef319, i^0 -> 1 + i^0, scale^0 -> undef320, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef6780 + undef6781, g^0 -> undef319, i^0 -> 1 + i^0, scale^0 -> undef320, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef319, i^0 -> 1 + i^0, scale^0 -> undef320, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef319, scale^0 -> undef320, 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): undef894, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef894, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -undef935, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -undef935, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef6780 + undef6781, g^0 -> undef319, i^0 -> 1 + i^0, scale^0 -> undef320, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef319, i^0 -> 1 + i^0, scale^0 -> undef320, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef319, scale^0 -> undef320, 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 + undef1310, 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): undef7442, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -undef7483, 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): undef6780 + undef6781, 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.26371 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: undef6780 + undef6781, g^0 -> undef319, i^0 -> 1 + i^0, scale^0 -> undef320, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef6780 + undef6781, 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 + undef79, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef319, i^0 -> 1 + i^0, scale^0 -> undef320, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef6780 + undef6781, g^0 -> undef319, i^0 -> 1 + i^0, scale^0 -> undef320, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef319, i^0 -> 1 + i^0, scale^0 -> undef320, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef319, scale^0 -> undef320, 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): undef894, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef894, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -undef935, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -undef935, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef6780 + undef6781, g^0 -> undef319, i^0 -> 1 + i^0, scale^0 -> undef320, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef319, i^0 -> 1 + i^0, scale^0 -> undef320, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef319, scale^0 -> undef320, 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 + undef1310, 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): undef7442, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -undef7483, 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): undef6780 + undef6781, 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.31659 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): undef6780 + undef6781, 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 + undef79, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef6780 + undef6781, g^0 -> undef319, i^0 -> 1 + i^0, scale^0 -> undef320, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef319, i^0 -> 1 + i^0, scale^0 -> undef320, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef319, scale^0 -> undef320, 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): undef6780 + undef6781, g^0 -> undef319, i^0 -> 1 + i^0, scale^0 -> undef320, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef319, i^0 -> 1 + i^0, scale^0 -> undef320, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef319, scale^0 -> undef320, 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 + undef1310, 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): undef7442, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -undef7483, 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): undef6780 + undef6781, 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.10018 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.074324s Ranking function: -5 - 5*i^0 + 5*n^0 New Graphs: Transitions: undef6780 + undef6781, g^0 -> undef7442, i^0 -> 1 + i^0, rest remain the same}> undef7442, i^0 -> 1 + i^0, rest remain the same}> undef7442, rest remain the same}> undef6780 + undef6781, g^0 -> -undef7483, i^0 -> 1 + i^0, rest remain the same}> -undef7483, i^0 -> 1 + i^0, rest remain the same}> -undef7483, rest remain the same}> undef6780 + undef6781, g^0 -> undef7442, i^0 -> 1 + i^0, rest remain the same}> undef7442, i^0 -> 1 + i^0, rest remain the same}> undef7442, rest remain the same}> undef6780 + undef6781, g^0 -> -undef7483, i^0 -> 1 + i^0, rest remain the same}> -undef7483, i^0 -> 1 + i^0, rest remain the same}> -undef7483, rest remain the same}> 1 + k^0, scale^0 -> scale^0 + undef79, rest remain the same}> undef6780 + undef6781, g^0 -> undef319, i^0 -> 1 + i^0, scale^0 -> undef320, rest remain the same}> undef319, i^0 -> 1 + i^0, scale^0 -> undef320, rest remain the same}> undef319, scale^0 -> undef320, rest remain the same}> 1 + j^0, rest remain the same}> 1 + j^0, rest remain the same}> undef6780 + undef6781, g^0 -> undef319, i^0 -> 1 + i^0, scale^0 -> undef320, rest remain the same}> undef319, i^0 -> 1 + i^0, scale^0 -> undef320, rest remain the same}> undef319, scale^0 -> undef320, rest remain the same}> undef894, rest remain the same}> undef894, rest remain the same}> -undef935, rest remain the same}> -undef935, rest remain the same}> undef894, rest remain the same}> undef894, rest remain the same}> -undef935, rest remain the same}> -undef935, rest remain the same}> 1 + k^0, scale^0 -> scale^0 + undef1310, rest remain the same}> undef6780 + undef6781, g^0 -> undef319, i^0 -> 1 + i^0, l^0 -> 1 + i^0, scale^0 -> undef320, rest remain the same}> undef319, i^0 -> 1 + i^0, l^0 -> 1 + i^0, scale^0 -> undef320, rest remain the same}> undef1480, l^0 -> 1 + i^0, scale^0 -> undef1481, rest remain the same}> undef6780 + undef6781, 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.365038s Ranking function: -6 - 6*i^0 + 6*n^0 New Graphs: Transitions: undef7442, rest remain the same}> -undef7483, rest remain the same}> undef7442, rest remain the same}> -undef7483, rest remain the same}> 1 + k^0, scale^0 -> scale^0 + undef79, rest remain the same}> undef6780 + undef6781, g^0 -> undef319, i^0 -> 1 + i^0, j^0 -> ((0 + 1) + 0) + j^0, scale^0 -> undef320, rest remain the same}> undef319, i^0 -> 1 + i^0, j^0 -> ((0 + 1) + 0) + j^0, scale^0 -> undef320, rest remain the same}> undef319, j^0 -> ((0 + 1) + 0) + j^0, scale^0 -> undef320, rest remain the same}> 1 + j^0, rest remain the same}> undef6780 + undef6781, g^0 -> undef319, i^0 -> 1 + i^0, scale^0 -> undef320, rest remain the same}> undef319, i^0 -> 1 + i^0, scale^0 -> undef320, rest remain the same}> undef319, scale^0 -> undef320, rest remain the same}> undef6780 + undef6781, g^0 -> undef319, i^0 -> 1 + i^0, scale^0 -> undef320, rest remain the same}> undef319, i^0 -> 1 + i^0, scale^0 -> undef320, rest remain the same}> undef319, scale^0 -> undef320, rest remain the same}> undef894, rest remain the same}> undef6780 + undef6781, g^0 -> undef319, i^0 -> 1 + i^0, scale^0 -> undef320, rest remain the same}> undef319, i^0 -> 1 + i^0, scale^0 -> undef320, rest remain the same}> undef319, scale^0 -> undef320, rest remain the same}> -undef935, rest remain the same}> undef6780 + undef6781, g^0 -> undef319, i^0 -> 1 + i^0, scale^0 -> undef320, rest remain the same}> undef319, i^0 -> 1 + i^0, scale^0 -> undef320, rest remain the same}> undef319, scale^0 -> undef320, rest remain the same}> undef894, rest remain the same}> undef6780 + undef6781, g^0 -> undef319, i^0 -> 1 + i^0, scale^0 -> undef320, rest remain the same}> undef319, i^0 -> 1 + i^0, scale^0 -> undef320, rest remain the same}> undef319, scale^0 -> undef320, rest remain the same}> -undef935, rest remain the same}> 1 + k^0, scale^0 -> scale^0 + undef1310, rest remain the same}> undef6780 + undef6781, g^0 -> undef319, i^0 -> 1 + i^0, l^0 -> 1 + i^0, scale^0 -> undef320, rest remain the same}> undef319, i^0 -> 1 + i^0, l^0 -> 1 + i^0, scale^0 -> undef320, rest remain the same}> undef1480, l^0 -> 1 + i^0, scale^0 -> undef1481, rest remain the same}> undef6780 + undef6781, 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.134829s Ranking function: -13 - 10*i^0 - 6*k^0 - 3*m^0 + 19*n^0 New Graphs: Transitions: undef7442, rest remain the same}> -undef7483, rest remain the same}> undef7442, rest remain the same}> -undef7483, rest remain the same}> undef6780 + undef6781, g^0 -> undef319, i^0 -> 1 + i^0, j^0 -> ((0 + 1) + 0) + j^0, scale^0 -> undef320, rest remain the same}> undef319, i^0 -> 1 + i^0, j^0 -> ((0 + 1) + 0) + j^0, scale^0 -> undef320, rest remain the same}> undef319, j^0 -> ((0 + 1) + 0) + j^0, scale^0 -> undef320, rest remain the same}> 1 + j^0, rest remain the same}> undef6780 + undef6781, g^0 -> undef319, i^0 -> 1 + i^0, scale^0 -> undef320, rest remain the same}> undef319, i^0 -> 1 + i^0, scale^0 -> undef320, rest remain the same}> undef319, scale^0 -> undef320, rest remain the same}> undef6780 + undef6781, g^0 -> undef319, i^0 -> 1 + i^0, scale^0 -> undef320, rest remain the same}> undef319, i^0 -> 1 + i^0, scale^0 -> undef320, rest remain the same}> undef319, scale^0 -> undef320, rest remain the same}> undef894, rest remain the same}> undef6780 + undef6781, g^0 -> undef319, i^0 -> 1 + i^0, scale^0 -> undef320, rest remain the same}> undef319, i^0 -> 1 + i^0, scale^0 -> undef320, rest remain the same}> undef319, scale^0 -> undef320, rest remain the same}> -undef935, rest remain the same}> undef6780 + undef6781, g^0 -> undef319, i^0 -> 1 + i^0, scale^0 -> undef320, rest remain the same}> undef319, i^0 -> 1 + i^0, scale^0 -> undef320, rest remain the same}> undef319, scale^0 -> undef320, rest remain the same}> undef894, rest remain the same}> undef6780 + undef6781, g^0 -> undef319, i^0 -> 1 + i^0, scale^0 -> undef320, rest remain the same}> undef319, i^0 -> 1 + i^0, scale^0 -> undef320, rest remain the same}> undef319, scale^0 -> undef320, rest remain the same}> -undef935, rest remain the same}> 1 + k^0, scale^0 -> scale^0 + undef1310, rest remain the same}> undef6780 + undef6781, g^0 -> undef319, i^0 -> 1 + i^0, l^0 -> 1 + i^0, scale^0 -> undef320, rest remain the same}> undef319, i^0 -> 1 + i^0, l^0 -> 1 + i^0, scale^0 -> undef320, rest remain the same}> undef1480, l^0 -> 1 + i^0, scale^0 -> undef1481, rest remain the same}> undef6780 + undef6781, 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.095545s Ranking function: -i^0 - 8*j^0 + 18*m^0 - 9*n^0 New Graphs: Transitions: undef7442, rest remain the same}> -undef7483, rest remain the same}> undef7442, rest remain the same}> -undef7483, rest remain the same}> undef319, j^0 -> ((0 + 1) + 0) + j^0, scale^0 -> undef320, rest remain the same}> 1 + j^0, rest remain the same}> undef6780 + undef6781, g^0 -> undef319, i^0 -> 1 + i^0, scale^0 -> undef320, rest remain the same}> undef319, i^0 -> 1 + i^0, scale^0 -> undef320, rest remain the same}> undef319, scale^0 -> undef320, rest remain the same}> undef6780 + undef6781, g^0 -> undef319, i^0 -> 1 + i^0, scale^0 -> undef320, rest remain the same}> undef319, i^0 -> 1 + i^0, scale^0 -> undef320, rest remain the same}> undef319, scale^0 -> undef320, rest remain the same}> undef894, rest remain the same}> undef6780 + undef6781, g^0 -> undef319, i^0 -> 1 + i^0, scale^0 -> undef320, rest remain the same}> undef319, i^0 -> 1 + i^0, scale^0 -> undef320, rest remain the same}> undef319, scale^0 -> undef320, rest remain the same}> -undef935, rest remain the same}> undef6780 + undef6781, g^0 -> undef319, i^0 -> 1 + i^0, scale^0 -> undef320, rest remain the same}> undef319, i^0 -> 1 + i^0, scale^0 -> undef320, rest remain the same}> undef319, scale^0 -> undef320, rest remain the same}> undef894, rest remain the same}> undef6780 + undef6781, g^0 -> undef319, i^0 -> 1 + i^0, scale^0 -> undef320, rest remain the same}> undef319, i^0 -> 1 + i^0, scale^0 -> undef320, rest remain the same}> undef319, scale^0 -> undef320, rest remain the same}> -undef935, rest remain the same}> 1 + k^0, scale^0 -> scale^0 + undef1310, rest remain the same}> undef6780 + undef6781, g^0 -> undef319, i^0 -> 1 + i^0, l^0 -> 1 + i^0, scale^0 -> undef320, rest remain the same}> undef319, i^0 -> 1 + i^0, l^0 -> 1 + i^0, scale^0 -> undef320, rest remain the same}> undef1480, l^0 -> 1 + i^0, scale^0 -> undef1481, rest remain the same}> undef6780 + undef6781, 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.123055s Ranking function: -6 - 8*i^0 - 4*j^0 + 2*m^0 + 10*n^0 New Graphs: Transitions: undef7442, rest remain the same}> -undef7483, rest remain the same}> undef7442, rest remain the same}> -undef7483, rest remain the same}> undef6780 + undef6781, g^0 -> undef319, i^0 -> 1 + i^0, scale^0 -> undef320, rest remain the same}> undef319, i^0 -> 1 + i^0, scale^0 -> undef320, rest remain the same}> undef319, scale^0 -> undef320, rest remain the same}> undef6780 + undef6781, g^0 -> undef319, i^0 -> 1 + i^0, scale^0 -> undef320, rest remain the same}> undef319, i^0 -> 1 + i^0, scale^0 -> undef320, rest remain the same}> undef319, scale^0 -> undef320, rest remain the same}> undef6780 + undef6781, g^0 -> undef319, i^0 -> 1 + i^0, scale^0 -> undef320, rest remain the same}> undef319, i^0 -> 1 + i^0, scale^0 -> undef320, rest remain the same}> undef319, scale^0 -> undef320, rest remain the same}> undef6780 + undef6781, g^0 -> undef319, i^0 -> 1 + i^0, scale^0 -> undef320, rest remain the same}> undef319, i^0 -> 1 + i^0, scale^0 -> undef320, rest remain the same}> undef319, scale^0 -> undef320, rest remain the same}> undef6780 + undef6781, g^0 -> undef319, i^0 -> 1 + i^0, scale^0 -> undef320, rest remain the same}> undef319, i^0 -> 1 + i^0, scale^0 -> undef320, rest remain the same}> undef319, scale^0 -> undef320, rest remain the same}> 1 + k^0, scale^0 -> scale^0 + undef1310, rest remain the same}> undef6780 + undef6781, g^0 -> undef319, i^0 -> 1 + i^0, l^0 -> 1 + i^0, scale^0 -> undef320, rest remain the same}> undef319, i^0 -> 1 + i^0, l^0 -> 1 + i^0, scale^0 -> undef320, rest remain the same}> undef1480, l^0 -> 1 + i^0, scale^0 -> undef1481, rest remain the same}> undef6780 + undef6781, 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.072213s 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: undef7442, rest remain the same}> -undef7483, rest remain the same}> undef7442, rest remain the same}> -undef7483, rest remain the same}> undef319, scale^0 -> undef320, rest remain the same}> undef319, scale^0 -> undef320, rest remain the same}> undef319, scale^0 -> undef320, rest remain the same}> undef319, scale^0 -> undef320, rest remain the same}> undef319, scale^0 -> undef320, rest remain the same}> 1 + k^0, scale^0 -> scale^0 + undef1310, rest remain the same}> undef6780 + undef6781, g^0 -> undef319, i^0 -> 1 + i^0, l^0 -> 1 + i^0, scale^0 -> undef320, rest remain the same}> undef319, i^0 -> 1 + i^0, l^0 -> 1 + i^0, scale^0 -> undef320, rest remain the same}> undef1480, l^0 -> 1 + i^0, scale^0 -> undef1481, rest remain the same}> undef6780 + undef6781, 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.008571s Ranking function: -1 - j^0 + n^0 New Graphs: Transitions: undef7442, rest remain the same}> -undef7483, rest remain the same}> undef7442, rest remain the same}> -undef7483, rest remain the same}> undef319, scale^0 -> undef320, rest remain the same}> undef319, scale^0 -> undef320, rest remain the same}> undef319, scale^0 -> undef320, rest remain the same}> undef319, scale^0 -> undef320, rest remain the same}> undef319, scale^0 -> undef320, rest remain the same}> 1 + k^0, scale^0 -> scale^0 + undef1310, rest remain the same}> undef6780 + undef6781, g^0 -> undef319, i^0 -> 1 + i^0, l^0 -> 1 + i^0, scale^0 -> undef320, rest remain the same}> undef319, i^0 -> 1 + i^0, l^0 -> 1 + i^0, scale^0 -> undef320, rest remain the same}> undef1480, l^0 -> 1 + i^0, scale^0 -> undef1481, rest remain the same}> undef6780 + undef6781, 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.037284s Ranking function: 2 - 13*i^0 - 9*k^0 + 15*m^0 + 7*n^0 It's unfeasible after collapsing. Removing transition: undef319, l^0 -> ((0 + 1) + 0) + i^0, scale^0 -> undef320, rest remain the same}> It's unfeasible after collapsing. Removing transition: undef319, l^0 -> ((0 + 1) + 0) + i^0, scale^0 -> undef320, rest remain the same}> It's unfeasible after collapsing. Removing transition: undef319, l^0 -> ((0 + 1) + 0) + i^0, scale^0 -> undef320, rest remain the same}> It's unfeasible after collapsing. Removing transition: undef319, l^0 -> ((0 + 1) + 0) + i^0, scale^0 -> undef320, rest remain the same}> New Graphs: Transitions: undef7442, rest remain the same}> -undef7483, rest remain the same}> undef7442, rest remain the same}> -undef7483, rest remain the same}> undef6780 + undef6781, g^0 -> undef319, i^0 -> 1 + i^0, l^0 -> 1 + i^0, scale^0 -> undef320, rest remain the same}> undef319, i^0 -> 1 + i^0, l^0 -> 1 + i^0, scale^0 -> undef320, rest remain the same}> undef319, l^0 -> ((0 + 1) + 0) + i^0, scale^0 -> undef320, rest remain the same}> undef6780 + undef6781, 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.024368s Ranking function: -3 - i^0 - 3*m^0 + 4*n^0 New Graphs: Transitions: undef7442, rest remain the same}> -undef7483, rest remain the same}> undef7442, rest remain the same}> -undef7483, rest remain the same}> ((0 + 0) + 0) + undef6780 + undef6781, g^0 -> undef319, i^0 -> ((0 + 1) + 0) + i^0, j^0 -> ((0 + 1) + 0) + j^0, l^0 -> 2 + i^0, scale^0 -> undef320, rest remain the same}> undef319, i^0 -> ((0 + 1) + 0) + i^0, j^0 -> ((0 + 1) + 0) + j^0, l^0 -> 2 + i^0, scale^0 -> undef320, 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.022725s 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.008268s Ranking function: -1 - j^0 + m^0 New Graphs: Proving termination of subgraph 2 Checking unfeasibility... Time used: 0.06006 Checking conditional termination of SCC {l35, l85, l107}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.014471s Ranking function: -j^0 + n^0 New Graphs: Transitions: undef5687, i^0 -> -1 + i^0, l^0 -> i^0, rest remain the same}> undef5687, i^0 -> -1 + i^0, l^0 -> i^0, rest remain the same}> undef5687, i^0 -> -1 + i^0, l^0 -> i^0, rest remain the same}> undef5687, 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.011524s Ranking function: 8*i^0 - 8*n^0 New Graphs: Transitions: undef5687, i^0 -> -1 + i^0, l^0 -> i^0, rest remain the same}> undef5687, i^0 -> -1 + i^0, l^0 -> i^0, rest remain the same}> undef5687, 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.010855s Ranking function: -1 + i^0 New Graphs: Proving termination of subgraph 3 Checking unfeasibility... Time used: 4.10008 Checking conditional termination of SCC {l15, l24, l29, l40, l42, l47, l53, l71}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.104761s Ranking function: -35 + 35*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 -> undef3273, rest remain the same}> 1 + i^0, z^0 -> undef3273, rest remain the same}> 1 + i^0, k^0 -> -1 + k^0, z^0 -> undef3273, rest remain the same}> 1 + i^0, z^0 -> undef3273, rest remain the same}> undef3450, i^0 -> 1 + i^0, rest remain the same}> undef3450, i^0 -> 1 + i^0, rest remain the same}> 1 + i^0, z^0 -> undef3273, rest remain the same}> 1 + i^0, z^0 -> undef3273, rest remain the same}> 1 + i^0, k^0 -> -1 + k^0, z^0 -> undef3273, rest remain the same}> 1 + i^0, z^0 -> undef3273, rest remain the same}> 1 + j^0, z^0 -> undef3402, 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}> undef2327, i^0 -> 2 + j^0, j^0 -> 1 + j^0, z^0 -> undef2365, rest remain the same}> 1 + jj^0, z^0 -> undef1849, rest remain the same}> undef2193, rest remain the same}> undef1978, rest remain the same}> undef1978, rest remain the same}> 1 + jj^0, z^0 -> undef2236, rest remain the same}> undef2632, its^0 -> 1 + its^0, k^0 -> -1 + k^0, nm^0 -> -1 + k^0, rest remain the same}> undef2327, i^0 -> 1 + j^0, nm^0 -> -1 + k^0, z^0 -> undef2365, rest remain the same}> undef2632, its^0 -> 1 + its^0, k^0 -> -1 + k^0, nm^0 -> -1 + k^0, rest remain the same}> undef2327, i^0 -> 1 + j^0, nm^0 -> -1 + k^0, z^0 -> undef2365, rest remain the same}> 1, g^0 -> undef2632, its^0 -> 1 + its^0, nm^0 -> -1 + k^0, rest remain the same}> undef2327, i^0 -> 1 + j^0, nm^0 -> -1 + k^0, z^0 -> undef2365, rest remain the same}> 1, g^0 -> undef2632, its^0 -> 1 + its^0, nm^0 -> -1 + k^0, rest remain the same}> undef2327, i^0 -> 1 + j^0, nm^0 -> -1 + k^0, z^0 -> undef2365, rest remain the same}> undef2632, its^0 -> 1 + its^0, k^0 -> -1 + k^0, nm^0 -> -1 + k^0, rest remain the same}> undef2327, i^0 -> 1 + j^0, nm^0 -> -1 + k^0, z^0 -> undef2365, rest remain the same}> undef2632, its^0 -> 1 + its^0, k^0 -> -1 + k^0, nm^0 -> -1 + k^0, rest remain the same}> undef2327, i^0 -> 1 + j^0, nm^0 -> -1 + k^0, z^0 -> undef2365, rest remain the same}> undef3273, rest remain the same}> undef3273, rest remain the same}> -1 + k^0, z^0 -> undef3273, rest remain the same}> undef3273, rest remain the same}> undef3273, rest remain the same}> undef3273, rest remain the same}> -1 + k^0, z^0 -> undef3273, rest remain the same}> undef3273, rest remain the same}> undef3450, rest remain the same}> undef3450, rest remain the same}> undef3273, rest remain the same}> undef3273, rest remain the same}> -1 + k^0, z^0 -> undef3273, rest remain the same}> undef3273, rest remain the same}> undef3273, rest remain the same}> undef3273, rest remain the same}> -1 + k^0, z^0 -> undef3273, rest remain the same}> undef3273, rest remain the same}> undef3450, rest remain the same}> undef3450, rest remain the same}> undef3273, rest remain the same}> undef3273, rest remain the same}> -1 + k^0, z^0 -> undef3273, rest remain the same}> undef3273, rest remain the same}> Variables: 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.081041s 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 -> undef3273, rest remain the same}> 1 + i^0, z^0 -> undef3273, rest remain the same}> 1 + i^0, z^0 -> undef3273, rest remain the same}> undef3450, i^0 -> 1 + i^0, rest remain the same}> undef3450, i^0 -> 1 + i^0, rest remain the same}> 1 + i^0, z^0 -> undef3273, rest remain the same}> 1 + i^0, z^0 -> undef3273, rest remain the same}> 1 + i^0, z^0 -> undef3273, rest remain the same}> 1 + j^0, z^0 -> undef3402, 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}> undef2327, i^0 -> 2 + j^0, j^0 -> 1 + j^0, z^0 -> undef2365, rest remain the same}> 1 + jj^0, z^0 -> undef1849, rest remain the same}> undef2193, rest remain the same}> undef1978, rest remain the same}> undef1978, rest remain the same}> 1 + jj^0, z^0 -> undef2236, rest remain the same}> undef2632, its^0 -> 1 + its^0, k^0 -> -1 + k^0, nm^0 -> -1 + k^0, rest remain the same}> undef2327, i^0 -> 1 + j^0, nm^0 -> -1 + k^0, z^0 -> undef2365, rest remain the same}> undef2632, its^0 -> 1 + its^0, k^0 -> -1 + k^0, nm^0 -> -1 + k^0, rest remain the same}> undef2327, i^0 -> 1 + j^0, nm^0 -> -1 + k^0, z^0 -> undef2365, rest remain the same}> 1, g^0 -> undef2632, its^0 -> 1 + its^0, nm^0 -> -1 + k^0, rest remain the same}> undef2327, i^0 -> 1 + j^0, nm^0 -> -1 + k^0, z^0 -> undef2365, rest remain the same}> 1, g^0 -> undef2632, its^0 -> 1 + its^0, nm^0 -> -1 + k^0, rest remain the same}> undef2327, i^0 -> 1 + j^0, nm^0 -> -1 + k^0, z^0 -> undef2365, rest remain the same}> undef2632, its^0 -> 1 + its^0, k^0 -> -1 + k^0, nm^0 -> -1 + k^0, rest remain the same}> undef2327, i^0 -> 1 + j^0, nm^0 -> -1 + k^0, z^0 -> undef2365, rest remain the same}> undef2632, its^0 -> 1 + its^0, k^0 -> -1 + k^0, nm^0 -> -1 + k^0, rest remain the same}> undef2327, i^0 -> 1 + j^0, nm^0 -> -1 + k^0, z^0 -> undef2365, rest remain the same}> undef3273, rest remain the same}> undef3273, rest remain the same}> undef3273, rest remain the same}> undef3273, rest remain the same}> undef3273, rest remain the same}> undef3273, rest remain the same}> undef3450, rest remain the same}> undef3450, rest remain the same}> undef3273, rest remain the same}> undef3273, rest remain the same}> undef3273, rest remain the same}> undef3273, rest remain the same}> undef3273, rest remain the same}> undef3273, rest remain the same}> undef3450, rest remain the same}> undef3450, rest remain the same}> undef3273, rest remain the same}> undef3273, rest remain the same}> undef3273, rest remain the same}> Variables: 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.065542s 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 -> undef3273, rest remain the same}> 1 + i^0, z^0 -> undef3273, rest remain the same}> 1 + i^0, z^0 -> undef3273, rest remain the same}> undef3450, i^0 -> 1 + i^0, rest remain the same}> undef3450, i^0 -> 1 + i^0, rest remain the same}> 1 + i^0, z^0 -> undef3273, rest remain the same}> 1 + i^0, z^0 -> undef3273, rest remain the same}> 1 + i^0, z^0 -> undef3273, 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}> undef2327, i^0 -> 2 + j^0, j^0 -> 1 + j^0, z^0 -> undef2365, rest remain the same}> 1 + jj^0, z^0 -> undef1849, rest remain the same}> undef2193, rest remain the same}> undef1978, rest remain the same}> undef1978, rest remain the same}> 1 + jj^0, z^0 -> undef2236, rest remain the same}> undef2632, its^0 -> 1 + its^0, k^0 -> -1 + k^0, nm^0 -> -1 + k^0, rest remain the same}> undef2327, i^0 -> 1 + j^0, nm^0 -> -1 + k^0, z^0 -> undef2365, rest remain the same}> undef2632, its^0 -> 1 + its^0, k^0 -> -1 + k^0, nm^0 -> -1 + k^0, rest remain the same}> undef2327, i^0 -> 1 + j^0, nm^0 -> -1 + k^0, z^0 -> undef2365, rest remain the same}> 1, g^0 -> undef2632, its^0 -> 1 + its^0, nm^0 -> -1 + k^0, rest remain the same}> undef2327, i^0 -> 1 + j^0, nm^0 -> -1 + k^0, z^0 -> undef2365, rest remain the same}> 1, g^0 -> undef2632, its^0 -> 1 + its^0, nm^0 -> -1 + k^0, rest remain the same}> undef2327, i^0 -> 1 + j^0, nm^0 -> -1 + k^0, z^0 -> undef2365, rest remain the same}> undef2632, its^0 -> 1 + its^0, k^0 -> -1 + k^0, nm^0 -> -1 + k^0, rest remain the same}> undef2327, i^0 -> 1 + j^0, nm^0 -> -1 + k^0, z^0 -> undef2365, rest remain the same}> undef2632, its^0 -> 1 + its^0, k^0 -> -1 + k^0, nm^0 -> -1 + k^0, rest remain the same}> undef2327, i^0 -> 1 + j^0, nm^0 -> -1 + k^0, z^0 -> undef2365, rest remain the same}> undef3273, rest remain the same}> undef3273, rest remain the same}> undef3273, rest remain the same}> undef3273, rest remain the same}> undef3273, rest remain the same}> undef3273, rest remain the same}> undef3450, rest remain the same}> undef3450, rest remain the same}> undef3273, rest remain the same}> undef3273, rest remain the same}> undef3273, rest remain the same}> undef3273, rest remain the same}> undef3273, rest remain the same}> undef3273, rest remain the same}> undef3450, rest remain the same}> undef3450, rest remain the same}> undef3273, rest remain the same}> undef3273, rest remain the same}> undef3273, rest remain the same}> Variables: 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.083126s Ranking function: -32 + 32*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 -> undef2632, 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 -> undef2632, 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 -> undef2632, 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 -> undef2632, 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 -> undef3273, rest remain the same}> 1 + i^0, z^0 -> undef3273, rest remain the same}> 1 + i^0, z^0 -> undef3273, rest remain the same}> undef3450, i^0 -> 1 + i^0, rest remain the same}> undef3450, i^0 -> 1 + i^0, rest remain the same}> 1 + i^0, z^0 -> undef3273, rest remain the same}> 1 + i^0, z^0 -> undef3273, rest remain the same}> 1 + i^0, z^0 -> undef3273, 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}> undef2327, i^0 -> 2 + j^0, j^0 -> 1 + j^0, z^0 -> undef2365, rest remain the same}> 1 + jj^0, z^0 -> undef1849, rest remain the same}> undef2193, rest remain the same}> undef1978, rest remain the same}> undef1978, rest remain the same}> 1 + jj^0, z^0 -> undef2236, rest remain the same}> undef2327, i^0 -> 1 + j^0, nm^0 -> -1 + k^0, z^0 -> undef2365, rest remain the same}> undef2327, i^0 -> 1 + j^0, nm^0 -> -1 + k^0, z^0 -> undef2365, rest remain the same}> 1, g^0 -> undef2632, its^0 -> 1 + its^0, nm^0 -> -1 + k^0, rest remain the same}> undef2327, i^0 -> 1 + j^0, nm^0 -> -1 + k^0, z^0 -> undef2365, rest remain the same}> 1, g^0 -> undef2632, its^0 -> 1 + its^0, nm^0 -> -1 + k^0, rest remain the same}> undef2327, i^0 -> 1 + j^0, nm^0 -> -1 + k^0, z^0 -> undef2365, rest remain the same}> undef2327, i^0 -> 1 + j^0, nm^0 -> -1 + k^0, z^0 -> undef2365, rest remain the same}> undef2327, i^0 -> 1 + j^0, nm^0 -> -1 + k^0, z^0 -> undef2365, rest remain the same}> undef3273, rest remain the same}> undef3273, rest remain the same}> undef3273, rest remain the same}> undef3273, rest remain the same}> undef3273, rest remain the same}> undef3273, rest remain the same}> undef3450, rest remain the same}> undef3450, rest remain the same}> undef3273, rest remain the same}> undef3273, rest remain the same}> undef3273, rest remain the same}> undef3273, rest remain the same}> undef3273, rest remain the same}> undef3273, rest remain the same}> undef3450, rest remain the same}> undef3450, rest remain the same}> undef3273, rest remain the same}> undef3273, rest remain the same}> undef3273, rest remain the same}> Variables: 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.065428s Ranking function: -32 - 2*its^0 + 46*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 -> undef3273, rest remain the same}> 1 + i^0, z^0 -> undef3273, rest remain the same}> undef3450, i^0 -> 1 + i^0, rest remain the same}> undef3450, i^0 -> 1 + i^0, rest remain the same}> 1 + i^0, z^0 -> undef3273, rest remain the same}> 1 + i^0, z^0 -> undef3273, rest remain the same}> 1, its^0 -> 1 + its^0, j^0 -> 1 + j^0, rest remain the same}> undef2327, i^0 -> 2 + j^0, j^0 -> 1 + j^0, z^0 -> undef2365, rest remain the same}> 1 + jj^0, z^0 -> undef1849, rest remain the same}> undef2193, rest remain the same}> undef1978, rest remain the same}> undef1978, rest remain the same}> 1 + jj^0, z^0 -> undef2236, rest remain the same}> undef2327, i^0 -> 1 + j^0, nm^0 -> -1 + k^0, z^0 -> undef2365, rest remain the same}> undef2327, i^0 -> 1 + j^0, nm^0 -> -1 + k^0, z^0 -> undef2365, rest remain the same}> 1, g^0 -> undef2632, its^0 -> 1 + its^0, nm^0 -> -1 + k^0, rest remain the same}> undef2327, i^0 -> 1 + j^0, nm^0 -> -1 + k^0, z^0 -> undef2365, rest remain the same}> 1, g^0 -> undef2632, its^0 -> 1 + its^0, nm^0 -> -1 + k^0, rest remain the same}> undef2327, i^0 -> 1 + j^0, nm^0 -> -1 + k^0, z^0 -> undef2365, rest remain the same}> undef2327, i^0 -> 1 + j^0, nm^0 -> -1 + k^0, z^0 -> undef2365, rest remain the same}> undef2327, i^0 -> 1 + j^0, nm^0 -> -1 + k^0, z^0 -> undef2365, rest remain the same}> undef3273, rest remain the same}> undef3273, rest remain the same}> undef3273, rest remain the same}> undef3273, rest remain the same}> undef3450, rest remain the same}> undef3450, rest remain the same}> undef3273, rest remain the same}> undef3273, rest remain the same}> undef3273, rest remain the same}> undef3273, rest remain the same}> undef3450, rest remain the same}> undef3450, rest remain the same}> undef3273, rest remain the same}> undef3273, rest remain the same}> Variables: 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.048723s Ranking function: (1015 / 2) + (~(35) / 2)*its^0 New Graphs: Transitions: 1 + j^0, rest remain the same}> Variables: j^0, n^0 Transitions: undef3450, i^0 -> 1 + i^0, rest remain the same}> undef3450, i^0 -> 1 + i^0, rest remain the same}> Variables: g^0, i^0, j^0, k^0, m^0 Transitions: undef2327, i^0 -> 2 + j^0, j^0 -> 1 + j^0, z^0 -> undef2365, rest remain the same}> 1 + jj^0, z^0 -> undef1849, rest remain the same}> undef2193, rest remain the same}> undef1978, rest remain the same}> undef1978, rest remain the same}> 1 + jj^0, z^0 -> undef2236, 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 {l29}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.010568s Ranking function: -j^0 + n^0 New Graphs: Transitions: undef3450, i^0 -> 1 + i^0, rest remain the same}> undef3450, i^0 -> 1 + i^0, rest remain the same}> Variables: g^0, i^0, j^0, k^0, m^0 Transitions: undef2327, i^0 -> 2 + j^0, j^0 -> 1 + j^0, z^0 -> undef2365, rest remain the same}> 1 + jj^0, z^0 -> undef1849, rest remain the same}> undef2193, rest remain the same}> undef1978, rest remain the same}> undef1978, rest remain the same}> 1 + jj^0, z^0 -> undef2236, 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 {l24}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.012261s Ranking function: -1 - i^0 + k^0 New Graphs: Transitions: undef2327, i^0 -> 2 + j^0, j^0 -> 1 + j^0, z^0 -> undef2365, rest remain the same}> 1 + jj^0, z^0 -> undef1849, rest remain the same}> undef2193, rest remain the same}> undef1978, rest remain the same}> undef1978, rest remain the same}> 1 + jj^0, z^0 -> undef2236, 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 {l42, l47}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.015114s Ranking function: -3*jj^0 + 3*m^0 New Graphs: Transitions: undef2327, i^0 -> 2 + j^0, j^0 -> 1 + j^0, z^0 -> undef2365, rest remain the same}> undef2193, rest remain the same}> undef1978, rest remain the same}> undef1978, rest remain the same}> 1 + jj^0, z^0 -> undef2236, 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 {l42, l47}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.014734s Ranking function: -1 - j^0 + nm^0 New Graphs: Transitions: 1 + jj^0, z^0 -> undef2236, rest remain the same}> Variables: jj^0, n^0, z^0 Checking conditional termination of SCC {l47}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.010923s Ranking function: -jj^0 + n^0 New Graphs: Proving termination of subgraph 4 Analyzing SCC {l79}... No cycles found. Program Terminates