0.00/0.11	YES
0.00/0.11	
0.00/0.11	Solver Timeout: 4
0.00/0.11	Global Timeout: 300
0.00/0.11	No parsing errors!
0.00/0.11	Init Location: 0
0.00/0.11	Transitions:
0.00/0.11	<l0, l43, true>
0.00/0.11	<l1, l2, ((0 + ip^0) <= (0 + j^0))>
0.00/0.11	<l1, l3, ((0 + j^0) <= (~(1) + ip^0)) /\ (undef31 = undef31) /\ (undef32 = undef32), par{g^0 -> undef31, h^0 -> undef32, j^0 -> (1 + j^0)}>
0.00/0.11	<l3, l1, true>
0.00/0.11	<l4, l5, (0 <= (0 + theta^0))>
0.00/0.11	<l4, l5, ((1 + theta^0) <= 0), par{t^0 -> (0 + (~(1) * t^0))}>
0.00/0.11	<l6, l7, ((1 + n^0) <= (0 + iq^0)), par{ip^0 -> (1 + ip^0)}>
0.00/0.11	<l6, l8, ((0 + iq^0) <= (0 + n^0)), par{iq^0 -> (1 + iq^0)}>
0.00/0.11	<l9, l4, (undef210 = undef210) /\ (undef216 = undef216) /\ (undef217 = undef217) /\ (undef208 = undef208), par{t^0 -> undef208, theta^0 -> undef210, tmp___2^0 -> undef216, tmp___3^0 -> undef217}>
0.00/0.11	<l5, l3, (undef248 = undef248) /\ (undef226 = undef226) /\ (undef234 = undef234) /\ (undef237 = undef237) /\ (undef228 = undef228), par{c^0 -> undef226, h^0 -> undef228, s^0 -> undef234, tau^0 -> undef237, tmp___6^0 -> undef248}>
0.00/0.11	<l10, l9, ((1 + tmp___5^0) <= ((0 + g^0) + tmp___4^0))>
0.00/0.11	<l10, l9, (((1 + g^0) + tmp___4^0) <= (0 + tmp___5^0))>
0.00/0.11	<l10, l5, (((0 + g^0) + tmp___4^0) <= (0 + tmp___5^0)) /\ ((0 + tmp___5^0) <= ((0 + g^0) + tmp___4^0)) /\ (undef320 = undef320), par{t^0 -> undef320}>
0.00/0.11	<l11, l12, ((0 + tmp___7^0) <= (0 + tresh^0))>
0.00/0.11	<l11, l10, ((1 + tresh^0) <= (0 + tmp___7^0)) /\ (undef368 = undef368) /\ (undef386 = undef386) /\ (undef387 = undef387), par{h^0 -> undef368, tmp___4^0 -> undef386, tmp___5^0 -> undef387}>
0.00/0.11	<l13, l11, (undef417 = undef417), par{tmp___7^0 -> undef417}>
0.00/0.11	<l14, l13, true>
0.00/0.11	<l15, l13, true>
0.00/0.11	<l12, l16, true, par{iq^0 -> (1 + iq^0)}>
0.00/0.11	<l17, l15, ((1 + tmp___11^0) <= ((0 + g^0) + tmp___10^0))>
0.00/0.11	<l17, l15, (((1 + g^0) + tmp___10^0) <= (0 + tmp___11^0))>
0.00/0.11	<l17, l12, (((0 + g^0) + tmp___10^0) <= (0 + tmp___11^0)) /\ ((0 + tmp___11^0) <= ((0 + g^0) + tmp___10^0))>
0.00/0.11	<l18, l14, ((1 + tmp___9^0) <= ((0 + g^0) + tmp___8^0))>
0.00/0.11	<l18, l14, (((1 + g^0) + tmp___8^0) <= (0 + tmp___9^0))>
0.00/0.11	<l18, l17, (((0 + g^0) + tmp___8^0) <= (0 + tmp___9^0)) /\ ((0 + tmp___9^0) <= ((0 + g^0) + tmp___8^0)) /\ (undef661 = undef661) /\ (undef662 = undef662), par{tmp___10^0 -> undef661, tmp___11^0 -> undef662}>
0.00/0.11	<l8, l6, true>
0.00/0.11	<l19, l13, ((0 + i^0) <= 4)>
0.00/0.11	<l19, l18, (5 <= (0 + i^0)) /\ (undef754 = undef754) /\ (undef755 = undef755), par{tmp___8^0 -> undef754, tmp___9^0 -> undef755}>
0.00/0.11	<l20, l21, ((1 + n^0) <= (0 + iq^0)), par{ip^0 -> (1 + ip^0)}>
0.00/0.11	<l20, l19, ((0 + iq^0) <= (0 + n^0)) /\ (undef803 = undef803) /\ (undef787 = undef787), par{g^0 -> undef787, tmp___1^0 -> undef803}>
0.00/0.11	<l16, l20, true>
0.00/0.11	<l22, l23, ((0 + n^0) <= (0 + ip^0))>
0.00/0.11	<l22, l16, ((0 + ip^0) <= (~(1) + n^0))>
0.00/0.11	<l24, l25, ((1 + n^0) <= (0 + ip^0))>
0.00/0.11	<l24, l8, ((0 + ip^0) <= (0 + n^0))>
0.00/0.11	<l21, l22, true>
0.00/0.11	<l26, l21, (4 <= (0 + i^0)), par{tresh^0 -> 0}>
0.00/0.11	<l26, l21, ((1 + i^0) <= 4) /\ (undef1036 = undef1036), par{tresh^0 -> undef1036}>
0.00/0.11	<l27, l26, (1 <= (0 + sm^0))>
0.00/0.11	<l27, l26, ((1 + sm^0) <= 0)>
0.00/0.11	<l27, l28, ((0 + sm^0) <= 0) /\ (0 <= (0 + sm^0))>
0.00/0.11	<l7, l24, true>
0.00/0.11	<l29, l30, ((1 + n^0) <= (0 + iq^0)), par{ip^0 -> (1 + ip^0)}>
0.00/0.11	<l29, l31, ((0 + iq^0) <= (0 + n^0)) /\ (undef1192 = undef1192), par{iq^0 -> (1 + iq^0), sm^0 -> ((0 + sm^0) + undef1192), tmp___0^0 -> undef1192}>
0.00/0.11	<l31, l29, true>
0.00/0.11	<l32, l27, ((0 + n^0) <= (0 + ip^0))>
0.00/0.11	<l32, l31, ((0 + ip^0) <= (~(1) + n^0))>
0.00/0.11	<l30, l32, true>
0.00/0.11	<l33, l28, ((1 + __const_50^0) <= (0 + i^0))>
0.00/0.11	<l33, l30, ((0 + i^0) <= (0 + __const_50^0)), par{sm^0 -> 0}>
0.00/0.11	<l34, l33, true>
0.00/0.11	<l35, l7, true>
0.00/0.11	<l36, l34, ((1 + n^0) <= (0 + ip^0))>
0.00/0.11	<l36, l25, ((0 + ip^0) <= (0 + n^0)) /\ (undef1471 = undef1471), par{ip^0 -> (1 + ip^0), tmp^0 -> undef1471}>
0.00/0.11	<l25, l36, true>
0.00/0.11	<l37, l34, ((1 + n^0) <= (0 + ip^0)), par{i^0 -> (1 + i^0)}>
0.00/0.11	<l37, l23, ((0 + ip^0) <= (0 + n^0)), par{ip^0 -> (1 + ip^0)}>
0.00/0.11	<l23, l37, true>
0.00/0.11	<l38, l12, ((1 + n^0) <= (0 + j^0))>
0.00/0.11	<l38, l39, ((0 + j^0) <= (0 + n^0)) /\ (undef1627 = undef1627) /\ (undef1628 = undef1628), par{g^0 -> undef1627, h^0 -> undef1628, j^0 -> (1 + j^0)}>
0.00/0.11	<l39, l38, true>
0.00/0.11	<l40, l39, ((1 + n^0) <= (0 + j^0))>
0.00/0.11	<l40, l41, ((0 + j^0) <= (0 + n^0)) /\ (undef1711 = undef1711) /\ (undef1712 = undef1712), par{g^0 -> undef1711, h^0 -> undef1712, j^0 -> (1 + j^0)}>
0.00/0.11	<l41, l40, true>
0.00/0.11	<l42, l41, ((0 + iq^0) <= (0 + j^0))>
0.00/0.11	<l42, l2, ((0 + j^0) <= (~(1) + iq^0)) /\ (undef1795 = undef1795) /\ (undef1796 = undef1796), par{g^0 -> undef1795, h^0 -> undef1796, j^0 -> (1 + j^0)}>
0.00/0.11	<l2, l42, true>
0.00/0.11	<l43, l35, true>
0.00/0.11	
0.00/0.11	Fresh variables:
0.00/0.11	undef31, undef32, undef208, undef210, undef216, undef217, undef226, undef228, undef234, undef237, undef248, undef320, undef368, undef386, undef387, undef417, undef661, undef662, undef754, undef755, undef787, undef803, undef1036, undef1192, undef1471, undef1627, undef1628, undef1711, undef1712, undef1795, undef1796, 
0.00/0.11	
0.00/0.11	Undef variables:
0.00/0.11	undef31, undef32, undef208, undef210, undef216, undef217, undef226, undef228, undef234, undef237, undef248, undef320, undef368, undef386, undef387, undef417, undef661, undef662, undef754, undef755, undef787, undef803, undef1036, undef1192, undef1471, undef1627, undef1628, undef1711, undef1712, undef1795, undef1796, 
0.00/0.11	
0.00/0.11	Abstraction variables:
0.00/0.11	
0.00/0.11	Exit nodes:
0.00/0.11	
0.00/0.11	Accepting locations:
0.00/0.11	
0.00/0.11	Asserts:
0.00/0.11	
0.00/0.11	Preprocessed LLVMGraph
0.00/0.11	Init Location: 0
0.00/0.11	Transitions:
0.00/0.11	<l0, l25, ((1 + n^0) <= (0 + ip^0))>
0.00/0.11	<l0, l8, ((0 + ip^0) <= (0 + n^0))>
0.00/0.11	<l8, l25, ((1 + n^0) <= (0 + iq^0)) /\ ((1 + n^0) <= (0 + (1 + ip^0))), par{ip^0 -> (1 + ip^0)}>
0.00/0.11	<l8, l8, ((1 + n^0) <= (0 + iq^0)) /\ ((0 + (1 + ip^0)) <= (0 + n^0)), par{ip^0 -> (1 + ip^0)}>
0.00/0.11	<l8, l8, ((0 + iq^0) <= (0 + n^0)), par{iq^0 -> (1 + iq^0)}>
0.00/0.11	<l25, l28, ((1 + n^0) <= (0 + ip^0)) /\ ((1 + __const_50^0) <= (0 + i^0))>
0.00/0.11	<l25, l28, ((1 + n^0) <= (0 + ip^0)) /\ ((0 + i^0) <= (0 + __const_50^0)) /\ ((0 + n^0) <= (0 + ip^0)) /\ ((0 + 0) <= 0) /\ (0 <= (0 + 0)), par{sm^0 -> 0}>
0.00/0.11	<l25, l25, ((0 + ip^0) <= (0 + n^0)) /\ (undef1471 = undef1471), par{ip^0 -> (1 + ip^0)}>
0.00/0.11	
0.00/0.11	Fresh variables:
0.00/0.11	undef31, undef32, undef208, undef210, undef216, undef217, undef226, undef228, undef234, undef237, undef248, undef320, undef368, undef386, undef387, undef417, undef661, undef662, undef754, undef755, undef787, undef803, undef1036, undef1192, undef1471, undef1627, undef1628, undef1711, undef1712, undef1795, undef1796, 
0.00/0.11	
0.00/0.11	Undef variables:
0.00/0.11	undef31, undef32, undef208, undef210, undef216, undef217, undef226, undef228, undef234, undef237, undef248, undef320, undef368, undef386, undef387, undef417, undef661, undef662, undef754, undef755, undef787, undef803, undef1036, undef1192, undef1471, undef1627, undef1628, undef1711, undef1712, undef1795, undef1796, 
0.00/0.11	
0.00/0.11	Abstraction variables:
0.00/0.11	
0.00/0.11	Exit nodes:
0.00/0.11	
0.00/0.11	Accepting locations:
0.00/0.11	
0.00/0.11	Asserts:
0.00/0.11	
0.00/0.11	*************************************************************
0.00/0.11	*******************************************************************************************
0.00/0.11	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
0.00/0.11	*******************************************************************************************
0.00/0.11	
0.00/0.11	Init Location: 0
0.00/0.11	Graph 0:
0.00/0.11	Transitions:
0.00/0.11	Variables:
0.00/0.11	
0.00/0.11	Graph 1:
0.00/0.11	Transitions:
0.00/0.11	<l8, l8, 1 + ip^0 <= n^0 /\ 1 + n^0 <= iq^0, {ip^0 -> 1 + ip^0, rest remain the same}>
0.00/0.11	<l8, l8, iq^0 <= n^0, {iq^0 -> 1 + iq^0, rest remain the same}>
0.00/0.11	Variables:
0.00/0.11	ip^0, iq^0, n^0
0.00/0.11	
0.00/0.11	Graph 2:
0.00/0.11	Transitions:
0.00/0.11	<l25, l25, ip^0 <= n^0, {ip^0 -> 1 + ip^0, rest remain the same}>
0.00/0.11	Variables:
0.00/0.11	ip^0, n^0
0.00/0.11	
0.00/0.11	Graph 3:
0.00/0.11	Transitions:
0.00/0.11	Variables:
0.00/0.11	
0.00/0.11	Precedence: 
0.00/0.11	Graph 0
0.00/0.11	
0.00/0.11	Graph 1
0.00/0.11	<l0, l8, ip^0 <= n^0, {all remain the same}>
0.00/0.11	
0.00/0.11	Graph 2
0.00/0.11	<l0, l25, 1 + n^0 <= ip^0, {all remain the same}>
0.00/0.11	<l8, l25, n^0 <= ip^0 /\ 1 + n^0 <= iq^0, {ip^0 -> 1 + ip^0, rest remain the same}>
0.00/0.11	
0.00/0.11	Graph 3
0.00/0.11	<l25, l28, 1 + __const_50^0 <= i^0 /\ 1 + n^0 <= ip^0, {all remain the same}>
0.00/0.11	<l25, l28, i^0 <= __const_50^0 /\ 1 + n^0 <= ip^0, {sm^0 -> 0, rest remain the same}>
0.00/0.11	
0.00/0.11	Map Locations to Subgraph:
0.00/0.11	( 0 , 0 )
0.00/0.11	( 8 , 1 )
0.00/0.11	( 25 , 2 )
0.00/0.11	( 28 , 3 )
0.00/0.11	
0.00/0.11	*******************************************************************************************
0.00/0.11	********************************    CHECKING ASSERTIONS    ********************************
0.00/0.11	*******************************************************************************************
0.00/0.11	
0.00/0.11	Proving termination of subgraph 0
0.00/0.11	Proving termination of subgraph 1
0.00/0.11	Checking unfeasibility...
0.00/0.11	Time used: 0.004343
0.00/0.11	
0.00/0.11	Checking conditional termination of SCC {l8}...
0.00/0.11	
0.00/0.11	LOG: CALL solveLinear
0.00/0.11	
0.00/0.11	LOG: RETURN solveLinear - Elapsed time: 0.002070s
0.00/0.11	Ranking function: -iq^0 + n^0
0.00/0.11	New Graphs: 
0.00/0.11	Transitions:
0.00/0.11	<l8, l8, 1 + ip^0 <= n^0 /\ 1 + n^0 <= iq^0, {ip^0 -> 1 + ip^0, rest remain the same}>
0.00/0.11	Variables:
0.00/0.11	ip^0, iq^0, n^0
0.00/0.11	Checking conditional termination of SCC {l8}...
0.00/0.11	
0.00/0.11	LOG: CALL solveLinear
0.00/0.11	
0.00/0.11	LOG: RETURN solveLinear - Elapsed time: 0.001300s
0.00/0.11	Ranking function: -1 - ip^0 + n^0
0.00/0.11	New Graphs: 
0.00/0.11	Proving termination of subgraph 2
0.00/0.11	Checking unfeasibility...
0.00/0.11	Time used: 0.00309
0.00/0.11	Some transition disabled by a set of invariant(s):
0.00/0.11	Invariant at l25: 1 + n^0 <= ip^0
0.00/0.11	
0.00/0.11	Strengthening and disabling transitions...
0.00/0.11	> It's unfeasible. Removing transition: 
0.00/0.11	<l25, l25, ip^0 <= n^0, {ip^0 -> 1 + ip^0, rest remain the same}>
0.00/0.11	Checking unfeasibility...
0.00/0.11	Time used: 8.1e-05
0.00/0.11	
0.00/0.11	Analyzing SCC {l25}...
0.00/0.11	No cycles found.
0.00/0.11	
0.00/0.11	Proving termination of subgraph 3
0.00/0.11	Analyzing SCC {l28}...
0.00/0.11	No cycles found.
0.00/0.11	
0.00/0.11	Program Terminates
0.00/0.11	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
0.00/0.11	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
0.00/0.11	EOF