1.01/1.08	NO
1.01/1.08	
1.01/1.08	Solver Timeout: 4
1.01/1.08	Global Timeout: 300
1.01/1.08	No parsing errors!
1.01/1.08	Init Location: 0
1.01/1.08	Transitions:
1.01/1.08	<l0, l3, true>
1.01/1.08	<l1, l2, true, par{arg1 -> 0}>
1.01/1.08	<l2, l2, (arg1 < 11) /\ (arg1 < 20), par{arg1 -> (arg1 + 1)}>
1.01/1.08	<l2, l2, (arg1 > 10) /\ (arg1 < 20)>
1.01/1.08	<l3, l1, true, par{arg1 -> undef4}>
1.01/1.08	
1.01/1.08	Fresh variables:
1.01/1.08	undef4, 
1.01/1.08	
1.01/1.08	Undef variables:
1.01/1.08	undef4, 
1.01/1.08	
1.01/1.08	Abstraction variables:
1.01/1.08	
1.01/1.08	Exit nodes:
1.01/1.08	
1.01/1.08	Accepting locations:
1.01/1.08	
1.01/1.08	Asserts:
1.01/1.08	
1.01/1.08	Preprocessed LLVMGraph
1.01/1.08	Init Location: 0
1.01/1.08	Transitions:
1.01/1.08	<l0, l2, (arg1 = 0)>
1.01/1.08	<l2, l2, (arg1 < 11) /\ (arg1 < 20), par{arg1 -> (arg1 + 1)}>
1.01/1.08	<l2, l2, (arg1 > 10) /\ (arg1 < 20)>
1.01/1.08	
1.01/1.08	Fresh variables:
1.01/1.08	undef4, 
1.01/1.08	
1.01/1.08	Undef variables:
1.01/1.08	undef4, 
1.01/1.08	
1.01/1.08	Abstraction variables:
1.01/1.08	
1.01/1.08	Exit nodes:
1.01/1.08	
1.01/1.08	Accepting locations:
1.01/1.08	
1.01/1.08	Asserts:
1.01/1.08	
1.01/1.08	*************************************************************
1.01/1.08	*******************************************************************************************
1.01/1.08	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
1.01/1.08	*******************************************************************************************
1.01/1.08	
1.01/1.08	Init Location: 0
1.01/1.08	Graph 0:
1.01/1.08	Transitions:
1.01/1.08	Variables:
1.01/1.08	
1.01/1.08	Graph 1:
1.01/1.08	Transitions:
1.01/1.08	<l2, l2, arg1 <= 10, {arg1 -> 1 + arg1, rest remain the same}>
1.01/1.08	<l2, l2, 11 <= arg1 /\ arg1 <= 19, {all remain the same}>
1.01/1.08	Variables:
1.01/1.08	arg1
1.01/1.08	
1.01/1.08	Precedence: 
1.01/1.08	Graph 0
1.01/1.08	
1.01/1.08	Graph 1
1.01/1.08	<l0, l2, arg1 = 0, {all remain the same}>
1.01/1.08	
1.01/1.08	Map Locations to Subgraph:
1.01/1.08	( 0 , 0 )
1.01/1.08	( 2 , 1 )
1.01/1.08	
1.01/1.08	*******************************************************************************************
1.01/1.08	********************************    CHECKING ASSERTIONS    ********************************
1.01/1.08	*******************************************************************************************
1.01/1.08	
1.01/1.08	Proving termination of subgraph 0
1.01/1.08	Proving termination of subgraph 1
1.01/1.08	Checking unfeasibility...
1.01/1.08	Time used: 0.009265
1.01/1.08	
1.01/1.08	Checking conditional termination of SCC {l2}...
1.01/1.08	
1.01/1.08	LOG: CALL solveLinear
1.01/1.08	
1.01/1.08	LOG: RETURN solveLinear - Elapsed time: 0.000641s
1.01/1.08	Ranking function: 10 - arg1
1.01/1.08	New Graphs: 
1.01/1.08	Transitions:
1.01/1.08	<l2, l2, 11 <= arg1 /\ arg1 <= 19, {all remain the same}>
1.01/1.08	Variables:
1.01/1.08	arg1
1.01/1.08	> No variable changes in termination graph.
1.01/1.08	Checking conditional unfeasibility...
1.01/1.08	Calling Safety with literal 20 <= arg1 and entry <l2, l2, true, {all remain the same}>
1.01/1.08	
1.01/1.08	LOG: CALL check - Post:20 <= arg1 - Process 1
1.01/1.08	* Exit transition: <l2, l2, true, {all remain the same}>
1.01/1.08	* Postcondition  : 20 <= arg1
1.01/1.08	Quasi-invariants: 
1.01/1.08	Location 2: 20 <= arg1 ; 
1.01/1.08	Postcondition: 20 <= arg1
1.01/1.08	
1.01/1.08	LOG: CALL check - Post:20 <= arg1 - Process 2
1.01/1.08	* Exit transition: <l0, l2, arg1 = 0, {all remain the same}>
1.01/1.08	* Postcondition  : 20 <= arg1
1.01/1.08	
1.01/1.08	LOG: CALL solveLinear
1.01/1.08	
1.01/1.08	LOG: RETURN solveLinear - Elapsed time: 0.000254s
1.01/1.08	> Postcondition is not implied!
1.01/1.08	
1.01/1.08	LOG: RETURN check - Elapsed time: 0.000324s
1.01/1.08	
1.01/1.08	LOG: NarrowEntry size 1
1.01/1.08	Narrowing transition: 
1.01/1.08	<l2, l2, arg1 <= 10, {arg1 -> 1 + arg1, rest remain the same}>
1.01/1.08	
1.01/1.08	LOG: Narrow transition size 1
1.01/1.08	Narrowing transition: 
1.01/1.08	<l2, l2, 11 <= arg1 /\ arg1 <= 19, {all remain the same}>
1.01/1.08	
1.01/1.08	LOG: Narrow transition size 1
1.01/1.08	ENTRIES:
1.01/1.08	<l0, l2, arg1 = 0, {all remain the same}>
1.01/1.08	END ENTRIES:
1.01/1.08	GRAPH:
1.01/1.08	<l2, l2, arg1 <= 10, {arg1 -> 1 + arg1, rest remain the same}>
1.01/1.08	<l2, l2, 11 <= arg1 /\ arg1 <= 19, {all remain the same}>
1.01/1.08	END GRAPH:
1.01/1.08	EXIT: <l2, l2, true, {all remain the same}>
1.01/1.08	POST: 20 <= arg1
1.01/1.08	
1.01/1.08	
1.01/1.08	LOG: Try proving POST
1.01/1.08	Solving with 1 template(s).
1.01/1.08	
1.01/1.08	LOG: CALL solveNonLinearGetFirstSolution
1.01/1.08	
1.01/1.08	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.016805s
1.01/1.08	Time used: 0.016706
1.01/1.08	Solving with 2 template(s).
1.01/1.08	
1.01/1.08	LOG: CALL solveNonLinearGetFirstSolution
1.01/1.08	
1.01/1.08	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.159937s
1.01/1.08	Time used: 0.159358
1.01/1.08	Solving with 3 template(s).
1.01/1.08	
1.01/1.08	LOG: CALL solveNonLinearGetFirstSolution
1.01/1.08	
1.01/1.08	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.809634s
1.01/1.08	Time used: 0.806347
1.01/1.08	
1.01/1.08	LOG: Postcondition is not implied - no solution
1.01/1.08	> Postcondition is not implied!
1.01/1.08	
1.01/1.08	LOG: RETURN check - Elapsed time: 0.992378s
1.01/1.08	
1.01/1.08	Proving non-termination of subgraph 1
1.01/1.08	Transitions:
1.01/1.08	<l2, l2, arg1 <= 10, {arg1 -> 1 + arg1, rest remain the same}>
1.01/1.08	<l2, l2, 11 <= arg1 /\ arg1 <= 19, {all remain the same}>
1.01/1.08	Variables:
1.01/1.08	arg1
1.01/1.08	
1.01/1.08	Checking conditional non-termination of SCC {l2}...
1.01/1.08	EXIT TRANSITIONS:
1.01/1.08	<l2, end, 20 <= arg1, {all remain the same}>
1.01/1.08	
1.01/1.08	Solving with 1 template(s).
1.01/1.08	
1.01/1.08	LOG: CALL solveNonLinearGetFirstSolution
1.01/1.08	
1.01/1.08	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.018558s
1.01/1.08	Time used: 0.018459
1.01/1.08	
1.01/1.08	LOG: SAT solveNonLinear - Elapsed time: 0.018558s
1.01/1.08	Cost: 0; Total time: 0.018459
1.01/1.08	Non-termination implied by a set of quasi-invariant(s):
1.01/1.08	Quasi-invariant at l2: arg1 <= 11
1.01/1.08	
1.01/1.08	Strengthening and disabling EXIT transitions...
1.01/1.08	Closed exits from l2: 1
1.01/1.08	
1.01/1.08	Strengthening and disabling transitions...
1.01/1.08	
1.01/1.08	LOG: CALL solverLinear in Graph for feasibility
1.01/1.08	
1.01/1.08	LOG: RETURN solveLinear in Graph for feasibility
1.01/1.08	Strengthening transition (result): 
1.01/1.08	<l2, l2, arg1 <= 10, {arg1 -> 1 + arg1, rest remain the same}>
1.01/1.08	
1.01/1.08	LOG: CALL solverLinear in Graph for feasibility
1.01/1.08	
1.01/1.08	LOG: RETURN solveLinear in Graph for feasibility
1.01/1.08	Strengthening transition (result): 
1.01/1.08	<l2, l2, arg1 = 11, {all remain the same}>
1.01/1.08	
1.01/1.08	Calling reachability with...
1.01/1.08	Transition: <l2, end, true, {all remain the same}>
1.01/1.08	Conditions: arg1 <= 11, 
1.01/1.08	OPEN EXITS: 
1.01/1.08	<l2, end, arg1 <= 11, {all remain the same}>
1.01/1.08	
1.01/1.08	--- Reachability graph ---
1.01/1.08	> Graph without transitions.
1.01/1.08	
1.01/1.08	Calling reachability with...
1.01/1.08	Transition: <l0, l2, arg1 = 0, {all remain the same}>
1.01/1.08	Conditions: arg1 <= 11, 
1.01/1.08	OPEN EXITS: 
1.01/1.08	<l0, l2, arg1 = 0, {all remain the same}>
1.01/1.08	
1.01/1.08	> Conditions are reachable!
1.01/1.08	
1.01/1.08	Program does NOT terminate
1.01/1.08	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
1.01/1.08	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
1.01/1.08	EOF