21.16/8.02	YES
21.16/8.02	
21.16/8.02	Solver Timeout: 4
21.16/8.02	Global Timeout: 300
21.16/8.02	Maximum number of concurrent processes: 900
21.16/8.02	*******************************************************************************************
21.16/8.02	*********************** UNPROCESSED TRANSITION SYSTEMS PER FUNCTION ***********************
21.16/8.02	*******************************************************************************************
21.16/8.02	
21.16/8.02	
21.16/8.02	List of LLVMGraphs + assumeNodes + staticAssertNodes [1] :
21.16/8.02	
21.16/8.02	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
21.16/8.02	+                                                                  +
21.16/8.02	Init Location: 0
21.16/8.02	Transitions:
21.16/8.02	<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)}>
21.16/8.02	<l1, l2, true>
21.16/8.02	<l2, l5, not((main_x > 0))>
21.16/8.02	<l2, l3, (main_x > 0)>
21.16/8.02	<l3, l4, true, seq{main_x -> (main_x + main_y), main_y -> (main_y + main_z), main_z -> (main_z - 1)}>
21.16/8.02	<l4, l2, true>
21.16/8.02	<l5, l6, true, seq{main__func_return_ -> 0}>
21.16/8.02	
21.16/8.02	Fresh variables:
21.16/8.02	
21.16/8.02	Undef variables:
21.16/8.02	
21.16/8.02	Abstraction variables:
21.16/8.02	
21.16/8.02	Exit nodes:
21.16/8.02	
21.16/8.02	Accepting locations:
21.16/8.02	
21.16/8.02	Asserts:
21.16/8.02	
21.16/8.02	+ Assume Nodes [0]: ++++++++++++++++++++++++++++++++++++++++++++++++
21.16/8.02	       
21.16/8.02	+ Static Assert Nodes [0]: +++++++++++++++++++++++++++++++++++++++++
21.16/8.02	       
21.16/8.02	+ After preprocess (paralelization): ++++++++++++++++++++++++++++++
21.16/8.02	
21.16/8.02	Init Location: 0
21.16/8.02	Transitions:
21.16/8.02	<l0, l7, true, seq{main__func_return_ -> 0}>
21.16/8.02	<l7, l8, true, seq{varCall_1 -> ¿functionCall(__VERIFIER_nondet_int)}>
21.16/8.02	<l8, l9, true, seq{main_x -> varCall_1}>
21.16/8.02	<l9, l10, true, seq{varCall_2 -> ¿functionCall(__VERIFIER_nondet_int)}>
21.16/8.02	<l10, l11, true, seq{main_y -> varCall_2}>
21.16/8.02	<l11, l12, true, seq{varCall_3 -> ¿functionCall(__VERIFIER_nondet_int)}>
21.16/8.02	<l12, l1, true, seq{main_z -> varCall_3}>
21.16/8.02	<l1, l2, true>
21.16/8.02	<l2, l3, (main_x > 0)>
21.16/8.02	<l2, l5, not((main_x > 0))>
21.16/8.02	<l3, l4, true, seq{main_x -> (main_x + main_y), main_y -> (main_y + main_z), main_z -> (main_z - 1)}>
21.16/8.02	<l4, l2, true>
21.16/8.02	<l5, l6, true, seq{main__func_return_ -> 0}>
21.16/8.02	
21.16/8.02	Fresh variables:
21.16/8.02	
21.16/8.02	Undef variables:
21.16/8.02	
21.16/8.02	Abstraction variables:
21.16/8.02	
21.16/8.02	Exit nodes:
21.16/8.02	6, 
21.16/8.02	Accepting locations:
21.16/8.02	
21.16/8.02	Asserts:
21.16/8.02	
21.16/8.02	+                                                                  +
21.16/8.02	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
21.16/8.02	
21.16/8.02	
21.16/8.02	Function Return and Parameters Information [2 functions]:
21.16/8.02	    function name: __VERIFIER_nondet_int [1 return + 0 parameters]        demangled: __VERIFIER_nondet_int
21.16/8.02	        __VERIFIER_nondet_int__func_return_      [function result] : int
21.16/8.02	    function name: main [1 return + 0 parameters]        demangled: main
21.16/8.02	        main__func_return_      [function result] : int
21.16/8.02	
21.16/8.02	
21.16/8.02	AST Ident Scanner Information [5 idents]:
21.16/8.02	__VERIFIER_nondet_int | function | [integer, ()] | <line: 20, col: 1> | <line: 24, col: 9> <line: 25, col: 9> <line: 26, col: 9>
21.16/8.02	main | function | [integer, ()] | <line: 22, col: 1>
21.16/8.02	x | local variable | integer | <line: 23, col: 5> | <line: 24, col: 5> <line: 27, col: 12> <line: 28, col: 9> <line: 28, col: 13>
21.16/8.02	y | local variable | integer | <line: 23, col: 5> | <line: 25, col: 5> <line: 28, col: 17> <line: 29, col: 9> <line: 29, col: 13>
21.16/8.02	z | local variable | integer | <line: 23, col: 5> | <line: 26, col: 5> <line: 29, col: 17> <line: 30, col: 9> <line: 30, col: 13>
21.16/8.02	
21.16/8.02	Main function: main
21.16/8.02	Preprocessed LLVMGraph
21.16/8.02	Init Location: 0
21.16/8.02	Transitions:
21.16/8.02	<l0, l2, (main_x = undef4) /\ (main_y = undef5) /\ (main_z = undef6)>
21.16/8.02	<l2, l2, (main_x > 0), par{main_x -> (main_x + main_y), main_y -> (main_y + main_z), main_z -> (main_z - 1)}>
21.16/8.02	<l2, l6, not((main_x > 0))>
21.16/8.02	
21.16/8.02	Fresh variables:
21.16/8.02	undef4, undef5, undef6, 
21.16/8.02	
21.16/8.02	Undef variables:
21.16/8.02	undef4, undef5, undef6, 
21.16/8.02	
21.16/8.02	Abstraction variables:
21.16/8.02	
21.16/8.02	Exit nodes:
21.16/8.02	6, 
21.16/8.02	Accepting locations:
21.16/8.02	
21.16/8.02	Asserts:
21.16/8.02	
21.16/8.02	*************************************************************
21.16/8.02	*******************************************************************************************
21.16/8.02	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
21.16/8.02	*******************************************************************************************
21.16/8.02	
21.16/8.02	Init Location: 0
21.16/8.02	Graph 0:
21.16/8.02	Transitions:
21.16/8.02	Variables:
21.16/8.02	
21.16/8.02	Graph 1:
21.16/8.02	Transitions:
21.16/8.02	<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}>
21.16/8.02	Variables:
21.16/8.02	main_x, main_y, main_z
21.16/8.02	
21.16/8.02	Graph 2:
21.16/8.02	Transitions:
21.16/8.02	Variables:
21.16/8.02	
21.16/8.02	Precedence: 
21.16/8.02	Graph 0
21.16/8.02	
21.16/8.02	Graph 1
21.16/8.02	<l0, l2, main_x = undef4 /\ main_y = undef5 /\ main_z = undef6, {all remain the same}>
21.16/8.02	
21.16/8.02	Graph 2
21.16/8.02	<l2, l6, main_x <= 0, {all remain the same}>
21.16/8.02	
21.16/8.02	Map Locations to Subgraph:
21.16/8.02	( 0 , 0 )
21.16/8.02	( 2 , 1 )
21.16/8.02	( 6 , 2 )
21.16/8.02	
21.16/8.02	*******************************************************************************************
21.16/8.02	********************************    CHECKING ASSERTIONS    ********************************
21.16/8.02	*******************************************************************************************
21.16/8.02	
21.16/8.02	Proving termination of subgraph 0
21.16/8.02	Proving termination of subgraph 1
21.16/8.02	Checking unfeasibility...
21.16/8.02	Time used: 0.002429
21.16/8.02	
21.16/8.02	Checking conditional termination of SCC {l2}...
21.16/8.02	
21.16/8.02	LOG: CALL solveLinear
21.16/8.02	
21.16/8.02	LOG: RETURN solveLinear - Elapsed time: 0.000562s
21.16/8.02	
21.16/8.02	LOG: CALL solveLinear
21.16/8.02	
21.16/8.02	LOG: RETURN solveLinear - Elapsed time: 0.001637s
21.16/8.02	[14129 : 14131]
21.16/8.02	[14129 : 14132]
21.16/8.02	Successful child: 14131
21.16/8.02	[ Invariant Graph ]
21.16/8.02	Strengthening and disabling transitions...
21.16/8.02	
21.16/8.02	LOG: CALL solverLinear in Graph for feasibility
21.16/8.02	
21.16/8.02	LOG: RETURN solveLinear in Graph for feasibility
21.16/8.02	It's unfeasible. Removing transition: 
21.16/8.02	<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}>
21.16/8.02	[ Termination Graph ]
21.16/8.02	Strengthening and disabling transitions...
21.16/8.02	> It's unfeasible. Removing transition: 
21.16/8.02	<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}>
21.16/8.02	New Graphs: 
21.16/8.02	
21.16/8.02	LOG: CALL check - Post:1 + main_x <= 0 - Process 1
21.16/8.02	* Exit transition: <l0, l2, main_x = undef4 /\ main_y = undef5 /\ main_z = undef6, {all remain the same}>
21.16/8.02	* Postcondition  : 1 + main_x <= 0
21.16/8.02	
21.16/8.02	LOG: CALL solveLinear
21.16/8.02	
21.16/8.02	LOG: RETURN solveLinear - Elapsed time: 0.000559s
21.16/8.02	> Postcondition is not implied!
21.16/8.02	
21.16/8.02	LOG: RETURN check - Elapsed time: 0.000659s
21.16/8.02	INVARIANTS: 
21.16/8.02	2: 
21.16/8.02	Quasi-INVARIANTS to narrow Graph: 
21.16/8.02	2: 1 + main_x <= 0 , 
21.16/8.02	Narrowing transition: 
21.16/8.02	<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}>
21.16/8.02	
21.16/8.02	LOG: Narrow transition size 1
21.16/8.02	invGraph after Narrowing: 
21.16/8.02	Transitions:
21.16/8.02	<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}>
21.16/8.02	Variables:
21.16/8.02	main_x, main_y, main_z
21.16/8.02	Checking conditional termination of SCC {l2}...
21.16/8.02	
21.16/8.02	LOG: CALL solveLinear
21.16/8.02	
21.16/8.02	LOG: RETURN solveLinear - Elapsed time: 0.000517s
21.16/8.02	
21.16/8.02	LOG: CALL solveLinear
21.16/8.02	
21.16/8.02	LOG: RETURN solveLinear - Elapsed time: 0.001759s
21.16/8.02	[14129 : 14136]
21.16/8.02	[14129 : 14137]
21.16/8.02	Successful child: 14136
21.16/8.02	[ Invariant Graph ]
21.16/8.02	Strengthening and disabling transitions...
21.16/8.02	
21.16/8.02	LOG: CALL solverLinear in Graph for feasibility
21.16/8.02	
21.16/8.02	LOG: RETURN solveLinear in Graph for feasibility
21.16/8.02	It's unfeasible. Removing transition: 
21.16/8.02	<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}>
21.16/8.02	[ Termination Graph ]
21.16/8.02	Strengthening and disabling transitions...
21.16/8.02	
21.16/8.02	LOG: CALL solverLinear in Graph for feasibility
21.16/8.02	
21.16/8.02	LOG: RETURN solveLinear in Graph for feasibility
21.16/8.02	It's unfeasible. Removing transition: 
21.16/8.02	<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}>
21.16/8.02	New Graphs: 
21.16/8.02	
21.16/8.02	LOG: CALL check - Post:main_x <= 0 - Process 2
21.16/8.02	* Exit transition: <l0, l2, 0 <= main_x /\ main_x = undef4 /\ main_y = undef5 /\ main_z = undef6, {all remain the same}>
21.16/8.02	* Postcondition  : main_x <= 0
21.16/8.02	
21.16/8.02	LOG: CALL solveLinear
21.16/8.02	
21.16/8.02	LOG: RETURN solveLinear - Elapsed time: 0.000657s
21.16/8.02	> Postcondition is not implied!
21.16/8.02	
21.16/8.02	LOG: RETURN check - Elapsed time: 0.000760s
21.16/8.02	INVARIANTS: 
21.16/8.02	2: 
21.16/8.02	Quasi-INVARIANTS to narrow Graph: 
21.16/8.02	2: main_x <= 0 , 
21.16/8.02	Narrowing transition: 
21.16/8.02	<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}>
21.16/8.02	
21.16/8.02	LOG: Narrow transition size 1
21.16/8.02	invGraph after Narrowing: 
21.16/8.02	Transitions:
21.16/8.02	<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}>
21.16/8.02	Variables:
21.16/8.02	main_x, main_y, main_z
21.16/8.02	Checking conditional termination of SCC {l2}...
21.16/8.02	
21.16/8.02	LOG: CALL solveLinear
21.16/8.02	
21.16/8.02	LOG: RETURN solveLinear - Elapsed time: 0.000503s
21.16/8.02	
21.16/8.02	LOG: CALL solveLinear
21.16/8.02	
21.16/8.02	LOG: RETURN solveLinear - Elapsed time: 0.001756s
21.16/8.02	[14129 : 14141]
21.16/8.02	[14129 : 14142]
21.16/8.02	Successful child: 14141
21.16/8.02	[ Invariant Graph ]
21.16/8.02	Strengthening and disabling transitions...
21.16/8.02	
21.16/8.02	LOG: CALL solverLinear in Graph for feasibility
21.16/8.02	
21.16/8.02	LOG: RETURN solveLinear in Graph for feasibility
21.16/8.02	Strengthening transition (result): 
21.16/8.02	<l2, l2, main_x + main_y <= main_z /\ main_z <= 0 /\ 1 <= main_x, {main_x -> main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}>
21.16/8.02	[ Termination Graph ]
21.16/8.02	Strengthening and disabling transitions...
21.16/8.02	
21.16/8.02	LOG: CALL solverLinear in Graph for feasibility
21.16/8.02	
21.16/8.02	LOG: RETURN solveLinear in Graph for feasibility
21.16/8.02	Strengthening transition (result): 
21.16/8.02	<l2, l2, main_x + main_y <= main_z /\ main_z <= 0 /\ 1 <= main_x, {main_x -> main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}>
21.16/8.02	Ranking function: 2*main_x - main_z
21.16/8.02	New Graphs: 
21.16/8.02	[14129 : 14146]
21.16/8.02	[14129 : 14147]
21.16/8.02	INVARIANTS: 
21.16/8.02	2: 
21.16/8.02	Quasi-INVARIANTS to narrow Graph: 
21.16/8.02	2: main_x + main_y <= main_z , main_z <= 0 , 
21.16/8.02	Narrowing transition: 
21.16/8.02	<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}>
21.16/8.02	
21.16/8.02	LOG: Narrow transition size 2
21.16/8.02	invGraph after Narrowing: 
21.16/8.02	Transitions:
21.16/8.02	<l2, l2, main_x + main_y <= main_z /\ 1 <= main_x /\ 1 <= main_z, {main_x -> main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}>
21.16/8.02	<l2, l2, 1 <= main_x /\ 1 + 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}>
21.16/8.02	Variables:
21.16/8.02	main_x, main_y, main_z
21.16/8.02	Checking conditional termination of SCC {l2}...
21.16/8.02	
21.16/8.02	LOG: CALL solveLinear
21.16/8.02	
21.16/8.02	LOG: RETURN solveLinear - Elapsed time: 0.001553s
21.16/8.02	Ranking function: main_z
21.16/8.02	New Graphs: 
21.16/8.02	Transitions:
21.16/8.02	<l2, l2, 1 <= main_x /\ 1 + 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}>
21.16/8.02	Variables:
21.16/8.02	main_x, main_y, main_z
21.16/8.02	Checking conditional termination of SCC {l2}...
21.16/8.02	
21.16/8.02	LOG: CALL solveLinear
21.16/8.02	
21.16/8.02	LOG: RETURN solveLinear - Elapsed time: 0.000620s
21.16/8.02	
21.16/8.02	LOG: CALL solveLinear
21.16/8.02	
21.16/8.02	LOG: RETURN solveLinear - Elapsed time: 0.002378s
21.16/8.02	[14129 : 14148]
21.16/8.02	[14129 : 14149]
21.16/8.02	Successful child: 14148
21.16/8.02	[ Invariant Graph ]
21.16/8.02	Strengthening and disabling transitions...
21.16/8.02	
21.16/8.02	LOG: CALL solverLinear in Graph for feasibility
21.16/8.02	
21.16/8.02	LOG: RETURN solveLinear in Graph for feasibility
21.16/8.02	Strengthening transition (result): 
21.16/8.02	<l2, l2, main_x + main_y <= main_z /\ 1 + main_x + main_y + main_z <= 0 /\ 1 <= main_x /\ 1 <= main_z, {main_x -> main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}>
21.16/8.02	
21.16/8.02	LOG: CALL solverLinear in Graph for feasibility
21.16/8.02	
21.16/8.02	LOG: RETURN solveLinear in Graph for feasibility
21.16/8.02	Strengthening transition (result): 
21.16/8.02	<l2, l2, 1 + main_x + main_y + main_z <= 0 /\ 1 <= main_x /\ 1 + 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}>
21.16/8.02	[ Termination Graph ]
21.16/8.02	Strengthening and disabling transitions...
21.16/8.02	
21.16/8.02	LOG: CALL solverLinear in Graph for feasibility
21.16/8.02	
21.16/8.02	LOG: RETURN solveLinear in Graph for feasibility
21.16/8.02	Strengthening transition (result): 
21.16/8.02	<l2, l2, 1 + main_x + main_y + main_z <= 0 /\ 1 <= main_x /\ 1 + 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}>
21.16/8.02	Ranking function: 2 + main_x + main_y - main_z
21.16/8.02	New Graphs: 
21.16/8.02	[14129 : 14153]
21.16/8.02	[14129 : 14154]
21.16/8.02	INVARIANTS: 
21.16/8.02	2: 
21.16/8.02	Quasi-INVARIANTS to narrow Graph: 
21.16/8.02	2: 1 + main_x + main_y + main_z <= 0 , 
21.16/8.02	Narrowing transition: 
21.16/8.02	<l2, l2, main_x + main_y <= main_z /\ 1 <= main_x /\ 1 <= main_z, {main_x -> main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}>
21.16/8.02	
21.16/8.02	LOG: Narrow transition size 1
21.16/8.02	Narrowing transition: 
21.16/8.02	<l2, l2, 1 <= main_x /\ 1 + 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}>
21.16/8.02	
21.16/8.02	LOG: Narrow transition size 1
21.16/8.02	invGraph after Narrowing: 
21.16/8.02	Transitions:
21.16/8.02	<l2, l2, main_x + main_y <= main_z /\ 0 <= main_x + main_y + main_z /\ 1 <= main_x /\ 1 <= main_z, {main_x -> main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}>
21.16/8.02	<l2, l2, 0 <= main_x + main_y + main_z /\ 1 <= main_x /\ 1 + 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}>
21.16/8.02	Variables:
21.16/8.02	main_x, main_y, main_z
21.16/8.02	Checking conditional termination of SCC {l2}...
21.16/8.02	
21.16/8.02	LOG: CALL solveLinear
21.16/8.02	
21.16/8.02	LOG: RETURN solveLinear - Elapsed time: 0.001823s
21.16/8.02	Ranking function: 1 + main_z
21.16/8.02	New Graphs: 
21.16/8.02	Transitions:
21.16/8.02	<l2, l2, 0 <= main_x + main_y + main_z /\ 1 <= main_x /\ 1 + 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}>
21.16/8.02	Variables:
21.16/8.02	main_x, main_y, main_z
21.16/8.02	Checking conditional termination of SCC {l2}...
21.16/8.02	
21.16/8.02	LOG: CALL solveLinear
21.16/8.02	
21.16/8.02	LOG: RETURN solveLinear - Elapsed time: 0.000708s
21.16/8.02	
21.16/8.02	LOG: CALL solveLinear
21.16/8.02	
21.16/8.02	LOG: RETURN solveLinear - Elapsed time: 0.003194s
21.16/8.02	[14129 : 14155]
21.16/8.02	[14129 : 14156]
21.16/8.02	Successful child: 14155
21.16/8.02	[ Invariant Graph ]
21.16/8.02	Strengthening and disabling transitions...
21.16/8.02	
21.16/8.02	LOG: CALL solverLinear in Graph for feasibility
21.16/8.02	
21.16/8.02	LOG: RETURN solveLinear in Graph for feasibility
21.16/8.02	Strengthening transition (result): 
21.16/8.02	<l2, l2, main_x + main_y <= main_z /\ 0 <= main_x + main_y + main_z /\ 1 <= main_x /\ 1 <= main_z /\ main_x + main_y + main_z <= 1, {main_x -> main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}>
21.16/8.02	
21.16/8.02	LOG: CALL solverLinear in Graph for feasibility
21.16/8.02	
21.16/8.02	LOG: RETURN solveLinear in Graph for feasibility
21.16/8.02	Strengthening transition (result): 
21.16/8.02	<l2, l2, 0 <= main_x + main_y + main_z /\ 1 <= main_x /\ 1 + main_z <= main_x + main_y /\ main_x + main_y + main_z <= 1, {main_x -> main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}>
21.16/8.02	[ Termination Graph ]
21.16/8.02	Strengthening and disabling transitions...
21.16/8.02	
21.16/8.02	LOG: CALL solverLinear in Graph for feasibility
21.16/8.02	
21.16/8.02	LOG: RETURN solveLinear in Graph for feasibility
21.16/8.02	Strengthening transition (result): 
21.16/8.02	<l2, l2, 0 <= main_x + main_y + main_z /\ 1 <= main_x /\ 1 + main_z <= main_x + main_y /\ main_x + main_y + main_z <= 1, {main_x -> main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}>
21.16/8.02	Ranking function: 2 + main_x + main_y + main_z
21.16/8.02	New Graphs: 
21.16/8.02	[14129 : 14160]
21.16/8.02	[14129 : 14161]
21.16/8.02	INVARIANTS: 
21.16/8.02	2: 
21.16/8.02	Quasi-INVARIANTS to narrow Graph: 
21.16/8.02	2: main_x + main_y + main_z <= 1 , 
21.16/8.02	Narrowing transition: 
21.16/8.02	<l2, l2, main_x + main_y <= main_z /\ 0 <= main_x + main_y + main_z /\ 1 <= main_x /\ 1 <= main_z, {main_x -> main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}>
21.16/8.02	
21.16/8.02	LOG: Narrow transition size 1
21.16/8.02	Narrowing transition: 
21.16/8.02	<l2, l2, 0 <= main_x + main_y + main_z /\ 1 <= main_x /\ 1 + 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}>
21.16/8.02	
21.16/8.02	LOG: Narrow transition size 1
21.16/8.02	invGraph after Narrowing: 
21.16/8.02	Transitions:
21.16/8.02	<l2, l2, main_x + main_y <= main_z /\ 1 <= main_x /\ 1 <= main_z /\ 2 <= main_x + main_y + main_z, {main_x -> main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}>
21.16/8.02	<l2, l2, 1 <= main_x /\ 1 + main_z <= main_x + main_y /\ 2 <= main_x + main_y + main_z, {main_x -> main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}>
21.16/8.02	Variables:
21.16/8.02	main_x, main_y, main_z
21.16/8.02	Checking conditional termination of SCC {l2}...
21.16/8.02	
21.16/8.02	LOG: CALL solveLinear
21.16/8.02	
21.16/8.02	LOG: RETURN solveLinear - Elapsed time: 0.001923s
21.16/8.02	Ranking function: -1 + main_z
21.16/8.02	New Graphs: 
21.16/8.02	Transitions:
21.16/8.02	<l2, l2, 1 <= main_x /\ 1 + main_z <= main_x + main_y /\ 2 <= main_x + main_y + main_z, {main_x -> main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}>
21.16/8.02	Variables:
21.16/8.02	main_x, main_y, main_z
21.16/8.02	Checking conditional termination of SCC {l2}...
21.16/8.02	
21.16/8.02	LOG: CALL solveLinear
21.16/8.02	
21.16/8.02	LOG: RETURN solveLinear - Elapsed time: 0.000755s
21.16/8.02	
21.16/8.02	LOG: CALL solveLinear
21.16/8.02	
21.16/8.02	LOG: RETURN solveLinear - Elapsed time: 0.003087s
21.16/8.02	[14129 : 14162]
21.16/8.02	[14129 : 14163]
21.16/8.02	Successful child: 14162
21.16/8.02	[ Invariant Graph ]
21.16/8.02	Strengthening and disabling transitions...
21.16/8.02	
21.16/8.02	LOG: CALL solverLinear in Graph for feasibility
21.16/8.02	
21.16/8.02	LOG: RETURN solveLinear in Graph for feasibility
21.16/8.02	It's unfeasible. Removing transition: 
21.16/8.02	<l2, l2, main_x + main_y <= main_z /\ 1 <= main_x /\ 1 <= main_z /\ 2 <= main_x + main_y + main_z, {main_x -> main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}>
21.16/8.02	
21.16/8.02	LOG: CALL solverLinear in Graph for feasibility
21.16/8.02	
21.16/8.02	LOG: RETURN solveLinear in Graph for feasibility
21.16/8.02	Strengthening transition (result): 
21.16/8.02	<l2, l2, 1 <= main_x /\ 1 + main_z <= main_x + main_y /\ 1 + main_z <= 0 /\ 2 <= main_x + main_y + main_z /\ main_y <= 2 + main_z, {main_x -> main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}>
21.16/8.02	[ Termination Graph ]
21.16/8.02	Strengthening and disabling transitions...
21.16/8.02	
21.16/8.02	LOG: CALL solverLinear in Graph for feasibility
21.16/8.02	
21.16/8.02	LOG: RETURN solveLinear in Graph for feasibility
21.16/8.02	Strengthening transition (result): 
21.16/8.02	<l2, l2, 1 <= main_x /\ 1 + main_z <= main_x + main_y /\ 1 + main_z <= 0 /\ 2 <= main_x + main_y + main_z /\ main_y <= 2 + main_z, {main_x -> main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}>
21.16/8.02	Ranking function: 2*main_x + 2*main_y + main_z
21.16/8.02	New Graphs: 
21.16/8.02	[14129 : 14167]
21.16/8.02	[14129 : 14168]
21.16/8.02	[14129 : 14169]
21.16/8.02	INVARIANTS: 
21.16/8.02	2: 
21.16/8.02	Quasi-INVARIANTS to narrow Graph: 
21.16/8.02	2: 1 + main_z <= 0 , main_y <= 2 + main_z , 
21.16/8.02	Narrowing transition: 
21.16/8.02	<l2, l2, main_x + main_y <= main_z /\ 1 <= main_x /\ 1 <= main_z /\ 2 <= main_x + main_y + main_z, {main_x -> main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}>
21.16/8.02	
21.16/8.02	LOG: Narrow transition size 2
21.16/8.02	Narrowing transition: 
21.16/8.02	<l2, l2, 1 <= main_x /\ 1 + main_z <= main_x + main_y /\ 2 <= main_x + main_y + main_z, {main_x -> main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}>
21.16/8.02	
21.16/8.02	LOG: Narrow transition size 2
21.16/8.02	invGraph after Narrowing: 
21.16/8.02	Transitions:
21.16/8.02	<l2, l2, main_x + main_y <= main_z /\ 1 <= main_x /\ 1 <= main_z /\ 2 <= main_x + main_y + main_z, {main_x -> main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}>
21.16/8.02	<l2, l2, 1 <= main_x /\ 1 + main_z <= main_x + main_y /\ 1 + main_z <= 0 /\ 2 <= main_x + main_y + main_z /\ 3 + main_z <= main_y, {main_x -> main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}>
21.16/8.02	<l2, l2, 0 <= main_z /\ 1 <= main_x /\ 1 + main_z <= main_x + main_y /\ 2 <= main_x + main_y + main_z, {main_x -> main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}>
21.16/8.02	Variables:
21.16/8.02	main_x, main_y, main_z
21.16/8.02	Checking conditional termination of SCC {l2}...
21.16/8.02	
21.16/8.02	LOG: CALL solveLinear
21.16/8.02	
21.16/8.02	LOG: RETURN solveLinear - Elapsed time: 0.002970s
21.16/8.02	Ranking function: -1 + main_z
21.16/8.02	New Graphs: 
21.16/8.02	Transitions:
21.16/8.02	<l2, l2, 1 <= main_x /\ 1 + main_z <= main_x + main_y /\ 1 + main_z <= 0 /\ 2 <= main_x + main_y + main_z /\ 3 + main_z <= main_y, {main_x -> main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}>
21.16/8.02	<l2, l2, 0 <= main_z /\ 1 <= main_x /\ 1 + main_z <= main_x + main_y /\ 2 <= main_x + main_y + main_z, {main_x -> main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}>
21.16/8.02	Variables:
21.16/8.02	main_x, main_y, main_z
21.16/8.02	Checking conditional termination of SCC {l2}...
21.16/8.02	
21.16/8.02	LOG: CALL solveLinear
21.16/8.02	
21.16/8.02	LOG: RETURN solveLinear - Elapsed time: 0.002073s
21.16/8.02	Ranking function: main_z
21.16/8.02	New Graphs: 
21.16/8.02	Transitions:
21.16/8.02	<l2, l2, 1 <= main_x /\ 1 + main_z <= main_x + main_y /\ 1 + main_z <= 0 /\ 2 <= main_x + main_y + main_z /\ 3 + main_z <= main_y, {main_x -> main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}>
21.16/8.02	Variables:
21.16/8.02	main_x, main_y, main_z
21.16/8.02	Checking conditional termination of SCC {l2}...
21.16/8.02	
21.16/8.02	LOG: CALL solveLinear
21.16/8.02	
21.16/8.02	LOG: RETURN solveLinear - Elapsed time: 0.000915s
21.16/8.02	
21.16/8.02	LOG: CALL solveLinear
21.16/8.02	
21.16/8.02	LOG: RETURN solveLinear - Elapsed time: 0.004489s
21.16/8.02	[14129 : 14170]
21.16/8.02	[14129 : 14171]
21.16/8.02	Successful child: 14170
21.16/8.02	[ Invariant Graph ]
21.16/8.02	Strengthening and disabling transitions...
21.16/8.02	
21.16/8.02	LOG: CALL solverLinear in Graph for feasibility
21.16/8.02	
21.16/8.02	LOG: RETURN solveLinear in Graph for feasibility
21.16/8.02	It's unfeasible. Removing transition: 
21.16/8.02	<l2, l2, main_x + main_y <= main_z /\ 1 <= main_x /\ 1 <= main_z /\ 2 <= main_x + main_y + main_z, {main_x -> main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}>
21.16/8.02	
21.16/8.02	LOG: CALL solverLinear in Graph for feasibility
21.16/8.02	
21.16/8.02	LOG: RETURN solveLinear in Graph for feasibility
21.16/8.02	Strengthening transition (result): 
21.16/8.02	<l2, l2, 1 <= main_x /\ 1 + main_z <= main_x + main_y /\ 2 <= main_x + main_y + main_z /\ 3 + main_z <= main_y /\ 3 + main_z <= 0, {main_x -> main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}>
21.16/8.02	
21.16/8.02	LOG: CALL solverLinear in Graph for feasibility
21.16/8.02	
21.16/8.02	LOG: RETURN solveLinear in Graph for feasibility
21.16/8.02	It's unfeasible. Removing transition: 
21.16/8.02	<l2, l2, 0 <= main_z /\ 1 <= main_x /\ 1 + main_z <= main_x + main_y /\ 2 <= main_x + main_y + main_z, {main_x -> main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}>
21.16/8.02	[ Termination Graph ]
21.16/8.02	Strengthening and disabling transitions...
21.16/8.02	
21.16/8.02	LOG: CALL solverLinear in Graph for feasibility
21.16/8.02	
21.16/8.02	LOG: RETURN solveLinear in Graph for feasibility
21.16/8.02	Strengthening transition (result): 
21.16/8.02	<l2, l2, 1 <= main_x /\ 1 + main_z <= main_x + main_y /\ 2 <= main_x + main_y + main_z /\ 3 + main_z <= main_y /\ 3 + main_z <= 0, {main_x -> main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}>
21.16/8.02	Ranking function: 2*main_y - 2*main_z
21.16/8.02	New Graphs: 
21.16/8.02	[14129 : 14175]
21.16/8.02	[14129 : 14176]
21.16/8.02	INVARIANTS: 
21.16/8.02	2: 
21.16/8.02	Quasi-INVARIANTS to narrow Graph: 
21.16/8.02	2: 1 <= main_x , 3 + main_z <= 0 , 
21.16/8.02	Narrowing transition: 
21.16/8.02	<l2, l2, main_x + main_y <= main_z /\ 1 <= main_x /\ 1 <= main_z /\ 2 <= main_x + main_y + main_z, {main_x -> main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}>
21.16/8.02	
21.16/8.02	LOG: Narrow transition size 2
21.16/8.02	Narrowing transition: 
21.16/8.02	<l2, l2, 1 <= main_x /\ 1 + main_z <= main_x + main_y /\ 1 + main_z <= 0 /\ 2 <= main_x + main_y + main_z /\ 3 + main_z <= main_y, {main_x -> main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}>
21.16/8.02	
21.16/8.02	LOG: Narrow transition size 2
21.16/8.02	Narrowing transition: 
21.16/8.02	<l2, l2, 0 <= main_z /\ 1 <= main_x /\ 1 + main_z <= main_x + main_y /\ 2 <= main_x + main_y + main_z, {main_x -> main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}>
21.16/8.02	
21.16/8.02	LOG: Narrow transition size 2
21.16/8.02	invGraph after Narrowing: 
21.16/8.02	Transitions:
21.16/8.02	<l2, l2, main_x + main_y <= main_z /\ 1 <= main_x /\ 1 <= main_z /\ 2 <= main_x + main_y + main_z, {main_x -> main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}>
21.16/8.02	<l2, l2, 1 <= main_x /\ 1 + main_z <= main_x + main_y /\ 1 + main_z <= 0 /\ 2 <= main_x + main_y + main_z /\ 3 + main_z <= main_y /\ 0 <= 2 + main_z, {main_x -> main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}>
21.16/8.02	<l2, l2, 0 <= main_z /\ 1 <= main_x /\ 1 + main_z <= main_x + main_y /\ 2 <= main_x + main_y + main_z, {main_x -> main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}>
21.16/8.02	Variables:
21.16/8.02	main_x, main_y, main_z
21.16/8.02	Checking conditional termination of SCC {l2}...
21.16/8.02	
21.16/8.02	LOG: CALL solveLinear
21.16/8.02	
21.16/8.02	LOG: RETURN solveLinear - Elapsed time: 0.003211s
21.16/8.02	Ranking function: 2 + main_z
21.16/8.02	New Graphs: 
21.16/8.02	Proving termination of subgraph 2
21.16/8.02	Analyzing SCC {l6}...
21.16/8.02	No cycles found.
21.16/8.02	
21.16/8.02	Program Terminates
21.16/8.02	EOF