0.00/0.23	YES
0.00/0.23	
0.00/0.23	Solver Timeout: 4
0.00/0.23	Global Timeout: 300
0.00/0.23	Maximum number of concurrent processes: 900
0.00/0.23	*******************************************************************************************
0.00/0.23	*********************** UNPROCESSED TRANSITION SYSTEMS PER FUNCTION ***********************
0.00/0.23	*******************************************************************************************
0.00/0.23	
0.00/0.23	
0.00/0.23	List of LLVMGraphs + assumeNodes + staticAssertNodes [1] :
0.00/0.23	
0.00/0.23	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
0.00/0.23	+                                                                  +
0.00/0.23	Init Location: 0
0.00/0.23	Transitions:
0.00/0.23	<l0, l1, true, seq{main__func_return_ -> 0, main_x -> ¿functionCall(__VERIFIER_nondet_int), main_y -> ¿functionCall(__VERIFIER_nondet_int)}>
0.00/0.23	<l1, l2, true>
0.00/0.23	<l2, l5, not(((main_x - main_y) > 0))>
0.00/0.23	<l2, l3, ((main_x - main_y) > 0)>
0.00/0.23	<l3, l4, true, seq{main_x -> (main_y - main_x), main_y -> (main_y + 1)}>
0.00/0.23	<l4, l2, true>
0.00/0.23	<l5, l6, true, seq{main__func_return_ -> 0}>
0.00/0.23	
0.00/0.23	Fresh variables:
0.00/0.23	
0.00/0.23	Undef variables:
0.00/0.23	
0.00/0.23	Abstraction variables:
0.00/0.23	
0.00/0.23	Exit nodes:
0.00/0.23	
0.00/0.23	Accepting locations:
0.00/0.23	
0.00/0.23	Asserts:
0.00/0.23	
0.00/0.23	+ Assume Nodes [0]: ++++++++++++++++++++++++++++++++++++++++++++++++
0.00/0.23	       
0.00/0.23	+ Static Assert Nodes [0]: +++++++++++++++++++++++++++++++++++++++++
0.00/0.23	       
0.00/0.23	+ After preprocess (paralelization): ++++++++++++++++++++++++++++++
0.00/0.23	
0.00/0.23	Init Location: 0
0.00/0.23	Transitions:
0.00/0.23	<l0, l7, true, seq{main__func_return_ -> 0}>
0.00/0.23	<l7, l8, true, seq{varCall_1 -> ¿functionCall(__VERIFIER_nondet_int)}>
0.00/0.23	<l8, l9, true, seq{main_x -> varCall_1}>
0.00/0.23	<l9, l10, true, seq{varCall_2 -> ¿functionCall(__VERIFIER_nondet_int)}>
0.00/0.23	<l10, l1, true, seq{main_y -> varCall_2}>
0.00/0.23	<l1, l2, true>
0.00/0.23	<l2, l3, ((main_x - main_y) > 0)>
0.00/0.23	<l2, l5, not(((main_x - main_y) > 0))>
0.00/0.23	<l3, l4, true, seq{main_x -> (main_y - main_x), main_y -> (main_y + 1)}>
0.00/0.23	<l4, l2, true>
0.00/0.23	<l5, l6, true, seq{main__func_return_ -> 0}>
0.00/0.23	
0.00/0.23	Fresh variables:
0.00/0.23	
0.00/0.23	Undef variables:
0.00/0.23	
0.00/0.23	Abstraction variables:
0.00/0.23	
0.00/0.23	Exit nodes:
0.00/0.23	6, 
0.00/0.23	Accepting locations:
0.00/0.23	
0.00/0.23	Asserts:
0.00/0.23	
0.00/0.23	+                                                                  +
0.00/0.23	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
0.00/0.23	
0.00/0.23	
0.00/0.23	Function Return and Parameters Information [2 functions]:
0.00/0.23	    function name: __VERIFIER_nondet_int [1 return + 0 parameters]        demangled: __VERIFIER_nondet_int
0.00/0.23	        __VERIFIER_nondet_int__func_return_      [function result] : int
0.00/0.23	    function name: main [1 return + 0 parameters]        demangled: main
0.00/0.23	        main__func_return_      [function result] : int
0.00/0.23	
0.00/0.23	
0.00/0.23	AST Ident Scanner Information [4 idents]:
0.00/0.23	__VERIFIER_nondet_int | function | [integer, ()] | <line: 20, col: 1> | <line: 24, col: 9> <line: 25, col: 9>
0.00/0.23	main | function | [integer, ()] | <line: 22, col: 1>
0.00/0.23	x | local variable | integer | <line: 23, col: 5> | <line: 24, col: 5> <line: 26, col: 12> <line: 27, col: 9> <line: 27, col: 17>
0.00/0.23	y | local variable | integer | <line: 23, col: 5> | <line: 25, col: 5> <line: 26, col: 16> <line: 27, col: 13> <line: 28, col: 9> <line: 28, col: 13>
0.00/0.23	
0.00/0.23	Main function: main
0.00/0.23	Preprocessed LLVMGraph
0.00/0.23	Init Location: 0
0.00/0.23	Transitions:
0.00/0.23	<l0, l2, (main_x = undef3) /\ (main_y = undef4)>
0.00/0.23	<l2, l2, ((main_x - main_y) > 0), par{main_x -> (main_y - main_x), main_y -> (main_y + 1)}>
0.00/0.23	<l2, l6, not(((main_x - main_y) > 0))>
0.00/0.23	
0.00/0.23	Fresh variables:
0.00/0.23	undef3, undef4, 
0.00/0.23	
0.00/0.23	Undef variables:
0.00/0.23	undef3, undef4, 
0.00/0.23	
0.00/0.23	Abstraction variables:
0.00/0.23	
0.00/0.23	Exit nodes:
0.00/0.23	6, 
0.00/0.23	Accepting locations:
0.00/0.23	
0.00/0.23	Asserts:
0.00/0.23	
0.00/0.23	*************************************************************
0.00/0.23	*******************************************************************************************
0.00/0.23	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
0.00/0.23	*******************************************************************************************
0.00/0.23	
0.00/0.23	Init Location: 0
0.00/0.23	Graph 0:
0.00/0.23	Transitions:
0.00/0.23	Variables:
0.00/0.23	
0.00/0.23	Graph 1:
0.00/0.23	Transitions:
0.00/0.23	<l2, l2, 1 + main_y <= main_x, {main_x -> -main_x + main_y, main_y -> 1 + main_y, rest remain the same}>
0.00/0.23	Variables:
0.00/0.23	main_x, main_y
0.00/0.23	
0.00/0.23	Graph 2:
0.00/0.23	Transitions:
0.00/0.23	Variables:
0.00/0.23	
0.00/0.23	Precedence: 
0.00/0.23	Graph 0
0.00/0.23	
0.00/0.23	Graph 1
0.00/0.23	<l0, l2, main_x = undef3 /\ main_y = undef4, {all remain the same}>
0.00/0.23	
0.00/0.23	Graph 2
0.00/0.23	<l2, l6, main_x <= main_y, {all remain the same}>
0.00/0.23	
0.00/0.23	Map Locations to Subgraph:
0.00/0.23	( 0 , 0 )
0.00/0.23	( 2 , 1 )
0.00/0.23	( 6 , 2 )
0.00/0.23	
0.00/0.23	*******************************************************************************************
0.00/0.23	********************************    CHECKING ASSERTIONS    ********************************
0.00/0.23	*******************************************************************************************
0.00/0.23	
0.00/0.23	Proving termination of subgraph 0
0.00/0.23	Proving termination of subgraph 1
0.00/0.23	Checking unfeasibility...
0.00/0.23	Time used: 0.002018
0.00/0.23	
0.00/0.23	Checking conditional termination of SCC {l2}...
0.00/0.23	
0.00/0.23	LOG: CALL solveLinear
0.00/0.23	
0.00/0.23	LOG: RETURN solveLinear - Elapsed time: 0.000607s
0.00/0.23	
0.00/0.23	LOG: CALL solveLinear
0.00/0.23	
0.00/0.23	LOG: RETURN solveLinear - Elapsed time: 0.001878s
0.00/0.23	[4423 : 4425]
0.00/0.23	[4423 : 4426]
0.00/0.23	Successful child: 4425
0.00/0.23	[ Invariant Graph ]
0.00/0.23	Strengthening and disabling transitions...
0.00/0.23	
0.00/0.23	LOG: CALL solverLinear in Graph for feasibility
0.00/0.23	
0.00/0.23	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.23	It's unfeasible. Removing transition: 
0.00/0.23	<l2, l2, 1 + main_y <= main_x, {main_x -> -main_x + main_y, main_y -> 1 + main_y, rest remain the same}>
0.00/0.23	[ Termination Graph ]
0.00/0.23	Strengthening and disabling transitions...
0.00/0.23	> It's unfeasible. Removing transition: 
0.00/0.23	<l2, l2, 1 + main_y <= main_x, {main_x -> -main_x + main_y, main_y -> 1 + main_y, rest remain the same}>
0.00/0.23	New Graphs: 
0.00/0.23	
0.00/0.23	LOG: CALL check - Post:1 + main_x <= main_y - Process 1
0.00/0.23	* Exit transition: <l0, l2, main_x = undef3 /\ main_y = undef4, {all remain the same}>
0.00/0.23	* Postcondition  : 1 + main_x <= main_y
0.00/0.23	
0.00/0.23	LOG: CALL solveLinear
0.00/0.23	
0.00/0.23	LOG: RETURN solveLinear - Elapsed time: 0.000505s
0.00/0.23	> Postcondition is not implied!
0.00/0.23	
0.00/0.23	LOG: RETURN check - Elapsed time: 0.000607s
0.00/0.23	INVARIANTS: 
0.00/0.23	2: 
0.00/0.23	Quasi-INVARIANTS to narrow Graph: 
0.00/0.23	2: 1 + main_x <= main_y , 
0.00/0.23	Narrowing transition: 
0.00/0.23	<l2, l2, 1 + main_y <= main_x, {main_x -> -main_x + main_y, main_y -> 1 + main_y, rest remain the same}>
0.00/0.23	
0.00/0.23	LOG: Narrow transition size 1
0.00/0.23	invGraph after Narrowing: 
0.00/0.23	Transitions:
0.00/0.23	<l2, l2, 1 + main_y <= main_x, {main_x -> -main_x + main_y, main_y -> 1 + main_y, rest remain the same}>
0.00/0.23	Variables:
0.00/0.23	main_x, main_y
0.00/0.23	Checking conditional termination of SCC {l2}...
0.00/0.23	
0.00/0.23	LOG: CALL solveLinear
0.00/0.23	
0.00/0.23	LOG: RETURN solveLinear - Elapsed time: 0.000581s
0.00/0.23	
0.00/0.23	LOG: CALL solveLinear
0.00/0.23	
0.00/0.23	LOG: RETURN solveLinear - Elapsed time: 0.002008s
0.00/0.23	[4423 : 4430]
0.00/0.23	[4423 : 4431]
0.00/0.23	Successful child: 4430
0.00/0.23	[ Invariant Graph ]
0.00/0.23	Strengthening and disabling transitions...
0.00/0.23	
0.00/0.23	LOG: CALL solverLinear in Graph for feasibility
0.00/0.23	
0.00/0.23	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.23	It's unfeasible. Removing transition: 
0.00/0.23	<l2, l2, 1 + main_y <= main_x, {main_x -> -main_x + main_y, main_y -> 1 + main_y, rest remain the same}>
0.00/0.23	[ Termination Graph ]
0.00/0.23	Strengthening and disabling transitions...
0.00/0.23	
0.00/0.23	LOG: CALL solverLinear in Graph for feasibility
0.00/0.23	
0.00/0.23	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.23	It's unfeasible. Removing transition: 
0.00/0.23	<l2, l2, 1 + main_y <= main_x, {main_x -> -main_x + main_y, main_y -> 1 + main_y, rest remain the same}>
0.00/0.23	New Graphs: 
0.00/0.23	
0.00/0.23	LOG: CALL check - Post:main_x <= main_y - Process 2
0.00/0.23	* Exit transition: <l0, l2, main_y <= main_x /\ main_x = undef3 /\ main_y = undef4, {all remain the same}>
0.00/0.23	* Postcondition  : main_x <= main_y
0.00/0.23	
0.00/0.23	LOG: CALL solveLinear
0.00/0.23	
0.00/0.23	LOG: RETURN solveLinear - Elapsed time: 0.000586s
0.00/0.23	> Postcondition is not implied!
0.00/0.23	
0.00/0.23	LOG: RETURN check - Elapsed time: 0.000700s
0.00/0.23	INVARIANTS: 
0.00/0.23	2: 
0.00/0.23	Quasi-INVARIANTS to narrow Graph: 
0.00/0.23	2: main_x <= main_y , 
0.00/0.23	Narrowing transition: 
0.00/0.23	<l2, l2, 1 + main_y <= main_x, {main_x -> -main_x + main_y, main_y -> 1 + main_y, rest remain the same}>
0.00/0.23	
0.00/0.23	LOG: Narrow transition size 1
0.00/0.23	invGraph after Narrowing: 
0.00/0.23	Transitions:
0.00/0.23	<l2, l2, 1 + main_y <= main_x, {main_x -> -main_x + main_y, main_y -> 1 + main_y, rest remain the same}>
0.00/0.23	Variables:
0.00/0.23	main_x, main_y
0.00/0.23	Checking conditional termination of SCC {l2}...
0.00/0.23	
0.00/0.23	LOG: CALL solveLinear
0.00/0.23	
0.00/0.23	LOG: RETURN solveLinear - Elapsed time: 0.000574s
0.00/0.23	
0.00/0.23	LOG: CALL solveLinear
0.00/0.23	
0.00/0.23	LOG: RETURN solveLinear - Elapsed time: 0.002002s
0.00/0.23	[4423 : 4435]
0.00/0.23	[4423 : 4436]
0.00/0.23	Successful child: 4435
0.00/0.23	[ Invariant Graph ]
0.00/0.23	Strengthening and disabling transitions...
0.00/0.23	
0.00/0.23	LOG: CALL solverLinear in Graph for feasibility
0.00/0.23	
0.00/0.23	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.23	Strengthening transition (result): 
0.00/0.23	<l2, l2, 1 + main_y <= main_x /\ 0 <= 2 + main_y, {main_x -> -main_x + main_y, main_y -> 1 + main_y, rest remain the same}>
0.00/0.23	[ Termination Graph ]
0.00/0.23	Strengthening and disabling transitions...
0.00/0.23	
0.00/0.23	LOG: CALL solverLinear in Graph for feasibility
0.00/0.23	
0.00/0.23	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.23	Strengthening transition (result): 
0.00/0.23	<l2, l2, 1 + main_y <= main_x /\ 0 <= 2 + main_y, {main_x -> -main_x + main_y, main_y -> 1 + main_y, rest remain the same}>
0.00/0.23	Ranking function: main_x - main_y
0.00/0.23	New Graphs: 
0.00/0.23	
0.00/0.23	LOG: CALL check - Post:0 <= 2 + main_y - Process 3
0.00/0.23	* Exit transition: <l0, l2, 1 + main_y <= main_x /\ main_x = undef3 /\ main_y = undef4, {all remain the same}>
0.00/0.23	* Postcondition  : 0 <= 2 + main_y
0.00/0.23	
0.00/0.23	LOG: CALL solveLinear
0.00/0.23	
0.00/0.23	LOG: RETURN solveLinear - Elapsed time: 0.000544s
0.00/0.23	> Postcondition is not implied!
0.00/0.23	
0.00/0.23	LOG: RETURN check - Elapsed time: 0.000642s
0.00/0.23	INVARIANTS: 
0.00/0.23	2: 
0.00/0.23	Quasi-INVARIANTS to narrow Graph: 
0.00/0.23	2: 0 <= 2 + main_y , 
0.00/0.23	Narrowing transition: 
0.00/0.23	<l2, l2, 1 + main_y <= main_x, {main_x -> -main_x + main_y, main_y -> 1 + main_y, rest remain the same}>
0.00/0.23	
0.00/0.23	LOG: Narrow transition size 1
0.00/0.23	invGraph after Narrowing: 
0.00/0.23	Transitions:
0.00/0.23	<l2, l2, 1 + main_y <= main_x /\ 3 + main_y <= 0, {main_x -> -main_x + main_y, main_y -> 1 + main_y, rest remain the same}>
0.00/0.23	Variables:
0.00/0.23	main_x, main_y
0.00/0.23	Checking conditional termination of SCC {l2}...
0.00/0.23	
0.00/0.23	LOG: CALL solveLinear
0.00/0.23	
0.00/0.23	LOG: RETURN solveLinear - Elapsed time: 0.000766s
0.00/0.23	Ranking function: -3 - main_y
0.00/0.23	New Graphs: 
0.00/0.23	Proving termination of subgraph 2
0.00/0.23	Analyzing SCC {l6}...
0.00/0.23	No cycles found.
0.00/0.23	
0.00/0.23	Program Terminates
0.00/0.23	EOF