1.62/1.10	NO
1.62/1.10	
1.74/1.10	Solver Timeout: 4
1.74/1.10	Global Timeout: 300
1.74/1.10	Maximum number of concurrent processes: 900
1.74/1.10	*******************************************************************************************
1.74/1.10	*********************** UNPROCESSED TRANSITION SYSTEMS PER FUNCTION ***********************
1.74/1.10	*******************************************************************************************
1.74/1.10	
1.74/1.10	
1.74/1.10	List of LLVMGraphs + assumeNodes + staticAssertNodes [1] :
1.74/1.10	
1.74/1.10	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
1.74/1.10	+                                                                  +
1.74/1.10	Init Location: 0
1.74/1.10	Transitions:
1.74/1.10	<l0, l1, true, seq{main__func_return_ -> 0, main_a -> 1, main_b -> 2}>
1.74/1.10	<l1, l2, true>
1.74/1.10	<l2, l5, not(((main_a + main_b) < 5))>
1.74/1.10	<l2, l3, ((main_a + main_b) < 5)>
1.74/1.10	<l3, l4, true, seq{main_a -> (main_a - main_b), main_b -> (main_a + main_b), main_a -> (main_b - main_a)}>
1.74/1.10	<l4, l2, true>
1.74/1.10	<l5, l6, true, seq{main__func_return_ -> 0}>
1.74/1.10	
1.74/1.10	Fresh variables:
1.74/1.10	
1.74/1.10	Undef variables:
1.74/1.10	
1.74/1.10	Abstraction variables:
1.74/1.10	
1.74/1.10	Exit nodes:
1.74/1.10	
1.74/1.10	Accepting locations:
1.74/1.10	
1.74/1.10	Asserts:
1.74/1.10	
1.74/1.10	+ Assume Nodes [0]: ++++++++++++++++++++++++++++++++++++++++++++++++
1.74/1.10	       
1.74/1.10	+ Static Assert Nodes [0]: +++++++++++++++++++++++++++++++++++++++++
1.74/1.10	       
1.74/1.10	+ After preprocess (paralelization): ++++++++++++++++++++++++++++++
1.74/1.10	
1.74/1.10	Init Location: 0
1.74/1.10	Transitions:
1.74/1.10	<l0, l1, true, seq{main__func_return_ -> 0, main_a -> 1, main_b -> 2}>
1.74/1.10	<l1, l2, true>
1.74/1.10	<l2, l3, ((main_a + main_b) < 5)>
1.74/1.10	<l2, l5, not(((main_a + main_b) < 5))>
1.74/1.10	<l3, l4, true, seq{main_a -> (main_a - main_b), main_b -> (main_a + main_b), main_a -> (main_b - main_a)}>
1.74/1.10	<l4, l2, true>
1.74/1.10	<l5, l6, true, seq{main__func_return_ -> 0}>
1.74/1.10	
1.74/1.10	Fresh variables:
1.74/1.10	
1.74/1.10	Undef variables:
1.74/1.10	
1.74/1.10	Abstraction variables:
1.74/1.10	
1.74/1.10	Exit nodes:
1.74/1.10	6, 
1.74/1.10	Accepting locations:
1.74/1.10	
1.74/1.10	Asserts:
1.74/1.10	
1.74/1.10	+                                                                  +
1.74/1.10	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
1.74/1.10	
1.74/1.10	
1.74/1.10	Function Return and Parameters Information [1 functions]:
1.74/1.10	    function name: main [1 return + 0 parameters]        demangled: main
1.74/1.10	        main__func_return_      [function result] : int
1.74/1.10	
1.74/1.10	
1.74/1.10	AST Ident Scanner Information [4 idents]:
1.74/1.10	__VERIFIER_nondet_int | function | [integer, ()] | <line: 3, col: 1>
1.74/1.10	main | function | [integer, ()] | <line: 5, col: 1>
1.74/1.10	a | local variable | integer | <line: 6, col: 5> | <line: 8, col: 5> <line: 11, col: 12> <line: 12, col: 9> <line: 12, col: 13> <line: 13, col: 13> <line: 14, col: 9> <line: 14, col: 17>
1.74/1.10	b | local variable | integer | <line: 7, col: 5> | <line: 9, col: 5> <line: 11, col: 16> <line: 12, col: 17> <line: 13, col: 9> <line: 13, col: 17> <line: 14, col: 13>
1.74/1.10	
1.74/1.10	Main function: main
1.74/1.10	Preprocessed LLVMGraph
1.74/1.10	Init Location: 0
1.74/1.10	Transitions:
1.74/1.10	<l0, l2, (main_a = 1) /\ (main_b = 2)>
1.74/1.10	<l2, l2, ((main_a + main_b) < 5), par{main_a -> (((main_a - main_b) + main_b) - (main_a - main_b)), main_b -> ((main_a - main_b) + main_b)}>
1.74/1.10	<l2, l6, not(((main_a + main_b) < 5))>
1.74/1.10	
1.74/1.10	Fresh variables:
1.74/1.10	
1.74/1.10	Undef variables:
1.74/1.10	
1.74/1.10	Abstraction variables:
1.74/1.10	
1.74/1.10	Exit nodes:
1.74/1.10	6, 
1.74/1.10	Accepting locations:
1.74/1.10	
1.74/1.10	Asserts:
1.74/1.10	
1.74/1.10	*************************************************************
1.74/1.10	*******************************************************************************************
1.74/1.10	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
1.74/1.10	*******************************************************************************************
1.74/1.10	
1.74/1.10	Init Location: 0
1.74/1.10	Graph 0:
1.74/1.10	Transitions:
1.74/1.10	Variables:
1.74/1.10	
1.74/1.10	Graph 1:
1.74/1.10	Transitions:
1.74/1.10	<l2, l2, main_a + main_b <= 4, {main_a -> main_b, main_b -> main_a, rest remain the same}>
1.74/1.10	Variables:
1.74/1.10	main_a, main_b
1.74/1.10	
1.74/1.10	Graph 2:
1.74/1.10	Transitions:
1.74/1.10	Variables:
1.74/1.10	
1.74/1.10	Precedence: 
1.74/1.10	Graph 0
1.74/1.10	
1.74/1.10	Graph 1
1.74/1.10	<l0, l2, main_a = 1 /\ main_b = 2, {all remain the same}>
1.74/1.10	
1.74/1.10	Graph 2
1.74/1.10	<l2, l6, 5 <= main_a + main_b, {all remain the same}>
1.74/1.10	
1.74/1.10	Map Locations to Subgraph:
1.74/1.10	( 0 , 0 )
1.74/1.10	( 2 , 1 )
1.74/1.10	( 6 , 2 )
1.74/1.10	
1.74/1.10	*******************************************************************************************
1.74/1.10	********************************    CHECKING ASSERTIONS    ********************************
1.74/1.10	*******************************************************************************************
1.74/1.10	
1.74/1.10	Proving termination of subgraph 0
1.74/1.10	Proving termination of subgraph 1
1.74/1.10	Checking unfeasibility...
1.74/1.10	Time used: 0.005543
1.74/1.10	
1.74/1.10	Checking conditional termination of SCC {l2}...
1.74/1.10	
1.74/1.10	LOG: CALL solveLinear
1.74/1.10	
1.74/1.10	LOG: RETURN solveLinear - Elapsed time: 0.000626s
1.74/1.10	
1.74/1.10	LOG: CALL solveLinear
1.74/1.10	
1.74/1.10	LOG: RETURN solveLinear - Elapsed time: 0.001609s
1.74/1.10	[45503 : 45504]
1.74/1.10	[45503 : 45505]
1.74/1.10	Solving with 1 template(s).
1.74/1.10	
1.74/1.10	LOG: CALL solveNonLinearGetFirstSolution
1.74/1.10	
1.74/1.10	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.019280s
1.74/1.10	Time used: 0.018984
1.74/1.10	Termination failed. Trying to show unreachability...
1.74/1.10	Proving unreachability of entry: <l0, l2, main_a = 1 /\ main_b = 2, {all remain the same}>
1.74/1.10	
1.74/1.10	LOG: CALL check - Post:1 <= 0 - Process 1
1.74/1.10	* Exit transition: <l0, l2, main_a = 1 /\ main_b = 2, {all remain the same}>
1.74/1.10	* Postcondition  : 1 <= 0
1.74/1.10	
1.74/1.10	LOG: CALL solveLinear
1.74/1.10	
1.74/1.10	LOG: RETURN solveLinear - Elapsed time: 0.000645s
1.74/1.10	> Postcondition is not implied!
1.74/1.10	
1.74/1.10	LOG: RETURN check - Elapsed time: 0.000726s
1.74/1.10	Cannot prove unreachability
1.74/1.10	
1.74/1.10	[45503 : 45510]
1.74/1.10	[45503 : 45514]
1.74/1.10	Successful child: 45514
1.74/1.10	
1.74/1.10	Program does NOT terminate
1.74/1.10	EOF