/export/starexec/sandbox2/solver/bin/starexec_run_termcomp17 /export/starexec/sandbox2/benchmark/theBenchmark.c /export/starexec/sandbox2/output/output_files


--------------------------------------------------------------------------------


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), main_z -> ¿functionCall(__VERIFIER_nondet_int), main_n -> ¿functionCall(__VERIFIER_nondet_int)}>
<l1, l2, true>
<l2, l6, not(((main_x + main_y) >= 0))>
<l2, l3, ((main_x + main_y) >= 0)>
<l3, l6, not((main_x <= main_n))>
<l3, l4, (main_x <= main_n)>
<l4, l5, true, seq{main_x -> ((2 * main_x) + main_y), main_y -> main_z, main_z -> (main_z + 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, l12, true, seq{main_y -> varCall_2}>
<l12, l13, true, seq{varCall_3 -> ¿functionCall(__VERIFIER_nondet_int)}>
<l13, l14, true, seq{main_z -> varCall_3}>
<l14, l15, true, seq{varCall_4 -> ¿functionCall(__VERIFIER_nondet_int)}>
<l15, l1, true, seq{main_n -> varCall_4}>
<l1, l2, true>
<l2, l3, ((main_x + main_y) >= 0)>
<l2, l6, not(((main_x + main_y) >= 0))>
<l3, l4, (main_x <= main_n)>
<l3, l6, not((main_x <= main_n))>
<l4, l5, true, seq{main_x -> ((2 * main_x) + main_y), main_y -> main_z, main_z -> (main_z + 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 [6 idents]:
__VERIFIER_nondet_int | function | [integer, ()] | <line: 20, col: 1> | <line: 24, col: 9> <line: 25, col: 9> <line: 26, col: 9> <line: 27, col: 9>
main | function | [integer, ()] | <line: 22, col: 1>
x | local variable | integer | <line: 23, col: 5> | <line: 24, col: 5> <line: 28, col: 12> <line: 28, col: 26> <line: 29, col: 9> <line: 29, col: 15>
y | local variable | integer | <line: 23, col: 5> | <line: 25, col: 5> <line: 28, col: 16> <line: 29, col: 19> <line: 30, col: 9>
z | local variable | integer | <line: 23, col: 5> | <line: 26, col: 5> <line: 30, col: 13> <line: 31, col: 9> <line: 31, col: 13> <line: 32, col: 9> <line: 32, col: 13>
n | local variable | integer | <line: 23, col: 5> | <line: 27, col: 5> <line: 28, col: 31>

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

Fresh variables:
undef5, undef6, undef7, undef8, 

Undef variables:
undef5, undef6, undef7, undef8, 

Abstraction variables:

Exit nodes:
7, 
Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

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

Graph 2:
Transitions:
Variables:

Precedence: 
Graph 0

Graph 1
<l0, l2, main_x = undef5 /\ main_y = undef6 /\ main_z = undef7 /\ main_n = undef8, {all remain the same}>

Graph 2
<l2, l7, 0 <= main_x + main_y /\ 1 + main_n <= main_x, {all remain the same}>
<l2, l7, 1 + main_x + main_y <= 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.003338

Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000780s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002204s
[29664 : 29665]
[29664 : 29666]
Successful child: 29665
[ 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, main_x <= main_n /\ 0 <= main_x + main_y /\ 1 + main_x + main_y + main_z + main_n <= 0, {main_x -> 2*main_x + main_y, main_y -> main_z, main_z -> 1 + main_z, 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, main_x <= main_n /\ 0 <= main_x + main_y /\ 1 + main_x + main_y + main_z + main_n <= 0, {main_x -> 2*main_x + main_y, main_y -> main_z, main_z -> 1 + main_z, rest remain the same}>
Ranking function: -main_z - main_n
New Graphs: 

LOG: CALL check - Post:1 + main_x + main_y + main_z + main_n <= 0 - Process 1
* Exit transition: <l0, l2, main_x = undef5 /\ main_y = undef6 /\ main_z = undef7 /\ main_n = undef8, {all remain the same}>
* Postcondition  : 1 + main_x + main_y + main_z + main_n <= 0

LOG: CALL solveLinear

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

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

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

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000823s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002947s
[29664 : 29670]
[29664 : 29671]
Successful child: 29670
[ 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, main_x <= main_n /\ 0 <= main_x + main_y /\ 0 <= main_x + main_y + main_z + main_n, {main_x -> 2*main_x + main_y, main_y -> main_z, main_z -> 1 + main_z, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...
> It's unfeasible. Removing transition: 
<l2, l2, main_x <= main_n /\ 0 <= main_x + main_y /\ 0 <= main_x + main_y + main_z + main_n, {main_x -> 2*main_x + main_y, main_y -> main_z, main_z -> 1 + main_z, rest remain the same}>
New Graphs: 

LOG: CALL check - Post:1 + main_n <= main_x - Process 2
* Exit transition: <l0, l2, 0 <= main_x + main_y + main_z + main_n /\ main_x = undef5 /\ main_y = undef6 /\ main_z = undef7 /\ main_n = undef8, {all remain the same}>
* Postcondition  : 1 + main_n <= main_x

LOG: CALL solveLinear

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

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

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

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000828s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002845s
[29664 : 29675]
[29664 : 29676]
Successful child: 29675
[ 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, main_x <= main_n /\ 0 <= main_x + main_y /\ 0 <= main_x + main_y + main_z + main_n, {main_x -> 2*main_x + main_y, main_y -> main_z, main_z -> 1 + main_z, 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, main_x <= main_n /\ 0 <= main_x + main_y /\ 0 <= main_x + main_y + main_z + main_n, {main_x -> 2*main_x + main_y, main_y -> main_z, main_z -> 1 + main_z, rest remain the same}>
New Graphs: 

LOG: CALL check - Post:1 + main_y + main_n <= 0 - Process 3
* Exit transition: <l0, l2, main_x <= main_n /\ 0 <= main_x + main_y + main_z + main_n /\ main_x = undef5 /\ main_y = undef6 /\ main_z = undef7 /\ main_n = undef8, {all remain the same}>
* Postcondition  : 1 + main_y + main_n <= 0

LOG: CALL solveLinear

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

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

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

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000881s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.003125s
[29664 : 29680]
[29664 : 29681]
Successful child: 29680
[ 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, main_x <= main_n /\ 0 <= main_x + main_y /\ 0 <= main_x + main_y + main_z + main_n /\ 0 <= main_y + main_n, {main_x -> 2*main_x + main_y, main_y -> main_z, main_z -> 1 + main_z, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...
> It's unfeasible. Removing transition: 
<l2, l2, main_x <= main_n /\ 0 <= main_x + main_y /\ 0 <= main_x + main_y + main_z + main_n /\ 0 <= main_y + main_n, {main_x -> 2*main_x + main_y, main_y -> main_z, main_z -> 1 + main_z, rest remain the same}>
New Graphs: 

LOG: CALL check - Post:1 + main_x + main_y <= 0 - Process 4
* Exit transition: <l0, l2, main_x <= main_n /\ 0 <= main_x + main_y + main_z + main_n /\ 0 <= main_y + main_n /\ main_x = undef5 /\ main_y = undef6 /\ main_z = undef7 /\ main_n = undef8, {all remain the same}>
* Postcondition  : 1 + main_x + main_y <= 0

LOG: CALL solveLinear

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

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

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

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000888s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.003162s
[29664 : 29685]
[29664 : 29686]
Successful child: 29685
[ 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, main_x <= main_n /\ 0 <= main_x + main_y /\ 0 <= main_x + main_y + main_z + main_n /\ 0 <= main_y + main_n /\ 1 + 2*main_x + main_y + main_z <= 0, {main_x -> 2*main_x + main_y, main_y -> main_z, main_z -> 1 + main_z, 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, main_x <= main_n /\ 0 <= main_x + main_y /\ 0 <= main_x + main_y + main_z + main_n /\ 0 <= main_y + main_n /\ 1 + 2*main_x + main_y + main_z <= 0, {main_x -> 2*main_x + main_y, main_y -> main_z, main_z -> 1 + main_z, rest remain the same}>
Ranking function: -main_x - main_z
New Graphs: 

LOG: CALL check - Post:1 + 2*main_x + main_y + main_z <= 0 - Process 5
* Exit transition: <l0, l2, main_x <= main_n /\ 0 <= main_x + main_y /\ 0 <= main_x + main_y + main_z + main_n /\ 0 <= main_y + main_n /\ main_x = undef5 /\ main_y = undef6 /\ main_z = undef7 /\ main_n = undef8, {all remain the same}>
* Postcondition  : 1 + 2*main_x + main_y + main_z <= 0

LOG: CALL solveLinear

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

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

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

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000966s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.003485s
[29664 : 29695]
[29664 : 29696]
Successful child: 29695
[ 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, main_x <= main_n /\ 0 <= main_x + main_y /\ 0 <= main_x + main_y + main_z + main_n /\ 0 <= 2*main_x + main_y + main_z /\ 0 <= main_y + main_n /\ 1 + main_z + 2*main_n <= main_x, {main_x -> 2*main_x + main_y, main_y -> main_z, main_z -> 1 + main_z, 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, main_x <= main_n /\ 0 <= main_x + main_y /\ 0 <= main_x + main_y + main_z + main_n /\ 0 <= 2*main_x + main_y + main_z /\ 0 <= main_y + main_n /\ 1 + main_z + 2*main_n <= main_x, {main_x -> 2*main_x + main_y, main_y -> main_z, main_z -> 1 + main_z, rest remain the same}>
Ranking function: -1 - main_z - main_n
New Graphs: 

LOG: CALL check - Post:1 + main_z + 2*main_n <= main_x - Process 6
* Exit transition: <l0, l2, main_x <= main_n /\ 0 <= main_x + main_y /\ 0 <= main_x + main_y + main_z + main_n /\ 0 <= 2*main_x + main_y + main_z /\ 0 <= main_y + main_n /\ main_x = undef5 /\ main_y = undef6 /\ main_z = undef7 /\ main_n = undef8, {all remain the same}>
* Postcondition  : 1 + main_z + 2*main_n <= main_x

LOG: CALL solveLinear

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

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

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

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001062s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.003830s
[29664 : 29700]
[29664 : 29701]
Successful child: 29700
[ 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, main_x <= main_z + 2*main_n /\ main_x <= main_n /\ 0 <= main_x + main_y /\ 0 <= main_x + main_y + main_z + main_n /\ 0 <= 2*main_x + main_y + main_z /\ 0 <= main_y + main_n /\ 1 + main_n <= 2*main_x + main_y, {main_x -> 2*main_x + main_y, main_y -> main_z, main_z -> 1 + main_z, 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, main_x <= main_z + 2*main_n /\ main_x <= main_n /\ 0 <= main_x + main_y /\ 0 <= main_x + main_y + main_z + main_n /\ 0 <= 2*main_x + main_y + main_z /\ 0 <= main_y + main_n /\ 1 + main_n <= 2*main_x + main_y, {main_x -> 2*main_x + main_y, main_y -> main_z, main_z -> 1 + main_z, rest remain the same}>
Ranking function: -main_x + main_n
New Graphs: 

LOG: CALL check - Post:1 + main_n <= 2*main_x + main_y - Process 7
* Exit transition: <l0, l2, main_x <= main_z + 2*main_n /\ main_x <= main_n /\ 0 <= main_x + main_y /\ 0 <= main_x + main_y + main_z + main_n /\ 0 <= 2*main_x + main_y + main_z /\ 0 <= main_y + main_n /\ main_x = undef5 /\ main_y = undef6 /\ main_z = undef7 /\ main_n = undef8, {all remain the same}>
* Postcondition  : 1 + main_n <= 2*main_x + main_y

LOG: CALL solveLinear

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

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

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

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001155s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.004136s
[29664 : 29705]
[29664 : 29706]
Successful child: 29705
[ 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 + main_y <= main_n /\ main_x <= main_z + 2*main_n /\ main_x <= main_n /\ 0 <= main_x + main_y /\ 0 <= main_x + main_y + main_z + main_n /\ 0 <= 2*main_x + main_y + main_z /\ 0 <= main_y + main_n /\ 1 + main_y <= main_z, {main_x -> 2*main_x + main_y, main_y -> main_z, main_z -> 1 + main_z, 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 + main_y <= main_n /\ main_x <= main_z + 2*main_n /\ main_x <= main_n /\ 0 <= main_x + main_y /\ 0 <= main_x + main_y + main_z + main_n /\ 0 <= 2*main_x + main_y + main_z /\ 0 <= main_y + main_n /\ 1 + main_y <= main_z, {main_x -> 2*main_x + main_y, main_y -> main_z, main_z -> 1 + main_z, rest remain the same}>
Ranking function: -2*main_x - main_y + main_n
New Graphs: 

LOG: CALL check - Post:1 + main_y <= main_z - Process 8
* Exit transition: <l0, l2, 2*main_x + main_y <= main_n /\ main_x <= main_z + 2*main_n /\ main_x <= main_n /\ 0 <= main_x + main_y /\ 0 <= main_x + main_y + main_z + main_n /\ 0 <= 2*main_x + main_y + main_z /\ 0 <= main_y + main_n /\ main_x = undef5 /\ main_y = undef6 /\ main_z = undef7 /\ main_n = undef8, {all remain the same}>
* Postcondition  : 1 + main_y <= main_z

LOG: CALL solveLinear

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

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

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

Program Terminates