0.00/0.03	YES
0.00/0.03	
0.00/0.03	Solver Timeout: 4
0.00/0.03	Global Timeout: 300
0.00/0.03	Maximum number of concurrent processes: 900
0.00/0.03	*******************************************************************************************
0.00/0.03	*********************** UNPROCESSED TRANSITION SYSTEMS PER FUNCTION ***********************
0.00/0.03	*******************************************************************************************
0.00/0.03	
0.00/0.03	
0.00/0.03	List of LLVMGraphs + assumeNodes + staticAssertNodes [1] :
0.00/0.03	
0.00/0.03	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
0.00/0.03	+                                                                  +
0.00/0.03	Init Location: 0
0.00/0.03	Transitions:
0.00/0.03	<l0, l1, true, seq{main__func_return_ -> 0, main_x -> ¿functionCall(__VERIFIER_nondet_int), main_res -> 0}>
0.00/0.03	<l1, l2, true>
0.00/0.03	<l2, l10, not((main_x > 1))>
0.00/0.03	<l2, l3, (main_x > 1)>
0.00/0.03	<l3, l4, true, seq{main_xtmp -> (main_x - 2), main_restmp -> 0}>
0.00/0.03	<l4, l5, true>
0.00/0.03	<l5, l8, not((main_xtmp > 1))>
0.00/0.03	<l5, l6, (main_xtmp > 1)>
0.00/0.03	<l6, l7, true, seq{main_xtmp -> (main_xtmp - 2), main_restmp -> (main_restmp + 1)}>
0.00/0.03	<l7, l5, true>
0.00/0.03	<l8, l9, true, seq{main_x -> (main_xtmp + 1), main_res -> (main_res + 1)}>
0.00/0.03	<l9, l2, true>
0.00/0.03	<l10, l11, true, seq{main__func_return_ -> 0}>
0.00/0.03	
0.00/0.03	Fresh variables:
0.00/0.03	
0.00/0.03	Undef variables:
0.00/0.03	
0.00/0.03	Abstraction variables:
0.00/0.03	
0.00/0.03	Exit nodes:
0.00/0.03	
0.00/0.03	Accepting locations:
0.00/0.03	
0.00/0.03	Asserts:
0.00/0.03	
0.00/0.03	+ Assume Nodes [0]: ++++++++++++++++++++++++++++++++++++++++++++++++
0.00/0.03	       
0.00/0.03	+ Static Assert Nodes [0]: +++++++++++++++++++++++++++++++++++++++++
0.00/0.03	       
0.00/0.03	+ After preprocess (paralelization): ++++++++++++++++++++++++++++++
0.00/0.03	
0.00/0.03	Init Location: 0
0.00/0.03	Transitions:
0.00/0.03	<l0, l12, true, seq{main__func_return_ -> 0}>
0.00/0.03	<l12, l13, true, seq{varCall_1 -> ¿functionCall(__VERIFIER_nondet_int)}>
0.00/0.03	<l13, l1, true, seq{main_x -> varCall_1, main_res -> 0}>
0.00/0.03	<l1, l2, true>
0.00/0.03	<l2, l3, (main_x > 1)>
0.00/0.03	<l2, l10, not((main_x > 1))>
0.00/0.03	<l3, l4, true, seq{main_xtmp -> (main_x - 2), main_restmp -> 0}>
0.00/0.03	<l4, l5, true>
0.00/0.03	<l5, l6, (main_xtmp > 1)>
0.00/0.03	<l5, l8, not((main_xtmp > 1))>
0.00/0.03	<l6, l7, true, seq{main_xtmp -> (main_xtmp - 2), main_restmp -> (main_restmp + 1)}>
0.00/0.03	<l7, l5, true>
0.00/0.03	<l8, l9, true, seq{main_x -> (main_xtmp + 1), main_res -> (main_res + 1)}>
0.00/0.03	<l9, l2, true>
0.00/0.03	<l10, l11, true, seq{main__func_return_ -> 0}>
0.00/0.03	
0.00/0.03	Fresh variables:
0.00/0.03	
0.00/0.03	Undef variables:
0.00/0.03	
0.00/0.03	Abstraction variables:
0.00/0.03	
0.00/0.03	Exit nodes:
0.00/0.03	11, 
0.00/0.03	Accepting locations:
0.00/0.03	
0.00/0.03	Asserts:
0.00/0.03	
0.00/0.03	+                                                                  +
0.00/0.03	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
0.00/0.03	
0.00/0.03	
0.00/0.03	Function Return and Parameters Information [2 functions]:
0.00/0.03	    function name: __VERIFIER_nondet_int [1 return + 0 parameters]        demangled: __VERIFIER_nondet_int
0.00/0.03	        __VERIFIER_nondet_int__func_return_      [function result] : int
0.00/0.03	    function name: main [1 return + 0 parameters]        demangled: main
0.00/0.03	        main__func_return_      [function result] : int
0.00/0.03	
0.00/0.03	
0.00/0.03	AST Ident Scanner Information [6 idents]:
0.00/0.03	__VERIFIER_nondet_int | function | [integer, ()] | <line: 3, col: 1> | <line: 10, col: 9>
0.00/0.03	main | function | [integer, ()] | <line: 5, col: 1>
0.00/0.03	x | local variable | integer | <line: 6, col: 5> | <line: 10, col: 5> <line: 13, col: 12> <line: 14, col: 16> <line: 22, col: 9>
0.00/0.03	xtmp | local variable | integer | <line: 7, col: 5> | <line: 14, col: 9> <line: 17, col: 16> <line: 18, col: 13> <line: 18, col: 20> <line: 22, col: 13>
0.00/0.03	res | local variable | integer | <line: 8, col: 5> | <line: 11, col: 5> <line: 23, col: 9> <line: 23, col: 15>
0.00/0.03	restmp | local variable | integer | <line: 9, col: 5> | <line: 15, col: 9> <line: 19, col: 13> <line: 19, col: 22>
0.00/0.03	
0.00/0.03	Main function: main
0.00/0.03	Preprocessed LLVMGraph
0.00/0.03	Init Location: 0
0.00/0.03	Transitions:
0.00/0.03	<l0, l5, (main_res = 0) /\ (undef2 > 1), par{main_xtmp -> (undef2 - 2), main_restmp -> 0}>
0.00/0.03	<l0, l11, (main_res = 0) /\ not((undef2 > 1))>
0.00/0.03	<l5, l5, (main_xtmp > 1), par{main_xtmp -> (main_xtmp - 2), main_restmp -> (main_restmp + 1)}>
0.00/0.03	<l5, l5, not((main_xtmp > 1)) /\ ((main_xtmp + 1) > 1), par{main_xtmp -> ((main_xtmp + 1) - 2), main_res -> (main_res + 1), main_restmp -> 0}>
0.00/0.03	<l5, l11, not((main_xtmp > 1)) /\ not(((main_xtmp + 1) > 1)), par{main_res -> (main_res + 1)}>
0.00/0.03	
0.00/0.03	Fresh variables:
0.00/0.03	undef2, 
0.00/0.03	
0.00/0.03	Undef variables:
0.00/0.03	undef2, 
0.00/0.03	
0.00/0.03	Abstraction variables:
0.00/0.03	
0.00/0.03	Exit nodes:
0.00/0.03	11, 
0.00/0.03	Accepting locations:
0.00/0.03	
0.00/0.03	Asserts:
0.00/0.03	
0.00/0.03	*************************************************************
0.00/0.03	*******************************************************************************************
0.00/0.03	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
0.00/0.03	*******************************************************************************************
0.00/0.03	
0.00/0.03	Init Location: 0
0.00/0.03	Graph 0:
0.00/0.03	Transitions:
0.00/0.03	Variables:
0.00/0.03	
0.00/0.03	Graph 1:
0.00/0.03	Transitions:
0.00/0.03	<l5, l5, 2 <= main_xtmp, {main_xtmp -> -2 + main_xtmp, main_restmp -> 1 + main_restmp, rest remain the same}>
0.00/0.03	<l5, l5, main_xtmp = 1, {main_xtmp -> -1 + main_xtmp, main_res -> 1 + main_res, main_restmp -> 0, rest remain the same}>
0.00/0.03	Variables:
0.00/0.03	main_xtmp, main_restmp, main_res
0.00/0.03	
0.00/0.03	Graph 2:
0.00/0.03	Transitions:
0.00/0.03	Variables:
0.00/0.03	
0.00/0.03	Precedence: 
0.00/0.03	Graph 0
0.00/0.03	
0.00/0.03	Graph 1
0.00/0.03	<l0, l5, 2 <= undef2 /\ main_res = 0, {main_xtmp -> -2 + undef2, main_restmp -> 0, rest remain the same}>
0.00/0.03	
0.00/0.03	Graph 2
0.00/0.03	<l0, l11, undef2 <= 1 /\ main_res = 0, {all remain the same}>
0.00/0.03	<l5, l11, main_xtmp <= 0, {main_res -> 1 + main_res, rest remain the same}>
0.00/0.03	
0.00/0.03	Map Locations to Subgraph:
0.00/0.03	( 0 , 0 )
0.00/0.03	( 5 , 1 )
0.00/0.03	( 11 , 2 )
0.00/0.03	
0.00/0.03	*******************************************************************************************
0.00/0.03	********************************    CHECKING ASSERTIONS    ********************************
0.00/0.03	*******************************************************************************************
0.00/0.03	
0.00/0.03	Proving termination of subgraph 0
0.00/0.03	Proving termination of subgraph 1
0.00/0.03	Checking unfeasibility...
0.00/0.03	Time used: 0.006127
0.00/0.03	
0.00/0.03	Checking conditional termination of SCC {l5}...
0.00/0.03	
0.00/0.03	LOG: CALL solveLinear
0.00/0.03	
0.00/0.03	LOG: RETURN solveLinear - Elapsed time: 0.001108s
0.00/0.03	Ranking function: -1 + main_xtmp
0.00/0.03	New Graphs: 
0.00/0.03	Proving termination of subgraph 2
0.00/0.03	Analyzing SCC {l11}...
0.00/0.03	No cycles found.
0.00/0.03	
0.00/0.03	Program Terminates
0.00/0.03	EOF