NO

Initial ITS

Start location: __init
Program variables: arg1 arg2
   0: f1_0_main_Load -> f32_0_increase_GE : arg1'=arg1p1, arg2'=arg2p1, (-arg1p1+arg2 == 0 /\ 1+arg2 > 0 /\ arg1 > 0), cost: 1
   1: f32_0_increase_GE -> f91_0_increase_aux_LE : arg1'=arg1p2, arg2'=arg2p2, (-10+arg1 < 0 /\ arg1-arg1p2 == 0), cost: 1
   2: f32_0_increase_GE -> f32_0_increase_GE : arg1'=arg1p3, arg2'=arg2p3, (-arg1 == 0 /\ 1-arg1p3 == 0), cost: 1
   3: f91_0_increase_aux_LE -> f91_0_increase_aux_LE : arg1'=arg1p4, arg2'=arg2p4, (1 > 0 /\ 1-arg1p4+arg1 == 0 /\ arg1 > 0), cost: 1
   4: __init -> f1_0_main_Load : arg1'=arg1p5, arg2'=arg2p5, T, cost: 1

Chained Linear Paths

Start location: __init
Program variables: arg1 arg2
   1: f32_0_increase_GE -> f91_0_increase_aux_LE : arg1'=arg1p2, arg2'=arg2p2, (-10+arg1 < 0 /\ arg1-arg1p2 == 0), cost: 1
   2: f32_0_increase_GE -> f32_0_increase_GE : arg1'=arg1p3, arg2'=arg2p3, (-arg1 == 0 /\ 1-arg1p3 == 0), cost: 1
   3: f91_0_increase_aux_LE -> f91_0_increase_aux_LE : arg1'=arg1p4, arg2'=arg2p4, (1 > 0 /\ 1-arg1p4+arg1 == 0 /\ arg1 > 0), cost: 1
   5: __init -> f32_0_increase_GE : arg1'=arg1p1, arg2'=arg2p1, (arg2p5-arg1p1 == 0 /\ arg1p5 > 0 /\ 1+arg2p5 > 0), cost: 1

	Eliminating location f1_0_main_Load by chaining:

	Applied chaining

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

	Removed the following rules: 0 4

Simplified Transitions

Start location: __init
Program variables: arg1 arg2
   6: f32_0_increase_GE -> f91_0_increase_aux_LE : arg2'=arg2p2, -10+arg1 < 0, cost: 1
   7: f32_0_increase_GE -> f32_0_increase_GE : arg1'=1, arg2'=arg2p3, -arg1 == 0, cost: 1
   8: f91_0_increase_aux_LE -> f91_0_increase_aux_LE : arg1'=1+arg1, arg2'=arg2p4, arg1 > 0, cost: 1
   9: __init -> f32_0_increase_GE : arg1'=arg2p5, arg2'=arg2p1, (1+arg2p5 > 0), cost: 1

	Propagated Equalities

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

	Original rule:
	f32_0_increase_GE -> f91_0_increase_aux_LE : arg1'=arg1, arg2'=arg2p2, (0 == 0 /\ -10+arg1 < 0), cost: 1
	New rule:
	f32_0_increase_GE -> f91_0_increase_aux_LE : arg1'=arg1, arg2'=arg2p2, -10+arg1 < 0, cost: 1
	
	Removed Trivial Updates

	Original rule:
	f32_0_increase_GE -> f91_0_increase_aux_LE : arg1'=arg1, arg2'=arg2p2, -10+arg1 < 0, cost: 1
	New rule:
	f32_0_increase_GE -> f91_0_increase_aux_LE : arg2'=arg2p2, -10+arg1 < 0, cost: 1
	
	Propagated Equalities

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

	Original rule:
	f32_0_increase_GE -> f32_0_increase_GE : arg1'=1, arg2'=arg2p3, (0 == 0 /\ -arg1 == 0), cost: 1
	New rule:
	f32_0_increase_GE -> f32_0_increase_GE : arg1'=1, arg2'=arg2p3, -arg1 == 0, cost: 1
	
	Propagated Equalities

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

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

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

	Original rule:
	__init -> f32_0_increase_GE : arg1'=arg2p5, arg2'=arg2p1, (0 == 0 /\ arg1p5 > 0 /\ 1+arg2p5 > 0), cost: 1
	New rule:
	__init -> f32_0_increase_GE : arg1'=arg2p5, arg2'=arg2p1, (arg1p5 > 0 /\ 1+arg2p5 > 0), cost: 1
	
	Eliminated Temporary Variables via Transitive Closure

	Original rule:
	__init -> f32_0_increase_GE : arg1'=arg2p5, arg2'=arg2p1, (arg1p5 > 0 /\ 1+arg2p5 > 0), cost: 1
	New rule:
	__init -> f32_0_increase_GE : arg1'=arg2p5, arg2'=arg2p1, (1+arg2p5 > 0), cost: 1

