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:
<l0, l1, true, seq{main__func_return_ -> 0, main_x1 -> ¿functionCall(__VERIFIER_nondet_int), main_x2 -> ¿functionCall(__VERIFIER_nondet_int)}>
<l1, l2, true>
<l2, l10, not((main_x1 <= 10))>
<l2, l3, (main_x1 <= 10)>
<l3, l4, true, seq{main_x2 -> 10}>
<l4, l5, true>
<l5, l8, not((main_x2 > 1))>
<l5, l6, (main_x2 > 1)>
<l6, l7, true, seq{main_x2 -> (main_x2 - 1)}>
<l7, l5, true>
<l8, l9, true, seq{main_x1 -> (main_x1 + 1)}>
<l9, l2, true>
<l10, l11, true, seq{main__func_return_ -> 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:
<l0, l12, true, seq{main__func_return_ -> 0}>
<l12, l13, true, seq{varCall_1 -> ¿functionCall(__VERIFIER_nondet_int)}>
<l13, l14, true, seq{main_x1 -> varCall_1}>
<l14, l15, true, seq{varCall_2 -> ¿functionCall(__VERIFIER_nondet_int)}>
<l15, l1, true, seq{main_x2 -> varCall_2}>
<l1, l2, true>
<l2, l3, (main_x1 <= 10)>
<l2, l10, not((main_x1 <= 10))>
<l3, l4, true, seq{main_x2 -> 10}>
<l4, l5, true>
<l5, l6, (main_x2 > 1)>
<l5, l8, not((main_x2 > 1))>
<l6, l7, true, seq{main_x2 -> (main_x2 - 1)}>
<l7, l5, true>
<l8, l9, true, seq{main_x1 -> (main_x1 + 1)}>
<l9, l2, true>
<l10, l11, true, seq{main__func_return_ -> 0}>

Fresh variables:

Undef variables:

Abstraction variables:

Exit nodes:
11, 
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, ()] | <line: 12, col: 1> | <line: 17, col: 7> <line: 18, col: 7>
main | function | [integer, ()] | <line: 14, col: 1>
x1 | local variable | integer | <line: 15, col: 2> | <line: 17, col: 2> <line: 19, col: 12> <line: 24, col: 9> <line: 24, col: 14>
x2 | local variable | integer | <line: 16, col: 2> | <line: 18, col: 2> <line: 20, col: 9> <line: 21, col: 16> <line: 22, col: 13> <line: 22, col: 18>

Main function: main
Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l5, (main_x1 = undef3) /\ (undef3 <= 10), par{main_x2 -> 10}>
<l0, l11, (main_x1 = undef3) /\ not((undef3 <= 10)), par{main_x2 -> undef4}>
<l5, l5, (main_x2 > 1), par{main_x2 -> (main_x2 - 1)}>
<l5, l5, not((main_x2 > 1)) /\ ((main_x1 + 1) <= 10), par{main_x1 -> (main_x1 + 1), main_x2 -> 10}>
<l5, l11, not((main_x2 > 1)) /\ not(((main_x1 + 1) <= 10)), par{main_x1 -> (main_x1 + 1)}>

Fresh variables:
undef3, undef4, 

Undef variables:
undef3, undef4, 

Abstraction variables:

Exit nodes:
11, 
Accepting locations:

Asserts:

*************************************************************
*******************************************************************************************
***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
*******************************************************************************************

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l5, l5, 2 <= main_x2, {main_x2 -> -1 + main_x2, rest remain the same}>
<l5, l5, main_x2 <= 1 /\ main_x1 <= 9, {main_x1 -> 1 + main_x1, main_x2 -> 10, rest remain the same}>
Variables:
main_x2, main_x1

Graph 2:
Transitions:
Variables:

Precedence: 
Graph 0

Graph 1
<l0, l5, undef3 <= 10 /\ main_x1 = undef3, {main_x2 -> 10, rest remain the same}>

Graph 2
<l0, l11, 11 <= undef3 /\ main_x1 = undef3, {main_x2 -> undef4, rest remain the same}>
<l5, l11, 10 <= main_x1 /\ main_x2 <= 1, {main_x1 -> 1 + main_x1, rest remain the same}>

Map Locations to Subgraph:
( 0 , 0 )
( 5 , 1 )
( 11 , 2 )

*******************************************************************************************
********************************    CHECKING ASSERTIONS    ********************************
*******************************************************************************************

Proving termination of subgraph 0
Proving termination of subgraph 1
Checking unfeasibility...
Time used: 3.75978

Checking conditional termination of SCC {l5}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.007356s
Ranking function: 9 - main_x1
New Graphs: 
Transitions:
<l5, l5, 2 <= main_x2, {main_x2 -> -1 + main_x2, rest remain the same}>
Variables:
main_x2
Checking conditional termination of SCC {l5}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000242s
Ranking function: -2 + main_x2
New Graphs: 
Proving termination of subgraph 2
Analyzing SCC {l11}...
No cycles found.

Program Terminates