0.00/0.06	YES
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_c -> 0, main_i -> 0}>
0.00/0.06	<l1, l2, true>
0.00/0.06	<l2, l5, not((main_i < 100))>
0.00/0.06	<l2, l3, (main_i < 100)>
0.00/0.06	<l3, l4, true, seq{main_c -> (main_c + 1), main_i -> (main_i + 1)}>
0.00/0.06	<l4, l2, true>
0.00/0.06	<l5, l6, true, seq{main_j -> 5}>
0.00/0.06	<l6, l7, true>
0.00/0.06	<l7, l10, not((main_j < 21))>
0.00/0.06	<l7, l8, (main_j < 21)>
0.00/0.06	<l8, l9, true, seq{main_c -> (main_c + 1), main_j -> (main_j + 3)}>
0.00/0.06	<l9, l7, 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_c -> 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, l5, not((main_i < 100))>
0.00/0.06	<l3, l4, true, seq{main_c -> (main_c + 1), main_i -> (main_i + 1)}>
0.00/0.06	<l4, l2, true>
0.00/0.06	<l5, l6, true, seq{main_j -> 5}>
0.00/0.06	<l6, l7, true>
0.00/0.06	<l7, l8, (main_j < 21)>
0.00/0.06	<l7, l10, not((main_j < 21))>
0.00/0.06	<l8, l9, true, seq{main_c -> (main_c + 1), main_j -> (main_j + 3)}>
0.00/0.06	<l9, l7, 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 [5 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: 9, col: 5> <line: 10, col: 12> <line: 12, col: 9> <line: 12, col: 13>
0.00/0.06	j | local variable | integer | <line: 6, col: 5> | <line: 14, col: 5> <line: 15, col: 12> <line: 17, col: 9> <line: 17, col: 13>
0.00/0.06	c | local variable | integer | <line: 7, col: 5> | <line: 8, col: 5> <line: 11, col: 9> <line: 11, col: 13> <line: 16, col: 9> <line: 16, col: 13>
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, l2, (main_i = 0) /\ (main_c = 0)>
0.00/0.06	<l2, l2, (main_i < 100), par{main_i -> (main_i + 1), main_c -> (main_c + 1)}>
0.00/0.06	<l2, l7, not((main_i < 100)), par{main_j -> 5}>
0.00/0.06	<l7, l7, (main_j < 21), par{main_j -> (main_j + 3), main_c -> (main_c + 1)}>
0.00/0.06	<l7, l11, not((main_j < 21))>
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	<l2, l2, main_i <= 99, {main_i -> 1 + main_i, main_c -> 1 + main_c, rest remain the same}>
0.00/0.06	Variables:
0.00/0.06	main_i, main_c
0.00/0.06	
0.00/0.06	Graph 2:
0.00/0.06	Transitions:
0.00/0.06	<l7, l7, main_j <= 20, {main_j -> 3 + main_j, main_c -> 1 + main_c, rest remain the same}>
0.00/0.06	Variables:
0.00/0.06	main_j, main_c
0.00/0.06	
0.00/0.06	Graph 3:
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, l2, main_i = 0 /\ main_c = 0, {all remain the same}>
0.00/0.07	
0.00/0.07	Graph 2
0.00/0.07	<l2, l7, 100 <= main_i, {main_j -> 5, rest remain the same}>
0.00/0.07	
0.00/0.07	Graph 3
0.00/0.07	<l7, l11, 21 <= main_j, {all remain the same}>
0.00/0.07	
0.00/0.07	Map Locations to Subgraph:
0.00/0.07	( 0 , 0 )
0.00/0.07	( 2 , 1 )
0.00/0.07	( 7 , 2 )
0.00/0.07	( 11 , 3 )
0.00/0.07	
0.00/0.07	*******************************************************************************************
0.00/0.07	********************************    CHECKING ASSERTIONS    ********************************
0.00/0.07	*******************************************************************************************
0.00/0.07	
0.00/0.07	Proving termination of subgraph 0
0.00/0.07	Proving termination of subgraph 1
0.00/0.07	Checking unfeasibility...
0.00/0.07	Time used: 0.001713
0.00/0.07	
0.00/0.07	Checking conditional termination of SCC {l2}...
0.00/0.07	
0.00/0.07	LOG: CALL solveLinear
0.00/0.07	
0.00/0.07	LOG: RETURN solveLinear - Elapsed time: 0.000584s
0.00/0.07	Ranking function: 99 - main_i
0.00/0.07	New Graphs: 
0.00/0.07	Proving termination of subgraph 2
0.00/0.07	Checking unfeasibility...
0.00/0.07	Time used: 0.039182
0.00/0.07	
0.00/0.07	Checking conditional termination of SCC {l7}...
0.00/0.07	
0.00/0.07	LOG: CALL solveLinear
0.00/0.07	
0.00/0.07	LOG: RETURN solveLinear - Elapsed time: 0.000749s
0.00/0.07	Ranking function: (20 / 3) + (~(1) / 3)*main_j
0.00/0.07	New Graphs: 
0.00/0.07	Proving termination of subgraph 3
0.00/0.07	Analyzing SCC {l11}...
0.00/0.07	No cycles found.
0.00/0.07	
0.00/0.07	Program Terminates
0.00/0.07	EOF