18.50/8.31	NO
18.50/8.31	
18.50/8.31	Solver Timeout: 4
18.50/8.31	Global Timeout: 300
18.50/8.31	Maximum number of concurrent processes: 900
18.50/8.31	*******************************************************************************************
18.50/8.31	*********************** UNPROCESSED TRANSITION SYSTEMS PER FUNCTION ***********************
18.50/8.31	*******************************************************************************************
18.50/8.31	
18.50/8.31	
18.50/8.31	List of LLVMGraphs + assumeNodes + staticAssertNodes [1] :
18.50/8.31	
18.50/8.31	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
18.50/8.31	+                                                                  +
18.50/8.31	Init Location: 0
18.50/8.31	Transitions:
18.50/8.31	<l0, l1, true, seq{main__func_return_ -> 0, main_i -> ¿functionCall(__VERIFIER_nondet_int)}>
18.50/8.31	<l1, l2, true>
18.50/8.31	<l2, l3, true, seq{main_i -> (main_i + 1)}>
18.50/8.31	<l3, l2, true>
18.50/8.31	
18.50/8.31	Fresh variables:
18.50/8.31	
18.50/8.31	Undef variables:
18.50/8.31	
18.50/8.31	Abstraction variables:
18.50/8.31	
18.50/8.31	Exit nodes:
18.50/8.31	
18.50/8.31	Accepting locations:
18.50/8.31	
18.50/8.31	Asserts:
18.50/8.31	
18.50/8.31	+ Assume Nodes [0]: ++++++++++++++++++++++++++++++++++++++++++++++++
18.50/8.31	       
18.50/8.31	+ Static Assert Nodes [0]: +++++++++++++++++++++++++++++++++++++++++
18.50/8.31	       
18.50/8.31	+ After preprocess (paralelization): ++++++++++++++++++++++++++++++
18.50/8.31	
18.50/8.31	Init Location: 0
18.50/8.31	Transitions:
18.50/8.31	<l0, l4, true, seq{main__func_return_ -> 0}>
18.50/8.31	<l4, l5, true, seq{varCall_1 -> ¿functionCall(__VERIFIER_nondet_int)}>
18.50/8.31	<l5, l1, true, seq{main_i -> varCall_1}>
18.50/8.31	<l1, l2, true>
18.50/8.31	<l2, l3, true, seq{main_i -> (main_i + 1)}>
18.50/8.31	<l3, l2, true>
18.50/8.31	
18.50/8.31	Fresh variables:
18.50/8.31	
18.50/8.31	Undef variables:
18.50/8.31	
18.50/8.31	Abstraction variables:
18.50/8.31	
18.50/8.31	Exit nodes:
18.50/8.31	
18.50/8.31	Accepting locations:
18.50/8.31	
18.50/8.31	Asserts:
18.50/8.31	
18.50/8.31	+                                                                  +
18.50/8.31	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
18.50/8.31	
18.50/8.31	
18.50/8.31	Function Return and Parameters Information [2 functions]:
18.50/8.31	    function name: __VERIFIER_nondet_int [1 return + 0 parameters]        demangled: __VERIFIER_nondet_int
18.50/8.31	        __VERIFIER_nondet_int__func_return_      [function result] : int
18.50/8.31	    function name: main [1 return + 0 parameters]        demangled: main
18.50/8.31	        main__func_return_      [function result] : int
18.50/8.31	
18.50/8.31	
18.50/8.31	AST Ident Scanner Information [3 idents]:
18.50/8.31	__VERIFIER_nondet_int | function | [integer, ()] | <line: 3, col: 1> | <line: 7, col: 9>
18.50/8.31	main | function | [integer, ()] | <line: 5, col: 1>
18.50/8.31	i | local variable | integer | <line: 6, col: 5> | <line: 7, col: 5> <line: 10, col: 9> <line: 10, col: 13>
18.50/8.31	
18.50/8.31	Main function: main
18.50/8.31	Preprocessed LLVMGraph
18.50/8.31	Init Location: 0
18.50/8.31	Transitions:
18.50/8.31	<l0, l2, (main_i = undef2)>
18.50/8.31	<l2, l2, true, par{main_i -> (main_i + 1)}>
18.50/8.31	
18.50/8.31	Fresh variables:
18.50/8.31	undef2, 
18.50/8.31	
18.50/8.31	Undef variables:
18.50/8.31	undef2, 
18.50/8.31	
18.50/8.31	Abstraction variables:
18.50/8.31	
18.50/8.31	Exit nodes:
18.50/8.31	
18.50/8.31	Accepting locations:
18.50/8.31	
18.50/8.31	Asserts:
18.50/8.31	
18.50/8.31	*************************************************************
18.50/8.31	*******************************************************************************************
18.50/8.31	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
18.50/8.31	*******************************************************************************************
18.50/8.31	
18.50/8.31	Init Location: 0
18.50/8.31	Graph 0:
18.50/8.31	Transitions:
18.50/8.31	Variables:
18.50/8.31	
18.50/8.31	Graph 1:
18.50/8.31	Transitions:
18.50/8.31	<l2, l2, true, {main_i -> 1 + main_i, rest remain the same}>
18.50/8.31	Variables:
18.50/8.31	main_i
18.50/8.31	
18.50/8.31	Precedence: 
18.50/8.31	Graph 0
18.50/8.31	
18.50/8.31	Graph 1
18.50/8.31	<l0, l2, main_i = undef2, {all remain the same}>
18.50/8.31	
18.50/8.31	Map Locations to Subgraph:
18.50/8.31	( 0 , 0 )
18.50/8.31	( 2 , 1 )
18.50/8.31	
18.50/8.31	*******************************************************************************************
18.50/8.31	********************************    CHECKING ASSERTIONS    ********************************
18.50/8.31	*******************************************************************************************
18.50/8.31	
18.50/8.31	Proving termination of subgraph 0
18.50/8.31	Proving termination of subgraph 1
18.50/8.31	Checking unfeasibility...
18.50/8.31	Time used: 0.001373
18.50/8.31	
18.50/8.31	Checking conditional termination of SCC {l2}...
18.50/8.31	
18.50/8.31	LOG: CALL solveLinear
18.50/8.31	
18.50/8.31	LOG: RETURN solveLinear - Elapsed time: 0.000464s
18.50/8.31	
18.50/8.31	LOG: CALL solveLinear
18.50/8.31	
18.50/8.31	LOG: RETURN solveLinear - Elapsed time: 0.000870s
18.50/8.31	[32934 : 32936]
18.50/8.31	[32934 : 32937]
18.50/8.31	Solving with 1 template(s).
18.50/8.31	
18.50/8.31	LOG: CALL solveNonLinearGetFirstSolution
18.50/8.31	
18.50/8.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.004440s
18.50/8.31	Time used: 0.004191
18.50/8.31	Improving Solution with cost 1 ...
18.50/8.31	
18.50/8.31	LOG: CALL solveNonLinearGetNextSolution
18.50/8.31	
18.50/8.31	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.010606s
18.50/8.31	Time used: 0.010601
18.50/8.31	
18.50/8.31	LOG: SAT solveNonLinear - Elapsed time: 0.015046s
18.50/8.31	Cost: 1; Total time: 0.014792
18.50/8.31	Quasi-ranking function: 50000 - main_i
18.50/8.31	New Graphs: 
18.50/8.31	Transitions:
18.50/8.31	<l2, l2, 50001 <= main_i, {main_i -> 1 + main_i, rest remain the same}>
18.50/8.31	Variables:
18.50/8.31	main_i
18.50/8.31	Checking conditional termination of SCC {l2}...
18.50/8.31	
18.50/8.31	LOG: CALL solveLinear
18.50/8.31	
18.50/8.31	LOG: RETURN solveLinear - Elapsed time: 0.000396s
18.50/8.31	
18.50/8.31	LOG: CALL solveLinear
18.50/8.31	
18.50/8.31	LOG: RETURN solveLinear - Elapsed time: 0.001172s
18.50/8.31	[32934 : 32941]
18.50/8.31	[32934 : 32942]
18.50/8.31	Solving with 1 template(s).
18.50/8.31	
18.50/8.31	LOG: CALL solveNonLinearGetFirstSolution
18.50/8.31	
18.50/8.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.003798s
18.50/8.31	Time used: 0.003537
18.50/8.31	Termination failed. Trying to show unreachability...
18.50/8.31	Proving unreachability of entry: <l0, l2, main_i = undef2, {all remain the same}>
18.50/8.31	
18.50/8.31	LOG: CALL check - Post:1 <= 0 - Process 1
18.50/8.31	* Exit transition: <l0, l2, main_i = undef2, {all remain the same}>
18.50/8.31	* Postcondition  : 1 <= 0
18.50/8.31	
18.50/8.31	LOG: CALL solveLinear
18.50/8.31	
18.50/8.31	LOG: RETURN solveLinear - Elapsed time: 0.000487s
18.50/8.31	> Postcondition is not implied!
18.50/8.31	
18.50/8.31	LOG: RETURN check - Elapsed time: 0.000563s
18.50/8.31	Cannot prove unreachability
18.50/8.31	
18.50/8.31	[32934 : 32946]
18.50/8.31	[32934 : 32947]
18.50/8.31	Successful child: 32946
18.50/8.31	
18.50/8.31	Program does NOT terminate
18.50/8.31	EOF