23.17/23.24	NO
23.17/23.24	
23.17/23.24	Solver Timeout: 4
23.17/23.24	Global Timeout: 300
23.17/23.24	No parsing errors!
23.17/23.24	Init Location: 0
23.17/23.24	Transitions:
23.17/23.24	<l0, l8, true>
23.17/23.24	<l1, l2, ((1 + n_promoted_1^0) <= (0 + __const_1024^0)) /\ (undef5 = undef5), par{tmp___0^0 -> undef5}>
23.17/23.24	<l1, l2, ((0 + __const_1024^0) <= (0 + n_promoted_1^0))>
23.17/23.24	<l2, l3, true, par{i5^0 -> 0}>
23.17/23.24	<l4, l1, (1 <= (0 + n_promoted_1^0))>
23.17/23.24	<l4, l2, ((0 + n_promoted_1^0) <= 0)>
23.17/23.24	<l3, l5, true>
23.17/23.24	<l5, l6, true>
23.17/23.24	<l5, l3, true, par{i5^0 -> (1 + i5^0)}>
23.17/23.24	<l7, l4, (undef44 = undef44), par{n_promoted_1^0 -> (0 + undef44), tmp^0 -> undef44}>
23.17/23.24	<l8, l7, true>
23.17/23.24	
23.17/23.24	Fresh variables:
23.17/23.24	undef5, undef44, 
23.17/23.24	
23.17/23.24	Undef variables:
23.17/23.24	undef5, undef44, 
23.17/23.24	
23.17/23.24	Abstraction variables:
23.17/23.24	
23.17/23.24	Exit nodes:
23.17/23.24	
23.17/23.24	Accepting locations:
23.17/23.24	
23.17/23.24	Asserts:
23.17/23.24	
23.17/23.24	Preprocessed LLVMGraph
23.17/23.24	Init Location: 0
23.17/23.24	Transitions:
23.17/23.24	<l0, l3, (i5^0 = 0) /\ (undef44 = undef44) /\ (1 <= (0 + (0 + undef44))) /\ ((1 + (0 + undef44)) <= (0 + __const_1024^0)) /\ (undef5 = undef5)>
23.17/23.24	<l0, l3, (i5^0 = 0) /\ (undef44 = undef44) /\ (1 <= (0 + (0 + undef44))) /\ ((0 + __const_1024^0) <= (0 + (0 + undef44)))>
23.17/23.24	<l0, l3, (i5^0 = 0) /\ (undef44 = undef44) /\ ((0 + (0 + undef44)) <= 0)>
23.17/23.24	<l3, l6, true>
23.17/23.24	<l3, l3, true, par{i5^0 -> (1 + i5^0)}>
23.17/23.24	
23.17/23.24	Fresh variables:
23.17/23.24	undef5, undef44, 
23.17/23.24	
23.17/23.24	Undef variables:
23.17/23.24	undef5, undef44, 
23.17/23.24	
23.17/23.24	Abstraction variables:
23.17/23.24	
23.17/23.24	Exit nodes:
23.17/23.24	
23.17/23.24	Accepting locations:
23.17/23.24	
23.17/23.24	Asserts:
23.17/23.24	
23.17/23.24	*************************************************************
23.17/23.24	*******************************************************************************************
23.17/23.24	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
23.17/23.24	*******************************************************************************************
23.17/23.24	
23.17/23.24	Init Location: 0
23.17/23.24	Graph 0:
23.17/23.24	Transitions:
23.17/23.24	Variables:
23.17/23.24	
23.17/23.24	Graph 1:
23.17/23.24	Transitions:
23.17/23.24	<l3, l3, true, {i5^0 -> 1 + i5^0, rest remain the same}>
23.17/23.24	Variables:
23.17/23.24	i5^0
23.17/23.24	
23.17/23.24	Graph 2:
23.17/23.24	Transitions:
23.17/23.24	Variables:
23.17/23.24	
23.17/23.24	Precedence: 
23.17/23.24	Graph 0
23.17/23.24	
23.17/23.24	Graph 1
23.17/23.24	<l0, l3, 1 + undef44 <= __const_1024^0 /\ 1 <= undef44 /\ i5^0 = 0, {all remain the same}>
23.17/23.24	<l0, l3, 1 <= undef44 /\ __const_1024^0 <= undef44 /\ i5^0 = 0, {all remain the same}>
23.17/23.24	<l0, l3, undef44 <= 0 /\ i5^0 = 0, {all remain the same}>
23.17/23.24	
23.17/23.24	Graph 2
23.17/23.24	<l3, l6, true, {all remain the same}>
23.17/23.24	
23.17/23.24	Map Locations to Subgraph:
23.17/23.24	( 0 , 0 )
23.17/23.24	( 3 , 1 )
23.17/23.24	( 6 , 2 )
23.17/23.24	
23.17/23.24	*******************************************************************************************
23.17/23.24	********************************    CHECKING ASSERTIONS    ********************************
23.17/23.24	*******************************************************************************************
23.17/23.24	
23.17/23.24	Proving termination of subgraph 0
23.17/23.24	Proving termination of subgraph 1
23.17/23.24	Checking unfeasibility...
23.17/23.24	Time used: 0.00168
23.17/23.24	
23.17/23.24	Checking conditional termination of SCC {l3}...
23.17/23.24	
23.17/23.24	LOG: CALL solveLinear
23.17/23.24	
23.17/23.24	LOG: RETURN solveLinear - Elapsed time: 0.000479s
23.17/23.24	
23.17/23.24	LOG: CALL solveLinear
23.17/23.24	
23.17/23.24	LOG: RETURN solveLinear - Elapsed time: 0.000878s
23.17/23.24	Trying to remove transition: <l3, l3, true, {i5^0 -> 1 + i5^0, rest remain the same}>
23.17/23.24	Solving with 1 template(s).
23.17/23.24	
23.17/23.24	LOG: CALL solveNonLinearGetFirstSolution
23.17/23.24	
23.17/23.24	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.003046s
23.17/23.24	Time used: 0.002935
23.17/23.24	Solving with 1 template(s).
23.17/23.24	
23.17/23.24	LOG: CALL solveNonLinearGetFirstSolution
23.17/23.24	
23.17/23.24	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.001988s
23.17/23.24	Time used: 4.00116
23.17/23.24	Solving with 2 template(s).
23.17/23.24	
23.17/23.24	LOG: CALL solveNonLinearGetFirstSolution
23.17/23.24	
23.17/23.24	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.006882s
23.17/23.24	Time used: 4.00109
23.17/23.24	Solving with 3 template(s).
23.17/23.24	
23.17/23.24	LOG: CALL solveNonLinearGetFirstSolution
23.17/23.24	
23.17/23.24	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.037179s
23.17/23.24	Time used: 1.00072
23.17/23.24	Solving with 1 template(s).
23.17/23.24	
23.17/23.24	LOG: CALL solveNonLinearGetFirstSolution
23.17/23.24	
23.17/23.24	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008945s
23.17/23.24	Time used: 0.004523
23.17/23.24	Improving Solution with cost 1 ...
23.17/23.24	
23.17/23.24	LOG: CALL solveNonLinearGetNextSolution
23.17/23.24	
23.17/23.24	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000808s
23.17/23.24	Time used: 1.00072
23.17/23.24	
23.17/23.24	LOG: SAT solveNonLinear - Elapsed time: 1.009753s
23.17/23.24	Cost: 1; Total time: 1.00524
23.17/23.24	Termination implied by a set of invariant(s):
23.17/23.24	Invariant at l3: 0 <= i5^0
23.17/23.24	[ Invariant Graph ]
23.17/23.24	Strengthening and disabling transitions...
23.17/23.24	
23.17/23.24	LOG: CALL solverLinear in Graph for feasibility
23.17/23.24	
23.17/23.24	LOG: RETURN solveLinear in Graph for feasibility
23.17/23.24	Strengthening transition (result): 
23.17/23.24	<l3, l3, 0 <= i5^0, {i5^0 -> 1 + i5^0, rest remain the same}>
23.17/23.24	[ Termination Graph ]
23.17/23.24	Strengthening and disabling transitions...
23.17/23.24	
23.17/23.24	LOG: CALL solverLinear in Graph for feasibility
23.17/23.24	
23.17/23.24	LOG: RETURN solveLinear in Graph for feasibility
23.17/23.24	Strengthening transition (result): 
23.17/23.24	<l3, l3, 0 <= i5^0, {i5^0 -> 1 + i5^0, rest remain the same}>
23.17/23.24	Quasi-ranking function: 50000 - i5^0
23.17/23.24	New Graphs: 
23.17/23.24	Transitions:
23.17/23.24	<l3, l3, 50001 <= i5^0, {i5^0 -> 1 + i5^0, rest remain the same}>
23.17/23.24	Variables:
23.17/23.24	i5^0
23.17/23.24	Checking conditional termination of SCC {l3}...
23.17/23.24	
23.17/23.24	LOG: CALL solveLinear
23.17/23.24	
23.17/23.24	LOG: RETURN solveLinear - Elapsed time: 0.000417s
23.17/23.24	
23.17/23.24	LOG: CALL solveLinear
23.17/23.24	
23.17/23.24	LOG: RETURN solveLinear - Elapsed time: 0.001292s
23.17/23.24	Trying to remove transition: <l3, l3, 50001 <= i5^0, {i5^0 -> 1 + i5^0, rest remain the same}>
23.17/23.24	Solving with 1 template(s).
23.17/23.24	
23.17/23.24	LOG: CALL solveNonLinearGetFirstSolution
23.17/23.24	
23.17/23.24	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.004166s
23.17/23.24	Time used: 0.004038
23.17/23.24	Solving with 1 template(s).
23.17/23.24	
23.17/23.24	LOG: CALL solveNonLinearGetFirstSolution
23.17/23.24	
23.17/23.24	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.001885s
23.17/23.24	Time used: 4.00136
23.17/23.24	Solving with 2 template(s).
23.17/23.24	
23.17/23.24	LOG: CALL solveNonLinearGetFirstSolution
23.17/23.24	
23.17/23.24	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.005849s
23.17/23.24	Time used: 4.00105
23.17/23.24	Solving with 3 template(s).
23.17/23.24	
23.17/23.24	LOG: CALL solveNonLinearGetFirstSolution
23.17/23.24	
23.17/23.24	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.037896s
23.17/23.24	Time used: 1.001
23.17/23.24	Solving with 1 template(s).
23.17/23.24	
23.17/23.24	LOG: CALL solveNonLinearGetFirstSolution
23.17/23.24	
23.17/23.24	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.006261s
23.17/23.24	Time used: 4.00148
23.17/23.24	Termination failed. Trying to show unreachability...
23.17/23.24	Proving unreachability of entry: <l0, l3, 1 + undef44 <= __const_1024^0 /\ 1 <= undef44 /\ i5^0 = 0, {all remain the same}>
23.17/23.24	
23.17/23.24	LOG: CALL check - Post:1 <= 0 - Process 1
23.17/23.24	* Exit transition: <l0, l3, 1 + undef44 <= __const_1024^0 /\ 1 <= undef44 /\ i5^0 = 0, {all remain the same}>
23.17/23.24	* Postcondition  : 1 <= 0
23.17/23.24	
23.17/23.24	LOG: CALL solveLinear
23.17/23.24	
23.17/23.24	LOG: RETURN solveLinear - Elapsed time: 0.005717s
23.17/23.24	> Postcondition is not implied!
23.17/23.24	
23.17/23.24	LOG: RETURN check - Elapsed time: 0.005831s
23.17/23.24	Cannot prove unreachability
23.17/23.24	
23.17/23.24	Proving non-termination of subgraph 1
23.17/23.24	Transitions:
23.17/23.24	<l3, l3, true, {i5^0 -> 1 + i5^0, rest remain the same}>
23.17/23.24	Variables:
23.17/23.24	i5^0
23.17/23.24	
23.17/23.24	Checking conditional non-termination of SCC {l3}...
23.17/23.24	> No exit transition to close.
23.17/23.24	Calling reachability with...
23.17/23.24	Transition: <l3, end, true, {all remain the same}>
23.17/23.24	Conditions: 
23.17/23.24	Transition: <l3, end, true, {all remain the same}>
23.17/23.24	Conditions: 
23.17/23.24	Transition: <l3, end, true, {all remain the same}>
23.17/23.24	Conditions: 
23.17/23.24	OPEN EXITS: 
23.17/23.24	<l3, end, true, {all remain the same}>
23.17/23.24	<l3, end, true, {all remain the same}>
23.17/23.24	<l3, end, true, {all remain the same}>
23.17/23.24	
23.17/23.24	--- Reachability graph ---
23.17/23.24	> Graph without transitions.
23.17/23.24	
23.17/23.24	Calling reachability with...
23.17/23.24	Transition: <l0, l3, 1 + undef44 <= __const_1024^0 /\ 1 <= undef44 /\ i5^0 = 0, {all remain the same}>
23.17/23.24	Conditions: 
23.17/23.24	Transition: <l0, l3, 1 <= undef44 /\ __const_1024^0 <= undef44 /\ i5^0 = 0, {all remain the same}>
23.17/23.24	Conditions: 
23.17/23.24	Transition: <l0, l3, undef44 <= 0 /\ i5^0 = 0, {all remain the same}>
23.17/23.24	Conditions: 
23.17/23.24	Transition: <l0, l3, 1 + undef44 <= __const_1024^0 /\ 1 <= undef44 /\ i5^0 = 0, {all remain the same}>
23.17/23.24	Conditions: 
23.17/23.24	Transition: <l0, l3, 1 <= undef44 /\ __const_1024^0 <= undef44 /\ i5^0 = 0, {all remain the same}>
23.17/23.24	Conditions: 
23.17/23.24	Transition: <l0, l3, undef44 <= 0 /\ i5^0 = 0, {all remain the same}>
23.17/23.24	Conditions: 
23.17/23.24	Transition: <l0, l3, 1 + undef44 <= __const_1024^0 /\ 1 <= undef44 /\ i5^0 = 0, {all remain the same}>
23.17/23.24	Conditions: 
23.17/23.24	Transition: <l0, l3, 1 <= undef44 /\ __const_1024^0 <= undef44 /\ i5^0 = 0, {all remain the same}>
23.17/23.24	Conditions: 
23.17/23.24	Transition: <l0, l3, undef44 <= 0 /\ i5^0 = 0, {all remain the same}>
23.17/23.24	Conditions: 
23.17/23.24	OPEN EXITS: 
23.17/23.24	<l0, l3, 1 + undef44 <= __const_1024^0 /\ 1 <= undef44 /\ i5^0 = 0, {all remain the same}>
23.17/23.24	<l0, l3, 1 <= undef44 /\ __const_1024^0 <= undef44 /\ i5^0 = 0, {all remain the same}>
23.17/23.24	<l0, l3, undef44 <= 0 /\ i5^0 = 0, {all remain the same}>
23.17/23.24	<l0, l3, 1 + undef44 <= __const_1024^0 /\ 1 <= undef44 /\ i5^0 = 0, {all remain the same}>
23.17/23.24	<l0, l3, 1 <= undef44 /\ __const_1024^0 <= undef44 /\ i5^0 = 0, {all remain the same}>
23.17/23.24	<l0, l3, undef44 <= 0 /\ i5^0 = 0, {all remain the same}>
23.17/23.24	<l0, l3, 1 + undef44 <= __const_1024^0 /\ 1 <= undef44 /\ i5^0 = 0, {all remain the same}>
23.17/23.24	<l0, l3, 1 <= undef44 /\ __const_1024^0 <= undef44 /\ i5^0 = 0, {all remain the same}>
23.17/23.24	<l0, l3, undef44 <= 0 /\ i5^0 = 0, {all remain the same}>
23.17/23.24	
23.17/23.24	> Conditions are reachable!
23.17/23.24	
23.17/23.24	Program does NOT terminate
23.17/23.24	/export/starexec/sandbox2/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
23.17/23.24	/export/starexec/sandbox2/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
23.17/23.24	EOF