0.96/1.00	YES
0.96/1.00	
0.96/1.00	Solver Timeout: 4
0.96/1.00	Global Timeout: 300
0.96/1.00	No parsing errors!
0.96/1.00	Init Location: 0
0.96/1.00	Transitions:
0.96/1.00	<l0, l16, true>
0.96/1.00	<l1, l2, (101 <= (0 + Index2^0)), par{Sorted5^0 -> 0, i8^0 -> 1}>
0.96/1.00	<l1, l3, ((0 + Index2^0) <= 100), par{Index2^0 -> (1 + Index2^0)}>
0.96/1.00	<l3, l1, true>
0.96/1.00	<l4, l5, true>
0.96/1.00	<l6, l4, true>
0.96/1.00	<l7, l8, true>
0.96/1.00	<l8, l2, ((0 + Sorted5^0) <= 0) /\ (0 <= (0 + Sorted5^0)), par{i8^0 -> (1 + i8^0)}>
0.96/1.00	<l8, l6, (1 <= (0 + Sorted5^0))>
0.96/1.00	<l8, l6, ((1 + Sorted5^0) <= 0)>
0.96/1.00	<l9, l10, true, par{Index7^0 -> (1 + Index7^0)}>
0.96/1.00	<l2, l11, true>
0.96/1.00	<l12, l9, (undef81 = undef81), par{Sorted5^0 -> 0, Temp6^0 -> undef81}>
0.96/1.00	<l12, l9, true>
0.96/1.00	<l13, l12, ((0 + Index7^0) <= (100 + (~(1) * i8^0)))>
0.96/1.00	<l13, l7, ((101 + (~(1) * i8^0)) <= (0 + Index7^0))>
0.96/1.00	<l14, l7, (100 <= (0 + Index7^0))>
0.96/1.00	<l14, l13, ((0 + Index7^0) <= 99)>
0.96/1.00	<l10, l14, true>
0.96/1.00	<l11, l4, (100 <= (0 + i8^0))>
0.96/1.00	<l11, l10, ((0 + i8^0) <= 99), par{Index7^0 -> 1, Sorted5^0 -> 1}>
0.96/1.00	<l15, l3, (undef146 = ~(1)), par{Index2^0 -> 1, fact3^0 -> (0 + undef146), factor^0 -> undef146}>
0.96/1.00	<l16, l15, true>
0.96/1.00	
0.96/1.00	Fresh variables:
0.96/1.00	undef81, undef146, 
0.96/1.00	
0.96/1.00	Undef variables:
0.96/1.00	undef81, undef146, 
0.96/1.00	
0.96/1.00	Abstraction variables:
0.96/1.00	
0.96/1.00	Exit nodes:
0.96/1.00	
0.96/1.00	Accepting locations:
0.96/1.00	
0.96/1.00	Asserts:
0.96/1.00	
0.96/1.00	Preprocessed LLVMGraph
0.96/1.00	Init Location: 0
0.96/1.00	Transitions:
0.96/1.00	<l0, l3, (Index2^0 = 1) /\ (undef146 = ~(1))>
0.96/1.00	<l3, l10, (101 <= (0 + Index2^0)) /\ ((0 + 1) <= 99), par{Index7^0 -> 1, Sorted5^0 -> 1, i8^0 -> 1}>
0.96/1.00	<l3, l3, ((0 + Index2^0) <= 100), par{Index2^0 -> (1 + Index2^0)}>
0.96/1.00	<l10, l5, (100 <= (0 + Index7^0)) /\ ((0 + Sorted5^0) <= 0) /\ (0 <= (0 + Sorted5^0)) /\ (100 <= (0 + (1 + i8^0))), par{i8^0 -> (1 + i8^0)}>
0.96/1.00	<l10, l10, (100 <= (0 + Index7^0)) /\ ((0 + Sorted5^0) <= 0) /\ (0 <= (0 + Sorted5^0)) /\ ((0 + (1 + i8^0)) <= 99), par{Index7^0 -> 1, Sorted5^0 -> 1, i8^0 -> (1 + i8^0)}>
0.96/1.00	<l10, l5, (100 <= (0 + Index7^0)) /\ (1 <= (0 + Sorted5^0))>
0.96/1.00	<l10, l5, (100 <= (0 + Index7^0)) /\ ((1 + Sorted5^0) <= 0)>
0.96/1.00	<l10, l10, ((0 + Index7^0) <= 99) /\ ((0 + Index7^0) <= (100 + (~(1) * i8^0))) /\ (undef81 = undef81), par{Index7^0 -> (1 + Index7^0), Sorted5^0 -> 0}>
0.96/1.00	<l10, l10, ((0 + Index7^0) <= 99) /\ ((0 + Index7^0) <= (100 + (~(1) * i8^0))), par{Index7^0 -> (1 + Index7^0)}>
0.96/1.00	<l10, l5, ((0 + Index7^0) <= 99) /\ ((101 + (~(1) * i8^0)) <= (0 + Index7^0)) /\ ((0 + Sorted5^0) <= 0) /\ (0 <= (0 + Sorted5^0)) /\ (100 <= (0 + (1 + i8^0))), par{i8^0 -> (1 + i8^0)}>
0.96/1.00	<l10, l10, ((0 + Index7^0) <= 99) /\ ((101 + (~(1) * i8^0)) <= (0 + Index7^0)) /\ ((0 + Sorted5^0) <= 0) /\ (0 <= (0 + Sorted5^0)) /\ ((0 + (1 + i8^0)) <= 99), par{Index7^0 -> 1, Sorted5^0 -> 1, i8^0 -> (1 + i8^0)}>
0.96/1.00	<l10, l5, ((0 + Index7^0) <= 99) /\ ((101 + (~(1) * i8^0)) <= (0 + Index7^0)) /\ (1 <= (0 + Sorted5^0))>
0.96/1.00	<l10, l5, ((0 + Index7^0) <= 99) /\ ((101 + (~(1) * i8^0)) <= (0 + Index7^0)) /\ ((1 + Sorted5^0) <= 0)>
0.96/1.00	
0.96/1.00	Fresh variables:
0.96/1.00	undef81, undef146, 
0.96/1.00	
0.96/1.00	Undef variables:
0.96/1.00	undef81, undef146, 
0.96/1.00	
0.96/1.00	Abstraction variables:
0.96/1.00	
0.96/1.00	Exit nodes:
0.96/1.00	
0.96/1.00	Accepting locations:
0.96/1.00	
0.96/1.00	Asserts:
0.96/1.00	
0.96/1.00	*************************************************************
0.96/1.00	*******************************************************************************************
0.96/1.00	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
0.96/1.00	*******************************************************************************************
0.96/1.00	
0.96/1.00	Init Location: 0
0.96/1.00	Graph 0:
0.96/1.00	Transitions:
0.96/1.00	Variables:
0.96/1.00	
0.96/1.00	Graph 1:
0.96/1.00	Transitions:
0.96/1.00	<l3, l3, Index2^0 <= 100, {Index2^0 -> 1 + Index2^0, rest remain the same}>
0.96/1.00	Variables:
0.96/1.00	Index2^0
0.96/1.00	
0.96/1.00	Graph 2:
0.96/1.00	Transitions:
0.96/1.00	<l10, l10, 100 <= Index7^0 /\ i8^0 <= 98 /\ Sorted5^0 = 0, {Index7^0 -> 1, Sorted5^0 -> 1, i8^0 -> 1 + i8^0, rest remain the same}>
0.96/1.00	<l10, l10, Index7^0 + i8^0 <= 100 /\ Index7^0 <= 99, {Index7^0 -> 1 + Index7^0, Sorted5^0 -> 0, rest remain the same}>
0.96/1.00	<l10, l10, Index7^0 + i8^0 <= 100 /\ Index7^0 <= 99, {Index7^0 -> 1 + Index7^0, rest remain the same}>
0.96/1.00	<l10, l10, 101 <= Index7^0 + i8^0 /\ i8^0 <= 98 /\ Index7^0 <= 99 /\ Sorted5^0 = 0, {Index7^0 -> 1, Sorted5^0 -> 1, i8^0 -> 1 + i8^0, rest remain the same}>
0.96/1.00	Variables:
0.96/1.00	Index7^0, Sorted5^0, i8^0
0.96/1.00	
0.96/1.00	Graph 3:
0.96/1.00	Transitions:
0.96/1.00	Variables:
0.96/1.00	
0.96/1.00	Precedence: 
0.96/1.00	Graph 0
0.96/1.00	
0.96/1.00	Graph 1
0.96/1.00	<l0, l3, 1 + undef146 = 0 /\ Index2^0 = 1, {all remain the same}>
0.96/1.00	
0.96/1.00	Graph 2
0.96/1.00	<l3, l10, 101 <= Index2^0, {Index7^0 -> 1, Sorted5^0 -> 1, i8^0 -> 1, rest remain the same}>
0.96/1.00	
0.96/1.00	Graph 3
0.96/1.00	<l10, l5, 100 <= Index7^0 /\ 99 <= i8^0 /\ Sorted5^0 = 0, {i8^0 -> 1 + i8^0, rest remain the same}>
0.96/1.00	<l10, l5, 1 <= Sorted5^0 /\ 100 <= Index7^0, {all remain the same}>
0.96/1.00	<l10, l5, 1 + Sorted5^0 <= 0 /\ 100 <= Index7^0, {all remain the same}>
0.96/1.00	<l10, l5, 101 <= Index7^0 + i8^0 /\ 99 <= i8^0 /\ Index7^0 <= 99 /\ Sorted5^0 = 0, {i8^0 -> 1 + i8^0, rest remain the same}>
0.96/1.00	<l10, l5, 101 <= Index7^0 + i8^0 /\ 1 <= Sorted5^0 /\ Index7^0 <= 99, {all remain the same}>
0.96/1.00	<l10, l5, 101 <= Index7^0 + i8^0 /\ 1 + Sorted5^0 <= 0 /\ Index7^0 <= 99, {all remain the same}>
0.96/1.00	
0.96/1.00	Map Locations to Subgraph:
0.96/1.00	( 0 , 0 )
0.96/1.00	( 3 , 1 )
0.96/1.00	( 5 , 3 )
0.96/1.00	( 10 , 2 )
0.96/1.00	
0.96/1.00	*******************************************************************************************
0.96/1.00	********************************    CHECKING ASSERTIONS    ********************************
0.96/1.00	*******************************************************************************************
0.96/1.00	
0.96/1.00	Proving termination of subgraph 0
0.96/1.00	Proving termination of subgraph 1
0.96/1.00	Checking unfeasibility...
0.96/1.00	Time used: 0.001551
0.96/1.00	
0.96/1.00	Checking conditional termination of SCC {l3}...
0.96/1.00	
0.96/1.00	LOG: CALL solveLinear
0.96/1.00	
0.96/1.00	LOG: RETURN solveLinear - Elapsed time: 0.000585s
0.96/1.00	Ranking function: 100 - Index2^0
0.96/1.00	New Graphs: 
0.96/1.00	Proving termination of subgraph 2
0.96/1.00	Checking unfeasibility...
0.96/1.00	Time used: 0.93752
0.96/1.00	
0.96/1.00	Checking conditional termination of SCC {l10}...
0.96/1.00	
0.96/1.00	LOG: CALL solveLinear
0.96/1.00	
0.96/1.00	LOG: RETURN solveLinear - Elapsed time: 0.012851s
0.96/1.00	Ranking function: 196 - 2*i8^0
0.96/1.00	New Graphs: 
0.96/1.00	Transitions:
0.96/1.00	<l10, l10, Index7^0 + i8^0 <= 100 /\ Index7^0 <= 99, {Index7^0 -> 1 + Index7^0, Sorted5^0 -> 0, rest remain the same}>
0.96/1.00	<l10, l10, Index7^0 + i8^0 <= 100 /\ Index7^0 <= 99, {Index7^0 -> 1 + Index7^0, rest remain the same}>
0.96/1.00	Variables:
0.96/1.00	Index7^0, Sorted5^0, i8^0
0.96/1.00	Checking conditional termination of SCC {l10}...
0.96/1.00	
0.96/1.00	LOG: CALL solveLinear
0.96/1.00	
0.96/1.00	LOG: RETURN solveLinear - Elapsed time: 0.001230s
0.96/1.00	Ranking function: 99 - Index7^0
0.96/1.00	New Graphs: 
0.96/1.00	Proving termination of subgraph 3
0.96/1.00	Analyzing SCC {l5}...
0.96/1.00	No cycles found.
0.96/1.00	
0.96/1.00	Program Terminates
0.96/1.00	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
0.96/1.00	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
0.96/1.00	EOF