unknown

Initial ITS

Start location: __init
Program variables: arg1 arg2
   0: f1_0_main_Load -> f160_0_main_LE : arg1'=arg1p1, arg2'=arg2p1, (1-arg2p1 == 0 /\ arg1 > 0 /\ 1+arg2 > 0 /\ 1+arg1p1 > 0), cost: 1
   1: f160_0_main_LE -> f160_0_main_LE : arg1'=arg1p2, arg2'=arg2p2, (-101+arg1 < 0 /\ 11+arg1-arg1p2 == 0 /\ arg2 > 0 /\ 1-arg2p2+arg2 == 0), cost: 1
   2: f160_0_main_LE -> f160_0_main_LE : arg1'=arg1p3, arg2'=arg2p3, (-10+arg1-arg1p3 == 0 /\ -1+arg2-arg2p3 == 0 /\ -100+arg1 > 0 /\ arg2 > 0), cost: 1
   3: __init -> f1_0_main_Load : arg1'=arg1p4, arg2'=arg2p4, T, cost: 1

Chained Linear Paths

Start location: __init
Program variables: arg1 arg2
   1: f160_0_main_LE -> f160_0_main_LE : arg1'=arg1p2, arg2'=arg2p2, (-101+arg1 < 0 /\ 11+arg1-arg1p2 == 0 /\ arg2 > 0 /\ 1-arg2p2+arg2 == 0), cost: 1
   2: f160_0_main_LE -> f160_0_main_LE : arg1'=arg1p3, arg2'=arg2p3, (-10+arg1-arg1p3 == 0 /\ -1+arg2-arg2p3 == 0 /\ -100+arg1 > 0 /\ arg2 > 0), cost: 1
   4: __init -> f160_0_main_LE : arg1'=arg1p1, arg2'=arg2p1, (1-arg2p1 == 0 /\ 1+arg2p4 > 0 /\ arg1p4 > 0 /\ 1+arg1p1 > 0), cost: 1

	Eliminating location f1_0_main_Load by chaining:

	Applied chaining

	First rule:
	__init -> f1_0_main_Load : arg1'=arg1p4, arg2'=arg2p4, T, cost: 1
	Second rule:
	f1_0_main_Load -> f160_0_main_LE : arg1'=arg1p1, arg2'=arg2p1, (1-arg2p1 == 0 /\ arg1 > 0 /\ 1+arg2 > 0 /\ 1+arg1p1 > 0), cost: 1
	New rule:
	__init -> f160_0_main_LE : arg1'=arg1p1, arg2'=arg2p1, (1-arg2p1 == 0 /\ 1+arg2p4 > 0 /\ arg1p4 > 0 /\ 1+arg1p1 > 0), cost: 1
	
	Applied deletion

	Removed the following rules: 0 3

Simplified Transitions

