0.00/0.06	YES
0.00/0.06	
0.00/0.06	Solver Timeout: 4
0.00/0.06	Global Timeout: 300
0.00/0.06	Maximum number of concurrent processes: 900
0.00/0.06	*******************************************************************************************
0.00/0.06	*********************** UNPROCESSED TRANSITION SYSTEMS PER FUNCTION ***********************
0.00/0.06	*******************************************************************************************
0.00/0.06	
0.00/0.06	
0.00/0.06	List of LLVMGraphs + assumeNodes + staticAssertNodes [1] :
0.00/0.06	
0.00/0.06	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
0.00/0.06	+                                                                  +
0.00/0.06	Init Location: 0
0.00/0.06	Transitions:
0.00/0.06	<l0, l1, true, seq{main__func_return_ -> 0, main_d1 -> 73, main_d2 -> 74, main_x -> ¿functionCall(__VERIFIER_nondet_int)}>
0.00/0.06	<l1, l2, true>
0.00/0.06	<l2, l5, not((main_x >= 0))>
0.00/0.06	<l2, l3, (main_x >= 0)>
0.00/0.06	<l3, l4, true, seq{main_x -> (main_x - main_d1), main_d1old -> main_d1, main_d1 -> (main_d2 + 1), main_d2 -> (main_d1old + 1)}>
0.00/0.06	<l4, l2, true>
0.00/0.06	<l5, l6, true, seq{main__func_return_ -> 0}>
0.00/0.06	
0.00/0.06	Fresh variables:
0.00/0.06	
0.00/0.06	Undef variables:
0.00/0.06	
0.00/0.06	Abstraction variables:
0.00/0.06	
0.00/0.06	Exit nodes:
0.00/0.06	
0.00/0.06	Accepting locations:
0.00/0.06	
0.00/0.06	Asserts:
0.00/0.06	
0.00/0.06	+ Assume Nodes [0]: ++++++++++++++++++++++++++++++++++++++++++++++++
0.00/0.06	       
0.00/0.06	+ Static Assert Nodes [0]: +++++++++++++++++++++++++++++++++++++++++
0.00/0.06	       
0.00/0.06	+ After preprocess (paralelization): ++++++++++++++++++++++++++++++
0.00/0.06	
0.00/0.06	Init Location: 0
0.00/0.06	Transitions:
0.00/0.06	<l0, l7, true, seq{main__func_return_ -> 0, main_d1 -> 73, main_d2 -> 74}>
0.00/0.06	<l7, l8, true, seq{varCall_1 -> ¿functionCall(__VERIFIER_nondet_int)}>
0.00/0.06	<l8, l1, true, seq{main_x -> varCall_1}>
0.00/0.06	<l1, l2, true>
0.00/0.06	<l2, l3, (main_x >= 0)>
0.00/0.06	<l2, l5, not((main_x >= 0))>
0.00/0.06	<l3, l4, true, seq{main_x -> (main_x - main_d1), main_d1old -> main_d1, main_d1 -> (main_d2 + 1), main_d2 -> (main_d1old + 1)}>
0.00/0.06	<l4, l2, true>
0.00/0.06	<l5, l6, true, seq{main__func_return_ -> 0}>
0.00/0.06	
0.00/0.06	Fresh variables:
0.00/0.06	
0.00/0.06	Undef variables:
0.00/0.06	
0.00/0.06	Abstraction variables:
0.00/0.06	
0.00/0.06	Exit nodes:
0.00/0.06	6, 
0.00/0.06	Accepting locations:
0.00/0.06	
0.00/0.06	Asserts:
0.00/0.06	
0.00/0.06	+                                                                  +
0.00/0.06	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
0.00/0.06	
0.00/0.06	
0.00/0.06	Function Return and Parameters Information [2 functions]:
0.00/0.06	    function name: __VERIFIER_nondet_int [1 return + 0 parameters]        demangled: __VERIFIER_nondet_int
0.00/0.06	        __VERIFIER_nondet_int__func_return_      [function result] : int
0.00/0.06	    function name: main [1 return + 0 parameters]        demangled: main
0.00/0.06	        main__func_return_      [function result] : int
0.00/0.06	
0.00/0.06	
0.00/0.06	AST Ident Scanner Information [6 idents]:
0.00/0.06	__VERIFIER_nondet_int | function | [integer, ()] | <line: 14, col: 1> | <line: 21, col: 6>
0.00/0.06	main | function | [integer, ()] | <line: 16, col: 1>
0.00/0.06	x | local variable | integer | <line: 18, col: 5> | <line: 21, col: 2> <line: 22, col: 9> <line: 23, col: 3> <line: 23, col: 7>
0.00/0.06	d1 | local variable | integer | <line: 18, col: 5> | <line: 19, col: 2> <line: 23, col: 11> <line: 24, col: 11> <line: 25, col: 3>
0.00/0.06	d2 | local variable | integer | <line: 18, col: 5> | <line: 20, col: 2> <line: 25, col: 8> <line: 26, col: 3>
0.00/0.06	d1old | local variable | integer | <line: 18, col: 5> | <line: 24, col: 3> <line: 26, col: 8>
0.00/0.06	
0.00/0.06	Main function: main
0.00/0.06	Preprocessed LLVMGraph
0.00/0.06	Init Location: 0
0.00/0.06	Transitions:
0.00/0.06	<l0, l2, (main_x = undef2) /\ (main_d1 = 73) /\ (main_d2 = 74)>
0.00/0.06	<l2, l2, (main_x >= 0), par{main_x -> (main_x - main_d1), main_d1 -> (main_d2 + 1), main_d2 -> (main_d1 + 1)}>
0.00/0.06	<l2, l6, not((main_x >= 0))>
0.00/0.06	
0.00/0.06	Fresh variables:
0.00/0.06	undef2, 
0.00/0.06	
0.00/0.06	Undef variables:
0.00/0.06	undef2, 
0.00/0.06	
0.00/0.06	Abstraction variables:
0.00/0.06	
0.00/0.06	Exit nodes:
0.00/0.06	6, 
0.00/0.06	Accepting locations:
0.00/0.06	
0.00/0.06	Asserts:
0.00/0.06	
0.00/0.06	*************************************************************
0.00/0.06	*******************************************************************************************
0.00/0.06	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
0.00/0.06	*******************************************************************************************
0.00/0.06	
0.00/0.06	Init Location: 0
0.00/0.06	Graph 0:
0.00/0.06	Transitions:
0.00/0.06	Variables:
0.00/0.06	
0.00/0.06	Graph 1:
0.00/0.06	Transitions:
0.00/0.06	<l2, l2, 0 <= main_x, {main_x -> main_x - main_d1, main_d1 -> 1 + main_d2, main_d2 -> 1 + main_d1, rest remain the same}>
0.00/0.06	Variables:
0.00/0.06	main_x, main_d1, main_d2
0.00/0.06	
0.00/0.06	Graph 2:
0.00/0.06	Transitions:
0.00/0.06	Variables:
0.00/0.06	
0.00/0.06	Precedence: 
0.00/0.06	Graph 0
0.00/0.06	
0.00/0.06	Graph 1
0.00/0.06	<l0, l2, main_x = undef2 /\ main_d1 = 73 /\ main_d2 = 74, {all remain the same}>
0.00/0.06	
0.00/0.06	Graph 2
0.00/0.06	<l2, l6, 1 + main_x <= 0, {all remain the same}>
0.00/0.06	
0.00/0.06	Map Locations to Subgraph:
0.00/0.06	( 0 , 0 )
0.00/0.06	( 2 , 1 )
0.00/0.06	( 6 , 2 )
0.00/0.06	
0.00/0.06	*******************************************************************************************
0.00/0.06	********************************    CHECKING ASSERTIONS    ********************************
0.00/0.06	*******************************************************************************************
0.00/0.06	
0.00/0.06	Proving termination of subgraph 0
0.00/0.06	Proving termination of subgraph 1
0.00/0.06	Checking unfeasibility...
0.00/0.06	Time used: 0.002256
0.00/0.06	
0.00/0.06	Checking conditional termination of SCC {l2}...
0.00/0.06	
0.00/0.06	LOG: CALL solveLinear
0.00/0.06	
0.00/0.06	LOG: RETURN solveLinear - Elapsed time: 0.000560s
0.00/0.06	
0.00/0.06	LOG: CALL solveLinear
0.00/0.06	
0.00/0.06	LOG: RETURN solveLinear - Elapsed time: 0.001618s
0.00/0.06	[43131 : 43133]
0.00/0.06	[43131 : 43134]
0.00/0.06	Successful child: 43133
0.00/0.06	[ Invariant Graph ]
0.00/0.06	Strengthening and disabling transitions...
0.00/0.06	
0.00/0.06	LOG: CALL solverLinear in Graph for feasibility
0.00/0.06	
0.00/0.06	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.06	Strengthening transition (result): 
0.00/0.06	<l2, l2, 0 <= main_x /\ 1 <= main_d1 /\ 1 <= main_d2, {main_x -> main_x - main_d1, main_d1 -> 1 + main_d2, main_d2 -> 1 + main_d1, rest remain the same}>
0.00/0.06	[ Termination Graph ]
0.00/0.06	Strengthening and disabling transitions...
0.00/0.06	
0.00/0.06	LOG: CALL solverLinear in Graph for feasibility
0.00/0.06	
0.00/0.06	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.06	Strengthening transition (result): 
0.00/0.06	<l2, l2, 0 <= main_x /\ 1 <= main_d1 /\ 1 <= main_d2, {main_x -> main_x - main_d1, main_d1 -> 1 + main_d2, main_d2 -> 1 + main_d1, rest remain the same}>
0.00/0.06	Ranking function: main_x
0.00/0.06	New Graphs: 
0.00/0.06	INVARIANTS: 
0.00/0.06	2: 1 <= main_d1 , 1 <= main_d2 , 
0.00/0.06	Quasi-INVARIANTS to narrow Graph: 
0.00/0.06	2: 
0.00/0.06	Proving termination of subgraph 2
0.00/0.06	Analyzing SCC {l6}...
0.00/0.06	No cycles found.
0.00/0.06	
0.00/0.06	Program Terminates
0.00/0.06	EOF