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), main_z -> ¿functionCall(__VERIFIER_nondet_int)}>
0.00/0.23	<l1, l2, true>
0.00/0.23	<l2, l6, not((main_x >= 0))>
0.00/0.23	<l2, l3, (main_x >= 0)>
0.00/0.23	<l3, l6, not((main_x <= main_z))>
0.00/0.23	<l3, l4, (main_x <= main_z)>
0.00/0.23	<l4, l5, true, seq{main_x -> ((2 * main_x) + main_y), main_y -> (main_y + 1)}>
0.00/0.23	<l5, l2, true>
0.00/0.23	<l6, l7, 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, l8, true, seq{main__func_return_ -> 0}>
0.00/0.23	<l8, l9, true, seq{varCall_1 -> ¿functionCall(__VERIFIER_nondet_int)}>
0.00/0.23	<l9, l10, true, seq{main_x -> varCall_1}>
0.00/0.23	<l10, l11, true, seq{varCall_2 -> ¿functionCall(__VERIFIER_nondet_int)}>
0.00/0.23	<l11, l12, true, seq{main_y -> varCall_2}>
0.00/0.23	<l12, l13, true, seq{varCall_3 -> ¿functionCall(__VERIFIER_nondet_int)}>
0.00/0.23	<l13, l1, true, seq{main_z -> varCall_3}>
0.00/0.23	<l1, l2, true>
0.00/0.23	<l2, l3, (main_x >= 0)>
0.00/0.23	<l2, l6, not((main_x >= 0))>
0.00/0.23	<l3, l4, (main_x <= main_z)>
0.00/0.23	<l3, l6, not((main_x <= main_z))>
0.00/0.23	<l4, l5, true, seq{main_x -> ((2 * main_x) + main_y), main_y -> (main_y + 1)}>
0.00/0.23	<l5, l2, true>
0.00/0.23	<l6, l7, 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	7, 
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 [5 idents]:
0.00/0.23	__VERIFIER_nondet_int | function | [integer, ()] | <line: 20, col: 1> | <line: 24, col: 9> <line: 25, col: 9> <line: 26, 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: 27, col: 12> <line: 27, col: 22> <line: 28, col: 9> <line: 28, col: 15>
0.00/0.23	y | local variable | integer | <line: 23, col: 5> | <line: 25, col: 5> <line: 28, col: 19> <line: 29, col: 9> <line: 29, col: 13>
0.00/0.23	z | local variable | integer | <line: 23, col: 5> | <line: 26, col: 5> <line: 27, col: 27>
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 = undef4) /\ (main_y = undef5) /\ (main_z = undef6)>
0.00/0.23	<l2, l2, (main_x >= 0) /\ (main_x <= main_z), par{main_x -> ((2 * main_x) + main_y), main_y -> (main_y + 1)}>
0.00/0.23	<l2, l7, (main_x >= 0) /\ not((main_x <= main_z))>
0.00/0.23	<l2, l7, not((main_x >= 0))>
0.00/0.23	
0.00/0.23	Fresh variables:
0.00/0.23	undef4, undef5, undef6, 
0.00/0.23	
0.00/0.23	Undef variables:
0.00/0.23	undef4, undef5, undef6, 
0.00/0.23	
0.00/0.23	Abstraction variables:
0.00/0.23	
0.00/0.23	Exit nodes:
0.00/0.23	7, 
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, main_x <= main_z /\ 0 <= main_x, {main_x -> 2*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, main_z
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 = undef4 /\ main_y = undef5 /\ main_z = undef6, {all remain the same}>
0.00/0.23	
0.00/0.23	Graph 2
0.00/0.23	<l2, l7, 0 <= main_x /\ 1 + main_z <= main_x, {all remain the same}>
0.00/0.23	<l2, l7, 1 + main_x <= 0, {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	( 7 , 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.002701
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.000648s
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.001839s
0.00/0.23	[16510 : 16512]
0.00/0.23	[16510 : 16513]
0.00/0.23	Successful child: 16512
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, main_x <= main_z /\ 0 <= main_x, {main_x -> 2*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, main_x <= main_z /\ 0 <= main_x, {main_x -> 2*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_z <= 0 - Process 1
0.00/0.23	* Exit transition: <l0, l2, main_x = undef4 /\ main_y = undef5 /\ main_z = undef6, {all remain the same}>
0.00/0.23	* Postcondition  : 1 + main_z <= 0
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	> Postcondition is not implied!
0.00/0.23	
0.00/0.23	LOG: RETURN check - Elapsed time: 0.000676s
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_z <= 0 , 
0.00/0.23	Narrowing transition: 
0.00/0.23	<l2, l2, main_x <= main_z /\ 0 <= main_x, {main_x -> 2*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, main_x <= main_z /\ 0 <= main_x /\ 0 <= main_z, {main_x -> 2*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, main_z
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.000687s
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.002252s
0.00/0.23	[16510 : 16517]
0.00/0.23	[16510 : 16518]
0.00/0.23	Successful child: 16517
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, main_x <= main_z /\ 0 <= main_x /\ 0 <= main_z /\ 1 + main_x + main_y <= 0, {main_x -> 2*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, main_x <= main_z /\ 0 <= main_x /\ 0 <= main_z /\ 1 + main_x + main_y <= 0, {main_x -> 2*main_x + main_y, main_y -> 1 + main_y, rest remain the same}>
0.00/0.23	Ranking function: -main_y
0.00/0.23	New Graphs: 
0.00/0.23	
0.00/0.23	LOG: CALL check - Post:1 + main_x + main_y <= 0 - Process 2
0.00/0.23	* Exit transition: <l0, l2, 0 <= main_z /\ main_x = undef4 /\ main_y = undef5 /\ main_z = undef6, {all remain the same}>
0.00/0.23	* Postcondition  : 1 + main_x + main_y <= 0
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.000647s
0.00/0.23	> Postcondition is not implied!
0.00/0.23	
0.00/0.23	LOG: RETURN check - Elapsed time: 0.000759s
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 , 
0.00/0.23	Narrowing transition: 
0.00/0.23	<l2, l2, main_x <= main_z /\ 0 <= main_x /\ 0 <= main_z, {main_x -> 2*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, main_x <= main_z /\ 0 <= main_x /\ 0 <= main_x + main_y /\ 0 <= main_z, {main_x -> 2*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, main_z
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	
0.00/0.23	LOG: CALL solveLinear
0.00/0.23	
0.00/0.23	LOG: RETURN solveLinear - Elapsed time: 0.002898s
0.00/0.23	[16510 : 16522]
0.00/0.23	[16510 : 16523]
0.00/0.23	Successful child: 16522
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, main_x <= main_z /\ 0 <= main_x /\ 0 <= main_x + main_y /\ 0 <= main_z, {main_x -> 2*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, main_x <= main_z /\ 0 <= main_x /\ 0 <= main_x + main_y /\ 0 <= main_z, {main_x -> 2*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_z <= 0 - Process 3
0.00/0.23	* Exit transition: <l0, l2, 0 <= main_x + main_y /\ 0 <= main_z /\ main_x = undef4 /\ main_y = undef5 /\ main_z = undef6, {all remain the same}>
0.00/0.23	* Postcondition  : 1 + main_x + main_z <= 0
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	> Postcondition is not implied!
0.00/0.23	
0.00/0.23	LOG: RETURN check - Elapsed time: 0.000701s
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_z <= 0 , 
0.00/0.23	Narrowing transition: 
0.00/0.23	<l2, l2, main_x <= main_z /\ 0 <= main_x /\ 0 <= main_x + main_y /\ 0 <= main_z, {main_x -> 2*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, main_x <= main_z /\ 0 <= main_x /\ 0 <= main_x + main_y /\ 0 <= main_x + main_z /\ 0 <= main_z, {main_x -> 2*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, main_z
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.000864s
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.002945s
0.00/0.23	[16510 : 16527]
0.00/0.23	[16510 : 16528]
0.00/0.23	Successful child: 16527
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, main_x <= main_z /\ 0 <= main_x /\ 0 <= main_x + main_z /\ 0 <= main_z /\ 1 <= main_x + main_y, {main_x -> 2*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, main_x <= main_z /\ 0 <= main_x /\ 0 <= main_x + main_z /\ 0 <= main_z /\ 1 <= main_x + main_y, {main_x -> 2*main_x + main_y, main_y -> 1 + main_y, rest remain the same}>
0.00/0.23	Ranking function: -main_x + main_z
0.00/0.23	New Graphs: 
0.00/0.23	
0.00/0.23	LOG: CALL check - Post:1 <= main_x + main_y - Process 4
0.00/0.23	* Exit transition: <l0, l2, 0 <= main_x + main_y /\ 0 <= main_x + main_z /\ 0 <= main_z /\ main_x = undef4 /\ main_y = undef5 /\ main_z = undef6, {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.000556s
0.00/0.23	> Postcondition is not implied!
0.00/0.23	
0.00/0.23	LOG: RETURN check - Elapsed time: 0.000699s
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	It's unfeasible. Removing transition: 
0.00/0.23	<l2, l2, main_x <= main_z /\ 0 <= main_x /\ 0 <= main_x + main_y /\ 0 <= main_x + main_z /\ 0 <= main_z, {main_x -> 2*main_x + main_y, main_y -> 1 + main_y, rest remain the same}>
0.00/0.23	invGraph after Narrowing: 
0.00/0.23	Transitions:
0.00/0.23	Variables:
0.00/0.23	main_x, main_y, main_z
0.00/0.23	Analyzing SCC {l2}...
0.00/0.23	No cycles found.
0.00/0.23	
0.00/0.23	Proving termination of subgraph 2
0.00/0.23	Analyzing SCC {l7}...
0.00/0.23	No cycles found.
0.00/0.23	
0.00/0.23	Program Terminates
0.00/0.23	EOF