Start location: __init
Program variables: arg1 arg2
   5: f160_0_main_LE -> f160_0_main_LE : arg1'=11+arg1, arg2'=1+arg2, (-101+arg1 < 0 /\ arg2 > 0), cost: 1
   6: f160_0_main_LE -> f160_0_main_LE : arg1'=-10+arg1, arg2'=-1+arg2, (-100+arg1 > 0 /\ arg2 > 0), cost: 1
   7: __init -> f160_0_main_LE : arg1'=arg1p1, arg2'=1, (1+arg1p1 > 0), cost: 1

	Propagated Equalities

	Original rule:
	f160_0_main_LE -> f160_0_main_LE : arg1'=arg1p2, arg2'=arg2p2, (-101+arg1 < 0 /\ 11+arg1-arg1p2 == 0 /\ arg2 > 0 /\ 1-arg2p2+arg2 == 0), cost: 1
	New rule:
	f160_0_main_LE -> f160_0_main_LE : arg1'=11+arg1, arg2'=1+arg2, (0 == 0 /\ -101+arg1 < 0 /\ arg2 > 0), cost: 1
	
		propagated equality arg1p2 = 11+arg1
		
		propagated equality arg2p2 = 1+arg2
		
	Simplified Guard

	Original rule:
	f160_0_main_LE -> f160_0_main_LE : arg1'=11+arg1, arg2'=1+arg2, (0 == 0 /\ -101+arg1 < 0 /\ arg2 > 0), cost: 1
	New rule:
	f160_0_main_LE -> f160_0_main_LE : arg1'=11+arg1, arg2'=1+arg2, (-101+arg1 < 0 /\ arg2 > 0), cost: 1
	
	Propagated Equalities

	Original rule:
	f160_0_main_LE -> f160_0_main_LE : arg1'=arg1p3, arg2'=arg2p3, (-10+arg1-arg1p3 == 0 /\ -1+arg2-arg2p3 == 0 /\ -100+arg1 > 0 /\ arg2 > 0), cost: 1
	New rule:
	f160_0_main_LE -> f160_0_main_LE : arg1'=-10+arg1, arg2'=-1+arg2, (0 == 0 /\ -100+arg1 > 0 /\ arg2 > 0), cost: 1
	
		propagated equality arg1p3 = -10+arg1
		
		propagated equality arg2p3 = -1+arg2
		
	Simplified Guard

	Original rule:
	f160_0_main_LE -> f160_0_main_LE : arg1'=-10+arg1, arg2'=-1+arg2, (0 == 0 /\ -100+arg1 > 0 /\ arg2 > 0), cost: 1
	New rule:
	f160_0_main_LE -> f160_0_main_LE : arg1'=-10+arg1, arg2'=-1+arg2, (-100+arg1 > 0 /\ arg2 > 0), cost: 1
	
	Propagated Equalities

	Original rule:
	__init -> f160_0_main_LE : arg1'=arg1p1, arg2'=arg2p1, (1-arg2p1 == 0 /\ 1+arg2p4 > 0 /\ arg1p4 > 0 /\ 1+arg1p1 > 0), cost: 1
	New rule:
	__init -> f160_0_main_LE : arg1'=arg1p1, arg2'=1, (0 == 0 /\ 1+arg2p4 > 0 /\ arg1p4 > 0 /\ 1+arg1p1 > 0), cost: 1
	
		propagated equality arg2p1 = 1
		
	Simplified Guard

	Original rule:
	__init -> f160_0_main_LE : arg1'=arg1p1, arg2'=1, (0 == 0 /\ 1+arg2p4 > 0 /\ arg1p4 > 0 /\ 1+arg1p1 > 0), cost: 1
	New rule:
	__init -> f160_0_main_LE : arg1'=arg1p1, arg2'=1, (1+arg2p4 > 0 /\ arg1p4 > 0 /\ 1+arg1p1 > 0), cost: 1
	
	Eliminated Temporary Variables via Transitive Closure

	Original rule:
	__init -> f160_0_main_LE : arg1'=arg1p1, arg2'=1, (1+arg2p4 > 0 /\ arg1p4 > 0 /\ 1+arg1p1 > 0), cost: 1
	New rule:
	__init -> f160_0_main_LE : arg1'=arg1p1, arg2'=1, (1+arg1p1 > 0), cost: 1

Step with 7

	Trace

	7[(1+arg1p1 > 0)]
	
	Blocked

	[{}, {}]

Step with 5

	Trace

	7[(1+arg1p1 > 0)], 5[(-101+arg1 < 0 /\ arg2 > 0)]
	
	Blocked

	[{}, {}, {}]

Accelerate

Start location: __init
Program variables: arg1 arg2
   5: f160_0_main_LE -> f160_0_main_LE : arg1'=11+arg1, arg2'=1+arg2, (-101+arg1 < 0 /\ arg2 > 0), cost: 1
   6: f160_0_main_LE -> f160_0_main_LE : arg1'=-10+arg1, arg2'=-1+arg2, (-100+arg1 > 0 /\ arg2 > 0), cost: 1
   8: f160_0_main_LE -> f160_0_main_LE : arg1'=arg1+11*n, arg2'=arg2+n, (112-arg1-11*n > 0 /\ arg2 > 0 /\ -1+n >= 0), cost: 1
   7: __init -> f160_0_main_LE : arg1'=arg1p1, arg2'=1, (1+arg1p1 > 0), cost: 1

	Loop Acceleration

	Original rule:
	f160_0_main_LE -> f160_0_main_LE : arg1'=11+arg1, arg2'=1+arg2, (-101+arg1 < 0 /\ arg2 > 0), cost: 1
	New rule:
	f160_0_main_LE -> f160_0_main_LE : arg1'=arg1+11*n, arg2'=arg2+n, (112-arg1-11*n > 0 /\ arg2 > 0 /\ -1+n >= 0), cost: 1

		arg2 > 0 [0]: monotonic increase yields arg2 > 0
		
		101-arg1 > 0 [0]: montonic decrease yields 112-arg1-11*n > 0
		
		101-arg1 > 0 [1]: eventual increase yields (11 <= 0 /\ 101-arg1 > 0)
		
		Replacement map: {arg2 > 0 -> arg2 > 0, 101-arg1 > 0 -> 112-arg1-11*n > 0}

	Trace

	7[(1+arg1p1 > 0)], 8[(112-arg1-11*n > 0 /\ arg2 > 0 /\ -1+n >= 0)]
	
	Blocked

	[{}, {}, {5[T], 8[T]}]

