155.07/67.44	NO
155.07/67.44	
155.07/67.44	Solver Timeout: 4
155.07/67.44	Global Timeout: 300
155.07/67.44	Maximum number of concurrent processes: 900
155.07/67.44	*******************************************************************************************
155.07/67.44	*********************** UNPROCESSED TRANSITION SYSTEMS PER FUNCTION ***********************
155.07/67.44	*******************************************************************************************
155.07/67.44	
155.07/67.44	
155.07/67.44	List of LLVMGraphs + assumeNodes + staticAssertNodes [1] :
155.07/67.44	
155.07/67.44	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
155.07/67.44	+                                                                  +
155.07/67.44	Init Location: 0
155.07/67.44	Transitions:
155.07/67.44	<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)}>
155.07/67.44	<l1, l2, true>
155.07/67.44	<l2, l5, not((main_x > 0))>
155.07/67.44	<l2, l3, (main_x > 0)>
155.07/67.44	<l3, l4, true, seq{main_x -> (main_x + main_y), main_y -> (main_y + main_z), main_z -> (main_z + 1)}>
155.07/67.44	<l4, l2, true>
155.07/67.44	<l5, l6, true, seq{main__func_return_ -> 0}>
155.07/67.44	
155.07/67.44	Fresh variables:
155.07/67.44	
155.07/67.44	Undef variables:
155.07/67.44	
155.07/67.44	Abstraction variables:
155.07/67.44	
155.07/67.44	Exit nodes:
155.07/67.44	
155.07/67.44	Accepting locations:
155.07/67.44	
155.07/67.44	Asserts:
155.07/67.44	
155.07/67.44	+ Assume Nodes [0]: ++++++++++++++++++++++++++++++++++++++++++++++++
155.07/67.44	       
155.07/67.44	+ Static Assert Nodes [0]: +++++++++++++++++++++++++++++++++++++++++
155.07/67.44	       
155.07/67.44	+ After preprocess (paralelization): ++++++++++++++++++++++++++++++
155.07/67.44	
155.07/67.44	Init Location: 0
155.07/67.44	Transitions:
155.07/67.44	<l0, l7, true, seq{main__func_return_ -> 0}>
155.07/67.44	<l7, l8, true, seq{varCall_1 -> ¿functionCall(__VERIFIER_nondet_int)}>
155.07/67.44	<l8, l9, true, seq{main_x -> varCall_1}>
155.07/67.44	<l9, l10, true, seq{varCall_2 -> ¿functionCall(__VERIFIER_nondet_int)}>
155.07/67.44	<l10, l11, true, seq{main_y -> varCall_2}>
155.07/67.44	<l11, l12, true, seq{varCall_3 -> ¿functionCall(__VERIFIER_nondet_int)}>
155.07/67.44	<l12, l1, true, seq{main_z -> varCall_3}>
155.07/67.44	<l1, l2, true>
155.07/67.44	<l2, l3, (main_x > 0)>
155.07/67.44	<l2, l5, not((main_x > 0))>
155.07/67.44	<l3, l4, true, seq{main_x -> (main_x + main_y), main_y -> (main_y + main_z), main_z -> (main_z + 1)}>
155.07/67.44	<l4, l2, true>
155.07/67.44	<l5, l6, true, seq{main__func_return_ -> 0}>
155.07/67.44	
155.07/67.44	Fresh variables:
155.07/67.44	
155.07/67.44	Undef variables:
155.07/67.44	
155.07/67.44	Abstraction variables:
155.07/67.44	
155.07/67.44	Exit nodes:
155.07/67.44	6, 
155.07/67.44	Accepting locations:
155.07/67.44	
155.07/67.44	Asserts:
155.07/67.44	
155.07/67.44	+                                                                  +
155.07/67.44	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
155.07/67.44	
155.07/67.44	
155.07/67.44	Function Return and Parameters Information [2 functions]:
155.07/67.44	    function name: __VERIFIER_nondet_int [1 return + 0 parameters]        demangled: __VERIFIER_nondet_int
155.07/67.44	        __VERIFIER_nondet_int__func_return_      [function result] : int
155.07/67.44	    function name: main [1 return + 0 parameters]        demangled: main
155.07/67.44	        main__func_return_      [function result] : int
155.07/67.44	
155.07/67.44	
155.07/67.44	AST Ident Scanner Information [5 idents]:
155.07/67.44	__VERIFIER_nondet_int | function | [integer, ()] | <line: 8, col: 1> | <line: 13, col: 9> <line: 14, col: 9> <line: 15, col: 9>
155.07/67.44	main | function | [integer, ()] | <line: 10, col: 1>
155.07/67.44	x | local variable | integer | <line: 12, col: 5> | <line: 13, col: 5> <line: 16, col: 12> <line: 17, col: 9> <line: 17, col: 13>
155.07/67.44	y | local variable | integer | <line: 12, col: 5> | <line: 14, col: 5> <line: 17, col: 17> <line: 18, col: 9> <line: 18, col: 13>
155.07/67.44	z | local variable | integer | <line: 12, col: 5> | <line: 15, col: 5> <line: 18, col: 17> <line: 19, col: 9> <line: 19, col: 13>
155.07/67.44	
155.07/67.44	Main function: main
155.07/67.44	Preprocessed LLVMGraph
155.07/67.44	Init Location: 0
155.07/67.44	Transitions:
155.07/67.44	<l0, l2, (main_x = undef4) /\ (main_y = undef5) /\ (main_z = undef6)>
155.07/67.44	<l2, l2, (main_x > 0), par{main_x -> (main_x + main_y), main_y -> (main_y + main_z), main_z -> (main_z + 1)}>
155.07/67.44	<l2, l6, not((main_x > 0))>
155.07/67.44	
155.07/67.44	Fresh variables:
155.07/67.44	undef4, undef5, undef6, 
155.07/67.44	
155.07/67.44	Undef variables:
155.07/67.44	undef4, undef5, undef6, 
155.07/67.44	
155.07/67.44	Abstraction variables:
155.07/67.44	
155.07/67.44	Exit nodes:
155.07/67.44	6, 
155.07/67.44	Accepting locations:
155.07/67.44	
155.07/67.44	Asserts:
155.07/67.44	
155.07/67.44	*************************************************************
155.07/67.44	*******************************************************************************************
155.07/67.44	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
155.07/67.44	*******************************************************************************************
155.07/67.44	
155.07/67.44	Init Location: 0
155.07/67.44	Graph 0:
155.07/67.44	Transitions:
155.07/67.44	Variables:
155.07/67.44	
155.07/67.44	Graph 1:
155.07/67.44	Transitions:
155.07/67.44	<l2, l2, 1 <= main_x, {main_x -> main_x + main_y, main_y -> main_y + main_z, main_z -> 1 + main_z, rest remain the same}>
155.07/67.44	Variables:
155.07/67.44	main_x, main_y, main_z
155.07/67.44	
155.07/67.44	Graph 2:
155.07/67.44	Transitions:
155.07/67.44	Variables:
155.07/67.44	
155.07/67.44	Precedence: 
155.07/67.44	Graph 0
155.07/67.44	
155.07/67.44	Graph 1
155.07/67.44	<l0, l2, main_x = undef4 /\ main_y = undef5 /\ main_z = undef6, {all remain the same}>
155.07/67.44	
155.07/67.44	Graph 2
155.07/67.44	<l2, l6, main_x <= 0, {all remain the same}>
155.07/67.44	
155.07/67.44	Map Locations to Subgraph:
155.07/67.44	( 0 , 0 )
155.07/67.44	( 2 , 1 )
155.07/67.44	( 6 , 2 )
155.07/67.44	
155.07/67.44	*******************************************************************************************
155.07/67.44	********************************    CHECKING ASSERTIONS    ********************************
155.07/67.44	*******************************************************************************************
155.07/67.44	
155.07/67.44	Proving termination of subgraph 0
155.07/67.44	Proving termination of subgraph 1
155.07/67.44	Checking unfeasibility...
155.07/67.44	Time used: 0.002454
155.07/67.44	
155.07/67.44	Checking conditional termination of SCC {l2}...
155.07/67.44	
155.07/67.44	LOG: CALL solveLinear
155.07/67.44	
155.07/67.44	LOG: RETURN solveLinear - Elapsed time: 0.000858s
155.07/67.44	
155.07/67.44	LOG: CALL solveLinear
155.07/67.44	
155.07/67.44	LOG: RETURN solveLinear - Elapsed time: 0.002056s
155.07/67.44	[31894 : 31896]
155.07/67.44	[31894 : 31897]
155.07/67.44	Successful child: 31896
155.07/67.44	[ Invariant Graph ]
155.07/67.44	Strengthening and disabling transitions...
155.07/67.44	
155.07/67.44	LOG: CALL solverLinear in Graph for feasibility
155.07/67.44	
155.07/67.44	LOG: RETURN solveLinear in Graph for feasibility
155.07/67.44	It's unfeasible. Removing transition: 
155.07/67.44	<l2, l2, 1 <= main_x, {main_x -> main_x + main_y, main_y -> main_y + main_z, main_z -> 1 + main_z, rest remain the same}>
155.07/67.44	[ Termination Graph ]
155.07/67.44	Strengthening and disabling transitions...
155.07/67.44	> It's unfeasible. Removing transition: 
155.07/67.44	<l2, l2, 1 <= main_x, {main_x -> main_x + main_y, main_y -> main_y + main_z, main_z -> 1 + main_z, rest remain the same}>
155.07/67.44	New Graphs: 
155.07/67.44	
155.07/67.44	LOG: CALL check - Post:1 + main_x <= 0 - Process 1
155.07/67.44	* Exit transition: <l0, l2, main_x = undef4 /\ main_y = undef5 /\ main_z = undef6, {all remain the same}>
155.07/67.44	* Postcondition  : 1 + main_x <= 0
155.07/67.44	
155.07/67.44	LOG: CALL solveLinear
155.07/67.44	
155.07/67.44	LOG: RETURN solveLinear - Elapsed time: 0.000586s
155.07/67.44	> Postcondition is not implied!
155.07/67.44	
155.07/67.44	LOG: RETURN check - Elapsed time: 0.000694s
155.07/67.44	INVARIANTS: 
155.07/67.44	2: 
155.07/67.44	Quasi-INVARIANTS to narrow Graph: 
155.07/67.44	2: 1 + main_x <= 0 , 
155.07/67.44	Narrowing transition: 
155.07/67.44	<l2, l2, 1 <= main_x, {main_x -> main_x + main_y, main_y -> main_y + main_z, main_z -> 1 + main_z, rest remain the same}>
155.07/67.44	
155.07/67.44	LOG: Narrow transition size 1
155.07/67.44	invGraph after Narrowing: 
155.07/67.44	Transitions:
155.07/67.44	<l2, l2, 1 <= main_x, {main_x -> main_x + main_y, main_y -> main_y + main_z, main_z -> 1 + main_z, rest remain the same}>
155.07/67.44	Variables:
155.07/67.44	main_x, main_y, main_z
155.07/67.44	Checking conditional termination of SCC {l2}...
155.07/67.44	
155.07/67.44	LOG: CALL solveLinear
155.07/67.44	
155.07/67.44	LOG: RETURN solveLinear - Elapsed time: 0.000821s
155.07/67.44	
155.07/67.44	LOG: CALL solveLinear
155.07/67.44	
155.07/67.44	LOG: RETURN solveLinear - Elapsed time: 0.002208s
155.07/67.44	[31894 : 31901]
155.07/67.44	[31894 : 31902]
155.07/67.44	Successful child: 31901
155.07/67.44	[ Invariant Graph ]
155.07/67.44	Strengthening and disabling transitions...
155.07/67.44	
155.07/67.44	LOG: CALL solverLinear in Graph for feasibility
155.07/67.44	
155.07/67.44	LOG: RETURN solveLinear in Graph for feasibility
155.07/67.44	It's unfeasible. Removing transition: 
155.07/67.44	<l2, l2, 1 <= main_x, {main_x -> main_x + main_y, main_y -> main_y + main_z, main_z -> 1 + main_z, rest remain the same}>
155.07/67.44	[ Termination Graph ]
155.07/67.44	Strengthening and disabling transitions...
155.07/67.44	
155.07/67.44	LOG: CALL solverLinear in Graph for feasibility
155.07/67.44	
155.07/67.44	LOG: RETURN solveLinear in Graph for feasibility
155.07/67.44	It's unfeasible. Removing transition: 
155.07/67.44	<l2, l2, 1 <= main_x, {main_x -> main_x + main_y, main_y -> main_y + main_z, main_z -> 1 + main_z, rest remain the same}>
155.07/67.44	New Graphs: 
155.07/67.44	
155.07/67.44	LOG: CALL check - Post:main_x <= 0 - Process 2
155.07/67.44	* Exit transition: <l0, l2, 0 <= main_x /\ main_x = undef4 /\ main_y = undef5 /\ main_z = undef6, {all remain the same}>
155.07/67.44	* Postcondition  : main_x <= 0
155.07/67.44	
155.07/67.44	LOG: CALL solveLinear
155.07/67.44	
155.07/67.44	LOG: RETURN solveLinear - Elapsed time: 0.000648s
155.07/67.44	> Postcondition is not implied!
155.07/67.44	
155.07/67.44	LOG: RETURN check - Elapsed time: 0.000761s
155.07/67.44	INVARIANTS: 
155.07/67.44	2: 
155.07/67.44	Quasi-INVARIANTS to narrow Graph: 
155.07/67.44	2: main_x <= 0 , 
155.07/67.44	Narrowing transition: 
155.07/67.44	<l2, l2, 1 <= main_x, {main_x -> main_x + main_y, main_y -> main_y + main_z, main_z -> 1 + main_z, rest remain the same}>
155.07/67.44	
155.07/67.44	LOG: Narrow transition size 1
155.07/67.44	invGraph after Narrowing: 
155.07/67.44	Transitions:
155.07/67.44	<l2, l2, 1 <= main_x, {main_x -> main_x + main_y, main_y -> main_y + main_z, main_z -> 1 + main_z, rest remain the same}>
155.07/67.44	Variables:
155.07/67.44	main_x, main_y, main_z
155.07/67.44	Checking conditional termination of SCC {l2}...
155.07/67.44	
155.07/67.44	LOG: CALL solveLinear
155.07/67.44	
155.07/67.44	LOG: RETURN solveLinear - Elapsed time: 0.000822s
155.07/67.44	
155.07/67.44	LOG: CALL solveLinear
155.07/67.44	
155.07/67.44	LOG: RETURN solveLinear - Elapsed time: 0.002197s
155.07/67.44	[31894 : 31906]
155.07/67.44	[31894 : 31907]
155.07/67.44	Successful child: 31906
155.07/67.44	[ Invariant Graph ]
155.07/67.44	Strengthening and disabling transitions...
155.07/67.44	
155.07/67.44	LOG: CALL solverLinear in Graph for feasibility
155.07/67.44	
155.07/67.44	LOG: RETURN solveLinear in Graph for feasibility
155.07/67.44	Strengthening transition (result): 
155.07/67.44	<l2, l2, main_x + main_z <= 0 /\ 1 <= main_x /\ main_x + main_y <= 1 + main_z, {main_x -> main_x + main_y, main_y -> main_y + main_z, main_z -> 1 + main_z, rest remain the same}>
155.07/67.44	[ Termination Graph ]
155.07/67.44	Strengthening and disabling transitions...
155.07/67.44	
155.07/67.44	LOG: CALL solverLinear in Graph for feasibility
155.07/67.44	
155.07/67.44	LOG: RETURN solveLinear in Graph for feasibility
155.07/67.44	Strengthening transition (result): 
155.07/67.44	<l2, l2, main_x + main_z <= 0 /\ 1 <= main_x /\ main_x + main_y <= 1 + main_z, {main_x -> main_x + main_y, main_y -> main_y + main_z, main_z -> 1 + main_z, rest remain the same}>
155.07/67.44	Ranking function: main_x - main_z
155.07/67.44	New Graphs: 
155.07/67.44	[31894 : 31911]
155.07/67.44	[31894 : 31912]
155.07/67.44	INVARIANTS: 
155.07/67.44	2: 
155.07/67.44	Quasi-INVARIANTS to narrow Graph: 
155.07/67.44	2: main_x + main_z <= 0 , main_x + main_y <= 1 + main_z , 
155.07/67.44	Narrowing transition: 
155.07/67.44	<l2, l2, 1 <= main_x, {main_x -> main_x + main_y, main_y -> main_y + main_z, main_z -> 1 + main_z, rest remain the same}>
155.07/67.44	
155.07/67.44	LOG: Narrow transition size 2
155.07/67.44	invGraph after Narrowing: 
155.07/67.44	Transitions:
155.07/67.44	<l2, l2, main_x + main_z <= 0 /\ 1 <= main_x /\ 2 + main_z <= main_x + main_y, {main_x -> main_x + main_y, main_y -> main_y + main_z, main_z -> 1 + main_z, rest remain the same}>
155.07/67.44	<l2, l2, 1 <= main_x /\ 1 <= main_x + main_z, {main_x -> main_x + main_y, main_y -> main_y + main_z, main_z -> 1 + main_z, rest remain the same}>
155.07/67.44	Variables:
155.07/67.44	main_x, main_y, main_z
155.07/67.44	Checking conditional termination of SCC {l2}...
155.07/67.44	
155.07/67.44	LOG: CALL solveLinear
155.07/67.44	
155.07/67.44	LOG: RETURN solveLinear - Elapsed time: 0.001531s
155.07/67.44	Ranking function: -main_z
155.07/67.44	New Graphs: 
155.07/67.44	Transitions:
155.07/67.44	<l2, l2, 1 <= main_x /\ 1 <= main_x + main_z, {main_x -> main_x + main_y, main_y -> main_y + main_z, main_z -> 1 + main_z, rest remain the same}>
155.07/67.44	Variables:
155.07/67.44	main_x, main_y, main_z
155.07/67.44	Checking conditional termination of SCC {l2}...
155.07/67.44	
155.07/67.44	LOG: CALL solveLinear
155.07/67.44	
155.07/67.44	LOG: RETURN solveLinear - Elapsed time: 0.000596s
155.07/67.44	
155.07/67.44	LOG: CALL solveLinear
155.07/67.44	
155.07/67.44	LOG: RETURN solveLinear - Elapsed time: 0.002356s
155.07/67.44	[31894 : 31913]
155.07/67.44	[31894 : 31914]
155.07/67.44	Successful child: 31913
155.07/67.44	[ Invariant Graph ]
155.07/67.44	Strengthening and disabling transitions...
155.07/67.44	
155.07/67.44	LOG: CALL solverLinear in Graph for feasibility
155.07/67.44	
155.07/67.44	LOG: RETURN solveLinear in Graph for feasibility
155.07/67.44	Strengthening transition (result): 
155.07/67.44	<l2, l2, main_x + main_y + main_z <= 0 /\ main_x + main_z <= 0 /\ 1 <= main_x /\ 2 + main_z <= main_x + main_y, {main_x -> main_x + main_y, main_y -> main_y + main_z, main_z -> 1 + main_z, rest remain the same}>
155.07/67.44	
155.07/67.44	LOG: CALL solverLinear in Graph for feasibility
155.07/67.44	
155.07/67.44	LOG: RETURN solveLinear in Graph for feasibility
155.07/67.44	Strengthening transition (result): 
155.07/67.44	<l2, l2, main_x + main_y + main_z <= 0 /\ 1 <= main_x /\ 1 <= main_x + main_z, {main_x -> main_x + main_y, main_y -> main_y + main_z, main_z -> 1 + main_z, rest remain the same}>
155.07/67.44	[ Termination Graph ]
155.07/67.44	Strengthening and disabling transitions...
155.07/67.44	
155.07/67.44	LOG: CALL solverLinear in Graph for feasibility
155.07/67.44	
155.07/67.44	LOG: RETURN solveLinear in Graph for feasibility
155.07/67.44	Strengthening transition (result): 
155.07/67.44	<l2, l2, main_x + main_y + main_z <= 0 /\ 1 <= main_x /\ 1 <= main_x + main_z, {main_x -> main_x + main_y, main_y -> main_y + main_z, main_z -> 1 + main_z, rest remain the same}>
155.07/67.44	Ranking function: main_x
155.07/67.44	New Graphs: 
155.07/67.44	[31894 : 31918]
155.07/67.44	[31894 : 31919]
155.07/67.44	INVARIANTS: 
155.07/67.44	2: 
155.07/67.44	Quasi-INVARIANTS to narrow Graph: 
155.07/67.44	2: main_x + main_y + main_z <= 0 , 
155.07/67.44	Narrowing transition: 
155.07/67.44	<l2, l2, main_x + main_z <= 0 /\ 1 <= main_x /\ 2 + main_z <= main_x + main_y, {main_x -> main_x + main_y, main_y -> main_y + main_z, main_z -> 1 + main_z, rest remain the same}>
155.07/67.44	
155.07/67.44	LOG: Narrow transition size 1
155.07/67.44	Narrowing transition: 
155.07/67.44	<l2, l2, 1 <= main_x /\ 1 <= main_x + main_z, {main_x -> main_x + main_y, main_y -> main_y + main_z, main_z -> 1 + main_z, rest remain the same}>
155.07/67.44	
155.07/67.44	LOG: Narrow transition size 1
155.07/67.44	invGraph after Narrowing: 
155.07/67.44	Transitions:
155.07/67.44	<l2, l2, main_x + main_z <= 0 /\ 1 <= main_x /\ 1 <= main_x + main_y + main_z /\ 2 + main_z <= main_x + main_y, {main_x -> main_x + main_y, main_y -> main_y + main_z, main_z -> 1 + main_z, rest remain the same}>
155.07/67.44	<l2, l2, 1 <= main_x /\ 1 <= main_x + main_y + main_z /\ 1 <= main_x + main_z, {main_x -> main_x + main_y, main_y -> main_y + main_z, main_z -> 1 + main_z, rest remain the same}>
155.07/67.44	Variables:
155.07/67.44	main_x, main_y, main_z
155.07/67.44	Checking conditional termination of SCC {l2}...
155.07/67.44	
155.07/67.44	LOG: CALL solveLinear
155.07/67.44	
155.07/67.44	LOG: RETURN solveLinear - Elapsed time: 0.001819s
155.07/67.44	Ranking function: -main_z
155.07/67.44	New Graphs: 
155.07/67.44	Transitions:
155.07/67.44	<l2, l2, 1 <= main_x /\ 1 <= main_x + main_y + main_z /\ 1 <= main_x + main_z, {main_x -> main_x + main_y, main_y -> main_y + main_z, main_z -> 1 + main_z, rest remain the same}>
155.07/67.44	Variables:
155.07/67.44	main_x, main_y, main_z
155.07/67.44	Checking conditional termination of SCC {l2}...
155.07/67.44	
155.07/67.44	LOG: CALL solveLinear
155.07/67.44	
155.07/67.44	LOG: RETURN solveLinear - Elapsed time: 0.000707s
155.07/67.44	
155.07/67.44	LOG: CALL solveLinear
155.07/67.44	
155.07/67.44	LOG: RETURN solveLinear - Elapsed time: 0.002729s
155.07/67.44	[31894 : 31920]
155.07/67.44	[31894 : 31921]
155.07/67.44	Successful child: 31920
155.07/67.44	[ Invariant Graph ]
155.07/67.44	Strengthening and disabling transitions...
155.07/67.44	
155.07/67.44	LOG: CALL solverLinear in Graph for feasibility
155.07/67.44	
155.07/67.44	LOG: RETURN solveLinear in Graph for feasibility
155.07/67.44	It's unfeasible. Removing transition: 
155.07/67.44	<l2, l2, main_x + main_z <= 0 /\ 1 <= main_x /\ 1 <= main_x + main_y + main_z /\ 2 + main_z <= main_x + main_y, {main_x -> main_x + main_y, main_y -> main_y + main_z, main_z -> 1 + main_z, rest remain the same}>
155.07/67.44	
155.07/67.44	LOG: CALL solverLinear in Graph for feasibility
155.07/67.44	
155.07/67.44	LOG: RETURN solveLinear in Graph for feasibility
155.07/67.44	Strengthening transition (result): 
155.07/67.44	<l2, l2, 1 + main_x + main_y <= main_z /\ 1 <= main_x /\ 1 <= main_x + main_y + main_z /\ 1 <= main_x + main_z /\ main_x + main_z <= 2, {main_x -> main_x + main_y, main_y -> main_y + main_z, main_z -> 1 + main_z, rest remain the same}>
155.07/67.44	[ Termination Graph ]
155.07/67.44	Strengthening and disabling transitions...
155.07/67.44	
155.07/67.44	LOG: CALL solverLinear in Graph for feasibility
155.07/67.44	
155.07/67.44	LOG: RETURN solveLinear in Graph for feasibility
155.07/67.44	Strengthening transition (result): 
155.07/67.44	<l2, l2, 1 + main_x + main_y <= main_z /\ 1 <= main_x /\ 1 <= main_x + main_y + main_z /\ 1 <= main_x + main_z /\ main_x + main_z <= 2, {main_x -> main_x + main_y, main_y -> main_y + main_z, main_z -> 1 + main_z, rest remain the same}>
155.07/67.44	Ranking function: 2 - main_z
155.07/67.44	New Graphs: 
155.07/67.44	[31894 : 31925]
155.07/67.44	[31894 : 31926]
155.07/67.44	[31894 : 31927]
155.07/67.44	INVARIANTS: 
155.07/67.44	2: 
155.07/67.44	Quasi-INVARIANTS to narrow Graph: 
155.07/67.44	2: 1 + main_x + main_y <= main_z , main_x + main_z <= 2 , 
155.07/67.44	Narrowing transition: 
155.07/67.44	<l2, l2, main_x + main_z <= 0 /\ 1 <= main_x /\ 1 <= main_x + main_y + main_z /\ 2 + main_z <= main_x + main_y, {main_x -> main_x + main_y, main_y -> main_y + main_z, main_z -> 1 + main_z, rest remain the same}>
155.07/67.44	
155.07/67.44	LOG: Narrow transition size 2
155.07/67.44	Narrowing transition: 
155.07/67.44	<l2, l2, 1 <= main_x /\ 1 <= main_x + main_y + main_z /\ 1 <= main_x + main_z, {main_x -> main_x + main_y, main_y -> main_y + main_z, main_z -> 1 + main_z, rest remain the same}>
155.07/67.44	
155.07/67.44	LOG: Narrow transition size 2
155.07/67.44	invGraph after Narrowing: 
155.07/67.44	Transitions:
155.07/67.44	<l2, l2, main_x + main_z <= 0 /\ 1 <= main_x /\ 1 <= main_x + main_y + main_z /\ 2 + main_z <= main_x + main_y, {main_x -> main_x + main_y, main_y -> main_y + main_z, main_z -> 1 + main_z, rest remain the same}>
155.07/67.44	<l2, l2, 1 + main_x + main_y <= main_z /\ 1 <= main_x /\ 1 <= main_x + main_y + main_z /\ 3 <= main_x + main_z, {main_x -> main_x + main_y, main_y -> main_y + main_z, main_z -> 1 + main_z, rest remain the same}>
155.07/67.44	<l2, l2, main_z <= main_x + main_y /\ 1 <= main_x /\ 1 <= main_x + main_y + main_z /\ 1 <= main_x + main_z, {main_x -> main_x + main_y, main_y -> main_y + main_z, main_z -> 1 + main_z, rest remain the same}>
155.07/67.44	Variables:
155.07/67.44	main_x, main_y, main_z
155.07/67.44	Checking conditional termination of SCC {l2}...
155.07/67.44	
155.07/67.44	LOG: CALL solveLinear
155.07/67.44	
155.07/67.44	LOG: RETURN solveLinear - Elapsed time: 0.003077s
155.07/67.44	Ranking function: 2 - 7*main_z
155.07/67.44	New Graphs: 
155.07/67.44	Transitions:
155.07/67.44	<l2, l2, 1 + main_x + main_y <= main_z /\ 1 <= main_x /\ 1 <= main_x + main_y + main_z /\ 3 <= main_x + main_z, {main_x -> main_x + main_y, main_y -> main_y + main_z, main_z -> 1 + main_z, rest remain the same}>
155.07/67.44	<l2, l2, main_z <= main_x + main_y /\ 1 <= main_x /\ 1 <= main_x + main_y + main_z /\ 1 <= main_x + main_z, {main_x -> main_x + main_y, main_y -> main_y + main_z, main_z -> 1 + main_z, rest remain the same}>
155.07/67.44	Variables:
155.07/67.44	main_x, main_y, main_z
155.07/67.44	Checking conditional termination of SCC {l2}...
155.07/67.44	
155.07/67.44	LOG: CALL solveLinear
155.07/67.44	
155.07/67.44	LOG: RETURN solveLinear - Elapsed time: 0.001429s
155.07/67.44	
155.07/67.44	LOG: CALL solveLinear
155.07/67.44	
155.07/67.44	LOG: RETURN solveLinear - Elapsed time: 0.023650s
155.07/67.44	[31894 : 31928]
155.07/67.44	[31894 : 31929]
155.07/67.44	Successful child: 31928
155.07/67.44	[ Invariant Graph ]
155.07/67.44	Strengthening and disabling transitions...
155.07/67.44	
155.07/67.44	LOG: CALL solverLinear in Graph for feasibility
155.07/67.44	
155.07/67.44	LOG: RETURN solveLinear in Graph for feasibility
155.07/67.44	It's unfeasible. Removing transition: 
155.07/67.44	<l2, l2, main_x + main_z <= 0 /\ 1 <= main_x /\ 1 <= main_x + main_y + main_z /\ 2 + main_z <= main_x + main_y, {main_x -> main_x + main_y, main_y -> main_y + main_z, main_z -> 1 + main_z, rest remain the same}>
155.07/67.44	
155.07/67.44	LOG: CALL solverLinear in Graph for feasibility
155.07/67.44	
155.07/67.44	LOG: RETURN solveLinear in Graph for feasibility
155.07/67.44	It's unfeasible. Removing transition: 
155.07/67.44	<l2, l2, 1 + main_x + main_y <= main_z /\ 1 <= main_x /\ 1 <= main_x + main_y + main_z /\ 3 <= main_x + main_z, {main_x -> main_x + main_y, main_y -> main_y + main_z, main_z -> 1 + main_z, rest remain the same}>
155.07/67.44	
155.07/67.44	LOG: CALL solverLinear in Graph for feasibility
155.07/67.44	
155.07/67.44	LOG: RETURN solveLinear in Graph for feasibility
155.07/67.44	Strengthening transition (result): 
155.07/67.44	<l2, l2, main_z <= main_x + main_y /\ 1 <= main_x /\ 1 <= main_x + main_y + main_z /\ 1 <= main_x + main_z /\ 1 <= main_z /\ main_z <= 1 + main_y, {main_x -> main_x + main_y, main_y -> main_y + main_z, main_z -> 1 + main_z, rest remain the same}>
155.07/67.44	[ Termination Graph ]
155.07/67.44	Strengthening and disabling transitions...
155.07/67.44	> It's unfeasible. Removing transition: 
155.07/67.44	<l2, l2, 1 + main_x + main_y <= main_z /\ 1 <= main_x /\ 1 <= main_x + main_y + main_z /\ 3 <= main_x + main_z, {main_x -> main_x + main_y, main_y -> main_y + main_z, main_z -> 1 + main_z, rest remain the same}>
155.07/67.44	
155.07/67.44	LOG: CALL solverLinear in Graph for feasibility
155.07/67.44	
155.07/67.44	LOG: RETURN solveLinear in Graph for feasibility
155.07/67.44	Strengthening transition (result): 
155.07/67.44	<l2, l2, main_z <= main_x + main_y /\ 1 <= main_x /\ 1 <= main_x + main_y + main_z /\ 1 <= main_x + main_z /\ 1 <= main_z /\ main_z <= 1 + main_y, {main_x -> main_x + main_y, main_y -> main_y + main_z, main_z -> 1 + main_z, rest remain the same}>
155.07/67.44	New Graphs: 
155.07/67.44	Transitions:
155.07/67.44	<l2, l2, main_z <= main_x + main_y /\ 1 <= main_x /\ 1 <= main_x + main_y + main_z /\ 1 <= main_x + main_z /\ 1 <= main_z /\ main_z <= 1 + main_y, {main_x -> main_x + main_y, main_y -> main_y + main_z, main_z -> 1 + main_z, rest remain the same}>
155.07/67.44	Variables:
155.07/67.44	main_x, main_y, main_z
155.07/67.44	Checking conditional termination of SCC {l2}...
155.07/67.44	
155.07/67.44	LOG: CALL solveLinear
155.07/67.44	
155.07/67.44	LOG: RETURN solveLinear - Elapsed time: 0.001021s
155.07/67.44	
155.07/67.44	LOG: CALL solveLinear
155.07/67.44	
155.07/67.44	LOG: RETURN solveLinear - Elapsed time: 0.004059s
155.07/67.44	[31894 : 31933]
155.07/67.44	[31894 : 31934]
155.07/67.44	Solving with 1 template(s).
155.07/67.44	
155.07/67.44	LOG: CALL solveNonLinearGetFirstSolution
155.07/67.44	
155.07/67.44	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.013712s
155.07/67.44	Time used: 0.012961
155.07/67.44	Improving Solution with cost 1 ...
155.07/67.44	
155.07/67.44	LOG: CALL solveNonLinearGetNextSolution
155.07/67.44	
155.07/67.44	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.023312s
155.07/67.44	Time used: 0.023303
155.07/67.44	
155.07/67.44	LOG: SAT solveNonLinear - Elapsed time: 0.037023s
155.07/67.44	Cost: 1; Total time: 0.036264
155.07/67.44	Termination implied by a set of invariant(s):
155.07/67.44	Invariant at l2: 0 <= 1 + main_x + main_y + main_z
155.07/67.44	[ Invariant Graph ]
155.07/67.44	Strengthening and disabling transitions...
155.07/67.44	
155.07/67.44	LOG: CALL solverLinear in Graph for feasibility
155.07/67.44	
155.07/67.44	LOG: RETURN solveLinear in Graph for feasibility
155.07/67.44	Strengthening transition (result): 
155.07/67.44	<l2, l2, main_z <= main_x + main_y /\ 1 <= main_x /\ 1 <= main_x + main_y + main_z /\ 1 <= main_x + main_z /\ 1 <= main_z /\ main_z <= 1 + main_y, {main_x -> main_x + main_y, main_y -> main_y + main_z, main_z -> 1 + main_z, rest remain the same}>
155.07/67.44	[ Termination Graph ]
155.07/67.44	Strengthening and disabling transitions...
155.07/67.44	
155.07/67.44	LOG: CALL solverLinear in Graph for feasibility
155.07/67.44	
155.07/67.44	LOG: RETURN solveLinear in Graph for feasibility
155.07/67.44	Strengthening transition (result): 
155.07/67.44	<l2, l2, main_z <= main_x + main_y /\ 1 <= main_x /\ 1 <= main_x + main_y + main_z /\ 1 <= main_x + main_z /\ 1 <= main_z /\ main_z <= 1 + main_y, {main_x -> main_x + main_y, main_y -> main_y + main_z, main_z -> 1 + main_z, rest remain the same}>
155.07/67.44	Quasi-ranking function: 50000 - main_y
155.07/67.44	New Graphs: 
155.07/67.44	Transitions:
155.07/67.44	<l2, l2, main_z <= main_x + main_y /\ 1 <= main_x /\ 1 <= main_x + main_y + main_z /\ 1 <= main_x + main_z /\ 1 <= main_z /\ main_z <= 1 + main_y /\ 50001 <= main_y, {main_x -> main_x + main_y, main_y -> main_y + main_z, main_z -> 1 + main_z, rest remain the same}>
155.07/67.44	Variables:
155.07/67.44	main_x, main_y, main_z
155.07/67.44	Checking conditional termination of SCC {l2}...
155.07/67.44	
155.07/67.44	LOG: CALL solveLinear
155.07/67.44	
155.07/67.44	LOG: RETURN solveLinear - Elapsed time: 0.001044s
155.07/67.44	
155.07/67.44	LOG: CALL solveLinear
155.07/67.44	
155.07/67.44	LOG: RETURN solveLinear - Elapsed time: 0.011189s
155.07/67.44	[31894 : 31938]
155.07/67.44	[31894 : 31939]
155.07/67.44	Solving with 1 template(s).
155.07/67.44	
155.07/67.44	LOG: CALL solveNonLinearGetFirstSolution
155.07/67.44	
155.07/67.44	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.016133s
155.07/67.44	Time used: 0.015242
155.07/67.44	Improving Solution with cost 1 ...
155.07/67.44	
155.07/67.44	LOG: CALL solveNonLinearGetNextSolution
155.07/67.44	
155.07/67.44	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.021383s
155.07/67.44	Time used: 0.021376
155.07/67.44	
155.07/67.44	LOG: SAT solveNonLinear - Elapsed time: 0.037516s
155.07/67.44	Cost: 1; Total time: 0.036618
155.07/67.44	Termination implied by a set of invariant(s):
155.07/67.44	Invariant at l2: 0 <= 1 + main_x
155.07/67.44	[ Invariant Graph ]
155.07/67.44	Strengthening and disabling transitions...
155.07/67.44	
155.07/67.44	LOG: CALL solverLinear in Graph for feasibility
155.07/67.44	
155.07/67.44	LOG: RETURN solveLinear in Graph for feasibility
155.07/67.44	Strengthening transition (result): 
155.07/67.44	<l2, l2, main_z <= main_x + main_y /\ 1 <= main_x /\ 1 <= main_x + main_y + main_z /\ 1 <= main_x + main_z /\ 1 <= main_z /\ main_z <= 1 + main_y, {main_x -> main_x + main_y, main_y -> main_y + main_z, main_z -> 1 + main_z, rest remain the same}>
155.07/67.44	[ Termination Graph ]
155.07/67.44	Strengthening and disabling transitions...
155.07/67.44	
155.07/67.44	LOG: CALL solverLinear in Graph for feasibility
155.07/67.44	
155.07/67.44	LOG: RETURN solveLinear in Graph for feasibility
155.07/67.44	Strengthening transition (result): 
155.07/67.44	<l2, l2, main_z <= main_x + main_y /\ 1 <= main_x /\ 1 <= main_x + main_y + main_z /\ 1 <= main_x + main_z /\ 1 <= main_z /\ main_z <= 1 + main_y /\ 50001 <= main_y, {main_x -> main_x + main_y, main_y -> main_y + main_z, main_z -> 1 + main_z, rest remain the same}>
155.07/67.44	Quasi-ranking function: 50000 - main_z
155.07/67.44	New Graphs: 
155.07/67.44	Transitions:
155.07/67.44	<l2, l2, main_z <= main_x + main_y /\ 1 <= main_x /\ 1 <= main_x + main_y + main_z /\ 1 <= main_x + main_z /\ main_z <= 1 + main_y /\ 50001 <= main_y /\ 50001 <= main_z, {main_x -> main_x + main_y, main_y -> main_y + main_z, main_z -> 1 + main_z, rest remain the same}>
155.07/67.44	Variables:
155.07/67.44	main_x, main_y, main_z
155.07/67.44	Checking conditional termination of SCC {l2}...
155.07/67.44	
155.07/67.44	LOG: CALL solveLinear
155.07/67.44	
155.07/67.44	LOG: RETURN solveLinear - Elapsed time: 0.001086s
155.07/67.44	
155.07/67.44	LOG: CALL solveLinear
155.07/67.44	
155.07/67.44	LOG: RETURN solveLinear - Elapsed time: 0.008577s
155.07/67.44	[31894 : 31943]
155.07/67.44	[31894 : 31944]
155.07/67.44	Solving with 1 template(s).
155.07/67.44	
155.07/67.44	LOG: CALL solveNonLinearGetFirstSolution
155.07/67.44	
155.07/67.44	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.015954s
155.07/67.44	Time used: 0.01518
155.07/67.44	Improving Solution with cost 1 ...
155.07/67.44	
155.07/67.44	LOG: CALL solveNonLinearGetNextSolution
155.07/67.44	
155.07/67.44	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.023407s
155.07/67.44	Time used: 0.023401
155.07/67.44	
155.07/67.44	LOG: SAT solveNonLinear - Elapsed time: 0.039361s
155.07/67.44	Cost: 1; Total time: 0.038581
155.07/67.44	Quasi-ranking function: 50000 - main_y - main_z
155.07/67.44	New Graphs: 
155.07/67.44	Transitions:
155.07/67.44	<l2, l2, main_z <= main_x + main_y /\ 1 <= main_x /\ 1 <= main_x + main_y + main_z /\ 1 <= main_x + main_z /\ main_z <= 1 + main_y /\ 50001 <= main_y /\ 50001 <= main_y + main_z /\ 50001 <= main_z, {main_x -> main_x + main_y, main_y -> main_y + main_z, main_z -> 1 + main_z, rest remain the same}>
155.07/67.44	Variables:
155.07/67.44	main_x, main_y, main_z
155.07/67.44	Checking conditional termination of SCC {l2}...
155.07/67.44	
155.07/67.44	LOG: CALL solveLinear
155.07/67.44	
155.07/67.44	LOG: RETURN solveLinear - Elapsed time: 0.001132s
155.07/67.44	
155.07/67.44	LOG: CALL solveLinear
155.07/67.44	
155.07/67.44	LOG: RETURN solveLinear - Elapsed time: 0.027488s
155.07/67.44	[31894 : 31948]
155.07/67.44	[31894 : 31949]
155.07/67.44	Solving with 1 template(s).
155.07/67.44	
155.07/67.44	LOG: CALL solveNonLinearGetFirstSolution
155.07/67.44	
155.07/67.44	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.015858s
155.07/67.44	Time used: 0.015108
155.07/67.44	Improving Solution with cost 1 ...
155.07/67.44	
155.07/67.44	LOG: CALL solveNonLinearGetNextSolution
155.07/67.44	
155.07/67.44	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.025442s
155.07/67.44	Time used: 0.025435
155.07/67.44	
155.07/67.44	LOG: SAT solveNonLinear - Elapsed time: 0.041300s
155.07/67.44	Cost: 1; Total time: 0.040543
155.07/67.44	Quasi-ranking function: 50000 - 2*main_x + main_y + main_z
155.07/67.44	New Graphs: 
155.07/67.44	Transitions:
155.07/67.44	<l2, l2, main_z <= main_x + main_y /\ 1 <= main_x /\ 1 <= main_x + main_y + main_z /\ 1 <= main_x + main_z /\ main_z <= 1 + main_y /\ 50001 + main_y + main_z <= 2*main_x /\ 50001 <= main_y /\ 50001 <= main_y + main_z /\ 50001 <= main_z, {main_x -> main_x + main_y, main_y -> main_y + main_z, main_z -> 1 + main_z, rest remain the same}>
155.07/67.44	Variables:
155.07/67.44	main_x, main_y, main_z
155.07/67.44	Checking conditional termination of SCC {l2}...
155.07/67.44	
155.07/67.44	LOG: CALL solveLinear
155.07/67.44	
155.07/67.44	LOG: RETURN solveLinear - Elapsed time: 0.001248s
155.07/67.44	
155.07/67.44	LOG: CALL solveLinear
155.07/67.44	
155.07/67.44	LOG: RETURN solveLinear - Elapsed time: 0.029454s
155.07/67.44	[31894 : 31953]
155.07/67.44	[31894 : 31954]
155.07/67.44	Solving with 1 template(s).
155.07/67.44	
155.07/67.44	LOG: CALL solveNonLinearGetFirstSolution
155.07/67.44	
155.07/67.44	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.022183s
155.07/67.44	Time used: 0.021365
155.07/67.44	Improving Solution with cost 1 ...
155.07/67.44	
155.07/67.44	LOG: CALL solveNonLinearGetNextSolution
155.07/67.44	
155.07/67.44	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.030534s
155.07/67.44	Time used: 0.030527
155.07/67.44	
155.07/67.44	LOG: SAT solveNonLinear - Elapsed time: 0.052717s
155.07/67.44	Cost: 1; Total time: 0.051892
155.07/67.44	Quasi-ranking function: 50000 - 2*main_x + main_y - main_z
155.07/67.44	New Graphs: 
155.07/67.44	Transitions:
155.07/67.44	<l2, l2, main_z <= main_x + main_y /\ 1 <= main_x /\ 1 <= main_x + main_y + main_z /\ 1 <= main_x + main_z /\ main_z <= 1 + main_y /\ 50001 + main_y + main_z <= 2*main_x /\ 50001 + main_y <= 2*main_x + main_z /\ 50001 <= main_y /\ 50001 <= main_y + main_z /\ 50001 <= main_z, {main_x -> main_x + main_y, main_y -> main_y + main_z, main_z -> 1 + main_z, rest remain the same}>
155.07/67.44	Variables:
155.07/67.44	main_x, main_y, main_z
155.07/67.44	Checking conditional termination of SCC {l2}...
155.07/67.44	
155.07/67.44	LOG: CALL solveLinear
155.07/67.44	
155.07/67.44	LOG: RETURN solveLinear - Elapsed time: 0.001344s
155.07/67.44	
155.07/67.44	LOG: CALL solveLinear
155.07/67.44	
155.07/67.44	LOG: RETURN solveLinear - Elapsed time: 0.100774s
155.07/67.44	[31894 : 31958]
155.07/67.44	[31894 : 31959]
155.07/67.44	Solving with 1 template(s).
155.07/67.44	
155.07/67.44	LOG: CALL solveNonLinearGetFirstSolution
155.07/67.44	
155.07/67.44	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.020003s
155.07/67.44	Time used: 0.018819
155.07/67.44	Improving Solution with cost 1 ...
155.07/67.44	
155.07/67.44	LOG: CALL solveNonLinearGetNextSolution
155.07/67.44	
155.07/67.44	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.022171s
155.07/67.44	Time used: 0.022164
155.07/67.44	
155.07/67.44	LOG: SAT solveNonLinear - Elapsed time: 0.042174s
155.07/67.44	Cost: 1; Total time: 0.040983
155.07/67.44	Termination implied by a set of invariant(s):
155.07/67.44	Invariant at l2: 0 <= 1 + main_x + main_y + main_z
155.07/67.44	[ Invariant Graph ]
155.07/67.44	Strengthening and disabling transitions...
155.07/67.44	
155.07/67.44	LOG: CALL solverLinear in Graph for feasibility
155.07/67.44	
155.07/67.44	LOG: RETURN solveLinear in Graph for feasibility
155.07/67.44	Strengthening transition (result): 
155.07/67.44	<l2, l2, main_z <= main_x + main_y /\ 1 <= main_x /\ 1 <= main_x + main_y + main_z /\ 1 <= main_x + main_z /\ 1 <= main_z /\ main_z <= 1 + main_y, {main_x -> main_x + main_y, main_y -> main_y + main_z, main_z -> 1 + main_z, rest remain the same}>
155.07/67.44	[ Termination Graph ]
155.07/67.44	Strengthening and disabling transitions...
155.07/67.44	
155.07/67.44	LOG: CALL solverLinear in Graph for feasibility
155.07/67.44	
155.07/67.44	LOG: RETURN solveLinear in Graph for feasibility
155.07/67.44	Strengthening transition (result): 
155.07/67.44	<l2, l2, main_z <= main_x + main_y /\ 1 <= main_x /\ 1 <= main_x + main_y + main_z /\ 1 <= main_x + main_z /\ main_z <= 1 + main_y /\ 50001 + main_y + main_z <= 2*main_x /\ 50001 + main_y <= 2*main_x + main_z /\ 50001 <= main_y /\ 50001 <= main_y + main_z /\ 50001 <= main_z, {main_x -> main_x + main_y, main_y -> main_y + main_z, main_z -> 1 + main_z, rest remain the same}>
155.07/67.44	Quasi-ranking function: 50000 - main_y + main_z
155.07/67.44	New Graphs: 
155.07/67.44	Transitions:
155.07/67.44	<l2, l2, main_z <= main_x + main_y /\ 1 <= main_x /\ 1 <= main_x + main_y + main_z /\ 1 <= main_x + main_z /\ 50001 + main_y + main_z <= 2*main_x /\ 50001 + main_y <= 2*main_x + main_z /\ 50001 <= main_y /\ 50001 + main_z <= main_y /\ 50001 <= main_y + main_z /\ 50001 <= main_z, {main_x -> main_x + main_y, main_y -> main_y + main_z, main_z -> 1 + main_z, rest remain the same}>
155.07/67.44	Variables:
155.07/67.44	main_x, main_y, main_z
155.07/67.44	Checking conditional termination of SCC {l2}...
155.07/67.44	
155.07/67.44	LOG: CALL solveLinear
155.07/67.44	
155.07/67.44	LOG: RETURN solveLinear - Elapsed time: 0.001349s
155.07/67.44	
155.07/67.44	LOG: CALL solveLinear
155.07/67.44	
155.07/67.44	LOG: RETURN solveLinear - Elapsed time: 0.065004s
155.07/67.44	[31894 : 31963]
155.07/67.44	[31894 : 31964]
155.07/67.44	Solving with 1 template(s).
155.07/67.44	
155.07/67.44	LOG: CALL solveNonLinearGetFirstSolution
155.07/67.44	
155.07/67.44	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.018015s
155.07/67.44	Time used: 0.017125
155.07/67.44	Improving Solution with cost 1 ...
155.07/67.44	
155.07/67.44	LOG: CALL solveNonLinearGetNextSolution
155.07/67.44	
155.07/67.44	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.026605s
155.07/67.44	Time used: 0.026599
155.07/67.44	
155.07/67.44	LOG: SAT solveNonLinear - Elapsed time: 0.044620s
155.07/67.44	Cost: 1; Total time: 0.043724
155.07/67.44	Quasi-ranking function: 50000 - main_x - main_y + 50002*main_z
155.07/67.44	New Graphs: 
155.07/67.44	Transitions:
155.07/67.44	<l2, l2, main_z <= main_x + main_y /\ 1 <= main_x /\ 1 <= main_x + main_y + main_z /\ 1 <= main_x + main_z /\ 50001 + 50002*main_z <= main_x + main_y /\ 50001 + main_y + main_z <= 2*main_x /\ 50001 + main_y <= 2*main_x + main_z /\ 50001 <= main_y /\ 50001 + main_z <= main_y /\ 50001 <= main_y + main_z /\ 50001 <= main_z, {main_x -> main_x + main_y, main_y -> main_y + main_z, main_z -> 1 + main_z, rest remain the same}>
155.07/67.44	Variables:
155.07/67.44	main_x, main_y, main_z
155.07/67.44	Checking conditional termination of SCC {l2}...
155.07/67.44	
155.07/67.44	LOG: CALL solveLinear
155.07/67.44	
155.07/67.44	LOG: RETURN solveLinear - Elapsed time: 0.001769s
155.07/67.44	
155.07/67.44	LOG: CALL solveLinear
155.07/67.44	
155.07/67.44	LOG: RETURN solveLinear - Elapsed time: 0.119915s
155.07/67.44	[31894 : 31968]
155.07/67.44	[31894 : 31969]
155.07/67.44	Solving with 1 template(s).
155.07/67.44	
155.07/67.44	LOG: CALL solveNonLinearGetFirstSolution
155.07/67.44	
155.07/67.44	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.022097s
155.07/67.44	Time used: 0.021142
155.07/67.44	Improving Solution with cost 1 ...
155.07/67.44	
155.07/67.44	LOG: CALL solveNonLinearGetNextSolution
155.07/67.44	
155.07/67.44	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.020716s
155.07/67.44	Time used: 0.020709
155.07/67.44	
155.07/67.44	LOG: SAT solveNonLinear - Elapsed time: 0.042813s
155.07/67.44	Cost: 1; Total time: 0.041851
155.07/67.44	Termination implied by a set of invariant(s):
155.07/67.44	Invariant at l2: 1 <= main_x
155.07/67.44	[ Invariant Graph ]
155.07/67.44	Strengthening and disabling transitions...
155.07/67.44	
155.07/67.44	LOG: CALL solverLinear in Graph for feasibility
155.07/67.44	
155.07/67.44	LOG: RETURN solveLinear in Graph for feasibility
155.07/67.44	Strengthening transition (result): 
155.07/67.44	<l2, l2, main_z <= main_x + main_y /\ 1 <= main_x /\ 1 <= main_x + main_y + main_z /\ 1 <= main_x + main_z /\ 1 <= main_z /\ main_z <= 1 + main_y, {main_x -> main_x + main_y, main_y -> main_y + main_z, main_z -> 1 + main_z, rest remain the same}>
155.07/67.44	[ Termination Graph ]
155.07/67.44	Strengthening and disabling transitions...
155.07/67.44	
155.07/67.44	LOG: CALL solverLinear in Graph for feasibility
155.07/67.44	
155.07/67.44	LOG: RETURN solveLinear in Graph for feasibility
155.07/67.44	Strengthening transition (result): 
155.07/67.44	<l2, l2, main_z <= main_x + main_y /\ 1 <= main_x /\ 1 <= main_x + main_y + main_z /\ 1 <= main_x + main_z /\ 50001 + 50002*main_z <= main_x + main_y /\ 50001 + main_y + main_z <= 2*main_x /\ 50001 + main_y <= 2*main_x + main_z /\ 50001 <= main_y /\ 50001 + main_z <= main_y /\ 50001 <= main_y + main_z /\ 50001 <= main_z, {main_x -> main_x + main_y, main_y -> main_y + main_z, main_z -> 1 + main_z, rest remain the same}>
155.07/67.44	Quasi-ranking function: 50000 - main_x - main_y - main_z
155.07/67.44	New Graphs: 
155.07/67.44	Transitions:
155.07/67.44	<l2, l2, main_z <= main_x + main_y /\ 1 <= main_x /\ 1 <= main_x + main_z /\ 50001 <= main_x + main_y + main_z /\ 50001 + 50002*main_z <= main_x + main_y /\ 50001 + main_y + main_z <= 2*main_x /\ 50001 + main_y <= 2*main_x + main_z /\ 50001 <= main_y /\ 50001 + main_z <= main_y /\ 50001 <= main_y + main_z /\ 50001 <= main_z, {main_x -> main_x + main_y, main_y -> main_y + main_z, main_z -> 1 + main_z, rest remain the same}>
155.07/67.44	Variables:
155.07/67.44	main_x, main_y, main_z
155.07/67.44	Checking conditional termination of SCC {l2}...
155.07/67.44	
155.07/67.44	LOG: CALL solveLinear
155.07/67.44	
155.07/67.44	LOG: RETURN solveLinear - Elapsed time: 0.001854s
155.07/67.44	
155.07/67.44	LOG: CALL solveLinear
155.07/67.44	
155.07/67.44	LOG: RETURN solveLinear - Elapsed time: 0.135115s
155.07/67.44	[31894 : 31973]
155.07/67.44	[31894 : 31974]
155.07/67.44	Solving with 1 template(s).
155.07/67.44	
155.07/67.44	LOG: CALL solveNonLinearGetFirstSolution
155.07/67.44	
155.07/67.44	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.027440s
155.07/67.44	Time used: 0.025872
155.07/67.44	Improving Solution with cost 1 ...
155.07/67.44	
155.07/67.44	LOG: CALL solveNonLinearGetNextSolution
155.07/67.44	
155.07/67.44	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.034494s
155.07/67.44	Time used: 0.034487
155.07/67.44	
155.07/67.44	LOG: SAT solveNonLinear - Elapsed time: 0.061934s
155.07/67.44	Cost: 1; Total time: 0.060359
155.07/67.44	Termination implied by a set of invariant(s):
155.07/67.44	Invariant at l2: 0 <= 1 + main_x
155.07/67.44	[ Invariant Graph ]
155.07/67.44	Strengthening and disabling transitions...
155.07/67.44	
155.07/67.44	LOG: CALL solverLinear in Graph for feasibility
155.07/67.44	
155.07/67.44	LOG: RETURN solveLinear in Graph for feasibility
155.07/67.44	Strengthening transition (result): 
155.07/67.44	<l2, l2, main_z <= main_x + main_y /\ 1 <= main_x /\ 1 <= main_x + main_y + main_z /\ 1 <= main_x + main_z /\ 1 <= main_z /\ main_z <= 1 + main_y, {main_x -> main_x + main_y, main_y -> main_y + main_z, main_z -> 1 + main_z, rest remain the same}>
155.07/67.44	[ Termination Graph ]
155.07/67.44	Strengthening and disabling transitions...
155.07/67.44	
155.07/67.44	LOG: CALL solverLinear in Graph for feasibility
155.07/67.44	
155.07/67.44	LOG: RETURN solveLinear in Graph for feasibility
155.07/67.44	Strengthening transition (result): 
155.07/67.44	<l2, l2, main_z <= main_x + main_y /\ 1 <= main_x /\ 1 <= main_x + main_z /\ 50001 <= main_x + main_y + main_z /\ 50001 + 50002*main_z <= main_x + main_y /\ 50001 + main_y + main_z <= 2*main_x /\ 50001 + main_y <= 2*main_x + main_z /\ 50001 <= main_y /\ 50001 + main_z <= main_y /\ 50001 <= main_y + main_z /\ 50001 <= main_z, {main_x -> main_x + main_y, main_y -> main_y + main_z, main_z -> 1 + main_z, rest remain the same}>
155.07/67.44	Quasi-ranking function: 50000 - main_x - main_y
155.07/67.44	New Graphs: 
155.07/67.44	Transitions:
155.07/67.44	<l2, l2, main_z <= main_x + main_y /\ 1 <= main_x /\ 1 <= main_x + main_z /\ 50001 <= main_x + main_y /\ 50001 <= main_x + main_y + main_z /\ 50001 + 50002*main_z <= main_x + main_y /\ 50001 + main_y + main_z <= 2*main_x /\ 50001 + main_y <= 2*main_x + main_z /\ 50001 <= main_y /\ 50001 + main_z <= main_y /\ 50001 <= main_y + main_z /\ 50001 <= main_z, {main_x -> main_x + main_y, main_y -> main_y + main_z, main_z -> 1 + main_z, rest remain the same}>
155.07/67.44	Variables:
155.07/67.44	main_x, main_y, main_z
155.07/67.44	Checking conditional termination of SCC {l2}...
155.07/67.44	
155.07/67.44	LOG: CALL solveLinear
155.07/67.44	
155.07/67.44	LOG: RETURN solveLinear - Elapsed time: 0.001701s
155.07/67.44	
155.07/67.44	LOG: CALL solveLinear
155.07/67.44	
155.07/67.44	LOG: RETURN solveLinear - Elapsed time: 0.142746s
155.07/67.44	[31894 : 31978]
155.07/67.44	[31894 : 31979]
155.07/67.44	Solving with 1 template(s).
155.07/67.44	
155.07/67.44	LOG: CALL solveNonLinearGetFirstSolution
155.07/67.44	
155.07/67.44	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.028184s
155.07/67.44	Time used: 0.026804
155.07/67.44	Improving Solution with cost 1 ...
155.07/67.44	
155.07/67.44	LOG: CALL solveNonLinearGetNextSolution
155.07/67.44	
155.07/67.44	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.044273s
155.07/67.44	Time used: 0.044266
155.07/67.44	
155.07/67.44	LOG: SAT solveNonLinear - Elapsed time: 0.072457s
155.07/67.44	Cost: 1; Total time: 0.07107
155.07/67.44	Termination implied by a set of invariant(s):
155.07/67.44	Invariant at l2: 0 <= main_x + main_y + main_z
155.07/67.44	[ Invariant Graph ]
155.07/67.44	Strengthening and disabling transitions...
155.07/67.44	
155.07/67.44	LOG: CALL solverLinear in Graph for feasibility
155.07/67.44	
155.07/67.44	LOG: RETURN solveLinear in Graph for feasibility
155.07/67.44	Strengthening transition (result): 
155.07/67.44	<l2, l2, main_z <= main_x + main_y /\ 1 <= main_x /\ 1 <= main_x + main_y + main_z /\ 1 <= main_x + main_z /\ 1 <= main_z /\ main_z <= 1 + main_y, {main_x -> main_x + main_y, main_y -> main_y + main_z, main_z -> 1 + main_z, rest remain the same}>
155.07/67.44	[ Termination Graph ]
155.07/67.44	Strengthening and disabling transitions...
155.07/67.44	
155.07/67.44	LOG: CALL solverLinear in Graph for feasibility
155.07/67.44	
155.07/67.44	LOG: RETURN solveLinear in Graph for feasibility
155.07/67.44	Strengthening transition (result): 
155.07/67.44	<l2, l2, main_z <= main_x + main_y /\ 1 <= main_x /\ 1 <= main_x + main_z /\ 50001 <= main_x + main_y /\ 50001 <= main_x + main_y + main_z /\ 50001 + 50002*main_z <= main_x + main_y /\ 50001 + main_y + main_z <= 2*main_x /\ 50001 + main_y <= 2*main_x + main_z /\ 50001 <= main_y /\ 50001 + main_z <= main_y /\ 50001 <= main_y + main_z /\ 50001 <= main_z, {main_x -> main_x + main_y, main_y -> main_y + main_z, main_z -> 1 + main_z, rest remain the same}>
155.07/67.44	Quasi-ranking function: 50000 - main_x + main_z
155.07/67.44	New Graphs: 
155.07/67.44	Transitions:
155.07/67.44	<l2, l2, main_z <= main_x + main_y /\ 1 <= main_x /\ 1 <= main_x + main_z /\ 50001 <= main_x + main_y /\ 50001 <= main_x + main_y + main_z /\ 50001 + 50002*main_z <= main_x + main_y /\ 50001 + main_z <= main_x /\ 50001 + main_y + main_z <= 2*main_x /\ 50001 + main_y <= 2*main_x + main_z /\ 50001 <= main_y /\ 50001 + main_z <= main_y /\ 50001 <= main_y + main_z /\ 50001 <= main_z, {main_x -> main_x + main_y, main_y -> main_y + main_z, main_z -> 1 + main_z, rest remain the same}>
155.07/67.44	Variables:
155.07/67.44	main_x, main_y, main_z
155.07/67.44	Checking conditional termination of SCC {l2}...
155.07/67.44	
155.07/67.44	LOG: CALL solveLinear
155.07/67.44	
155.07/67.44	LOG: RETURN solveLinear - Elapsed time: 0.001828s
155.07/67.44	
155.07/67.44	LOG: CALL solveLinear
155.07/67.44	
155.07/67.44	LOG: RETURN solveLinear - Elapsed time: 0.129070s
155.07/67.44	[31894 : 31983]
155.07/67.44	[31894 : 31984]
155.07/67.44	Solving with 1 template(s).
155.07/67.44	
155.07/67.44	LOG: CALL solveNonLinearGetFirstSolution
155.07/67.44	
155.07/67.44	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.027912s
155.07/67.44	Time used: 0.026379
155.07/67.44	Improving Solution with cost 1 ...
155.07/67.44	
155.07/67.44	LOG: CALL solveNonLinearGetNextSolution
155.07/67.44	
155.07/67.44	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.031577s
155.07/67.44	Time used: 0.031571
155.07/67.44	
155.07/67.44	LOG: SAT solveNonLinear - Elapsed time: 0.059489s
155.07/67.44	Cost: 1; Total time: 0.05795
155.07/67.44	Termination implied by a set of invariant(s):
155.07/67.44	Invariant at l2: 1 <= main_x + main_y + main_z
155.07/67.44	[ Invariant Graph ]
155.07/67.44	Strengthening and disabling transitions...
155.07/67.44	
155.07/67.44	LOG: CALL solverLinear in Graph for feasibility
155.07/67.44	
155.07/67.44	LOG: RETURN solveLinear in Graph for feasibility
155.07/67.44	Strengthening transition (result): 
155.07/67.44	<l2, l2, main_z <= main_x + main_y /\ 1 <= main_x /\ 1 <= main_x + main_y + main_z /\ 1 <= main_x + main_z /\ 1 <= main_z /\ main_z <= 1 + main_y, {main_x -> main_x + main_y, main_y -> main_y + main_z, main_z -> 1 + main_z, rest remain the same}>
155.07/67.44	[ Termination Graph ]
155.07/67.44	Strengthening and disabling transitions...
155.07/67.44	
155.07/67.44	LOG: CALL solverLinear in Graph for feasibility
155.07/67.44	
155.07/67.44	LOG: RETURN solveLinear in Graph for feasibility
155.07/67.44	Strengthening transition (result): 
155.07/67.44	<l2, l2, main_z <= main_x + main_y /\ 1 <= main_x /\ 1 <= main_x + main_z /\ 50001 <= main_x + main_y /\ 50001 <= main_x + main_y + main_z /\ 50001 + 50002*main_z <= main_x + main_y /\ 50001 + main_z <= main_x /\ 50001 + main_y + main_z <= 2*main_x /\ 50001 + main_y <= 2*main_x + main_z /\ 50001 <= main_y /\ 50001 + main_z <= main_y /\ 50001 <= main_y + main_z /\ 50001 <= main_z, {main_x -> main_x + main_y, main_y -> main_y + main_z, main_z -> 1 + main_z, rest remain the same}>
155.07/67.44	Quasi-ranking function: 50000 - main_x
155.07/67.44	New Graphs: 
155.07/67.44	Transitions:
155.07/67.44	<l2, l2, main_z <= main_x + main_y /\ 1 <= main_x + main_z /\ 50001 <= main_x /\ 50001 <= main_x + main_y /\ 50001 <= main_x + main_y + main_z /\ 50001 + 50002*main_z <= main_x + main_y /\ 50001 + main_z <= main_x /\ 50001 + main_y + main_z <= 2*main_x /\ 50001 + main_y <= 2*main_x + main_z /\ 50001 <= main_y /\ 50001 + main_z <= main_y /\ 50001 <= main_y + main_z /\ 50001 <= main_z, {main_x -> main_x + main_y, main_y -> main_y + main_z, main_z -> 1 + main_z, rest remain the same}>
155.07/67.44	Variables:
155.07/67.44	main_x, main_y, main_z
155.07/67.44	Checking conditional termination of SCC {l2}...
155.07/67.44	
155.07/67.44	LOG: CALL solveLinear
155.07/67.44	
155.07/67.44	LOG: RETURN solveLinear - Elapsed time: 0.002012s
155.07/67.44	
155.07/67.44	LOG: CALL solveLinear
155.07/67.44	
155.07/67.44	LOG: RETURN solveLinear - Elapsed time: 0.226431s
155.07/67.44	[31894 : 32141]
155.07/67.44	[31894 : 32142]
155.07/67.44	Solving with 1 template(s).
155.07/67.44	
155.07/67.44	LOG: CALL solveNonLinearGetFirstSolution
155.07/67.44	
155.07/67.44	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.031214s
155.07/67.44	Time used: 0.029725
155.07/67.44	Improving Solution with cost 1 ...
155.07/67.44	
155.07/67.44	LOG: CALL solveNonLinearGetNextSolution
155.07/67.44	
155.07/67.44	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.027807s
155.07/67.44	Time used: 0.0278
155.07/67.44	
155.07/67.44	LOG: SAT solveNonLinear - Elapsed time: 0.059021s
155.07/67.44	Cost: 1; Total time: 0.057525
155.07/67.44	Termination implied by a set of invariant(s):
155.07/67.44	Invariant at l2: 0 <= main_x + main_y + main_z
155.07/67.44	[ Invariant Graph ]
155.07/67.44	Strengthening and disabling transitions...
155.07/67.44	
155.07/67.44	LOG: CALL solverLinear in Graph for feasibility
155.07/67.44	
155.07/67.44	LOG: RETURN solveLinear in Graph for feasibility
155.07/67.44	Strengthening transition (result): 
155.07/67.44	<l2, l2, main_z <= main_x + main_y /\ 1 <= main_x /\ 1 <= main_x + main_y + main_z /\ 1 <= main_x + main_z /\ 1 <= main_z /\ main_z <= 1 + main_y, {main_x -> main_x + main_y, main_y -> main_y + main_z, main_z -> 1 + main_z, rest remain the same}>
155.07/67.44	[ Termination Graph ]
155.07/67.44	Strengthening and disabling transitions...
155.07/67.44	
155.07/67.44	LOG: CALL solverLinear in Graph for feasibility
155.07/67.44	
155.07/67.44	LOG: RETURN solveLinear in Graph for feasibility
155.07/67.44	Strengthening transition (result): 
155.07/67.44	<l2, l2, main_z <= main_x + main_y /\ 1 <= main_x + main_z /\ 50001 <= main_x /\ 50001 <= main_x + main_y /\ 50001 <= main_x + main_y + main_z /\ 50001 + 50002*main_z <= main_x + main_y /\ 50001 + main_z <= main_x /\ 50001 + main_y + main_z <= 2*main_x /\ 50001 + main_y <= 2*main_x + main_z /\ 50001 <= main_y /\ 50001 + main_z <= main_y /\ 50001 <= main_y + main_z /\ 50001 <= main_z, {main_x -> main_x + main_y, main_y -> main_y + main_z, main_z -> 1 + main_z, rest remain the same}>
155.07/67.44	Quasi-ranking function: 50000 - main_x - main_z
155.07/67.44	New Graphs: 
155.07/67.44	Transitions:
155.07/67.44	<l2, l2, main_z <= main_x + main_y /\ 50001 <= main_x /\ 50001 <= main_x + main_y /\ 50001 <= main_x + main_y + main_z /\ 50001 + 50002*main_z <= main_x + main_y /\ 50001 + main_z <= main_x /\ 50001 <= main_x + main_z /\ 50001 + main_y + main_z <= 2*main_x /\ 50001 + main_y <= 2*main_x + main_z /\ 50001 <= main_y /\ 50001 + main_z <= main_y /\ 50001 <= main_y + main_z /\ 50001 <= main_z, {main_x -> main_x + main_y, main_y -> main_y + main_z, main_z -> 1 + main_z, rest remain the same}>
155.07/67.44	Variables:
155.07/67.44	main_x, main_y, main_z
155.07/67.44	Checking conditional termination of SCC {l2}...
155.07/67.44	
155.07/67.44	LOG: CALL solveLinear
155.07/67.44	
155.07/67.44	LOG: RETURN solveLinear - Elapsed time: 0.002823s
155.07/67.44	
155.07/67.44	LOG: CALL solveLinear
155.07/67.44	
155.07/67.44	LOG: RETURN solveLinear - Elapsed time: 0.127878s
155.07/67.44	[31894 : 32147]
155.07/67.44	[31894 : 32148]
155.07/67.44	Solving with 1 template(s).
155.07/67.44	
155.07/67.44	LOG: CALL solveNonLinearGetFirstSolution
155.07/67.44	
155.07/67.44	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.024534s
155.07/67.44	Time used: 0.023371
155.07/67.44	Improving Solution with cost 1 ...
155.07/67.44	
155.07/67.44	LOG: CALL solveNonLinearGetNextSolution
155.07/67.44	
155.07/67.44	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.026303s
155.07/67.44	Time used: 0.026293
155.07/67.44	
155.07/67.44	LOG: SAT solveNonLinear - Elapsed time: 0.050837s
155.07/67.44	Cost: 1; Total time: 0.049664
155.07/67.44	Termination implied by a set of invariant(s):
155.07/67.44	Invariant at l2: 0 <= main_x + main_y + main_z
155.07/67.44	[ Invariant Graph ]
155.07/67.44	Strengthening and disabling transitions...
155.07/67.44	
155.07/67.44	LOG: CALL solverLinear in Graph for feasibility
155.07/67.44	
155.07/67.44	LOG: RETURN solveLinear in Graph for feasibility
155.07/67.44	Strengthening transition (result): 
155.07/67.44	<l2, l2, main_z <= main_x + main_y /\ 1 <= main_x /\ 1 <= main_x + main_y + main_z /\ 1 <= main_x + main_z /\ 1 <= main_z /\ main_z <= 1 + main_y, {main_x -> main_x + main_y, main_y -> main_y + main_z, main_z -> 1 + main_z, rest remain the same}>
155.07/67.44	[ Termination Graph ]
155.07/67.44	Strengthening and disabling transitions...
155.07/67.44	
155.07/67.44	LOG: CALL solverLinear in Graph for feasibility
155.07/67.44	
155.07/67.44	LOG: RETURN solveLinear in Graph for feasibility
155.07/67.44	Strengthening transition (result): 
155.07/67.44	<l2, l2, main_z <= main_x + main_y /\ 50001 <= main_x /\ 50001 <= main_x + main_y /\ 50001 <= main_x + main_y + main_z /\ 50001 + 50002*main_z <= main_x + main_y /\ 50001 + main_z <= main_x /\ 50001 <= main_x + main_z /\ 50001 + main_y + main_z <= 2*main_x /\ 50001 + main_y <= 2*main_x + main_z /\ 50001 <= main_y /\ 50001 + main_z <= main_y /\ 50001 <= main_y + main_z /\ 50001 <= main_z, {main_x -> main_x + main_y, main_y -> main_y + main_z, main_z -> 1 + main_z, rest remain the same}>
155.07/67.44	Quasi-ranking function: 50000 - main_x + main_y
155.07/67.44	New Graphs: 
155.07/67.44	Transitions:
155.07/67.44	<l2, l2, main_z <= main_x + main_y /\ 50001 <= main_x /\ 50001 + main_y <= main_x /\ 50001 <= main_x + main_y /\ 50001 <= main_x + main_y + main_z /\ 50001 + 50002*main_z <= main_x + main_y /\ 50001 + main_z <= main_x /\ 50001 <= main_x + main_z /\ 50001 + main_y + main_z <= 2*main_x /\ 50001 + main_y <= 2*main_x + main_z /\ 50001 <= main_y /\ 50001 + main_z <= main_y /\ 50001 <= main_y + main_z /\ 50001 <= main_z, {main_x -> main_x + main_y, main_y -> main_y + main_z, main_z -> 1 + main_z, rest remain the same}>
155.07/67.44	Variables:
155.07/67.44	main_x, main_y, main_z
155.07/67.44	Checking conditional termination of SCC {l2}...
155.07/67.44	
155.07/67.44	LOG: CALL solveLinear
155.07/67.44	
155.07/67.44	LOG: RETURN solveLinear - Elapsed time: 0.001991s
155.07/67.44	
155.07/67.44	LOG: CALL solveLinear
155.07/67.44	
155.07/67.44	LOG: RETURN solveLinear - Elapsed time: 0.171005s
155.07/67.44	[31894 : 32152]
155.07/67.44	[31894 : 32153]
155.07/67.44	Solving with 1 template(s).
155.07/67.44	
155.07/67.44	LOG: CALL solveNonLinearGetFirstSolution
155.07/67.44	
155.07/67.44	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.030795s
155.07/67.44	Time used: 0.029319
155.07/67.44	
155.07/67.44	[31894 : 32159]
155.07/67.44	[31894 : 32163]
155.07/67.44	Successful child: 32163
155.07/67.44	
155.07/67.44	Program does NOT terminate
155.07/67.44	EOF