65.01/34.66	NO
65.01/34.66	
65.01/34.66	Solver Timeout: 4
65.01/34.66	Global Timeout: 300
65.01/34.66	Maximum number of concurrent processes: 900
65.01/34.66	*******************************************************************************************
65.01/34.66	*********************** UNPROCESSED TRANSITION SYSTEMS PER FUNCTION ***********************
65.01/34.66	*******************************************************************************************
65.01/34.66	
65.01/34.66	
65.01/34.66	List of LLVMGraphs + assumeNodes + staticAssertNodes [1] :
65.01/34.66	
65.01/34.66	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
65.01/34.66	+                                                                  +
65.01/34.66	Init Location: 0
65.01/34.66	Transitions:
65.01/34.66	<l0, l1, true, seq{main__func_return_ -> 0, main_j -> 100, main_i -> 0}>
65.01/34.66	<l1, l2, true>
65.01/34.66	<l2, l5, not((main_i < main_j))>
65.01/34.66	<l2, l3, (main_i < main_j)>
65.01/34.66	<l3, l4, true, seq{main_j -> (main_j + 1), main_i -> (main_i + 1)}>
65.01/34.66	<l4, l2, true>
65.01/34.66	<l5, l6, true, seq{main__func_return_ -> 0}>
65.01/34.66	
65.01/34.66	Fresh variables:
65.01/34.66	
65.01/34.66	Undef variables:
65.01/34.66	
65.01/34.66	Abstraction variables:
65.01/34.66	
65.01/34.66	Exit nodes:
65.01/34.66	
65.01/34.66	Accepting locations:
65.01/34.66	
65.01/34.66	Asserts:
65.01/34.66	
65.01/34.66	+ Assume Nodes [0]: ++++++++++++++++++++++++++++++++++++++++++++++++
65.01/34.66	       
65.01/34.66	+ Static Assert Nodes [0]: +++++++++++++++++++++++++++++++++++++++++
65.01/34.66	       
65.01/34.66	+ After preprocess (paralelization): ++++++++++++++++++++++++++++++
65.01/34.66	
65.01/34.66	Init Location: 0
65.01/34.66	Transitions:
65.01/34.66	<l0, l1, true, seq{main__func_return_ -> 0, main_j -> 100, main_i -> 0}>
65.01/34.66	<l1, l2, true>
65.01/34.66	<l2, l3, (main_i < main_j)>
65.01/34.66	<l2, l5, not((main_i < main_j))>
65.01/34.66	<l3, l4, true, seq{main_j -> (main_j + 1), main_i -> (main_i + 1)}>
65.01/34.66	<l4, l2, true>
65.01/34.66	<l5, l6, true, seq{main__func_return_ -> 0}>
65.01/34.66	
65.01/34.66	Fresh variables:
65.01/34.66	
65.01/34.66	Undef variables:
65.01/34.66	
65.01/34.66	Abstraction variables:
65.01/34.66	
65.01/34.66	Exit nodes:
65.01/34.66	6, 
65.01/34.66	Accepting locations:
65.01/34.66	
65.01/34.66	Asserts:
65.01/34.66	
65.01/34.66	+                                                                  +
65.01/34.66	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
65.01/34.66	
65.01/34.66	
65.01/34.66	Function Return and Parameters Information [1 functions]:
65.01/34.66	    function name: main [1 return + 0 parameters]        demangled: main
65.01/34.66	        main__func_return_      [function result] : int
65.01/34.66	
65.01/34.66	
65.01/34.66	AST Ident Scanner Information [4 idents]:
65.01/34.66	__VERIFIER_nondet_int | function | [integer, ()] | <line: 3, col: 1>
65.01/34.66	main | function | [integer, ()] | <line: 5, col: 1>
65.01/34.66	i | local variable | integer | <line: 6, col: 5> | <line: 9, col: 5> <line: 11, col: 12> <line: 13, col: 9> <line: 13, col: 13>
65.01/34.66	j | local variable | integer | <line: 7, col: 5> | <line: 8, col: 5> <line: 11, col: 16> <line: 12, col: 9> <line: 12, col: 13>
65.01/34.66	
65.01/34.66	Main function: main
65.01/34.66	Preprocessed LLVMGraph
65.01/34.66	Init Location: 0
65.01/34.66	Transitions:
65.01/34.66	<l0, l2, (main_i = 0) /\ (main_j = 100)>
65.01/34.66	<l2, l2, (main_i < main_j), par{main_i -> (main_i + 1), main_j -> (main_j + 1)}>
65.01/34.66	<l2, l6, not((main_i < main_j))>
65.01/34.66	
65.01/34.66	Fresh variables:
65.01/34.66	
65.01/34.66	Undef variables:
65.01/34.66	
65.01/34.66	Abstraction variables:
65.01/34.66	
65.01/34.66	Exit nodes:
65.01/34.66	6, 
65.01/34.66	Accepting locations:
65.01/34.66	
65.01/34.66	Asserts:
65.01/34.66	
65.01/34.66	*************************************************************
65.01/34.66	*******************************************************************************************
65.01/34.66	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
65.01/34.66	*******************************************************************************************
65.01/34.66	
65.01/34.66	Init Location: 0
65.01/34.66	Graph 0:
65.01/34.66	Transitions:
65.01/34.66	Variables:
65.01/34.66	
65.01/34.66	Graph 1:
65.01/34.66	Transitions:
65.01/34.66	<l2, l2, 1 + main_i <= main_j, {main_i -> 1 + main_i, main_j -> 1 + main_j, rest remain the same}>
65.01/34.66	Variables:
65.01/34.66	main_i, main_j
65.01/34.66	
65.01/34.66	Graph 2:
65.01/34.66	Transitions:
65.01/34.66	Variables:
65.01/34.66	
65.01/34.66	Precedence: 
65.01/34.66	Graph 0
65.01/34.66	
65.01/34.66	Graph 1
65.01/34.66	<l0, l2, main_i = 0 /\ main_j = 100, {all remain the same}>
65.01/34.66	
65.01/34.66	Graph 2
65.01/34.66	<l2, l6, main_j <= main_i, {all remain the same}>
65.01/34.66	
65.01/34.66	Map Locations to Subgraph:
65.01/34.66	( 0 , 0 )
65.01/34.66	( 2 , 1 )
65.01/34.66	( 6 , 2 )
65.01/34.66	
65.01/34.66	*******************************************************************************************
65.01/34.66	********************************    CHECKING ASSERTIONS    ********************************
65.01/34.66	*******************************************************************************************
65.01/34.66	
65.01/34.66	Proving termination of subgraph 0
65.01/34.66	Proving termination of subgraph 1
65.01/34.66	Checking unfeasibility...
65.01/34.66	Time used: 0.002164
65.01/34.66	
65.01/34.66	Checking conditional termination of SCC {l2}...
65.01/34.66	
65.01/34.66	LOG: CALL solveLinear
65.01/34.66	
65.01/34.66	LOG: RETURN solveLinear - Elapsed time: 0.000525s
65.01/34.66	
65.01/34.66	LOG: CALL solveLinear
65.01/34.66	
65.01/34.66	LOG: RETURN solveLinear - Elapsed time: 0.001515s
65.01/34.66	[36360 : 36361]
65.01/34.66	[36360 : 36362]
65.01/34.66	Solving with 1 template(s).
65.01/34.66	
65.01/34.66	LOG: CALL solveNonLinearGetFirstSolution
65.01/34.66	
65.01/34.66	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.007870s
65.01/34.66	Time used: 0.007529
65.01/34.66	Improving Solution with cost 1 ...
65.01/34.66	
65.01/34.66	LOG: CALL solveNonLinearGetNextSolution
65.01/34.66	
65.01/34.66	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000510s
65.01/34.66	Time used: 1.0005
65.01/34.66	
65.01/34.66	LOG: SAT solveNonLinear - Elapsed time: 1.008380s
65.01/34.66	Cost: 1; Total time: 1.00803
65.01/34.66	Termination implied by a set of invariant(s):
65.01/34.66	Invariant at l2: 0 <= 1 + main_i
65.01/34.66	[ Invariant Graph ]
65.01/34.66	Strengthening and disabling transitions...
65.01/34.66	
65.01/34.66	LOG: CALL solverLinear in Graph for feasibility
65.01/34.66	
65.01/34.66	LOG: RETURN solveLinear in Graph for feasibility
65.01/34.66	Strengthening transition (result): 
65.01/34.66	<l2, l2, 1 + main_i <= main_j /\ 0 <= 1 + main_i, {main_i -> 1 + main_i, main_j -> 1 + main_j, rest remain the same}>
65.01/34.66	[ Termination Graph ]
65.01/34.66	Strengthening and disabling transitions...
65.01/34.66	
65.01/34.66	LOG: CALL solverLinear in Graph for feasibility
65.01/34.66	
65.01/34.66	LOG: RETURN solveLinear in Graph for feasibility
65.01/34.66	Strengthening transition (result): 
65.01/34.66	<l2, l2, 1 + main_i <= main_j /\ 0 <= 1 + main_i, {main_i -> 1 + main_i, main_j -> 1 + main_j, rest remain the same}>
65.01/34.66	Quasi-ranking function: 50000 - 2*main_i + main_j
65.01/34.66	New Graphs: 
65.01/34.66	Transitions:
65.01/34.66	<l2, l2, 1 + main_i <= main_j /\ 0 <= 1 + main_i /\ 50001 + main_j <= 2*main_i, {main_i -> 1 + main_i, main_j -> 1 + main_j, rest remain the same}>
65.01/34.66	Variables:
65.01/34.66	main_i, main_j
65.01/34.66	Checking conditional termination of SCC {l2}...
65.01/34.66	
65.01/34.66	LOG: CALL solveLinear
65.01/34.66	
65.01/34.66	LOG: RETURN solveLinear - Elapsed time: 0.000650s
65.01/34.66	
65.01/34.66	LOG: CALL solveLinear
65.01/34.66	
65.01/34.66	LOG: RETURN solveLinear - Elapsed time: 0.002893s
65.01/34.66	[36360 : 36371]
65.01/34.66	[36360 : 36372]
65.01/34.66	Solving with 1 template(s).
65.01/34.66	
65.01/34.66	LOG: CALL solveNonLinearGetFirstSolution
65.01/34.66	
65.01/34.66	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009625s
65.01/34.66	Time used: 0.009036
65.01/34.66	Improving Solution with cost 1 ...
65.01/34.66	
65.01/34.66	LOG: CALL solveNonLinearGetNextSolution
65.01/34.66	
65.01/34.66	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.032054s
65.01/34.66	Time used: 1.03156
65.01/34.66	
65.01/34.66	LOG: SAT solveNonLinear - Elapsed time: 1.041679s
65.01/34.66	Cost: 1; Total time: 1.04059
65.01/34.66	Quasi-ranking function: 50000 - main_j
65.01/34.66	New Graphs: 
65.01/34.66	Transitions:
65.01/34.66	<l2, l2, 1 + main_i <= main_j /\ 0 <= 1 + main_i /\ 50001 + main_j <= 2*main_i /\ 50001 <= main_j, {main_i -> 1 + main_i, main_j -> 1 + main_j, rest remain the same}>
65.01/34.66	Variables:
65.01/34.66	main_i, main_j
65.01/34.66	Checking conditional termination of SCC {l2}...
65.01/34.66	
65.01/34.66	LOG: CALL solveLinear
65.01/34.66	
65.01/34.66	LOG: RETURN solveLinear - Elapsed time: 0.000728s
65.01/34.66	
65.01/34.66	LOG: CALL solveLinear
65.01/34.66	
65.01/34.66	LOG: RETURN solveLinear - Elapsed time: 0.003064s
65.01/34.66	[36360 : 36452]
65.01/34.66	[36360 : 36453]
65.01/34.66	Solving with 1 template(s).
65.01/34.66	
65.01/34.66	LOG: CALL solveNonLinearGetFirstSolution
65.01/34.66	
65.01/34.66	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009821s
65.01/34.66	Time used: 0.009069
65.01/34.66	Improving Solution with cost 1 ...
65.01/34.66	
65.01/34.66	LOG: CALL solveNonLinearGetNextSolution
65.01/34.66	
65.01/34.66	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000600s
65.01/34.66	Time used: 1.00059
65.01/34.66	
65.01/34.66	LOG: SAT solveNonLinear - Elapsed time: 1.010420s
65.01/34.66	Cost: 1; Total time: 1.00966
65.01/34.66	Termination implied by a set of invariant(s):
65.01/34.66	Invariant at l2: 0 <= main_i
65.01/34.66	[ Invariant Graph ]
65.01/34.66	Strengthening and disabling transitions...
65.01/34.66	
65.01/34.66	LOG: CALL solverLinear in Graph for feasibility
65.01/34.66	
65.01/34.66	LOG: RETURN solveLinear in Graph for feasibility
65.01/34.66	Strengthening transition (result): 
65.01/34.66	<l2, l2, 0 <= main_i /\ 1 + main_i <= main_j, {main_i -> 1 + main_i, main_j -> 1 + main_j, rest remain the same}>
65.01/34.66	[ Termination Graph ]
65.01/34.66	Strengthening and disabling transitions...
65.01/34.66	
65.01/34.66	LOG: CALL solverLinear in Graph for feasibility
65.01/34.66	
65.01/34.66	LOG: RETURN solveLinear in Graph for feasibility
65.01/34.66	Strengthening transition (result): 
65.01/34.66	<l2, l2, 0 <= main_i /\ 1 + main_i <= main_j /\ 50001 + main_j <= 2*main_i /\ 50001 <= main_j, {main_i -> 1 + main_i, main_j -> 1 + main_j, rest remain the same}>
65.01/34.66	Quasi-ranking function: 50000 - main_i
65.01/34.66	New Graphs: 
65.01/34.66	Transitions:
65.01/34.66	<l2, l2, 1 + main_i <= main_j /\ 50001 <= main_i /\ 50001 + main_j <= 2*main_i /\ 50001 <= main_j, {main_i -> 1 + main_i, main_j -> 1 + main_j, rest remain the same}>
65.01/34.66	Variables:
65.01/34.66	main_i, main_j
65.01/34.66	Checking conditional termination of SCC {l2}...
65.01/34.66	
65.01/34.66	LOG: CALL solveLinear
65.01/34.66	
65.01/34.66	LOG: RETURN solveLinear - Elapsed time: 0.000731s
65.01/34.66	
65.01/34.66	LOG: CALL solveLinear
65.01/34.66	
65.01/34.66	LOG: RETURN solveLinear - Elapsed time: 0.002803s
65.01/34.66	[36360 : 36615]
65.01/34.66	[36360 : 36616]
65.01/34.66	Solving with 1 template(s).
65.01/34.66	
65.01/34.66	LOG: CALL solveNonLinearGetFirstSolution
65.01/34.66	
65.01/34.66	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.011312s
65.01/34.66	Time used: 0.010453
65.01/34.66	Improving Solution with cost 1 ...
65.01/34.66	
65.01/34.66	LOG: CALL solveNonLinearGetNextSolution
65.01/34.66	
65.01/34.66	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.012418s
65.01/34.66	Time used: 1.01233
65.01/34.66	
65.01/34.66	LOG: SAT solveNonLinear - Elapsed time: 1.023730s
65.01/34.66	Cost: 1; Total time: 1.02278
65.01/34.66	Quasi-ranking function: 50000 + main_i - 2*main_j
65.01/34.66	New Graphs: 
65.01/34.66	Transitions:
65.01/34.66	<l2, l2, 1 + main_i <= main_j /\ 50001 + main_i <= 2*main_j /\ 50001 <= main_i /\ 50001 + main_j <= 2*main_i /\ 50001 <= main_j, {main_i -> 1 + main_i, main_j -> 1 + main_j, rest remain the same}>
65.01/34.66	Variables:
65.01/34.66	main_i, main_j
65.01/34.66	Checking conditional termination of SCC {l2}...
65.01/34.66	
65.01/34.66	LOG: CALL solveLinear
65.01/34.66	
65.01/34.66	LOG: RETURN solveLinear - Elapsed time: 0.000815s
65.01/34.66	
65.01/34.66	LOG: CALL solveLinear
65.01/34.66	
65.01/34.66	LOG: RETURN solveLinear - Elapsed time: 0.003502s
65.01/34.66	[36360 : 36626]
65.01/34.66	[36360 : 36627]
65.01/34.66	Solving with 1 template(s).
65.01/34.66	
65.01/34.66	LOG: CALL solveNonLinearGetFirstSolution
65.01/34.66	
65.01/34.66	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.011618s
65.01/34.66	Time used: 0.010617
65.01/34.66	Improving Solution with cost 1 ...
65.01/34.66	
65.01/34.66	LOG: CALL solveNonLinearGetNextSolution
65.01/34.66	
65.01/34.66	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000950s
65.01/34.66	Time used: 1.00072
65.01/34.66	
65.01/34.66	LOG: SAT solveNonLinear - Elapsed time: 1.012568s
65.01/34.66	Cost: 1; Total time: 1.01134
65.01/34.66	Termination implied by a set of invariant(s):
65.01/34.66	Invariant at l2: 0 <= main_i
65.01/34.66	[ Invariant Graph ]
65.01/34.66	Strengthening and disabling transitions...
65.01/34.66	
65.01/34.66	LOG: CALL solverLinear in Graph for feasibility
65.01/34.66	
65.01/34.66	LOG: RETURN solveLinear in Graph for feasibility
65.01/34.66	Strengthening transition (result): 
65.01/34.66	<l2, l2, 0 <= main_i /\ 1 + main_i <= main_j, {main_i -> 1 + main_i, main_j -> 1 + main_j, rest remain the same}>
65.01/34.66	[ Termination Graph ]
65.01/34.66	Strengthening and disabling transitions...
65.01/34.66	
65.01/34.66	LOG: CALL solverLinear in Graph for feasibility
65.01/34.66	
65.01/34.66	LOG: RETURN solveLinear in Graph for feasibility
65.01/34.66	Strengthening transition (result): 
65.01/34.66	<l2, l2, 1 + main_i <= main_j /\ 50001 + main_i <= 2*main_j /\ 50001 <= main_i /\ 50001 + main_j <= 2*main_i /\ 50001 <= main_j, {main_i -> 1 + main_i, main_j -> 1 + main_j, rest remain the same}>
65.01/34.66	Quasi-ranking function: 50000 - main_i - main_j
65.01/34.66	New Graphs: 
65.01/34.66	Transitions:
65.01/34.66	<l2, l2, 1 + main_i <= main_j /\ 50001 + main_i <= 2*main_j /\ 50001 <= main_i /\ 50001 <= main_i + main_j /\ 50001 + main_j <= 2*main_i /\ 50001 <= main_j, {main_i -> 1 + main_i, main_j -> 1 + main_j, rest remain the same}>
65.01/34.66	Variables:
65.01/34.66	main_i, main_j
65.01/34.66	Checking conditional termination of SCC {l2}...
65.01/34.66	
65.01/34.66	LOG: CALL solveLinear
65.01/34.66	
65.01/34.66	LOG: RETURN solveLinear - Elapsed time: 0.000918s
65.01/34.66	
65.01/34.66	LOG: CALL solveLinear
65.01/34.66	
65.01/34.66	LOG: RETURN solveLinear - Elapsed time: 0.004399s
65.01/34.66	[36360 : 36635]
65.01/34.66	[36360 : 36636]
65.01/34.66	Solving with 1 template(s).
65.01/34.66	
65.01/34.66	LOG: CALL solveNonLinearGetFirstSolution
65.01/34.66	
65.01/34.66	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.101971s
65.01/34.66	Time used: 4.1008
65.01/34.66	Termination failed. Trying to show unreachability...
65.01/34.66	Proving unreachability of entry: <l0, l2, main_i = 0 /\ main_j = 100, {all remain the same}>
65.01/34.66	
65.01/34.66	LOG: CALL check - Post:1 <= 0 - Process 1
65.01/34.66	* Exit transition: <l0, l2, main_i = 0 /\ main_j = 100, {all remain the same}>
65.01/34.66	* Postcondition  : 1 <= 0
65.01/34.66	
65.01/34.66	LOG: CALL solveLinear
65.01/34.66	
65.01/34.66	LOG: RETURN solveLinear - Elapsed time: 0.010152s
65.01/34.66	> Postcondition is not implied!
65.01/34.66	
65.01/34.66	LOG: RETURN check - Elapsed time: 0.010278s
65.01/34.66	Cannot prove unreachability
65.01/34.66	
65.01/34.66	[36360 : 36647]
65.01/34.66	[36360 : 36651]
65.01/34.66	Successful child: 36647
65.01/34.66	
65.01/34.66	Program does NOT terminate
65.01/34.66	EOF