/export/starexec/sandbox2/solver/bin/starexec_run_termcomp17 /export/starexec/sandbox2/benchmark/theBenchmark.smt2 /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- NO Solver Timeout: 4 Global Timeout: 300 Maximum number of concurrent processes: 900 No parsing errors! Init Location: 0 Transitions: undef5}> undef42, __cil_tmp5_20^0 -> undef45}> (0 + Result_5^0), i_22^0 -> (1 + i_22^0), len_98^0 -> (1 + len_98^0)}> (0 + x_16^0), len_98^0 -> undef147, ret_18^0 -> 0}> (1 + lt2^0), lt3^0 -> (~(1) + lt3^0)}> (0 + x_16^0), ret_18^0 -> 0}> 0, lt3^0 -> (0 + lt1^0)}> (0 + l_11^0), len_98^0 -> undef434, prev_14^0 -> 0}> (1 + i^0), lt1^0 -> (1 + lt1^0)}> undef622}> undef705}> (0 + undef742), __cil_tmp5_15^0 -> undef742, l_11^0 -> undef761, len_98^0 -> undef762}> 0, i_22^0 -> 0, sz_23^0 -> (0 + undef813), tmp_24^0 -> undef813}> (0 + Result_5^0)}> 0, lt1^0 -> 0}> undef926}> (0 + undef946), __cil_tmp5_10^0 -> undef946, a_6^0 -> undef953, buffer_604^0 -> undef958, d_7^0 -> undef961, i_22^0 -> undef965, len_98^0 -> undef967, sz_23^0 -> undef976, tmp_24^0 -> undef977, tmp_9^0 -> undef978, tmp___0_25^0 -> undef979, tmp___0_605^0 -> undef981, x_8^0 -> undef984}> undef998, i_22^0 -> undef1008, sz_23^0 -> undef1019, tmp_24^0 -> undef1020, x_16^0 -> undef1026}> undef1029, __cil_tmp5_10^0 -> undef1030, a_6^0 -> undef1037, buffer_21^0 -> (0 + undef1029), buffer_35^0 -> undef1041, d_7^0 -> undef1045, i_22^0 -> (1 + undef1070), len_98^0 -> (0 + undef1070), sz_23^0 -> undef1060, tmp_24^0 -> undef1061, tmp_9^0 -> undef1062, tmp___0_25^0 -> undef1063, tmp___0_36^0 -> undef1064, x_8^0 -> undef1068}> (0 + Result_5^0), i_22^0 -> (1 + i_22^0), len_98^0 -> (0 + i_22^0)}> undef1175}> undef1201}> undef1246, cand_1104^0 -> undef1249, cand_19^0 -> (0 + h_17^0), h_17^0 -> undef1253, i_22^0 -> undef1255, l_11^0 -> undef1256, len_98^0 -> undef1257, lt_29^0 -> undef1261, ret_1103^0 -> undef1263, sz_23^0 -> undef1266, tmp_24^0 -> undef1267, x_12^0 -> undef1272, x_16^0 -> undef1273}> undef1287, i_22^0 -> undef1298, len_98^0 -> undef1300, sz_23^0 -> undef1309, tmp_24^0 -> undef1310, x_16^0 -> undef1316}> undef1349}> Fresh variables: undef5, undef42, undef45, undef83, undef147, undef434, undef622, undef705, undef742, undef761, undef762, undef813, undef926, undef946, undef953, undef958, undef961, undef965, undef967, undef976, undef977, undef978, undef979, undef981, undef984, undef986, undef987, undef998, undef1008, undef1019, undef1020, undef1026, undef1029, undef1030, undef1037, undef1041, undef1045, undef1060, undef1061, undef1062, undef1063, undef1064, undef1068, undef1070, undef1175, undef1201, undef1246, undef1249, undef1253, undef1255, undef1256, undef1257, undef1261, undef1263, undef1266, undef1267, undef1272, undef1273, undef1276, undef1277, undef1287, undef1298, undef1300, undef1309, undef1310, undef1316, undef1349, Undef variables: undef5, undef42, undef45, undef83, undef147, undef434, undef622, undef705, undef742, undef761, undef762, undef813, undef926, undef946, undef953, undef958, undef961, undef965, undef967, undef976, undef977, undef978, undef979, undef981, undef984, undef986, undef987, undef998, undef1008, undef1019, undef1020, undef1026, undef1029, undef1030, undef1037, undef1041, undef1045, undef1060, undef1061, undef1062, undef1063, undef1064, undef1068, undef1070, undef1175, undef1201, undef1246, undef1249, undef1253, undef1255, undef1256, undef1257, undef1261, undef1263, undef1266, undef1267, undef1272, undef1273, undef1276, undef1277, undef1287, undef1298, undef1300, undef1309, undef1310, undef1316, undef1349, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: undef1298, len_98^0 -> undef1300, sz_23^0 -> undef1309, x_16^0 -> undef1316}> undef1349}> 0, lt1^0 -> 0, sz^0 -> undef1349}> undef1298, len_98^0 -> undef1300, sz_23^0 -> undef1309, x_16^0 -> undef1316}> (1 + i_22^0), len_98^0 -> undef926, sz^0 -> undef1349}> 0, i_22^0 -> (1 + i_22^0), len_98^0 -> undef926, lt1^0 -> 0, sz^0 -> undef1349}> (0 + undef946), i_22^0 -> undef965, len_98^0 -> undef967, sz_23^0 -> undef976}> undef147}> undef1201, i_22^0 -> undef1255, l_11^0 -> undef1256, len_98^0 -> undef1257, sz_23^0 -> undef1266, x_12^0 -> undef1272, x_16^0 -> undef1273}> (1 + lt2^0), lt3^0 -> (~(1) + lt3^0)}> undef622, len_98^0 -> undef434}> undef705, len_98^0 -> undef434}> (0 + undef742), l_11^0 -> undef761, len_98^0 -> undef762}> (0 + undef742), i^0 -> 0, l_11^0 -> undef761, len_98^0 -> undef762, lt1^0 -> 0}> undef5}> undef42}> 0, lt3^0 -> (0 + lt1^0)}> (1 + i^0), lt1^0 -> (1 + lt1^0)}> Fresh variables: undef5, undef42, undef45, undef83, undef147, undef434, undef622, undef705, undef742, undef761, undef762, undef813, undef926, undef946, undef953, undef958, undef961, undef965, undef967, undef976, undef977, undef978, undef979, undef981, undef984, undef986, undef987, undef998, undef1008, undef1019, undef1020, undef1026, undef1029, undef1030, undef1037, undef1041, undef1045, undef1060, undef1061, undef1062, undef1063, undef1064, undef1068, undef1070, undef1175, undef1201, undef1246, undef1249, undef1253, undef1255, undef1256, undef1257, undef1261, undef1263, undef1266, undef1267, undef1272, undef1273, undef1276, undef1277, undef1287, undef1298, undef1300, undef1309, undef1310, undef1316, undef1349, Undef variables: undef5, undef42, undef45, undef83, undef147, undef434, undef622, undef705, undef742, undef761, undef762, undef813, undef926, undef946, undef953, undef958, undef961, undef965, undef967, undef976, undef977, undef978, undef979, undef981, undef984, undef986, undef987, undef998, undef1008, undef1019, undef1020, undef1026, undef1029, undef1030, undef1037, undef1041, undef1045, undef1060, undef1061, undef1062, undef1063, undef1064, undef1068, undef1070, undef1175, undef1201, undef1246, undef1249, undef1253, undef1255, undef1256, undef1257, undef1261, undef1263, undef1266, undef1267, undef1272, undef1273, undef1276, undef1277, undef1287, undef1298, undef1300, undef1309, undef1310, undef1316, undef1349, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: undef1298, len_98^0 -> undef1300, sz_23^0 -> undef1309, x_16^0 -> undef1316, rest remain the same}> 0, i_22^0 -> 1 + i_22^0, len_98^0 -> undef926, lt1^0 -> 0, sz^0 -> undef1349, rest remain the same}> undef946, i_22^0 -> undef965, len_98^0 -> undef967, sz_23^0 -> undef976, rest remain the same}> undef1201, i_22^0 -> undef1255, l_11^0 -> undef1256, len_98^0 -> undef1257, sz_23^0 -> undef1266, x_12^0 -> undef1272, x_16^0 -> undef1273, rest remain the same}> 1 + lt2^0, lt3^0 -> -1 + lt3^0, rest remain the same}> undef742, i^0 -> 0, l_11^0 -> undef761, len_98^0 -> undef762, lt1^0 -> 0, rest remain the same}> 0, lt3^0 -> lt1^0, rest remain the same}> 1 + i^0, lt1^0 -> 1 + lt1^0, rest remain the same}> Variables: i_22^0, len_98^0, sz_23^0, x_16^0, sz^0, Result_5^0, __disjvr_3^0, l_11^0, x_12^0, y_1094^0, lt3^0, lt2^0, i^0, lt1^0 Graph 2: Transitions: Variables: Graph 3: Transitions: Variables: Graph 4: Transitions: Variables: Graph 5: Transitions: Variables: Graph 6: Transitions: Variables: Graph 7: Transitions: Variables: Precedence: Graph 0 Graph 1 undef1298, len_98^0 -> undef1300, sz_23^0 -> undef1309, x_16^0 -> undef1316, rest remain the same}> 0, lt1^0 -> 0, sz^0 -> undef1349, rest remain the same}> Graph 2 undef42, rest remain the same}> Graph 3 undef5, rest remain the same}> Graph 4 undef1349, rest remain the same}> 1 + i_22^0, len_98^0 -> undef926, sz^0 -> undef1349, rest remain the same}> undef742, l_11^0 -> undef761, len_98^0 -> undef762, rest remain the same}> Graph 5 undef705, len_98^0 -> undef434, rest remain the same}> Graph 6 undef622, len_98^0 -> undef434, rest remain the same}> Graph 7 undef147, rest remain the same}> Map Locations to Subgraph: ( 0 , 0 ) ( 2 , 3 ) ( 3 , 2 ) ( 4 , 1 ) ( 6 , 1 ) ( 12 , 1 ) ( 16 , 6 ) ( 18 , 5 ) ( 22 , 4 ) ( 24 , 7 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.124906 Checking conditional termination of SCC {l4, l6, l12}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.020230s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.033514s [58964 : 59019] [58964 : 59020] Successful child: 59019 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef1298, len_98^0 -> undef1300, sz_23^0 -> undef1309, x_16^0 -> undef1316, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 0, i_22^0 -> 1 + i_22^0, len_98^0 -> undef926, lt1^0 -> 0, sz^0 -> undef1349, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef946, i_22^0 -> undef965, len_98^0 -> undef967, sz_23^0 -> undef976, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef1201, i_22^0 -> undef1255, l_11^0 -> undef1256, len_98^0 -> undef1257, sz_23^0 -> undef1266, x_12^0 -> undef1272, x_16^0 -> undef1273, 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 + lt2^0, lt3^0 -> -1 + lt3^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef742, i^0 -> 0, l_11^0 -> undef761, len_98^0 -> undef762, lt1^0 -> 0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 0, lt3^0 -> lt1^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + i^0, lt1^0 -> 1 + lt1^0, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef1298, len_98^0 -> undef1300, sz_23^0 -> undef1309, x_16^0 -> undef1316, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 0, i_22^0 -> 1 + i_22^0, len_98^0 -> undef926, lt1^0 -> 0, sz^0 -> undef1349, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef946, i_22^0 -> undef965, len_98^0 -> undef967, sz_23^0 -> undef976, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef1201, i_22^0 -> undef1255, l_11^0 -> undef1256, len_98^0 -> undef1257, sz_23^0 -> undef1266, x_12^0 -> undef1272, x_16^0 -> undef1273, 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 + lt2^0, lt3^0 -> -1 + lt3^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef742, i^0 -> 0, l_11^0 -> undef761, len_98^0 -> undef762, lt1^0 -> 0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 0, lt3^0 -> lt1^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + i^0, lt1^0 -> 1 + lt1^0, rest remain the same}> New Graphs: Transitions: 1 + lt2^0, lt3^0 -> -1 + lt3^0, rest remain the same}> Variables: len_98^0, lt2^0, lt3^0 Checking conditional termination of SCC {l6}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002615s Ranking function: -1 + lt3^0 New Graphs: [58964 : 59171] [58964 : 59172] INVARIANTS: 4: 6: 12: Quasi-INVARIANTS to narrow Graph: 4: 1 + len_98^0 <= 0 , 6: 1 + len_98^0 <= 0 , 12: 1 <= 0 , Narrowing transition: undef1298, len_98^0 -> undef1300, sz_23^0 -> undef1309, x_16^0 -> undef1316, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 0, i_22^0 -> 1 + i_22^0, len_98^0 -> undef926, lt1^0 -> 0, sz^0 -> undef1349, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: undef946, i_22^0 -> undef965, len_98^0 -> undef967, sz_23^0 -> undef976, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: undef1201, i_22^0 -> undef1255, l_11^0 -> undef1256, len_98^0 -> undef1257, sz_23^0 -> undef1266, x_12^0 -> undef1272, x_16^0 -> undef1273, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: LOG: Narrow transition size 1 Narrowing transition: 1 + lt2^0, lt3^0 -> -1 + lt3^0, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: undef742, i^0 -> 0, l_11^0 -> undef761, len_98^0 -> undef762, lt1^0 -> 0, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 0, lt3^0 -> lt1^0, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1 + i^0, lt1^0 -> 1 + lt1^0, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: undef1298, len_98^0 -> undef1300, sz_23^0 -> undef1309, x_16^0 -> undef1316, rest remain the same}> 0, i_22^0 -> 1 + i_22^0, len_98^0 -> undef926, lt1^0 -> 0, sz^0 -> undef1349, rest remain the same}> undef946, i_22^0 -> undef965, len_98^0 -> undef967, sz_23^0 -> undef976, rest remain the same}> undef1201, i_22^0 -> undef1255, l_11^0 -> undef1256, len_98^0 -> undef1257, sz_23^0 -> undef1266, x_12^0 -> undef1272, x_16^0 -> undef1273, rest remain the same}> 1 + lt2^0, lt3^0 -> -1 + lt3^0, rest remain the same}> undef742, i^0 -> 0, l_11^0 -> undef761, len_98^0 -> undef762, lt1^0 -> 0, rest remain the same}> 0, lt3^0 -> lt1^0, rest remain the same}> 1 + i^0, lt1^0 -> 1 + lt1^0, rest remain the same}> Variables: i_22^0, len_98^0, sz_23^0, x_16^0, sz^0, Result_5^0, __disjvr_3^0, l_11^0, x_12^0, y_1094^0, lt3^0, lt2^0, i^0, lt1^0 Checking conditional termination of SCC {l4, l6, l12}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.006349s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.031751s [58964 : 59173] [58964 : 59174] Successful child: 59173 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef1298, len_98^0 -> undef1300, sz_23^0 -> undef1309, x_16^0 -> undef1316, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 0, i_22^0 -> 1 + i_22^0, len_98^0 -> undef926, lt1^0 -> 0, sz^0 -> undef1349, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef946, i_22^0 -> undef965, len_98^0 -> undef967, sz_23^0 -> undef976, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef1201, i_22^0 -> undef1255, l_11^0 -> undef1256, len_98^0 -> undef1257, sz_23^0 -> undef1266, x_12^0 -> undef1272, x_16^0 -> undef1273, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + lt2^0, lt3^0 -> -1 + lt3^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef742, i^0 -> 0, l_11^0 -> undef761, len_98^0 -> undef762, lt1^0 -> 0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, lt3^0 -> lt1^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, lt1^0 -> 1 + lt1^0, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef1298, len_98^0 -> undef1300, sz_23^0 -> undef1309, x_16^0 -> undef1316, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 0, i_22^0 -> 1 + i_22^0, len_98^0 -> undef926, lt1^0 -> 0, sz^0 -> undef1349, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef946, i_22^0 -> undef965, len_98^0 -> undef967, sz_23^0 -> undef976, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef1201, i_22^0 -> undef1255, l_11^0 -> undef1256, len_98^0 -> undef1257, sz_23^0 -> undef1266, x_12^0 -> undef1272, x_16^0 -> undef1273, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + lt2^0, lt3^0 -> -1 + lt3^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef742, i^0 -> 0, l_11^0 -> undef761, len_98^0 -> undef762, lt1^0 -> 0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, lt3^0 -> lt1^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, lt1^0 -> 1 + lt1^0, rest remain the same}> New Graphs: Transitions: 1 + i^0, lt1^0 -> 1 + lt1^0, rest remain the same}> Variables: i^0, len_98^0, lt1^0, sz^0 Checking conditional termination of SCC {l12}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002914s Ranking function: -1 - i^0 + sz^0 New Graphs: [58964 : 59178] [58964 : 59179] INVARIANTS: 4: 6: 12: Quasi-INVARIANTS to narrow Graph: 4: 1 <= 0 , 6: 1 + len_98^0 <= 0 , 12: 1 + len_98^0 <= 0 , Narrowing transition: undef1298, len_98^0 -> undef1300, sz_23^0 -> undef1309, x_16^0 -> undef1316, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 0, i_22^0 -> 1 + i_22^0, len_98^0 -> undef926, lt1^0 -> 0, sz^0 -> undef1349, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: undef946, i_22^0 -> undef965, len_98^0 -> undef967, sz_23^0 -> undef976, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: undef1201, i_22^0 -> undef1255, l_11^0 -> undef1256, len_98^0 -> undef1257, sz_23^0 -> undef1266, x_12^0 -> undef1272, x_16^0 -> undef1273, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: LOG: Narrow transition size 1 Narrowing transition: 1 + lt2^0, lt3^0 -> -1 + lt3^0, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: undef742, i^0 -> 0, l_11^0 -> undef761, len_98^0 -> undef762, lt1^0 -> 0, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 0, lt3^0 -> lt1^0, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1 + i^0, lt1^0 -> 1 + lt1^0, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: undef1298, len_98^0 -> undef1300, sz_23^0 -> undef1309, x_16^0 -> undef1316, rest remain the same}> 0, i_22^0 -> 1 + i_22^0, len_98^0 -> undef926, lt1^0 -> 0, sz^0 -> undef1349, rest remain the same}> undef946, i_22^0 -> undef965, len_98^0 -> undef967, sz_23^0 -> undef976, rest remain the same}> undef1201, i_22^0 -> undef1255, l_11^0 -> undef1256, len_98^0 -> undef1257, sz_23^0 -> undef1266, x_12^0 -> undef1272, x_16^0 -> undef1273, rest remain the same}> 1 + lt2^0, lt3^0 -> -1 + lt3^0, rest remain the same}> undef742, i^0 -> 0, l_11^0 -> undef761, len_98^0 -> undef762, lt1^0 -> 0, rest remain the same}> 0, lt3^0 -> lt1^0, rest remain the same}> 1 + i^0, lt1^0 -> 1 + lt1^0, rest remain the same}> Variables: i_22^0, len_98^0, sz_23^0, x_16^0, sz^0, Result_5^0, __disjvr_3^0, l_11^0, x_12^0, y_1094^0, lt3^0, lt2^0, i^0, lt1^0 Checking conditional termination of SCC {l4, l6, l12}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.006733s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.037145s [58964 : 59180] [58964 : 59181] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.245125s Time used: 0.241123 [58964 : 59185] [58964 : 59189] Successful child: 59185 Program does NOT terminate