0.09/0.11	YES
0.09/0.11	
0.09/0.11	Solver Timeout: 4
0.09/0.11	Global Timeout: 300
0.09/0.11	No parsing errors!
0.09/0.11	Init Location: 0
0.09/0.11	Transitions:
0.09/0.11	<l0, l10, true>
0.09/0.11	<l1, l2, ((0 + n^0) <= (0 + j^0)), par{i^0 -> (1 + i^0)}>
0.09/0.11	<l1, l3, ((1 + j^0) <= (0 + n^0)) /\ (undef5 = undef5), par{guard^0 -> undef5}>
0.09/0.11	<l4, l5, ((0 + n^0) <= (0 + i^0))>
0.09/0.11	<l4, l6, ((1 + i^0) <= (0 + n^0)), par{j^0 -> (1 + i^0)}>
0.09/0.11	<l2, l4, true>
0.09/0.11	<l6, l1, true>
0.09/0.11	<l7, l6, true, par{j^0 -> (1 + j^0)}>
0.09/0.11	<l8, l7, true, par{j^0 -> (~(1) + j^0), n^0 -> (~(1) + n^0)}>
0.09/0.11	<l3, l7, ((0 + guard^0) <= 0) /\ (0 <= (0 + guard^0))>
0.09/0.11	<l3, l8, (1 <= (0 + guard^0))>
0.09/0.11	<l3, l8, ((1 + guard^0) <= 0)>
0.09/0.11	<l9, l2, true, par{i^0 -> 0}>
0.09/0.11	<l10, l9, true>
0.09/0.11	
0.09/0.11	Fresh variables:
0.09/0.11	undef5, 
0.09/0.11	
0.09/0.11	Undef variables:
0.09/0.11	undef5, 
0.09/0.11	
0.09/0.11	Abstraction variables:
0.09/0.11	
0.09/0.11	Exit nodes:
0.09/0.11	
0.09/0.11	Accepting locations:
0.09/0.11	
0.09/0.11	Asserts:
0.09/0.11	
0.09/0.11	Preprocessed LLVMGraph
0.09/0.11	Init Location: 0
0.09/0.11	Transitions:
0.09/0.11	<l0, l5, (i^0 = 0) /\ ((0 + n^0) <= (0 + 0))>
0.09/0.11	<l0, l6, (i^0 = 0) /\ ((1 + 0) <= (0 + n^0)), par{j^0 -> (1 + 0)}>
0.09/0.11	<l6, l5, ((0 + n^0) <= (0 + j^0)) /\ ((0 + n^0) <= (0 + (1 + i^0))), par{i^0 -> (1 + i^0)}>
0.09/0.11	<l6, l6, ((0 + n^0) <= (0 + j^0)) /\ ((1 + (1 + i^0)) <= (0 + n^0)), par{i^0 -> (1 + i^0), j^0 -> (1 + (1 + i^0))}>
0.09/0.11	<l6, l6, ((1 + j^0) <= (0 + n^0)) /\ (undef5 = undef5) /\ ((0 + undef5) <= 0) /\ (0 <= (0 + undef5)), par{j^0 -> (1 + j^0)}>
0.09/0.11	<l6, l6, ((1 + j^0) <= (0 + n^0)) /\ (undef5 = undef5) /\ (1 <= (0 + undef5)), par{j^0 -> (1 + (~(1) + j^0)), n^0 -> (~(1) + n^0)}>
0.09/0.11	<l6, l6, ((1 + j^0) <= (0 + n^0)) /\ (undef5 = undef5) /\ ((1 + undef5) <= 0), par{j^0 -> (1 + (~(1) + j^0)), n^0 -> (~(1) + n^0)}>
0.09/0.11	
0.09/0.11	Fresh variables:
0.09/0.11	undef5, 
0.09/0.11	
0.09/0.11	Undef variables:
0.09/0.11	undef5, 
0.09/0.11	
0.09/0.11	Abstraction variables:
0.09/0.11	
0.09/0.11	Exit nodes:
0.09/0.11	
0.09/0.11	Accepting locations:
0.09/0.11	
0.09/0.11	Asserts:
0.09/0.11	
0.09/0.11	*************************************************************
0.09/0.11	*******************************************************************************************
0.09/0.11	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
0.09/0.11	*******************************************************************************************
0.09/0.11	
0.09/0.11	Init Location: 0
0.09/0.11	Graph 0:
0.09/0.11	Transitions:
0.09/0.11	Variables:
0.09/0.11	
0.09/0.11	Graph 1:
0.09/0.11	Transitions:
0.09/0.11	<l6, l6, n^0 <= j^0 /\ 2 + i^0 <= n^0, {i^0 -> 1 + i^0, j^0 -> 2 + i^0, rest remain the same}>
0.09/0.11	<l6, l6, 1 + j^0 <= n^0 /\ undef5 = 0, {j^0 -> 1 + j^0, rest remain the same}>
0.09/0.11	<l6, l6, 1 + j^0 <= n^0 /\ 1 <= undef5, {n^0 -> -1 + n^0, rest remain the same}>
0.09/0.11	<l6, l6, 1 + j^0 <= n^0 /\ 1 + undef5 <= 0, {n^0 -> -1 + n^0, rest remain the same}>
0.09/0.11	Variables:
0.09/0.11	i^0, j^0, n^0
0.09/0.11	
0.09/0.11	Graph 2:
0.09/0.11	Transitions:
0.09/0.11	Variables:
0.09/0.11	
0.09/0.11	Precedence: 
0.09/0.11	Graph 0
0.09/0.11	
0.09/0.11	Graph 1
0.09/0.11	<l0, l6, 1 <= n^0 /\ i^0 = 0, {j^0 -> 1, rest remain the same}>
0.09/0.11	
0.09/0.11	Graph 2
0.09/0.11	<l0, l5, n^0 <= 0 /\ i^0 = 0, {all remain the same}>
0.09/0.11	<l6, l5, n^0 <= j^0 /\ n^0 <= 1 + i^0, {i^0 -> 1 + i^0, rest remain the same}>
0.09/0.11	
0.09/0.11	Map Locations to Subgraph:
0.09/0.11	( 0 , 0 )
0.09/0.11	( 5 , 2 )
0.09/0.11	( 6 , 1 )
0.09/0.11	
0.09/0.11	*******************************************************************************************
0.09/0.11	********************************    CHECKING ASSERTIONS    ********************************
0.09/0.11	*******************************************************************************************
0.09/0.11	
0.09/0.11	Proving termination of subgraph 0
0.09/0.11	Proving termination of subgraph 1
0.09/0.11	Checking unfeasibility...
0.09/0.11	Time used: 0.075211
0.09/0.11	
0.09/0.11	Checking conditional termination of SCC {l6}...
0.09/0.11	
0.09/0.11	LOG: CALL solveLinear
0.09/0.11	
0.09/0.11	LOG: RETURN solveLinear - Elapsed time: 0.003217s
0.09/0.11	Ranking function: -6 - 3*i^0 + 3*n^0
0.09/0.11	New Graphs: 
0.09/0.11	Transitions:
0.09/0.11	<l6, l6, 1 + j^0 <= n^0 /\ undef5 = 0, {j^0 -> 1 + j^0, rest remain the same}>
0.09/0.11	<l6, l6, 1 + j^0 <= n^0 /\ 1 <= undef5, {n^0 -> -1 + n^0, rest remain the same}>
0.09/0.11	<l6, l6, 1 + j^0 <= n^0 /\ 1 + undef5 <= 0, {n^0 -> -1 + n^0, rest remain the same}>
0.09/0.11	Variables:
0.09/0.11	j^0, n^0
0.09/0.11	Checking conditional termination of SCC {l6}...
0.09/0.11	
0.09/0.11	LOG: CALL solveLinear
0.09/0.11	
0.09/0.11	LOG: RETURN solveLinear - Elapsed time: 0.001693s
0.09/0.11	Ranking function: -1 - j^0 + n^0
0.09/0.11	New Graphs: 
0.09/0.11	Proving termination of subgraph 2
0.09/0.11	Analyzing SCC {l5}...
0.09/0.11	No cycles found.
0.09/0.11	
0.09/0.11	Program Terminates
0.09/0.11	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
0.09/0.11	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
0.09/0.11	EOF