13.46/6.78	NO
13.46/6.78	
13.46/6.78	Solver Timeout: 4
13.46/6.78	Global Timeout: 300
13.46/6.78	Maximum number of concurrent processes: 900
13.46/6.78	*******************************************************************************************
13.46/6.78	*********************** UNPROCESSED TRANSITION SYSTEMS PER FUNCTION ***********************
13.46/6.78	*******************************************************************************************
13.46/6.78	
13.46/6.78	
13.46/6.78	List of LLVMGraphs + assumeNodes + staticAssertNodes [1] :
13.46/6.78	
13.46/6.78	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
13.46/6.78	+                                                                  +
13.46/6.78	Init Location: 0
13.46/6.78	Transitions:
13.46/6.78	<l0, l1, true, seq{main__func_return_ -> 0, main_x -> ¿functionCall(__VERIFIER_nondet_int), main_y -> ¿functionCall(__VERIFIER_nondet_int)}>
13.46/6.78	<l1, l2, true>
13.46/6.78	<l2, l16, (main_y = 0)>
13.46/6.78	<l2, l3, not((main_y = 0))>
13.46/6.78	<l3, l16, not((main_x >= 0))>
13.46/6.78	<l3, l4, (main_x >= 0)>
13.46/6.78	<l4, l16, not((main_y >= 0))>
13.46/6.78	<l4, l5, (main_y >= 0)>
13.46/6.78	<l5, l6, true, seq{main_tmp -> main_y, main_xtmp -> main_x}>
13.46/6.78	<l6, l7, (main_x = main_y)>
13.46/6.78	<l6, l9, not((main_x = main_y))>
13.46/6.78	<l7, l8, true, seq{main_y -> 0}>
13.46/6.78	<l8, l14, true>
13.46/6.78	<l9, l10, true>
13.46/6.78	<l10, l13, not((main_xtmp > main_y))>
13.46/6.78	<l10, l11, (main_xtmp > main_y)>
13.46/6.78	<l11, l12, true, seq{main_xtmp -> (main_xtmp - main_y)}>
13.46/6.78	<l12, l10, true>
13.46/6.78	<l13, l14, true>
13.46/6.78	<l14, l15, true, seq{main_y -> main_xtmp, main_x -> main_tmp}>
13.46/6.78	<l15, l2, true>
13.46/6.78	<l16, l17, true, seq{main__func_return_ -> 0}>
13.46/6.78	
13.46/6.78	Fresh variables:
13.46/6.78	
13.46/6.78	Undef variables:
13.46/6.78	
13.46/6.78	Abstraction variables:
13.46/6.78	
13.46/6.78	Exit nodes:
13.46/6.78	
13.46/6.78	Accepting locations:
13.46/6.78	
13.46/6.78	Asserts:
13.46/6.78	
13.46/6.78	+ Assume Nodes [0]: ++++++++++++++++++++++++++++++++++++++++++++++++
13.46/6.78	       
13.46/6.78	+ Static Assert Nodes [0]: +++++++++++++++++++++++++++++++++++++++++
13.46/6.78	       
13.46/6.78	+ After preprocess (paralelization): ++++++++++++++++++++++++++++++
13.46/6.78	
13.46/6.78	Init Location: 0
13.46/6.78	Transitions:
13.46/6.78	<l0, l18, true, seq{main__func_return_ -> 0}>
13.46/6.78	<l18, l19, true, seq{varCall_1 -> ¿functionCall(__VERIFIER_nondet_int)}>
13.46/6.78	<l19, l20, true, seq{main_x -> varCall_1}>
13.46/6.78	<l20, l21, true, seq{varCall_2 -> ¿functionCall(__VERIFIER_nondet_int)}>
13.46/6.78	<l21, l1, true, seq{main_y -> varCall_2}>
13.46/6.78	<l1, l2, true>
13.46/6.78	<l2, l16, (main_y = 0)>
13.46/6.78	<l2, l3, not((main_y = 0))>
13.46/6.78	<l3, l4, (main_x >= 0)>
13.46/6.78	<l3, l16, not((main_x >= 0))>
13.46/6.78	<l4, l5, (main_y >= 0)>
13.46/6.78	<l4, l16, not((main_y >= 0))>
13.46/6.78	<l5, l6, true, seq{main_tmp -> main_y, main_xtmp -> main_x}>
13.46/6.78	<l6, l7, (main_x = main_y)>
13.46/6.78	<l6, l9, not((main_x = main_y))>
13.46/6.78	<l7, l8, true, seq{main_y -> 0}>
13.46/6.78	<l8, l14, true>
13.46/6.78	<l9, l10, true>
13.46/6.78	<l10, l11, (main_xtmp > main_y)>
13.46/6.78	<l10, l13, not((main_xtmp > main_y))>
13.46/6.78	<l11, l12, true, seq{main_xtmp -> (main_xtmp - main_y)}>
13.46/6.78	<l12, l10, true>
13.46/6.78	<l13, l14, true>
13.46/6.78	<l14, l15, true, seq{main_y -> main_xtmp, main_x -> main_tmp}>
13.46/6.78	<l15, l2, true>
13.46/6.78	<l16, l17, true, seq{main__func_return_ -> 0}>
13.46/6.78	
13.46/6.78	Fresh variables:
13.46/6.78	
13.46/6.78	Undef variables:
13.46/6.78	
13.46/6.78	Abstraction variables:
13.46/6.78	
13.46/6.78	Exit nodes:
13.46/6.78	17, 
13.46/6.78	Accepting locations:
13.46/6.78	
13.46/6.78	Asserts:
13.46/6.78	
13.46/6.78	+                                                                  +
13.46/6.78	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
13.46/6.78	
13.46/6.78	
13.46/6.78	Function Return and Parameters Information [2 functions]:
13.46/6.78	    function name: __VERIFIER_nondet_int [1 return + 0 parameters]        demangled: __VERIFIER_nondet_int
13.46/6.78	        __VERIFIER_nondet_int__func_return_      [function result] : int
13.46/6.78	    function name: main [1 return + 0 parameters]        demangled: main
13.46/6.78	        main__func_return_      [function result] : int
13.46/6.78	
13.46/6.78	
13.46/6.78	AST Ident Scanner Information [6 idents]:
13.46/6.78	__VERIFIER_nondet_int | function | [integer, ()] | <line: 3, col: 1> | <line: 10, col: 9> <line: 11, col: 9>
13.46/6.78	main | function | [integer, ()] | <line: 5, col: 1>
13.46/6.78	x | local variable | integer | <line: 6, col: 5> | <line: 10, col: 5> <line: 13, col: 22> <line: 15, col: 16> <line: 17, col: 13> <line: 27, col: 9>
13.46/6.78	y | local variable | integer | <line: 7, col: 5> | <line: 11, col: 5> <line: 13, col: 12> <line: 13, col: 33> <line: 14, col: 15> <line: 17, col: 18> <line: 18, col: 13> <line: 21, col: 24> <line: 22, col: 31> <line: 26, col: 9>
13.46/6.78	tmp | local variable | integer | <line: 8, col: 5> | <line: 14, col: 9> <line: 27, col: 13>
13.46/6.78	xtmp | local variable | integer | <line: 9, col: 5> | <line: 15, col: 9> <line: 21, col: 19> <line: 22, col: 17> <line: 22, col: 24> <line: 26, col: 13>
13.46/6.78	
13.46/6.78	Main function: main
13.46/6.78	Preprocessed LLVMGraph
13.46/6.78	Init Location: 0
13.46/6.78	Transitions:
13.46/6.78	<l0, l2, (main_x = undef3) /\ (main_y = undef4)>
13.46/6.78	<l2, l17, (main_y = 0)>
13.46/6.78	<l2, l17, (main_y < 0) /\ (main_x >= 0) /\ not((main_y >= 0))>
13.46/6.78	<l2, l17, (main_y < 0) /\ not((main_x >= 0))>
13.46/6.78	<l2, l2, (main_y > 0) /\ (main_x >= 0) /\ (main_y >= 0) /\ (main_x = main_y), par{main_x -> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x}>
13.46/6.78	<l2, l10, (main_y > 0) /\ (main_x >= 0) /\ (main_y >= 0) /\ (main_x < main_y), par{main_tmp -> main_y, main_xtmp -> main_x}>
13.46/6.78	<l2, l10, (main_y > 0) /\ (main_x >= 0) /\ (main_y >= 0) /\ (main_x > main_y), par{main_tmp -> main_y, main_xtmp -> main_x}>
13.46/6.78	<l2, l17, (main_y > 0) /\ not((main_x >= 0))>
13.46/6.78	<l10, l10, (main_xtmp > main_y), par{main_xtmp -> (main_xtmp - main_y)}>
13.46/6.78	<l10, l2, not((main_xtmp > main_y)), par{main_x -> main_tmp, main_y -> main_xtmp}>
13.46/6.78	
13.46/6.78	Fresh variables:
13.46/6.78	undef3, undef4, 
13.46/6.78	
13.46/6.78	Undef variables:
13.46/6.78	undef3, undef4, 
13.46/6.78	
13.46/6.78	Abstraction variables:
13.46/6.78	
13.46/6.78	Exit nodes:
13.46/6.78	17, 
13.46/6.78	Accepting locations:
13.46/6.78	
13.46/6.78	Asserts:
13.46/6.78	
13.46/6.78	*************************************************************
13.46/6.78	*******************************************************************************************
13.46/6.78	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
13.46/6.78	*******************************************************************************************
13.46/6.78	
13.46/6.78	Init Location: 0
13.46/6.78	Graph 0:
13.46/6.78	Transitions:
13.46/6.78	Variables:
13.46/6.78	
13.46/6.78	Graph 1:
13.46/6.78	Transitions:
13.46/6.78	<l2, l2, 0 <= main_x /\ 1 <= main_y /\ main_x = main_y, {main_x -> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}>
13.46/6.78	<l2, l10, 0 <= main_x /\ 1 + main_x <= main_y /\ 1 <= main_y, {main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}>
13.46/6.78	<l2, l10, 0 <= main_x /\ 1 + main_y <= main_x /\ 1 <= main_y, {main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}>
13.46/6.78	<l10, l10, 1 + main_y <= main_xtmp, {main_xtmp -> -main_y + main_xtmp, rest remain the same}>
13.46/6.78	<l10, l2, main_xtmp <= main_y, {main_x -> main_tmp, main_y -> main_xtmp, rest remain the same}>
13.46/6.78	Variables:
13.46/6.78	main_x, main_y, main_tmp, main_xtmp
13.46/6.78	
13.46/6.78	Graph 2:
13.46/6.78	Transitions:
13.46/6.78	Variables:
13.46/6.78	
13.46/6.78	Precedence: 
13.46/6.78	Graph 0
13.46/6.78	
13.46/6.78	Graph 1
13.46/6.78	<l0, l2, main_x = undef3 /\ main_y = undef4, {all remain the same}>
13.46/6.78	
13.46/6.78	Graph 2
13.46/6.78	<l2, l17, main_y = 0, {all remain the same}>
13.46/6.78	<l2, l17, 0 <= main_x /\ 1 + main_y <= 0, {all remain the same}>
13.46/6.78	<l2, l17, 1 + main_x <= 0 /\ 1 + main_y <= 0, {all remain the same}>
13.46/6.78	<l2, l17, 1 + main_x <= 0 /\ 1 <= main_y, {all remain the same}>
13.46/6.78	
13.46/6.78	Map Locations to Subgraph:
13.46/6.78	( 0 , 0 )
13.46/6.78	( 2 , 1 )
13.46/6.78	( 10 , 1 )
13.46/6.78	( 17 , 2 )
13.46/6.78	
13.46/6.78	*******************************************************************************************
13.46/6.78	********************************    CHECKING ASSERTIONS    ********************************
13.46/6.78	*******************************************************************************************
13.46/6.78	
13.46/6.78	Proving termination of subgraph 0
13.46/6.78	Proving termination of subgraph 1
13.46/6.78	Checking unfeasibility...
13.46/6.78	Time used: 0.020174
13.46/6.78	
13.46/6.78	Checking conditional termination of SCC {l2, l10}...
13.46/6.78	
13.46/6.78	LOG: CALL solveLinear
13.46/6.78	
13.46/6.78	LOG: RETURN solveLinear - Elapsed time: 0.002899s
13.46/6.78	
13.46/6.78	LOG: CALL solveLinear
13.46/6.78	
13.46/6.78	LOG: RETURN solveLinear - Elapsed time: 0.012949s
13.46/6.78	[6690 : 6692]
13.46/6.78	[6690 : 6693]
13.46/6.78	Successful child: 6692
13.46/6.78	[ Invariant Graph ]
13.46/6.78	Strengthening and disabling transitions...
13.46/6.78	
13.46/6.78	LOG: CALL solverLinear in Graph for feasibility
13.46/6.78	
13.46/6.78	LOG: RETURN solveLinear in Graph for feasibility
13.46/6.78	It's unfeasible. Removing transition: 
13.46/6.78	<l2, l2, 0 <= main_x /\ 1 <= main_y /\ main_x = main_y, {main_x -> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}>
13.46/6.78	
13.46/6.78	LOG: CALL solverLinear in Graph for feasibility
13.46/6.78	
13.46/6.78	LOG: RETURN solveLinear in Graph for feasibility
13.46/6.78	It's unfeasible. Removing transition: 
13.46/6.78	<l2, l10, 0 <= main_x /\ 1 + main_x <= main_y /\ 1 <= main_y, {main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}>
13.46/6.78	
13.46/6.78	LOG: CALL solverLinear in Graph for feasibility
13.46/6.78	
13.46/6.78	LOG: RETURN solveLinear in Graph for feasibility
13.46/6.78	It's unfeasible. Removing transition: 
13.46/6.78	<l2, l10, 0 <= main_x /\ 1 + main_y <= main_x /\ 1 <= main_y, {main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}>
13.46/6.78	
13.46/6.78	LOG: CALL solverLinear in Graph for feasibility
13.46/6.78	
13.46/6.78	LOG: RETURN solveLinear in Graph for feasibility
13.46/6.78	It's unfeasible. Removing transition: 
13.46/6.78	<l10, l10, 1 + main_y <= main_xtmp, {main_xtmp -> -main_y + main_xtmp, rest remain the same}>
13.46/6.78	
13.46/6.78	LOG: CALL solverLinear in Graph for feasibility
13.46/6.78	
13.46/6.78	LOG: RETURN solveLinear in Graph for feasibility
13.46/6.78	It's unfeasible. Removing transition: 
13.46/6.78	<l10, l2, main_xtmp <= main_y, {main_x -> main_tmp, main_y -> main_xtmp, rest remain the same}>
13.46/6.78	[ Termination Graph ]
13.46/6.78	Strengthening and disabling transitions...
13.46/6.78	
13.46/6.78	LOG: CALL solverLinear in Graph for feasibility
13.46/6.78	
13.46/6.78	LOG: RETURN solveLinear in Graph for feasibility
13.46/6.78	It's unfeasible. Removing transition: 
13.46/6.78	<l2, l2, 0 <= main_x /\ 1 <= main_y /\ main_x = main_y, {main_x -> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}>
13.46/6.78	
13.46/6.78	LOG: CALL solverLinear in Graph for feasibility
13.46/6.78	
13.46/6.78	LOG: RETURN solveLinear in Graph for feasibility
13.46/6.78	It's unfeasible. Removing transition: 
13.46/6.78	<l2, l10, 0 <= main_x /\ 1 + main_x <= main_y /\ 1 <= main_y, {main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}>
13.46/6.78	
13.46/6.78	LOG: CALL solverLinear in Graph for feasibility
13.46/6.78	
13.46/6.78	LOG: RETURN solveLinear in Graph for feasibility
13.46/6.78	It's unfeasible. Removing transition: 
13.46/6.78	<l2, l10, 0 <= main_x /\ 1 + main_y <= main_x /\ 1 <= main_y, {main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}>
13.46/6.78	
13.46/6.78	LOG: CALL solverLinear in Graph for feasibility
13.46/6.78	
13.46/6.78	LOG: RETURN solveLinear in Graph for feasibility
13.46/6.78	It's unfeasible. Removing transition: 
13.46/6.78	<l10, l10, 1 + main_y <= main_xtmp, {main_xtmp -> -main_y + main_xtmp, rest remain the same}>
13.46/6.78	
13.46/6.78	LOG: CALL solverLinear in Graph for feasibility
13.46/6.78	
13.46/6.78	LOG: RETURN solveLinear in Graph for feasibility
13.46/6.78	It's unfeasible. Removing transition: 
13.46/6.78	<l10, l2, main_xtmp <= main_y, {main_x -> main_tmp, main_y -> main_xtmp, rest remain the same}>
13.46/6.78	New Graphs: 
13.46/6.78	
13.46/6.78	LOG: CALL check - Post:1 + main_x <= 0 - Process 1
13.46/6.78	* Exit transition: <l0, l2, main_x = undef3 /\ main_y = undef4, {all remain the same}>
13.46/6.78	* Postcondition  : 1 + main_x <= 0
13.46/6.78	
13.46/6.78	LOG: CALL solveLinear
13.46/6.78	
13.46/6.78	LOG: RETURN solveLinear - Elapsed time: 0.000623s
13.46/6.78	> Postcondition is not implied!
13.46/6.78	
13.46/6.78	LOG: RETURN check - Elapsed time: 0.000712s
13.46/6.78	INVARIANTS: 
13.46/6.78	2: 
13.46/6.78	10: 
13.46/6.78	Quasi-INVARIANTS to narrow Graph: 
13.46/6.78	2: 1 + main_x <= 0 , 
13.46/6.78	10: 1 <= 0 , 
13.46/6.78	Narrowing transition: 
13.46/6.78	<l2, l2, 0 <= main_x /\ 1 <= main_y /\ main_x = main_y, {main_x -> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}>
13.46/6.78	
13.46/6.78	LOG: Narrow transition size 1
13.46/6.78	Narrowing transition: 
13.46/6.78	<l2, l10, 0 <= main_x /\ 1 + main_x <= main_y /\ 1 <= main_y, {main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}>
13.46/6.78	
13.46/6.78	LOG: Narrow transition size 1
13.46/6.78	Narrowing transition: 
13.46/6.78	<l2, l10, 0 <= main_x /\ 1 + main_y <= main_x /\ 1 <= main_y, {main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}>
13.46/6.78	
13.46/6.78	LOG: Narrow transition size 1
13.46/6.78	Narrowing transition: 
13.46/6.78	<l10, l10, 1 + main_y <= main_xtmp, {main_xtmp -> -main_y + main_xtmp, rest remain the same}>
13.46/6.78	
13.46/6.78	LOG: Narrow transition size 1
13.46/6.78	Narrowing transition: 
13.46/6.78	<l10, l2, main_xtmp <= main_y, {main_x -> main_tmp, main_y -> main_xtmp, rest remain the same}>
13.46/6.78	
13.46/6.78	LOG: Narrow transition size 1
13.46/6.78	invGraph after Narrowing: 
13.46/6.78	Transitions:
13.46/6.78	<l2, l2, 0 <= main_x /\ 1 <= main_y /\ main_x = main_y, {main_x -> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}>
13.46/6.78	<l2, l10, 0 <= main_x /\ 1 + main_x <= main_y /\ 1 <= main_y, {main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}>
13.46/6.78	<l2, l10, 0 <= main_x /\ 1 + main_y <= main_x /\ 1 <= main_y, {main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}>
13.46/6.78	<l10, l10, 0 <= 0 /\ 1 + main_y <= main_xtmp, {main_xtmp -> -main_y + main_xtmp, rest remain the same}>
13.46/6.78	<l10, l2, 0 <= 0 /\ main_xtmp <= main_y, {main_x -> main_tmp, main_y -> main_xtmp, rest remain the same}>
13.46/6.78	Variables:
13.46/6.78	main_x, main_y, main_tmp, main_xtmp
13.46/6.78	Checking conditional termination of SCC {l2, l10}...
13.46/6.78	
13.46/6.78	LOG: CALL solveLinear
13.46/6.78	
13.46/6.78	LOG: RETURN solveLinear - Elapsed time: 0.002236s
13.46/6.78	
13.46/6.78	LOG: CALL solveLinear
13.46/6.78	
13.46/6.78	LOG: RETURN solveLinear - Elapsed time: 0.013594s
13.46/6.78	[6690 : 6697]
13.46/6.78	[6690 : 6698]
13.46/6.78	Successful child: 6697
13.46/6.78	[ Invariant Graph ]
13.46/6.78	Strengthening and disabling transitions...
13.46/6.78	
13.46/6.78	LOG: CALL solverLinear in Graph for feasibility
13.46/6.78	
13.46/6.78	LOG: RETURN solveLinear in Graph for feasibility
13.46/6.78	It's unfeasible. Removing transition: 
13.46/6.78	<l2, l2, 0 <= main_x /\ 1 <= main_y /\ main_x = main_y, {main_x -> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}>
13.46/6.78	
13.46/6.78	LOG: CALL solverLinear in Graph for feasibility
13.46/6.78	
13.46/6.78	LOG: RETURN solveLinear in Graph for feasibility
13.46/6.78	It's unfeasible. Removing transition: 
13.46/6.78	<l2, l10, 0 <= main_x /\ 1 + main_x <= main_y /\ 1 <= main_y, {main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}>
13.46/6.78	
13.46/6.78	LOG: CALL solverLinear in Graph for feasibility
13.46/6.78	
13.46/6.78	LOG: RETURN solveLinear in Graph for feasibility
13.46/6.78	It's unfeasible. Removing transition: 
13.46/6.78	<l2, l10, 0 <= main_x /\ 1 + main_y <= main_x /\ 1 <= main_y, {main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}>
13.46/6.78	
13.46/6.78	LOG: CALL solverLinear in Graph for feasibility
13.46/6.78	
13.46/6.78	LOG: RETURN solveLinear in Graph for feasibility
13.46/6.78	It's unfeasible. Removing transition: 
13.46/6.78	<l10, l10, 0 <= 0 /\ 1 + main_y <= main_xtmp, {main_xtmp -> -main_y + main_xtmp, rest remain the same}>
13.46/6.78	
13.46/6.78	LOG: CALL solverLinear in Graph for feasibility
13.46/6.78	
13.46/6.78	LOG: RETURN solveLinear in Graph for feasibility
13.46/6.78	It's unfeasible. Removing transition: 
13.46/6.78	<l10, l2, 0 <= 0 /\ main_xtmp <= main_y, {main_x -> main_tmp, main_y -> main_xtmp, rest remain the same}>
13.46/6.78	[ Termination Graph ]
13.46/6.78	Strengthening and disabling transitions...
13.46/6.78	
13.46/6.78	LOG: CALL solverLinear in Graph for feasibility
13.46/6.78	
13.46/6.78	LOG: RETURN solveLinear in Graph for feasibility
13.46/6.78	It's unfeasible. Removing transition: 
13.46/6.78	<l2, l2, 0 <= main_x /\ 1 <= main_y /\ main_x = main_y, {main_x -> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}>
13.46/6.78	
13.46/6.78	LOG: CALL solverLinear in Graph for feasibility
13.46/6.78	
13.46/6.78	LOG: RETURN solveLinear in Graph for feasibility
13.46/6.78	It's unfeasible. Removing transition: 
13.46/6.78	<l2, l10, 0 <= main_x /\ 1 + main_x <= main_y /\ 1 <= main_y, {main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}>
13.46/6.78	
13.46/6.78	LOG: CALL solverLinear in Graph for feasibility
13.46/6.78	
13.46/6.78	LOG: RETURN solveLinear in Graph for feasibility
13.46/6.78	It's unfeasible. Removing transition: 
13.46/6.78	<l2, l10, 0 <= main_x /\ 1 + main_y <= main_x /\ 1 <= main_y, {main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}>
13.46/6.78	
13.46/6.78	LOG: CALL solverLinear in Graph for feasibility
13.46/6.78	
13.46/6.78	LOG: RETURN solveLinear in Graph for feasibility
13.46/6.78	It's unfeasible. Removing transition: 
13.46/6.78	<l10, l10, 0 <= 0 /\ 1 + main_y <= main_xtmp, {main_xtmp -> -main_y + main_xtmp, rest remain the same}>
13.46/6.78	
13.46/6.78	LOG: CALL solverLinear in Graph for feasibility
13.46/6.78	
13.46/6.78	LOG: RETURN solveLinear in Graph for feasibility
13.46/6.78	It's unfeasible. Removing transition: 
13.46/6.78	<l10, l2, 0 <= 0 /\ main_xtmp <= main_y, {main_x -> main_tmp, main_y -> main_xtmp, rest remain the same}>
13.46/6.78	New Graphs: 
13.46/6.78	
13.46/6.78	LOG: CALL check - Post:main_y <= 0 - Process 2
13.46/6.78	* Exit transition: <l0, l2, 0 <= main_x /\ main_x = undef3 /\ main_y = undef4, {all remain the same}>
13.46/6.78	* Postcondition  : main_y <= 0
13.46/6.78	
13.46/6.78	LOG: CALL solveLinear
13.46/6.78	
13.46/6.78	LOG: RETURN solveLinear - Elapsed time: 0.000990s
13.46/6.78	> Postcondition is not implied!
13.46/6.78	
13.46/6.78	LOG: RETURN check - Elapsed time: 0.001085s
13.46/6.78	INVARIANTS: 
13.46/6.78	2: 
13.46/6.78	10: 
13.46/6.78	Quasi-INVARIANTS to narrow Graph: 
13.46/6.78	2: main_y <= 0 , 
13.46/6.78	10: 1 <= 0 , 
13.46/6.78	Narrowing transition: 
13.46/6.78	<l2, l2, 0 <= main_x /\ 1 <= main_y /\ main_x = main_y, {main_x -> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}>
13.46/6.78	
13.46/6.78	LOG: Narrow transition size 1
13.46/6.78	Narrowing transition: 
13.46/6.78	<l2, l10, 0 <= main_x /\ 1 + main_x <= main_y /\ 1 <= main_y, {main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}>
13.46/6.78	
13.46/6.78	LOG: Narrow transition size 1
13.46/6.78	Narrowing transition: 
13.46/6.78	<l2, l10, 0 <= main_x /\ 1 + main_y <= main_x /\ 1 <= main_y, {main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}>
13.46/6.78	
13.46/6.78	LOG: Narrow transition size 1
13.46/6.78	Narrowing transition: 
13.46/6.78	<l10, l10, 0 <= 0 /\ 1 + main_y <= main_xtmp, {main_xtmp -> -main_y + main_xtmp, rest remain the same}>
13.46/6.78	
13.46/6.78	LOG: Narrow transition size 1
13.46/6.78	Narrowing transition: 
13.46/6.78	<l10, l2, 0 <= 0 /\ main_xtmp <= main_y, {main_x -> main_tmp, main_y -> main_xtmp, rest remain the same}>
13.46/6.78	
13.46/6.78	LOG: Narrow transition size 1
13.46/6.78	invGraph after Narrowing: 
13.46/6.78	Transitions:
13.46/6.78	<l2, l2, 0 <= main_x /\ 1 <= main_y /\ main_x = main_y, {main_x -> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}>
13.46/6.78	<l2, l10, 0 <= main_x /\ 1 + main_x <= main_y /\ 1 <= main_y, {main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}>
13.46/6.78	<l2, l10, 0 <= main_x /\ 1 + main_y <= main_x /\ 1 <= main_y, {main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}>
13.46/6.78	<l10, l10, 0 <= 0 /\ 1 + main_y <= main_xtmp, {main_xtmp -> -main_y + main_xtmp, rest remain the same}>
13.46/6.78	<l10, l2, 0 <= 0 /\ main_xtmp <= main_y, {main_x -> main_tmp, main_y -> main_xtmp, rest remain the same}>
13.46/6.78	Variables:
13.46/6.78	main_x, main_y, main_tmp, main_xtmp
13.46/6.78	Checking conditional termination of SCC {l2, l10}...
13.46/6.78	
13.46/6.78	LOG: CALL solveLinear
13.46/6.78	
13.46/6.78	LOG: RETURN solveLinear - Elapsed time: 0.002276s
13.46/6.78	
13.46/6.78	LOG: CALL solveLinear
13.46/6.78	
13.46/6.78	LOG: RETURN solveLinear - Elapsed time: 0.013506s
13.46/6.78	[6690 : 6702]
13.46/6.78	[6690 : 6703]
13.46/6.78	Successful child: 6702
13.46/6.78	[ Invariant Graph ]
13.46/6.78	Strengthening and disabling transitions...
13.46/6.78	
13.46/6.78	LOG: CALL solverLinear in Graph for feasibility
13.46/6.78	
13.46/6.78	LOG: RETURN solveLinear in Graph for feasibility
13.46/6.78	Strengthening transition (result): 
13.46/6.78	<l2, l2, 0 <= main_x /\ 1 <= main_y /\ main_x = main_y, {main_x -> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}>
13.46/6.78	
13.46/6.78	LOG: CALL solverLinear in Graph for feasibility
13.46/6.78	
13.46/6.78	LOG: RETURN solveLinear in Graph for feasibility
13.46/6.78	It's unfeasible. Removing transition: 
13.46/6.78	<l2, l10, 0 <= main_x /\ 1 + main_x <= main_y /\ 1 <= main_y, {main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}>
13.46/6.78	
13.46/6.78	LOG: CALL solverLinear in Graph for feasibility
13.46/6.78	
13.46/6.78	LOG: RETURN solveLinear in Graph for feasibility
13.46/6.78	Strengthening transition (result): 
13.46/6.78	<l2, l10, 0 <= main_x /\ 1 + main_y <= main_x /\ 1 <= main_y, {main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}>
13.46/6.78	
13.46/6.78	LOG: CALL solverLinear in Graph for feasibility
13.46/6.78	
13.46/6.78	LOG: RETURN solveLinear in Graph for feasibility
13.46/6.78	Strengthening transition (result): 
13.46/6.78	<l10, l10, 0 <= 0 /\ main_y <= main_tmp /\ 1 + main_y <= main_xtmp, {main_xtmp -> -main_y + main_xtmp, rest remain the same}>
13.46/6.78	
13.46/6.78	LOG: CALL solverLinear in Graph for feasibility
13.46/6.78	
13.46/6.78	LOG: RETURN solveLinear in Graph for feasibility
13.46/6.78	Strengthening transition (result): 
13.46/6.78	<l10, l2, 0 <= 0 /\ main_y <= main_tmp /\ main_xtmp <= main_y, {main_x -> main_tmp, main_y -> main_xtmp, rest remain the same}>
13.46/6.78	[ Termination Graph ]
13.46/6.78	Strengthening and disabling transitions...
13.46/6.78	> It's unfeasible. Removing transition: 
13.46/6.78	<l2, l10, 0 <= main_x /\ 1 + main_x <= main_y /\ 1 <= main_y, {main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}>
13.46/6.78	
13.46/6.78	LOG: CALL solverLinear in Graph for feasibility
13.46/6.78	
13.46/6.78	LOG: RETURN solveLinear in Graph for feasibility
13.46/6.78	Strengthening transition (result): 
13.46/6.78	<l2, l2, 0 <= main_x /\ 1 <= main_y /\ main_x = main_y, {main_x -> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}>
13.46/6.78	
13.46/6.78	LOG: CALL solverLinear in Graph for feasibility
13.46/6.78	
13.46/6.78	LOG: RETURN solveLinear in Graph for feasibility
13.46/6.78	Strengthening transition (result): 
13.46/6.78	<l2, l10, 0 <= main_x /\ 1 + main_y <= main_x /\ 1 <= main_y, {main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}>
13.46/6.78	
13.46/6.78	LOG: CALL solverLinear in Graph for feasibility
13.46/6.78	
13.46/6.78	LOG: RETURN solveLinear in Graph for feasibility
13.46/6.78	Strengthening transition (result): 
13.46/6.78	<l10, l10, 0 <= 0 /\ main_y <= main_tmp /\ 1 + main_y <= main_xtmp, {main_xtmp -> -main_y + main_xtmp, rest remain the same}>
13.46/6.78	
13.46/6.78	LOG: CALL solverLinear in Graph for feasibility
13.46/6.78	
13.46/6.78	LOG: RETURN solveLinear in Graph for feasibility
13.46/6.78	Strengthening transition (result): 
13.46/6.78	<l10, l2, 0 <= 0 /\ main_y <= main_tmp /\ main_xtmp <= main_y, {main_x -> main_tmp, main_y -> main_xtmp, rest remain the same}>
13.46/6.78	New Graphs: 
13.46/6.78	Transitions:
13.46/6.78	<l2, l2, 0 <= main_x /\ 1 <= main_y /\ main_x = main_y, {main_x -> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}>
13.46/6.78	<l2, l10, 0 <= main_x /\ 1 + main_y <= main_x /\ 1 <= main_y, {main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}>
13.46/6.78	<l10, l10, 0 <= 0 /\ main_y <= main_tmp /\ 1 + main_y <= main_xtmp, {main_xtmp -> -main_y + main_xtmp, rest remain the same}>
13.46/6.78	<l10, l2, 0 <= 0 /\ main_y <= main_tmp /\ main_xtmp <= main_y, {main_x -> main_tmp, main_y -> main_xtmp, rest remain the same}>
13.46/6.78	Variables:
13.46/6.78	main_x, main_y, main_tmp, main_xtmp
13.46/6.78	Checking conditional termination of SCC {l2, l10}...
13.46/6.78	
13.46/6.78	LOG: CALL solveLinear
13.46/6.78	
13.46/6.78	LOG: RETURN solveLinear - Elapsed time: 0.002077s
13.46/6.78	
13.46/6.78	LOG: CALL solveLinear
13.46/6.78	
13.46/6.78	LOG: RETURN solveLinear - Elapsed time: 0.011779s
13.46/6.78	[6690 : 6707]
13.46/6.78	[6690 : 6708]
13.46/6.78	Successful child: 6707
13.46/6.78	[ Invariant Graph ]
13.46/6.78	Strengthening and disabling transitions...
13.46/6.78	
13.46/6.78	LOG: CALL solverLinear in Graph for feasibility
13.46/6.78	
13.46/6.78	LOG: RETURN solveLinear in Graph for feasibility
13.46/6.78	
13.46/6.78	LOG: CALL solverLinear in Graph for feasibility
13.46/6.78	
13.46/6.78	LOG: RETURN solveLinear in Graph for feasibility
13.46/6.78	Strengthening transition (result): 
13.46/6.78	<l10, l10, 0 <= 0 /\ main_y <= main_tmp /\ 1 + main_tmp <= main_x /\ 1 + main_y <= main_xtmp /\ 0 <= 1 + main_x, {main_xtmp -> -main_y + main_xtmp, rest remain the same}>
13.46/6.78	
13.46/6.78	LOG: CALL solverLinear in Graph for feasibility
13.46/6.78	
13.46/6.78	LOG: RETURN solveLinear in Graph for feasibility
13.46/6.78	Strengthening transition (result): 
13.46/6.78	<l10, l2, 0 <= 0 /\ main_y <= main_tmp /\ main_xtmp <= main_y /\ 1 + main_tmp <= main_x /\ 0 <= 1 + main_x, {main_x -> main_tmp, main_y -> main_xtmp, rest remain the same}>
13.46/6.78	[ Termination Graph ]
13.46/6.78	Strengthening and disabling transitions...
13.46/6.78	
13.46/6.78	LOG: CALL solverLinear in Graph for feasibility
13.46/6.78	
13.46/6.78	LOG: RETURN solveLinear in Graph for feasibility
13.46/6.78	
13.46/6.78	LOG: CALL solverLinear in Graph for feasibility
13.46/6.78	
13.46/6.78	LOG: RETURN solveLinear in Graph for feasibility
13.46/6.78	Strengthening transition (result): 
13.46/6.78	<l10, l10, 0 <= 0 /\ main_y <= main_tmp /\ 1 + main_tmp <= main_x /\ 1 + main_y <= main_xtmp /\ 0 <= 1 + main_x, {main_xtmp -> -main_y + main_xtmp, rest remain the same}>
13.46/6.78	
13.46/6.78	LOG: CALL solverLinear in Graph for feasibility
13.46/6.78	
13.46/6.78	LOG: RETURN solveLinear in Graph for feasibility
13.46/6.78	Strengthening transition (result): 
13.46/6.78	<l10, l2, 0 <= 0 /\ main_y <= main_tmp /\ main_xtmp <= main_y /\ 1 + main_tmp <= main_x /\ 0 <= 1 + main_x, {main_x -> main_tmp, main_y -> main_xtmp, rest remain the same}>
13.46/6.78	Ranking function: 1 + main_x
13.46/6.78	New Graphs: 
13.46/6.78	Transitions:
13.46/6.78	<l2, l2, 0 <= main_x /\ 1 <= main_y /\ main_x = main_y, {main_x -> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}>
13.46/6.78	Variables:
13.46/6.78	main_x, main_y, main_tmp, main_xtmp
13.46/6.78	Transitions:
13.46/6.78	<l10, l10, 0 <= 0 /\ main_y <= main_tmp /\ 1 + main_tmp <= main_x /\ 1 + main_y <= main_xtmp /\ 0 <= 1 + main_x, {main_xtmp -> -main_y + main_xtmp, rest remain the same}>
13.46/6.78	Variables:
13.46/6.78	main_x, main_y, main_tmp, main_xtmp
13.46/6.78	Checking conditional termination of SCC {l2}...
13.46/6.78	
13.46/6.78	LOG: CALL solveLinear
13.46/6.78	
13.46/6.78	LOG: RETURN solveLinear - Elapsed time: 0.000778s
13.46/6.78	
13.46/6.78	LOG: CALL solveLinear
13.46/6.78	
13.46/6.78	LOG: RETURN solveLinear - Elapsed time: 0.002653s
13.46/6.78	[6690 : 6712]
13.46/6.78	[6690 : 6713]
13.46/6.78	Solving with 1 template(s).
13.46/6.78	
13.46/6.78	LOG: CALL solveNonLinearGetFirstSolution
13.46/6.78	
13.46/6.78	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.019858s
13.46/6.78	Time used: 0.019421
13.46/6.78	
13.46/6.78	[6690 : 6717]
13.46/6.78	[6690 : 6721]
13.46/6.78	Successful child: 6717
13.46/6.78	
13.46/6.78	Program does NOT terminate
13.46/6.78	EOF