Step with 6

	Trace

	7[(1+arg1p1 > 0)], 8[(112-arg1-11*n > 0 /\ arg2 > 0 /\ -1+n >= 0)], 6[(-100+arg1 > 0 /\ arg2 > 0)]
	
	Blocked

	[{}, {}, {5[T], 8[T]}, {}]

Accelerate

Start location: __init
Program variables: arg1 arg2
   5: f160_0_main_LE -> f160_0_main_LE : arg1'=11+arg1, arg2'=1+arg2, (-101+arg1 < 0 /\ arg2 > 0), cost: 1
   6: f160_0_main_LE -> f160_0_main_LE : arg1'=-10+arg1, arg2'=-1+arg2, (-100+arg1 > 0 /\ arg2 > 0), cost: 1
   8: f160_0_main_LE -> f160_0_main_LE : arg1'=arg1+11*n, arg2'=arg2+n, (112-arg1-11*n > 0 /\ arg2 > 0 /\ -1+n >= 0), cost: 1
   9: f160_0_main_LE -> f160_0_main_LE : arg1'=-10*n2+arg1, arg2'=-n2+arg2, (-1+n2 >= 0 /\ 1-n2+arg2 > 0 /\ -90-10*n2+arg1 > 0), cost: 1
   7: __init -> f160_0_main_LE : arg1'=arg1p1, arg2'=1, (1+arg1p1 > 0), cost: 1

	Loop Acceleration

	Original rule:
	f160_0_main_LE -> f160_0_main_LE : arg1'=-10+arg1, arg2'=-1+arg2, (-100+arg1 > 0 /\ arg2 > 0), cost: 1
	New rule:
	f160_0_main_LE -> f160_0_main_LE : arg1'=-10*n2+arg1, arg2'=-n2+arg2, (-1+n2 >= 0 /\ 1-n2+arg2 > 0 /\ -90-10*n2+arg1 > 0), cost: 1

		-100+arg1 > 0 [0]: montonic decrease yields -90-10*n2+arg1 > 0
		
		-100+arg1 > 0 [1]: eventual increase yields (-100+arg1 > 0 /\ 10 <= 0)
		
		arg2 > 0 [0]: montonic decrease yields 1-n2+arg2 > 0
		
		arg2 > 0 [1]: eventual increase yields (1 <= 0 /\ arg2 > 0)
		
		Replacement map: {-100+arg1 > 0 -> -90-10*n2+arg1 > 0, arg2 > 0 -> 1-n2+arg2 > 0}

	Trace

	7[(1+arg1p1 > 0)], 8[(112-arg1-11*n > 0 /\ arg2 > 0 /\ -1+n >= 0)], 9[(-1+n2 >= 0 /\ 1-n2+arg2 > 0 /\ -90-10*n2+arg1 > 0)]
	
	Blocked

	[{}, {}, {5[T], 8[T]}, {6[T], 9[T]}]

Accelerate

