NO

Solver Timeout: 4
Global Timeout: 60
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_i -> ¿functionCall(__VERIFIER_nondet_int)}>
<l1, l2, true>
<l2, l6, (main_i = 1)>
<l2, l3, not((main_i = 1))>
<l3, l6, (main_i = 0)>
<l3, l4, not((main_i = 0))>
<l4, l5, true, seq{main_i -> (main_i - 2)}>
<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, l1, true, seq{main_i -> varCall_1}>
<l1, l2, true>
<l2, l6, (main_i = 1)>
<l2, l3, not((main_i = 1))>
<l3, l6, (main_i = 0)>
<l3, l4, not((main_i = 0))>
<l4, l5, true, seq{main_i -> (main_i - 2)}>
<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: 3, col: 1> | <line: 8, col: 9>
main | function | [integer, ()] | <line: 5, col: 1>
i | local variable | integer | <line: 6, col: 5> | <line: 8, col: 5> <line: 10, col: 12> <line: 10, col: 22> <line: 11, col: 9> <line: 11, col: 13>
b | local variable | integer | <line: 7, col: 5>

Main function: main
Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l2, (main_i = undef2)>
<l2, l7, (main_i = 1)>
<l2, l7, (main_i < 1) /\ (main_i = 0)>
<l2, l2, (main_i < 1) /\ (main_i < 0), par{main_i -> (main_i - 2)}>
<l2, l2, (main_i > 1) /\ (main_i > 0), par{main_i -> (main_i - 2)}>

Fresh variables:
undef2, 

Undef variables:
undef2, 

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_i <= 0, {main_i -> -2 + main_i, rest remain the same}>
<l2, l2, 2 <= main_i, {main_i -> -2 + main_i, rest remain the same}>
Variables:
main_i

Graph 2:
Transitions:
Variables:

Precedence: 
Graph 0

Graph 1
<l0, l2, main_i = undef2, {all remain the same}>

Graph 2
<l2, l7, main_i = 1, {all remain the same}>
<l2, l7, main_i = 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.002329

Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000808s
Ranking function: -1 + (1 / 2)*main_i
New Graphs: 
Transitions:
<l2, l2, 1 + main_i <= 0, {main_i -> -2 + main_i, rest remain the same}>
Variables:
main_i
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000383s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001138s
[42417 : 42419]
[42417 : 42420]
Successful child: 42419
[ 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_i <= 0, {main_i -> -2 + main_i, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, 2 <= main_i, {main_i -> -2 + main_i, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...
> It's unfeasible. Removing transition: 
<l2, l2, 1 + main_i <= 0, {main_i -> -2 + main_i, rest remain the same}>
New Graphs: 

LOG: CALL check - Post:0 <= main_i - Process 1
* Exit transition: <l0, l2, main_i = undef2, {all remain the same}>
* Postcondition  : 0 <= main_i

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.000464s
INVARIANTS: 
2: 
Quasi-INVARIANTS to narrow Graph: 
2: 0 <= main_i , 
Narrowing transition: 
<l2, l2, 1 + main_i <= 0, {main_i -> -2 + main_i, rest remain the same}>

LOG: Narrow transition size 1
It's unfeasible. Removing transition: 
<l2, l2, 2 <= main_i, {main_i -> -2 + main_i, rest remain the same}>
invGraph after Narrowing: 
Transitions:
<l2, l2, 1 + main_i <= 0, {main_i -> -2 + main_i, rest remain the same}>
Variables:
main_i
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000421s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001214s
[42417 : 42424]
[42417 : 42425]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.005876s
Time used: 0.005586
Improving Solution with cost 1 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.016140s
Time used: 0.016136

LOG: SAT solveNonLinear - Elapsed time: 0.022016s
Cost: 1; Total time: 0.021722
Termination implied by a set of invariant(s):
Invariant at l2: main_i <= 1
[ 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, 1 + main_i <= 0, {main_i -> -2 + main_i, 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, 1 + main_i <= 0, {main_i -> -2 + main_i, rest remain the same}>
Quasi-ranking function: 50000 + main_i
New Graphs: 
Transitions:
<l2, l2, 50001 + main_i <= 0, {main_i -> -2 + main_i, rest remain the same}>
Variables:
main_i
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000393s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001198s
[42417 : 42429]
[42417 : 42430]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.005726s
Time used: 0.005426

[42417 : 42434]
[42417 : 42438]
Successful child: 42434

Program does NOT terminate