49.67/28.16	NO
49.67/28.16	
49.67/28.16	Solver Timeout: 4
49.67/28.16	Global Timeout: 300
49.67/28.16	Maximum number of concurrent processes: 900
49.67/28.16	*******************************************************************************************
49.67/28.16	*********************** UNPROCESSED TRANSITION SYSTEMS PER FUNCTION ***********************
49.67/28.16	*******************************************************************************************
49.67/28.16	
49.67/28.16	
49.67/28.16	List of LLVMGraphs + assumeNodes + staticAssertNodes [1] :
49.67/28.16	
49.67/28.16	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
49.67/28.16	+                                                                  +
49.67/28.16	Init Location: 0
49.67/28.16	Transitions:
49.67/28.16	<l0, l1, true, seq{main__func_return_ -> 0, main_x -> 1, main_y -> 1}>
49.67/28.16	<l1, l2, true>
49.67/28.16	<l2, l5, not((main_x >= 0))>
49.67/28.16	<l2, l3, (main_x >= 0)>
49.67/28.16	<l3, l4, true, seq{main_x -> (2 * main_x), main_y -> (3 * main_y)}>
49.67/28.16	<l4, l2, true>
49.67/28.16	<l5, l6, true, seq{main__func_return_ -> 0}>
49.67/28.16	
49.67/28.16	Fresh variables:
49.67/28.16	
49.67/28.16	Undef variables:
49.67/28.16	
49.67/28.16	Abstraction variables:
49.67/28.16	
49.67/28.16	Exit nodes:
49.67/28.16	
49.67/28.16	Accepting locations:
49.67/28.16	
49.67/28.16	Asserts:
49.67/28.16	
49.67/28.16	+ Assume Nodes [0]: ++++++++++++++++++++++++++++++++++++++++++++++++
49.67/28.16	       
49.67/28.16	+ Static Assert Nodes [0]: +++++++++++++++++++++++++++++++++++++++++
49.67/28.16	       
49.67/28.16	+ After preprocess (paralelization): ++++++++++++++++++++++++++++++
49.67/28.16	
49.67/28.16	Init Location: 0
49.67/28.16	Transitions:
49.67/28.16	<l0, l1, true, seq{main__func_return_ -> 0, main_x -> 1, main_y -> 1}>
49.67/28.16	<l1, l2, true>
49.67/28.16	<l2, l3, (main_x >= 0)>
49.67/28.16	<l2, l5, not((main_x >= 0))>
49.67/28.16	<l3, l4, true, seq{main_x -> (2 * main_x), main_y -> (3 * main_y)}>
49.67/28.16	<l4, l2, true>
49.67/28.16	<l5, l6, true, seq{main__func_return_ -> 0}>
49.67/28.16	
49.67/28.16	Fresh variables:
49.67/28.16	
49.67/28.16	Undef variables:
49.67/28.16	
49.67/28.16	Abstraction variables:
49.67/28.16	
49.67/28.16	Exit nodes:
49.67/28.16	6, 
49.67/28.16	Accepting locations:
49.67/28.16	
49.67/28.16	Asserts:
49.67/28.16	
49.67/28.16	+                                                                  +
49.67/28.16	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
49.67/28.16	
49.67/28.16	
49.67/28.16	Function Return and Parameters Information [1 functions]:
49.67/28.16	    function name: main [1 return + 0 parameters]        demangled: main
49.67/28.16	        main__func_return_      [function result] : int
49.67/28.16	
49.67/28.16	
49.67/28.16	AST Ident Scanner Information [4 idents]:
49.67/28.16	__VERIFIER_nondet_int | function | [integer, ()] | <line: 11, col: 1>
49.67/28.16	main | function | [integer, ()] | <line: 13, col: 1>
49.67/28.16	x | local variable | integer | <line: 15, col: 5> | <line: 16, col: 2> <line: 18, col: 9> <line: 19, col: 3> <line: 19, col: 9>
49.67/28.16	y | local variable | integer | <line: 15, col: 5> | <line: 17, col: 2> <line: 20, col: 3> <line: 20, col: 9>
49.67/28.16	
49.67/28.16	Main function: main
49.67/28.16	Preprocessed LLVMGraph
49.67/28.16	Init Location: 0
49.67/28.16	Transitions:
49.67/28.16	<l0, l2, (main_x = 1) /\ (main_y = 1)>
49.67/28.16	<l2, l2, (main_x >= 0), par{main_x -> (2 * main_x), main_y -> (3 * main_y)}>
49.67/28.16	<l2, l6, not((main_x >= 0))>
49.67/28.16	
49.67/28.16	Fresh variables:
49.67/28.16	
49.67/28.16	Undef variables:
49.67/28.16	
49.67/28.16	Abstraction variables:
49.67/28.16	
49.67/28.16	Exit nodes:
49.67/28.16	6, 
49.67/28.16	Accepting locations:
49.67/28.16	
49.67/28.16	Asserts:
49.67/28.16	
49.67/28.16	*************************************************************
49.67/28.16	*******************************************************************************************
49.67/28.16	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
49.67/28.16	*******************************************************************************************
49.67/28.16	
49.67/28.16	Init Location: 0
49.67/28.16	Graph 0:
49.67/28.16	Transitions:
49.67/28.16	Variables:
49.67/28.16	
49.67/28.16	Graph 1:
49.67/28.16	Transitions:
49.67/28.16	<l2, l2, 0 <= main_x, {main_x -> 2*main_x, main_y -> 3*main_y, rest remain the same}>
49.67/28.16	Variables:
49.67/28.16	main_x, main_y
49.67/28.16	
49.67/28.16	Graph 2:
49.67/28.16	Transitions:
49.67/28.16	Variables:
49.67/28.16	
49.67/28.16	Precedence: 
49.67/28.16	Graph 0
49.67/28.16	
49.67/28.16	Graph 1
49.67/28.16	<l0, l2, main_x = 1 /\ main_y = 1, {all remain the same}>
49.67/28.16	
49.67/28.16	Graph 2
49.67/28.16	<l2, l6, 1 + main_x <= 0, {all remain the same}>
49.67/28.16	
49.67/28.16	Map Locations to Subgraph:
49.67/28.16	( 0 , 0 )
49.67/28.16	( 2 , 1 )
49.67/28.16	( 6 , 2 )
49.67/28.16	
49.67/28.16	*******************************************************************************************
49.67/28.16	********************************    CHECKING ASSERTIONS    ********************************
49.67/28.16	*******************************************************************************************
49.67/28.16	
49.67/28.16	Proving termination of subgraph 0
49.67/28.16	Proving termination of subgraph 1
49.67/28.16	Checking unfeasibility...
49.67/28.16	Time used: 0.002244
49.67/28.16	
49.67/28.16	Checking conditional termination of SCC {l2}...
49.67/28.16	
49.67/28.16	LOG: CALL solveLinear
49.67/28.16	
49.67/28.16	LOG: RETURN solveLinear - Elapsed time: 0.000507s
49.67/28.16	
49.67/28.16	LOG: CALL solveLinear
49.67/28.16	
49.67/28.16	LOG: RETURN solveLinear - Elapsed time: 0.001216s
49.67/28.16	[22891 : 22893]
49.67/28.16	[22891 : 22894]
49.67/28.16	Solving with 1 template(s).
49.67/28.16	
49.67/28.16	LOG: CALL solveNonLinearGetFirstSolution
49.67/28.16	
49.67/28.16	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008611s
49.67/28.16	Time used: 0.008299
49.67/28.16	Improving Solution with cost 1 ...
49.67/28.16	
49.67/28.16	LOG: CALL solveNonLinearGetNextSolution
49.67/28.16	
49.67/28.16	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.034708s
49.67/28.16	Time used: 0.034699
49.67/28.16	
49.67/28.16	LOG: SAT solveNonLinear - Elapsed time: 0.043319s
49.67/28.16	Cost: 1; Total time: 0.042998
49.67/28.16	Termination implied by a set of invariant(s):
49.67/28.16	Invariant at l2: 1 <= main_x
49.67/28.16	[ Invariant Graph ]
49.67/28.16	Strengthening and disabling transitions...
49.67/28.16	
49.67/28.16	LOG: CALL solverLinear in Graph for feasibility
49.67/28.16	
49.67/28.16	LOG: RETURN solveLinear in Graph for feasibility
49.67/28.16	Strengthening transition (result): 
49.67/28.16	<l2, l2, 1 <= main_x, {main_x -> 2*main_x, main_y -> 3*main_y, rest remain the same}>
49.67/28.16	[ Termination Graph ]
49.67/28.16	Strengthening and disabling transitions...
49.67/28.16	
49.67/28.16	LOG: CALL solverLinear in Graph for feasibility
49.67/28.16	
49.67/28.16	LOG: RETURN solveLinear in Graph for feasibility
49.67/28.16	Strengthening transition (result): 
49.67/28.16	<l2, l2, 1 <= main_x, {main_x -> 2*main_x, main_y -> 3*main_y, rest remain the same}>
49.67/28.16	Quasi-ranking function: 50000 - main_x
49.67/28.16	New Graphs: 
49.67/28.16	Transitions:
49.67/28.16	<l2, l2, 50001 <= main_x, {main_x -> 2*main_x, main_y -> 3*main_y, rest remain the same}>
49.67/28.16	Variables:
49.67/28.16	main_x, main_y
49.67/28.16	Checking conditional termination of SCC {l2}...
49.67/28.16	
49.67/28.16	LOG: CALL solveLinear
49.67/28.16	
49.67/28.16	LOG: RETURN solveLinear - Elapsed time: 0.000490s
49.67/28.16	
49.67/28.16	LOG: CALL solveLinear
49.67/28.16	
49.67/28.16	LOG: RETURN solveLinear - Elapsed time: 0.001499s
49.67/28.16	[22891 : 23093]
49.67/28.16	[22891 : 23094]
49.67/28.16	Solving with 1 template(s).
49.67/28.16	
49.67/28.16	LOG: CALL solveNonLinearGetFirstSolution
49.67/28.16	
49.67/28.16	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.011499s
49.67/28.16	Time used: 0.011078
49.67/28.16	Improving Solution with cost 1 ...
49.67/28.16	
49.67/28.16	LOG: CALL solveNonLinearGetNextSolution
49.67/28.16	
49.67/28.16	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000742s
49.67/28.16	Time used: 1.00063
49.67/28.16	
49.67/28.16	LOG: SAT solveNonLinear - Elapsed time: 1.012241s
49.67/28.16	Cost: 1; Total time: 1.01171
49.67/28.16	Termination implied by a set of invariant(s):
49.67/28.16	Invariant at l2: main_x <= main_y
49.67/28.16	[ Invariant Graph ]
49.67/28.16	Strengthening and disabling transitions...
49.67/28.16	
49.67/28.16	LOG: CALL solverLinear in Graph for feasibility
49.67/28.16	
49.67/28.16	LOG: RETURN solveLinear in Graph for feasibility
49.67/28.16	Strengthening transition (result): 
49.67/28.16	<l2, l2, main_x <= main_y /\ 1 <= main_x, {main_x -> 2*main_x, main_y -> 3*main_y, rest remain the same}>
49.67/28.16	[ Termination Graph ]
49.67/28.16	Strengthening and disabling transitions...
49.67/28.16	
49.67/28.16	LOG: CALL solverLinear in Graph for feasibility
49.67/28.16	
49.67/28.16	LOG: RETURN solveLinear in Graph for feasibility
49.67/28.16	Strengthening transition (result): 
49.67/28.16	<l2, l2, main_x <= main_y /\ 50001 <= main_x, {main_x -> 2*main_x, main_y -> 3*main_y, rest remain the same}>
49.67/28.16	Quasi-ranking function: 50000 - main_y
49.67/28.16	New Graphs: 
49.67/28.16	Transitions:
49.67/28.16	<l2, l2, main_x <= main_y /\ 50001 <= main_x /\ 50001 <= main_y, {main_x -> 2*main_x, main_y -> 3*main_y, rest remain the same}>
49.67/28.16	Variables:
49.67/28.16	main_x, main_y
49.67/28.16	Checking conditional termination of SCC {l2}...
49.67/28.16	
49.67/28.16	LOG: CALL solveLinear
49.67/28.16	
49.67/28.16	LOG: RETURN solveLinear - Elapsed time: 0.000641s
49.67/28.16	
49.67/28.16	LOG: CALL solveLinear
49.67/28.16	
49.67/28.16	LOG: RETURN solveLinear - Elapsed time: 0.002304s
49.67/28.16	[22891 : 23099]
49.67/28.16	[22891 : 23100]
49.67/28.16	Solving with 1 template(s).
49.67/28.16	
49.67/28.16	LOG: CALL solveNonLinearGetFirstSolution
49.67/28.16	
49.67/28.16	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.014969s
49.67/28.16	Time used: 0.014334
49.67/28.16	Improving Solution with cost 1 ...
49.67/28.16	
49.67/28.16	LOG: CALL solveNonLinearGetNextSolution
49.67/28.16	
49.67/28.16	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000927s
49.67/28.16	Time used: 1.00067
49.67/28.16	
49.67/28.16	LOG: SAT solveNonLinear - Elapsed time: 1.015896s
49.67/28.16	Cost: 1; Total time: 1.01501
49.67/28.16	Termination implied by a set of invariant(s):
49.67/28.16	Invariant at l2: main_x <= 1 + main_y
49.67/28.16	[ Invariant Graph ]
49.67/28.16	Strengthening and disabling transitions...
49.67/28.16	
49.67/28.16	LOG: CALL solverLinear in Graph for feasibility
49.67/28.16	
49.67/28.16	LOG: RETURN solveLinear in Graph for feasibility
49.67/28.16	Strengthening transition (result): 
49.67/28.16	<l2, l2, main_x <= main_y /\ 1 <= main_x, {main_x -> 2*main_x, main_y -> 3*main_y, rest remain the same}>
49.67/28.16	[ Termination Graph ]
49.67/28.16	Strengthening and disabling transitions...
49.67/28.16	
49.67/28.16	LOG: CALL solverLinear in Graph for feasibility
49.67/28.16	
49.67/28.16	LOG: RETURN solveLinear in Graph for feasibility
49.67/28.16	Strengthening transition (result): 
49.67/28.16	<l2, l2, main_x <= main_y /\ 50001 <= main_x /\ 50001 <= main_y, {main_x -> 2*main_x, main_y -> 3*main_y, rest remain the same}>
49.67/28.16	Quasi-ranking function: 50000 + main_x - main_y
49.67/28.16	New Graphs: 
49.67/28.16	Transitions:
49.67/28.16	<l2, l2, 50001 + main_x <= main_y /\ 50001 <= main_x /\ 50001 <= main_y, {main_x -> 2*main_x, main_y -> 3*main_y, rest remain the same}>
49.67/28.16	Variables:
49.67/28.16	main_x, main_y
49.67/28.16	Checking conditional termination of SCC {l2}...
49.67/28.16	
49.67/28.16	LOG: CALL solveLinear
49.67/28.16	
49.67/28.16	LOG: RETURN solveLinear - Elapsed time: 0.000635s
49.67/28.16	
49.67/28.16	LOG: CALL solveLinear
49.67/28.16	
49.67/28.16	LOG: RETURN solveLinear - Elapsed time: 0.003364s
49.67/28.16	[22891 : 23104]
49.67/28.16	[22891 : 23105]
49.67/28.16	Solving with 1 template(s).
49.67/28.16	
49.67/28.16	LOG: CALL solveNonLinearGetFirstSolution
49.67/28.16	
49.67/28.16	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.016341s
49.67/28.16	Time used: 0.015556
49.67/28.16	Improving Solution with cost 1 ...
49.67/28.16	
49.67/28.16	LOG: CALL solveNonLinearGetNextSolution
49.67/28.16	
49.67/28.16	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.005084s
49.67/28.16	Time used: 1.00497
49.67/28.16	
49.67/28.16	LOG: SAT solveNonLinear - Elapsed time: 1.021424s
49.67/28.16	Cost: 1; Total time: 1.02052
49.67/28.16	Termination implied by a set of invariant(s):
49.67/28.16	Invariant at l2: main_x <= 1 + main_y
49.67/28.16	[ Invariant Graph ]
49.67/28.16	Strengthening and disabling transitions...
49.67/28.16	
49.67/28.16	LOG: CALL solverLinear in Graph for feasibility
49.67/28.16	
49.67/28.16	LOG: RETURN solveLinear in Graph for feasibility
49.67/28.16	Strengthening transition (result): 
49.67/28.16	<l2, l2, main_x <= main_y /\ 1 <= main_x, {main_x -> 2*main_x, main_y -> 3*main_y, rest remain the same}>
49.67/28.16	[ Termination Graph ]
49.67/28.16	Strengthening and disabling transitions...
49.67/28.16	
49.67/28.16	LOG: CALL solverLinear in Graph for feasibility
49.67/28.16	
49.67/28.16	LOG: RETURN solveLinear in Graph for feasibility
49.67/28.16	Strengthening transition (result): 
49.67/28.16	<l2, l2, 50001 + main_x <= main_y /\ 50001 <= main_x /\ 50001 <= main_y, {main_x -> 2*main_x, main_y -> 3*main_y, rest remain the same}>
49.67/28.16	Quasi-ranking function: 50000 - main_x - main_y
49.67/28.16	New Graphs: 
49.67/28.16	Transitions:
49.67/28.16	<l2, l2, 50001 + main_x <= main_y /\ 50001 <= main_x /\ 50001 <= main_x + main_y /\ 50001 <= main_y, {main_x -> 2*main_x, main_y -> 3*main_y, rest remain the same}>
49.67/28.16	Variables:
49.67/28.16	main_x, main_y
49.67/28.16	Checking conditional termination of SCC {l2}...
49.67/28.16	
49.67/28.16	LOG: CALL solveLinear
49.67/28.16	
49.67/28.16	LOG: RETURN solveLinear - Elapsed time: 0.000728s
49.67/28.16	
49.67/28.16	LOG: CALL solveLinear
49.67/28.16	
49.67/28.16	LOG: RETURN solveLinear - Elapsed time: 0.003088s
49.67/28.16	[22891 : 23111]
49.67/28.16	[22891 : 23112]
49.67/28.16	Solving with 1 template(s).
49.67/28.16	
49.67/28.16	LOG: CALL solveNonLinearGetFirstSolution
49.67/28.16	
49.67/28.16	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.104204s
49.67/28.16	Time used: 4.10249
49.67/28.16	Termination failed. Trying to show unreachability...
49.67/28.16	Proving unreachability of entry: <l0, l2, main_x = 1 /\ main_y = 1, {all remain the same}>
49.67/28.16	
49.67/28.16	LOG: CALL check - Post:1 <= 0 - Process 1
49.67/28.16	* Exit transition: <l0, l2, main_x = 1 /\ main_y = 1, {all remain the same}>
49.67/28.16	* Postcondition  : 1 <= 0
49.67/28.16	
49.67/28.16	LOG: CALL solveLinear
49.67/28.16	
49.67/28.16	LOG: RETURN solveLinear - Elapsed time: 0.044520s
49.67/28.16	> Postcondition is not implied!
49.67/28.16	
49.67/28.16	LOG: RETURN check - Elapsed time: 0.044638s
49.67/28.16	Cannot prove unreachability
49.67/28.16	
49.67/28.16	[22891 : 23116]
49.67/28.16	[22891 : 23120]
49.67/28.16	Successful child: 23116
49.67/28.16	
49.67/28.16	Program does NOT terminate
49.67/28.16	EOF