/export/starexec/sandbox2/solver/bin/starexec_run_termcomp17 /export/starexec/sandbox2/benchmark/theBenchmark.c /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES Solver Timeout: 4 Global Timeout: 300 Maximum number of concurrent processes: 900 ******************************************************************************************* *********************** UNPROCESSED TRANSITION SYSTEMS PER FUNCTION *********************** ******************************************************************************************* List of LLVMGraphs + assumeNodes + staticAssertNodes [1] : +++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++ + + Init Location: 0 Transitions: 0, main_n -> ¿functionCall(__VERIFIER_nondet_int), main_b -> ¿functionCall(__VERIFIER_nondet_int), main_x -> ¿functionCall(__VERIFIER_nondet_int), main_y -> ¿functionCall(__VERIFIER_nondet_int)}> = 0))> = 0)> (main_y + 1)}> 1}> (main_y - 1)}> (main_x - 1), main_b -> 0}> 0}> Fresh variables: Undef variables: Abstraction variables: Exit nodes: Accepting locations: Asserts: + Assume Nodes [0]: ++++++++++++++++++++++++++++++++++++++++++++++++ + Static Assert Nodes [0]: +++++++++++++++++++++++++++++++++++++++++ + After preprocess (paralelization): ++++++++++++++++++++++++++++++ Init Location: 0 Transitions: 0}> ¿functionCall(__VERIFIER_nondet_int)}> varCall_1}> ¿functionCall(__VERIFIER_nondet_int)}> varCall_2}> ¿functionCall(__VERIFIER_nondet_int)}> varCall_3}> ¿functionCall(__VERIFIER_nondet_int)}> varCall_4}> = 0)> = 0))> (main_y + 1)}> ¿functionCall(__VERIFIER_nondet_int)}> 1}> (main_y - 1)}> ¿functionCall(__VERIFIER_nondet_int)}> (main_x - 1), main_b -> 0}> 0}> Fresh variables: Undef variables: Abstraction variables: Exit nodes: 18, Accepting locations: Asserts: + + +++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++ Function Return and Parameters Information [2 functions]: function name: __VERIFIER_nondet_int [1 return + 0 parameters] demangled: __VERIFIER_nondet_int __VERIFIER_nondet_int__func_return_ [function result] : int function name: main [1 return + 0 parameters] demangled: main main__func_return_ [function result] : int AST Ident Scanner Information [6 idents]: __VERIFIER_nondet_int | function | [integer, ()] | | main | function | [integer, ()] | x | local variable | integer | | y | local variable | integer | | n | local variable | integer | | b | local variable | integer | | Main function: main Preprocessed LLVMGraph Init Location: 0 Transitions: = 0) /\ (0 <= main_y) /\ (main_y <= main_n) /\ (main_b = 0) /\ (undef11 = 0), par{main_y -> (main_y + 1), varCall_5 -> undef11}> = 0) /\ (0 <= main_y) /\ (main_y <= main_n) /\ (main_b = 0) /\ (undef11 = 1), par{main_y -> (main_y + 1), main_b -> 1, varCall_5 -> undef11}> = 0) /\ (0 <= main_y) /\ (main_y <= main_n) /\ (main_b < 0) /\ (undef12 = 0), par{main_y -> (main_y - 1), varCall_6 -> undef12}> = 0) /\ (0 <= main_y) /\ (main_y <= main_n) /\ (main_b < 0) /\ (undef12 = 1), par{main_x -> (main_x - 1), main_y -> (main_y - 1), main_b -> 0, varCall_6 -> undef12}> = 0) /\ (0 <= main_y) /\ (main_y <= main_n) /\ (main_b > 0) /\ (undef12 = 0), par{main_y -> (main_y - 1), varCall_6 -> undef12}> = 0) /\ (0 <= main_y) /\ (main_y <= main_n) /\ (main_b > 0) /\ (undef12 = 1), par{main_x -> (main_x - 1), main_y -> (main_y - 1), main_b -> 0, varCall_6 -> undef12}> = 0) /\ (0 <= main_y) /\ not((main_y <= main_n))> = 0) /\ not((0 <= main_y))> = 0))> Fresh variables: undef7, undef8, undef9, undef10, undef11, undef12, Undef variables: undef7, undef8, undef9, undef10, undef11, undef12, Abstraction variables: Exit nodes: 18, Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: 1 + main_y, varCall_5 -> undef11, rest remain the same}> 1 + main_y, main_b -> 1, varCall_5 -> undef11, rest remain the same}> -1 + main_y, varCall_6 -> undef12, rest remain the same}> -1 + main_x, main_y -> -1 + main_y, main_b -> 0, varCall_6 -> undef12, rest remain the same}> -1 + main_y, varCall_6 -> undef12, rest remain the same}> -1 + main_x, main_y -> -1 + main_y, main_b -> 0, varCall_6 -> undef12, rest remain the same}> Variables: main_x, main_y, main_n, main_b, varCall_5, varCall_6 Graph 2: Transitions: Variables: Precedence: Graph 0 Graph 1 Graph 2 Map Locations to Subgraph: ( 0 , 0 ) ( 2 , 1 ) ( 18 , 2 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.027955 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.007691s Ranking function: main_x New Graphs: Transitions: 1 + main_y, varCall_5 -> undef11, rest remain the same}> 1 + main_y, main_b -> 1, varCall_5 -> undef11, rest remain the same}> -1 + main_y, varCall_6 -> undef12, rest remain the same}> -1 + main_y, varCall_6 -> undef12, rest remain the same}> Variables: main_x, main_y, main_n, main_b, varCall_5, varCall_6 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003523s Ranking function: -2*main_b New Graphs: Transitions: 1 + main_y, varCall_5 -> undef11, rest remain the same}> -1 + main_y, varCall_6 -> undef12, rest remain the same}> -1 + main_y, varCall_6 -> undef12, rest remain the same}> Variables: main_x, main_y, main_n, main_b, varCall_5, varCall_6 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002379s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.012875s [44504 : 44507] [44504 : 44508] Successful child: 44508 Ranking function: main_y Ranking function and negation of Quasi-Invariant applied New Graphs: Transitions: 1 + main_y, varCall_5 -> undef11, rest remain the same}> -1 + main_y, varCall_6 -> undef12, rest remain the same}> Variables: main_x, main_y, main_n, main_b, varCall_5, varCall_6 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002037s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.009608s [44504 : 44512] [44504 : 44513] Successful child: 44513 Ranking function: main_y Ranking function and negation of Quasi-Invariant applied New Graphs: Transitions: 1 + main_y, varCall_5 -> undef11, rest remain the same}> Variables: main_x, main_y, main_n, main_b, varCall_5 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001888s Ranking function: -main_y + main_n New Graphs: Proving termination of subgraph 2 Analyzing SCC {l18}... No cycles found. Program Terminates