11.10/11.16	YES
11.10/11.16	
11.10/11.16	Solver Timeout: 4
11.10/11.16	Global Timeout: 300
11.10/11.16	No parsing errors!
11.10/11.16	Init Location: 0
11.10/11.16	Transitions:
11.10/11.16	<l0, l3, true>
11.10/11.16	<l1, l2, (undef3 > ~(1)) /\ (arg2 > 1) /\ (undef4 > ~(1)) /\ (arg1 > 0), par{arg1 -> (0 - undef4), arg2 -> (0 - undef3)}>
11.10/11.16	<l2, l2, (arg2 < arg1), par{arg1 -> (arg1 + 1), arg2 -> (arg2 + arg1)}>
11.10/11.16	<l3, l1, true, par{arg1 -> undef7, arg2 -> undef8}>
11.10/11.16	
11.10/11.16	Fresh variables:
11.10/11.16	undef3, undef4, undef7, undef8, 
11.10/11.16	
11.10/11.16	Undef variables:
11.10/11.16	undef3, undef4, undef7, undef8, 
11.10/11.16	
11.10/11.16	Abstraction variables:
11.10/11.16	
11.10/11.16	Exit nodes:
11.10/11.16	
11.10/11.16	Accepting locations:
11.10/11.16	
11.10/11.16	Asserts:
11.10/11.16	
11.10/11.16	Preprocessed LLVMGraph
11.10/11.16	Init Location: 0
11.10/11.16	Transitions:
11.10/11.16	<l0, l2, (arg1 = (0 - undef4)) /\ (arg2 = (0 - undef3)) /\ (undef3 > ~(1)) /\ (undef8 > 1) /\ (undef4 > ~(1)) /\ (undef7 > 0)>
11.10/11.16	<l2, l2, (arg2 < arg1), par{arg1 -> (arg1 + 1), arg2 -> (arg2 + arg1)}>
11.10/11.16	
11.10/11.16	Fresh variables:
11.10/11.16	undef3, undef4, undef7, undef8, 
11.10/11.16	
11.10/11.16	Undef variables:
11.10/11.16	undef3, undef4, undef7, undef8, 
11.10/11.16	
11.10/11.16	Abstraction variables:
11.10/11.16	
11.10/11.16	Exit nodes:
11.10/11.16	
11.10/11.16	Accepting locations:
11.10/11.16	
11.10/11.16	Asserts:
11.10/11.16	
11.10/11.16	*************************************************************
11.10/11.16	*******************************************************************************************
11.10/11.16	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
11.10/11.16	*******************************************************************************************
11.10/11.16	
11.10/11.16	Init Location: 0
11.10/11.16	Graph 0:
11.10/11.16	Transitions:
11.10/11.16	Variables:
11.10/11.16	
11.10/11.16	Graph 1:
11.10/11.16	Transitions:
11.10/11.16	<l2, l2, 1 + arg2 <= arg1, {arg1 -> 1 + arg1, arg2 -> arg1 + arg2, rest remain the same}>
11.10/11.16	Variables:
11.10/11.16	arg1, arg2
11.10/11.16	
11.10/11.16	Precedence: 
11.10/11.16	Graph 0
11.10/11.16	
11.10/11.16	Graph 1
11.10/11.16	<l0, l2, 1 <= undef7 /\ 0 <= undef3 /\ 0 <= undef4 /\ 2 <= undef8 /\ arg1 + undef4 = 0 /\ arg2 + undef3 = 0, {all remain the same}>
11.10/11.16	
11.10/11.16	Map Locations to Subgraph:
11.10/11.16	( 0 , 0 )
11.10/11.16	( 2 , 1 )
11.10/11.16	
11.10/11.16	*******************************************************************************************
11.10/11.16	********************************    CHECKING ASSERTIONS    ********************************
11.10/11.16	*******************************************************************************************
11.10/11.16	
11.10/11.16	Proving termination of subgraph 0
11.10/11.16	Proving termination of subgraph 1
11.10/11.16	Checking unfeasibility...
11.10/11.16	Time used: 0.002317
11.10/11.16	
11.10/11.16	Checking conditional termination of SCC {l2}...
11.10/11.16	
11.10/11.16	LOG: CALL solveLinear
11.10/11.16	
11.10/11.16	LOG: RETURN solveLinear - Elapsed time: 0.000599s
11.10/11.16	
11.10/11.16	LOG: CALL solveLinear
11.10/11.16	
11.10/11.16	LOG: RETURN solveLinear - Elapsed time: 0.001704s
11.10/11.16	Trying to remove transition: <l2, l2, 1 + arg2 <= arg1, {arg1 -> 1 + arg1, arg2 -> arg1 + arg2, rest remain the same}>
11.10/11.16	Solving with 1 template(s).
11.10/11.16	
11.10/11.16	LOG: CALL solveNonLinearGetFirstSolution
11.10/11.16	
11.10/11.16	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006566s
11.10/11.16	Time used: 0.006409
11.10/11.16	Solving with 1 template(s).
11.10/11.16	
11.10/11.16	LOG: CALL solveNonLinearGetFirstSolution
11.10/11.16	
11.10/11.16	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.007858s
11.10/11.16	Time used: 0.007494
11.10/11.16	Improving Solution with cost 1 ...
11.10/11.16	
11.10/11.16	LOG: CALL solveNonLinearGetNextSolution
11.10/11.16	
11.10/11.16	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.013485s
11.10/11.16	Time used: 1.01341
11.10/11.16	
11.10/11.16	LOG: SAT solveNonLinear - Elapsed time: 1.021343s
11.10/11.16	Cost: 1; Total time: 1.0209
11.10/11.16	Failed at location 2: arg1 <= arg2
11.10/11.16	Before Improving: 
11.10/11.16	Quasi-invariant at l2: arg1 <= arg2
11.10/11.16	Optimizing invariants...
11.10/11.16	
11.10/11.16	LOG: CALL solveLinear
11.10/11.16	
11.10/11.16	LOG: RETURN solveLinear - Elapsed time: 0.005236s
11.10/11.16	Remaining time after improvement: 0.998885
11.10/11.16	Termination implied by a set of quasi-invariant(s):
11.10/11.16	Quasi-invariant at l2: arg1 <= arg2
11.10/11.16	[ Invariant Graph ]
11.10/11.16	Strengthening and disabling transitions...
11.10/11.16	
11.10/11.16	LOG: CALL solverLinear in Graph for feasibility
11.10/11.16	
11.10/11.16	LOG: RETURN solveLinear in Graph for feasibility
11.10/11.16	It's unfeasible. Removing transition: 
11.10/11.16	<l2, l2, 1 + arg2 <= arg1, {arg1 -> 1 + arg1, arg2 -> arg1 + arg2, rest remain the same}>
11.10/11.16	[ Termination Graph ]
11.10/11.16	Strengthening and disabling transitions...
11.10/11.16	
11.10/11.16	LOG: CALL solverLinear in Graph for feasibility
11.10/11.16	
11.10/11.16	LOG: RETURN solveLinear in Graph for feasibility
11.10/11.16	It's unfeasible. Removing transition: 
11.10/11.16	<l2, l2, 1 + arg2 <= arg1, {arg1 -> 1 + arg1, arg2 -> arg1 + arg2, rest remain the same}>
11.10/11.16	New Graphs: 
11.10/11.16	Calling Safety with literal arg1 <= arg2 and entry <l0, l2, 1 <= undef7 /\ 0 <= undef3 /\ 0 <= undef4 /\ 2 <= undef8 /\ arg1 + undef4 = 0 /\ arg2 + undef3 = 0, {all remain the same}>
11.10/11.16	
11.10/11.16	LOG: CALL check - Post:arg1 <= arg2 - Process 1
11.10/11.16	* Exit transition: <l0, l2, 1 <= undef7 /\ 0 <= undef3 /\ 0 <= undef4 /\ 2 <= undef8 /\ arg1 + undef4 = 0 /\ arg2 + undef3 = 0, {all remain the same}>
11.10/11.16	* Postcondition  : arg1 <= arg2
11.10/11.16	
11.10/11.16	LOG: CALL solveLinear
11.10/11.16	
11.10/11.16	LOG: RETURN solveLinear - Elapsed time: 0.000558s
11.10/11.16	> Postcondition is not implied!
11.10/11.16	
11.10/11.16	LOG: RETURN check - Elapsed time: 0.000684s
11.10/11.16	INVARIANTS: 
11.10/11.16	2: 
11.10/11.16	Quasi-INVARIANTS to narrow Graph: 
11.10/11.16	2: arg1 <= arg2 , 
11.10/11.16	Narrowing transition: 
11.10/11.16	<l2, l2, 1 + arg2 <= arg1, {arg1 -> 1 + arg1, arg2 -> arg1 + arg2, rest remain the same}>
11.10/11.16	
11.10/11.16	LOG: Narrow transition size 1
11.10/11.16	invGraph after Narrowing: 
11.10/11.16	Transitions:
11.10/11.16	<l2, l2, 1 + arg2 <= arg1, {arg1 -> 1 + arg1, arg2 -> arg1 + arg2, rest remain the same}>
11.10/11.16	Variables:
11.10/11.16	arg1, arg2
11.10/11.16	Checking conditional termination of SCC {l2}...
11.10/11.16	
11.10/11.16	LOG: CALL solveLinear
11.10/11.16	
11.10/11.16	LOG: RETURN solveLinear - Elapsed time: 0.000528s
11.10/11.16	
11.10/11.16	LOG: CALL solveLinear
11.10/11.16	
11.10/11.16	LOG: RETURN solveLinear - Elapsed time: 0.001722s
11.10/11.16	Trying to remove transition: <l2, l2, 1 + arg2 <= arg1, {arg1 -> 1 + arg1, arg2 -> arg1 + arg2, rest remain the same}>
11.10/11.16	Solving with 1 template(s).
11.10/11.16	
11.10/11.16	LOG: CALL solveNonLinearGetFirstSolution
11.10/11.16	
11.10/11.16	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006120s
11.10/11.16	Time used: 0.005982
11.10/11.16	Solving with 1 template(s).
11.10/11.16	
11.10/11.16	LOG: CALL solveNonLinearGetFirstSolution
11.10/11.16	
11.10/11.16	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.002074s
11.10/11.16	Time used: 4.00155
11.10/11.16	Solving with 2 template(s).
11.10/11.16	
11.10/11.16	LOG: CALL solveNonLinearGetFirstSolution
11.10/11.16	
11.10/11.16	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.007592s
11.10/11.16	Time used: 4.00093
11.10/11.16	Solving with 3 template(s).
11.10/11.16	
11.10/11.16	LOG: CALL solveNonLinearGetFirstSolution
11.10/11.16	
11.10/11.16	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.005579s
11.10/11.16	Time used: 1.00067
11.10/11.16	Solving with 1 template(s).
11.10/11.16	
11.10/11.16	LOG: CALL solveNonLinearGetFirstSolution
11.10/11.16	
11.10/11.16	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.011600s
11.10/11.16	Time used: 0.008326
11.10/11.16	Improving Solution with cost 1 ...
11.10/11.16	
11.10/11.16	LOG: CALL solveNonLinearGetNextSolution
11.10/11.16	
11.10/11.16	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.001439s
11.10/11.16	Time used: 1.00138
11.10/11.16	
11.10/11.16	LOG: SAT solveNonLinear - Elapsed time: 1.013039s
11.10/11.16	Cost: 1; Total time: 1.00971
11.10/11.16	Quasi-ranking function: 50000 - arg1
11.10/11.16	New Graphs: 
11.10/11.16	Transitions:
11.10/11.16	<l2, l2, 1 + arg2 <= arg1 /\ 50001 <= arg1, {arg1 -> 1 + arg1, arg2 -> arg1 + arg2, rest remain the same}>
11.10/11.16	Variables:
11.10/11.16	arg1, arg2
11.10/11.16	Checking conditional termination of SCC {l2}...
11.10/11.16	
11.10/11.16	LOG: CALL solveLinear
11.10/11.16	
11.10/11.16	LOG: RETURN solveLinear - Elapsed time: 0.000892s
11.10/11.16	Ranking function: (~(1) / 50000) + (1 / 50000)*arg1 + (~(1) / 50000)*arg2
11.10/11.16	New Graphs: 
11.10/11.16	Program Terminates
11.10/11.16	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
11.10/11.16	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
11.10/11.16	EOF