14.37/7.12	NO
14.37/7.12	
14.55/7.12	Solver Timeout: 4
14.55/7.12	Global Timeout: 300
14.55/7.12	Maximum number of concurrent processes: 900
14.55/7.12	*******************************************************************************************
14.55/7.12	*********************** UNPROCESSED TRANSITION SYSTEMS PER FUNCTION ***********************
14.55/7.12	*******************************************************************************************
14.55/7.12	
14.55/7.12	
14.55/7.12	List of LLVMGraphs + assumeNodes + staticAssertNodes [1] :
14.55/7.12	
14.55/7.12	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
14.55/7.12	+                                                                  +
14.55/7.12	Init Location: 0
14.55/7.12	Transitions:
14.55/7.12	<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)}>
14.55/7.12	<l1, l2, true>
14.55/7.12	<l2, l5, not((main_x > 0))>
14.55/7.12	<l2, l3, (main_x > 0)>
14.55/7.12	<l3, l4, true, seq{main_x -> (main_x + main_y), main_y -> (main_y + main_z)}>
14.55/7.12	<l4, l2, true>
14.55/7.12	<l5, l6, true, seq{main__func_return_ -> 0}>
14.55/7.12	
14.55/7.12	Fresh variables:
14.55/7.12	
14.55/7.12	Undef variables:
14.55/7.12	
14.55/7.12	Abstraction variables:
14.55/7.12	
14.55/7.12	Exit nodes:
14.55/7.12	
14.55/7.12	Accepting locations:
14.55/7.12	
14.55/7.12	Asserts:
14.55/7.12	
14.55/7.12	+ Assume Nodes [0]: ++++++++++++++++++++++++++++++++++++++++++++++++
14.55/7.12	       
14.55/7.12	+ Static Assert Nodes [0]: +++++++++++++++++++++++++++++++++++++++++
14.55/7.12	       
14.55/7.12	+ After preprocess (paralelization): ++++++++++++++++++++++++++++++
14.55/7.12	
14.55/7.12	Init Location: 0
14.55/7.12	Transitions:
14.55/7.12	<l0, l7, true, seq{main__func_return_ -> 0}>
14.55/7.12	<l7, l8, true, seq{varCall_1 -> ¿functionCall(__VERIFIER_nondet_int)}>
14.55/7.12	<l8, l9, true, seq{main_x -> varCall_1}>
14.55/7.12	<l9, l10, true, seq{varCall_2 -> ¿functionCall(__VERIFIER_nondet_int)}>
14.55/7.12	<l10, l11, true, seq{main_y -> varCall_2}>
14.55/7.12	<l11, l12, true, seq{varCall_3 -> ¿functionCall(__VERIFIER_nondet_int)}>
14.55/7.12	<l12, l1, true, seq{main_z -> varCall_3}>
14.55/7.12	<l1, l2, true>
14.55/7.12	<l2, l3, (main_x > 0)>
14.55/7.12	<l2, l5, not((main_x > 0))>
14.55/7.12	<l3, l4, true, seq{main_x -> (main_x + main_y), main_y -> (main_y + main_z)}>
14.55/7.12	<l4, l2, true>
14.55/7.12	<l5, l6, true, seq{main__func_return_ -> 0}>
14.55/7.12	
14.55/7.12	Fresh variables:
14.55/7.12	
14.55/7.12	Undef variables:
14.55/7.12	
14.55/7.12	Abstraction variables:
14.55/7.12	
14.55/7.12	Exit nodes:
14.55/7.12	6, 
14.55/7.12	Accepting locations:
14.55/7.12	
14.55/7.12	Asserts:
14.55/7.12	
14.55/7.12	+                                                                  +
14.55/7.13	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
14.55/7.13	
14.55/7.13	
14.55/7.13	Function Return and Parameters Information [2 functions]:
14.55/7.13	    function name: __VERIFIER_nondet_int [1 return + 0 parameters]        demangled: __VERIFIER_nondet_int
14.55/7.13	        __VERIFIER_nondet_int__func_return_      [function result] : int
14.55/7.13	    function name: main [1 return + 0 parameters]        demangled: main
14.55/7.13	        main__func_return_      [function result] : int
14.55/7.13	
14.55/7.13	
14.55/7.13	AST Ident Scanner Information [5 idents]:
14.55/7.13	__VERIFIER_nondet_int | function | [integer, ()] | <line: 20, col: 1> | <line: 24, col: 9> <line: 25, col: 9> <line: 26, col: 9>
14.55/7.13	main | function | [integer, ()] | <line: 22, col: 1>
14.55/7.13	x | local variable | integer | <line: 23, col: 5> | <line: 24, col: 5> <line: 27, col: 12> <line: 28, col: 9> <line: 28, col: 13>
14.55/7.13	y | local variable | integer | <line: 23, col: 5> | <line: 25, col: 5> <line: 28, col: 17> <line: 29, col: 9> <line: 29, col: 13>
14.55/7.13	z | local variable | integer | <line: 23, col: 5> | <line: 26, col: 5> <line: 29, col: 17>
14.55/7.13	
14.55/7.13	Main function: main
14.55/7.13	Preprocessed LLVMGraph
14.55/7.13	Init Location: 0
14.55/7.13	Transitions:
14.55/7.13	<l0, l2, (main_x = undef4) /\ (main_y = undef5) /\ (main_z = undef6)>
14.55/7.13	<l2, l2, (main_x > 0), par{main_x -> (main_x + main_y), main_y -> (main_y + main_z)}>
14.55/7.13	<l2, l6, not((main_x > 0))>
14.55/7.13	
14.55/7.13	Fresh variables:
14.55/7.13	undef4, undef5, undef6, 
14.55/7.13	
14.55/7.13	Undef variables:
14.55/7.13	undef4, undef5, undef6, 
14.55/7.13	
14.55/7.13	Abstraction variables:
14.55/7.13	
14.55/7.13	Exit nodes:
14.55/7.13	6, 
14.55/7.13	Accepting locations:
14.55/7.13	
14.55/7.13	Asserts:
14.55/7.13	
14.55/7.13	*************************************************************
14.55/7.13	*******************************************************************************************
14.55/7.13	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
14.55/7.13	*******************************************************************************************
14.55/7.13	
14.55/7.13	Init Location: 0
14.55/7.13	Graph 0:
14.55/7.13	Transitions:
14.55/7.13	Variables:
14.55/7.13	
14.55/7.13	Graph 1:
14.55/7.13	Transitions:
14.55/7.13	<l2, l2, 1 <= main_x, {main_x -> main_x + main_y, main_y -> main_y + main_z, rest remain the same}>
14.55/7.13	Variables:
14.55/7.13	main_x, main_y, main_z
14.55/7.13	
14.55/7.13	Graph 2:
14.55/7.13	Transitions:
14.55/7.13	Variables:
14.55/7.13	
14.55/7.13	Precedence: 
14.55/7.13	Graph 0
14.55/7.13	
14.55/7.13	Graph 1
14.55/7.13	<l0, l2, main_x = undef4 /\ main_y = undef5 /\ main_z = undef6, {all remain the same}>
14.55/7.13	
14.55/7.13	Graph 2
14.55/7.13	<l2, l6, main_x <= 0, {all remain the same}>
14.55/7.13	
14.55/7.13	Map Locations to Subgraph:
14.55/7.13	( 0 , 0 )
14.55/7.13	( 2 , 1 )
14.55/7.13	( 6 , 2 )
14.55/7.13	
14.55/7.13	*******************************************************************************************
14.55/7.13	********************************    CHECKING ASSERTIONS    ********************************
14.55/7.13	*******************************************************************************************
14.55/7.13	
14.55/7.13	Proving termination of subgraph 0
14.55/7.13	Proving termination of subgraph 1
14.55/7.13	Checking unfeasibility...
14.55/7.13	Time used: 0.002379
14.55/7.13	
14.55/7.13	Checking conditional termination of SCC {l2}...
14.55/7.13	
14.55/7.13	LOG: CALL solveLinear
14.55/7.13	
14.55/7.13	LOG: RETURN solveLinear - Elapsed time: 0.000821s
14.55/7.13	
14.55/7.13	LOG: CALL solveLinear
14.55/7.13	
14.55/7.13	LOG: RETURN solveLinear - Elapsed time: 0.001808s
14.55/7.13	[38045 : 38047]
14.55/7.13	[38045 : 38048]
14.55/7.13	Successful child: 38047
14.55/7.13	[ Invariant Graph ]
14.55/7.13	Strengthening and disabling transitions...
14.55/7.13	
14.55/7.13	LOG: CALL solverLinear in Graph for feasibility
14.55/7.13	
14.55/7.13	LOG: RETURN solveLinear in Graph for feasibility
14.55/7.13	It's unfeasible. Removing transition: 
14.55/7.13	<l2, l2, 1 <= main_x, {main_x -> main_x + main_y, main_y -> main_y + main_z, rest remain the same}>
14.55/7.13	[ Termination Graph ]
14.55/7.13	Strengthening and disabling transitions...
14.55/7.13	> It's unfeasible. Removing transition: 
14.55/7.13	<l2, l2, 1 <= main_x, {main_x -> main_x + main_y, main_y -> main_y + main_z, rest remain the same}>
14.55/7.13	New Graphs: 
14.55/7.13	
14.55/7.13	LOG: CALL check - Post:main_x <= 0 - Process 1
14.55/7.13	* Exit transition: <l0, l2, main_x = undef4 /\ main_y = undef5 /\ main_z = undef6, {all remain the same}>
14.55/7.13	* Postcondition  : main_x <= 0
14.55/7.13	
14.55/7.13	LOG: CALL solveLinear
14.55/7.13	
14.55/7.13	LOG: RETURN solveLinear - Elapsed time: 0.000565s
14.55/7.13	> Postcondition is not implied!
14.55/7.13	
14.55/7.13	LOG: RETURN check - Elapsed time: 0.000668s
14.55/7.13	INVARIANTS: 
14.55/7.13	2: 
14.55/7.13	Quasi-INVARIANTS to narrow Graph: 
14.55/7.13	2: main_x <= 0 , 
14.55/7.13	Narrowing transition: 
14.55/7.13	<l2, l2, 1 <= main_x, {main_x -> main_x + main_y, main_y -> main_y + main_z, rest remain the same}>
14.55/7.13	
14.55/7.13	LOG: Narrow transition size 1
14.55/7.13	invGraph after Narrowing: 
14.55/7.13	Transitions:
14.55/7.13	<l2, l2, 1 <= main_x, {main_x -> main_x + main_y, main_y -> main_y + main_z, rest remain the same}>
14.55/7.13	Variables:
14.55/7.13	main_x, main_y, main_z
14.55/7.13	Checking conditional termination of SCC {l2}...
14.55/7.13	
14.55/7.13	LOG: CALL solveLinear
14.55/7.13	
14.55/7.13	LOG: RETURN solveLinear - Elapsed time: 0.000792s
14.55/7.13	
14.55/7.13	LOG: CALL solveLinear
14.55/7.13	
14.55/7.13	LOG: RETURN solveLinear - Elapsed time: 0.001955s
14.55/7.13	[38045 : 38052]
14.55/7.13	[38045 : 38053]
14.55/7.13	Successful child: 38052
14.55/7.13	[ Invariant Graph ]
14.55/7.13	Strengthening and disabling transitions...
14.55/7.13	
14.55/7.13	LOG: CALL solverLinear in Graph for feasibility
14.55/7.13	
14.55/7.13	LOG: RETURN solveLinear in Graph for feasibility
14.55/7.13	Strengthening transition (result): 
14.55/7.13	<l2, l2, main_x <= main_z /\ 1 <= main_x /\ main_x + main_y + main_z <= 1, {main_x -> main_x + main_y, main_y -> main_y + main_z, rest remain the same}>
14.55/7.13	[ Termination Graph ]
14.55/7.13	Strengthening and disabling transitions...
14.55/7.13	
14.55/7.13	LOG: CALL solverLinear in Graph for feasibility
14.55/7.13	
14.55/7.13	LOG: RETURN solveLinear in Graph for feasibility
14.55/7.13	Strengthening transition (result): 
14.55/7.13	<l2, l2, main_x <= main_z /\ 1 <= main_x /\ main_x + main_y + main_z <= 1, {main_x -> main_x + main_y, main_y -> main_y + main_z, rest remain the same}>
14.55/7.13	Ranking function: main_x
14.55/7.13	New Graphs: 
14.55/7.13	[38045 : 38057]
14.55/7.13	[38045 : 38058]
14.55/7.13	INVARIANTS: 
14.55/7.13	2: 
14.55/7.13	Quasi-INVARIANTS to narrow Graph: 
14.55/7.13	2: main_x <= main_z , main_x + main_y + main_z <= 1 , 
14.55/7.13	Narrowing transition: 
14.55/7.13	<l2, l2, 1 <= main_x, {main_x -> main_x + main_y, main_y -> main_y + main_z, rest remain the same}>
14.55/7.13	
14.55/7.13	LOG: Narrow transition size 2
14.55/7.13	invGraph after Narrowing: 
14.55/7.13	Transitions:
14.55/7.13	<l2, l2, main_x <= main_z /\ 1 <= main_x /\ 2 <= main_x + main_y + main_z, {main_x -> main_x + main_y, main_y -> main_y + main_z, rest remain the same}>
14.55/7.13	<l2, l2, 1 <= main_x /\ 1 + main_z <= main_x, {main_x -> main_x + main_y, main_y -> main_y + main_z, rest remain the same}>
14.55/7.13	Variables:
14.55/7.13	main_x, main_y, main_z
14.55/7.13	Checking conditional termination of SCC {l2}...
14.55/7.13	
14.55/7.13	LOG: CALL solveLinear
14.55/7.13	
14.55/7.13	LOG: RETURN solveLinear - Elapsed time: 0.001138s
14.55/7.13	
14.55/7.13	LOG: CALL solveLinear
14.55/7.13	
14.55/7.13	LOG: RETURN solveLinear - Elapsed time: 0.005953s
14.55/7.13	[38045 : 38059]
14.55/7.13	[38045 : 38060]
14.55/7.13	Successful child: 38059
14.55/7.13	[ Invariant Graph ]
14.55/7.13	Strengthening and disabling transitions...
14.55/7.13	
14.55/7.13	LOG: CALL solverLinear in Graph for feasibility
14.55/7.13	
14.55/7.13	LOG: RETURN solveLinear in Graph for feasibility
14.55/7.13	It's unfeasible. Removing transition: 
14.55/7.13	<l2, l2, main_x <= main_z /\ 1 <= main_x /\ 2 <= main_x + main_y + main_z, {main_x -> main_x + main_y, main_y -> main_y + main_z, rest remain the same}>
14.55/7.13	
14.55/7.13	LOG: CALL solverLinear in Graph for feasibility
14.55/7.13	
14.55/7.13	LOG: RETURN solveLinear in Graph for feasibility
14.55/7.13	Strengthening transition (result): 
14.55/7.13	<l2, l2, main_x + main_y + main_z <= 0 /\ 1 <= main_x /\ 1 + main_z <= main_x, {main_x -> main_x + main_y, main_y -> main_y + main_z, rest remain the same}>
14.55/7.13	[ Termination Graph ]
14.55/7.13	Strengthening and disabling transitions...
14.55/7.13	
14.55/7.13	LOG: CALL solverLinear in Graph for feasibility
14.55/7.13	
14.55/7.13	LOG: RETURN solveLinear in Graph for feasibility
14.55/7.13	It's unfeasible. Removing transition: 
14.55/7.13	<l2, l2, main_x <= main_z /\ 1 <= main_x /\ 2 <= main_x + main_y + main_z, {main_x -> main_x + main_y, main_y -> main_y + main_z, rest remain the same}>
14.55/7.13	
14.55/7.13	LOG: CALL solverLinear in Graph for feasibility
14.55/7.13	
14.55/7.13	LOG: RETURN solveLinear in Graph for feasibility
14.55/7.13	Strengthening transition (result): 
14.55/7.13	<l2, l2, main_x + main_y + main_z <= 0 /\ 1 <= main_x /\ 1 + main_z <= main_x, {main_x -> main_x + main_y, main_y -> main_y + main_z, rest remain the same}>
14.55/7.13	New Graphs: 
14.55/7.13	Transitions:
14.55/7.13	<l2, l2, main_x + main_y + main_z <= 0 /\ 1 <= main_x /\ 1 + main_z <= main_x, {main_x -> main_x + main_y, main_y -> main_y + main_z, rest remain the same}>
14.55/7.13	Variables:
14.55/7.13	main_x, main_y, main_z
14.55/7.13	Checking conditional termination of SCC {l2}...
14.55/7.13	
14.55/7.13	LOG: CALL solveLinear
14.55/7.13	
14.55/7.13	LOG: RETURN solveLinear - Elapsed time: 0.000722s
14.55/7.13	
14.55/7.13	LOG: CALL solveLinear
14.55/7.13	
14.55/7.13	LOG: RETURN solveLinear - Elapsed time: 0.002596s
14.55/7.13	[38045 : 38064]
14.55/7.13	[38045 : 38065]
14.55/7.13	Successful child: 38064
14.55/7.13	[ Invariant Graph ]
14.55/7.13	Strengthening and disabling transitions...
14.55/7.13	
14.55/7.13	LOG: CALL solverLinear in Graph for feasibility
14.55/7.13	
14.55/7.13	LOG: RETURN solveLinear in Graph for feasibility
14.55/7.13	Strengthening transition (result): 
14.55/7.13	<l2, l2, main_x + main_y + main_z <= 0 /\ 1 <= main_x /\ main_x = 1 + main_z, {main_x -> main_x + main_y, main_y -> main_y + main_z, rest remain the same}>
14.55/7.13	[ Termination Graph ]
14.55/7.13	Strengthening and disabling transitions...
14.55/7.13	
14.55/7.13	LOG: CALL solverLinear in Graph for feasibility
14.55/7.13	
14.55/7.13	LOG: RETURN solveLinear in Graph for feasibility
14.55/7.13	Strengthening transition (result): 
14.55/7.13	<l2, l2, main_x + main_y + main_z <= 0 /\ 1 <= main_x /\ main_x = 1 + main_z, {main_x -> main_x + main_y, main_y -> main_y + main_z, rest remain the same}>
14.55/7.13	Ranking function: main_x - main_z
14.55/7.13	New Graphs: 
14.55/7.13	[38045 : 38069]
14.55/7.13	[38045 : 38070]
14.55/7.13	INVARIANTS: 
14.55/7.13	2: 
14.55/7.13	Quasi-INVARIANTS to narrow Graph: 
14.55/7.13	2: main_x + main_y + main_z <= 0 , 
14.55/7.13	
14.55/7.13	LOG: CALL check - Post:main_x <= 1 + main_z - Process 2
14.55/7.13	* Exit transition: <l0, l2, 1 <= main_x /\ 1 + main_z <= main_x /\ main_x = undef4 /\ main_y = undef5 /\ main_z = undef6, {all remain the same}>
14.55/7.13	* Postcondition  : main_x <= 1 + main_z
14.55/7.13	
14.55/7.13	LOG: CALL solveLinear
14.55/7.13	
14.55/7.13	LOG: RETURN solveLinear - Elapsed time: 0.000949s
14.55/7.13	> Postcondition is not implied!
14.55/7.13	
14.55/7.13	LOG: RETURN check - Elapsed time: 0.001082s
14.55/7.13	INVARIANTS: 
14.55/7.13	2: 
14.55/7.13	Quasi-INVARIANTS to narrow Graph: 
14.55/7.13	2: main_x <= 1 + main_z , 
14.55/7.13	Narrowing transition: 
14.55/7.13	<l2, l2, main_x <= main_z /\ 1 <= main_x /\ 2 <= main_x + main_y + main_z, {main_x -> main_x + main_y, main_y -> main_y + main_z, rest remain the same}>
14.55/7.13	
14.55/7.13	LOG: Narrow transition size 2
14.55/7.13	Narrowing transition: 
14.55/7.13	<l2, l2, 1 <= main_x /\ 1 + main_z <= main_x, {main_x -> main_x + main_y, main_y -> main_y + main_z, rest remain the same}>
14.55/7.13	
14.55/7.13	LOG: Narrow transition size 2
14.55/7.13	invGraph after Narrowing: 
14.55/7.13	Transitions:
14.55/7.13	<l2, l2, main_x <= main_z /\ 1 <= main_x /\ 2 <= main_x + main_y + main_z, {main_x -> main_x + main_y, main_y -> main_y + main_z, rest remain the same}>
14.55/7.13	<l2, l2, main_x + main_y + main_z <= 0 /\ 1 <= main_x /\ 2 + main_z <= main_x, {main_x -> main_x + main_y, main_y -> main_y + main_z, rest remain the same}>
14.55/7.13	<l2, l2, 1 <= main_x /\ 1 <= main_x + main_y + main_z /\ 1 + main_z <= main_x, {main_x -> main_x + main_y, main_y -> main_y + main_z, rest remain the same}>
14.55/7.13	Variables:
14.55/7.13	main_x, main_y, main_z
14.55/7.13	Checking conditional termination of SCC {l2}...
14.55/7.13	
14.55/7.13	LOG: CALL solveLinear
14.55/7.13	
14.55/7.13	LOG: RETURN solveLinear - Elapsed time: 0.001717s
14.55/7.13	
14.55/7.13	LOG: CALL solveLinear
14.55/7.13	
14.55/7.13	LOG: RETURN solveLinear - Elapsed time: 0.015214s
14.55/7.13	[38045 : 38071]
14.55/7.13	[38045 : 38072]
14.55/7.13	Successful child: 38071
14.55/7.13	[ Invariant Graph ]
14.55/7.13	Strengthening and disabling transitions...
14.55/7.13	
14.55/7.13	LOG: CALL solverLinear in Graph for feasibility
14.55/7.13	
14.55/7.13	LOG: RETURN solveLinear in Graph for feasibility
14.55/7.13	It's unfeasible. Removing transition: 
14.55/7.13	<l2, l2, main_x <= main_z /\ 1 <= main_x /\ 2 <= main_x + main_y + main_z, {main_x -> main_x + main_y, main_y -> main_y + main_z, rest remain the same}>
14.55/7.13	
14.55/7.13	LOG: CALL solverLinear in Graph for feasibility
14.55/7.13	
14.55/7.13	LOG: RETURN solveLinear in Graph for feasibility
14.55/7.13	Strengthening transition (result): 
14.55/7.13	<l2, l2, main_x + main_y + main_z <= 0 /\ 1 <= main_x /\ 2 + main_z <= main_x, {main_x -> main_x + main_y, main_y -> main_y + main_z, rest remain the same}>
14.55/7.13	
14.55/7.13	LOG: CALL solverLinear in Graph for feasibility
14.55/7.13	
14.55/7.13	LOG: RETURN solveLinear in Graph for feasibility
14.55/7.13	It's unfeasible. Removing transition: 
14.55/7.13	<l2, l2, 1 <= main_x /\ 1 <= main_x + main_y + main_z /\ 1 + main_z <= main_x, {main_x -> main_x + main_y, main_y -> main_y + main_z, rest remain the same}>
14.55/7.13	[ Termination Graph ]
14.55/7.13	Strengthening and disabling transitions...
14.55/7.13	
14.55/7.13	LOG: CALL solverLinear in Graph for feasibility
14.55/7.13	
14.55/7.13	LOG: RETURN solveLinear in Graph for feasibility
14.55/7.13	It's unfeasible. Removing transition: 
14.55/7.13	<l2, l2, main_x <= main_z /\ 1 <= main_x /\ 2 <= main_x + main_y + main_z, {main_x -> main_x + main_y, main_y -> main_y + main_z, rest remain the same}>
14.55/7.13	
14.55/7.13	LOG: CALL solverLinear in Graph for feasibility
14.55/7.13	
14.55/7.13	LOG: RETURN solveLinear in Graph for feasibility
14.55/7.13	Strengthening transition (result): 
14.55/7.13	<l2, l2, main_x + main_y + main_z <= 0 /\ 1 <= main_x /\ 2 + main_z <= main_x, {main_x -> main_x + main_y, main_y -> main_y + main_z, rest remain the same}>
14.55/7.13	
14.55/7.13	LOG: CALL solverLinear in Graph for feasibility
14.55/7.13	
14.55/7.13	LOG: RETURN solveLinear in Graph for feasibility
14.55/7.13	It's unfeasible. Removing transition: 
14.55/7.13	<l2, l2, 1 <= main_x /\ 1 <= main_x + main_y + main_z /\ 1 + main_z <= main_x, {main_x -> main_x + main_y, main_y -> main_y + main_z, rest remain the same}>
14.55/7.13	New Graphs: 
14.55/7.13	Transitions:
14.55/7.13	<l2, l2, main_x + main_y + main_z <= 0 /\ 1 <= main_x /\ 2 + main_z <= main_x, {main_x -> main_x + main_y, main_y -> main_y + main_z, rest remain the same}>
14.55/7.13	Variables:
14.55/7.13	main_x, main_y, main_z
14.55/7.13	Checking conditional termination of SCC {l2}...
14.55/7.13	
14.55/7.13	LOG: CALL solveLinear
14.55/7.13	
14.55/7.13	LOG: RETURN solveLinear - Elapsed time: 0.000725s
14.55/7.13	
14.55/7.13	LOG: CALL solveLinear
14.55/7.13	
14.55/7.13	LOG: RETURN solveLinear - Elapsed time: 0.002737s
14.55/7.13	[38045 : 38076]
14.55/7.13	[38045 : 38077]
14.55/7.13	Successful child: 38076
14.55/7.13	[ Invariant Graph ]
14.55/7.13	Strengthening and disabling transitions...
14.55/7.13	
14.55/7.13	LOG: CALL solverLinear in Graph for feasibility
14.55/7.13	
14.55/7.13	LOG: RETURN solveLinear in Graph for feasibility
14.55/7.13	Strengthening transition (result): 
14.55/7.13	<l2, l2, main_x + main_y + main_z <= 0 /\ 0 <= main_z /\ 1 <= main_x /\ 2 + main_z <= main_x, {main_x -> main_x + main_y, main_y -> main_y + main_z, rest remain the same}>
14.55/7.13	[ Termination Graph ]
14.55/7.13	Strengthening and disabling transitions...
14.55/7.13	
14.55/7.13	LOG: CALL solverLinear in Graph for feasibility
14.55/7.13	
14.55/7.13	LOG: RETURN solveLinear in Graph for feasibility
14.55/7.13	Strengthening transition (result): 
14.55/7.13	<l2, l2, main_x + main_y + main_z <= 0 /\ 0 <= main_z /\ 1 <= main_x /\ 2 + main_z <= main_x, {main_x -> main_x + main_y, main_y -> main_y + main_z, rest remain the same}>
14.55/7.13	Ranking function: 2*main_x
14.55/7.13	New Graphs: 
14.55/7.13	
14.55/7.13	LOG: CALL check - Post:main_x + main_y + main_z <= 0 - Process 3
14.55/7.13	* Exit transition: <l0, l2, 1 <= main_x /\ 1 <= main_x + main_y + main_z /\ 1 + main_z <= main_x /\ main_x = undef4 /\ main_y = undef5 /\ main_z = undef6, {all remain the same}>
14.55/7.13	* Postcondition  : main_x + main_y + main_z <= 0
14.55/7.13	
14.55/7.13	LOG: CALL solveLinear
14.55/7.13	
14.55/7.13	LOG: RETURN solveLinear - Elapsed time: 0.000743s
14.55/7.13	> Postcondition is not implied!
14.55/7.13	
14.55/7.13	LOG: RETURN check - Elapsed time: 0.000884s
14.55/7.13	INVARIANTS: 
14.55/7.13	2: 
14.55/7.13	Quasi-INVARIANTS to narrow Graph: 
14.55/7.13	2: main_x + main_y + main_z <= 0 , 
14.55/7.13	[38045 : 38081]
14.55/7.13	[38045 : 38082]
14.55/7.13	INVARIANTS: 
14.55/7.13	2: 
14.55/7.13	Quasi-INVARIANTS to narrow Graph: 
14.55/7.13	2: 0 <= main_z , 
14.55/7.13	Narrowing transition: 
14.55/7.13	<l2, l2, main_x <= main_z /\ 1 <= main_x /\ 2 <= main_x + main_y + main_z, {main_x -> main_x + main_y, main_y -> main_y + main_z, rest remain the same}>
14.55/7.13	
14.55/7.13	LOG: Narrow transition size 2
14.55/7.13	Narrowing transition: 
14.55/7.13	<l2, l2, main_x + main_y + main_z <= 0 /\ 1 <= main_x /\ 2 + main_z <= main_x, {main_x -> main_x + main_y, main_y -> main_y + main_z, rest remain the same}>
14.55/7.13	
14.55/7.13	LOG: Narrow transition size 2
14.55/7.13	Narrowing transition: 
14.55/7.13	<l2, l2, 1 <= main_x /\ 1 <= main_x + main_y + main_z /\ 1 + main_z <= main_x, {main_x -> main_x + main_y, main_y -> main_y + main_z, rest remain the same}>
14.55/7.13	
14.55/7.13	LOG: Narrow transition size 2
14.55/7.13	invGraph after Narrowing: 
14.55/7.13	Transitions:
14.55/7.13	<l2, l2, main_x <= main_z /\ 1 <= main_x /\ 2 <= main_x + main_y + main_z, {main_x -> main_x + main_y, main_y -> main_y + main_z, rest remain the same}>
14.55/7.13	<l2, l2, main_x + main_y + main_z <= 0 /\ 1 <= main_x /\ 1 + main_z <= 0 /\ 2 + main_z <= main_x, {main_x -> main_x + main_y, main_y -> main_y + main_z, rest remain the same}>
14.55/7.13	<l2, l2, 1 <= main_x /\ 1 <= main_x + main_y + main_z /\ 1 + main_z <= main_x, {main_x -> main_x + main_y, main_y -> main_y + main_z, rest remain the same}>
14.55/7.13	Variables:
14.55/7.13	main_x, main_y, main_z
14.55/7.13	Checking conditional termination of SCC {l2}...
14.55/7.13	
14.55/7.13	LOG: CALL solveLinear
14.55/7.13	
14.55/7.13	LOG: RETURN solveLinear - Elapsed time: 0.001805s
14.55/7.13	
14.55/7.13	LOG: CALL solveLinear
14.55/7.13	
14.55/7.13	LOG: RETURN solveLinear - Elapsed time: 0.014811s
14.55/7.13	[38045 : 38083]
14.55/7.13	[38045 : 38084]
14.55/7.13	Successful child: 38083
14.55/7.13	[ Invariant Graph ]
14.55/7.13	Strengthening and disabling transitions...
14.55/7.13	
14.55/7.13	LOG: CALL solverLinear in Graph for feasibility
14.55/7.13	
14.55/7.13	LOG: RETURN solveLinear in Graph for feasibility
14.55/7.13	Strengthening transition (result): 
14.55/7.13	<l2, l2, main_x <= main_z /\ 0 <= main_z /\ 1 <= main_x /\ 2 <= main_x + main_y + main_z, {main_x -> main_x + main_y, main_y -> main_y + main_z, rest remain the same}>
14.55/7.13	
14.55/7.13	LOG: CALL solverLinear in Graph for feasibility
14.55/7.13	
14.55/7.13	LOG: RETURN solveLinear in Graph for feasibility
14.55/7.13	It's unfeasible. Removing transition: 
14.55/7.13	<l2, l2, main_x + main_y + main_z <= 0 /\ 1 <= main_x /\ 1 + main_z <= 0 /\ 2 + main_z <= main_x, {main_x -> main_x + main_y, main_y -> main_y + main_z, rest remain the same}>
14.55/7.13	
14.55/7.13	LOG: CALL solverLinear in Graph for feasibility
14.55/7.13	
14.55/7.13	LOG: RETURN solveLinear in Graph for feasibility
14.55/7.13	Strengthening transition (result): 
14.55/7.13	<l2, l2, 0 <= main_z /\ 1 <= main_x /\ 1 <= main_x + main_y + main_z /\ 1 + main_z <= main_x, {main_x -> main_x + main_y, main_y -> main_y + main_z, rest remain the same}>
14.55/7.13	[ Termination Graph ]
14.55/7.13	Strengthening and disabling transitions...
14.55/7.13	> It's unfeasible. Removing transition: 
14.55/7.13	<l2, l2, main_x + main_y + main_z <= 0 /\ 1 <= main_x /\ 1 + main_z <= 0 /\ 2 + main_z <= main_x, {main_x -> main_x + main_y, main_y -> main_y + main_z, rest remain the same}>
14.55/7.13	
14.55/7.13	LOG: CALL solverLinear in Graph for feasibility
14.55/7.13	
14.55/7.13	LOG: RETURN solveLinear in Graph for feasibility
14.55/7.13	Strengthening transition (result): 
14.55/7.13	<l2, l2, main_x <= main_z /\ 0 <= main_z /\ 1 <= main_x /\ 2 <= main_x + main_y + main_z, {main_x -> main_x + main_y, main_y -> main_y + main_z, rest remain the same}>
14.55/7.13	
14.55/7.13	LOG: CALL solverLinear in Graph for feasibility
14.55/7.13	
14.55/7.13	LOG: RETURN solveLinear in Graph for feasibility
14.55/7.13	Strengthening transition (result): 
14.55/7.13	<l2, l2, 0 <= main_z /\ 1 <= main_x /\ 1 <= main_x + main_y + main_z /\ 1 + main_z <= main_x, {main_x -> main_x + main_y, main_y -> main_y + main_z, rest remain the same}>
14.55/7.13	New Graphs: 
14.55/7.13	Transitions:
14.55/7.13	<l2, l2, main_x <= main_z /\ 0 <= main_z /\ 1 <= main_x /\ 2 <= main_x + main_y + main_z, {main_x -> main_x + main_y, main_y -> main_y + main_z, rest remain the same}>
14.55/7.13	<l2, l2, 0 <= main_z /\ 1 <= main_x /\ 1 <= main_x + main_y + main_z /\ 1 + main_z <= main_x, {main_x -> main_x + main_y, main_y -> main_y + main_z, rest remain the same}>
14.55/7.13	Variables:
14.55/7.13	main_x, main_y, main_z
14.55/7.13	Checking conditional termination of SCC {l2}...
14.55/7.13	
14.55/7.13	LOG: CALL solveLinear
14.55/7.13	
14.55/7.13	LOG: RETURN solveLinear - Elapsed time: 0.001387s
14.55/7.13	
14.55/7.13	LOG: CALL solveLinear
14.55/7.13	
14.55/7.13	LOG: RETURN solveLinear - Elapsed time: 0.007028s
14.55/7.13	[38045 : 38088]
14.55/7.13	[38045 : 38089]
14.55/7.13	Successful child: 38088
14.55/7.13	[ Invariant Graph ]
14.55/7.13	Strengthening and disabling transitions...
14.55/7.13	
14.55/7.13	LOG: CALL solverLinear in Graph for feasibility
14.55/7.13	
14.55/7.13	LOG: RETURN solveLinear in Graph for feasibility
14.55/7.13	It's unfeasible. Removing transition: 
14.55/7.13	<l2, l2, main_x <= main_z /\ 0 <= main_z /\ 1 <= main_x /\ 2 <= main_x + main_y + main_z, {main_x -> main_x + main_y, main_y -> main_y + main_z, rest remain the same}>
14.55/7.13	
14.55/7.13	LOG: CALL solverLinear in Graph for feasibility
14.55/7.13	
14.55/7.13	LOG: RETURN solveLinear in Graph for feasibility
14.55/7.13	Strengthening transition (result): 
14.55/7.13	<l2, l2, 1 <= main_x /\ 1 <= main_x + main_y + main_z /\ 1 + main_z <= main_x /\ main_z = 0, {main_x -> main_x + main_y, main_y -> main_y + main_z, rest remain the same}>
14.55/7.13	[ Termination Graph ]
14.55/7.13	Strengthening and disabling transitions...
14.55/7.13	> It's unfeasible. Removing transition: 
14.55/7.13	<l2, l2, main_x <= main_z /\ 0 <= main_z /\ 1 <= main_x /\ 2 <= main_x + main_y + main_z, {main_x -> main_x + main_y, main_y -> main_y + main_z, rest remain the same}>
14.55/7.13	
14.55/7.13	LOG: CALL solverLinear in Graph for feasibility
14.55/7.13	
14.55/7.13	LOG: RETURN solveLinear in Graph for feasibility
14.55/7.13	Strengthening transition (result): 
14.55/7.13	<l2, l2, 1 <= main_x /\ 1 <= main_x + main_y + main_z /\ 1 + main_z <= main_x /\ main_z = 0, {main_x -> main_x + main_y, main_y -> main_y + main_z, rest remain the same}>
14.55/7.13	New Graphs: 
14.55/7.13	Transitions:
14.55/7.13	<l2, l2, 1 <= main_x /\ 1 <= main_x + main_y + main_z /\ 1 + main_z <= main_x /\ main_z = 0, {main_x -> main_x + main_y, main_y -> main_y + main_z, rest remain the same}>
14.55/7.13	Variables:
14.55/7.13	main_x, main_y, main_z
14.55/7.13	Checking conditional termination of SCC {l2}...
14.55/7.13	
14.55/7.13	LOG: CALL solveLinear
14.55/7.13	
14.55/7.13	LOG: RETURN solveLinear - Elapsed time: 0.000776s
14.55/7.13	
14.55/7.13	LOG: CALL solveLinear
14.55/7.13	
14.55/7.13	LOG: RETURN solveLinear - Elapsed time: 0.002744s
14.55/7.13	[38045 : 38093]
14.55/7.13	[38045 : 38094]
14.55/7.13	Successful child: 38093
14.55/7.13	[ Invariant Graph ]
14.55/7.13	Strengthening and disabling transitions...
14.55/7.13	
14.55/7.13	LOG: CALL solverLinear in Graph for feasibility
14.55/7.13	
14.55/7.13	LOG: RETURN solveLinear in Graph for feasibility
14.55/7.13	Strengthening transition (result): 
14.55/7.13	<l2, l2, 1 <= main_x /\ 1 <= main_x + main_y + main_z /\ 1 + main_z <= main_x /\ 1 + main_y + main_z <= 0 /\ main_z = 0, {main_x -> main_x + main_y, main_y -> main_y + main_z, rest remain the same}>
14.55/7.13	[ Termination Graph ]
14.55/7.13	Strengthening and disabling transitions...
14.55/7.13	
14.55/7.13	LOG: CALL solverLinear in Graph for feasibility
14.55/7.13	
14.55/7.13	LOG: RETURN solveLinear in Graph for feasibility
14.55/7.13	Strengthening transition (result): 
14.55/7.13	<l2, l2, 1 <= main_x /\ 1 <= main_x + main_y + main_z /\ 1 + main_z <= main_x /\ 1 + main_y + main_z <= 0 /\ main_z = 0, {main_x -> main_x + main_y, main_y -> main_y + main_z, rest remain the same}>
14.55/7.13	Ranking function: main_x
14.55/7.13	New Graphs: 
14.55/7.13	
14.55/7.13	LOG: CALL check - Post:0 <= main_z - Process 4
14.55/7.13	* Exit transition: <l0, l2, main_x + main_y + main_z <= 0 /\ 1 <= main_x /\ 1 + main_z <= 0 /\ 2 + main_z <= main_x /\ main_x = undef4 /\ main_y = undef5 /\ main_z = undef6, {all remain the same}>
14.55/7.13	* Postcondition  : 0 <= main_z
14.55/7.13	
14.55/7.13	LOG: CALL solveLinear
14.55/7.13	
14.55/7.13	LOG: RETURN solveLinear - Elapsed time: 0.000874s
14.55/7.13	> Postcondition is not implied!
14.55/7.13	
14.55/7.13	LOG: RETURN check - Elapsed time: 0.001008s
14.55/7.13	INVARIANTS: 
14.55/7.13	2: 
14.55/7.13	Quasi-INVARIANTS to narrow Graph: 
14.55/7.13	2: 0 <= main_z , 
14.55/7.13	[38045 : 38098]
14.55/7.13	[38045 : 38099]
14.55/7.13	INVARIANTS: 
14.55/7.13	2: 
14.55/7.13	Quasi-INVARIANTS to narrow Graph: 
14.55/7.13	2: main_z <= 0 , 
14.55/7.13	[38045 : 38100]
14.55/7.13	[38045 : 38101]
14.55/7.13	INVARIANTS: 
14.55/7.13	2: 
14.55/7.13	Quasi-INVARIANTS to narrow Graph: 
14.55/7.13	2: 1 + main_y + main_z <= 0 , 
14.55/7.13	Narrowing transition: 
14.55/7.13	<l2, l2, main_x <= main_z /\ 1 <= main_x /\ 2 <= main_x + main_y + main_z, {main_x -> main_x + main_y, main_y -> main_y + main_z, rest remain the same}>
14.55/7.13	
14.55/7.13	LOG: Narrow transition size 3
14.55/7.13	Narrowing transition: 
14.55/7.13	<l2, l2, main_x + main_y + main_z <= 0 /\ 1 <= main_x /\ 1 + main_z <= 0 /\ 2 + main_z <= main_x, {main_x -> main_x + main_y, main_y -> main_y + main_z, rest remain the same}>
14.55/7.13	
14.55/7.13	LOG: Narrow transition size 3
14.55/7.13	Narrowing transition: 
14.55/7.13	<l2, l2, 1 <= main_x /\ 1 <= main_x + main_y + main_z /\ 1 + main_z <= main_x, {main_x -> main_x + main_y, main_y -> main_y + main_z, rest remain the same}>
14.55/7.13	
14.55/7.13	LOG: Narrow transition size 3
14.55/7.13	invGraph after Narrowing: 
14.55/7.13	Transitions:
14.55/7.13	<l2, l2, main_x <= 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, rest remain the same}>
14.55/7.13	<l2, l2, main_x + main_y + main_z <= 0 /\ 1 <= main_x /\ 1 + main_z <= 0 /\ 2 + main_z <= main_x, {main_x -> main_x + main_y, main_y -> main_y + main_z, rest remain the same}>
14.55/7.13	<l2, l2, 0 <= main_y + main_z /\ 1 <= main_x /\ 1 <= main_x + main_y + main_z /\ 1 + main_z <= main_x /\ main_z = 0, {main_x -> main_x + main_y, main_y -> main_y + main_z, rest remain the same}>
14.55/7.13	<l2, l2, 1 <= main_x /\ 1 <= main_x + main_y + main_z /\ 1 + main_z <= main_x /\ 1 + main_z <= 0, {main_x -> main_x + main_y, main_y -> main_y + main_z, rest remain the same}>
14.55/7.13	<l2, l2, 1 <= main_x /\ 1 <= main_x + main_y + main_z /\ 1 + main_z <= main_x /\ 1 <= main_z, {main_x -> main_x + main_y, main_y -> main_y + main_z, rest remain the same}>
14.55/7.13	Variables:
14.55/7.13	main_x, main_y, main_z
14.55/7.13	Checking conditional termination of SCC {l2}...
14.55/7.13	
14.55/7.13	LOG: CALL solveLinear
14.55/7.13	
14.55/7.13	LOG: RETURN solveLinear - Elapsed time: 0.003210s
14.55/7.13	
14.55/7.13	LOG: CALL solveLinear
14.55/7.13	
14.55/7.13	LOG: RETURN solveLinear - Elapsed time: 0.043861s
14.55/7.13	[38045 : 38102]
14.55/7.13	[38045 : 38103]
14.55/7.13	Successful child: 38102
14.55/7.13	[ Invariant Graph ]
14.55/7.13	Strengthening and disabling transitions...
14.55/7.13	
14.55/7.13	LOG: CALL solverLinear in Graph for feasibility
14.55/7.13	
14.55/7.13	LOG: RETURN solveLinear in Graph for feasibility
14.55/7.13	Strengthening transition (result): 
14.55/7.13	<l2, l2, main_x <= 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, rest remain the same}>
14.55/7.13	
14.55/7.13	LOG: CALL solverLinear in Graph for feasibility
14.55/7.13	
14.55/7.13	LOG: RETURN solveLinear in Graph for feasibility
14.55/7.13	It's unfeasible. Removing transition: 
14.55/7.13	<l2, l2, main_x + main_y + main_z <= 0 /\ 1 <= main_x /\ 1 + main_z <= 0 /\ 2 + main_z <= main_x, {main_x -> main_x + main_y, main_y -> main_y + main_z, rest remain the same}>
14.55/7.13	
14.55/7.13	LOG: CALL solverLinear in Graph for feasibility
14.55/7.13	
14.55/7.13	LOG: RETURN solveLinear in Graph for feasibility
14.55/7.13	Strengthening transition (result): 
14.55/7.13	<l2, l2, 0 <= main_y + main_z /\ 1 <= main_x /\ 1 <= main_x + main_y + main_z /\ 1 + main_z <= main_x /\ main_z = 0, {main_x -> main_x + main_y, main_y -> main_y + main_z, rest remain the same}>
14.55/7.13	
14.55/7.13	LOG: CALL solverLinear in Graph for feasibility
14.55/7.13	
14.55/7.13	LOG: RETURN solveLinear in Graph for feasibility
14.55/7.13	It's unfeasible. Removing transition: 
14.55/7.13	<l2, l2, 1 <= main_x /\ 1 <= main_x + main_y + main_z /\ 1 + main_z <= main_x /\ 1 + main_z <= 0, {main_x -> main_x + main_y, main_y -> main_y + main_z, rest remain the same}>
14.55/7.13	
14.55/7.13	LOG: CALL solverLinear in Graph for feasibility
14.55/7.13	
14.55/7.13	LOG: RETURN solveLinear in Graph for feasibility
14.55/7.13	Strengthening transition (result): 
14.55/7.13	<l2, l2, 1 <= main_x /\ 1 <= main_x + main_y + main_z /\ 1 + main_z <= main_x /\ 1 <= main_z, {main_x -> main_x + main_y, main_y -> main_y + main_z, rest remain the same}>
14.55/7.13	[ Termination Graph ]
14.55/7.13	Strengthening and disabling transitions...
14.55/7.13	
14.55/7.13	LOG: CALL solverLinear in Graph for feasibility
14.55/7.13	
14.55/7.13	LOG: RETURN solveLinear in Graph for feasibility
14.55/7.13	Strengthening transition (result): 
14.55/7.13	<l2, l2, main_x <= 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, rest remain the same}>
14.55/7.13	
14.55/7.13	LOG: CALL solverLinear in Graph for feasibility
14.55/7.13	
14.55/7.13	LOG: RETURN solveLinear in Graph for feasibility
14.55/7.13	It's unfeasible. Removing transition: 
14.55/7.13	<l2, l2, main_x + main_y + main_z <= 0 /\ 1 <= main_x /\ 1 + main_z <= 0 /\ 2 + main_z <= main_x, {main_x -> main_x + main_y, main_y -> main_y + main_z, rest remain the same}>
14.55/7.13	
14.55/7.13	LOG: CALL solverLinear in Graph for feasibility
14.55/7.13	
14.55/7.13	LOG: RETURN solveLinear in Graph for feasibility
14.55/7.13	Strengthening transition (result): 
14.55/7.13	<l2, l2, 0 <= main_y + main_z /\ 1 <= main_x /\ 1 <= main_x + main_y + main_z /\ 1 + main_z <= main_x /\ main_z = 0, {main_x -> main_x + main_y, main_y -> main_y + main_z, rest remain the same}>
14.55/7.13	
14.55/7.13	LOG: CALL solverLinear in Graph for feasibility
14.55/7.13	
14.55/7.13	LOG: RETURN solveLinear in Graph for feasibility
14.55/7.13	It's unfeasible. Removing transition: 
14.55/7.13	<l2, l2, 1 <= main_x /\ 1 <= main_x + main_y + main_z /\ 1 + main_z <= main_x /\ 1 + main_z <= 0, {main_x -> main_x + main_y, main_y -> main_y + main_z, rest remain the same}>
14.55/7.13	
14.55/7.13	LOG: CALL solverLinear in Graph for feasibility
14.55/7.13	
14.55/7.13	LOG: RETURN solveLinear in Graph for feasibility
14.55/7.13	Strengthening transition (result): 
14.55/7.13	<l2, l2, 1 <= main_x /\ 1 <= main_x + main_y + main_z /\ 1 + main_z <= main_x /\ 1 <= main_z, {main_x -> main_x + main_y, main_y -> main_y + main_z, rest remain the same}>
14.55/7.13	New Graphs: 
14.55/7.13	Transitions:
14.55/7.13	<l2, l2, main_x <= 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, rest remain the same}>
14.55/7.13	<l2, l2, 0 <= main_y + main_z /\ 1 <= main_x /\ 1 <= main_x + main_y + main_z /\ 1 + main_z <= main_x /\ main_z = 0, {main_x -> main_x + main_y, main_y -> main_y + main_z, rest remain the same}>
14.55/7.13	<l2, l2, 1 <= main_x /\ 1 <= main_x + main_y + main_z /\ 1 + main_z <= main_x /\ 1 <= main_z, {main_x -> main_x + main_y, main_y -> main_y + main_z, rest remain the same}>
14.55/7.13	Variables:
14.55/7.13	main_x, main_y, main_z
14.55/7.13	Checking conditional termination of SCC {l2}...
14.55/7.13	
14.55/7.13	LOG: CALL solveLinear
14.55/7.13	
14.55/7.13	LOG: RETURN solveLinear - Elapsed time: 0.002033s
14.55/7.13	
14.55/7.13	LOG: CALL solveLinear
14.55/7.13	
14.55/7.13	LOG: RETURN solveLinear - Elapsed time: 0.013075s
14.55/7.13	[38045 : 38107]
14.55/7.13	[38045 : 38108]
14.55/7.13	Successful child: 38107
14.55/7.13	[ Invariant Graph ]
14.55/7.13	Strengthening and disabling transitions...
14.55/7.13	
14.55/7.13	LOG: CALL solverLinear in Graph for feasibility
14.55/7.13	
14.55/7.13	LOG: RETURN solveLinear in Graph for feasibility
14.55/7.13	It's unfeasible. Removing transition: 
14.55/7.13	<l2, l2, main_x <= 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, rest remain the same}>
14.55/7.13	
14.55/7.13	LOG: CALL solverLinear in Graph for feasibility
14.55/7.13	
14.55/7.13	LOG: RETURN solveLinear in Graph for feasibility
14.55/7.13	Strengthening transition (result): 
14.55/7.13	<l2, l2, 0 <= main_y + main_z /\ 1 <= main_x /\ 1 <= main_x + main_y + main_z /\ 1 + main_z <= main_x /\ main_z = 0, {main_x -> main_x + main_y, main_y -> main_y + main_z, rest remain the same}>
14.55/7.13	
14.55/7.13	LOG: CALL solverLinear in Graph for feasibility
14.55/7.13	
14.55/7.13	LOG: RETURN solveLinear in Graph for feasibility
14.55/7.13	It's unfeasible. Removing transition: 
14.55/7.13	<l2, l2, 1 <= main_x /\ 1 <= main_x + main_y + main_z /\ 1 + main_z <= main_x /\ 1 <= main_z, {main_x -> main_x + main_y, main_y -> main_y + main_z, rest remain the same}>
14.55/7.13	[ Termination Graph ]
14.55/7.13	Strengthening and disabling transitions...
14.55/7.13	
14.55/7.13	LOG: CALL solverLinear in Graph for feasibility
14.55/7.13	
14.55/7.13	LOG: RETURN solveLinear in Graph for feasibility
14.55/7.13	It's unfeasible. Removing transition: 
14.55/7.13	<l2, l2, main_x <= 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, rest remain the same}>
14.55/7.13	
14.55/7.13	LOG: CALL solverLinear in Graph for feasibility
14.55/7.13	
14.55/7.13	LOG: RETURN solveLinear in Graph for feasibility
14.55/7.13	Strengthening transition (result): 
14.55/7.13	<l2, l2, 0 <= main_y + main_z /\ 1 <= main_x /\ 1 <= main_x + main_y + main_z /\ 1 + main_z <= main_x /\ main_z = 0, {main_x -> main_x + main_y, main_y -> main_y + main_z, rest remain the same}>
14.55/7.13	
14.55/7.13	LOG: CALL solverLinear in Graph for feasibility
14.55/7.13	
14.55/7.13	LOG: RETURN solveLinear in Graph for feasibility
14.55/7.13	It's unfeasible. Removing transition: 
14.55/7.13	<l2, l2, 1 <= main_x /\ 1 <= main_x + main_y + main_z /\ 1 + main_z <= main_x /\ 1 <= main_z, {main_x -> main_x + main_y, main_y -> main_y + main_z, rest remain the same}>
14.55/7.13	New Graphs: 
14.55/7.13	Transitions:
14.55/7.13	<l2, l2, 0 <= main_y + main_z /\ 1 <= main_x /\ 1 <= main_x + main_y + main_z /\ 1 + main_z <= main_x /\ main_z = 0, {main_x -> main_x + main_y, main_y -> main_y + main_z, rest remain the same}>
14.55/7.13	Variables:
14.55/7.13	main_x, main_y, main_z
14.55/7.13	Checking conditional termination of SCC {l2}...
14.55/7.13	
14.55/7.13	LOG: CALL solveLinear
14.55/7.13	
14.55/7.13	LOG: RETURN solveLinear - Elapsed time: 0.000842s
14.55/7.13	
14.55/7.13	LOG: CALL solveLinear
14.55/7.13	
14.55/7.13	LOG: RETURN solveLinear - Elapsed time: 0.003022s
14.55/7.13	[38045 : 38112]
14.55/7.13	[38045 : 38113]
14.55/7.13	Solving with 1 template(s).
14.55/7.13	
14.55/7.13	LOG: CALL solveNonLinearGetFirstSolution
14.55/7.13	
14.55/7.13	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.010870s
14.55/7.13	Time used: 0.010344
14.55/7.13	
14.55/7.13	[38045 : 38118]
14.55/7.13	[38045 : 38122]
14.55/7.13	Successful child: 38118
14.55/7.13	
14.55/7.13	Program does NOT terminate
14.55/7.13	EOF