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)}> = 0))> = 0)> 0))> 0)> 1}> main_y))> main_y)> 0))> 0)> (2 * main_y)}> (main_x - 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}> = 0)> = 0))> 0)> 0))> 1}> main_y)> main_y))> 0)> 0))> (2 * main_y)}> (main_x - 1)}> 0}> Fresh variables: Undef variables: Abstraction variables: Exit nodes: 13, 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 [4 idents]: __VERIFIER_nondet_int | function | [integer, ()] | | main | function | [integer, ()] | x | local variable | integer | | y | local variable | integer | | Main function: main Preprocessed LLVMGraph Init Location: 0 Transitions: = 0) /\ (undef4 > 0), par{main_y -> 1}> = 0) /\ not((undef4 > 0)), par{main_y -> undef4}> = 0)), par{main_y -> undef4}> main_y) /\ (main_y > 0), par{main_y -> (2 * main_y)}> main_y) /\ not((main_y > 0)) /\ ((main_x - 1) >= 0) /\ not((main_y > 0)), par{main_x -> (main_x - 1)}> main_y) /\ not((main_y > 0)) /\ not(((main_x - 1) >= 0)), par{main_x -> (main_x - 1)}> main_y)) /\ ((main_x - 1) >= 0) /\ (main_y > 0), par{main_x -> (main_x - 1), main_y -> 1}> main_y)) /\ not(((main_x - 1) >= 0)), par{main_x -> (main_x - 1)}> Fresh variables: undef3, undef4, Undef variables: undef3, undef4, Abstraction variables: Exit nodes: 13, Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: 2*main_y, rest remain the same}> -1 + main_x, main_y -> 1, rest remain the same}> Variables: main_x, main_y Graph 2: Transitions: Variables: Precedence: Graph 0 Graph 1 1, rest remain the same}> Graph 2 undef4, rest remain the same}> undef4, rest remain the same}> -1 + main_x, rest remain the same}> -1 + main_x, rest remain the same}> -1 + main_x, rest remain the same}> Map Locations to Subgraph: ( 0 , 0 ) ( 6 , 1 ) ( 13 , 2 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.009012 Checking conditional termination of SCC {l6}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000750s Ranking function: -1 + main_x New Graphs: Transitions: 2*main_y, rest remain the same}> Variables: main_x, main_y Checking conditional termination of SCC {l6}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000334s Ranking function: -1 + main_x - main_y New Graphs: Proving termination of subgraph 2 Analyzing SCC {l13}... No cycles found. Program Terminates