Step with 9

	Trace

	9[(1+arg2p5 > 0)]
	
	Blocked

	[{}, {}]

Step with 6

	Trace

	9[(1+arg2p5 > 0)], 6[(-10+arg1 < 0)]
	
	Blocked

	[{}, {}, {}]

Step with 8

	Trace

	9[(1+arg2p5 > 0)], 6[(-10+arg1 < 0)], 8[(arg1 > 0)]
	
	Blocked

	[{}, {}, {}, {}]

Nonterm

Start location: __init
Program variables: arg1 arg2
   6: f32_0_increase_GE -> f91_0_increase_aux_LE : arg2'=arg2p2, -10+arg1 < 0, cost: 1
   7: f32_0_increase_GE -> f32_0_increase_GE : arg1'=1, arg2'=arg2p3, -arg1 == 0, cost: 1
   8: f91_0_increase_aux_LE -> f91_0_increase_aux_LE : arg1'=1+arg1, arg2'=arg2p4, arg1 > 0, cost: 1
  10: f91_0_increase_aux_LE -> LoAT_sink : (arg1 > 0 /\ -1+n >= 0), cost: NONTERM
  11: f91_0_increase_aux_LE -> f91_0_increase_aux_LE : arg1'=arg1+n, arg2'=arg2p4, (arg1 > 0 /\ -1+n >= 0), cost: 1
   9: __init -> f32_0_increase_GE : arg1'=arg2p5, arg2'=arg2p1, (1+arg2p5 > 0), cost: 1

	Certificate of Non-Termination

	Original rule:
	f91_0_increase_aux_LE -> f91_0_increase_aux_LE : arg1'=1+arg1, arg2'=arg2p4, (arg1 > 0), cost: 1
	New rule:
	f91_0_increase_aux_LE -> LoAT_sink : (arg1 > 0 /\ -1+n >= 0), cost: NONTERM

		arg1 > 0 [0]: monotonic increase yields arg1 > 0
		
		Replacement map: {arg1 > 0 -> arg1 > 0}

	Loop Acceleration

	Original rule:
	f91_0_increase_aux_LE -> f91_0_increase_aux_LE : arg1'=1+arg1, arg2'=arg2p4, (arg1 > 0), cost: 1
	New rule:
	f91_0_increase_aux_LE -> f91_0_increase_aux_LE : arg1'=arg1+n, arg2'=arg2p4, (arg1 > 0 /\ -1+n >= 0), cost: 1

		arg1 > 0 [0]: monotonic increase yields arg1 > 0
		
		Replacement map: {arg1 > 0 -> arg1 > 0}

Step with 10

	Trace

	9[(1+arg2p5 > 0)], 6[(-10+arg1 < 0)], 10[(arg1 > 0 /\ -1+n >= 0)]
	
	Blocked

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

Refute

	Counterexample

	[ arg1=1 arg2=0 ] 9 [ arg1=1 arg2=0 ] 6 [ arg1=arg1 arg2=arg2 ] 10
	
NO

Build SHA: a05f16bf13df659c382799650051f91bf6828c7b