4.12/4.16	YES
4.12/4.16	
4.12/4.16	Solver Timeout: 4
4.12/4.16	Global Timeout: 300
4.12/4.16	Maximum number of concurrent processes: 900
4.12/4.16	*******************************************************************************************
4.12/4.16	*********************** UNPROCESSED TRANSITION SYSTEMS PER FUNCTION ***********************
4.12/4.16	*******************************************************************************************
4.12/4.16	
4.12/4.16	
4.12/4.16	List of LLVMGraphs + assumeNodes + staticAssertNodes [1] :
4.12/4.16	
4.12/4.16	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
4.12/4.16	+                                                                  +
4.12/4.16	Init Location: 0
4.12/4.16	Transitions:
4.12/4.16	<l0, l1, true, seq{main__func_return_ -> 0, main_MAX -> 1000, main_a -> 1, main_b -> 1, main_c -> 1}>
4.12/4.16	<l1, l2, true>
4.12/4.16	<l2, l12, (((main_a * main_a) * main_a) = (((main_b * main_b) * main_b) + ((main_c * main_c) * main_c)))>
4.12/4.16	<l2, l3, not((((main_a * main_a) * main_a) = (((main_b * main_b) * main_b) + ((main_c * main_c) * main_c))))>
4.12/4.16	<l3, l12, not((main_c <= main_MAX))>
4.12/4.16	<l3, l4, (main_c <= main_MAX)>
4.12/4.16	<l4, l5, true, seq{main_a -> (main_a + 1)}>
4.12/4.16	<l5, l6, (main_a > main_MAX)>
4.12/4.16	<l5, l8, not((main_a > main_MAX))>
4.12/4.16	<l6, l7, true, seq{main_a -> 1, main_b -> (main_b + 1)}>
4.12/4.16	<l7, l8, true>
4.12/4.16	<l8, l9, (main_b > main_MAX)>
4.12/4.16	<l8, l11, not((main_b > main_MAX))>
4.12/4.16	<l9, l10, true, seq{main_b -> 1, main_c -> (main_c + 1)}>
4.12/4.16	<l10, l11, true>
4.12/4.16	<l11, l2, true>
4.12/4.16	<l12, l13, true, seq{main__func_return_ -> 0}>
4.12/4.16	
4.12/4.16	Fresh variables:
4.12/4.16	
4.12/4.16	Undef variables:
4.12/4.16	
4.12/4.16	Abstraction variables:
4.12/4.16	
4.12/4.16	Exit nodes:
4.12/4.16	
4.12/4.16	Accepting locations:
4.12/4.16	
4.12/4.16	Asserts:
4.12/4.16	
4.12/4.16	+ Assume Nodes [0]: ++++++++++++++++++++++++++++++++++++++++++++++++
4.12/4.16	       
4.12/4.16	+ Static Assert Nodes [0]: +++++++++++++++++++++++++++++++++++++++++
4.12/4.16	       
4.12/4.16	+ After preprocess (paralelization): ++++++++++++++++++++++++++++++
4.12/4.16	
4.12/4.16	Init Location: 0
4.12/4.16	Transitions:
4.12/4.16	<l0, l1, true, seq{main__func_return_ -> 0, main_MAX -> 1000, main_a -> 1, main_b -> 1, main_c -> 1}>
4.12/4.16	<l1, l2, true>
4.12/4.16	<l2, l12, (((main_a * main_a) * main_a) = (((main_b * main_b) * main_b) + ((main_c * main_c) * main_c)))>
4.12/4.16	<l2, l3, not((((main_a * main_a) * main_a) = (((main_b * main_b) * main_b) + ((main_c * main_c) * main_c))))>
4.12/4.16	<l3, l4, (main_c <= main_MAX)>
4.12/4.16	<l3, l12, not((main_c <= main_MAX))>
4.12/4.16	<l4, l5, true, seq{main_a -> (main_a + 1)}>
4.12/4.16	<l5, l6, (main_a > main_MAX)>
4.12/4.16	<l5, l8, not((main_a > main_MAX))>
4.12/4.16	<l6, l7, true, seq{main_a -> 1, main_b -> (main_b + 1)}>
4.12/4.16	<l7, l8, true>
4.12/4.16	<l8, l9, (main_b > main_MAX)>
4.12/4.16	<l8, l11, not((main_b > main_MAX))>
4.12/4.16	<l9, l10, true, seq{main_b -> 1, main_c -> (main_c + 1)}>
4.12/4.16	<l10, l11, true>
4.12/4.16	<l11, l2, true>
4.12/4.16	<l12, l13, true, seq{main__func_return_ -> 0}>
4.12/4.16	
4.12/4.16	Fresh variables:
4.12/4.16	
4.12/4.16	Undef variables:
4.12/4.16	
4.12/4.16	Abstraction variables:
4.12/4.16	
4.12/4.16	Exit nodes:
4.12/4.16	13, 
4.12/4.16	Accepting locations:
4.12/4.16	
4.12/4.16	Asserts:
4.12/4.16	
4.12/4.16	+                                                                  +
4.12/4.16	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
4.12/4.16	
4.12/4.16	
4.12/4.16	Function Return and Parameters Information [1 functions]:
4.12/4.16	    function name: main [1 return + 0 parameters]        demangled: main
4.12/4.16	        main__func_return_      [function result] : int
4.12/4.16	
4.12/4.16	
4.12/4.16	AST Ident Scanner Information [6 idents]:
4.12/4.16	__VERIFIER_nondet_int | function | [integer, ()] | <line: 3, col: 1>
4.12/4.16	main | function | [integer, ()] | <line: 5, col: 1>
4.12/4.16	MAX | local variable | integer | <line: 6, col: 5> | <line: 8, col: 5> <line: 12, col: 51> <line: 14, col: 15> <line: 18, col: 15>
4.12/4.16	a | local variable | integer | <line: 7, col: 5> | <line: 9, col: 5> <line: 12, col: 14> <line: 12, col: 16> <line: 12, col: 18> <line: 13, col: 9> <line: 13, col: 13> <line: 14, col: 13> <line: 15, col: 13>
4.12/4.16	b | local variable | integer | <line: 7, col: 5> | <line: 10, col: 5> <line: 12, col: 26> <line: 12, col: 28> <line: 12, col: 30> <line: 16, col: 13> <line: 16, col: 17> <line: 18, col: 13> <line: 19, col: 13>
4.12/4.16	c | local variable | integer | <line: 7, col: 5> | <line: 11, col: 5> <line: 12, col: 34> <line: 12, col: 36> <line: 12, col: 38> <line: 12, col: 46> <line: 20, col: 13> <line: 20, col: 17>
4.12/4.16	
4.12/4.16	Main function: main
4.12/4.16	Preprocessed LLVMGraph
4.12/4.16	Init Location: 0
4.12/4.16	Transitions:
4.12/4.16	<l0, l2, (1000 = 1000) /\ (main_a = 1) /\ (main_b = 1) /\ (main_c = 1)>
4.12/4.16	<l2, l13, true>
4.12/4.16	<l2, l2, (main_c <= 1000) /\ ((main_a + 1) > 1000) /\ ((main_b + 1) > 1000), par{main_a -> 1, main_b -> 1, main_c -> (main_c + 1)}>
4.12/4.16	<l2, l2, (main_c <= 1000) /\ ((main_a + 1) > 1000) /\ not(((main_b + 1) > 1000)), par{main_a -> 1, main_b -> (main_b + 1)}>
4.12/4.16	<l2, l2, (main_c <= 1000) /\ not(((main_a + 1) > 1000)) /\ (main_b > 1000), par{main_a -> (main_a + 1), main_b -> 1, main_c -> (main_c + 1)}>
4.12/4.16	<l2, l2, (main_c <= 1000) /\ not(((main_a + 1) > 1000)) /\ not((main_b > 1000)), par{main_a -> (main_a + 1)}>
4.12/4.16	<l2, l13, not((main_c <= 1000))>
4.12/4.16	
4.12/4.16	Fresh variables:
4.12/4.16	
4.12/4.16	Undef variables:
4.12/4.16	
4.12/4.16	Abstraction variables:
4.12/4.16	
4.12/4.16	Exit nodes:
4.12/4.16	13, 
4.12/4.16	Accepting locations:
4.12/4.16	
4.12/4.16	Asserts:
4.12/4.16	
4.12/4.16	*************************************************************
4.12/4.16	*******************************************************************************************
4.12/4.16	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
4.12/4.16	*******************************************************************************************
4.12/4.16	
4.12/4.16	Init Location: 0
4.12/4.16	Graph 0:
4.12/4.16	Transitions:
4.12/4.16	Variables:
4.12/4.16	
4.12/4.16	Graph 1:
4.12/4.16	Transitions:
4.12/4.16	<l2, l2, 1000 <= main_a /\ 1000 <= main_b /\ main_c <= 1000, {main_a -> 1, main_b -> 1, main_c -> 1 + main_c, rest remain the same}>
4.12/4.16	<l2, l2, 1000 <= main_a /\ main_c <= 1000 /\ main_b <= 999, {main_a -> 1, main_b -> 1 + main_b, rest remain the same}>
4.12/4.16	<l2, l2, main_c <= 1000 /\ main_a <= 999 /\ 1001 <= main_b, {main_a -> 1 + main_a, main_b -> 1, main_c -> 1 + main_c, rest remain the same}>
4.12/4.16	<l2, l2, main_b <= 1000 /\ main_c <= 1000 /\ main_a <= 999, {main_a -> 1 + main_a, rest remain the same}>
4.12/4.16	Variables:
4.12/4.16	main_a, main_b, main_c
4.12/4.16	
4.12/4.16	Graph 2:
4.12/4.16	Transitions:
4.12/4.16	Variables:
4.12/4.16	
4.12/4.16	Precedence: 
4.12/4.16	Graph 0
4.12/4.16	
4.12/4.16	Graph 1
4.12/4.16	<l0, l2, main_a = 1 /\ main_b = 1 /\ main_c = 1, {all remain the same}>
4.12/4.16	
4.12/4.16	Graph 2
4.12/4.16	<l2, l13, true, {all remain the same}>
4.12/4.16	<l2, l13, 1001 <= main_c, {all remain the same}>
4.12/4.16	
4.12/4.16	Map Locations to Subgraph:
4.12/4.16	( 0 , 0 )
4.12/4.16	( 2 , 1 )
4.12/4.16	( 13 , 2 )
4.12/4.16	
4.12/4.16	*******************************************************************************************
4.12/4.16	********************************    CHECKING ASSERTIONS    ********************************
4.12/4.16	*******************************************************************************************
4.12/4.16	
4.12/4.16	Detected abstraction incompatible with non-termination check.
4.12/4.16	Proving termination of subgraph 0
4.12/4.16	Proving termination of subgraph 1
4.12/4.16	Checking unfeasibility...
4.12/4.16	Time used: 4.10075
4.12/4.16	
4.12/4.16	Checking conditional termination of SCC {l2}...
4.12/4.16	
4.12/4.16	LOG: CALL solveLinear
4.12/4.16	
4.12/4.16	LOG: RETURN solveLinear - Elapsed time: 0.007624s
4.12/4.16	Ranking function: 1000 - main_c
4.12/4.16	New Graphs: 
4.12/4.16	Transitions:
4.12/4.16	<l2, l2, 1000 <= main_a /\ main_c <= 1000 /\ main_b <= 999, {main_a -> 1, main_b -> 1 + main_b, rest remain the same}>
4.12/4.16	<l2, l2, main_b <= 1000 /\ main_c <= 1000 /\ main_a <= 999, {main_a -> 1 + main_a, rest remain the same}>
4.12/4.16	Variables:
4.12/4.16	main_a, main_b, main_c
4.12/4.16	Checking conditional termination of SCC {l2}...
4.12/4.16	
4.12/4.16	LOG: CALL solveLinear
4.12/4.16	
4.12/4.16	LOG: RETURN solveLinear - Elapsed time: 0.001341s
4.12/4.16	Ranking function: 2997000 - 3000*main_b
4.12/4.16	New Graphs: 
4.12/4.16	Transitions:
4.12/4.16	<l2, l2, main_b <= 1000 /\ main_c <= 1000 /\ main_a <= 999, {main_a -> 1 + main_a, rest remain the same}>
4.12/4.16	Variables:
4.12/4.16	main_a, main_b, main_c
4.12/4.16	Checking conditional termination of SCC {l2}...
4.12/4.16	
4.12/4.16	LOG: CALL solveLinear
4.12/4.16	
4.12/4.16	LOG: RETURN solveLinear - Elapsed time: 0.000778s
4.12/4.16	Ranking function: 999 - main_a
4.12/4.16	New Graphs: 
4.12/4.16	Proving termination of subgraph 2
4.12/4.16	Analyzing SCC {l13}...
4.12/4.16	No cycles found.
4.12/4.16	
4.12/4.16	Program Terminates
4.12/4.16	EOF