0.00/0.11	YES
0.00/0.11	
0.00/0.11	Solver Timeout: 4
0.00/0.11	Global Timeout: 300
0.00/0.11	Maximum number of concurrent processes: 900
0.00/0.11	*******************************************************************************************
0.00/0.11	*********************** UNPROCESSED TRANSITION SYSTEMS PER FUNCTION ***********************
0.00/0.11	*******************************************************************************************
0.00/0.11	
0.00/0.11	
0.00/0.11	List of LLVMGraphs + assumeNodes + staticAssertNodes [1] :
0.00/0.11	
0.00/0.11	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
0.00/0.11	+                                                                  +
0.00/0.11	Init Location: 0
0.00/0.11	Transitions:
0.00/0.11	<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.11	<l1, l2, true>
0.00/0.11	<l2, l5, not((main_x < main_y))>
0.00/0.11	<l2, l3, (main_x < main_y)>
0.00/0.11	<l3, l4, true, seq{main_x -> (main_x + 1), main_y -> main_z}>
0.00/0.11	<l4, l2, true>
0.00/0.11	<l5, l6, true, seq{main__func_return_ -> 0}>
0.00/0.11	
0.00/0.11	Fresh variables:
0.00/0.11	
0.00/0.11	Undef variables:
0.00/0.11	
0.00/0.11	Abstraction variables:
0.00/0.11	
0.00/0.11	Exit nodes:
0.00/0.11	
0.00/0.11	Accepting locations:
0.00/0.11	
0.00/0.11	Asserts:
0.00/0.11	
0.00/0.11	+ Assume Nodes [0]: ++++++++++++++++++++++++++++++++++++++++++++++++
0.00/0.11	       
0.00/0.11	+ Static Assert Nodes [0]: +++++++++++++++++++++++++++++++++++++++++
0.00/0.11	       
0.00/0.11	+ After preprocess (paralelization): ++++++++++++++++++++++++++++++
0.00/0.11	
0.00/0.11	Init Location: 0
0.00/0.11	Transitions:
0.00/0.11	<l0, l7, true, seq{main__func_return_ -> 0}>
0.00/0.11	<l7, l8, true, seq{varCall_1 -> ¿functionCall(__VERIFIER_nondet_int)}>
0.00/0.11	<l8, l9, true, seq{main_x -> varCall_1}>
0.00/0.11	<l9, l10, true, seq{varCall_2 -> ¿functionCall(__VERIFIER_nondet_int)}>
0.00/0.11	<l10, l11, true, seq{main_y -> varCall_2}>
0.00/0.11	<l11, l12, true, seq{varCall_3 -> ¿functionCall(__VERIFIER_nondet_int)}>
0.00/0.11	<l12, l1, true, seq{main_z -> varCall_3}>
0.00/0.11	<l1, l2, true>
0.00/0.11	<l2, l3, (main_x < main_y)>
0.00/0.11	<l2, l5, not((main_x < main_y))>
0.00/0.11	<l3, l4, true, seq{main_x -> (main_x + 1), main_y -> main_z}>
0.00/0.11	<l4, l2, true>
0.00/0.11	<l5, l6, true, seq{main__func_return_ -> 0}>
0.00/0.11	
0.00/0.11	Fresh variables:
0.00/0.11	
0.00/0.11	Undef variables:
0.00/0.11	
0.00/0.11	Abstraction variables:
0.00/0.11	
0.00/0.11	Exit nodes:
0.00/0.11	6, 
0.00/0.11	Accepting locations:
0.00/0.11	
0.00/0.11	Asserts:
0.00/0.11	
0.00/0.11	+                                                                  +
0.00/0.11	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
0.00/0.11	
0.00/0.11	
0.00/0.11	Function Return and Parameters Information [2 functions]:
0.00/0.11	    function name: __VERIFIER_nondet_int [1 return + 0 parameters]        demangled: __VERIFIER_nondet_int
0.00/0.11	        __VERIFIER_nondet_int__func_return_      [function result] : int
0.00/0.11	    function name: main [1 return + 0 parameters]        demangled: main
0.00/0.11	        main__func_return_      [function result] : int
0.00/0.11	
0.00/0.11	
0.00/0.11	AST Ident Scanner Information [5 idents]:
0.00/0.11	__VERIFIER_nondet_int | function | [integer, ()] | <line: 20, col: 1> | <line: 24, col: 9> <line: 25, col: 9> <line: 26, col: 9>
0.00/0.11	main | function | [integer, ()] | <line: 22, col: 1>
0.00/0.11	x | local variable | integer | <line: 23, col: 5> | <line: 24, col: 5> <line: 27, col: 12> <line: 28, col: 9> <line: 28, col: 13>
0.00/0.11	y | local variable | integer | <line: 23, col: 5> | <line: 25, col: 5> <line: 27, col: 16> <line: 29, col: 9>
0.00/0.11	z | local variable | integer | <line: 23, col: 5> | <line: 26, col: 5> <line: 29, col: 13>
0.00/0.11	
0.00/0.11	Main function: main
0.00/0.11	Preprocessed LLVMGraph
0.00/0.11	Init Location: 0
0.00/0.11	Transitions:
0.00/0.11	<l0, l2, (main_x = undef4) /\ (main_y = undef5) /\ (main_z = undef6)>
0.00/0.11	<l2, l2, (main_x < main_y), par{main_x -> (main_x + 1), main_y -> main_z}>
0.00/0.11	<l2, l6, not((main_x < main_y))>
0.00/0.11	
0.00/0.11	Fresh variables:
0.00/0.11	undef4, undef5, undef6, 
0.00/0.11	
0.00/0.11	Undef variables:
0.00/0.11	undef4, undef5, undef6, 
0.00/0.11	
0.00/0.11	Abstraction variables:
0.00/0.11	
0.00/0.11	Exit nodes:
0.00/0.11	6, 
0.00/0.11	Accepting locations:
0.00/0.11	
0.00/0.11	Asserts:
0.00/0.11	
0.00/0.11	*************************************************************
0.00/0.11	*******************************************************************************************
0.00/0.11	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
0.00/0.11	*******************************************************************************************
0.00/0.11	
0.00/0.11	Init Location: 0
0.00/0.11	Graph 0:
0.00/0.11	Transitions:
0.00/0.11	Variables:
0.00/0.11	
0.00/0.11	Graph 1:
0.00/0.11	Transitions:
0.00/0.11	<l2, l2, 1 + main_x <= main_y, {main_x -> 1 + main_x, main_y -> main_z, rest remain the same}>
0.00/0.11	Variables:
0.00/0.11	main_x, main_y, main_z
0.00/0.11	
0.00/0.11	Graph 2:
0.00/0.11	Transitions:
0.00/0.11	Variables:
0.00/0.11	
0.00/0.11	Precedence: 
0.00/0.11	Graph 0
0.00/0.11	
0.00/0.11	Graph 1
0.00/0.11	<l0, l2, main_x = undef4 /\ main_y = undef5 /\ main_z = undef6, {all remain the same}>
0.00/0.11	
0.00/0.11	Graph 2
0.00/0.11	<l2, l6, main_y <= main_x, {all remain the same}>
0.00/0.11	
0.00/0.11	Map Locations to Subgraph:
0.00/0.11	( 0 , 0 )
0.00/0.11	( 2 , 1 )
0.00/0.11	( 6 , 2 )
0.00/0.11	
0.00/0.11	*******************************************************************************************
0.00/0.11	********************************    CHECKING ASSERTIONS    ********************************
0.00/0.11	*******************************************************************************************
0.00/0.11	
0.00/0.11	Proving termination of subgraph 0
0.00/0.11	Proving termination of subgraph 1
0.00/0.11	Checking unfeasibility...
0.00/0.11	Time used: 0.002397
0.00/0.11	
0.00/0.11	Checking conditional termination of SCC {l2}...
0.00/0.11	
0.00/0.11	LOG: CALL solveLinear
0.00/0.11	
0.00/0.11	LOG: RETURN solveLinear - Elapsed time: 0.000835s
0.00/0.11	
0.00/0.11	LOG: CALL solveLinear
0.00/0.11	
0.00/0.11	LOG: RETURN solveLinear - Elapsed time: 0.002143s
0.00/0.11	[6696 : 6698]
0.00/0.11	[6696 : 6699]
0.00/0.11	Successful child: 6698
0.00/0.11	[ Invariant Graph ]
0.00/0.11	Strengthening and disabling transitions...
0.00/0.11	
0.00/0.11	LOG: CALL solverLinear in Graph for feasibility
0.00/0.11	
0.00/0.11	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.11	It's unfeasible. Removing transition: 
0.00/0.11	<l2, l2, 1 + main_x <= main_y, {main_x -> 1 + main_x, main_y -> main_z, rest remain the same}>
0.00/0.11	[ Termination Graph ]
0.00/0.11	Strengthening and disabling transitions...
0.00/0.11	> It's unfeasible. Removing transition: 
0.00/0.11	<l2, l2, 1 + main_x <= main_y, {main_x -> 1 + main_x, main_y -> main_z, rest remain the same}>
0.00/0.11	New Graphs: 
0.00/0.11	
0.00/0.11	LOG: CALL check - Post:1 + main_y <= main_x - Process 1
0.00/0.11	* Exit transition: <l0, l2, main_x = undef4 /\ main_y = undef5 /\ main_z = undef6, {all remain the same}>
0.00/0.11	* Postcondition  : 1 + main_y <= main_x
0.00/0.11	
0.00/0.11	LOG: CALL solveLinear
0.00/0.11	
0.00/0.11	LOG: RETURN solveLinear - Elapsed time: 0.000598s
0.00/0.11	> Postcondition is not implied!
0.00/0.11	
0.00/0.11	LOG: RETURN check - Elapsed time: 0.000706s
0.00/0.11	INVARIANTS: 
0.00/0.11	2: 
0.00/0.11	Quasi-INVARIANTS to narrow Graph: 
0.00/0.11	2: 1 + main_y <= main_x , 
0.00/0.11	Narrowing transition: 
0.00/0.11	<l2, l2, 1 + main_x <= main_y, {main_x -> 1 + main_x, main_y -> main_z, rest remain the same}>
0.00/0.11	
0.00/0.11	LOG: Narrow transition size 1
0.00/0.11	invGraph after Narrowing: 
0.00/0.11	Transitions:
0.00/0.11	<l2, l2, 1 + main_x <= main_y, {main_x -> 1 + main_x, main_y -> main_z, rest remain the same}>
0.00/0.11	Variables:
0.00/0.11	main_x, main_y, main_z
0.00/0.11	Checking conditional termination of SCC {l2}...
0.00/0.11	
0.00/0.11	LOG: CALL solveLinear
0.00/0.11	
0.00/0.11	LOG: RETURN solveLinear - Elapsed time: 0.000799s
0.00/0.11	
0.00/0.11	LOG: CALL solveLinear
0.00/0.11	
0.00/0.11	LOG: RETURN solveLinear - Elapsed time: 0.002279s
0.00/0.11	[6696 : 6703]
0.00/0.11	[6696 : 6704]
0.00/0.11	Successful child: 6703
0.00/0.11	[ Invariant Graph ]
0.00/0.11	Strengthening and disabling transitions...
0.00/0.11	
0.00/0.11	LOG: CALL solverLinear in Graph for feasibility
0.00/0.11	
0.00/0.11	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.11	Strengthening transition (result): 
0.00/0.11	<l2, l2, main_z <= main_y /\ 1 + main_x <= main_y, {main_x -> 1 + main_x, main_y -> main_z, rest remain the same}>
0.00/0.11	[ Termination Graph ]
0.00/0.11	Strengthening and disabling transitions...
0.00/0.11	
0.00/0.11	LOG: CALL solverLinear in Graph for feasibility
0.00/0.11	
0.00/0.11	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.11	Strengthening transition (result): 
0.00/0.11	<l2, l2, main_z <= main_y /\ 1 + main_x <= main_y, {main_x -> 1 + main_x, main_y -> main_z, rest remain the same}>
0.00/0.11	Ranking function: -main_x + main_y
0.00/0.11	New Graphs: 
0.00/0.11	
0.00/0.11	LOG: CALL check - Post:main_z <= main_y - Process 2
0.00/0.11	* Exit transition: <l0, l2, main_x <= main_y /\ main_x = undef4 /\ main_y = undef5 /\ main_z = undef6, {all remain the same}>
0.00/0.11	* Postcondition  : main_z <= main_y
0.00/0.11	
0.00/0.11	LOG: CALL solveLinear
0.00/0.11	
0.00/0.11	LOG: RETURN solveLinear - Elapsed time: 0.000641s
0.00/0.11	> Postcondition is not implied!
0.00/0.11	
0.00/0.11	LOG: RETURN check - Elapsed time: 0.000767s
0.00/0.11	INVARIANTS: 
0.00/0.11	2: 
0.00/0.11	Quasi-INVARIANTS to narrow Graph: 
0.00/0.11	2: main_z <= main_y , 
0.00/0.11	It's unfeasible. Removing transition: 
0.00/0.11	<l2, l2, 1 + main_x <= main_y, {main_x -> 1 + main_x, main_y -> main_z, rest remain the same}>
0.00/0.11	invGraph after Narrowing: 
0.00/0.11	Transitions:
0.00/0.11	Variables:
0.00/0.11	main_x, main_y, main_z
0.00/0.11	Analyzing SCC {l2}...
0.00/0.11	No cycles found.
0.00/0.11	
0.00/0.11	Proving termination of subgraph 2
0.00/0.11	Analyzing SCC {l6}...
0.00/0.11	No cycles found.
0.00/0.11	
0.00/0.11	Program Terminates
0.00/0.11	EOF