170.58/73.33	NO
170.58/73.33	
170.58/73.33	Solver Timeout: 4
170.58/73.33	Global Timeout: 300
170.58/73.33	Maximum number of concurrent processes: 900
170.58/73.33	*******************************************************************************************
170.58/73.33	*********************** UNPROCESSED TRANSITION SYSTEMS PER FUNCTION ***********************
170.58/73.33	*******************************************************************************************
170.58/73.33	
170.58/73.33	
170.58/73.33	List of LLVMGraphs + assumeNodes + staticAssertNodes [1] :
170.58/73.33	
170.58/73.33	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
170.58/73.33	+                                                                  +
170.58/73.33	Init Location: 0
170.58/73.33	Transitions:
170.58/73.33	<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)}>
170.58/73.33	<l1, l2, true>
170.58/73.33	<l2, l5, not((main_x < 0))>
170.58/73.33	<l2, l3, (main_x < 0)>
170.58/73.33	<l3, l4, true, seq{main_x -> (main_x + main_z), main_z -> (~(2) * main_y), main_y -> (main_y + 1)}>
170.58/73.33	<l4, l2, true>
170.58/73.33	<l5, l6, true, seq{main__func_return_ -> 0}>
170.58/73.33	
170.58/73.33	Fresh variables:
170.58/73.33	
170.58/73.33	Undef variables:
170.58/73.33	
170.58/73.33	Abstraction variables:
170.58/73.33	
170.58/73.33	Exit nodes:
170.58/73.33	
170.58/73.33	Accepting locations:
170.58/73.33	
170.58/73.33	Asserts:
170.58/73.33	
170.58/73.33	+ Assume Nodes [0]: ++++++++++++++++++++++++++++++++++++++++++++++++
170.58/73.33	       
170.58/73.33	+ Static Assert Nodes [0]: +++++++++++++++++++++++++++++++++++++++++
170.58/73.33	       
170.58/73.33	+ After preprocess (paralelization): ++++++++++++++++++++++++++++++
170.58/73.33	
170.58/73.33	Init Location: 0
170.58/73.33	Transitions:
170.58/73.33	<l0, l7, true, seq{main__func_return_ -> 0}>
170.58/73.33	<l7, l8, true, seq{varCall_1 -> ¿functionCall(__VERIFIER_nondet_int)}>
170.58/73.33	<l8, l9, true, seq{main_x -> varCall_1}>
170.58/73.33	<l9, l10, true, seq{varCall_2 -> ¿functionCall(__VERIFIER_nondet_int)}>
170.58/73.33	<l10, l11, true, seq{main_y -> varCall_2}>
170.58/73.33	<l11, l12, true, seq{varCall_3 -> ¿functionCall(__VERIFIER_nondet_int)}>
170.58/73.33	<l12, l1, true, seq{main_z -> varCall_3}>
170.58/73.33	<l1, l2, true>
170.58/73.33	<l2, l3, (main_x < 0)>
170.58/73.33	<l2, l5, not((main_x < 0))>
170.58/73.33	<l3, l4, true, seq{main_x -> (main_x + main_z), main_z -> (~(2) * main_y), main_y -> (main_y + 1)}>
170.58/73.33	<l4, l2, true>
170.58/73.33	<l5, l6, true, seq{main__func_return_ -> 0}>
170.58/73.33	
170.58/73.33	Fresh variables:
170.58/73.33	
170.58/73.33	Undef variables:
170.58/73.33	
170.58/73.33	Abstraction variables:
170.58/73.33	
170.58/73.33	Exit nodes:
170.58/73.33	6, 
170.58/73.33	Accepting locations:
170.58/73.33	
170.58/73.33	Asserts:
170.58/73.33	
170.58/73.33	+                                                                  +
170.58/73.33	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
170.58/73.33	
170.58/73.33	
170.58/73.33	Function Return and Parameters Information [2 functions]:
170.58/73.33	    function name: __VERIFIER_nondet_int [1 return + 0 parameters]        demangled: __VERIFIER_nondet_int
170.58/73.33	        __VERIFIER_nondet_int__func_return_      [function result] : int
170.58/73.33	    function name: main [1 return + 0 parameters]        demangled: main
170.58/73.33	        main__func_return_      [function result] : int
170.58/73.33	
170.58/73.33	
170.58/73.33	AST Ident Scanner Information [5 idents]:
170.58/73.33	__VERIFIER_nondet_int | function | [integer, ()] | <line: 20, col: 1> | <line: 24, col: 9> <line: 25, col: 9> <line: 26, col: 9>
170.58/73.33	main | function | [integer, ()] | <line: 22, col: 1>
170.58/73.33	x | local variable | integer | <line: 23, col: 5> | <line: 24, col: 5> <line: 27, col: 12> <line: 28, col: 9> <line: 28, col: 13>
170.58/73.33	y | local variable | integer | <line: 23, col: 5> | <line: 25, col: 5> <line: 29, col: 16> <line: 30, col: 9> <line: 30, col: 13>
170.58/73.33	z | local variable | integer | <line: 23, col: 5> | <line: 26, col: 5> <line: 28, col: 17> <line: 29, col: 9>
170.58/73.33	
170.58/73.33	Main function: main
170.58/73.33	Preprocessed LLVMGraph
170.58/73.33	Init Location: 0
170.58/73.33	Transitions:
170.58/73.33	<l0, l2, (main_x = undef4) /\ (main_y = undef5) /\ (main_z = undef6)>
170.58/73.33	<l2, l2, (main_x < 0), par{main_x -> (main_x + main_z), main_y -> (main_y + 1), main_z -> (~(2) * main_y)}>
170.58/73.33	<l2, l6, not((main_x < 0))>
170.58/73.33	
170.58/73.33	Fresh variables:
170.58/73.33	undef4, undef5, undef6, 
170.58/73.33	
170.58/73.33	Undef variables:
170.58/73.33	undef4, undef5, undef6, 
170.58/73.33	
170.58/73.33	Abstraction variables:
170.58/73.33	
170.58/73.33	Exit nodes:
170.58/73.33	6, 
170.58/73.33	Accepting locations:
170.58/73.33	
170.58/73.33	Asserts:
170.58/73.33	
170.58/73.33	*************************************************************
170.58/73.33	*******************************************************************************************
170.58/73.33	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
170.58/73.33	*******************************************************************************************
170.58/73.33	
170.58/73.33	Init Location: 0
170.58/73.33	Graph 0:
170.58/73.33	Transitions:
170.58/73.33	Variables:
170.58/73.33	
170.58/73.33	Graph 1:
170.58/73.33	Transitions:
170.58/73.33	<l2, l2, 1 + main_x <= 0, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}>
170.58/73.33	Variables:
170.58/73.33	main_x, main_y, main_z
170.58/73.33	
170.58/73.33	Graph 2:
170.58/73.33	Transitions:
170.58/73.33	Variables:
170.58/73.33	
170.58/73.33	Precedence: 
170.58/73.33	Graph 0
170.58/73.33	
170.58/73.33	Graph 1
170.58/73.33	<l0, l2, main_x = undef4 /\ main_y = undef5 /\ main_z = undef6, {all remain the same}>
170.58/73.33	
170.58/73.33	Graph 2
170.58/73.33	<l2, l6, 0 <= main_x, {all remain the same}>
170.58/73.33	
170.58/73.33	Map Locations to Subgraph:
170.58/73.33	( 0 , 0 )
170.58/73.33	( 2 , 1 )
170.58/73.33	( 6 , 2 )
170.58/73.33	
170.58/73.33	*******************************************************************************************
170.58/73.33	********************************    CHECKING ASSERTIONS    ********************************
170.58/73.33	*******************************************************************************************
170.58/73.33	
170.58/73.33	Proving termination of subgraph 0
170.58/73.33	Proving termination of subgraph 1
170.58/73.33	Checking unfeasibility...
170.58/73.33	Time used: 0.002687
170.58/73.33	
170.58/73.33	Checking conditional termination of SCC {l2}...
170.58/73.33	
170.58/73.33	LOG: CALL solveLinear
170.58/73.33	
170.58/73.33	LOG: RETURN solveLinear - Elapsed time: 0.000845s
170.58/73.33	
170.58/73.33	LOG: CALL solveLinear
170.58/73.33	
170.58/73.33	LOG: RETURN solveLinear - Elapsed time: 0.001995s
170.58/73.33	[56610 : 56612]
170.58/73.33	[56610 : 56613]
170.58/73.33	Successful child: 56612
170.58/73.33	[ Invariant Graph ]
170.58/73.33	Strengthening and disabling transitions...
170.58/73.33	
170.58/73.33	LOG: CALL solverLinear in Graph for feasibility
170.58/73.33	
170.58/73.33	LOG: RETURN solveLinear in Graph for feasibility
170.58/73.33	It's unfeasible. Removing transition: 
170.58/73.33	<l2, l2, 1 + main_x <= 0, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}>
170.58/73.33	[ Termination Graph ]
170.58/73.33	Strengthening and disabling transitions...
170.58/73.33	
170.58/73.33	LOG: CALL solverLinear in Graph for feasibility
170.58/73.33	
170.58/73.33	LOG: RETURN solveLinear in Graph for feasibility
170.58/73.33	It's unfeasible. Removing transition: 
170.58/73.33	<l2, l2, 1 + main_x <= 0, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}>
170.58/73.33	New Graphs: 
170.58/73.33	
170.58/73.33	LOG: CALL check - Post:1 <= main_x - Process 1
170.58/73.33	* Exit transition: <l0, l2, main_x = undef4 /\ main_y = undef5 /\ main_z = undef6, {all remain the same}>
170.58/73.33	* Postcondition  : 1 <= main_x
170.58/73.33	
170.58/73.33	LOG: CALL solveLinear
170.58/73.33	
170.58/73.33	LOG: RETURN solveLinear - Elapsed time: 0.000573s
170.58/73.33	> Postcondition is not implied!
170.58/73.33	
170.58/73.33	LOG: RETURN check - Elapsed time: 0.000677s
170.58/73.33	INVARIANTS: 
170.58/73.33	2: 
170.58/73.33	Quasi-INVARIANTS to narrow Graph: 
170.58/73.33	2: 1 <= main_x , 
170.58/73.33	Narrowing transition: 
170.58/73.33	<l2, l2, 1 + main_x <= 0, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}>
170.58/73.33	
170.58/73.33	LOG: Narrow transition size 1
170.58/73.33	invGraph after Narrowing: 
170.58/73.33	Transitions:
170.58/73.33	<l2, l2, 1 + main_x <= 0, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}>
170.58/73.33	Variables:
170.58/73.33	main_x, main_y, main_z
170.58/73.33	Checking conditional termination of SCC {l2}...
170.58/73.33	
170.58/73.33	LOG: CALL solveLinear
170.58/73.33	
170.58/73.33	LOG: RETURN solveLinear - Elapsed time: 0.000804s
170.58/73.33	
170.58/73.33	LOG: CALL solveLinear
170.58/73.33	
170.58/73.33	LOG: RETURN solveLinear - Elapsed time: 0.002141s
170.58/73.33	[56610 : 56617]
170.58/73.33	[56610 : 56618]
170.58/73.33	Successful child: 56617
170.58/73.33	[ Invariant Graph ]
170.58/73.33	Strengthening and disabling transitions...
170.58/73.33	
170.58/73.33	LOG: CALL solverLinear in Graph for feasibility
170.58/73.33	
170.58/73.33	LOG: RETURN solveLinear in Graph for feasibility
170.58/73.33	It's unfeasible. Removing transition: 
170.58/73.33	<l2, l2, 1 + main_x <= 0, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}>
170.58/73.33	[ Termination Graph ]
170.58/73.33	Strengthening and disabling transitions...
170.58/73.33	> It's unfeasible. Removing transition: 
170.58/73.33	<l2, l2, 1 + main_x <= 0, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}>
170.58/73.33	New Graphs: 
170.58/73.33	
170.58/73.33	LOG: CALL check - Post:0 <= main_x - Process 2
170.58/73.33	* Exit transition: <l0, l2, main_x <= 0 /\ main_x = undef4 /\ main_y = undef5 /\ main_z = undef6, {all remain the same}>
170.58/73.33	* Postcondition  : 0 <= main_x
170.58/73.33	
170.58/73.33	LOG: CALL solveLinear
170.58/73.33	
170.58/73.33	LOG: RETURN solveLinear - Elapsed time: 0.000676s
170.58/73.33	> Postcondition is not implied!
170.58/73.33	
170.58/73.33	LOG: RETURN check - Elapsed time: 0.000784s
170.58/73.33	INVARIANTS: 
170.58/73.33	2: 
170.58/73.33	Quasi-INVARIANTS to narrow Graph: 
170.58/73.33	2: 0 <= main_x , 
170.58/73.33	Narrowing transition: 
170.58/73.33	<l2, l2, 1 + main_x <= 0, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}>
170.58/73.33	
170.58/73.33	LOG: Narrow transition size 1
170.58/73.33	invGraph after Narrowing: 
170.58/73.33	Transitions:
170.58/73.33	<l2, l2, 1 + main_x <= 0, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}>
170.58/73.33	Variables:
170.58/73.33	main_x, main_y, main_z
170.58/73.33	Checking conditional termination of SCC {l2}...
170.58/73.33	
170.58/73.33	LOG: CALL solveLinear
170.58/73.33	
170.58/73.33	LOG: RETURN solveLinear - Elapsed time: 0.000816s
170.58/73.33	
170.58/73.33	LOG: CALL solveLinear
170.58/73.33	
170.58/73.33	LOG: RETURN solveLinear - Elapsed time: 0.002125s
170.58/73.33	[56610 : 56622]
170.58/73.33	[56610 : 56623]
170.58/73.33	Successful child: 56622
170.58/73.33	[ Invariant Graph ]
170.58/73.33	Strengthening and disabling transitions...
170.58/73.33	
170.58/73.33	LOG: CALL solverLinear in Graph for feasibility
170.58/73.33	
170.58/73.33	LOG: RETURN solveLinear in Graph for feasibility
170.58/73.33	Strengthening transition (result): 
170.58/73.33	<l2, l2, 0 <= main_x + main_z /\ 1 + main_x <= 0 /\ main_y <= 1 + main_x, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}>
170.58/73.33	[ Termination Graph ]
170.58/73.33	Strengthening and disabling transitions...
170.58/73.33	
170.58/73.33	LOG: CALL solverLinear in Graph for feasibility
170.58/73.33	
170.58/73.33	LOG: RETURN solveLinear in Graph for feasibility
170.58/73.33	Strengthening transition (result): 
170.58/73.33	<l2, l2, 0 <= main_x + main_z /\ 1 + main_x <= 0 /\ main_y <= 1 + main_x, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}>
170.58/73.33	Ranking function: -main_x
170.58/73.33	New Graphs: 
170.58/73.33	[56610 : 56627]
170.58/73.33	[56610 : 56628]
170.58/73.33	INVARIANTS: 
170.58/73.33	2: 
170.58/73.33	Quasi-INVARIANTS to narrow Graph: 
170.58/73.33	2: 0 <= main_x + main_z , main_y <= 1 + main_x , 
170.58/73.33	Narrowing transition: 
170.58/73.33	<l2, l2, 1 + main_x <= 0, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}>
170.58/73.33	
170.58/73.33	LOG: Narrow transition size 2
170.58/73.33	invGraph after Narrowing: 
170.58/73.33	Transitions:
170.58/73.33	<l2, l2, 0 <= main_x + main_z /\ 2 + main_x <= main_y /\ 1 + main_x <= 0, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}>
170.58/73.33	<l2, l2, 1 + main_x <= 0 /\ 1 + main_x + main_z <= 0, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}>
170.58/73.33	Variables:
170.58/73.33	main_x, main_y, main_z
170.58/73.33	Checking conditional termination of SCC {l2}...
170.58/73.33	
170.58/73.33	LOG: CALL solveLinear
170.58/73.33	
170.58/73.33	LOG: RETURN solveLinear - Elapsed time: 0.001178s
170.58/73.33	
170.58/73.33	LOG: CALL solveLinear
170.58/73.33	
170.58/73.33	LOG: RETURN solveLinear - Elapsed time: 0.008022s
170.58/73.33	Piecewise ranking function: min(2,1 - main_x)
170.58/73.33	New Graphs: 
170.58/73.33	Transitions:
170.58/73.33	<l2, l2, 1 + main_x <= 0 /\ 1 + main_x + main_z <= 0, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}>
170.58/73.33	Variables:
170.58/73.33	main_x, main_y, main_z
170.58/73.33	Checking conditional termination of SCC {l2}...
170.58/73.33	
170.58/73.33	LOG: CALL solveLinear
170.58/73.33	
170.58/73.33	LOG: RETURN solveLinear - Elapsed time: 0.000605s
170.58/73.33	
170.58/73.33	LOG: CALL solveLinear
170.58/73.33	
170.58/73.33	LOG: RETURN solveLinear - Elapsed time: 0.002055s
170.58/73.33	[56610 : 56629]
170.58/73.33	[56610 : 56630]
170.58/73.33	Successful child: 56629
170.58/73.33	[ Invariant Graph ]
170.58/73.33	Strengthening and disabling transitions...
170.58/73.33	
170.58/73.33	LOG: CALL solverLinear in Graph for feasibility
170.58/73.33	
170.58/73.33	LOG: RETURN solveLinear in Graph for feasibility
170.58/73.33	It's unfeasible. Removing transition: 
170.58/73.33	<l2, l2, 0 <= main_x + main_z /\ 2 + main_x <= main_y /\ 1 + main_x <= 0, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}>
170.58/73.33	
170.58/73.33	LOG: CALL solverLinear in Graph for feasibility
170.58/73.33	
170.58/73.33	LOG: RETURN solveLinear in Graph for feasibility
170.58/73.33	Strengthening transition (result): 
170.58/73.33	<l2, l2, main_y <= main_x /\ 1 + main_x <= 0 /\ 1 + main_x + main_z <= 0 /\ 1 <= main_z, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}>
170.58/73.33	[ Termination Graph ]
170.58/73.33	Strengthening and disabling transitions...
170.58/73.33	
170.58/73.33	LOG: CALL solverLinear in Graph for feasibility
170.58/73.33	
170.58/73.33	LOG: RETURN solveLinear in Graph for feasibility
170.58/73.33	Strengthening transition (result): 
170.58/73.33	<l2, l2, main_y <= main_x /\ 1 + main_x <= 0 /\ 1 + main_x + main_z <= 0 /\ 1 <= main_z, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}>
170.58/73.33	Ranking function: -main_y
170.58/73.33	New Graphs: 
170.58/73.33	[56610 : 56634]
170.58/73.33	[56610 : 56635]
170.58/73.33	[56610 : 56636]
170.58/73.33	INVARIANTS: 
170.58/73.33	2: 
170.58/73.33	Quasi-INVARIANTS to narrow Graph: 
170.58/73.33	2: main_y <= main_x , 1 <= main_z , 
170.58/73.33	Narrowing transition: 
170.58/73.33	<l2, l2, 0 <= main_x + main_z /\ 2 + main_x <= main_y /\ 1 + main_x <= 0, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}>
170.58/73.33	
170.58/73.33	LOG: Narrow transition size 2
170.58/73.33	Narrowing transition: 
170.58/73.33	<l2, l2, 1 + main_x <= 0 /\ 1 + main_x + main_z <= 0, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}>
170.58/73.33	
170.58/73.33	LOG: Narrow transition size 2
170.58/73.33	invGraph after Narrowing: 
170.58/73.33	Transitions:
170.58/73.33	<l2, l2, 0 <= main_x + main_z /\ 2 + main_x <= main_y /\ 1 + main_x <= 0, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}>
170.58/73.33	<l2, l2, main_y <= main_x /\ main_z <= 0 /\ 1 + main_x <= 0 /\ 1 + main_x + main_z <= 0, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}>
170.58/73.33	<l2, l2, 1 + main_x <= 0 /\ 1 + main_x <= main_y /\ 1 + main_x + main_z <= 0, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}>
170.58/73.33	Variables:
170.58/73.33	main_x, main_y, main_z
170.58/73.33	Checking conditional termination of SCC {l2}...
170.58/73.33	
170.58/73.33	LOG: CALL solveLinear
170.58/73.33	
170.58/73.33	LOG: RETURN solveLinear - Elapsed time: 0.002311s
170.58/73.33	Ranking function: 2 - 2*main_y
170.58/73.33	New Graphs: 
170.58/73.33	Transitions:
170.58/73.33	<l2, l2, 0 <= main_x + main_z /\ 2 + main_x <= main_y /\ 1 + main_x <= 0, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}>
170.58/73.33	<l2, l2, 1 + main_x <= 0 /\ 1 + main_x <= main_y /\ 1 + main_x + main_z <= 0, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}>
170.58/73.33	Variables:
170.58/73.33	main_x, main_y, main_z
170.58/73.33	Checking conditional termination of SCC {l2}...
170.58/73.33	
170.58/73.33	LOG: CALL solveLinear
170.58/73.33	
170.58/73.33	LOG: RETURN solveLinear - Elapsed time: 0.001250s
170.58/73.33	
170.58/73.33	LOG: CALL solveLinear
170.58/73.33	
170.58/73.33	LOG: RETURN solveLinear - Elapsed time: 0.011515s
170.58/73.33	Piecewise ranking function: min(0,-1 - main_x)
170.58/73.33	New Graphs: 
170.58/73.33	Transitions:
170.58/73.33	<l2, l2, 1 + main_x <= 0 /\ 1 + main_x <= main_y /\ 1 + main_x + main_z <= 0, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}>
170.58/73.33	Variables:
170.58/73.33	main_x, main_y, main_z
170.58/73.33	Checking conditional termination of SCC {l2}...
170.58/73.33	
170.58/73.33	LOG: CALL solveLinear
170.58/73.33	
170.58/73.33	LOG: RETURN solveLinear - Elapsed time: 0.000706s
170.58/73.33	
170.58/73.33	LOG: CALL solveLinear
170.58/73.33	
170.58/73.33	LOG: RETURN solveLinear - Elapsed time: 0.002461s
170.58/73.33	[56610 : 56637]
170.58/73.33	[56610 : 56638]
170.58/73.33	Successful child: 56637
170.58/73.33	[ Invariant Graph ]
170.58/73.33	Strengthening and disabling transitions...
170.58/73.33	
170.58/73.33	LOG: CALL solverLinear in Graph for feasibility
170.58/73.33	
170.58/73.33	LOG: RETURN solveLinear in Graph for feasibility
170.58/73.33	Strengthening transition (result): 
170.58/73.33	<l2, l2, 2*main_y <= 2*main_x + main_z /\ 0 <= main_x + main_z /\ 2 + main_x <= main_y /\ 1 + main_x <= 0, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}>
170.58/73.33	
170.58/73.33	LOG: CALL solverLinear in Graph for feasibility
170.58/73.33	
170.58/73.33	LOG: RETURN solveLinear in Graph for feasibility
170.58/73.33	Strengthening transition (result): 
170.58/73.33	<l2, l2, 2*main_y <= 2*main_x + main_z /\ main_y <= main_x /\ main_z <= 0 /\ 1 + main_x <= 0 /\ 1 + main_x + main_z <= 0, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}>
170.58/73.33	
170.58/73.33	LOG: CALL solverLinear in Graph for feasibility
170.58/73.33	
170.58/73.33	LOG: RETURN solveLinear in Graph for feasibility
170.58/73.33	Strengthening transition (result): 
170.58/73.33	<l2, l2, 2*main_y <= 2*main_x + main_z /\ 1 + main_x <= 0 /\ 1 + main_x <= main_y /\ 1 + main_x + main_z <= 0, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}>
170.58/73.33	[ Termination Graph ]
170.58/73.33	Strengthening and disabling transitions...
170.58/73.33	
170.58/73.33	LOG: CALL solverLinear in Graph for feasibility
170.58/73.33	
170.58/73.33	LOG: RETURN solveLinear in Graph for feasibility
170.58/73.33	Strengthening transition (result): 
170.58/73.33	<l2, l2, 2*main_y <= 2*main_x + main_z /\ 1 + main_x <= 0 /\ 1 + main_x <= main_y /\ 1 + main_x + main_z <= 0, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}>
170.58/73.33	Ranking function: 90 - main_x + main_y
170.58/73.33	New Graphs: 
170.58/73.33	[56610 : 56642]
170.58/73.33	[56610 : 56643]
170.58/73.33	[56610 : 56644]
170.58/73.33	INVARIANTS: 
170.58/73.33	2: 
170.58/73.33	Quasi-INVARIANTS to narrow Graph: 
170.58/73.33	2: 2*main_y <= 2*main_x + main_z , 
170.58/73.33	Narrowing transition: 
170.58/73.33	<l2, l2, 0 <= main_x + main_z /\ 2 + main_x <= main_y /\ 1 + main_x <= 0, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}>
170.58/73.33	
170.58/73.33	LOG: Narrow transition size 1
170.58/73.33	Narrowing transition: 
170.58/73.33	<l2, l2, main_y <= main_x /\ main_z <= 0 /\ 1 + main_x <= 0 /\ 1 + main_x + main_z <= 0, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}>
170.58/73.33	
170.58/73.33	LOG: Narrow transition size 1
170.58/73.33	Narrowing transition: 
170.58/73.33	<l2, l2, 1 + main_x <= 0 /\ 1 + main_x <= main_y /\ 1 + main_x + main_z <= 0, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}>
170.58/73.33	
170.58/73.33	LOG: Narrow transition size 1
170.58/73.33	invGraph after Narrowing: 
170.58/73.33	Transitions:
170.58/73.33	<l2, l2, 0 <= main_x + main_z /\ 2 + main_x <= main_y /\ 1 + 2*main_x + main_z <= 2*main_y /\ 1 + main_x <= 0, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}>
170.58/73.33	<l2, l2, main_y <= main_x /\ main_z <= 0 /\ 1 + 2*main_x + main_z <= 2*main_y /\ 1 + main_x <= 0 /\ 1 + main_x + main_z <= 0, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}>
170.58/73.33	<l2, l2, 1 + 2*main_x + main_z <= 2*main_y /\ 1 + main_x <= 0 /\ 1 + main_x <= main_y /\ 1 + main_x + main_z <= 0, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}>
170.58/73.33	Variables:
170.58/73.33	main_x, main_y, main_z
170.58/73.33	Checking conditional termination of SCC {l2}...
170.58/73.33	
170.58/73.33	LOG: CALL solveLinear
170.58/73.33	
170.58/73.33	LOG: RETURN solveLinear - Elapsed time: 0.003054s
170.58/73.33	Ranking function: -6 - 6*main_y
170.58/73.33	New Graphs: 
170.58/73.33	Transitions:
170.58/73.33	<l2, l2, 0 <= main_x + main_z /\ 2 + main_x <= main_y /\ 1 + 2*main_x + main_z <= 2*main_y /\ 1 + main_x <= 0, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}>
170.58/73.33	<l2, l2, 1 + 2*main_x + main_z <= 2*main_y /\ 1 + main_x <= 0 /\ 1 + main_x <= main_y /\ 1 + main_x + main_z <= 0, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}>
170.58/73.33	Variables:
170.58/73.33	main_x, main_y, main_z
170.58/73.33	Checking conditional termination of SCC {l2}...
170.58/73.33	
170.58/73.33	LOG: CALL solveLinear
170.58/73.33	
170.58/73.33	LOG: RETURN solveLinear - Elapsed time: 0.001501s
170.58/73.33	
170.58/73.33	LOG: CALL solveLinear
170.58/73.33	
170.58/73.33	LOG: RETURN solveLinear - Elapsed time: 0.029442s
170.58/73.33	Piecewise ranking function: min(0,-1 - main_x)
170.58/73.33	New Graphs: 
170.58/73.33	Transitions:
170.58/73.33	<l2, l2, 1 + 2*main_x + main_z <= 2*main_y /\ 1 + main_x <= 0 /\ 1 + main_x <= main_y /\ 1 + main_x + main_z <= 0, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}>
170.58/73.33	Variables:
170.58/73.33	main_x, main_y, main_z
170.58/73.33	Checking conditional termination of SCC {l2}...
170.58/73.33	
170.58/73.33	LOG: CALL solveLinear
170.58/73.33	
170.58/73.33	LOG: RETURN solveLinear - Elapsed time: 0.000847s
170.58/73.33	
170.58/73.33	LOG: CALL solveLinear
170.58/73.33	
170.58/73.33	LOG: RETURN solveLinear - Elapsed time: 0.003846s
170.58/73.33	[56610 : 56645]
170.58/73.33	[56610 : 56646]
170.58/73.33	Successful child: 56645
170.58/73.33	[ Invariant Graph ]
170.58/73.33	Strengthening and disabling transitions...
170.58/73.33	
170.58/73.33	LOG: CALL solverLinear in Graph for feasibility
170.58/73.33	
170.58/73.33	LOG: RETURN solveLinear in Graph for feasibility
170.58/73.33	It's unfeasible. Removing transition: 
170.58/73.33	<l2, l2, 0 <= main_x + main_z /\ 2 + main_x <= main_y /\ 1 + 2*main_x + main_z <= 2*main_y /\ 1 + main_x <= 0, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}>
170.58/73.33	
170.58/73.33	LOG: CALL solverLinear in Graph for feasibility
170.58/73.33	
170.58/73.33	LOG: RETURN solveLinear in Graph for feasibility
170.58/73.33	It's unfeasible. Removing transition: 
170.58/73.33	<l2, l2, main_y <= main_x /\ main_z <= 0 /\ 1 + 2*main_x + main_z <= 2*main_y /\ 1 + main_x <= 0 /\ 1 + main_x + main_z <= 0, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}>
170.58/73.33	
170.58/73.33	LOG: CALL solverLinear in Graph for feasibility
170.58/73.33	
170.58/73.33	LOG: RETURN solveLinear in Graph for feasibility
170.58/73.33	Strengthening transition (result): 
170.58/73.33	<l2, l2, 1 + 2*main_x + main_z <= 2*main_y /\ 1 + main_x <= 0 /\ 1 + main_x + main_z <= 0 /\ 1 <= main_z /\ 1 + main_x = main_y, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}>
170.58/73.33	[ Termination Graph ]
170.58/73.33	Strengthening and disabling transitions...
170.58/73.33	
170.58/73.33	LOG: CALL solverLinear in Graph for feasibility
170.58/73.33	
170.58/73.33	LOG: RETURN solveLinear in Graph for feasibility
170.58/73.33	Strengthening transition (result): 
170.58/73.33	<l2, l2, 1 + 2*main_x + main_z <= 2*main_y /\ 1 + main_x <= 0 /\ 1 + main_x + main_z <= 0 /\ 1 <= main_z /\ 1 + main_x = main_y, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}>
170.58/73.33	Ranking function: 2 - main_x
170.58/73.33	New Graphs: 
170.58/73.33	[56610 : 56650]
170.58/73.33	[56610 : 56651]
170.58/73.33	[56610 : 56652]
170.58/73.33	[56610 : 56653]
170.58/73.33	INVARIANTS: 
170.58/73.33	2: 
170.58/73.33	Quasi-INVARIANTS to narrow Graph: 
170.58/73.33	2: 1 <= main_z , main_y <= 1 + main_x , 
170.58/73.33	Narrowing transition: 
170.58/73.33	<l2, l2, 0 <= main_x + main_z /\ 2 + main_x <= main_y /\ 1 + 2*main_x + main_z <= 2*main_y /\ 1 + main_x <= 0, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}>
170.58/73.33	
170.58/73.33	LOG: Narrow transition size 2
170.58/73.33	Narrowing transition: 
170.58/73.33	<l2, l2, main_y <= main_x /\ main_z <= 0 /\ 1 + 2*main_x + main_z <= 2*main_y /\ 1 + main_x <= 0 /\ 1 + main_x + main_z <= 0, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}>
170.58/73.33	
170.58/73.33	LOG: Narrow transition size 2
170.58/73.33	Narrowing transition: 
170.58/73.33	<l2, l2, 1 + 2*main_x + main_z <= 2*main_y /\ 1 + main_x <= 0 /\ 1 + main_x <= main_y /\ 1 + main_x + main_z <= 0, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}>
170.58/73.33	
170.58/73.33	LOG: Narrow transition size 2
170.58/73.33	invGraph after Narrowing: 
170.58/73.33	Transitions:
170.58/73.33	<l2, l2, 0 <= main_x + main_z /\ 2 + main_x <= main_y /\ 1 + 2*main_x + main_z <= 2*main_y /\ 1 + main_x <= 0 /\ 1 <= main_z, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}>
170.58/73.33	<l2, l2, main_y <= main_x /\ main_z <= 0 /\ 1 + 2*main_x + main_z <= 2*main_y /\ 1 + main_x <= 0 /\ 1 + main_x + main_z <= 0, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}>
170.58/73.33	<l2, l2, 2 + main_x <= main_y /\ 1 + 2*main_x + main_z <= 2*main_y /\ 1 + main_x <= 0 /\ 1 + main_x + main_z <= 0 /\ 1 <= main_z, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}>
170.58/73.33	<l2, l2, main_z <= 0 /\ 1 + 2*main_x + main_z <= 2*main_y /\ 1 + main_x <= 0 /\ 1 + main_x <= main_y /\ 1 + main_x + main_z <= 0, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}>
170.58/73.33	Variables:
170.58/73.33	main_x, main_y, main_z
170.58/73.33	Checking conditional termination of SCC {l2}...
170.58/73.33	
170.58/73.33	LOG: CALL solveLinear
170.58/73.33	
170.58/73.33	LOG: RETURN solveLinear - Elapsed time: 0.003789s
170.58/73.33	Ranking function: 4 - 4*main_y
170.58/73.33	New Graphs: 
170.58/73.33	Transitions:
170.58/73.33	<l2, l2, 0 <= main_x + main_z /\ 2 + main_x <= main_y /\ 1 + 2*main_x + main_z <= 2*main_y /\ 1 + main_x <= 0 /\ 1 <= main_z, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}>
170.58/73.33	<l2, l2, 2 + main_x <= main_y /\ 1 + 2*main_x + main_z <= 2*main_y /\ 1 + main_x <= 0 /\ 1 + main_x + main_z <= 0 /\ 1 <= main_z, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}>
170.58/73.33	<l2, l2, main_z <= 0 /\ 1 + 2*main_x + main_z <= 2*main_y /\ 1 + main_x <= 0 /\ 1 + main_x <= main_y /\ 1 + main_x + main_z <= 0, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}>
170.58/73.33	Variables:
170.58/73.33	main_x, main_y, main_z
170.58/73.33	Checking conditional termination of SCC {l2}...
170.58/73.33	
170.58/73.33	LOG: CALL solveLinear
170.58/73.33	
170.58/73.33	LOG: RETURN solveLinear - Elapsed time: 0.002360s
170.58/73.33	
170.58/73.33	LOG: CALL solveLinear
170.58/73.33	
170.58/73.33	LOG: RETURN solveLinear - Elapsed time: 0.060977s
170.58/73.33	Piecewise ranking function: min(-main_x,1)
170.58/73.33	New Graphs: 
170.58/73.33	Transitions:
170.58/73.33	<l2, l2, 2 + main_x <= main_y /\ 1 + 2*main_x + main_z <= 2*main_y /\ 1 + main_x <= 0 /\ 1 + main_x + main_z <= 0 /\ 1 <= main_z, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}>
170.58/73.33	<l2, l2, main_z <= 0 /\ 1 + 2*main_x + main_z <= 2*main_y /\ 1 + main_x <= 0 /\ 1 + main_x <= main_y /\ 1 + main_x + main_z <= 0, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}>
170.58/73.33	Variables:
170.58/73.33	main_x, main_y, main_z
170.58/73.33	Checking conditional termination of SCC {l2}...
170.58/73.33	
170.58/73.33	LOG: CALL solveLinear
170.58/73.33	
170.58/73.33	LOG: RETURN solveLinear - Elapsed time: 0.001619s
170.58/73.33	
170.58/73.33	LOG: CALL solveLinear
170.58/73.33	
170.58/73.33	LOG: RETURN solveLinear - Elapsed time: 0.016111s
170.58/73.33	[56610 : 56654]
170.58/73.33	[56610 : 56655]
170.58/73.33	Successful child: 56654
170.58/73.33	[ Invariant Graph ]
170.58/73.33	Strengthening and disabling transitions...
170.58/73.33	
170.58/73.33	LOG: CALL solverLinear in Graph for feasibility
170.58/73.33	
170.58/73.33	LOG: RETURN solveLinear in Graph for feasibility
170.58/73.33	Strengthening transition (result): 
170.58/73.33	<l2, l2, 0 <= main_x + main_z /\ 2 + main_x <= main_y /\ 1 + 2*main_x + main_z <= 2*main_y /\ 1 + main_x <= 0 /\ 1 <= 2*main_y + main_z /\ 1 <= main_z, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}>
170.58/73.33	
170.58/73.33	LOG: CALL solverLinear in Graph for feasibility
170.58/73.33	
170.58/73.33	LOG: RETURN solveLinear in Graph for feasibility
170.58/73.33	It's unfeasible. Removing transition: 
170.58/73.33	<l2, l2, main_y <= main_x /\ main_z <= 0 /\ 1 + 2*main_x + main_z <= 2*main_y /\ 1 + main_x <= 0 /\ 1 + main_x + main_z <= 0, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}>
170.58/73.33	
170.58/73.33	LOG: CALL solverLinear in Graph for feasibility
170.58/73.33	
170.58/73.33	LOG: RETURN solveLinear in Graph for feasibility
170.58/73.33	Strengthening transition (result): 
170.58/73.33	<l2, l2, 2 + main_x <= main_y /\ 1 + 2*main_x + main_z <= 2*main_y /\ 1 + main_x <= 0 /\ 1 + main_x + main_z <= 0 /\ 1 <= 2*main_y + main_z /\ 1 <= main_z, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}>
170.58/73.33	
170.58/73.33	LOG: CALL solverLinear in Graph for feasibility
170.58/73.33	
170.58/73.33	LOG: RETURN solveLinear in Graph for feasibility
170.58/73.33	Strengthening transition (result): 
170.58/73.33	<l2, l2, main_z <= 0 /\ 1 + 2*main_x + main_z <= 2*main_y /\ 1 + main_x <= 0 /\ 1 + main_x <= main_y /\ 1 + main_x + main_z <= 0 /\ 1 <= 2*main_y + main_z, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}>
170.58/73.33	[ Termination Graph ]
170.58/73.33	Strengthening and disabling transitions...
170.58/73.33	
170.58/73.33	LOG: CALL solverLinear in Graph for feasibility
170.58/73.33	
170.58/73.33	LOG: RETURN solveLinear in Graph for feasibility
170.58/73.33	Strengthening transition (result): 
170.58/73.33	<l2, l2, 2 + main_x <= main_y /\ 1 + 2*main_x + main_z <= 2*main_y /\ 1 + main_x <= 0 /\ 1 + main_x + main_z <= 0 /\ 1 <= 2*main_y + main_z /\ 1 <= main_z, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}>
170.58/73.33	
170.58/73.33	LOG: CALL solverLinear in Graph for feasibility
170.58/73.33	
170.58/73.33	LOG: RETURN solveLinear in Graph for feasibility
170.58/73.33	Strengthening transition (result): 
170.58/73.33	<l2, l2, main_z <= 0 /\ 1 + 2*main_x + main_z <= 2*main_y /\ 1 + main_x <= 0 /\ 1 + main_x <= main_y /\ 1 + main_x + main_z <= 0 /\ 1 <= 2*main_y + main_z, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}>
170.58/73.33	Ranking function: main_z
170.58/73.33	New Graphs: 
170.58/73.33	Transitions:
170.58/73.33	<l2, l2, main_z <= 0 /\ 1 + 2*main_x + main_z <= 2*main_y /\ 1 + main_x <= 0 /\ 1 + main_x <= main_y /\ 1 + main_x + main_z <= 0 /\ 1 <= 2*main_y + main_z, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}>
170.58/73.33	Variables:
170.58/73.33	main_x, main_y, main_z
170.58/73.33	Checking conditional termination of SCC {l2}...
170.58/73.33	
170.58/73.33	LOG: CALL solveLinear
170.58/73.33	
170.58/73.33	LOG: RETURN solveLinear - Elapsed time: 0.001017s
170.58/73.33	
170.58/73.33	LOG: CALL solveLinear
170.58/73.33	
170.58/73.33	LOG: RETURN solveLinear - Elapsed time: 0.005379s
170.58/73.33	[56610 : 56659]
170.58/73.33	[56610 : 56660]
170.58/73.33	Successful child: 56659
170.58/73.33	[ Invariant Graph ]
170.58/73.33	Strengthening and disabling transitions...
170.58/73.33	
170.58/73.33	LOG: CALL solverLinear in Graph for feasibility
170.58/73.33	
170.58/73.33	LOG: RETURN solveLinear in Graph for feasibility
170.58/73.33	Strengthening transition (result): 
170.58/73.33	<l2, l2, 0 <= main_x + main_z /\ 2 + main_x <= main_y /\ 1 + 2*main_x + main_z <= 2*main_y /\ 1 + main_x <= 0 /\ 1 <= 2*main_y + main_z /\ 1 <= main_z /\ 2*main_y <= 1 + main_x, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}>
170.58/73.33	
170.58/73.33	LOG: CALL solverLinear in Graph for feasibility
170.58/73.33	
170.58/73.33	LOG: RETURN solveLinear in Graph for feasibility
170.58/73.33	It's unfeasible. Removing transition: 
170.58/73.33	<l2, l2, 2 + main_x <= main_y /\ 1 + 2*main_x + main_z <= 2*main_y /\ 1 + main_x <= 0 /\ 1 + main_x + main_z <= 0 /\ 1 <= 2*main_y + main_z /\ 1 <= main_z, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}>
170.58/73.33	
170.58/73.33	LOG: CALL solverLinear in Graph for feasibility
170.58/73.33	
170.58/73.33	LOG: RETURN solveLinear in Graph for feasibility
170.58/73.33	It's unfeasible. Removing transition: 
170.58/73.33	<l2, l2, main_z <= 0 /\ 1 + 2*main_x + main_z <= 2*main_y /\ 1 + main_x <= 0 /\ 1 + main_x <= main_y /\ 1 + main_x + main_z <= 0 /\ 1 <= 2*main_y + main_z, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}>
170.58/73.33	[ Termination Graph ]
170.58/73.33	Strengthening and disabling transitions...
170.58/73.33	> It's unfeasible. Removing transition: 
170.58/73.33	<l2, l2, main_z <= 0 /\ 1 + 2*main_x + main_z <= 2*main_y /\ 1 + main_x <= 0 /\ 1 + main_x <= main_y /\ 1 + main_x + main_z <= 0 /\ 1 <= 2*main_y + main_z, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}>
170.58/73.33	New Graphs: 
170.58/73.33	[56610 : 56664]
170.58/73.33	[56610 : 56665]
170.58/73.33	[56610 : 56666]
170.58/73.33	INVARIANTS: 
170.58/73.33	2: 
170.58/73.33	Quasi-INVARIANTS to narrow Graph: 
170.58/73.33	2: 1 <= 2*main_y + main_z , 
170.58/73.33	[56610 : 56667]
170.58/73.33	[56610 : 56668]
170.58/73.33	[56610 : 56669]
170.58/73.33	INVARIANTS: 
170.58/73.33	2: 
170.58/73.33	Quasi-INVARIANTS to narrow Graph: 
170.58/73.33	2: 2*main_y <= 1 + main_x , 
170.58/73.33	Narrowing transition: 
170.58/73.33	<l2, l2, 0 <= main_x + main_z /\ 2 + main_x <= main_y /\ 1 + 2*main_x + main_z <= 2*main_y /\ 1 + main_x <= 0 /\ 1 <= main_z, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}>
170.58/73.33	
170.58/73.33	LOG: Narrow transition size 2
170.58/73.33	Narrowing transition: 
170.58/73.33	<l2, l2, main_y <= main_x /\ main_z <= 0 /\ 1 + 2*main_x + main_z <= 2*main_y /\ 1 + main_x <= 0 /\ 1 + main_x + main_z <= 0, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}>
170.58/73.33	
170.58/73.33	LOG: Narrow transition size 2
170.58/73.33	Narrowing transition: 
170.58/73.33	<l2, l2, 2 + main_x <= main_y /\ 1 + 2*main_x + main_z <= 2*main_y /\ 1 + main_x <= 0 /\ 1 + main_x + main_z <= 0 /\ 1 <= main_z, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}>
170.58/73.33	
170.58/73.33	LOG: Narrow transition size 2
170.58/73.33	Narrowing transition: 
170.58/73.33	<l2, l2, main_z <= 0 /\ 1 + 2*main_x + main_z <= 2*main_y /\ 1 + main_x <= 0 /\ 1 + main_x <= main_y /\ 1 + main_x + main_z <= 0, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}>
170.58/73.33	
170.58/73.33	LOG: Narrow transition size 2
170.58/73.33	invGraph after Narrowing: 
170.58/73.33	Transitions:
170.58/73.33	<l2, l2, 0 <= main_x + main_z /\ 2 + main_x <= 2*main_y /\ 2 + main_x <= main_y /\ 1 + 2*main_x + main_z <= 2*main_y /\ 1 + main_x <= 0 /\ 1 <= 2*main_y + main_z /\ 1 <= main_z, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}>
170.58/73.33	<l2, l2, main_y <= main_x /\ 2*main_y + main_z <= 0 /\ main_z <= 0 /\ 1 + 2*main_x + main_z <= 2*main_y /\ 1 + main_x <= 0 /\ 1 + main_x + main_z <= 0, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}>
170.58/73.33	<l2, l2, 2 + main_x <= 2*main_y /\ 2 + main_x <= main_y /\ 1 + 2*main_x + main_z <= 2*main_y /\ 1 + main_x <= 0 /\ 1 + main_x + main_z <= 0 /\ 1 <= 2*main_y + main_z /\ 1 <= main_z, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}>
170.58/73.33	<l2, l2, 2*main_y + main_z <= 0 /\ 2 + main_x <= main_y /\ 1 + 2*main_x + main_z <= 2*main_y /\ 1 + main_x <= 0 /\ 1 + main_x + main_z <= 0 /\ 1 <= main_z, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}>
170.58/73.33	<l2, l2, main_z <= 0 /\ 2 + main_x <= 2*main_y /\ 1 + 2*main_x + main_z <= 2*main_y /\ 1 + main_x <= 0 /\ 1 + main_x <= main_y /\ 1 + main_x + main_z <= 0 /\ 1 <= 2*main_y + main_z, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}>
170.58/73.33	<l2, l2, 2*main_y + main_z <= 0 /\ main_z <= 0 /\ 1 + 2*main_x + main_z <= 2*main_y /\ 1 + main_x <= 0 /\ 1 + main_x <= main_y /\ 1 + main_x + main_z <= 0, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}>
170.58/73.33	Variables:
170.58/73.33	main_x, main_y, main_z
170.58/73.33	Checking conditional termination of SCC {l2}...
170.58/73.33	
170.58/73.33	LOG: CALL solveLinear
170.58/73.33	
170.58/73.33	LOG: RETURN solveLinear - Elapsed time: 0.007159s
170.58/73.33	Ranking function: 4 - 8*main_y
170.58/73.33	New Graphs: 
170.58/73.33	Transitions:
170.58/73.33	<l2, l2, 0 <= main_x + main_z /\ 2 + main_x <= 2*main_y /\ 2 + main_x <= main_y /\ 1 + 2*main_x + main_z <= 2*main_y /\ 1 + main_x <= 0 /\ 1 <= 2*main_y + main_z /\ 1 <= main_z, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}>
170.58/73.33	<l2, l2, 2 + main_x <= 2*main_y /\ 2 + main_x <= main_y /\ 1 + 2*main_x + main_z <= 2*main_y /\ 1 + main_x <= 0 /\ 1 + main_x + main_z <= 0 /\ 1 <= 2*main_y + main_z /\ 1 <= main_z, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}>
170.58/73.33	<l2, l2, main_z <= 0 /\ 2 + main_x <= 2*main_y /\ 1 + 2*main_x + main_z <= 2*main_y /\ 1 + main_x <= 0 /\ 1 + main_x <= main_y /\ 1 + main_x + main_z <= 0 /\ 1 <= 2*main_y + main_z, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}>
170.58/73.33	<l2, l2, 2*main_y + main_z <= 0 /\ main_z <= 0 /\ 1 + 2*main_x + main_z <= 2*main_y /\ 1 + main_x <= 0 /\ 1 + main_x <= main_y /\ 1 + main_x + main_z <= 0, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}>
170.58/73.33	Variables:
170.58/73.33	main_x, main_y, main_z
170.58/73.33	Checking conditional termination of SCC {l2}...
170.58/73.33	
170.58/73.33	LOG: CALL solveLinear
170.58/73.33	
170.58/73.33	LOG: RETURN solveLinear - Elapsed time: 0.004194s
170.58/73.33	
170.58/73.33	LOG: CALL solveLinear
170.58/73.33	
170.58/73.33	LOG: RETURN solveLinear - Elapsed time: 0.364090s
170.58/73.33	Piecewise ranking function: min(0,-1 - main_x)
170.58/73.33	New Graphs: 
170.58/73.33	Transitions:
170.58/73.33	<l2, l2, 2 + main_x <= 2*main_y /\ 2 + main_x <= main_y /\ 1 + 2*main_x + main_z <= 2*main_y /\ 1 + main_x <= 0 /\ 1 + main_x + main_z <= 0 /\ 1 <= 2*main_y + main_z /\ 1 <= main_z, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}>
170.58/73.33	<l2, l2, main_z <= 0 /\ 2 + main_x <= 2*main_y /\ 1 + 2*main_x + main_z <= 2*main_y /\ 1 + main_x <= 0 /\ 1 + main_x <= main_y /\ 1 + main_x + main_z <= 0 /\ 1 <= 2*main_y + main_z, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}>
170.58/73.33	<l2, l2, 2*main_y + main_z <= 0 /\ main_z <= 0 /\ 1 + 2*main_x + main_z <= 2*main_y /\ 1 + main_x <= 0 /\ 1 + main_x <= main_y /\ 1 + main_x + main_z <= 0, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}>
170.58/73.33	Variables:
170.58/73.33	main_x, main_y, main_z
170.58/73.33	Checking conditional termination of SCC {l2}...
170.58/73.33	
170.58/73.33	LOG: CALL solveLinear
170.58/73.33	
170.58/73.33	LOG: RETURN solveLinear - Elapsed time: 0.003122s
170.58/73.33	
170.58/73.33	LOG: CALL solveLinear
170.58/73.33	
170.58/73.33	LOG: RETURN solveLinear - Elapsed time: 0.091590s
170.58/73.33	[56610 : 56670]
170.58/73.33	[56610 : 56671]
170.58/73.33	Successful child: 56671
170.58/73.33	Ranking function: -2*main_y - main_z
170.58/73.33	Ranking function and negation of Quasi-Invariant applied
170.58/73.33	New Graphs: 
170.58/73.33	Transitions:
170.58/73.33	<l2, l2, 2 + main_x <= 2*main_y /\ 2 + main_x <= main_y /\ 1 + 2*main_x + main_z <= 2*main_y /\ 1 + main_x <= 0 /\ 1 + main_x + main_z <= 0 /\ 1 <= 2*main_y + main_z /\ 1 <= main_z, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}>
170.58/73.33	<l2, l2, main_z <= 0 /\ 2 + main_x <= 2*main_y /\ 1 + 2*main_x + main_z <= 2*main_y /\ 1 + main_x <= 0 /\ 1 + main_x <= main_y /\ 1 + main_x + main_z <= 0 /\ 1 <= 2*main_y + main_z, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}>
170.58/73.33	Variables:
170.58/73.33	main_x, main_y, main_z
170.58/73.33	Checking conditional termination of SCC {l2}...
170.58/73.33	
170.58/73.33	LOG: CALL solveLinear
170.58/73.33	
170.58/73.33	LOG: RETURN solveLinear - Elapsed time: 0.003760s
170.58/73.33	Ranking function: -1 + main_z
170.58/73.33	New Graphs: 
170.58/73.33	Transitions:
170.58/73.33	<l2, l2, main_z <= 0 /\ 2 + main_x <= 2*main_y /\ 1 + 2*main_x + main_z <= 2*main_y /\ 1 + main_x <= 0 /\ 1 + main_x <= main_y /\ 1 + main_x + main_z <= 0 /\ 1 <= 2*main_y + main_z, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}>
170.58/73.33	Variables:
170.58/73.33	main_x, main_y, main_z
170.58/73.33	Checking conditional termination of SCC {l2}...
170.58/73.33	
170.58/73.33	LOG: CALL solveLinear
170.58/73.33	
170.58/73.33	LOG: RETURN solveLinear - Elapsed time: 0.001112s
170.58/73.33	
170.58/73.33	LOG: CALL solveLinear
170.58/73.33	
170.58/73.33	LOG: RETURN solveLinear - Elapsed time: 0.005002s
170.58/73.33	[56610 : 56675]
170.58/73.33	[56610 : 56676]
170.58/73.33	Solving with 1 template(s).
170.58/73.33	
170.58/73.33	LOG: CALL solveNonLinearGetFirstSolution
170.58/73.33	
170.58/73.33	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.049963s
170.58/73.33	Time used: 0.048997
170.58/73.33	Improving Solution with cost 1 ...
170.58/73.33	
170.58/73.33	LOG: CALL solveNonLinearGetNextSolution
170.58/73.33	
170.58/73.33	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.085377s
170.58/73.33	Time used: 0.085373
170.58/73.33	
170.58/73.33	LOG: SAT solveNonLinear - Elapsed time: 0.135339s
170.58/73.33	Cost: 1; Total time: 0.13437
170.58/73.33	Quasi-ranking function: 50000 + main_z
170.58/73.33	New Graphs: 
170.58/73.33	Transitions:
170.58/73.33	<l2, l2, 2 + main_x <= 2*main_y /\ 1 + 2*main_x + main_z <= 2*main_y /\ 1 + main_x <= 0 /\ 1 + main_x <= main_y /\ 1 + main_x + main_z <= 0 /\ 1 <= 2*main_y + main_z /\ 50001 + main_z <= 0, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}>
170.58/73.33	Variables:
170.58/73.33	main_x, main_y, main_z
170.58/73.33	Checking conditional termination of SCC {l2}...
170.58/73.33	
170.58/73.33	LOG: CALL solveLinear
170.58/73.33	
170.58/73.33	LOG: RETURN solveLinear - Elapsed time: 0.001253s
170.58/73.33	
170.58/73.33	LOG: CALL solveLinear
170.58/73.33	
170.58/73.33	LOG: RETURN solveLinear - Elapsed time: 0.013502s
170.58/73.33	[56610 : 56680]
170.58/73.33	[56610 : 56681]
170.58/73.33	Solving with 1 template(s).
170.58/73.33	
170.58/73.33	LOG: CALL solveNonLinearGetFirstSolution
170.58/73.33	
170.58/73.33	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.055514s
170.58/73.33	Time used: 0.054227
170.58/73.33	Improving Solution with cost 1 ...
170.58/73.33	
170.58/73.33	LOG: CALL solveNonLinearGetNextSolution
170.58/73.33	
170.58/73.33	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.071224s
170.58/73.33	Time used: 0.07122
170.58/73.33	
170.58/73.33	LOG: SAT solveNonLinear - Elapsed time: 0.126739s
170.58/73.33	Cost: 1; Total time: 0.125447
170.58/73.33	Quasi-ranking function: 50000 + main_x + main_y + main_z
170.58/73.33	New Graphs: 
170.58/73.33	Transitions:
170.58/73.33	<l2, l2, 2 + main_x <= 2*main_y /\ 1 + 2*main_x + main_z <= 2*main_y /\ 1 + main_x <= 0 /\ 1 + main_x <= main_y /\ 1 + main_x + main_z <= 0 /\ 1 <= 2*main_y + main_z /\ 50001 + main_x + main_y + main_z <= 0 /\ 50001 + main_z <= 0, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}>
170.58/73.33	Variables:
170.58/73.33	main_x, main_y, main_z
170.58/73.33	Checking conditional termination of SCC {l2}...
170.58/73.33	
170.58/73.33	LOG: CALL solveLinear
170.58/73.33	
170.58/73.33	LOG: RETURN solveLinear - Elapsed time: 0.001333s
170.58/73.33	
170.58/73.33	LOG: CALL solveLinear
170.58/73.33	
170.58/73.33	LOG: RETURN solveLinear - Elapsed time: 0.059858s
170.58/73.33	[56610 : 56685]
170.58/73.33	[56610 : 56686]
170.58/73.33	Solving with 1 template(s).
170.58/73.33	
170.58/73.33	LOG: CALL solveNonLinearGetFirstSolution
170.58/73.33	
170.58/73.33	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.054963s
170.58/73.33	Time used: 0.053657
170.58/73.33	Improving Solution with cost 1 ...
170.58/73.33	
170.58/73.33	LOG: CALL solveNonLinearGetNextSolution
170.58/73.33	
170.58/73.33	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.087792s
170.58/73.33	Time used: 0.087788
170.58/73.33	
170.58/73.33	LOG: SAT solveNonLinear - Elapsed time: 0.142755s
170.58/73.33	Cost: 1; Total time: 0.141445
170.58/73.33	Quasi-ranking function: 50000 + main_y + 2*main_z
170.58/73.33	New Graphs: 
170.58/73.33	Transitions:
170.58/73.33	<l2, l2, 2 + main_x <= 2*main_y /\ 1 + 2*main_x + main_z <= 2*main_y /\ 1 + main_x <= 0 /\ 1 + main_x <= main_y /\ 1 + main_x + main_z <= 0 /\ 1 <= 2*main_y + main_z /\ 50001 + main_x + main_y + main_z <= 0 /\ 50001 + main_y + 2*main_z <= 0 /\ 50001 + main_z <= 0, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}>
170.58/73.33	Variables:
170.58/73.33	main_x, main_y, main_z
170.58/73.33	Checking conditional termination of SCC {l2}...
170.58/73.33	
170.58/73.33	LOG: CALL solveLinear
170.58/73.33	
170.58/73.33	LOG: RETURN solveLinear - Elapsed time: 0.001485s
170.58/73.33	
170.58/73.33	LOG: CALL solveLinear
170.58/73.33	
170.58/73.33	LOG: RETURN solveLinear - Elapsed time: 0.094804s
170.58/73.33	[56610 : 56690]
170.58/73.33	[56610 : 56691]
170.58/73.33	Solving with 1 template(s).
170.58/73.33	
170.58/73.33	LOG: CALL solveNonLinearGetFirstSolution
170.58/73.33	
170.58/73.33	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.047591s
170.58/73.33	Time used: 0.046221
170.58/73.33	Improving Solution with cost 1 ...
170.58/73.33	
170.58/73.33	LOG: CALL solveNonLinearGetNextSolution
170.58/73.33	
170.58/73.33	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.067443s
170.58/73.33	Time used: 0.067438
170.58/73.33	
170.58/73.33	LOG: SAT solveNonLinear - Elapsed time: 0.115034s
170.58/73.33	Cost: 1; Total time: 0.113659
170.58/73.33	Quasi-ranking function: 50000 + main_x - main_y + main_z
170.58/73.33	New Graphs: 
170.58/73.33	Transitions:
170.58/73.33	<l2, l2, 2 + main_x <= 2*main_y /\ 1 + 2*main_x + main_z <= 2*main_y /\ 1 + main_x <= 0 /\ 1 + main_x <= main_y /\ 1 + main_x + main_z <= 0 /\ 1 <= 2*main_y + main_z /\ 50001 + main_x + main_y + main_z <= 0 /\ 50001 + main_x + main_z <= main_y /\ 50001 + main_y + 2*main_z <= 0 /\ 50001 + main_z <= 0, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}>
170.58/73.33	Variables:
170.58/73.33	main_x, main_y, main_z
170.58/73.33	Checking conditional termination of SCC {l2}...
170.58/73.33	
170.58/73.33	LOG: CALL solveLinear
170.58/73.33	
170.58/73.33	LOG: RETURN solveLinear - Elapsed time: 0.001520s
170.58/73.33	
170.58/73.33	LOG: CALL solveLinear
170.58/73.33	
170.58/73.33	LOG: RETURN solveLinear - Elapsed time: 0.116024s
170.58/73.33	[56610 : 56848]
170.58/73.33	[56610 : 56849]
170.58/73.33	Solving with 1 template(s).
170.58/73.33	
170.58/73.33	LOG: CALL solveNonLinearGetFirstSolution
170.58/73.33	
170.58/73.33	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.055468s
170.58/73.33	Time used: 0.054109
170.58/73.33	Improving Solution with cost 1 ...
170.58/73.33	
170.58/73.33	LOG: CALL solveNonLinearGetNextSolution
170.58/73.33	
170.58/73.33	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.072453s
170.58/73.33	Time used: 0.072448
170.58/73.33	
170.58/73.33	LOG: SAT solveNonLinear - Elapsed time: 0.127921s
170.58/73.33	Cost: 1; Total time: 0.126557
170.58/73.33	Quasi-ranking function: 50000 - main_y
170.58/73.33	New Graphs: 
170.58/73.33	Transitions:
170.58/73.33	<l2, l2, 2 + main_x <= 2*main_y /\ 1 + 2*main_x + main_z <= 2*main_y /\ 1 + main_x <= 0 /\ 1 + main_x <= main_y /\ 1 + main_x + main_z <= 0 /\ 1 <= 2*main_y + main_z /\ 50001 + main_x + main_y + main_z <= 0 /\ 50001 + main_x + main_z <= main_y /\ 50001 + main_y + 2*main_z <= 0 /\ 50001 <= main_y /\ 50001 + main_z <= 0, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}>
170.58/73.33	Variables:
170.58/73.33	main_x, main_y, main_z
170.58/73.33	Checking conditional termination of SCC {l2}...
170.58/73.33	
170.58/73.33	LOG: CALL solveLinear
170.58/73.33	
170.58/73.33	LOG: RETURN solveLinear - Elapsed time: 0.001545s
170.58/73.33	
170.58/73.33	LOG: CALL solveLinear
170.58/73.33	
170.58/73.33	LOG: RETURN solveLinear - Elapsed time: 0.137789s
170.58/73.33	[56610 : 56853]
170.58/73.33	[56610 : 56854]
170.58/73.33	Solving with 1 template(s).
170.58/73.33	
170.58/73.33	LOG: CALL solveNonLinearGetFirstSolution
170.58/73.33	
170.58/73.33	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.049752s
170.58/73.33	Time used: 0.048001
170.58/73.33	Improving Solution with cost 1 ...
170.58/73.33	
170.58/73.33	LOG: CALL solveNonLinearGetNextSolution
170.58/73.33	
170.58/73.33	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.079077s
170.58/73.33	Time used: 0.079073
170.58/73.33	
170.58/73.33	LOG: SAT solveNonLinear - Elapsed time: 0.128829s
170.58/73.33	Cost: 1; Total time: 0.127074
170.58/73.33	Quasi-ranking function: 50000 - main_y + main_z
170.58/73.33	New Graphs: 
170.58/73.33	Transitions:
170.58/73.33	<l2, l2, 2 + main_x <= 2*main_y /\ 1 + 2*main_x + main_z <= 2*main_y /\ 1 + main_x <= 0 /\ 1 + main_x <= main_y /\ 1 + main_x + main_z <= 0 /\ 1 <= 2*main_y + main_z /\ 50001 + main_x + main_y + main_z <= 0 /\ 50001 + main_x + main_z <= main_y /\ 50001 + main_y + 2*main_z <= 0 /\ 50001 <= main_y /\ 50001 + main_z <= main_y /\ 50001 + main_z <= 0, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}>
170.58/73.33	Variables:
170.58/73.33	main_x, main_y, main_z
170.58/73.33	Checking conditional termination of SCC {l2}...
170.58/73.33	
170.58/73.33	LOG: CALL solveLinear
170.58/73.33	
170.58/73.33	LOG: RETURN solveLinear - Elapsed time: 0.001668s
170.58/73.33	
170.58/73.33	LOG: CALL solveLinear
170.58/73.33	
170.58/73.33	LOG: RETURN solveLinear - Elapsed time: 0.125204s
170.58/73.33	[56610 : 56858]
170.58/73.33	[56610 : 56859]
170.58/73.33	Solving with 1 template(s).
170.58/73.33	
170.58/73.33	LOG: CALL solveNonLinearGetFirstSolution
170.58/73.33	
170.58/73.33	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.054370s
170.58/73.33	Time used: 0.052817
170.58/73.33	Improving Solution with cost 1 ...
170.58/73.33	
170.58/73.33	LOG: CALL solveNonLinearGetNextSolution
170.58/73.33	
170.58/73.33	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.070906s
170.58/73.33	Time used: 0.070901
170.58/73.33	
170.58/73.33	LOG: SAT solveNonLinear - Elapsed time: 0.125276s
170.58/73.33	Cost: 1; Total time: 0.123718
170.58/73.33	Quasi-ranking function: 50000 + main_x - main_y
170.58/73.33	New Graphs: 
170.58/73.33	Transitions:
170.58/73.33	<l2, l2, 2 + main_x <= 2*main_y /\ 1 + 2*main_x + main_z <= 2*main_y /\ 1 + main_x <= 0 /\ 1 + main_x + main_z <= 0 /\ 1 <= 2*main_y + main_z /\ 50001 + main_x + main_y + main_z <= 0 /\ 50001 + main_x <= main_y /\ 50001 + main_x + main_z <= main_y /\ 50001 + main_y + 2*main_z <= 0 /\ 50001 <= main_y /\ 50001 + main_z <= main_y /\ 50001 + main_z <= 0, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}>
170.58/73.33	Variables:
170.58/73.33	main_x, main_y, main_z
170.58/73.33	Checking conditional termination of SCC {l2}...
170.58/73.33	
170.58/73.33	LOG: CALL solveLinear
170.58/73.33	
170.58/73.33	LOG: RETURN solveLinear - Elapsed time: 0.001685s
170.58/73.33	
170.58/73.33	LOG: CALL solveLinear
170.58/73.33	
170.58/73.33	LOG: RETURN solveLinear - Elapsed time: 0.043771s
170.58/73.33	[56610 : 56863]
170.58/73.33	[56610 : 56864]
170.58/73.33	Solving with 1 template(s).
170.58/73.33	
170.58/73.33	LOG: CALL solveNonLinearGetFirstSolution
170.58/73.33	
170.58/73.33	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.048536s
170.58/73.33	Time used: 0.047007
170.58/73.33	Improving Solution with cost 1 ...
170.58/73.33	
170.58/73.33	LOG: CALL solveNonLinearGetNextSolution
170.58/73.33	
170.58/73.33	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.074376s
170.58/73.33	Time used: 0.074372
170.58/73.33	
170.58/73.33	LOG: SAT solveNonLinear - Elapsed time: 0.122912s
170.58/73.33	Cost: 1; Total time: 0.121379
170.58/73.33	Quasi-ranking function: 50000 + 4*main_x + 100002*main_y - main_z
170.58/73.33	New Graphs: 
170.58/73.33	Transitions:
170.58/73.33	<l2, l2, 2 + main_x <= 2*main_y /\ 1 + 2*main_x + main_z <= 2*main_y /\ 1 + main_x <= 0 /\ 1 + main_x + main_z <= 0 /\ 1 <= 2*main_y + main_z /\ 50001 + main_x + main_y + main_z <= 0 /\ 50001 + main_x <= main_y /\ 50001 + main_x + main_z <= main_y /\ 50001 + 4*main_x + 100002*main_y <= main_z /\ 50001 + main_y + 2*main_z <= 0 /\ 50001 <= main_y /\ 50001 + main_z <= main_y /\ 50001 + main_z <= 0, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}>
170.58/73.33	Variables:
170.58/73.33	main_x, main_y, main_z
170.58/73.33	Checking conditional termination of SCC {l2}...
170.58/73.33	
170.58/73.33	LOG: CALL solveLinear
170.58/73.33	
170.58/73.33	LOG: RETURN solveLinear - Elapsed time: 0.001784s
170.58/73.33	
170.58/73.33	LOG: CALL solveLinear
170.58/73.33	
170.58/73.33	LOG: RETURN solveLinear - Elapsed time: 0.171430s
170.58/73.33	[56610 : 56868]
170.58/73.33	[56610 : 56869]
170.58/73.33	Solving with 1 template(s).
170.58/73.33	
170.58/73.33	LOG: CALL solveNonLinearGetFirstSolution
170.58/73.33	
170.58/73.33	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.058455s
170.58/73.33	Time used: 0.056229
170.58/73.33	Improving Solution with cost 1 ...
170.58/73.33	
170.58/73.33	LOG: CALL solveNonLinearGetNextSolution
170.58/73.33	
170.58/73.33	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.080534s
170.58/73.33	Time used: 0.080529
170.58/73.33	
170.58/73.33	LOG: SAT solveNonLinear - Elapsed time: 0.138989s
170.58/73.33	Cost: 1; Total time: 0.136758
170.58/73.33	Quasi-ranking function: 50000 + 3*main_x - main_y - main_z
170.58/73.33	New Graphs: 
170.58/73.33	Transitions:
170.58/73.33	<l2, l2, 2 + main_x <= 2*main_y /\ 1 + 2*main_x + main_z <= 2*main_y /\ 1 + main_x <= 0 /\ 1 + main_x + main_z <= 0 /\ 1 <= 2*main_y + main_z /\ 50001 + main_x + main_y + main_z <= 0 /\ 50001 + main_x <= main_y /\ 50001 + main_x + main_z <= main_y /\ 50001 + 4*main_x + 100002*main_y <= main_z /\ 50001 + 3*main_x <= main_y + main_z /\ 50001 + main_y + 2*main_z <= 0 /\ 50001 <= main_y /\ 50001 + main_z <= main_y /\ 50001 + main_z <= 0, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}>
170.58/73.33	Variables:
170.58/73.33	main_x, main_y, main_z
170.58/73.33	Checking conditional termination of SCC {l2}...
170.58/73.33	
170.58/73.33	LOG: CALL solveLinear
170.58/73.33	
170.58/73.33	LOG: RETURN solveLinear - Elapsed time: 0.001911s
170.58/73.33	
170.58/73.33	LOG: CALL solveLinear
170.58/73.33	
170.58/73.33	LOG: RETURN solveLinear - Elapsed time: 0.184144s
170.58/73.33	[56610 : 56873]
170.58/73.33	[56610 : 56874]
170.58/73.33	Solving with 1 template(s).
170.58/73.33	
170.58/73.33	LOG: CALL solveNonLinearGetFirstSolution
170.58/73.33	
170.58/73.33	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.057313s
170.58/73.33	Time used: 0.055521
170.58/73.33	Improving Solution with cost 1 ...
170.58/73.33	
170.58/73.33	LOG: CALL solveNonLinearGetNextSolution
170.58/73.33	
170.58/73.33	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.072300s
170.58/73.33	Time used: 0.072281
170.58/73.33	
170.58/73.33	LOG: SAT solveNonLinear - Elapsed time: 0.129613s
170.58/73.33	Cost: 1; Total time: 0.127802
170.58/73.33	Quasi-ranking function: 50000 + main_x + main_z
170.58/73.33	New Graphs: 
170.58/73.33	Transitions:
170.58/73.33	<l2, l2, 2 + main_x <= 2*main_y /\ 1 + 2*main_x + main_z <= 2*main_y /\ 1 + main_x <= 0 /\ 1 <= 2*main_y + main_z /\ 50001 + main_x + main_y + main_z <= 0 /\ 50001 + main_x <= main_y /\ 50001 + main_x + main_z <= main_y /\ 50001 + main_x + main_z <= 0 /\ 50001 + 4*main_x + 100002*main_y <= main_z /\ 50001 + 3*main_x <= main_y + main_z /\ 50001 + main_y + 2*main_z <= 0 /\ 50001 <= main_y /\ 50001 + main_z <= main_y /\ 50001 + main_z <= 0, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}>
170.58/73.34	Variables:
170.58/73.34	main_x, main_y, main_z
170.58/73.34	Checking conditional termination of SCC {l2}...
170.58/73.34	
170.58/73.34	LOG: CALL solveLinear
170.58/73.34	
170.58/73.34	LOG: RETURN solveLinear - Elapsed time: 0.001965s
170.58/73.34	
170.58/73.34	LOG: CALL solveLinear
170.58/73.34	
170.58/73.34	LOG: RETURN solveLinear - Elapsed time: 0.213502s
170.58/73.34	[56610 : 56878]
170.58/73.34	[56610 : 56879]
170.58/73.34	Solving with 1 template(s).
170.58/73.34	
170.58/73.34	LOG: CALL solveNonLinearGetFirstSolution
170.58/73.34	
170.58/73.34	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.051793s
170.58/73.34	Time used: 0.049263
170.58/73.34	Improving Solution with cost 1 ...
170.58/73.34	
170.58/73.34	LOG: CALL solveNonLinearGetNextSolution
170.58/73.34	
170.58/73.34	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.067680s
170.58/73.34	Time used: 0.067675
170.58/73.34	
170.58/73.34	LOG: SAT solveNonLinear - Elapsed time: 0.119473s
170.58/73.34	Cost: 1; Total time: 0.116938
170.58/73.34	Quasi-ranking function: 50000 + 3*main_x - main_z
170.58/73.34	New Graphs: 
170.58/73.34	Transitions:
170.58/73.34	<l2, l2, 2 + main_x <= 2*main_y /\ 1 + 2*main_x + main_z <= 2*main_y /\ 1 + main_x <= 0 /\ 1 <= 2*main_y + main_z /\ 50001 + main_x + main_y + main_z <= 0 /\ 50001 + main_x <= main_y /\ 50001 + main_x + main_z <= main_y /\ 50001 + main_x + main_z <= 0 /\ 50001 + 4*main_x + 100002*main_y <= main_z /\ 50001 + 3*main_x <= main_y + main_z /\ 50001 + 3*main_x <= main_z /\ 50001 + main_y + 2*main_z <= 0 /\ 50001 <= main_y /\ 50001 + main_z <= main_y /\ 50001 + main_z <= 0, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}>
170.58/73.34	Variables:
170.58/73.34	main_x, main_y, main_z
170.58/73.34	Checking conditional termination of SCC {l2}...
170.58/73.34	
170.58/73.34	LOG: CALL solveLinear
170.58/73.34	
170.58/73.34	LOG: RETURN solveLinear - Elapsed time: 0.004272s
170.58/73.34	
170.58/73.34	LOG: CALL solveLinear
170.58/73.34	
170.58/73.34	LOG: RETURN solveLinear - Elapsed time: 0.149659s
170.58/73.34	[56610 : 56883]
170.58/73.34	[56610 : 56884]
170.58/73.34	Solving with 1 template(s).
170.58/73.34	
170.58/73.34	LOG: CALL solveNonLinearGetFirstSolution
170.58/73.34	
170.58/73.34	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.070938s
170.58/73.34	Time used: 0.068368
170.58/73.34	Improving Solution with cost 1 ...
170.58/73.34	
170.58/73.34	LOG: CALL solveNonLinearGetNextSolution
170.58/73.34	
170.58/73.34	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.095979s
170.58/73.34	Time used: 0.095952
170.58/73.34	
170.58/73.34	LOG: SAT solveNonLinear - Elapsed time: 0.166917s
170.58/73.34	Cost: 1; Total time: 0.16432
170.58/73.34	Quasi-ranking function: 50000 + main_x
170.58/73.34	New Graphs: 
170.58/73.34	Transitions:
170.58/73.34	<l2, l2, 2 + main_x <= 2*main_y /\ 1 + 2*main_x + main_z <= 2*main_y /\ 1 <= 2*main_y + main_z /\ 50001 + main_x <= 0 /\ 50001 + main_x + main_y + main_z <= 0 /\ 50001 + main_x <= main_y /\ 50001 + main_x + main_z <= main_y /\ 50001 + main_x + main_z <= 0 /\ 50001 + 4*main_x + 100002*main_y <= main_z /\ 50001 + 3*main_x <= main_y + main_z /\ 50001 + 3*main_x <= main_z /\ 50001 + main_y + 2*main_z <= 0 /\ 50001 <= main_y /\ 50001 + main_z <= main_y /\ 50001 + main_z <= 0, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}>
170.58/73.34	Variables:
170.58/73.34	main_x, main_y, main_z
170.58/73.34	Checking conditional termination of SCC {l2}...
170.58/73.34	
170.58/73.34	LOG: CALL solveLinear
170.58/73.34	
170.58/73.34	LOG: RETURN solveLinear - Elapsed time: 0.004615s
170.58/73.34	
170.58/73.34	LOG: CALL solveLinear
170.58/73.34	
170.58/73.34	LOG: RETURN solveLinear - Elapsed time: 0.114032s
170.58/73.34	[56610 : 56888]
170.58/73.34	[56610 : 56889]
170.58/73.34	Solving with 1 template(s).
170.58/73.34	
170.58/73.34	LOG: CALL solveNonLinearGetFirstSolution
170.58/73.34	
170.58/73.34	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.052925s
170.58/73.34	Time used: 0.049999
170.58/73.34	Improving Solution with cost 1 ...
170.58/73.34	
170.58/73.34	LOG: CALL solveNonLinearGetNextSolution
170.58/73.34	
170.58/73.34	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.072810s
170.58/73.34	Time used: 0.072806
170.58/73.34	
170.58/73.34	LOG: SAT solveNonLinear - Elapsed time: 0.125735s
170.58/73.34	Cost: 1; Total time: 0.122805
170.58/73.34	Quasi-ranking function: 50000 + 2*main_x + 50001*main_y
170.58/73.34	New Graphs: 
170.58/73.34	Transitions:
170.58/73.34	<l2, l2, 2 + main_x <= 2*main_y /\ 1 + 2*main_x + main_z <= 2*main_y /\ 1 <= 2*main_y + main_z /\ 50001 + 2*main_x + 50001*main_y <= 0 /\ 50001 + main_x <= 0 /\ 50001 + main_x + main_y + main_z <= 0 /\ 50001 + main_x <= main_y /\ 50001 + main_x + main_z <= main_y /\ 50001 + main_x + main_z <= 0 /\ 50001 + 4*main_x + 100002*main_y <= main_z /\ 50001 + 3*main_x <= main_y + main_z /\ 50001 + 3*main_x <= main_z /\ 50001 + main_y + 2*main_z <= 0 /\ 50001 <= main_y /\ 50001 + main_z <= main_y /\ 50001 + main_z <= 0, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}>
170.58/73.34	Variables:
170.58/73.34	main_x, main_y, main_z
170.58/73.34	Checking conditional termination of SCC {l2}...
170.58/73.34	
170.58/73.34	LOG: CALL solveLinear
170.58/73.34	
170.58/73.34	LOG: RETURN solveLinear - Elapsed time: 0.002290s
170.58/73.34	
170.58/73.34	LOG: CALL solveLinear
170.58/73.34	
170.58/73.34	LOG: RETURN solveLinear - Elapsed time: 0.358644s
170.58/73.34	[56610 : 56893]
170.58/73.34	[56610 : 56894]
170.58/73.34	Solving with 1 template(s).
170.58/73.34	
170.58/73.34	LOG: CALL solveNonLinearGetFirstSolution
170.58/73.34	
170.58/73.34	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.080444s
170.58/73.34	Time used: 0.078245
170.58/73.34	
170.58/73.34	[56610 : 56898]
170.58/73.34	[56610 : 56902]
170.58/73.34	Successful child: 56898
170.58/73.34	
170.58/73.34	Program does NOT terminate
170.58/73.34	EOF