Start location: __init
Program variables: arg1 arg2
   5: f160_0_main_LE -> f160_0_main_LE : arg1'=11+arg1, arg2'=1+arg2, (-101+arg1 < 0 /\ arg2 > 0), cost: 1
   6: f160_0_main_LE -> f160_0_main_LE : arg1'=-10+arg1, arg2'=-1+arg2, (-100+arg1 > 0 /\ arg2 > 0), cost: 1
   8: f160_0_main_LE -> f160_0_main_LE : arg1'=arg1+11*n, arg2'=arg2+n, (112-arg1-11*n > 0 /\ arg2 > 0 /\ -1+n >= 0), cost: 1
   9: f160_0_main_LE -> f160_0_main_LE : arg1'=-10*n2+arg1, arg2'=-n2+arg2, (-1+n2 >= 0 /\ 1-n2+arg2 > 0 /\ -90-10*n2+arg1 > 0), cost: 1
  10: f160_0_main_LE -> f160_0_main_LE : arg1'=11*n1*n3+arg1-10*n2*n3, arg2'=n1*n3-n2*n3+arg2, (-90-10*n2+arg1+11*n1 > 0 /\ -1+n2 >= 0 /\ 1-n2+(-1+n3)*n1+arg2+n1-n2*(-1+n3) > 0 /\ (-1+n3)*n1+arg2-n2*(-1+n3) > 0 /\ -90-10*n2+arg1+11*(-1+n3)*n1+11*n1-10*n2*(-1+n3) > 0 /\ 112-arg1-11*n1 > 0 /\ -1+n3 >= 0 /\ -1+n1 >= 0 /\ arg2 > 0 /\ 112-arg1-11*(-1+n3)*n1-11*n1+10*n2*(-1+n3) > 0), cost: 1
   7: __init -> f160_0_main_LE : arg1'=arg1p1, arg2'=1, (1+arg1p1 > 0), cost: 1

	Loop Acceleration

	Original rule:
	f160_0_main_LE -> f160_0_main_LE : arg1'=-10*n2+arg1+11*n1, arg2'=-n2+arg2+n1, (-90-10*n2+arg1+11*n1 > 0 /\ -1+n2 >= 0 /\ 112-arg1-11*n1 > 0 /\ -1+n1 >= 0 /\ arg2 > 0 /\ 1-n2+arg2+n1 > 0), cost: 1
	New rule:
	f160_0_main_LE -> f160_0_main_LE : arg1'=11*n1*n3+arg1-10*n2*n3, arg2'=n1*n3-n2*n3+arg2, (-90-10*n2+arg1+11*n1 > 0 /\ -1+n2 >= 0 /\ 1-n2+(-1+n3)*n1+arg2+n1-n2*(-1+n3) > 0 /\ (-1+n3)*n1+arg2-n2*(-1+n3) > 0 /\ -90-10*n2+arg1+11*(-1+n3)*n1+11*n1-10*n2*(-1+n3) > 0 /\ 112-arg1-11*n1 > 0 /\ -1+n3 >= 0 /\ -1+n1 >= 0 /\ arg2 > 0 /\ 112-arg1-11*(-1+n3)*n1-11*n1+10*n2*(-1+n3) > 0), cost: 1

		-90-10*n2+arg1+11*n1 > 0 [0]: eventual decrease yields (-90-10*n2+arg1+11*n1 > 0 /\ -90-10*n2+arg1+11*(-1+n3)*n1+11*n1-10*n2*(-1+n3) > 0)
		
		-90-10*n2+arg1+11*n1 > 0 [1]: eventual increase yields (-90-10*n2+arg1+11*n1 > 0 /\ 10*n2-11*n1 <= 0)
		
		-1+n2 >= 0 [0]: monotonic increase yields -1+n2 >= 0
		
		112-arg1-11*n1 > 0 [0]: eventual decrease yields (112-arg1-11*n1 > 0 /\ 112-arg1-11*(-1+n3)*n1-11*n1+10*n2*(-1+n3) > 0)
		
		112-arg1-11*n1 > 0 [1]: eventual increase yields (-10*n2+11*n1 <= 0 /\ 112-arg1-11*n1 > 0)
		
		-1+n1 >= 0 [0]: monotonic increase yields -1+n1 >= 0
		
		arg2 > 0 [0]: eventual decrease yields ((-1+n3)*n1+arg2-n2*(-1+n3) > 0 /\ arg2 > 0)
		
		arg2 > 0 [1]: eventual increase yields (n2-n1 <= 0 /\ arg2 > 0)
		
		1-n2+arg2+n1 > 0 [0]: montonic decrease yields 1-n2+(-1+n3)*n1+arg2+n1-n2*(-1+n3) > 0, dependencies: -90-10*n2+arg1+11*n1 > 0 112-arg1-11*n1 > 0 -1+n1 >= 0 arg2 > 0
		
		1-n2+arg2+n1 > 0 [1]: eventual increase yields (n2-n1 <= 0 /\ 1-n2+arg2+n1 > 0)
		
		Replacement map: {-90-10*n2+arg1+11*n1 > 0 -> (-90-10*n2+arg1+11*n1 > 0 /\ -90-10*n2+arg1+11*(-1+n3)*n1+11*n1-10*n2*(-1+n3) > 0), -1+n2 >= 0 -> -1+n2 >= 0, 112-arg1-11*n1 > 0 -> (112-arg1-11*n1 > 0 /\ 112-arg1-11*(-1+n3)*n1-11*n1+10*n2*(-1+n3) > 0), -1+n1 >= 0 -> -1+n1 >= 0, arg2 > 0 -> ((-1+n3)*n1+arg2-n2*(-1+n3) > 0 /\ arg2 > 0), 1-n2+arg2+n1 > 0 -> 1-n2+(-1+n3)*n1+arg2+n1-n2*(-1+n3) > 0}

	Trace

	7[(1+arg1p1 > 0)], 10[(-90-10*n2+arg1+11*n1 > 0 /\ -1+n2 >= 0 /\ 1-n2+(-1+n3)*n1+arg2+n1-n2*(-1+n3) > 0 /\ (-1+n3)*n1+arg2-n2*(-1+n3) > 0 /\ -90-10*n2+arg1+11*(-1+n3)*n1+11*n1-10*n2*(-1+n3) > 0 /\ 112-arg1-11*n1 > 0 /\ -1+n3 >= 0 /\ -1+n1 >= 0 /\ arg2 > 0 /\ 112-arg1-11*(-1+n3)*n1-11*n1+10*n2*(-1+n3) > 0)]
	
	Blocked

	[{}, {}, {10[T]}]

