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	<l4, l5, true>
0.00/0.11	<l6, l7, (0 <= (0 + theta^0))>
0.00/0.11	<l6, l7, ((1 + theta^0) <= 0), par{t^0 -> (0 + (~(1) * t^0))}>
0.00/0.11	<l8, l6, (undef154 = undef154) /\ (undef160 = undef160) /\ (undef161 = undef161) /\ (undef152 = undef152), par{t^0 -> undef152, theta^0 -> undef154, tmp___2^0 -> undef160, tmp___3^0 -> undef161}>
0.00/0.11	<l7, l3, (undef192 = undef192) /\ (undef170 = undef170) /\ (undef178 = undef178) /\ (undef181 = undef181) /\ (undef172 = undef172), par{c^0 -> undef170, h^0 -> undef172, s^0 -> undef178, tau^0 -> undef181, tmp___6^0 -> undef192}>
0.00/0.11	<l9, l10, true>
0.00/0.11	<l11, l8, ((1 + tmp___5^0) <= ((0 + g^0) + tmp___4^0))>
0.00/0.11	<l11, l8, (((1 + g^0) + tmp___4^0) <= (0 + tmp___5^0))>
0.00/0.11	<l11, l7, (((0 + g^0) + tmp___4^0) <= (0 + tmp___5^0)) /\ ((0 + tmp___5^0) <= ((0 + g^0) + tmp___4^0)) /\ (undef292 = undef292), par{t^0 -> undef292}>
0.00/0.11	<l12, l13, ((0 + tmp___7^0) <= (0 + tresh^0))>
0.00/0.11	<l12, l11, ((1 + tresh^0) <= (0 + tmp___7^0)) /\ (undef340 = undef340) /\ (undef358 = undef358) /\ (undef359 = undef359), par{h^0 -> undef340, tmp___4^0 -> undef358, tmp___5^0 -> undef359}>
0.00/0.11	<l14, l12, (undef389 = undef389), par{tmp___7^0 -> undef389}>
0.00/0.11	<l15, l14, true>
0.00/0.11	<l16, l14, true>
0.00/0.11	<l13, l17, true, par{iq^0 -> (1 + iq^0)}>
0.00/0.11	<l17, l18, true>
0.00/0.11	<l19, l16, ((1 + tmp___11^0) <= ((0 + g^0) + tmp___10^0))>
0.00/0.11	<l19, l16, (((1 + g^0) + tmp___10^0) <= (0 + tmp___11^0))>
0.00/0.11	<l19, l13, (((0 + g^0) + tmp___10^0) <= (0 + tmp___11^0)) /\ ((0 + tmp___11^0) <= ((0 + g^0) + tmp___10^0))>
0.00/0.11	<l20, l15, ((1 + tmp___9^0) <= ((0 + g^0) + tmp___8^0))>
0.00/0.11	<l20, l15, (((1 + g^0) + tmp___8^0) <= (0 + tmp___9^0))>
0.00/0.11	<l20, l19, (((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	<l21, l14, ((0 + i^0) <= 4)>
0.00/0.11	<l21, l20, (5 <= (0 + i^0)) /\ (undef726 = undef726) /\ (undef727 = undef727), par{tmp___8^0 -> undef726, tmp___9^0 -> undef727}>
0.00/0.11	<l3, l1, true>
0.00/0.11	<l18, l9, ((1 + n^0) <= (0 + iq^0)), par{ip^0 -> (1 + ip^0)}>
0.00/0.11	<l18, l21, ((0 + iq^0) <= (0 + n^0)) /\ (undef803 = undef803) /\ (undef787 = undef787), par{g^0 -> undef787, tmp___1^0 -> undef803}>
0.00/0.11	<l10, l22, ((0 + n^0) <= (0 + ip^0))>
0.00/0.11	<l10, l17, ((0 + ip^0) <= (~(1) + n^0))>
0.00/0.11	<l23, l9, (4 <= (0 + i^0)), par{tresh^0 -> 0}>
0.00/0.11	<l23, l9, ((1 + i^0) <= 4) /\ (undef924 = undef924), par{tresh^0 -> undef924}>
0.00/0.11	<l2, l24, true>
0.00/0.11	<l25, l23, (1 <= (0 + sm^0))>
0.00/0.11	<l25, l23, ((1 + sm^0) <= 0)>
0.00/0.11	<l25, l26, ((0 + sm^0) <= 0) /\ (0 <= (0 + sm^0))>
0.00/0.11	<l5, l27, ((1 + n^0) <= (0 + iq^0)), par{ip^0 -> (1 + ip^0)}>
0.00/0.11	<l5, l4, ((0 + iq^0) <= (0 + n^0)) /\ (undef1080 = undef1080), par{iq^0 -> (1 + iq^0), sm^0 -> ((0 + sm^0) + undef1080), tmp___0^0 -> undef1080}>
0.00/0.11	<l28, l29, true>
0.00/0.11	<l30, l25, ((0 + n^0) <= (0 + ip^0))>
0.00/0.11	<l30, l4, ((0 + ip^0) <= (~(1) + n^0))>
0.00/0.11	<l31, l26, ((1 + __const_50^0) <= (0 + i^0))>
0.00/0.11	<l31, l27, ((0 + i^0) <= (0 + __const_50^0)), par{sm^0 -> 0}>
0.00/0.11	<l32, l33, true>
0.00/0.11	<l34, l35, ((1 + n^0) <= (0 + ip^0))>
0.00/0.11	<l34, l36, ((0 + ip^0) <= (0 + n^0)) /\ (undef1303 = undef1303), par{ip^0 -> (1 + ip^0), tmp^0 -> undef1303}>
0.00/0.11	<l22, l37, true>
0.00/0.11	<l38, l39, ((1 + n^0) <= (0 + iq^0)), par{ip^0 -> (1 + ip^0)}>
0.00/0.11	<l38, l40, ((0 + iq^0) <= (0 + n^0)), par{iq^0 -> (1 + iq^0)}>
0.00/0.11	<l41, l36, ((1 + n^0) <= (0 + ip^0))>
0.00/0.11	<l41, l40, ((0 + ip^0) <= (0 + n^0))>
0.00/0.11	<l39, l41, true>
0.00/0.11	<l37, l35, ((1 + n^0) <= (0 + ip^0)), par{i^0 -> (1 + i^0)}>
0.00/0.11	<l37, l22, ((0 + ip^0) <= (0 + n^0)), par{ip^0 -> (1 + ip^0)}>
0.00/0.11	<l40, l38, true>
0.00/0.11	<l33, l13, ((1 + n^0) <= (0 + j^0))>
0.00/0.11	<l33, l32, ((0 + j^0) <= (0 + n^0)) /\ (undef1599 = undef1599) /\ (undef1600 = undef1600), par{g^0 -> undef1599, h^0 -> undef1600, j^0 -> (1 + j^0)}>
0.00/0.11	<l36, l34, true>
0.00/0.11	<l29, l32, ((1 + n^0) <= (0 + j^0))>
0.00/0.11	<l29, l28, ((0 + j^0) <= (0 + n^0)) /\ (undef1683 = undef1683) /\ (undef1684 = undef1684), par{g^0 -> undef1683, h^0 -> undef1684, j^0 -> (1 + j^0)}>
0.00/0.11	<l35, l31, true>
0.00/0.11	<l24, l28, ((0 + iq^0) <= (0 + j^0))>
0.00/0.11	<l24, l2, ((0 + j^0) <= (~(1) + iq^0)) /\ (undef1767 = undef1767) /\ (undef1768 = undef1768), par{g^0 -> undef1767, h^0 -> undef1768, j^0 -> (1 + j^0)}>
0.00/0.11	<l27, l30, true>
0.00/0.11	<l42, l39, true>
0.00/0.11	<l43, l42, true>
0.00/0.11	
0.00/0.11	Fresh variables:
0.00/0.11	undef31, undef32, undef152, undef154, undef160, undef161, undef170, undef172, undef178, undef181, undef192, undef292, undef340, undef358, undef359, undef389, undef661, undef662, undef726, undef727, undef787, undef803, undef924, undef1080, undef1303, undef1599, undef1600, undef1683, undef1684, undef1767, undef1768, 
0.00/0.11	
0.00/0.11	Undef variables:
0.00/0.11	undef31, undef32, undef152, undef154, undef160, undef161, undef170, undef172, undef178, undef181, undef192, undef292, undef340, undef358, undef359, undef389, undef661, undef662, undef726, undef727, undef787, undef803, undef924, undef1080, undef1303, undef1599, undef1600, undef1683, undef1684, undef1767, undef1768, 
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, l36, ((1 + n^0) <= (0 + ip^0))>
0.00/0.11	<l0, l40, ((0 + ip^0) <= (0 + n^0))>
0.00/0.11	<l36, l26, ((1 + n^0) <= (0 + ip^0)) /\ ((1 + __const_50^0) <= (0 + i^0))>
0.00/0.11	<l36, l26, ((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	<l36, l36, ((0 + ip^0) <= (0 + n^0)) /\ (undef1303 = undef1303), par{ip^0 -> (1 + ip^0)}>
0.00/0.11	<l40, l36, ((1 + n^0) <= (0 + iq^0)) /\ ((1 + n^0) <= (0 + (1 + ip^0))), par{ip^0 -> (1 + ip^0)}>
0.00/0.11	<l40, l40, ((1 + n^0) <= (0 + iq^0)) /\ ((0 + (1 + ip^0)) <= (0 + n^0)), par{ip^0 -> (1 + ip^0)}>
0.00/0.11	<l40, l40, ((0 + iq^0) <= (0 + n^0)), par{iq^0 -> (1 + iq^0)}>
0.00/0.11	
0.00/0.11	Fresh variables:
0.00/0.11	undef31, undef32, undef152, undef154, undef160, undef161, undef170, undef172, undef178, undef181, undef192, undef292, undef340, undef358, undef359, undef389, undef661, undef662, undef726, undef727, undef787, undef803, undef924, undef1080, undef1303, undef1599, undef1600, undef1683, undef1684, undef1767, undef1768, 
0.00/0.11	
0.00/0.11	Undef variables:
0.00/0.11	undef31, undef32, undef152, undef154, undef160, undef161, undef170, undef172, undef178, undef181, undef192, undef292, undef340, undef358, undef359, undef389, undef661, undef662, undef726, undef727, undef787, undef803, undef924, undef1080, undef1303, undef1599, undef1600, undef1683, undef1684, undef1767, undef1768, 
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	<l40, l40, 1 + ip^0 <= n^0 /\ 1 + n^0 <= iq^0, {ip^0 -> 1 + ip^0, rest remain the same}>
0.00/0.11	<l40, l40, 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	<l36, l36, 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, l40, ip^0 <= n^0, {all remain the same}>
0.00/0.11	
0.00/0.11	Graph 2
0.00/0.11	<l0, l36, 1 + n^0 <= ip^0, {all remain the same}>
0.00/0.11	<l40, l36, 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	<l36, l26, 1 + __const_50^0 <= i^0 /\ 1 + n^0 <= ip^0, {all remain the same}>
0.00/0.11	<l36, l26, 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	( 26 , 3 )
0.00/0.11	( 36 , 2 )
0.00/0.11	( 40 , 1 )
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.004152
0.00/0.11	
0.00/0.11	Checking conditional termination of SCC {l40}...
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.002032s
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	<l40, l40, 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 {l40}...
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.001307s
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.003095
0.00/0.11	Some transition disabled by a set of invariant(s):
0.00/0.11	Invariant at l36: 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	<l36, l36, 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 {l36}...
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 {l26}...
0.00/0.11	No cycles found.
0.00/0.11	
0.00/0.11	Program Terminates
0.00/0.11	/export/starexec/sandbox2/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
0.00/0.11	/export/starexec/sandbox2/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
0.00/0.11	EOF