0.00/0.06	NO
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_a -> 5, main_b -> 3, main_i -> 0}>
0.00/0.06	<l1, l2, true>
0.00/0.06	<l2, l5, not((main_i < 10))>
0.00/0.06	<l2, l3, (main_i < 10)>
0.00/0.06	<l3, l4, true, seq{main_i -> (main_i + 0)}>
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, l1, true, seq{main__func_return_ -> 0, main_a -> 5, main_b -> 3, main_i -> 0}>
0.00/0.06	<l1, l2, true>
0.00/0.06	<l2, l3, (main_i < 10)>
0.00/0.06	<l2, l5, not((main_i < 10))>
0.00/0.06	<l3, l4, true, seq{main_i -> (main_i + 0)}>
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 [1 functions]:
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 [5 idents]:
0.00/0.06	__VERIFIER_nondet_int | function | [integer, ()] | <line: 3, col: 1>
0.00/0.06	main | function | [integer, ()] | <line: 5, col: 1>
0.00/0.06	a | local variable | integer | <line: 6, col: 5> | <line: 9, col: 5>
0.00/0.06	b | local variable | integer | <line: 7, col: 5> | <line: 10, col: 5>
0.00/0.06	i | local variable | integer | <line: 8, col: 5> | <line: 11, col: 5> <line: 13, col: 12> <line: 13, col: 22> <line: 13, col: 26>
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_i = 0)>
0.00/0.06	<l2, l2, (main_i < 10), par{main_i -> (main_i + 0)}>
0.00/0.06	<l2, l6, not((main_i < 10))>
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	*******************************************************************************************
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, main_i <= 9, {all remain the same}>
0.00/0.06	Variables:
0.00/0.06	main_i
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_i = 0, {all remain the same}>
0.00/0.06	
0.00/0.06	Graph 2
0.00/0.06	<l2, l6, 10 <= main_i, {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.001282
0.00/0.06	
0.00/0.06	> No variable changes in termination graph.
0.00/0.06	Checking conditional unfeasibility...
0.00/0.06	Calling Safety with literal 10 <= main_i and entry <l2, l2, true, {all remain the same}>
0.00/0.06	
0.00/0.06	LOG: CALL check - Post:10 <= main_i - Process 1
0.00/0.06	* Exit transition: <l2, l2, true, {all remain the same}>
0.00/0.06	* Postcondition  : 10 <= main_i
0.00/0.06	Postcodition moved up: 10 <= main_i
0.00/0.06	
0.00/0.06	LOG: Try proving POST
0.00/0.06	
0.00/0.06	LOG: CALL check - Post:10 <= main_i - Process 2
0.00/0.06	* Exit transition: <l0, l2, main_i = 0, {all remain the same}>
0.00/0.06	* Postcondition  : 10 <= main_i
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.000243s
0.00/0.06	> Postcondition is not implied!
0.00/0.06	
0.00/0.06	LOG: RETURN check - Elapsed time: 0.000317s
0.00/0.06	
0.00/0.06	LOG: NarrowEntry size 1
0.00/0.06	Narrowing transition: 
0.00/0.06	<l2, l2, main_i <= 9, {all remain the same}>
0.00/0.06	
0.00/0.06	LOG: Narrow transition size 1
0.00/0.06	ENTRIES:
0.00/0.06	<l0, l2, main_i = 0, {all remain the same}>
0.00/0.06	END ENTRIES:
0.00/0.06	GRAPH:
0.00/0.06	<l2, l2, main_i <= 9, {all remain the same}>
0.00/0.06	END GRAPH:
0.00/0.06	EXIT: <l2, l2, true, {all remain the same}>
0.00/0.06	POST: 10 <= main_i
0.00/0.06	
0.00/0.06	
0.00/0.06	LOG: Try proving POST
0.00/0.06	[61470 : 61472]
0.00/0.06	[61470 : 61473]
0.00/0.06	[61470 : 61474]
0.00/0.06	
0.00/0.06	LOG: Postcondition is not implied - no solution
0.00/0.06	> Postcondition is not implied!
0.00/0.06	
0.00/0.06	LOG: RETURN check - Elapsed time: 0.020622s
0.00/0.06	
0.00/0.06	[61470 : 61475]
0.00/0.06	[61470 : 61479]
0.00/0.06	Successful child: 61475
0.00/0.06	
0.00/0.06	Program does NOT terminate
0.00/0.06	EOF