Step with 5

	Trace

	7[(1+arg1p1 > 0)], 10[(-90-10*n2+arg1+11*n1 > 0 /\ -1+n2 >= 0 /\ 1-n2+(-1+n3)*n1+arg2+n1-n2*(-1+n3) > 0 /\ (-1+n3)*n1+arg2-n2*(-1+n3) > 0 /\ -90-10*n2+arg1+11*(-1+n3)*n1+11*n1-10*n2*(-1+n3) > 0 /\ 112-arg1-11*n1 > 0 /\ -1+n3 >= 0 /\ -1+n1 >= 0 /\ arg2 > 0 /\ 112-arg1-11*(-1+n3)*n1-11*n1+10*n2*(-1+n3) > 0)], 5[(-101+arg1 < 0 /\ arg2 > 0)]
	
	Blocked

	[{}, {}, {10[T]}, {}]

Covered

	Trace

	7[(1+arg1p1 > 0)], 10[(-90-10*n2+arg1+11*n1 > 0 /\ -1+n2 >= 0 /\ 1-n2+(-1+n3)*n1+arg2+n1-n2*(-1+n3) > 0 /\ (-1+n3)*n1+arg2-n2*(-1+n3) > 0 /\ -90-10*n2+arg1+11*(-1+n3)*n1+11*n1-10*n2*(-1+n3) > 0 /\ 112-arg1-11*n1 > 0 /\ -1+n3 >= 0 /\ -1+n1 >= 0 /\ arg2 > 0 /\ 112-arg1-11*(-1+n3)*n1-11*n1+10*n2*(-1+n3) > 0)]
	
	Blocked

	[{}, {}, {5[T], 10[T]}]

Step with 6

	Trace

	7[(1+arg1p1 > 0)], 10[(-90-10*n2+arg1+11*n1 > 0 /\ -1+n2 >= 0 /\ 1-n2+(-1+n3)*n1+arg2+n1-n2*(-1+n3) > 0 /\ (-1+n3)*n1+arg2-n2*(-1+n3) > 0 /\ -90-10*n2+arg1+11*(-1+n3)*n1+11*n1-10*n2*(-1+n3) > 0 /\ 112-arg1-11*n1 > 0 /\ -1+n3 >= 0 /\ -1+n1 >= 0 /\ arg2 > 0 /\ 112-arg1-11*(-1+n3)*n1-11*n1+10*n2*(-1+n3) > 0)], 6[(-100+arg1 > 0 /\ arg2 > 0)]
	
	Blocked

	[{}, {}, {5[T], 10[T]}, {}]

Covered

	Trace

	7[(1+arg1p1 > 0)], 10[(-90-10*n2+arg1+11*n1 > 0 /\ -1+n2 >= 0 /\ 1-n2+(-1+n3)*n1+arg2+n1-n2*(-1+n3) > 0 /\ (-1+n3)*n1+arg2-n2*(-1+n3) > 0 /\ -90-10*n2+arg1+11*(-1+n3)*n1+11*n1-10*n2*(-1+n3) > 0 /\ 112-arg1-11*n1 > 0 /\ -1+n3 >= 0 /\ -1+n1 >= 0 /\ arg2 > 0 /\ 112-arg1-11*(-1+n3)*n1-11*n1+10*n2*(-1+n3) > 0)]
	
	Blocked

	[{}, {}, {5[T], 6[T], 10[T]}]

