/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}> 0))> 0)> 0))> 0)> (main_x - 1), main_y -> (main_y - 1)}> 0))> 0)> (main_y + 1), main_res -> (main_res + 1)}> 0))> 0)> 0))> 0)> (main_x - 1), main_y -> (main_y - 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}> 0)> 0))> 0)> 0))> (main_x - 1), main_y -> (main_y - 1)}> 0)> 0))> (main_y + 1), main_res -> (main_res + 1)}> 0)> 0))> 0)> 0))> (main_x - 1), main_y -> (main_y - 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 [5 idents]: __VERIFIER_nondet_int | function | [integer, ()] | | main | function | [integer, ()] | x | local variable | integer | | y | local variable | integer | | res | local variable | integer | | Main function: main Preprocessed LLVMGraph Init Location: 0 Transitions: 0) /\ (main_y > 0), par{main_x -> (main_x - 1), main_y -> (main_y - 1)}> 0) /\ not((main_y > 0)) /\ (main_x > 0), par{main_y -> (main_y + 1), main_res -> (main_res + 1)}> 0)) /\ not((main_x > 0))> 0) /\ (main_y > 0), par{main_x -> (main_x - 1), main_y -> (main_y - 1)}> 0) /\ not((main_y > 0)) /\ (main_x > 0), par{main_y -> (main_y + 1), main_res -> (main_res + 1)}> 0)) /\ not((main_x > 0))> 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: -1 + main_x, main_y -> -1 + main_y, rest remain the same}> Variables: main_x, main_y Graph 2: Transitions: -1 + main_x, main_y -> -1 + main_y, rest remain the same}> 1 + main_y, main_res -> 1 + main_res, rest remain the same}> Variables: main_x, main_y, main_res Graph 3: Transitions: Variables: Precedence: Graph 0 Graph 1 Graph 2 1 + main_y, main_res -> 1 + main_res, rest remain the same}> Graph 3 Map Locations to Subgraph: ( 0 , 0 ) ( 2 , 1 ) ( 10 , 2 ) ( 16 , 3 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.002025 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000680s Ranking function: -1 + main_x New Graphs: Proving termination of subgraph 2 Checking unfeasibility... Time used: 0.004329 Checking conditional termination of SCC {l10}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001228s Ranking function: -1 + main_x New Graphs: Transitions: 1 + main_y, main_res -> 1 + main_res, rest remain the same}> Variables: main_x, main_y, main_res Checking conditional termination of SCC {l10}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000643s Ranking function: -main_y New Graphs: Proving termination of subgraph 3 Analyzing SCC {l16}... No cycles found. Program Terminates