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