/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_x -> ¿functionCall(__VERIFIER_nondet_int), main_y -> ¿functionCall(__VERIFIER_nondet_int), main_res -> 0}> = main_y))> = main_y)> 0))> 0)> main_y}> 0)> 0))> (main_ytmp - 1), main_x -> (main_x - 1)}> (main_ytmp + 1), main_x -> (main_x + 1)}> (main_res + 1)}> 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, main_res -> 0}> = main_y)> = main_y))> 0)> 0))> main_y}> 0)> 0))> (main_ytmp - 1), main_x -> (main_x - 1)}> (main_ytmp + 1), main_x -> (main_x + 1)}> (main_res + 1)}> 0}> Fresh variables: Undef variables: Abstraction variables: Exit nodes: 16, 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 | | ytmp | local variable | integer | | res | local variable | integer | | Main function: main Preprocessed LLVMGraph Init Location: 0 Transitions: = undef4) /\ (undef4 > 0), par{main_ytmp -> undef4}> = undef4) /\ not((undef4 > 0))> = undef4))> = main_y) /\ (main_y > 0), par{main_ytmp -> main_y, main_res -> (main_res + 1)}> = main_y) /\ not((main_y > 0)), par{main_res -> (main_res + 1)}> = main_y)), par{main_res -> (main_res + 1)}> 0)), par{main_x -> (main_x + 1), main_ytmp -> (main_ytmp + 1)}> 0) /\ (main_ytmp > 0), par{main_x -> (main_x - 1), main_ytmp -> (main_ytmp - 1)}> Fresh variables: undef3, undef4, Undef variables: undef3, undef4, Abstraction variables: Exit nodes: 16, Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: main_y, main_res -> 1 + main_res, rest remain the same}> 1 + main_x, main_ytmp -> 1 + main_ytmp, rest remain the same}> -1 + main_x, main_ytmp -> -1 + main_ytmp, rest remain the same}> Variables: main_x, main_y, main_ytmp, main_res Graph 2: Transitions: Variables: Precedence: Graph 0 Graph 1 undef4, rest remain the same}> Graph 2 1 + main_res, rest remain the same}> 1 + main_res, rest remain the same}> Map Locations to Subgraph: ( 0 , 0 ) ( 6 , 1 ) ( 16 , 2 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.012394 Some transition disabled by a set of invariant(s): Invariant at l6: 0 <= main_ytmp Strengthening and disabling transitions... > It's unfeasible. Removing transition: 1 + main_x, main_ytmp -> 1 + main_ytmp, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_res -> 1 + main_res, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + main_x, main_ytmp -> -1 + main_ytmp, rest remain the same}> Checking unfeasibility... Time used: 0.007613 Checking conditional termination of SCC {l6}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001484s Ranking function: 2*main_x - 2*main_y - 2*main_ytmp New Graphs: Transitions: -1 + main_x, main_ytmp -> -1 + main_ytmp, rest remain the same}> Variables: main_x, main_ytmp Checking conditional termination of SCC {l6}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000547s Ranking function: -1 + main_ytmp New Graphs: Proving termination of subgraph 2 Analyzing SCC {l16}... No cycles found. Program Terminates