Step with 8

	Trace

	7[(1+arg1p1 > 0)], 10[(-90-10*n2+arg1+11*n1 > 0 /\ -1+n2 >= 0 /\ 1-n2+(-1+n3)*n1+arg2+n1-n2*(-1+n3) > 0 /\ (-1+n3)*n1+arg2-n2*(-1+n3) > 0 /\ -90-10*n2+arg1+11*(-1+n3)*n1+11*n1-10*n2*(-1+n3) > 0 /\ 112-arg1-11*n1 > 0 /\ -1+n3 >= 0 /\ -1+n1 >= 0 /\ arg2 > 0 /\ 112-arg1-11*(-1+n3)*n1-11*n1+10*n2*(-1+n3) > 0)], 8[(112-arg1-11*n > 0 /\ arg2 > 0 /\ -1+n >= 0)]
	
	Blocked

	[{}, {}, {5[T], 6[T], 10[T]}, {8[T]}]

Acceleration Failed

marked recursive suffix as redundant

Step with 9

	Trace

	7[(1+arg1p1 > 0)], 10[(-90-10*n2+arg1+11*n1 > 0 /\ -1+n2 >= 0 /\ 1-n2+(-1+n3)*n1+arg2+n1-n2*(-1+n3) > 0 /\ (-1+n3)*n1+arg2-n2*(-1+n3) > 0 /\ -90-10*n2+arg1+11*(-1+n3)*n1+11*n1-10*n2*(-1+n3) > 0 /\ 112-arg1-11*n1 > 0 /\ -1+n3 >= 0 /\ -1+n1 >= 0 /\ arg2 > 0 /\ 112-arg1-11*(-1+n3)*n1-11*n1+10*n2*(-1+n3) > 0)], 8[(112-arg1-11*n > 0 /\ arg2 > 0 /\ -1+n >= 0)], 9[(-1+n2 >= 0 /\ 1-n2+arg2 > 0 /\ -90-10*n2+arg1 > 0)]
	
	Blocked

	[{}, {}, {5[T], 6[T], 10[T]}, {8[T]}, {9[T]}]

Covered

	Trace

	7[(1+arg1p1 > 0)], 10[(-90-10*n2+arg1+11*n1 > 0 /\ -1+n2 >= 0 /\ 1-n2+(-1+n3)*n1+arg2+n1-n2*(-1+n3) > 0 /\ (-1+n3)*n1+arg2-n2*(-1+n3) > 0 /\ -90-10*n2+arg1+11*(-1+n3)*n1+11*n1-10*n2*(-1+n3) > 0 /\ 112-arg1-11*n1 > 0 /\ -1+n3 >= 0 /\ -1+n1 >= 0 /\ arg2 > 0 /\ 112-arg1-11*(-1+n3)*n1-11*n1+10*n2*(-1+n3) > 0)], 8[(112-arg1-11*n > 0 /\ arg2 > 0 /\ -1+n >= 0)]
	
	Blocked

	[{}, {}, {5[T], 6[T], 10[T]}, {8[T], 9[T]}]

Step with 6

	Trace

	7[(1+arg1p1 > 0)], 10[(-90-10*n2+arg1+11*n1 > 0 /\ -1+n2 >= 0 /\ 1-n2+(-1+n3)*n1+arg2+n1-n2*(-1+n3) > 0 /\ (-1+n3)*n1+arg2-n2*(-1+n3) > 0 /\ -90-10*n2+arg1+11*(-1+n3)*n1+11*n1-10*n2*(-1+n3) > 0 /\ 112-arg1-11*n1 > 0 /\ -1+n3 >= 0 /\ -1+n1 >= 0 /\ arg2 > 0 /\ 112-arg1-11*(-1+n3)*n1-11*n1+10*n2*(-1+n3) > 0)], 8[(112-arg1-11*n > 0 /\ arg2 > 0 /\ -1+n >= 0)], 6[(-100+arg1 > 0 /\ arg2 > 0)]
	
	Blocked

	[{}, {}, {5[T], 6[T], 10[T]}, {5[T], 8[T], 9[T], 10[T]}, {}]

