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_i -> 0}>
0.00/0.06	<l1, l2, true>
0.00/0.06	<l2, l10, not((main_i < 100))>
0.00/0.06	<l2, l3, (main_i < 100)>
0.00/0.06	<l3, l4, true, seq{main_j -> 0}>
0.00/0.06	<l4, l5, true>
0.00/0.06	<l5, l8, not((main_j < 1))>
0.00/0.06	<l5, l6, (main_j < 1)>
0.00/0.06	<l6, l7, true, seq{main_j -> (main_j + 0)}>
0.00/0.06	<l7, l5, true>
0.00/0.06	<l8, l9, true, seq{main_i -> (main_i + 1)}>
0.00/0.06	<l9, l2, true>
0.00/0.06	<l10, l11, 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_i -> 0}>
0.00/0.06	<l1, l2, true>
0.00/0.06	<l2, l3, (main_i < 100)>
0.00/0.06	<l2, l10, not((main_i < 100))>
0.00/0.06	<l3, l4, true, seq{main_j -> 0}>
0.00/0.06	<l4, l5, true>
0.00/0.06	<l5, l6, (main_j < 1)>
0.00/0.06	<l5, l8, not((main_j < 1))>
0.00/0.06	<l6, l7, true, seq{main_j -> (main_j + 0)}>
0.00/0.06	<l7, l5, true>
0.00/0.06	<l8, l9, true, seq{main_i -> (main_i + 1)}>
0.00/0.06	<l9, l2, true>
0.00/0.06	<l10, l11, 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	11, 
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 [4 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	i | local variable | integer | <line: 6, col: 5> | <line: 8, col: 5> <line: 10, col: 12> <line: 15, col: 9> <line: 15, col: 13>
0.00/0.06	j | local variable | integer | <line: 7, col: 5> | <line: 11, col: 9> <line: 12, col: 16> <line: 13, col: 13> <line: 13, col: 17>
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, l5, (main_i = 0) /\ (0 < 100), par{main_j -> 0}>
0.00/0.06	<l5, l5, (main_j < 1), par{main_j -> (main_j + 0)}>
0.00/0.06	<l5, l5, not((main_j < 1)) /\ ((main_i + 1) < 100), par{main_i -> (main_i + 1), main_j -> 0}>
0.00/0.06	<l5, l11, not((main_j < 1)) /\ not(((main_i + 1) < 100)), par{main_i -> (main_i + 1)}>
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	11, 
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	<l5, l5, main_j <= 0, {all remain the same}>
0.00/0.06	<l5, l5, 1 <= main_j /\ main_i <= 98, {main_i -> 1 + main_i, main_j -> 0, rest remain the same}>
0.00/0.06	Variables:
0.00/0.06	main_j, 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, l5, main_i = 0, {main_j -> 0, rest remain the same}>
0.00/0.06	
0.00/0.06	Graph 2
0.00/0.06	<l5, l11, 1 <= main_j /\ 99 <= main_i, {main_i -> 1 + main_i, rest 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	( 5 , 1 )
0.00/0.06	( 11 , 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.003799
0.00/0.06	Some transition disabled by a set of invariant(s):
0.00/0.06	Invariant at l5: main_j <= 0
0.00/0.06	
0.00/0.06	Strengthening and disabling transitions...
0.00/0.06	> It's unfeasible. Removing transition: 
0.00/0.06	<l5, l5, 1 <= main_j /\ main_i <= 98, {main_i -> 1 + main_i, main_j -> 0, rest remain the same}>
0.00/0.06	
0.00/0.06	LOG: CALL solverLinear in Graph for feasibility
0.00/0.06	
0.00/0.06	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.06	Strengthening transition (result): 
0.00/0.06	<l5, l5, main_j <= 0, {all remain the same}>
0.00/0.06	Checking unfeasibility...
0.00/0.06	Time used: 0.001444
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 1 <= main_j and entry <l5, l5, true, {all remain the same}>
0.00/0.06	
0.00/0.06	LOG: CALL check - Post:1 <= main_j - Process 1
0.00/0.06	* Exit transition: <l5, l5, true, {all remain the same}>
0.00/0.06	* Postcondition  : 1 <= main_j
0.00/0.06	Postcodition moved up: 1 <= main_j
0.00/0.06	
0.00/0.06	LOG: Try proving POST
0.00/0.06	
0.00/0.06	LOG: CALL check - Post:1 <= main_j - Process 2
0.00/0.06	* Exit transition: <l0, l5, main_i = 0, {main_j -> 0, rest remain the same}>
0.00/0.06	* Postcondition  : 1 <= main_j
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.000223s
0.00/0.06	> Postcondition is not implied!
0.00/0.06	
0.00/0.06	LOG: RETURN check - Elapsed time: 0.000296s
0.00/0.06	
0.00/0.06	LOG: NarrowEntry size 1
0.00/0.06	Narrowing transition: 
0.00/0.06	<l5, l5, main_j <= 0, {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, l5, 0 <= 0 /\ main_i = 0, {main_j -> 0, rest remain the same}>
0.00/0.06	END ENTRIES:
0.00/0.06	GRAPH:
0.00/0.06	<l5, l5, main_j <= 0, {all remain the same}>
0.00/0.06	END GRAPH:
0.00/0.06	EXIT: <l5, l5, true, {all remain the same}>
0.00/0.06	POST: 1 <= main_j
0.00/0.06	
0.00/0.06	
0.00/0.06	LOG: Try proving POST
0.00/0.06	[25768 : 25770]
0.00/0.06	[25768 : 25771]
0.00/0.06	[25768 : 25772]
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.024899s
0.00/0.06	
0.00/0.06	[25768 : 25773]
0.00/0.06	[25768 : 25774]
0.00/0.06	Successful child: 25773
0.00/0.06	
0.00/0.06	Program does NOT terminate
0.00/0.06	EOF