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_x -> ¿functionCall(__VERIFIER_nondet_int), main_y -> ¿functionCall(__VERIFIER_nondet_int)}>
<l1, l2, true>
<l2, l6, not((main_x > 0))>
<l2, l3, (main_x > 0)>
<l3, l6, not((main_x < main_y))>
<l3, l4, (main_x < main_y)>
<l4, l5, true, seq{main_x -> (2 * main_x), main_y -> (main_y + 1)}>
<l5, l2, true>
<l6, l7, 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, l8, true, seq{main__func_return_ -> 0}>
<l8, l9, true, seq{varCall_1 -> ¿functionCall(__VERIFIER_nondet_int)}>
<l9, l10, true, seq{main_x -> varCall_1}>
<l10, l11, true, seq{varCall_2 -> ¿functionCall(__VERIFIER_nondet_int)}>
<l11, l1, true, seq{main_y -> varCall_2}>
<l1, l2, true>
<l2, l3, (main_x > 0)>
<l2, l6, not((main_x > 0))>
<l3, l4, (main_x < main_y)>
<l3, l6, not((main_x < main_y))>
<l4, l5, true, seq{main_x -> (2 * main_x), main_y -> (main_y + 1)}>
<l5, l2, true>
<l6, l7, true, seq{main__func_return_ -> 0}>

Fresh variables:

Undef variables:

Abstraction variables:

Exit nodes:
7, 
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: 20, col: 1> | <line: 24, col: 9> <line: 25, col: 9>
main | function | [integer, ()] | <line: 22, col: 1>
x | local variable | integer | <line: 23, col: 5> | <line: 24, col: 5> <line: 26, col: 12> <line: 26, col: 21> <line: 27, col: 9> <line: 27, col: 15>
y | local variable | integer | <line: 23, col: 5> | <line: 25, col: 5> <line: 26, col: 25> <line: 28, col: 9> <line: 28, col: 13>

Main function: main
Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l2, (main_x = undef3) /\ (main_y = undef4)>
<l2, l2, (main_x > 0) /\ (main_x < main_y), par{main_x -> (2 * main_x), main_y -> (main_y + 1)}>
<l2, l7, (main_x > 0) /\ not((main_x < main_y))>
<l2, l7, not((main_x > 0))>

Fresh variables:
undef3, undef4, 

Undef variables:
undef3, undef4, 

Abstraction variables:

Exit nodes:
7, 
Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l2, l2, 1 + main_x <= main_y /\ 1 <= main_x, {main_x -> 2*main_x, main_y -> 1 + main_y, rest remain the same}>
Variables:
main_x, main_y

Graph 2:
Transitions:
Variables:

Precedence: 
Graph 0

Graph 1
<l0, l2, main_x = undef3 /\ main_y = undef4, {all remain the same}>

Graph 2
<l2, l7, main_y <= main_x /\ 1 <= main_x, {all remain the same}>
<l2, l7, main_x <= 0, {all remain the same}>

