unknown

Initial ITS

Start location: __init
Program variables: arg1 arg2 arg3
   0: f1_0_main_ConstantStackPush -> f83_0_main_ArrayAccess : arg1'=arg1p1, arg2'=arg2p1, arg3'=arg3p1, (1-arg2p1+arg2 == 0 /\ 1+arg2 > 0 /\ arg2-arg3p1 == 0 /\ arg1p1-arg1 <= 0 /\ arg1p1 > 0 /\ arg1 > 0), cost: 1
   1: f83_0_main_ArrayAccess -> f83_0_main_ArrayAccess : arg1'=arg1p2, arg2'=arg2p2, arg3'=arg3p2, (1-arg2p2+arg3 == 0 /\ arg3-arg2 > 0 /\ arg3-arg3p2 == 0 /\ arg1p2-arg1 <= 0 /\ 1+arg3 > 0 /\ arg1p2 > 0 /\ arg1 > 0), cost: 1
   2: __init -> f1_0_main_ConstantStackPush : arg1'=arg1p3, arg2'=arg2p3, arg3'=arg3p3, T, cost: 1

Chained Linear Paths

Start location: __init
Program variables: arg1 arg2 arg3
   1: f83_0_main_ArrayAccess -> f83_0_main_ArrayAccess : arg1'=arg1p2, arg2'=arg2p2, arg3'=arg3p2, (1-arg2p2+arg3 == 0 /\ arg3-arg2 > 0 /\ arg3-arg3p2 == 0 /\ arg1p2-arg1 <= 0 /\ 1+arg3 > 0 /\ arg1p2 > 0 /\ arg1 > 0), cost: 1
   3: __init -> f83_0_main_ArrayAccess : arg1'=arg1p1, arg2'=arg2p1, arg3'=arg3p1, (1+arg2p3-arg2p1 == 0 /\ -arg1p3+arg1p1 <= 0 /\ arg1p3 > 0 /\ arg1p1 > 0 /\ arg2p3-arg3p1 == 0 /\ 1+arg2p3 > 0), cost: 1

	Eliminating location f1_0_main_ConstantStackPush by chaining:

	Applied chaining

	First rule:
	__init -> f1_0_main_ConstantStackPush : arg1'=arg1p3, arg2'=arg2p3, arg3'=arg3p3, T, cost: 1
	Second rule:
	f1_0_main_ConstantStackPush -> f83_0_main_ArrayAccess : arg1'=arg1p1, arg2'=arg2p1, arg3'=arg3p1, (1-arg2p1+arg2 == 0 /\ 1+arg2 > 0 /\ arg2-arg3p1 == 0 /\ arg1p1-arg1 <= 0 /\ arg1p1 > 0 /\ arg1 > 0), cost: 1
	New rule:
	__init -> f83_0_main_ArrayAccess : arg1'=arg1p1, arg2'=arg2p1, arg3'=arg3p1, (1+arg2p3-arg2p1 == 0 /\ -arg1p3+arg1p1 <= 0 /\ arg1p3 > 0 /\ arg1p1 > 0 /\ arg2p3-arg3p1 == 0 /\ 1+arg2p3 > 0), cost: 1
	
	Applied deletion

	Removed the following rules: 0 2

Simplified Transitions

