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