1.07/1.10	NO
1.07/1.10	
1.07/1.10	Solver Timeout: 4
1.07/1.10	Global Timeout: 300
1.07/1.10	No parsing errors!
1.07/1.10	Init Location: 0
1.07/1.10	Transitions:
1.07/1.10	<l0, l8, true>
1.07/1.10	<l1, l2, true, par{j^0 -> (0 + i^0)}>
1.07/1.10	<l2, l3, true, par{i^0 -> (1 + i^0)}>
1.07/1.10	<l4, l1, (6 <= (0 + i^0))>
1.07/1.10	<l4, l1, ((1 + i^0) <= 5)>
1.07/1.10	<l4, l2, ((0 + i^0) <= 5) /\ (5 <= (0 + i^0)) /\ (undef9 = undef9), par{i^0 -> undef9}>
1.07/1.10	<l5, l6, (10 <= (0 + i^0))>
1.07/1.10	<l5, l4, ((1 + i^0) <= 10)>
1.07/1.10	<l3, l5, true>
1.07/1.10	<l7, l3, true, par{i^0 -> 0}>
1.07/1.10	<l8, l7, true>
1.07/1.10	
1.07/1.10	Fresh variables:
1.07/1.10	undef9, 
1.07/1.10	
1.07/1.10	Undef variables:
1.07/1.10	undef9, 
1.07/1.10	
1.07/1.10	Abstraction variables:
1.07/1.10	
1.07/1.10	Exit nodes:
1.07/1.10	
1.07/1.10	Accepting locations:
1.07/1.10	
1.07/1.10	Asserts:
1.07/1.10	
1.07/1.10	Preprocessed LLVMGraph
1.07/1.10	Init Location: 0
1.07/1.10	Transitions:
1.07/1.10	<l0, l3, (i^0 = 0)>
1.07/1.10	<l3, l6, (10 <= (0 + i^0))>
1.07/1.10	<l3, l3, ((1 + i^0) <= 10) /\ (6 <= (0 + i^0)), par{i^0 -> (1 + i^0)}>
1.07/1.10	<l3, l3, ((1 + i^0) <= 10) /\ ((1 + i^0) <= 5), par{i^0 -> (1 + i^0)}>
1.07/1.10	<l3, l3, ((1 + i^0) <= 10) /\ ((0 + i^0) <= 5) /\ (5 <= (0 + i^0)) /\ (undef9 = undef9), par{i^0 -> (1 + undef9)}>
1.07/1.10	
1.07/1.10	Fresh variables:
1.07/1.10	undef9, 
1.07/1.10	
1.07/1.10	Undef variables:
1.07/1.10	undef9, 
1.07/1.10	
1.07/1.10	Abstraction variables:
1.07/1.10	
1.07/1.10	Exit nodes:
1.07/1.10	
1.07/1.10	Accepting locations:
1.07/1.10	
1.07/1.10	Asserts:
1.07/1.10	
1.07/1.10	*************************************************************
1.07/1.10	*******************************************************************************************
1.07/1.10	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
1.07/1.10	*******************************************************************************************
1.07/1.10	
1.07/1.10	Init Location: 0
1.07/1.10	Graph 0:
1.07/1.10	Transitions:
1.07/1.10	Variables:
1.07/1.10	
1.07/1.10	Graph 1:
1.07/1.10	Transitions:
1.07/1.10	<l3, l3, 6 <= i^0 /\ i^0 <= 9, {i^0 -> 1 + i^0, rest remain the same}>
1.07/1.10	<l3, l3, i^0 <= 4, {i^0 -> 1 + i^0, rest remain the same}>
1.07/1.10	<l3, l3, i^0 = 5, {i^0 -> 1 + undef9, rest remain the same}>
1.07/1.10	Variables:
1.07/1.10	i^0
1.07/1.10	
1.07/1.10	Graph 2:
1.07/1.10	Transitions:
1.07/1.10	Variables:
1.07/1.10	
1.07/1.10	Precedence: 
1.07/1.10	Graph 0
1.07/1.10	
1.07/1.10	Graph 1
1.07/1.10	<l0, l3, i^0 = 0, {all remain the same}>
1.07/1.10	
1.07/1.10	Graph 2
1.07/1.10	<l3, l6, 10 <= i^0, {all remain the same}>
1.07/1.10	
1.07/1.10	Map Locations to Subgraph:
1.07/1.10	( 0 , 0 )
1.07/1.10	( 3 , 1 )
1.07/1.10	( 6 , 2 )
1.07/1.10	
1.07/1.10	*******************************************************************************************
1.07/1.10	********************************    CHECKING ASSERTIONS    ********************************
1.07/1.10	*******************************************************************************************
1.07/1.10	
1.07/1.10	Proving termination of subgraph 0
1.07/1.10	Proving termination of subgraph 1
1.07/1.10	Checking unfeasibility...
1.07/1.10	Time used: 0.010066
1.07/1.10	
1.07/1.10	Checking conditional termination of SCC {l3}...
1.07/1.10	
1.07/1.10	LOG: CALL solveLinear
1.07/1.10	
1.07/1.10	LOG: RETURN solveLinear - Elapsed time: 0.001040s
1.07/1.10	
1.07/1.10	LOG: CALL solveLinear
1.07/1.10	
1.07/1.10	LOG: RETURN solveLinear - Elapsed time: 0.003950s
1.07/1.10	Piecewise ranking function: min(117 - 13*i^0,52)
1.07/1.10	New Graphs: 
1.07/1.10	Transitions:
1.07/1.10	<l3, l3, i^0 <= 4, {i^0 -> 1 + i^0, rest remain the same}>
1.07/1.10	<l3, l3, i^0 = 5, {i^0 -> 1 + undef9, rest remain the same}>
1.07/1.10	Variables:
1.07/1.10	i^0
1.07/1.10	Checking conditional termination of SCC {l3}...
1.07/1.10	
1.07/1.10	LOG: CALL solveLinear
1.07/1.10	
1.07/1.10	LOG: RETURN solveLinear - Elapsed time: 0.000607s
1.07/1.10	
1.07/1.10	LOG: CALL solveLinear
1.07/1.10	
1.07/1.10	LOG: RETURN solveLinear - Elapsed time: 0.002464s
1.07/1.10	Trying to remove transition: <l3, l3, i^0 = 5, {i^0 -> 1 + undef9, rest remain the same}>
1.07/1.10	Solving with 1 template(s).
1.07/1.10	
1.07/1.10	LOG: CALL solveNonLinearGetFirstSolution
1.07/1.10	
1.07/1.10	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.038578s
1.07/1.10	Time used: 0.038408
1.07/1.10	Trying to remove transition: <l3, l3, i^0 <= 4, {i^0 -> 1 + i^0, rest remain the same}>
1.07/1.10	Solving with 1 template(s).
1.07/1.10	
1.07/1.10	LOG: CALL solveNonLinearGetFirstSolution
1.07/1.10	
1.07/1.10	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.013230s
1.07/1.10	Time used: 0.012693
1.07/1.10	Solving with 1 template(s).
1.07/1.10	
1.07/1.10	LOG: CALL solveNonLinearGetFirstSolution
1.07/1.10	
1.07/1.10	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.033610s
1.07/1.10	Time used: 0.03315
1.07/1.10	Solving with 2 template(s).
1.07/1.10	
1.07/1.10	LOG: CALL solveNonLinearGetFirstSolution
1.07/1.10	
1.07/1.10	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.205976s
1.07/1.10	Time used: 0.204553
1.07/1.10	Solving with 3 template(s).
1.07/1.10	
1.07/1.10	LOG: CALL solveNonLinearGetFirstSolution
1.07/1.10	
1.07/1.10	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.674891s
1.07/1.10	Time used: 0.669142
1.07/1.10	Solving with 1 template(s).
1.07/1.10	
1.07/1.10	LOG: CALL solveNonLinearGetFirstSolution
1.07/1.10	
1.07/1.10	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.041583s
1.07/1.10	Time used: 0.029542
1.07/1.10	Termination failed. Trying to show unreachability...
1.07/1.10	Proving unreachability of entry: <l0, l3, i^0 = 0, {all remain the same}>
1.07/1.10	
1.07/1.10	LOG: CALL check - Post:1 <= 0 - Process 1
1.07/1.10	* Exit transition: <l0, l3, i^0 = 0, {all remain the same}>
1.07/1.10	* Postcondition  : 1 <= 0
1.07/1.10	
1.07/1.10	LOG: CALL solveLinear
1.07/1.10	
1.07/1.10	LOG: RETURN solveLinear - Elapsed time: 0.001838s
1.07/1.10	> Postcondition is not implied!
1.07/1.10	
1.07/1.10	LOG: RETURN check - Elapsed time: 0.001925s
1.07/1.10	Cannot prove unreachability
1.07/1.10	
1.07/1.10	Proving non-termination of subgraph 1
1.07/1.10	Transitions:
1.07/1.10	<l3, l3, 6 <= i^0 /\ i^0 <= 9, {i^0 -> 1 + i^0, rest remain the same}>
1.07/1.10	<l3, l3, i^0 <= 4, {i^0 -> 1 + i^0, rest remain the same}>
1.07/1.10	<l3, l3, i^0 = 5, {i^0 -> 1 + undef9, rest remain the same}>
1.07/1.10	Variables:
1.07/1.10	i^0
1.07/1.10	
1.07/1.10	Checking conditional non-termination of SCC {l3}...
1.07/1.10	EXIT TRANSITIONS:
1.07/1.10	<l3, end, 10 <= i^0, {all remain the same}>
1.07/1.10	
1.07/1.10	Solving with 1 template(s).
1.07/1.10	
1.07/1.10	LOG: CALL solveNonLinearGetFirstSolution
1.07/1.10	
1.07/1.10	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.020626s
1.07/1.10	Time used: 0.020486
1.07/1.10	
1.07/1.10	LOG: SAT solveNonLinear - Elapsed time: 0.020626s
1.07/1.10	Cost: 0; Total time: 0.020486
1.07/1.10	Minimizing number of undef constraints...
1.07/1.10	
1.07/1.10	LOG: CALL solveNonLinear
1.07/1.10	
1.07/1.10	LOG: RETURN solveNonLinear - Elapsed time: 0.002980s
1.07/1.10	Number of undef constraints reduced!
1.07/1.10	
1.07/1.10	Non-termination implied by a set of quasi-invariant(s):
1.07/1.10	Quasi-invariant at l3: i^0 <= 5
1.07/1.10	Constraint over undef 'undef9 <= 0' in transition:
1.07/1.10	<l3, l3, i^0 = 5, {i^0 -> 1 + undef9, rest remain the same}>
1.07/1.10	
1.07/1.10	Strengthening and disabling EXIT transitions...
1.07/1.10	Closed exits from l3: 1
1.07/1.10	
1.07/1.10	Strengthening and disabling transitions...
1.07/1.10	
1.07/1.10	LOG: CALL solverLinear in Graph for feasibility
1.07/1.10	
1.07/1.10	LOG: RETURN solveLinear in Graph for feasibility
1.07/1.10	It's unfeasible. Removing transition: 
1.07/1.10	<l3, l3, 6 <= i^0 /\ i^0 <= 9, {i^0 -> 1 + i^0, rest remain the same}>
1.07/1.10	
1.07/1.10	LOG: CALL solverLinear in Graph for feasibility
1.07/1.10	
1.07/1.10	LOG: RETURN solveLinear in Graph for feasibility
1.07/1.10	Strengthening transition (result): 
1.07/1.10	<l3, l3, i^0 <= 4, {i^0 -> 1 + i^0, rest remain the same}>
1.07/1.10	
1.07/1.10	LOG: CALL solverLinear in Graph for feasibility
1.07/1.10	
1.07/1.10	LOG: RETURN solveLinear in Graph for feasibility
1.07/1.10	Strengthening transition (result): 
1.07/1.10	<l3, l3, undef9 <= 0 /\ i^0 = 5, {i^0 -> 1 + undef9, rest remain the same}>
1.07/1.10	
1.07/1.10	Calling reachability with...
1.07/1.10	Transition: <l3, end, true, {all remain the same}>
1.07/1.10	Conditions: i^0 <= 5, 
1.07/1.10	OPEN EXITS: 
1.07/1.10	<l3, end, i^0 <= 5, {all remain the same}>
1.07/1.10	
1.07/1.10	--- Reachability graph ---
1.07/1.10	> Graph without transitions.
1.07/1.10	
1.07/1.10	Calling reachability with...
1.07/1.10	Transition: <l0, l3, i^0 = 0, {all remain the same}>
1.07/1.10	Conditions: i^0 <= 5, 
1.07/1.10	OPEN EXITS: 
1.07/1.10	<l0, l3, i^0 = 0, {all remain the same}>
1.07/1.10	
1.07/1.10	> Conditions are reachable!
1.07/1.10	
1.07/1.10	Program does NOT terminate
1.07/1.10	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
1.07/1.10	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
1.07/1.10	EOF