Start location: __init
Program variables: arg1 arg2 arg3
   4: f83_0_main_ArrayAccess -> f83_0_main_ArrayAccess : arg1'=arg1p2, arg2'=1+arg3, (arg3-arg2 > 0 /\ arg1p2-arg1 <= 0 /\ 1+arg3 > 0 /\ arg1p2 > 0 /\ arg1 > 0), cost: 1
   5: __init -> f83_0_main_ArrayAccess : arg1'=arg1p1, arg2'=1+arg2p3, arg3'=arg2p3, (arg1p1 > 0 /\ 1+arg2p3 > 0), cost: 1

	Propagated Equalities

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

	Original rule:
	f83_0_main_ArrayAccess -> f83_0_main_ArrayAccess : arg1'=arg1p2, arg2'=1+arg3, arg3'=arg3, (0 == 0 /\ arg3-arg2 > 0 /\ arg1p2-arg1 <= 0 /\ 1+arg3 > 0 /\ arg1p2 > 0 /\ arg1 > 0), cost: 1
	New rule:
	f83_0_main_ArrayAccess -> f83_0_main_ArrayAccess : arg1'=arg1p2, arg2'=1+arg3, arg3'=arg3, (arg3-arg2 > 0 /\ arg1p2-arg1 <= 0 /\ 1+arg3 > 0 /\ arg1p2 > 0 /\ arg1 > 0), cost: 1
	
	Removed Trivial Updates

	Original rule:
	f83_0_main_ArrayAccess -> f83_0_main_ArrayAccess : arg1'=arg1p2, arg2'=1+arg3, arg3'=arg3, (arg3-arg2 > 0 /\ arg1p2-arg1 <= 0 /\ 1+arg3 > 0 /\ arg1p2 > 0 /\ arg1 > 0), cost: 1
	New rule:
	f83_0_main_ArrayAccess -> f83_0_main_ArrayAccess : arg1'=arg1p2, arg2'=1+arg3, (arg3-arg2 > 0 /\ arg1p2-arg1 <= 0 /\ 1+arg3 > 0 /\ arg1p2 > 0 /\ arg1 > 0), cost: 1
	
	Propagated Equalities

	Original rule:
	__init -> f83_0_main_ArrayAccess : arg1'=arg1p1, arg2'=arg2p1, arg3'=arg3p1, (1+arg2p3-arg2p1 == 0 /\ -arg1p3+arg1p1 <= 0 /\ arg1p3 > 0 /\ arg1p1 > 0 /\ arg2p3-arg3p1 == 0 /\ 1+arg2p3 > 0), cost: 1
	New rule:
	__init -> f83_0_main_ArrayAccess : arg1'=arg1p1, arg2'=1+arg2p3, arg3'=arg2p3, (0 == 0 /\ -arg1p3+arg1p1 <= 0 /\ arg1p3 > 0 /\ arg1p1 > 0 /\ 1+arg2p3 > 0), cost: 1
	
		propagated equality arg2p1 = 1+arg2p3
		
		propagated equality arg3p1 = arg2p3
		
	Simplified Guard

	Original rule:
	__init -> f83_0_main_ArrayAccess : arg1'=arg1p1, arg2'=1+arg2p3, arg3'=arg2p3, (0 == 0 /\ -arg1p3+arg1p1 <= 0 /\ arg1p3 > 0 /\ arg1p1 > 0 /\ 1+arg2p3 > 0), cost: 1
	New rule:
	__init -> f83_0_main_ArrayAccess : arg1'=arg1p1, arg2'=1+arg2p3, arg3'=arg2p3, (-arg1p3+arg1p1 <= 0 /\ arg1p3 > 0 /\ arg1p1 > 0 /\ 1+arg2p3 > 0), cost: 1
	
	Eliminated Temporary Variables via Transitive Closure

	Original rule:
	__init -> f83_0_main_ArrayAccess : arg1'=arg1p1, arg2'=1+arg2p3, arg3'=arg2p3, (-arg1p3+arg1p1 <= 0 /\ arg1p3 > 0 /\ arg1p1 > 0 /\ 1+arg2p3 > 0), cost: 1
	New rule:
	__init -> f83_0_main_ArrayAccess : arg1'=arg1p1, arg2'=1+arg2p3, arg3'=arg2p3, (arg1p1 > 0 /\ 1+arg2p3 > 0), cost: 1

Step with 5

	Trace

	5[(arg1p1 > 0 /\ 1+arg2p3 > 0)]
	
	Blocked

	[{}, {}]

Backtrack

	Trace

	Blocked

	[{5[T]}]

Accept

unknown

Build SHA: a05f16bf13df659c382799650051f91bf6828c7b