Covered

	Trace

	7[(1+arg1p1 > 0)], 10[(-90-10*n2+arg1+11*n1 > 0 /\ -1+n2 >= 0 /\ 1-n2+(-1+n3)*n1+arg2+n1-n2*(-1+n3) > 0 /\ (-1+n3)*n1+arg2-n2*(-1+n3) > 0 /\ -90-10*n2+arg1+11*(-1+n3)*n1+11*n1-10*n2*(-1+n3) > 0 /\ 112-arg1-11*n1 > 0 /\ -1+n3 >= 0 /\ -1+n1 >= 0 /\ arg2 > 0 /\ 112-arg1-11*(-1+n3)*n1-11*n1+10*n2*(-1+n3) > 0)], 8[(112-arg1-11*n > 0 /\ arg2 > 0 /\ -1+n >= 0)]
	
	Blocked

	[{}, {}, {5[T], 6[T], 10[T]}, {5[T], 6[T], 8[T], 9[T], 10[T]}]

Backtrack

	Trace

	7[(1+arg1p1 > 0)], 10[(-90-10*n2+arg1+11*n1 > 0 /\ -1+n2 >= 0 /\ 1-n2+(-1+n3)*n1+arg2+n1-n2*(-1+n3) > 0 /\ (-1+n3)*n1+arg2-n2*(-1+n3) > 0 /\ -90-10*n2+arg1+11*(-1+n3)*n1+11*n1-10*n2*(-1+n3) > 0 /\ 112-arg1-11*n1 > 0 /\ -1+n3 >= 0 /\ -1+n1 >= 0 /\ arg2 > 0 /\ 112-arg1-11*(-1+n3)*n1-11*n1+10*n2*(-1+n3) > 0)]
	
	Blocked

	[{}, {}, {5[T], 6[T], 8[T], 10[T]}]

Step with 9

	Trace

	7[(1+arg1p1 > 0)], 10[(-90-10*n2+arg1+11*n1 > 0 /\ -1+n2 >= 0 /\ 1-n2+(-1+n3)*n1+arg2+n1-n2*(-1+n3) > 0 /\ (-1+n3)*n1+arg2-n2*(-1+n3) > 0 /\ -90-10*n2+arg1+11*(-1+n3)*n1+11*n1-10*n2*(-1+n3) > 0 /\ 112-arg1-11*n1 > 0 /\ -1+n3 >= 0 /\ -1+n1 >= 0 /\ arg2 > 0 /\ 112-arg1-11*(-1+n3)*n1-11*n1+10*n2*(-1+n3) > 0)], 9[(-1+n2 >= 0 /\ 1-n2+arg2 > 0 /\ -90-10*n2+arg1 > 0)]
	
	Blocked

	[{}, {}, {5[T], 6[T], 8[T], 10[T]}, {9[T]}]

Covered

	Trace

	7[(1+arg1p1 > 0)], 10[(-90-10*n2+arg1+11*n1 > 0 /\ -1+n2 >= 0 /\ 1-n2+(-1+n3)*n1+arg2+n1-n2*(-1+n3) > 0 /\ (-1+n3)*n1+arg2-n2*(-1+n3) > 0 /\ -90-10*n2+arg1+11*(-1+n3)*n1+11*n1-10*n2*(-1+n3) > 0 /\ 112-arg1-11*n1 > 0 /\ -1+n3 >= 0 /\ -1+n1 >= 0 /\ arg2 > 0 /\ 112-arg1-11*(-1+n3)*n1-11*n1+10*n2*(-1+n3) > 0)]
	
	Blocked

	[{}, {}, {5[T], 6[T], 8[T], 9[T], 10[T]}]

Backtrack

	Trace

	7[(1+arg1p1 > 0)]
	
	Blocked

	[{}, {10[T]}]

Step with 9

	Trace

	7[(1+arg1p1 > 0)], 9[(-1+n2 >= 0 /\ 1-n2+arg2 > 0 /\ -90-10*n2+arg1 > 0)]
	
	Blocked

	[{}, {10[T]}, {9[T]}]

Backtrack

	Trace

	7[(1+arg1p1 > 0)]
	
	Blocked

	[{}, {9[T], 10[T]}]

Step with 5

	Trace

	7[(1+arg1p1 > 0)], 5[(-101+arg1 < 0 /\ arg2 > 0)]
	
	Blocked

	[{}, {9[T], 10[T]}, {}]

Covered

	Trace

	7[(1+arg1p1 > 0)]
	
	Blocked

	[{}, {5[T], 9[T], 10[T]}]

