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