/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: undef1, __cil_tmp6_12^0 -> undef2, c_15^0 -> (0 + undef42), x_13^0 -> 0}> undef46}> (~(2) + len_48^0), c_15^0 -> (0 + undef125), elem_16^0 -> undef103, lt_21^0 -> undef113, prev_17^0 -> undef114, x_13^0 -> (0 + undef120), y_14^0 -> undef120}> undef130}> (0 + undef208), cnt_133^0 -> undef182, cnt_139^0 -> undef183, elem_16^0 -> (0 + x_13^0), lt_21^0 -> undef196, prev_17^0 -> 0, y_14^0 -> (0 + c_15^0)}> undef214}> undef260, __patmp2^0 -> undef261, a_243^0 -> (0 + undef261), len_246^0 -> (0 + undef260), lt_19^0 -> undef277, lt_20^0 -> undef278, x_13^0 -> (0 + y_14^0)}> undef299}> (0 + undef375), elem_16^0 -> (0 + x_13^0), lt_21^0 -> undef363, prev_17^0 -> 0, y_14^0 -> (0 + c_15^0)}> (0 + undef407), i_8^0 -> (1 + i_8^0), len_48^0 -> (1 + len_48^0), tmp_10^0 -> undef407, tmp___0_11^0 -> undef408}> (0 + undef489), i_8^0 -> (1 + undef500), len_48^0 -> (0 + undef500), length_7^0 -> undef483, tmp_10^0 -> undef489, tmp___0_11^0 -> undef490, x_13^0 -> (0 + x_23^0)}> undef520, k_296^0 -> (0 + len_246^0)}> undef550}> undef611, lt_20^0 -> undef612, x_13^0 -> (0 + y_14^0)}> undef644, cnt_276^0 -> undef645}> undef676}> (0 + undef750), lt_18^0 -> undef735, lt_19^0 -> undef736, lt_20^0 -> undef737, prev_17^0 -> (0 + elem_16^0)}> undef753}> undef804, __patmp2^0 -> undef805, a_243^0 -> (0 + undef805), len_246^0 -> (0 + undef804)}> undef844}> (0 + undef917), elem_16^0 -> (0 + x_13^0), lt_21^0 -> undef905, prev_17^0 -> 0, y_14^0 -> (0 + c_15^0)}> Fresh variables: undef1, undef2, undef42, undef46, undef103, undef113, undef114, undef120, undef125, undef130, undef182, undef183, undef196, undef208, undef214, undef260, undef261, undef277, undef278, undef291, undef292, undef299, undef363, undef375, undef407, undef408, undef483, undef489, undef490, undef499, undef500, undef501, undef520, undef550, undef611, undef612, undef625, undef626, undef644, undef645, undef676, undef735, undef736, undef737, undef750, undef751, undef752, undef753, undef804, undef805, undef844, undef905, undef917, Undef variables: undef1, undef2, undef42, undef46, undef103, undef113, undef114, undef120, undef125, undef130, undef182, undef183, undef196, undef208, undef214, undef260, undef261, undef277, undef278, undef291, undef292, undef299, undef363, undef375, undef407, undef408, undef483, undef489, undef490, undef499, undef500, undef501, undef520, undef550, undef611, undef612, undef625, undef626, undef644, undef645, undef676, undef735, undef736, undef737, undef750, undef751, undef752, undef753, undef804, undef805, undef844, undef905, undef917, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: undef46, __disjvr_1^0 -> undef130, __disjvr_2^0 -> undef214, __disjvr_3^0 -> undef299, a_243^0 -> (0 + undef261), c_15^0 -> (0 + undef375), elem_16^0 -> (0 + (0 + (0 + (0 + undef125)))), len_246^0 -> (0 + undef260), prev_17^0 -> 0, y_14^0 -> (0 + (0 + undef208))}> (0 + undef407), i_8^0 -> (1 + i_8^0), len_48^0 -> (1 + len_48^0)}> undef550}> undef550, __disjvr_6^0 -> undef844, a_243^0 -> (0 + undef805), c_15^0 -> (0 + undef917), elem_16^0 -> (0 + (0 + y_14^0)), len_246^0 -> (0 + undef804), prev_17^0 -> 0, y_14^0 -> (0 + c_15^0)}> undef676, cnt_269^0 -> undef644, elem_16^0 -> (0 + undef750), prev_17^0 -> (0 + elem_16^0)}> Fresh variables: undef1, undef2, undef42, undef46, undef103, undef113, undef114, undef120, undef125, undef130, undef182, undef183, undef196, undef208, undef214, undef260, undef261, undef277, undef278, undef291, undef292, undef299, undef363, undef375, undef407, undef408, undef483, undef489, undef490, undef499, undef500, undef501, undef520, undef550, undef611, undef612, undef625, undef626, undef644, undef645, undef676, undef735, undef736, undef737, undef750, undef751, undef752, undef753, undef804, undef805, undef844, undef905, undef917, Undef variables: undef1, undef2, undef42, undef46, undef103, undef113, undef114, undef120, undef125, undef130, undef182, undef183, undef196, undef208, undef214, undef260, undef261, undef277, undef278, undef291, undef292, undef299, undef363, undef375, undef407, undef408, undef483, undef489, undef490, undef499, undef500, undef501, undef520, undef550, undef611, undef612, undef625, undef626, undef644, undef645, undef676, undef735, undef736, undef737, undef750, undef751, undef752, undef753, undef804, undef805, undef844, undef905, undef917, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: undef407, i_8^0 -> 1 + i_8^0, len_48^0 -> 1 + len_48^0, rest remain the same}> Variables: head_9^0, i_8^0, len_48^0, length_7^0 Graph 2: Transitions: undef550, __disjvr_6^0 -> undef844, a_243^0 -> undef805, c_15^0 -> undef917, elem_16^0 -> y_14^0, len_246^0 -> undef804, prev_17^0 -> 0, y_14^0 -> c_15^0, rest remain the same}> Variables: __disjvr_4^0, __disjvr_6^0, a_243^0, c_15^0, cnt_269^0, elem_16^0, len_246^0, prev_17^0, y_14^0, y_309^0 Graph 3: Transitions: Variables: Graph 4: Transitions: Variables: Precedence: Graph 0 Graph 1 Graph 2 undef46, __disjvr_1^0 -> undef130, __disjvr_2^0 -> undef214, __disjvr_3^0 -> undef299, a_243^0 -> undef261, c_15^0 -> undef375, elem_16^0 -> undef125, len_246^0 -> undef260, prev_17^0 -> 0, y_14^0 -> undef208, rest remain the same}> Graph 3 undef676, cnt_269^0 -> undef644, elem_16^0 -> undef750, prev_17^0 -> elem_16^0, rest remain the same}> Graph 4 undef550, rest remain the same}> Map Locations to Subgraph: ( 0 , 0 ) ( 1 , 1 ) ( 10 , 2 ) ( 18 , 3 ) ( 19 , 4 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.003509 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001519s Ranking function: -1 - i_8^0 + length_7^0 New Graphs: Proving termination of subgraph 2 Checking unfeasibility... Time used: 0.007594 Checking conditional termination of SCC {l10}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002803s Ranking function: a_243^0 New Graphs: Proving termination of subgraph 3 Analyzing SCC {l18}... No cycles found. Proving termination of subgraph 4 Analyzing SCC {l19}... No cycles found. Program Terminates