3.13/1.15	YES
3.13/1.15	
3.13/1.15	Solver Timeout: 4
3.13/1.15	Global Timeout: 300
3.13/1.15	Maximum number of concurrent processes: 900
3.13/1.15	*******************************************************************************************
3.13/1.15	*********************** UNPROCESSED TRANSITION SYSTEMS PER FUNCTION ***********************
3.13/1.15	*******************************************************************************************
3.13/1.15	
3.13/1.15	
3.13/1.15	List of LLVMGraphs + assumeNodes + staticAssertNodes [1] :
3.13/1.15	
3.13/1.15	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
3.13/1.15	+                                                                  +
3.13/1.15	Init Location: 0
3.13/1.15	Transitions:
3.13/1.15	<l0, l1, true, seq{main__func_return_ -> 0, main_x -> ¿functionCall(__VERIFIER_nondet_int), main_y -> ¿functionCall(__VERIFIER_nondet_int), main_n -> ¿functionCall(__VERIFIER_nondet_int)}>
3.13/1.15	<l1, l2, true>
3.13/1.15	<l2, l6, not((main_x > 0))>
3.13/1.15	<l2, l3, (main_x > 0)>
3.13/1.15	<l3, l6, not((main_x < main_n))>
3.13/1.15	<l3, l4, (main_x < main_n)>
3.13/1.15	<l4, l5, true, seq{main_x -> ((~(main_x) + main_y) - 5), main_y -> (2 * main_y)}>
3.13/1.15	<l5, l2, true>
3.13/1.15	<l6, l7, true, seq{main__func_return_ -> 0}>
3.13/1.15	
3.13/1.15	Fresh variables:
3.13/1.15	
3.13/1.15	Undef variables:
3.13/1.15	
3.13/1.15	Abstraction variables:
3.13/1.15	
3.13/1.15	Exit nodes:
3.13/1.15	
3.13/1.15	Accepting locations:
3.13/1.15	
3.13/1.15	Asserts:
3.13/1.15	
3.13/1.15	+ Assume Nodes [0]: ++++++++++++++++++++++++++++++++++++++++++++++++
3.13/1.15	       
3.13/1.15	+ Static Assert Nodes [0]: +++++++++++++++++++++++++++++++++++++++++
3.13/1.15	       
3.13/1.15	+ After preprocess (paralelization): ++++++++++++++++++++++++++++++
3.13/1.15	
3.13/1.15	Init Location: 0
3.13/1.15	Transitions:
3.13/1.15	<l0, l8, true, seq{main__func_return_ -> 0}>
3.13/1.15	<l8, l9, true, seq{varCall_1 -> ¿functionCall(__VERIFIER_nondet_int)}>
3.13/1.15	<l9, l10, true, seq{main_x -> varCall_1}>
3.13/1.15	<l10, l11, true, seq{varCall_2 -> ¿functionCall(__VERIFIER_nondet_int)}>
3.13/1.15	<l11, l12, true, seq{main_y -> varCall_2}>
3.13/1.15	<l12, l13, true, seq{varCall_3 -> ¿functionCall(__VERIFIER_nondet_int)}>
3.13/1.15	<l13, l1, true, seq{main_n -> varCall_3}>
3.13/1.15	<l1, l2, true>
3.13/1.15	<l2, l3, (main_x > 0)>
3.13/1.15	<l2, l6, not((main_x > 0))>
3.13/1.15	<l3, l4, (main_x < main_n)>
3.13/1.15	<l3, l6, not((main_x < main_n))>
3.13/1.15	<l4, l5, true, seq{main_x -> ((~(main_x) + main_y) - 5), main_y -> (2 * main_y)}>
3.13/1.15	<l5, l2, true>
3.13/1.15	<l6, l7, true, seq{main__func_return_ -> 0}>
3.13/1.15	
3.13/1.15	Fresh variables:
3.13/1.15	
3.13/1.15	Undef variables:
3.13/1.15	
3.13/1.15	Abstraction variables:
3.13/1.15	
3.13/1.15	Exit nodes:
3.13/1.15	7, 
3.13/1.15	Accepting locations:
3.13/1.15	
3.13/1.15	Asserts:
3.13/1.15	
3.13/1.15	+                                                                  +
3.13/1.15	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
3.13/1.15	
3.13/1.15	
3.13/1.15	Function Return and Parameters Information [2 functions]:
3.13/1.15	    function name: __VERIFIER_nondet_int [1 return + 0 parameters]        demangled: __VERIFIER_nondet_int
3.13/1.15	        __VERIFIER_nondet_int__func_return_      [function result] : int
3.13/1.15	    function name: main [1 return + 0 parameters]        demangled: main
3.13/1.15	        main__func_return_      [function result] : int
3.13/1.15	
3.13/1.15	
3.13/1.15	AST Ident Scanner Information [5 idents]:
3.13/1.15	__VERIFIER_nondet_int | function | [integer, ()] | <line: 20, col: 1> | <line: 24, col: 9> <line: 25, col: 9> <line: 26, col: 9>
3.13/1.15	main | function | [integer, ()] | <line: 22, col: 1>
3.13/1.15	x | local variable | integer | <line: 23, col: 5> | <line: 24, col: 5> <line: 27, col: 12> <line: 27, col: 21> <line: 28, col: 9> <line: 28, col: 14>
3.13/1.15	y | local variable | integer | <line: 23, col: 5> | <line: 25, col: 5> <line: 28, col: 18> <line: 29, col: 9> <line: 29, col: 15>
3.13/1.15	n | local variable | integer | <line: 23, col: 5> | <line: 26, col: 5> <line: 27, col: 25>
3.13/1.15	
3.13/1.15	Main function: main
3.13/1.15	Preprocessed LLVMGraph
3.13/1.15	Init Location: 0
3.13/1.15	Transitions:
3.13/1.15	<l0, l2, (main_x = undef4) /\ (main_y = undef5) /\ (main_n = undef6)>
3.13/1.15	<l2, l2, (main_x > 0) /\ (main_x < main_n), par{main_x -> ((~(main_x) + main_y) - 5), main_y -> (2 * main_y)}>
3.13/1.15	<l2, l7, (main_x > 0) /\ not((main_x < main_n))>
3.13/1.15	<l2, l7, not((main_x > 0))>
3.13/1.15	
3.13/1.15	Fresh variables:
3.13/1.15	undef4, undef5, undef6, 
3.13/1.15	
3.13/1.15	Undef variables:
3.13/1.15	undef4, undef5, undef6, 
3.13/1.15	
3.13/1.15	Abstraction variables:
3.13/1.15	
3.13/1.15	Exit nodes:
3.13/1.15	7, 
3.13/1.15	Accepting locations:
3.13/1.15	
3.13/1.15	Asserts:
3.13/1.15	
3.13/1.15	*************************************************************
3.13/1.15	*******************************************************************************************
3.13/1.15	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
3.13/1.15	*******************************************************************************************
3.13/1.15	
3.13/1.15	Init Location: 0
3.13/1.15	Graph 0:
3.13/1.15	Transitions:
3.13/1.15	Variables:
3.13/1.15	
3.13/1.15	Graph 1:
3.13/1.15	Transitions:
3.13/1.15	<l2, l2, 1 + main_x <= main_n /\ 1 <= main_x, {main_x -> -5 - main_x + main_y, main_y -> 2*main_y, rest remain the same}>
3.13/1.15	Variables:
3.13/1.15	main_x, main_y, main_n
3.13/1.15	
3.13/1.15	Graph 2:
3.13/1.15	Transitions:
3.13/1.15	Variables:
3.13/1.15	
3.13/1.15	Precedence: 
3.13/1.15	Graph 0
3.13/1.15	
3.13/1.15	Graph 1
3.13/1.15	<l0, l2, main_x = undef4 /\ main_y = undef5 /\ main_n = undef6, {all remain the same}>
3.13/1.15	
3.13/1.15	Graph 2
3.13/1.15	<l2, l7, main_n <= main_x /\ 1 <= main_x, {all remain the same}>
3.13/1.15	<l2, l7, main_x <= 0, {all remain the same}>
3.13/1.15	
3.13/1.15	Map Locations to Subgraph:
3.13/1.15	( 0 , 0 )
3.13/1.15	( 2 , 1 )
3.13/1.15	( 7 , 2 )
3.13/1.15	
3.13/1.15	*******************************************************************************************
3.13/1.15	********************************    CHECKING ASSERTIONS    ********************************
3.13/1.15	*******************************************************************************************
3.13/1.15	
3.13/1.15	Proving termination of subgraph 0
3.13/1.15	Proving termination of subgraph 1
3.13/1.15	Checking unfeasibility...
3.13/1.15	Time used: 0.002788
3.13/1.15	
3.13/1.15	Checking conditional termination of SCC {l2}...
3.13/1.15	
3.13/1.15	LOG: CALL solveLinear
3.13/1.15	
3.13/1.15	LOG: RETURN solveLinear - Elapsed time: 0.000657s
3.13/1.15	
3.13/1.15	LOG: CALL solveLinear
3.13/1.15	
3.13/1.15	LOG: RETURN solveLinear - Elapsed time: 0.002167s
3.13/1.15	[13150 : 13152]
3.13/1.15	[13150 : 13153]
3.13/1.15	Successful child: 13152
3.13/1.15	[ Invariant Graph ]
3.13/1.15	Strengthening and disabling transitions...
3.13/1.15	
3.13/1.15	LOG: CALL solverLinear in Graph for feasibility
3.13/1.15	
3.13/1.15	LOG: RETURN solveLinear in Graph for feasibility
3.13/1.15	Strengthening transition (result): 
3.13/1.15	<l2, l2, 1 + main_x <= main_n /\ 1 <= main_x /\ main_y + main_n <= 2, {main_x -> -5 - main_x + main_y, main_y -> 2*main_y, rest remain the same}>
3.13/1.15	[ Termination Graph ]
3.13/1.15	Strengthening and disabling transitions...
3.13/1.15	
3.13/1.15	LOG: CALL solverLinear in Graph for feasibility
3.13/1.15	
3.13/1.15	LOG: RETURN solveLinear in Graph for feasibility
3.13/1.15	Strengthening transition (result): 
3.13/1.15	<l2, l2, 1 + main_x <= main_n /\ 1 <= main_x /\ main_y + main_n <= 2, {main_x -> -5 - main_x + main_y, main_y -> 2*main_y, rest remain the same}>
3.13/1.15	Ranking function: main_x - main_y
3.13/1.15	New Graphs: 
3.13/1.15	
3.13/1.15	LOG: CALL check - Post:main_y + main_n <= 2 - Process 1
3.13/1.15	* Exit transition: <l0, l2, main_x = undef4 /\ main_y = undef5 /\ main_n = undef6, {all remain the same}>
3.13/1.15	* Postcondition  : main_y + main_n <= 2
3.13/1.15	
3.13/1.15	LOG: CALL solveLinear
3.13/1.15	
3.13/1.15	LOG: RETURN solveLinear - Elapsed time: 0.000600s
3.13/1.15	> Postcondition is not implied!
3.13/1.15	
3.13/1.15	LOG: RETURN check - Elapsed time: 0.000713s
3.13/1.15	INVARIANTS: 
3.13/1.15	2: 
3.13/1.15	Quasi-INVARIANTS to narrow Graph: 
3.13/1.15	2: main_y + main_n <= 2 , 
3.13/1.15	Narrowing transition: 
3.13/1.15	<l2, l2, 1 + main_x <= main_n /\ 1 <= main_x, {main_x -> -5 - main_x + main_y, main_y -> 2*main_y, rest remain the same}>
3.13/1.15	
3.13/1.15	LOG: Narrow transition size 1
3.13/1.15	invGraph after Narrowing: 
3.13/1.15	Transitions:
3.13/1.15	<l2, l2, 1 + main_x <= main_n /\ 1 <= main_x /\ 3 <= main_y + main_n, {main_x -> -5 - main_x + main_y, main_y -> 2*main_y, rest remain the same}>
3.13/1.15	Variables:
3.13/1.15	main_x, main_y, main_n
3.13/1.15	Checking conditional termination of SCC {l2}...
3.13/1.15	
3.13/1.15	LOG: CALL solveLinear
3.13/1.15	
3.13/1.15	LOG: RETURN solveLinear - Elapsed time: 0.000736s
3.13/1.15	
3.13/1.15	LOG: CALL solveLinear
3.13/1.15	
3.13/1.15	LOG: RETURN solveLinear - Elapsed time: 0.003557s
3.13/1.15	[13150 : 13157]
3.13/1.15	[13150 : 13158]
3.13/1.15	Successful child: 13157
3.13/1.15	[ Invariant Graph ]
3.13/1.15	Strengthening and disabling transitions...
3.13/1.15	
3.13/1.15	LOG: CALL solverLinear in Graph for feasibility
3.13/1.15	
3.13/1.15	LOG: RETURN solveLinear in Graph for feasibility
3.13/1.15	It's unfeasible. Removing transition: 
3.13/1.15	<l2, l2, 1 + main_x <= main_n /\ 1 <= main_x /\ 3 <= main_y + main_n, {main_x -> -5 - main_x + main_y, main_y -> 2*main_y, rest remain the same}>
3.13/1.15	[ Termination Graph ]
3.13/1.15	Strengthening and disabling transitions...
3.13/1.15	
3.13/1.15	LOG: CALL solverLinear in Graph for feasibility
3.13/1.15	
3.13/1.15	LOG: RETURN solveLinear in Graph for feasibility
3.13/1.15	It's unfeasible. Removing transition: 
3.13/1.15	<l2, l2, 1 + main_x <= main_n /\ 1 <= main_x /\ 3 <= main_y + main_n, {main_x -> -5 - main_x + main_y, main_y -> 2*main_y, rest remain the same}>
3.13/1.15	New Graphs: 
3.13/1.15	
3.13/1.15	LOG: CALL check - Post:main_n <= 0 - Process 2
3.13/1.15	* Exit transition: <l0, l2, 3 <= main_y + main_n /\ main_x = undef4 /\ main_y = undef5 /\ main_n = undef6, {all remain the same}>
3.13/1.15	* Postcondition  : main_n <= 0
3.13/1.15	
3.13/1.15	LOG: CALL solveLinear
3.13/1.15	
3.13/1.15	LOG: RETURN solveLinear - Elapsed time: 0.000529s
3.13/1.15	> Postcondition is not implied!
3.13/1.15	
3.13/1.15	LOG: RETURN check - Elapsed time: 0.000662s
3.13/1.15	INVARIANTS: 
3.13/1.15	2: 
3.13/1.15	Quasi-INVARIANTS to narrow Graph: 
3.13/1.15	2: main_n <= 0 , 
3.13/1.15	Narrowing transition: 
3.13/1.15	<l2, l2, 1 + main_x <= main_n /\ 1 <= main_x /\ 3 <= main_y + main_n, {main_x -> -5 - main_x + main_y, main_y -> 2*main_y, rest remain the same}>
3.13/1.15	
3.13/1.15	LOG: Narrow transition size 1
3.13/1.15	invGraph after Narrowing: 
3.13/1.15	Transitions:
3.13/1.15	<l2, l2, 1 + main_x <= main_n /\ 1 <= main_x /\ 1 <= main_n /\ 3 <= main_y + main_n, {main_x -> -5 - main_x + main_y, main_y -> 2*main_y, rest remain the same}>
3.13/1.15	Variables:
3.13/1.15	main_x, main_y, main_n
3.13/1.15	Checking conditional termination of SCC {l2}...
3.13/1.15	
3.13/1.15	LOG: CALL solveLinear
3.13/1.15	
3.13/1.15	LOG: RETURN solveLinear - Elapsed time: 0.000819s
3.13/1.15	
3.13/1.15	LOG: CALL solveLinear
3.13/1.15	
3.13/1.15	LOG: RETURN solveLinear - Elapsed time: 0.003518s
3.13/1.15	[13150 : 13162]
3.13/1.15	[13150 : 13163]
3.13/1.15	Successful child: 13162
3.13/1.15	[ Invariant Graph ]
3.13/1.15	Strengthening and disabling transitions...
3.13/1.15	
3.13/1.15	LOG: CALL solverLinear in Graph for feasibility
3.13/1.15	
3.13/1.15	LOG: RETURN solveLinear in Graph for feasibility
3.13/1.15	It's unfeasible. Removing transition: 
3.13/1.15	<l2, l2, 1 + main_x <= main_n /\ 1 <= main_x /\ 1 <= main_n /\ 3 <= main_y + main_n, {main_x -> -5 - main_x + main_y, main_y -> 2*main_y, rest remain the same}>
3.13/1.15	[ Termination Graph ]
3.13/1.15	Strengthening and disabling transitions...
3.13/1.15	
3.13/1.15	LOG: CALL solverLinear in Graph for feasibility
3.13/1.15	
3.13/1.15	LOG: RETURN solveLinear in Graph for feasibility
3.13/1.15	It's unfeasible. Removing transition: 
3.13/1.15	<l2, l2, 1 + main_x <= main_n /\ 1 <= main_x /\ 1 <= main_n /\ 3 <= main_y + main_n, {main_x -> -5 - main_x + main_y, main_y -> 2*main_y, rest remain the same}>
3.13/1.15	New Graphs: 
3.13/1.15	
3.13/1.15	LOG: CALL check - Post:main_n <= 1 - Process 3
3.13/1.15	* Exit transition: <l0, l2, 1 <= main_n /\ 3 <= main_y + main_n /\ main_x = undef4 /\ main_y = undef5 /\ main_n = undef6, {all remain the same}>
3.13/1.15	* Postcondition  : main_n <= 1
3.13/1.15	
3.13/1.15	LOG: CALL solveLinear
3.13/1.15	
3.13/1.15	LOG: RETURN solveLinear - Elapsed time: 0.000603s
3.13/1.15	> Postcondition is not implied!
3.13/1.15	
3.13/1.15	LOG: RETURN check - Elapsed time: 0.000721s
3.13/1.15	INVARIANTS: 
3.13/1.15	2: 
3.13/1.15	Quasi-INVARIANTS to narrow Graph: 
3.13/1.15	2: main_n <= 1 , 
3.13/1.15	Narrowing transition: 
3.13/1.15	<l2, l2, 1 + main_x <= main_n /\ 1 <= main_x /\ 1 <= main_n /\ 3 <= main_y + main_n, {main_x -> -5 - main_x + main_y, main_y -> 2*main_y, rest remain the same}>
3.13/1.15	
3.13/1.15	LOG: Narrow transition size 1
3.13/1.15	invGraph after Narrowing: 
3.13/1.15	Transitions:
3.13/1.15	<l2, l2, 2 <= main_n /\ 1 + main_x <= main_n /\ 1 <= main_x /\ 3 <= main_y + main_n, {main_x -> -5 - main_x + main_y, main_y -> 2*main_y, rest remain the same}>
3.13/1.15	Variables:
3.13/1.15	main_x, main_y, main_n
3.13/1.15	Checking conditional termination of SCC {l2}...
3.13/1.15	
3.13/1.15	LOG: CALL solveLinear
3.13/1.15	
3.13/1.15	LOG: RETURN solveLinear - Elapsed time: 0.000814s
3.13/1.15	
3.13/1.15	LOG: CALL solveLinear
3.13/1.15	
3.13/1.15	LOG: RETURN solveLinear - Elapsed time: 0.004241s
3.13/1.15	[13150 : 13167]
3.13/1.15	[13150 : 13168]
3.13/1.15	Successful child: 13167
3.13/1.15	[ Invariant Graph ]
3.13/1.15	Strengthening and disabling transitions...
3.13/1.15	
3.13/1.15	LOG: CALL solverLinear in Graph for feasibility
3.13/1.15	
3.13/1.15	LOG: RETURN solveLinear in Graph for feasibility
3.13/1.15	It's unfeasible. Removing transition: 
3.13/1.15	<l2, l2, 2 <= main_n /\ 1 + main_x <= main_n /\ 1 <= main_x /\ 3 <= main_y + main_n, {main_x -> -5 - main_x + main_y, main_y -> 2*main_y, rest remain the same}>
3.13/1.15	[ Termination Graph ]
3.13/1.15	Strengthening and disabling transitions...
3.13/1.15	> It's unfeasible. Removing transition: 
3.13/1.15	<l2, l2, 2 <= main_n /\ 1 + main_x <= main_n /\ 1 <= main_x /\ 3 <= main_y + main_n, {main_x -> -5 - main_x + main_y, main_y -> 2*main_y, rest remain the same}>
3.13/1.15	New Graphs: 
3.13/1.15	
3.13/1.15	LOG: CALL check - Post:main_x <= 0 - Process 4
3.13/1.15	* Exit transition: <l0, l2, 2 <= main_n /\ 3 <= main_y + main_n /\ main_x = undef4 /\ main_y = undef5 /\ main_n = undef6, {all remain the same}>
3.13/1.15	* Postcondition  : main_x <= 0
3.13/1.15	
3.13/1.15	LOG: CALL solveLinear
3.13/1.15	
3.13/1.15	LOG: RETURN solveLinear - Elapsed time: 0.000665s
3.13/1.15	> Postcondition is not implied!
3.13/1.15	
3.13/1.15	LOG: RETURN check - Elapsed time: 0.000793s
3.13/1.15	INVARIANTS: 
3.13/1.15	2: 
3.13/1.15	Quasi-INVARIANTS to narrow Graph: 
3.13/1.15	2: main_x <= 0 , 
3.13/1.15	Narrowing transition: 
3.13/1.15	<l2, l2, 2 <= main_n /\ 1 + main_x <= main_n /\ 1 <= main_x /\ 3 <= main_y + main_n, {main_x -> -5 - main_x + main_y, main_y -> 2*main_y, rest remain the same}>
3.13/1.15	
3.13/1.15	LOG: Narrow transition size 1
3.13/1.15	invGraph after Narrowing: 
3.13/1.15	Transitions:
3.13/1.15	<l2, l2, 2 <= main_n /\ 1 + main_x <= main_n /\ 1 <= main_x /\ 3 <= main_y + main_n, {main_x -> -5 - main_x + main_y, main_y -> 2*main_y, rest remain the same}>
3.13/1.15	Variables:
3.13/1.15	main_x, main_y, main_n
3.13/1.15	Checking conditional termination of SCC {l2}...
3.13/1.15	
3.13/1.15	LOG: CALL solveLinear
3.13/1.15	
3.13/1.15	LOG: RETURN solveLinear - Elapsed time: 0.000819s
3.13/1.15	
3.13/1.15	LOG: CALL solveLinear
3.13/1.15	
3.13/1.15	LOG: RETURN solveLinear - Elapsed time: 0.004193s
3.13/1.15	[13150 : 13172]
3.13/1.15	[13150 : 13173]
3.13/1.15	Successful child: 13172
3.13/1.15	[ Invariant Graph ]
3.13/1.15	Strengthening and disabling transitions...
3.13/1.15	
3.13/1.15	LOG: CALL solverLinear in Graph for feasibility
3.13/1.15	
3.13/1.15	LOG: RETURN solveLinear in Graph for feasibility
3.13/1.15	It's unfeasible. Removing transition: 
3.13/1.15	<l2, l2, 2 <= main_n /\ 1 + main_x <= main_n /\ 1 <= main_x /\ 3 <= main_y + main_n, {main_x -> -5 - main_x + main_y, main_y -> 2*main_y, rest remain the same}>
3.13/1.15	[ Termination Graph ]
3.13/1.15	Strengthening and disabling transitions...
3.13/1.15	> It's unfeasible. Removing transition: 
3.13/1.15	<l2, l2, 2 <= main_n /\ 1 + main_x <= main_n /\ 1 <= main_x /\ 3 <= main_y + main_n, {main_x -> -5 - main_x + main_y, main_y -> 2*main_y, rest remain the same}>
3.13/1.15	New Graphs: 
3.13/1.15	
3.13/1.15	LOG: CALL check - Post:main_n <= main_x - Process 5
3.13/1.15	* Exit transition: <l0, l2, 2 <= main_n /\ 1 <= main_x /\ 3 <= main_y + main_n /\ main_x = undef4 /\ main_y = undef5 /\ main_n = undef6, {all remain the same}>
3.13/1.15	* Postcondition  : main_n <= main_x
3.13/1.15	
3.13/1.15	LOG: CALL solveLinear
3.13/1.15	
3.13/1.15	LOG: RETURN solveLinear - Elapsed time: 0.000714s
3.13/1.15	> Postcondition is not implied!
3.13/1.15	
3.13/1.15	LOG: RETURN check - Elapsed time: 0.000849s
3.13/1.15	INVARIANTS: 
3.13/1.15	2: 
3.13/1.15	Quasi-INVARIANTS to narrow Graph: 
3.13/1.15	2: main_n <= main_x , 
3.13/1.15	Narrowing transition: 
3.13/1.15	<l2, l2, 2 <= main_n /\ 1 + main_x <= main_n /\ 1 <= main_x /\ 3 <= main_y + main_n, {main_x -> -5 - main_x + main_y, main_y -> 2*main_y, rest remain the same}>
3.13/1.15	
3.13/1.15	LOG: Narrow transition size 1
3.13/1.15	invGraph after Narrowing: 
3.13/1.15	Transitions:
3.13/1.15	<l2, l2, 2 <= main_n /\ 1 + main_x <= main_n /\ 1 <= main_x /\ 3 <= main_y + main_n, {main_x -> -5 - main_x + main_y, main_y -> 2*main_y, rest remain the same}>
3.13/1.15	Variables:
3.13/1.15	main_x, main_y, main_n
3.13/1.15	Checking conditional termination of SCC {l2}...
3.13/1.15	
3.13/1.15	LOG: CALL solveLinear
3.13/1.15	
3.13/1.15	LOG: RETURN solveLinear - Elapsed time: 0.000816s
3.13/1.15	
3.13/1.15	LOG: CALL solveLinear
3.13/1.15	
3.13/1.15	LOG: RETURN solveLinear - Elapsed time: 0.004224s
3.13/1.15	[13150 : 13177]
3.13/1.15	[13150 : 13178]
3.13/1.15	Successful child: 13177
3.13/1.15	[ Invariant Graph ]
3.13/1.15	Strengthening and disabling transitions...
3.13/1.15	
3.13/1.15	LOG: CALL solverLinear in Graph for feasibility
3.13/1.15	
3.13/1.15	LOG: RETURN solveLinear in Graph for feasibility
3.13/1.15	Strengthening transition (result): 
3.13/1.15	<l2, l2, 2 <= main_n /\ 1 + main_x <= main_n /\ 1 <= main_x /\ 3 <= main_y + main_n /\ main_x + main_y <= 4, {main_x -> -5 - main_x + main_y, main_y -> 2*main_y, rest remain the same}>
3.13/1.15	[ Termination Graph ]
3.13/1.15	Strengthening and disabling transitions...
3.13/1.15	
3.13/1.15	LOG: CALL solverLinear in Graph for feasibility
3.13/1.15	
3.13/1.15	LOG: RETURN solveLinear in Graph for feasibility
3.13/1.15	Strengthening transition (result): 
3.13/1.15	<l2, l2, 2 <= main_n /\ 1 + main_x <= main_n /\ 1 <= main_x /\ 3 <= main_y + main_n /\ main_x + main_y <= 4, {main_x -> -5 - main_x + main_y, main_y -> 2*main_y, rest remain the same}>
3.13/1.15	Ranking function: main_x - main_y + main_n
3.13/1.15	New Graphs: 
3.13/1.15	
3.13/1.15	LOG: CALL check - Post:main_x + main_y <= 4 - Process 6
3.13/1.15	* Exit transition: <l0, l2, 2 <= main_n /\ 1 + main_x <= main_n /\ 1 <= main_x /\ 3 <= main_y + main_n /\ main_x = undef4 /\ main_y = undef5 /\ main_n = undef6, {all remain the same}>
3.13/1.15	* Postcondition  : main_x + main_y <= 4
3.13/1.15	
3.13/1.15	LOG: CALL solveLinear
3.13/1.15	
3.13/1.15	LOG: RETURN solveLinear - Elapsed time: 0.000671s
3.13/1.15	> Postcondition is not implied!
3.13/1.15	
3.13/1.15	LOG: RETURN check - Elapsed time: 0.000813s
3.13/1.15	INVARIANTS: 
3.13/1.15	2: 
3.13/1.15	Quasi-INVARIANTS to narrow Graph: 
3.13/1.15	2: main_x + main_y <= 4 , 
3.13/1.15	Narrowing transition: 
3.13/1.15	<l2, l2, 2 <= main_n /\ 1 + main_x <= main_n /\ 1 <= main_x /\ 3 <= main_y + main_n, {main_x -> -5 - main_x + main_y, main_y -> 2*main_y, rest remain the same}>
3.13/1.15	
3.13/1.15	LOG: Narrow transition size 1
3.13/1.15	invGraph after Narrowing: 
3.13/1.15	Transitions:
3.13/1.15	<l2, l2, 5 <= main_x + main_y /\ 2 <= main_n /\ 1 + main_x <= main_n /\ 1 <= main_x /\ 3 <= main_y + main_n, {main_x -> -5 - main_x + main_y, main_y -> 2*main_y, rest remain the same}>
3.13/1.15	Variables:
3.13/1.15	main_x, main_y, main_n
3.13/1.15	Checking conditional termination of SCC {l2}...
3.13/1.15	
3.13/1.15	LOG: CALL solveLinear
3.13/1.15	
3.13/1.15	LOG: RETURN solveLinear - Elapsed time: 0.000891s
3.13/1.15	
3.13/1.15	LOG: CALL solveLinear
3.13/1.15	
3.13/1.15	LOG: RETURN solveLinear - Elapsed time: 0.005831s
3.13/1.15	[13150 : 13182]
3.13/1.15	[13150 : 13183]
3.13/1.15	Successful child: 13182
3.13/1.15	[ Invariant Graph ]
3.13/1.15	Strengthening and disabling transitions...
3.13/1.15	
3.13/1.15	LOG: CALL solverLinear in Graph for feasibility
3.13/1.15	
3.13/1.15	LOG: RETURN solveLinear in Graph for feasibility
3.13/1.15	Strengthening transition (result): 
3.13/1.15	<l2, l2, main_y <= 0 /\ 5 <= main_x + main_y /\ 2 <= main_n /\ 1 + main_x <= main_n /\ 1 <= main_x /\ 3 <= main_y + main_n, {main_x -> -5 - main_x + main_y, main_y -> 2*main_y, rest remain the same}>
3.13/1.15	[ Termination Graph ]
3.13/1.15	Strengthening and disabling transitions...
3.13/1.15	
3.13/1.15	LOG: CALL solverLinear in Graph for feasibility
3.13/1.15	
3.13/1.15	LOG: RETURN solveLinear in Graph for feasibility
3.13/1.15	Strengthening transition (result): 
3.13/1.15	<l2, l2, main_y <= 0 /\ 5 <= main_x + main_y /\ 2 <= main_n /\ 1 + main_x <= main_n /\ 1 <= main_x /\ 3 <= main_y + main_n, {main_x -> -5 - main_x + main_y, main_y -> 2*main_y, rest remain the same}>
3.13/1.15	Ranking function: main_x - main_y
3.13/1.15	New Graphs: 
3.13/1.15	
3.13/1.15	LOG: CALL check - Post:main_y <= 0 - Process 7
3.13/1.15	* Exit transition: <l0, l2, 5 <= main_x + main_y /\ 2 <= main_n /\ 1 + main_x <= main_n /\ 1 <= main_x /\ 3 <= main_y + main_n /\ main_x = undef4 /\ main_y = undef5 /\ main_n = undef6, {all remain the same}>
3.13/1.15	* Postcondition  : main_y <= 0
3.13/1.15	
3.13/1.15	LOG: CALL solveLinear
3.13/1.15	
3.13/1.15	LOG: RETURN solveLinear - Elapsed time: 0.000663s
3.13/1.15	> Postcondition is not implied!
3.13/1.15	
3.13/1.15	LOG: RETURN check - Elapsed time: 0.000808s
3.13/1.15	INVARIANTS: 
3.13/1.15	2: 
3.13/1.15	Quasi-INVARIANTS to narrow Graph: 
3.13/1.15	2: main_y <= 0 , 
3.13/1.15	Narrowing transition: 
3.13/1.15	<l2, l2, 5 <= main_x + main_y /\ 2 <= main_n /\ 1 + main_x <= main_n /\ 1 <= main_x /\ 3 <= main_y + main_n, {main_x -> -5 - main_x + main_y, main_y -> 2*main_y, rest remain the same}>
3.13/1.15	
3.13/1.15	LOG: Narrow transition size 1
3.13/1.15	invGraph after Narrowing: 
3.13/1.15	Transitions:
3.13/1.15	<l2, l2, 5 <= main_x + main_y /\ 2 <= main_n /\ 1 + main_x <= main_n /\ 1 <= main_x /\ 1 <= main_y /\ 3 <= main_y + main_n, {main_x -> -5 - main_x + main_y, main_y -> 2*main_y, rest remain the same}>
3.13/1.15	Variables:
3.13/1.15	main_x, main_y, main_n
3.13/1.15	Checking conditional termination of SCC {l2}...
3.13/1.15	
3.13/1.15	LOG: CALL solveLinear
3.13/1.15	
3.13/1.15	LOG: RETURN solveLinear - Elapsed time: 0.001035s
3.13/1.15	
3.13/1.15	LOG: CALL solveLinear
3.13/1.15	
3.13/1.15	LOG: RETURN solveLinear - Elapsed time: 0.004804s
3.13/1.15	[13150 : 13187]
3.13/1.15	[13150 : 13188]
3.13/1.15	Successful child: 13187
3.13/1.15	[ Invariant Graph ]
3.13/1.15	Strengthening and disabling transitions...
3.13/1.15	
3.13/1.15	LOG: CALL solverLinear in Graph for feasibility
3.13/1.15	
3.13/1.15	LOG: RETURN solveLinear in Graph for feasibility
3.13/1.15	Strengthening transition (result): 
3.13/1.15	<l2, l2, 5 + main_x + main_n <= main_y /\ 5 <= main_x + main_y /\ 2 <= main_n /\ 1 + main_x <= main_n /\ 1 <= main_x /\ 1 <= main_y /\ 3 <= main_y + main_n, {main_x -> -5 - main_x + main_y, main_y -> 2*main_y, rest remain the same}>
3.13/1.15	[ Termination Graph ]
3.13/1.15	Strengthening and disabling transitions...
3.13/1.15	
3.13/1.15	LOG: CALL solverLinear in Graph for feasibility
3.13/1.15	
3.13/1.15	LOG: RETURN solveLinear in Graph for feasibility
3.13/1.15	Strengthening transition (result): 
3.13/1.15	<l2, l2, 5 + main_x + main_n <= main_y /\ 5 <= main_x + main_y /\ 2 <= main_n /\ 1 + main_x <= main_n /\ 1 <= main_x /\ 1 <= main_y /\ 3 <= main_y + main_n, {main_x -> -5 - main_x + main_y, main_y -> 2*main_y, rest remain the same}>
3.13/1.15	Ranking function: -main_x + main_n
3.13/1.15	New Graphs: 
3.13/1.15	
3.13/1.15	LOG: CALL check - Post:5 + main_x + main_n <= main_y - Process 8
3.13/1.15	* Exit transition: <l0, l2, 5 <= main_x + main_y /\ 2 <= main_n /\ 1 + main_x <= main_n /\ 1 <= main_x /\ 1 <= main_y /\ 3 <= main_y + main_n /\ main_x = undef4 /\ main_y = undef5 /\ main_n = undef6, {all remain the same}>
3.13/1.15	* Postcondition  : 5 + main_x + main_n <= main_y
3.13/1.15	
3.13/1.15	LOG: CALL solveLinear
3.13/1.15	
3.13/1.15	LOG: RETURN solveLinear - Elapsed time: 0.000699s
3.13/1.15	> Postcondition is not implied!
3.13/1.15	
3.13/1.15	LOG: RETURN check - Elapsed time: 0.000867s
3.13/1.15	INVARIANTS: 
3.13/1.15	2: 
3.13/1.15	Quasi-INVARIANTS to narrow Graph: 
3.13/1.15	2: 5 + main_x + main_n <= main_y , 
3.13/1.15	Narrowing transition: 
3.13/1.15	<l2, l2, 5 <= main_x + main_y /\ 2 <= main_n /\ 1 + main_x <= main_n /\ 1 <= main_x /\ 1 <= main_y /\ 3 <= main_y + main_n, {main_x -> -5 - main_x + main_y, main_y -> 2*main_y, rest remain the same}>
3.13/1.15	
3.13/1.15	LOG: Narrow transition size 1
3.13/1.15	invGraph after Narrowing: 
3.13/1.15	Transitions:
3.13/1.15	<l2, l2, 5 <= main_x + main_y /\ 2 <= main_n /\ 1 + main_x <= main_n /\ 1 <= main_x /\ 1 <= main_y /\ 3 <= main_y + main_n /\ main_y <= 4 + main_x + main_n, {main_x -> -5 - main_x + main_y, main_y -> 2*main_y, rest remain the same}>
3.13/1.15	Variables:
3.13/1.15	main_x, main_y, main_n
3.13/1.15	Checking conditional termination of SCC {l2}...
3.13/1.15	
3.13/1.15	LOG: CALL solveLinear
3.13/1.15	
3.13/1.15	LOG: RETURN solveLinear - Elapsed time: 0.001553s
3.13/1.15	Ranking function: (2 / 3) + (1 / 15)*main_x + (~(1) / 5)*main_y + (1 / 3)*main_n
3.13/1.15	New Graphs: 
3.13/1.15	Proving termination of subgraph 2
3.13/1.15	Analyzing SCC {l7}...
3.13/1.15	No cycles found.
3.13/1.15	
3.13/1.15	Program Terminates
3.13/1.15	EOF