9.97/5.39	NO
9.97/5.39	
9.97/5.39	Solver Timeout: 4
9.97/5.39	Global Timeout: 300
9.97/5.39	Maximum number of concurrent processes: 900
9.97/5.39	*******************************************************************************************
9.97/5.39	*********************** UNPROCESSED TRANSITION SYSTEMS PER FUNCTION ***********************
9.97/5.39	*******************************************************************************************
9.97/5.39	
9.97/5.39	
9.97/5.39	List of LLVMGraphs + assumeNodes + staticAssertNodes [1] :
9.97/5.39	
9.97/5.39	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
9.97/5.39	+                                                                  +
9.97/5.39	Init Location: 0
9.97/5.39	Transitions:
9.97/5.39	<l0, l1, true, seq{main__func_return_ -> 0, main_x -> ¿functionCall(__VERIFIER_nondet_int), main_y -> ¿functionCall(__VERIFIER_nondet_int)}>
9.97/5.39	<l1, l2, true>
9.97/5.39	<l2, l5, not((main_x < main_y))>
9.97/5.39	<l2, l3, (main_x < main_y)>
9.97/5.39	<l3, l4, true, seq{main_x -> (main_x + main_y), main_y -> (~(2) * main_y)}>
9.97/5.39	<l4, l2, true>
9.97/5.39	<l5, l6, true, seq{main__func_return_ -> 0}>
9.97/5.39	
9.97/5.39	Fresh variables:
9.97/5.39	
9.97/5.39	Undef variables:
9.97/5.39	
9.97/5.39	Abstraction variables:
9.97/5.39	
9.97/5.39	Exit nodes:
9.97/5.39	
9.97/5.39	Accepting locations:
9.97/5.39	
9.97/5.39	Asserts:
9.97/5.39	
9.97/5.39	+ Assume Nodes [0]: ++++++++++++++++++++++++++++++++++++++++++++++++
9.97/5.39	       
9.97/5.39	+ Static Assert Nodes [0]: +++++++++++++++++++++++++++++++++++++++++
9.97/5.39	       
9.97/5.39	+ After preprocess (paralelization): ++++++++++++++++++++++++++++++
9.97/5.39	
9.97/5.39	Init Location: 0
9.97/5.39	Transitions:
9.97/5.39	<l0, l7, true, seq{main__func_return_ -> 0}>
9.97/5.39	<l7, l8, true, seq{varCall_1 -> ¿functionCall(__VERIFIER_nondet_int)}>
9.97/5.39	<l8, l9, true, seq{main_x -> varCall_1}>
9.97/5.39	<l9, l10, true, seq{varCall_2 -> ¿functionCall(__VERIFIER_nondet_int)}>
9.97/5.39	<l10, l1, true, seq{main_y -> varCall_2}>
9.97/5.39	<l1, l2, true>
9.97/5.39	<l2, l3, (main_x < main_y)>
9.97/5.39	<l2, l5, not((main_x < main_y))>
9.97/5.39	<l3, l4, true, seq{main_x -> (main_x + main_y), main_y -> (~(2) * main_y)}>
9.97/5.39	<l4, l2, true>
9.97/5.39	<l5, l6, true, seq{main__func_return_ -> 0}>
9.97/5.39	
9.97/5.39	Fresh variables:
9.97/5.39	
9.97/5.39	Undef variables:
9.97/5.39	
9.97/5.39	Abstraction variables:
9.97/5.39	
9.97/5.39	Exit nodes:
9.97/5.39	6, 
9.97/5.39	Accepting locations:
9.97/5.39	
9.97/5.39	Asserts:
9.97/5.39	
9.97/5.39	+                                                                  +
9.97/5.39	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
9.97/5.39	
9.97/5.39	
9.97/5.39	Function Return and Parameters Information [2 functions]:
9.97/5.39	    function name: __VERIFIER_nondet_int [1 return + 0 parameters]        demangled: __VERIFIER_nondet_int
9.97/5.39	        __VERIFIER_nondet_int__func_return_      [function result] : int
9.97/5.39	    function name: main [1 return + 0 parameters]        demangled: main
9.97/5.39	        main__func_return_      [function result] : int
9.97/5.39	
9.97/5.39	
9.97/5.39	AST Ident Scanner Information [4 idents]:
9.97/5.39	__VERIFIER_nondet_int | function | [integer, ()] | <line: 20, col: 1> | <line: 24, col: 9> <line: 25, col: 9>
9.97/5.39	main | function | [integer, ()] | <line: 22, col: 1>
9.97/5.39	x | local variable | integer | <line: 23, col: 5> | <line: 24, col: 5> <line: 26, col: 12> <line: 27, col: 9> <line: 27, col: 13>
9.97/5.39	y | local variable | integer | <line: 23, col: 5> | <line: 25, col: 5> <line: 26, col: 16> <line: 27, col: 17> <line: 28, col: 9> <line: 28, col: 16>
9.97/5.39	
9.97/5.39	Main function: main
9.97/5.39	Preprocessed LLVMGraph
9.97/5.39	Init Location: 0
9.97/5.39	Transitions:
9.97/5.39	<l0, l2, (main_x = undef3) /\ (main_y = undef4)>
9.97/5.39	<l2, l2, (main_x < main_y), par{main_x -> (main_x + main_y), main_y -> (~(2) * main_y)}>
9.97/5.39	<l2, l6, not((main_x < main_y))>
9.97/5.39	
9.97/5.39	Fresh variables:
9.97/5.39	undef3, undef4, 
9.97/5.39	
9.97/5.39	Undef variables:
9.97/5.39	undef3, undef4, 
9.97/5.39	
9.97/5.39	Abstraction variables:
9.97/5.39	
9.97/5.39	Exit nodes:
9.97/5.39	6, 
9.97/5.39	Accepting locations:
9.97/5.39	
9.97/5.39	Asserts:
9.97/5.39	
9.97/5.39	*************************************************************
9.97/5.39	*******************************************************************************************
9.97/5.39	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
9.97/5.39	*******************************************************************************************
9.97/5.39	
9.97/5.39	Init Location: 0
9.97/5.39	Graph 0:
9.97/5.39	Transitions:
9.97/5.39	Variables:
9.97/5.39	
9.97/5.39	Graph 1:
9.97/5.39	Transitions:
9.97/5.39	<l2, l2, 1 + main_x <= main_y, {main_x -> main_x + main_y, main_y -> -2*main_y, rest remain the same}>
9.97/5.39	Variables:
9.97/5.39	main_x, main_y
9.97/5.39	
9.97/5.39	Graph 2:
9.97/5.39	Transitions:
9.97/5.39	Variables:
9.97/5.39	
9.97/5.39	Precedence: 
9.97/5.39	Graph 0
9.97/5.39	
9.97/5.39	Graph 1
9.97/5.39	<l0, l2, main_x = undef3 /\ main_y = undef4, {all remain the same}>
9.97/5.39	
9.97/5.39	Graph 2
9.97/5.39	<l2, l6, main_y <= main_x, {all remain the same}>
9.97/5.39	
9.97/5.39	Map Locations to Subgraph:
9.97/5.39	( 0 , 0 )
9.97/5.39	( 2 , 1 )
9.97/5.39	( 6 , 2 )
9.97/5.39	
9.97/5.39	*******************************************************************************************
9.97/5.39	********************************    CHECKING ASSERTIONS    ********************************
9.97/5.39	*******************************************************************************************
9.97/5.39	
9.97/5.39	Proving termination of subgraph 0
9.97/5.39	Proving termination of subgraph 1
9.97/5.39	Checking unfeasibility...
9.97/5.39	Time used: 0.002102
9.97/5.39	
9.97/5.39	Checking conditional termination of SCC {l2}...
9.97/5.39	
9.97/5.39	LOG: CALL solveLinear
9.97/5.39	
9.97/5.39	LOG: RETURN solveLinear - Elapsed time: 0.000675s
9.97/5.39	
9.97/5.39	LOG: CALL solveLinear
9.97/5.39	
9.97/5.39	LOG: RETURN solveLinear - Elapsed time: 0.001666s
9.97/5.39	[17080 : 17082]
9.97/5.39	[17080 : 17083]
9.97/5.39	Successful child: 17082
9.97/5.39	[ Invariant Graph ]
9.97/5.39	Strengthening and disabling transitions...
9.97/5.39	
9.97/5.39	LOG: CALL solverLinear in Graph for feasibility
9.97/5.39	
9.97/5.39	LOG: RETURN solveLinear in Graph for feasibility
9.97/5.39	It's unfeasible. Removing transition: 
9.97/5.39	<l2, l2, 1 + main_x <= main_y, {main_x -> main_x + main_y, main_y -> -2*main_y, rest remain the same}>
9.97/5.39	[ Termination Graph ]
9.97/5.39	Strengthening and disabling transitions...
9.97/5.39	> It's unfeasible. Removing transition: 
9.97/5.39	<l2, l2, 1 + main_x <= main_y, {main_x -> main_x + main_y, main_y -> -2*main_y, rest remain the same}>
9.97/5.39	New Graphs: 
9.97/5.39	
9.97/5.39	LOG: CALL check - Post:main_y <= main_x - Process 1
9.97/5.39	* Exit transition: <l0, l2, main_x = undef3 /\ main_y = undef4, {all remain the same}>
9.97/5.39	* Postcondition  : main_y <= main_x
9.97/5.39	
9.97/5.39	LOG: CALL solveLinear
9.97/5.39	
9.97/5.39	LOG: RETURN solveLinear - Elapsed time: 0.000511s
9.97/5.39	> Postcondition is not implied!
9.97/5.39	
9.97/5.39	LOG: RETURN check - Elapsed time: 0.000611s
9.97/5.39	INVARIANTS: 
9.97/5.39	2: 
9.97/5.39	Quasi-INVARIANTS to narrow Graph: 
9.97/5.39	2: main_y <= main_x , 
9.97/5.39	Narrowing transition: 
9.97/5.39	<l2, l2, 1 + main_x <= main_y, {main_x -> main_x + main_y, main_y -> -2*main_y, rest remain the same}>
9.97/5.39	
9.97/5.39	LOG: Narrow transition size 1
9.97/5.39	invGraph after Narrowing: 
9.97/5.39	Transitions:
9.97/5.39	<l2, l2, 1 + main_x <= main_y, {main_x -> main_x + main_y, main_y -> -2*main_y, rest remain the same}>
9.97/5.39	Variables:
9.97/5.39	main_x, main_y
9.97/5.39	Checking conditional termination of SCC {l2}...
9.97/5.39	
9.97/5.39	LOG: CALL solveLinear
9.97/5.39	
9.97/5.39	LOG: RETURN solveLinear - Elapsed time: 0.000653s
9.97/5.39	
9.97/5.39	LOG: CALL solveLinear
9.97/5.39	
9.97/5.39	LOG: RETURN solveLinear - Elapsed time: 0.001795s
9.97/5.39	[17080 : 17087]
9.97/5.39	[17080 : 17088]
9.97/5.39	Successful child: 17087
9.97/5.39	[ Invariant Graph ]
9.97/5.39	Strengthening and disabling transitions...
9.97/5.39	
9.97/5.39	LOG: CALL solverLinear in Graph for feasibility
9.97/5.39	
9.97/5.39	LOG: RETURN solveLinear in Graph for feasibility
9.97/5.39	Strengthening transition (result): 
9.97/5.39	<l2, l2, 0 <= main_x /\ 1 + main_x <= main_y, {main_x -> main_x + main_y, main_y -> -2*main_y, rest remain the same}>
9.97/5.39	[ Termination Graph ]
9.97/5.39	Strengthening and disabling transitions...
9.97/5.39	
9.97/5.39	LOG: CALL solverLinear in Graph for feasibility
9.97/5.39	
9.97/5.39	LOG: RETURN solveLinear in Graph for feasibility
9.97/5.39	Strengthening transition (result): 
9.97/5.39	<l2, l2, 0 <= main_x /\ 1 + main_x <= main_y, {main_x -> main_x + main_y, main_y -> -2*main_y, rest remain the same}>
9.97/5.39	Ranking function: -main_x + main_y
9.97/5.39	New Graphs: 
9.97/5.39	
9.97/5.39	LOG: CALL check - Post:0 <= main_x - Process 2
9.97/5.39	* Exit transition: <l0, l2, 1 + main_x <= main_y /\ main_x = undef3 /\ main_y = undef4, {all remain the same}>
9.97/5.39	* Postcondition  : 0 <= main_x
9.97/5.39	
9.97/5.39	LOG: CALL solveLinear
9.97/5.39	
9.97/5.39	LOG: RETURN solveLinear - Elapsed time: 0.000537s
9.97/5.39	> Postcondition is not implied!
9.97/5.39	
9.97/5.39	LOG: RETURN check - Elapsed time: 0.000634s
9.97/5.39	INVARIANTS: 
9.97/5.39	2: 
9.97/5.39	Quasi-INVARIANTS to narrow Graph: 
9.97/5.39	2: 0 <= main_x , 
9.97/5.39	Narrowing transition: 
9.97/5.39	<l2, l2, 1 + main_x <= main_y, {main_x -> main_x + main_y, main_y -> -2*main_y, rest remain the same}>
9.97/5.39	
9.97/5.39	LOG: Narrow transition size 1
9.97/5.39	invGraph after Narrowing: 
9.97/5.39	Transitions:
9.97/5.39	<l2, l2, 1 + main_x <= 0 /\ 1 + main_x <= main_y, {main_x -> main_x + main_y, main_y -> -2*main_y, rest remain the same}>
9.97/5.39	Variables:
9.97/5.39	main_x, main_y
9.97/5.39	Checking conditional termination of SCC {l2}...
9.97/5.39	
9.97/5.39	LOG: CALL solveLinear
9.97/5.39	
9.97/5.39	LOG: RETURN solveLinear - Elapsed time: 0.000565s
9.97/5.39	
9.97/5.39	LOG: CALL solveLinear
9.97/5.39	
9.97/5.39	LOG: RETURN solveLinear - Elapsed time: 0.001957s
9.97/5.39	[17080 : 17092]
9.97/5.39	[17080 : 17093]
9.97/5.39	Solving with 1 template(s).
9.97/5.39	
9.97/5.39	LOG: CALL solveNonLinearGetFirstSolution
9.97/5.39	
9.97/5.39	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009021s
9.97/5.39	Time used: 0.008702
9.97/5.39	
9.97/5.39	[17080 : 17097]
9.97/5.39	[17080 : 17101]
9.97/5.39	Successful child: 17097
9.97/5.39	
9.97/5.39	Program does NOT terminate
9.97/5.40	EOF