18.64/8.38	NO
18.64/8.38	
18.64/8.38	Solver Timeout: 4
18.64/8.38	Global Timeout: 300
18.64/8.38	Maximum number of concurrent processes: 900
18.64/8.38	*******************************************************************************************
18.64/8.38	*********************** UNPROCESSED TRANSITION SYSTEMS PER FUNCTION ***********************
18.64/8.38	*******************************************************************************************
18.64/8.38	
18.64/8.38	
18.64/8.38	List of LLVMGraphs + assumeNodes + staticAssertNodes [1] :
18.64/8.38	
18.64/8.38	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
18.64/8.38	+                                                                  +
18.64/8.38	Init Location: 0
18.64/8.38	Transitions:
18.64/8.38	<l0, l1, true, seq{main__func_return_ -> 0, main_i -> ¿functionCall(__VERIFIER_nondet_int)}>
18.64/8.38	<l1, l2, true>
18.64/8.38	<l2, l5, not((main_i > 0))>
18.64/8.38	<l2, l3, (main_i > 0)>
18.64/8.38	<l3, l4, true, seq{main_i -> (main_i + 1)}>
18.64/8.38	<l4, l2, true>
18.64/8.38	<l5, l6, true, seq{main__func_return_ -> 0}>
18.64/8.38	
18.64/8.38	Fresh variables:
18.64/8.38	
18.64/8.38	Undef variables:
18.64/8.38	
18.64/8.38	Abstraction variables:
18.64/8.38	
18.64/8.38	Exit nodes:
18.64/8.38	
18.64/8.38	Accepting locations:
18.64/8.38	
18.64/8.38	Asserts:
18.64/8.38	
18.64/8.38	+ Assume Nodes [0]: ++++++++++++++++++++++++++++++++++++++++++++++++
18.64/8.38	       
18.64/8.38	+ Static Assert Nodes [0]: +++++++++++++++++++++++++++++++++++++++++
18.64/8.38	       
18.64/8.38	+ After preprocess (paralelization): ++++++++++++++++++++++++++++++
18.64/8.38	
18.64/8.38	Init Location: 0
18.64/8.38	Transitions:
18.64/8.38	<l0, l7, true, seq{main__func_return_ -> 0}>
18.64/8.38	<l7, l8, true, seq{varCall_1 -> ¿functionCall(__VERIFIER_nondet_int)}>
18.64/8.38	<l8, l1, true, seq{main_i -> varCall_1}>
18.64/8.38	<l1, l2, true>
18.64/8.38	<l2, l3, (main_i > 0)>
18.64/8.38	<l2, l5, not((main_i > 0))>
18.64/8.38	<l3, l4, true, seq{main_i -> (main_i + 1)}>
18.64/8.38	<l4, l2, true>
18.64/8.38	<l5, l6, true, seq{main__func_return_ -> 0}>
18.64/8.38	
18.64/8.38	Fresh variables:
18.64/8.38	
18.64/8.38	Undef variables:
18.64/8.38	
18.64/8.38	Abstraction variables:
18.64/8.38	
18.64/8.38	Exit nodes:
18.64/8.38	6, 
18.64/8.38	Accepting locations:
18.64/8.38	
18.64/8.38	Asserts:
18.64/8.38	
18.64/8.38	+                                                                  +
18.64/8.38	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
18.64/8.38	
18.64/8.38	
18.64/8.38	Function Return and Parameters Information [2 functions]:
18.64/8.38	    function name: __VERIFIER_nondet_int [1 return + 0 parameters]        demangled: __VERIFIER_nondet_int
18.64/8.38	        __VERIFIER_nondet_int__func_return_      [function result] : int
18.64/8.38	    function name: main [1 return + 0 parameters]        demangled: main
18.64/8.38	        main__func_return_      [function result] : int
18.64/8.38	
18.64/8.38	
18.64/8.38	AST Ident Scanner Information [3 idents]:
18.64/8.38	__VERIFIER_nondet_int | function | [integer, ()] | <line: 3, col: 1> | <line: 7, col: 9>
18.64/8.38	main | function | [integer, ()] | <line: 5, col: 1>
18.64/8.38	i | local variable | integer | <line: 6, col: 5> | <line: 7, col: 5> <line: 9, col: 12> <line: 10, col: 9> <line: 10, col: 13>
18.64/8.38	
18.64/8.38	Main function: main
18.64/8.38	Preprocessed LLVMGraph
18.64/8.38	Init Location: 0
18.64/8.38	Transitions:
18.64/8.38	<l0, l2, (main_i = undef2)>
18.64/8.38	<l2, l2, (main_i > 0), par{main_i -> (main_i + 1)}>
18.64/8.38	<l2, l6, not((main_i > 0))>
18.64/8.38	
18.64/8.38	Fresh variables:
18.64/8.38	undef2, 
18.64/8.38	
18.64/8.38	Undef variables:
18.64/8.38	undef2, 
18.64/8.38	
18.64/8.38	Abstraction variables:
18.64/8.38	
18.64/8.38	Exit nodes:
18.64/8.38	6, 
18.64/8.38	Accepting locations:
18.64/8.38	
18.64/8.38	Asserts:
18.64/8.38	
18.64/8.38	*************************************************************
18.64/8.38	*******************************************************************************************
18.64/8.38	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
18.64/8.38	*******************************************************************************************
18.64/8.38	
18.64/8.38	Init Location: 0
18.64/8.38	Graph 0:
18.64/8.38	Transitions:
18.64/8.38	Variables:
18.64/8.38	
18.64/8.38	Graph 1:
18.64/8.38	Transitions:
18.64/8.38	<l2, l2, 1 <= main_i, {main_i -> 1 + main_i, rest remain the same}>
18.64/8.38	Variables:
18.64/8.38	main_i
18.64/8.38	
18.64/8.38	Graph 2:
18.64/8.38	Transitions:
18.64/8.38	Variables:
18.64/8.38	
18.64/8.38	Precedence: 
18.64/8.38	Graph 0
18.64/8.38	
18.64/8.38	Graph 1
18.64/8.38	<l0, l2, main_i = undef2, {all remain the same}>
18.64/8.38	
18.64/8.38	Graph 2
18.64/8.38	<l2, l6, main_i <= 0, {all remain the same}>
18.64/8.38	
18.64/8.38	Map Locations to Subgraph:
18.64/8.38	( 0 , 0 )
18.64/8.38	( 2 , 1 )
18.64/8.38	( 6 , 2 )
18.64/8.38	
18.64/8.38	*******************************************************************************************
18.64/8.38	********************************    CHECKING ASSERTIONS    ********************************
18.64/8.38	*******************************************************************************************
18.64/8.38	
18.64/8.38	Proving termination of subgraph 0
18.64/8.38	Proving termination of subgraph 1
18.64/8.38	Checking unfeasibility...
18.64/8.38	Time used: 0.001396
18.64/8.38	
18.64/8.38	Checking conditional termination of SCC {l2}...
18.64/8.38	
18.64/8.38	LOG: CALL solveLinear
18.64/8.38	
18.64/8.38	LOG: RETURN solveLinear - Elapsed time: 0.000546s
18.64/8.38	
18.64/8.38	LOG: CALL solveLinear
18.64/8.38	
18.64/8.38	LOG: RETURN solveLinear - Elapsed time: 0.001274s
18.64/8.38	[50933 : 50935]
18.64/8.38	[50933 : 50936]
18.64/8.38	Successful child: 50935
18.64/8.38	[ Invariant Graph ]
18.64/8.38	Strengthening and disabling transitions...
18.64/8.38	
18.64/8.38	LOG: CALL solverLinear in Graph for feasibility
18.64/8.38	
18.64/8.38	LOG: RETURN solveLinear in Graph for feasibility
18.64/8.38	It's unfeasible. Removing transition: 
18.64/8.38	<l2, l2, 1 <= main_i, {main_i -> 1 + main_i, rest remain the same}>
18.64/8.38	[ Termination Graph ]
18.64/8.38	Strengthening and disabling transitions...
18.64/8.38	
18.64/8.38	LOG: CALL solverLinear in Graph for feasibility
18.64/8.38	
18.64/8.38	LOG: RETURN solveLinear in Graph for feasibility
18.64/8.38	It's unfeasible. Removing transition: 
18.64/8.38	<l2, l2, 1 <= main_i, {main_i -> 1 + main_i, rest remain the same}>
18.64/8.38	New Graphs: 
18.64/8.38	
18.64/8.38	LOG: CALL check - Post:main_i <= 0 - Process 1
18.64/8.38	* Exit transition: <l0, l2, main_i = undef2, {all remain the same}>
18.64/8.38	* Postcondition  : main_i <= 0
18.64/8.38	
18.64/8.38	LOG: CALL solveLinear
18.64/8.38	
18.64/8.38	LOG: RETURN solveLinear - Elapsed time: 0.000348s
18.64/8.38	> Postcondition is not implied!
18.64/8.38	
18.64/8.38	LOG: RETURN check - Elapsed time: 0.000427s
18.64/8.38	INVARIANTS: 
18.64/8.38	2: 
18.64/8.38	Quasi-INVARIANTS to narrow Graph: 
18.64/8.38	2: main_i <= 0 , 
18.64/8.38	Narrowing transition: 
18.64/8.38	<l2, l2, 1 <= main_i, {main_i -> 1 + main_i, rest remain the same}>
18.64/8.38	
18.64/8.38	LOG: Narrow transition size 1
18.64/8.38	invGraph after Narrowing: 
18.64/8.38	Transitions:
18.64/8.38	<l2, l2, 1 <= main_i, {main_i -> 1 + main_i, rest remain the same}>
18.64/8.38	Variables:
18.64/8.38	main_i
18.64/8.38	Checking conditional termination of SCC {l2}...
18.64/8.38	
18.64/8.38	LOG: CALL solveLinear
18.64/8.38	
18.64/8.38	LOG: RETURN solveLinear - Elapsed time: 0.000545s
18.64/8.38	
18.64/8.38	LOG: CALL solveLinear
18.64/8.38	
18.64/8.38	LOG: RETURN solveLinear - Elapsed time: 0.001380s
18.64/8.38	[50933 : 50940]
18.64/8.38	[50933 : 50941]
18.64/8.38	Solving with 1 template(s).
18.64/8.38	
18.64/8.38	LOG: CALL solveNonLinearGetFirstSolution
18.64/8.38	
18.64/8.38	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.004918s
18.64/8.38	Time used: 0.004629
18.64/8.38	Improving Solution with cost 1 ...
18.64/8.38	
18.64/8.38	LOG: CALL solveNonLinearGetNextSolution
18.64/8.38	
18.64/8.38	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.014089s
18.64/8.38	Time used: 0.014082
18.64/8.38	
18.64/8.38	LOG: SAT solveNonLinear - Elapsed time: 0.019006s
18.64/8.38	Cost: 1; Total time: 0.018711
18.64/8.38	Quasi-ranking function: 50000 - main_i
18.64/8.38	New Graphs: 
18.64/8.38	Transitions:
18.64/8.38	<l2, l2, 50001 <= main_i, {main_i -> 1 + main_i, rest remain the same}>
18.64/8.38	Variables:
18.64/8.38	main_i
18.64/8.38	Checking conditional termination of SCC {l2}...
18.64/8.38	
18.64/8.38	LOG: CALL solveLinear
18.64/8.38	
18.64/8.38	LOG: RETURN solveLinear - Elapsed time: 0.000395s
18.64/8.38	
18.64/8.38	LOG: CALL solveLinear
18.64/8.38	
18.64/8.38	LOG: RETURN solveLinear - Elapsed time: 0.001174s
18.64/8.38	[50933 : 50952]
18.64/8.38	[50933 : 50953]
18.64/8.38	Solving with 1 template(s).
18.64/8.38	
18.64/8.38	LOG: CALL solveNonLinearGetFirstSolution
18.64/8.38	
18.64/8.38	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.004582s
18.64/8.38	Time used: 0.004284
18.64/8.38	
18.64/8.38	[50933 : 50957]
18.64/8.38	[50933 : 50961]
18.64/8.38	Successful child: 50957
18.64/8.38	
18.64/8.38	Program does NOT terminate
18.64/8.38	EOF