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_m -> ¿functionCall(__VERIFIER_nondet_int)}> = 0))> = 0)> 0)> 0))> main_n, main_v2 -> 0}> 0))> 0)> (main_v2 + 1), main_v1 -> (main_v1 - 1)}> 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}> = 0)> = 0))> 0)> 0))> main_n, main_v2 -> 0}> 0)> 0))> (main_v2 + 1), main_v1 -> (main_v1 - 1)}> 0}> 0}> Fresh variables: Undef variables: Abstraction variables: Exit nodes: 14, 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, ()] | m | local variable | integer | | n | local variable | integer | | v1 | local variable | integer | | v2 | local variable | integer | | Main function: main Preprocessed LLVMGraph Init Location: 0 Transitions: = 0) /\ (undef4 > 0), par{main_v1 -> undef3, main_v2 -> 0}> = 0) /\ not((undef4 > 0))> = 0))> 0) /\ (main_v2 < main_m), par{main_v1 -> (main_v1 - 1), main_v2 -> (main_v2 + 1)}> 0) /\ not((main_v2 < main_m)), par{main_v2 -> 0}> 0))> Fresh variables: undef3, undef4, Undef variables: undef3, undef4, Abstraction variables: Exit nodes: 14, Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: -1 + main_v1, main_v2 -> 1 + main_v2, rest remain the same}> 0, rest remain the same}> Variables: main_m, main_v1, main_v2 Graph 2: Transitions: Variables: Precedence: Graph 0 Graph 1 undef3, main_v2 -> 0, rest remain the same}> Graph 2 Map Locations to Subgraph: ( 0 , 0 ) ( 5 , 1 ) ( 14 , 2 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.003661 Checking conditional termination of SCC {l5}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000822s Ranking function: -1 + main_v1 New Graphs: Transitions: 0, rest remain the same}> Variables: main_m, main_v1, main_v2 Checking conditional termination of SCC {l5}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000482s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001334s [18575 : 18577] [18575 : 18578] Successful child: 18577 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + main_v1, main_v2 -> 1 + main_v2, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, 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): 0, rest remain the same}> Ranking function: -main_m + main_v2 New Graphs: INVARIANTS: 5: 1 <= main_m , 0 <= 1 + main_v1 + main_v2 , Quasi-INVARIANTS to narrow Graph: 5: Proving termination of subgraph 2 Analyzing SCC {l14}... No cycles found. Program Terminates