Map Locations to Subgraph:
( 0 , 0 )
( 2 , 1 )
( 7 , 2 )

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

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

Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000578s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001660s
[23879 : 23881]
[23879 : 23882]
Successful child: 23881
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l2, l2, 1 + main_x <= main_y /\ 1 <= main_x, {main_x -> 2*main_x, main_y -> 1 + main_y, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...
> It's unfeasible. Removing transition: 
<l2, l2, 1 + main_x <= main_y /\ 1 <= main_x, {main_x -> 2*main_x, main_y -> 1 + main_y, rest remain the same}>
New Graphs: 

LOG: CALL check - Post:1 + main_x <= 0 - Process 1
* Exit transition: <l0, l2, main_x = undef3 /\ main_y = undef4, {all remain the same}>
* Postcondition  : 1 + main_x <= 0

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000233s
> Postcondition is not implied!

LOG: RETURN check - Elapsed time: 0.000267s
INVARIANTS: 
2: 
Quasi-INVARIANTS to narrow Graph: 
2: 1 + main_x <= 0 , 
Narrowing transition: 
<l2, l2, 1 + main_x <= main_y /\ 1 <= main_x, {main_x -> 2*main_x, main_y -> 1 + main_y, rest remain the same}>

LOG: Narrow transition size 1
invGraph after Narrowing: 
Transitions:
<l2, l2, 1 + main_x <= main_y /\ 1 <= main_x, {main_x -> 2*main_x, main_y -> 1 + main_y, rest remain the same}>
Variables:
main_x, main_y
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000287s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000943s
[23879 : 23886]
[23879 : 23887]
Successful child: 23886
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l2, l2, 1 + main_x <= main_y /\ 1 <= main_x, {main_x -> 2*main_x, main_y -> 1 + main_y, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l2, l2, 1 + main_x <= main_y /\ 1 <= main_x, {main_x -> 2*main_x, main_y -> 1 + main_y, rest remain the same}>
New Graphs: 

LOG: CALL check - Post:main_x + main_y <= 1 - Process 2
* Exit transition: <l0, l2, 0 <= main_x /\ main_x = undef3 /\ main_y = undef4, {all remain the same}>
* Postcondition  : main_x + main_y <= 1

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000262s
> Postcondition is not implied!

LOG: RETURN check - Elapsed time: 0.000303s
INVARIANTS: 
2: 
Quasi-INVARIANTS to narrow Graph: 
2: main_x + main_y <= 1 , 
Narrowing transition: 
<l2, l2, 1 + main_x <= main_y /\ 1 <= main_x, {main_x -> 2*main_x, main_y -> 1 + main_y, rest remain the same}>

LOG: Narrow transition size 1
invGraph after Narrowing: 
Transitions:
<l2, l2, 2 <= main_x + main_y /\ 1 + main_x <= main_y /\ 1 <= main_x, {main_x -> 2*main_x, main_y -> 1 + main_y, rest remain the same}>
Variables:
main_x, main_y
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000334s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001132s
[23879 : 23891]
[23879 : 23892]
Successful child: 23891
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l2, l2, 2 <= main_x + main_y /\ 1 + main_x <= main_y /\ 1 <= main_x, {main_x -> 2*main_x, main_y -> 1 + main_y, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l2, l2, 2 <= main_x + main_y /\ 1 + main_x <= main_y /\ 1 <= main_x, {main_x -> 2*main_x, main_y -> 1 + main_y, rest remain the same}>
New Graphs: 

LOG: CALL check - Post:main_x <= 0 - Process 3
* Exit transition: <l0, l2, 0 <= main_x /\ 2 <= main_x + main_y /\ main_x = undef3 /\ main_y = undef4, {all remain the same}>
* Postcondition  : main_x <= 0

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000245s
> Postcondition is not implied!

LOG: RETURN check - Elapsed time: 0.000287s
INVARIANTS: 
2: 
Quasi-INVARIANTS to narrow Graph: 
2: main_x <= 0 , 
Narrowing transition: 
<l2, l2, 2 <= main_x + main_y /\ 1 + main_x <= main_y /\ 1 <= main_x, {main_x -> 2*main_x, main_y -> 1 + main_y, rest remain the same}>

LOG: Narrow transition size 1
invGraph after Narrowing: 
Transitions:
<l2, l2, 2 <= main_x + main_y /\ 1 + main_x <= main_y /\ 1 <= main_x, {main_x -> 2*main_x, main_y -> 1 + main_y, rest remain the same}>
Variables:
main_x, main_y
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000340s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001117s
[23879 : 23896]
[23879 : 23897]
Successful child: 23896
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l2, l2, 2 <= main_x + main_y /\ 1 + main_x <= main_y /\ 1 <= main_x, {main_x -> 2*main_x, main_y -> 1 + main_y, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l2, l2, 2 <= main_x + main_y /\ 1 + main_x <= main_y /\ 1 <= main_x, {main_x -> 2*main_x, main_y -> 1 + main_y, rest remain the same}>
New Graphs: 

LOG: CALL check - Post:main_y <= 1 - Process 4
* Exit transition: <l0, l2, 2 <= main_x + main_y /\ 1 <= main_x /\ main_x = undef3 /\ main_y = undef4, {all remain the same}>
* Postcondition  : main_y <= 1

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000243s
> Postcondition is not implied!

LOG: RETURN check - Elapsed time: 0.000286s
INVARIANTS: 
2: 
Quasi-INVARIANTS to narrow Graph: 
2: main_y <= 1 , 
Narrowing transition: 
<l2, l2, 2 <= main_x + main_y /\ 1 + main_x <= main_y /\ 1 <= main_x, {main_x -> 2*main_x, main_y -> 1 + main_y, rest remain the same}>

LOG: Narrow transition size 1
invGraph after Narrowing: 
Transitions:
<l2, l2, 2 <= main_x + main_y /\ 2 <= main_y /\ 1 + main_x <= main_y /\ 1 <= main_x, {main_x -> 2*main_x, main_y -> 1 + main_y, rest remain the same}>
Variables:
main_x, main_y
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000369s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001232s
[23879 : 23901]
[23879 : 23902]
Successful child: 23901
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l2, l2, 2 <= main_x + main_y /\ 2 <= main_y /\ 1 + main_x <= main_y /\ 1 <= main_x, {main_x -> 2*main_x, main_y -> 1 + main_y, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...
> It's unfeasible. Removing transition: 
<l2, l2, 2 <= main_x + main_y /\ 2 <= main_y /\ 1 + main_x <= main_y /\ 1 <= main_x, {main_x -> 2*main_x, main_y -> 1 + main_y, rest remain the same}>
New Graphs: 

LOG: CALL check - Post:1 + main_y <= main_x - Process 5
* Exit transition: <l0, l2, 2 <= main_x + main_y /\ 2 <= main_y /\ 1 <= main_x /\ main_x = undef3 /\ main_y = undef4, {all remain the same}>
* Postcondition  : 1 + main_y <= main_x

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000283s
> Postcondition is not implied!

LOG: RETURN check - Elapsed time: 0.000334s
INVARIANTS: 
2: 
Quasi-INVARIANTS to narrow Graph: 
2: 1 + main_y <= main_x , 
Narrowing transition: 
<l2, l2, 2 <= main_x + main_y /\ 2 <= main_y /\ 1 + main_x <= main_y /\ 1 <= main_x, {main_x -> 2*main_x, main_y -> 1 + main_y, rest remain the same}>

LOG: Narrow transition size 1
invGraph after Narrowing: 
Transitions:
<l2, l2, 2 <= main_x + main_y /\ 2 <= main_y /\ 1 + main_x <= main_y /\ 1 <= main_x, {main_x -> 2*main_x, main_y -> 1 + main_y, rest remain the same}>
Variables:
main_x, main_y
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000375s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001264s
[23879 : 23906]
[23879 : 23907]
Successful child: 23906
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l2, l2, 2 <= main_x + main_y /\ 2 <= main_y /\ 1 + main_x <= main_y /\ 1 <= main_x, {main_x -> 2*main_x, main_y -> 1 + main_y, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...
> It's unfeasible. Removing transition: 
<l2, l2, 2 <= main_x + main_y /\ 2 <= main_y /\ 1 + main_x <= main_y /\ 1 <= main_x, {main_x -> 2*main_x, main_y -> 1 + main_y, rest remain the same}>
New Graphs: 

LOG: CALL check - Post:main_y <= main_x - Process 6
* Exit transition: <l0, l2, main_x <= main_y /\ 2 <= main_x + main_y /\ 2 <= main_y /\ 1 <= main_x /\ main_x = undef3 /\ main_y = undef4, {all remain the same}>
* Postcondition  : main_y <= main_x

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000306s
> Postcondition is not implied!

LOG: RETURN check - Elapsed time: 0.000361s
INVARIANTS: 
2: 
Quasi-INVARIANTS to narrow Graph: 
2: main_y <= main_x , 
Narrowing transition: 
<l2, l2, 2 <= main_x + main_y /\ 2 <= main_y /\ 1 + main_x <= main_y /\ 1 <= main_x, {main_x -> 2*main_x, main_y -> 1 + main_y, rest remain the same}>

LOG: Narrow transition size 1
invGraph after Narrowing: 
Transitions:
<l2, l2, 2 <= main_x + main_y /\ 2 <= main_y /\ 1 + main_x <= main_y /\ 1 <= main_x, {main_x -> 2*main_x, main_y -> 1 + main_y, rest remain the same}>
Variables:
main_x, main_y
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000369s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001263s
[23879 : 23911]
[23879 : 23912]
Successful child: 23911
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, 2 <= main_x /\ 2 <= main_x + main_y /\ 2 <= main_y /\ 1 + main_x <= main_y, {main_x -> 2*main_x, main_y -> 1 + main_y, 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): 
<l2, l2, 2 <= main_x /\ 2 <= main_x + main_y /\ 2 <= main_y /\ 1 + main_x <= main_y, {main_x -> 2*main_x, main_y -> 1 + main_y, rest remain the same}>
Ranking function: -2*main_x + 2*main_y
New Graphs: 

LOG: CALL check - Post:2 <= main_x - Process 7
* Exit transition: <l0, l2, 2 <= main_x + main_y /\ 2 <= main_y /\ 1 + main_x <= main_y /\ 1 <= main_x /\ main_x = undef3 /\ main_y = undef4, {all remain the same}>
* Postcondition  : 2 <= main_x

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000249s
> Postcondition is not implied!

LOG: RETURN check - Elapsed time: 0.000306s
INVARIANTS: 
2: 
Quasi-INVARIANTS to narrow Graph: 
2: 2 <= main_x , 
It's unfeasible. Removing transition: 
<l2, l2, 2 <= main_x + main_y /\ 2 <= main_y /\ 1 + main_x <= main_y /\ 1 <= main_x, {main_x -> 2*main_x, main_y -> 1 + main_y, rest remain the same}>
invGraph after Narrowing: 
Transitions:
Variables:
main_x, main_y
Analyzing SCC {l2}...
No cycles found.

Proving termination of subgraph 2
Analyzing SCC {l7}...
No cycles found.

Program Terminates