Step with 6

	Trace

	7[(1+arg1p1 > 0)], 6[(-100+arg1 > 0 /\ arg2 > 0)]
	
	Blocked

	[{}, {5[T], 9[T], 10[T]}, {}]

Covered

	Trace

	7[(1+arg1p1 > 0)]
	
	Blocked

	[{}, {5[T], 6[T], 9[T], 10[T]}]

Step with 8

	Trace

	7[(1+arg1p1 > 0)], 8[(112-arg1-11*n > 0 /\ arg2 > 0 /\ -1+n >= 0)]
	
	Blocked

	[{}, {5[T], 6[T], 9[T], 10[T]}, {8[T]}]

Step with 9

	Trace

	7[(1+arg1p1 > 0)], 8[(112-arg1-11*n > 0 /\ arg2 > 0 /\ -1+n >= 0)], 9[(-1+n2 >= 0 /\ 1-n2+arg2 > 0 /\ -90-10*n2+arg1 > 0)]
	
	Blocked

	[{}, {5[T], 6[T], 9[T], 10[T]}, {8[T]}, {9[T]}]

Covered

	Trace

	7[(1+arg1p1 > 0)], 8[(112-arg1-11*n > 0 /\ arg2 > 0 /\ -1+n >= 0)]
	
	Blocked

	[{}, {5[T], 6[T], 9[T], 10[T]}, {8[T], 9[T]}]

Step with 10

	Trace

	7[(1+arg1p1 > 0)], 8[(112-arg1-11*n > 0 /\ arg2 > 0 /\ -1+n >= 0)], 10[(-90-10*n2+arg1+11*n1 > 0 /\ -1+n2 >= 0 /\ 1-n2+(-1+n3)*n1+arg2+n1-n2*(-1+n3) > 0 /\ (-1+n3)*n1+arg2-n2*(-1+n3) > 0 /\ -90-10*n2+arg1+11*(-1+n3)*n1+11*n1-10*n2*(-1+n3) > 0 /\ 112-arg1-11*n1 > 0 /\ -1+n3 >= 0 /\ -1+n1 >= 0 /\ arg2 > 0 /\ 112-arg1-11*(-1+n3)*n1-11*n1+10*n2*(-1+n3) > 0)]
	
	Blocked

	[{}, {5[T], 6[T], 9[T], 10[T]}, {8[T], 9[T]}, {10[T]}]

Covered

	Trace

	7[(1+arg1p1 > 0)], 8[(112-arg1-11*n > 0 /\ arg2 > 0 /\ -1+n >= 0)]
	
	Blocked

	[{}, {5[T], 6[T], 9[T], 10[T]}, {8[T], 9[T], 10[T]}]

Step with 5

	Trace

	7[(1+arg1p1 > 0)], 8[(112-arg1-11*n > 0 /\ arg2 > 0 /\ -1+n >= 0)], 5[(-101+arg1 < 0 /\ arg2 > 0)]
	
	Blocked

	[{}, {5[T], 6[T], 9[T], 10[T]}, {8[T], 9[T], 10[T]}, {}]

Covered

	Trace

	7[(1+arg1p1 > 0)], 8[(112-arg1-11*n > 0 /\ arg2 > 0 /\ -1+n >= 0)]
	
	Blocked

	[{}, {5[T], 6[T], 9[T], 10[T]}, {5[T], 8[T], 9[T], 10[T]}]

Step with 6

	Trace

	7[(1+arg1p1 > 0)], 8[(112-arg1-11*n > 0 /\ arg2 > 0 /\ -1+n >= 0)], 6[(-100+arg1 > 0 /\ arg2 > 0)]
	
	Blocked

	[{}, {5[T], 6[T], 9[T], 10[T]}, {5[T], 8[T], 9[T], 10[T]}, {}]

Covered

	Trace

	7[(1+arg1p1 > 0)], 8[(112-arg1-11*n > 0 /\ arg2 > 0 /\ -1+n >= 0)]
	
	Blocked

	[{}, {5[T], 6[T], 9[T], 10[T]}, {5[T], 6[T], 8[T], 9[T], 10[T]}]

Backtrack

	Trace

	7[(1+arg1p1 > 0)]
	
	Blocked

	[{}, {5[T], 6[T], 8[T], 9[T], 10[T]}]

Backtrack

	Trace

	Blocked

	[{7[T]}]

Accept

unknown

Build SHA: a05f16bf13df659c382799650051f91bf6828c7b