/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_x)}> ~(main_y)}> 0))> 0)> main_x}> = main_y))> = main_y)> (main_r - main_y)}> main_y, main_y -> main_r}> 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_x)}> ~(main_y)}> 0)> 0))> main_x}> = main_y)> = main_y))> (main_r - main_y)}> main_y, main_y -> main_r}> 0}> Fresh variables: Undef variables: Abstraction variables: Exit nodes: 17, 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 [5 idents]: __VERIFIER_nondet_int | function | [integer, ()] | | main | function | [integer, ()] | r | local variable | integer | | x | local variable | integer | | y | local variable | integer | | Main function: main Preprocessed LLVMGraph Init Location: 0 Transitions: 0), par{main_r -> ~(undef3), main_y -> ~(undef4)}> 0), par{main_r -> ~(undef3), main_y -> undef4}> 0)), par{main_y -> undef4}> 0), par{main_r -> undef3, main_y -> ~(undef4)}> 0), par{main_r -> undef3, main_y -> undef4}> 0)), par{main_y -> undef4}> = main_y), par{main_r -> (main_r - main_y)}> = main_y)) /\ (main_r > 0), par{main_r -> main_y, main_y -> main_r}> = main_y)) /\ not((main_r > 0)), par{main_y -> main_r}> Fresh variables: undef3, undef4, Undef variables: undef3, undef4, Abstraction variables: Exit nodes: 17, Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: main_r - main_y, rest remain the same}> main_y, main_y -> main_r, rest remain the same}> Variables: main_r, main_y Graph 2: Transitions: Variables: Precedence: Graph 0 Graph 1 -undef3, main_y -> -undef4, rest remain the same}> -undef3, main_y -> undef4, rest remain the same}> undef3, main_y -> -undef4, rest remain the same}> undef3, main_y -> undef4, rest remain the same}> Graph 2 undef4, rest remain the same}> undef4, rest remain the same}> main_r, rest remain the same}> Map Locations to Subgraph: ( 0 , 0 ) ( 11 , 1 ) ( 17 , 2 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.004189 Checking conditional termination of SCC {l11}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001230s Ranking function: -1 + main_y New Graphs: Transitions: main_r - main_y, rest remain the same}> Variables: main_r, main_y Checking conditional termination of SCC {l11}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000533s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001436s [55095 : 55096] [55095 : 55097] Successful child: 55096 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_r - main_y, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_r, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_r - main_y, rest remain the same}> Ranking function: main_r - main_y New Graphs: INVARIANTS: 11: 1 <= main_y , Quasi-INVARIANTS to narrow Graph: 11: Proving termination of subgraph 2 Analyzing SCC {l17}... No cycles found. Program Terminates