LTS Termination Proof

by T2Cert

Input

Integer Transition System

Proof

1 Invariant Updates

The following invariants are asserted.

0: source_post ≤ 0source_post ≤ 0source_0 ≤ 0
1: source_post ≤ 0source_post ≤ 0source_0 ≤ 0
2: source_post ≤ 0source_post ≤ 0source_0 ≤ 0
3: source_post ≤ 0source_post ≤ 0source_0 ≤ 0
4: source_post ≤ 0source_post ≤ 0source_0 ≤ 0
5: source_post ≤ 0source_post ≤ 0source_0 ≤ 0
6: source_post ≤ 0source_post ≤ 0source_0 ≤ 0
7: source_post ≤ 0source_post ≤ 0source_0 ≤ 0
8: source_post ≤ 0source_post ≤ 0source_0 ≤ 0
9: source_post ≤ 0source_post ≤ 0source_0 ≤ 0
10: source_post ≤ 0source_post ≤ 0source_0 ≤ 0
11: source_post ≤ 0source_post ≤ 0source_0 ≤ 0
12: source_post ≤ 0source_post ≤ 0source_0 ≤ 0
13: source_post ≤ 0source_post ≤ 0source_0 ≤ 0
14: source_post ≤ 0source_post ≤ 0source_0 ≤ 0
15: source_post ≤ 0source_post ≤ 0source_0 ≤ 0
16: TRUE
17: TRUE

The invariants are proved as follows.

IMPACT Invariant Proof

2 Switch to Cooperation Termination Proof

We consider the following cutpoint-transitions:
1 25 1: y_post + y_post ≤ 0y_posty_post ≤ 0y_0 + y_0 ≤ 0y_0y_0 ≤ 0x_post + x_post ≤ 0x_postx_post ≤ 0x_0 + x_0 ≤ 0x_0x_0 ≤ 0source_post + source_post ≤ 0source_postsource_post ≤ 0source_0 + source_0 ≤ 0source_0source_0 ≤ 0nodecount_post + nodecount_post ≤ 0nodecount_postnodecount_post ≤ 0nodecount_0 + nodecount_0 ≤ 0nodecount_0nodecount_0 ≤ 0j_post + j_post ≤ 0j_postj_post ≤ 0j_0 + j_0 ≤ 0j_0j_0 ≤ 0i_post + i_post ≤ 0i_posti_post ≤ 0i_0 + i_0 ≤ 0i_0i_0 ≤ 0edgecount_post + edgecount_post ≤ 0edgecount_postedgecount_post ≤ 0edgecount_0 + edgecount_0 ≤ 0edgecount_0edgecount_0 ≤ 0___const_5_0 + ___const_5_0 ≤ 0___const_5_0___const_5_0 ≤ 0___const_20_0 + ___const_20_0 ≤ 0___const_20_0___const_20_0 ≤ 0
4 32 4: y_post + y_post ≤ 0y_posty_post ≤ 0y_0 + y_0 ≤ 0y_0y_0 ≤ 0x_post + x_post ≤ 0x_postx_post ≤ 0x_0 + x_0 ≤ 0x_0x_0 ≤ 0source_post + source_post ≤ 0source_postsource_post ≤ 0source_0 + source_0 ≤ 0source_0source_0 ≤ 0nodecount_post + nodecount_post ≤ 0nodecount_postnodecount_post ≤ 0nodecount_0 + nodecount_0 ≤ 0nodecount_0nodecount_0 ≤ 0j_post + j_post ≤ 0j_postj_post ≤ 0j_0 + j_0 ≤ 0j_0j_0 ≤ 0i_post + i_post ≤ 0i_posti_post ≤ 0i_0 + i_0 ≤ 0i_0i_0 ≤ 0edgecount_post + edgecount_post ≤ 0edgecount_postedgecount_post ≤ 0edgecount_0 + edgecount_0 ≤ 0edgecount_0edgecount_0 ≤ 0___const_5_0 + ___const_5_0 ≤ 0___const_5_0___const_5_0 ≤ 0___const_20_0 + ___const_20_0 ≤ 0___const_20_0___const_20_0 ≤ 0
6 39 6: y_post + y_post ≤ 0y_posty_post ≤ 0y_0 + y_0 ≤ 0y_0y_0 ≤ 0x_post + x_post ≤ 0x_postx_post ≤ 0x_0 + x_0 ≤ 0x_0x_0 ≤ 0source_post + source_post ≤ 0source_postsource_post ≤ 0source_0 + source_0 ≤ 0source_0source_0 ≤ 0nodecount_post + nodecount_post ≤ 0nodecount_postnodecount_post ≤ 0nodecount_0 + nodecount_0 ≤ 0nodecount_0nodecount_0 ≤ 0j_post + j_post ≤ 0j_postj_post ≤ 0j_0 + j_0 ≤ 0j_0j_0 ≤ 0i_post + i_post ≤ 0i_posti_post ≤ 0i_0 + i_0 ≤ 0i_0i_0 ≤ 0edgecount_post + edgecount_post ≤ 0edgecount_postedgecount_post ≤ 0edgecount_0 + edgecount_0 ≤ 0edgecount_0edgecount_0 ≤ 0___const_5_0 + ___const_5_0 ≤ 0___const_5_0___const_5_0 ≤ 0___const_20_0 + ___const_20_0 ≤ 0___const_20_0___const_20_0 ≤ 0
8 46 8: y_post + y_post ≤ 0y_posty_post ≤ 0y_0 + y_0 ≤ 0y_0y_0 ≤ 0x_post + x_post ≤ 0x_postx_post ≤ 0x_0 + x_0 ≤ 0x_0x_0 ≤ 0source_post + source_post ≤ 0source_postsource_post ≤ 0source_0 + source_0 ≤ 0source_0source_0 ≤ 0nodecount_post + nodecount_post ≤ 0nodecount_postnodecount_post ≤ 0nodecount_0 + nodecount_0 ≤ 0nodecount_0nodecount_0 ≤ 0j_post + j_post ≤ 0j_postj_post ≤ 0j_0 + j_0 ≤ 0j_0j_0 ≤ 0i_post + i_post ≤ 0i_posti_post ≤ 0i_0 + i_0 ≤ 0i_0i_0 ≤ 0edgecount_post + edgecount_post ≤ 0edgecount_postedgecount_post ≤ 0edgecount_0 + edgecount_0 ≤ 0edgecount_0edgecount_0 ≤ 0___const_5_0 + ___const_5_0 ≤ 0___const_5_0___const_5_0 ≤ 0___const_20_0 + ___const_20_0 ≤ 0___const_20_0___const_20_0 ≤ 0
12 53 12: y_post + y_post ≤ 0y_posty_post ≤ 0y_0 + y_0 ≤ 0y_0y_0 ≤ 0x_post + x_post ≤ 0x_postx_post ≤ 0x_0 + x_0 ≤ 0x_0x_0 ≤ 0source_post + source_post ≤ 0source_postsource_post ≤ 0source_0 + source_0 ≤ 0source_0source_0 ≤ 0nodecount_post + nodecount_post ≤ 0nodecount_postnodecount_post ≤ 0nodecount_0 + nodecount_0 ≤ 0nodecount_0nodecount_0 ≤ 0j_post + j_post ≤ 0j_postj_post ≤ 0j_0 + j_0 ≤ 0j_0j_0 ≤ 0i_post + i_post ≤ 0i_posti_post ≤ 0i_0 + i_0 ≤ 0i_0i_0 ≤ 0edgecount_post + edgecount_post ≤ 0edgecount_postedgecount_post ≤ 0edgecount_0 + edgecount_0 ≤ 0edgecount_0edgecount_0 ≤ 0___const_5_0 + ___const_5_0 ≤ 0___const_5_0___const_5_0 ≤ 0___const_20_0 + ___const_20_0 ≤ 0___const_20_0___const_20_0 ≤ 0
and for every transition t, a duplicate t is considered.

3 Transition Removal

We remove transitions 1, 2, 7, 14, 21, 23, 24 using the following ranking functions, which are bounded by −27.

17: 0
16: 0
10: 0
11: 0
12: 0
13: 0
14: 0
5: 0
6: 0
7: 0
8: 0
9: 0
0: 0
1: 0
3: 0
4: 0
15: 0
2: 0
17: −8
16: −9
10: −10
11: −10
12: −10
13: −10
14: −10
12_var_snapshot: −10
12*: −10
5: −11
6: −11
7: −11
8: −11
9: −11
6_var_snapshot: −11
6*: −11
8_var_snapshot: −11
8*: −11
0: −14
1: −14
3: −14
1_var_snapshot: −14
1*: −14
4: −15
15: −15
4_var_snapshot: −15
4*: −15
2: −16

4 Location Addition

The following skip-transition is inserted and corresponding redirections w.r.t. the old location are performed.

1* 28 1: y_post + y_post ≤ 0y_posty_post ≤ 0y_0 + y_0 ≤ 0y_0y_0 ≤ 0x_post + x_post ≤ 0x_postx_post ≤ 0x_0 + x_0 ≤ 0x_0x_0 ≤ 0source_post + source_post ≤ 0source_postsource_post ≤ 0source_0 + source_0 ≤ 0source_0source_0 ≤ 0nodecount_post + nodecount_post ≤ 0nodecount_postnodecount_post ≤ 0nodecount_0 + nodecount_0 ≤ 0nodecount_0nodecount_0 ≤ 0j_post + j_post ≤ 0j_postj_post ≤ 0j_0 + j_0 ≤ 0j_0j_0 ≤ 0i_post + i_post ≤ 0i_posti_post ≤ 0i_0 + i_0 ≤ 0i_0i_0 ≤ 0edgecount_post + edgecount_post ≤ 0edgecount_postedgecount_post ≤ 0edgecount_0 + edgecount_0 ≤ 0edgecount_0edgecount_0 ≤ 0___const_5_0 + ___const_5_0 ≤ 0___const_5_0___const_5_0 ≤ 0___const_20_0 + ___const_20_0 ≤ 0___const_20_0___const_20_0 ≤ 0

5 Location Addition

The following skip-transition is inserted and corresponding redirections w.r.t. the old location are performed.

1 26 1_var_snapshot: y_post + y_post ≤ 0y_posty_post ≤ 0y_0 + y_0 ≤ 0y_0y_0 ≤ 0x_post + x_post ≤ 0x_postx_post ≤ 0x_0 + x_0 ≤ 0x_0x_0 ≤ 0source_post + source_post ≤ 0source_postsource_post ≤ 0source_0 + source_0 ≤ 0source_0source_0 ≤ 0nodecount_post + nodecount_post ≤ 0nodecount_postnodecount_post ≤ 0nodecount_0 + nodecount_0 ≤ 0nodecount_0nodecount_0 ≤ 0j_post + j_post ≤ 0j_postj_post ≤ 0j_0 + j_0 ≤ 0j_0j_0 ≤ 0i_post + i_post ≤ 0i_posti_post ≤ 0i_0 + i_0 ≤ 0i_0i_0 ≤ 0edgecount_post + edgecount_post ≤ 0edgecount_postedgecount_post ≤ 0edgecount_0 + edgecount_0 ≤ 0edgecount_0edgecount_0 ≤ 0___const_5_0 + ___const_5_0 ≤ 0___const_5_0___const_5_0 ≤ 0___const_20_0 + ___const_20_0 ≤ 0___const_20_0___const_20_0 ≤ 0

6 Location Addition

The following skip-transition is inserted and corresponding redirections w.r.t. the old location are performed.

4* 35 4: y_post + y_post ≤ 0y_posty_post ≤ 0y_0 + y_0 ≤ 0y_0y_0 ≤ 0x_post + x_post ≤ 0x_postx_post ≤ 0x_0 + x_0 ≤ 0x_0x_0 ≤ 0source_post + source_post ≤ 0source_postsource_post ≤ 0source_0 + source_0 ≤ 0source_0source_0 ≤ 0nodecount_post + nodecount_post ≤ 0nodecount_postnodecount_post ≤ 0nodecount_0 + nodecount_0 ≤ 0nodecount_0nodecount_0 ≤ 0j_post + j_post ≤ 0j_postj_post ≤ 0j_0 + j_0 ≤ 0j_0j_0 ≤ 0i_post + i_post ≤ 0i_posti_post ≤ 0i_0 + i_0 ≤ 0i_0i_0 ≤ 0edgecount_post + edgecount_post ≤ 0edgecount_postedgecount_post ≤ 0edgecount_0 + edgecount_0 ≤ 0edgecount_0edgecount_0 ≤ 0___const_5_0 + ___const_5_0 ≤ 0___const_5_0___const_5_0 ≤ 0___const_20_0 + ___const_20_0 ≤ 0___const_20_0___const_20_0 ≤ 0

7 Location Addition

The following skip-transition is inserted and corresponding redirections w.r.t. the old location are performed.

4 33 4_var_snapshot: y_post + y_post ≤ 0y_posty_post ≤ 0y_0 + y_0 ≤ 0y_0y_0 ≤ 0x_post + x_post ≤ 0x_postx_post ≤ 0x_0 + x_0 ≤ 0x_0x_0 ≤ 0source_post + source_post ≤ 0source_postsource_post ≤ 0source_0 + source_0 ≤ 0source_0source_0 ≤ 0nodecount_post + nodecount_post ≤ 0nodecount_postnodecount_post ≤ 0nodecount_0 + nodecount_0 ≤ 0nodecount_0nodecount_0 ≤ 0j_post + j_post ≤ 0j_postj_post ≤ 0j_0 + j_0 ≤ 0j_0j_0 ≤ 0i_post + i_post ≤ 0i_posti_post ≤ 0i_0 + i_0 ≤ 0i_0i_0 ≤ 0edgecount_post + edgecount_post ≤ 0edgecount_postedgecount_post ≤ 0edgecount_0 + edgecount_0 ≤ 0edgecount_0edgecount_0 ≤ 0___const_5_0 + ___const_5_0 ≤ 0___const_5_0___const_5_0 ≤ 0___const_20_0 + ___const_20_0 ≤ 0___const_20_0___const_20_0 ≤ 0

8 Location Addition

The following skip-transition is inserted and corresponding redirections w.r.t. the old location are performed.

6* 42 6: y_post + y_post ≤ 0y_posty_post ≤ 0y_0 + y_0 ≤ 0y_0y_0 ≤ 0x_post + x_post ≤ 0x_postx_post ≤ 0x_0 + x_0 ≤ 0x_0x_0 ≤ 0source_post + source_post ≤ 0source_postsource_post ≤ 0source_0 + source_0 ≤ 0source_0source_0 ≤ 0nodecount_post + nodecount_post ≤ 0nodecount_postnodecount_post ≤ 0nodecount_0 + nodecount_0 ≤ 0nodecount_0nodecount_0 ≤ 0j_post + j_post ≤ 0j_postj_post ≤ 0j_0 + j_0 ≤ 0j_0j_0 ≤ 0i_post + i_post ≤ 0i_posti_post ≤ 0i_0 + i_0 ≤ 0i_0i_0 ≤ 0edgecount_post + edgecount_post ≤ 0edgecount_postedgecount_post ≤ 0edgecount_0 + edgecount_0 ≤ 0edgecount_0edgecount_0 ≤ 0___const_5_0 + ___const_5_0 ≤ 0___const_5_0___const_5_0 ≤ 0___const_20_0 + ___const_20_0 ≤ 0___const_20_0___const_20_0 ≤ 0

9 Location Addition

The following skip-transition is inserted and corresponding redirections w.r.t. the old location are performed.

6 40 6_var_snapshot: y_post + y_post ≤ 0y_posty_post ≤ 0y_0 + y_0 ≤ 0y_0y_0 ≤ 0x_post + x_post ≤ 0x_postx_post ≤ 0x_0 + x_0 ≤ 0x_0x_0 ≤ 0source_post + source_post ≤ 0source_postsource_post ≤ 0source_0 + source_0 ≤ 0source_0source_0 ≤ 0nodecount_post + nodecount_post ≤ 0nodecount_postnodecount_post ≤ 0nodecount_0 + nodecount_0 ≤ 0nodecount_0nodecount_0 ≤ 0j_post + j_post ≤ 0j_postj_post ≤ 0j_0 + j_0 ≤ 0j_0j_0 ≤ 0i_post + i_post ≤ 0i_posti_post ≤ 0i_0 + i_0 ≤ 0i_0i_0 ≤ 0edgecount_post + edgecount_post ≤ 0edgecount_postedgecount_post ≤ 0edgecount_0 + edgecount_0 ≤ 0edgecount_0edgecount_0 ≤ 0___const_5_0 + ___const_5_0 ≤ 0___const_5_0___const_5_0 ≤ 0___const_20_0 + ___const_20_0 ≤ 0___const_20_0___const_20_0 ≤ 0

10 Location Addition

The following skip-transition is inserted and corresponding redirections w.r.t. the old location are performed.

8* 49 8: y_post + y_post ≤ 0y_posty_post ≤ 0y_0 + y_0 ≤ 0y_0y_0 ≤ 0x_post + x_post ≤ 0x_postx_post ≤ 0x_0 + x_0 ≤ 0x_0x_0 ≤ 0source_post + source_post ≤ 0source_postsource_post ≤ 0source_0 + source_0 ≤ 0source_0source_0 ≤ 0nodecount_post + nodecount_post ≤ 0nodecount_postnodecount_post ≤ 0nodecount_0 + nodecount_0 ≤ 0nodecount_0nodecount_0 ≤ 0j_post + j_post ≤ 0j_postj_post ≤ 0j_0 + j_0 ≤ 0j_0j_0 ≤ 0i_post + i_post ≤ 0i_posti_post ≤ 0i_0 + i_0 ≤ 0i_0i_0 ≤ 0edgecount_post + edgecount_post ≤ 0edgecount_postedgecount_post ≤ 0edgecount_0 + edgecount_0 ≤ 0edgecount_0edgecount_0 ≤ 0___const_5_0 + ___const_5_0 ≤ 0___const_5_0___const_5_0 ≤ 0___const_20_0 + ___const_20_0 ≤ 0___const_20_0___const_20_0 ≤ 0

11 Location Addition

The following skip-transition is inserted and corresponding redirections w.r.t. the old location are performed.

8 47 8_var_snapshot: y_post + y_post ≤ 0y_posty_post ≤ 0y_0 + y_0 ≤ 0y_0y_0 ≤ 0x_post + x_post ≤ 0x_postx_post ≤ 0x_0 + x_0 ≤ 0x_0x_0 ≤ 0source_post + source_post ≤ 0source_postsource_post ≤ 0source_0 + source_0 ≤ 0source_0source_0 ≤ 0nodecount_post + nodecount_post ≤ 0nodecount_postnodecount_post ≤ 0nodecount_0 + nodecount_0 ≤ 0nodecount_0nodecount_0 ≤ 0j_post + j_post ≤ 0j_postj_post ≤ 0j_0 + j_0 ≤ 0j_0j_0 ≤ 0i_post + i_post ≤ 0i_posti_post ≤ 0i_0 + i_0 ≤ 0i_0i_0 ≤ 0edgecount_post + edgecount_post ≤ 0edgecount_postedgecount_post ≤ 0edgecount_0 + edgecount_0 ≤ 0edgecount_0edgecount_0 ≤ 0___const_5_0 + ___const_5_0 ≤ 0___const_5_0___const_5_0 ≤ 0___const_20_0 + ___const_20_0 ≤ 0___const_20_0___const_20_0 ≤ 0

12 Location Addition

The following skip-transition is inserted and corresponding redirections w.r.t. the old location are performed.

12* 56 12: y_post + y_post ≤ 0y_posty_post ≤ 0y_0 + y_0 ≤ 0y_0y_0 ≤ 0x_post + x_post ≤ 0x_postx_post ≤ 0x_0 + x_0 ≤ 0x_0x_0 ≤ 0source_post + source_post ≤ 0source_postsource_post ≤ 0source_0 + source_0 ≤ 0source_0source_0 ≤ 0nodecount_post + nodecount_post ≤ 0nodecount_postnodecount_post ≤ 0nodecount_0 + nodecount_0 ≤ 0nodecount_0nodecount_0 ≤ 0j_post + j_post ≤ 0j_postj_post ≤ 0j_0 + j_0 ≤ 0j_0j_0 ≤ 0i_post + i_post ≤ 0i_posti_post ≤ 0i_0 + i_0 ≤ 0i_0i_0 ≤ 0edgecount_post + edgecount_post ≤ 0edgecount_postedgecount_post ≤ 0edgecount_0 + edgecount_0 ≤ 0edgecount_0edgecount_0 ≤ 0___const_5_0 + ___const_5_0 ≤ 0___const_5_0___const_5_0 ≤ 0___const_20_0 + ___const_20_0 ≤ 0___const_20_0___const_20_0 ≤ 0

13 Location Addition

The following skip-transition is inserted and corresponding redirections w.r.t. the old location are performed.

12 54 12_var_snapshot: y_post + y_post ≤ 0y_posty_post ≤ 0y_0 + y_0 ≤ 0y_0y_0 ≤ 0x_post + x_post ≤ 0x_postx_post ≤ 0x_0 + x_0 ≤ 0x_0x_0 ≤ 0source_post + source_post ≤ 0source_postsource_post ≤ 0source_0 + source_0 ≤ 0source_0source_0 ≤ 0nodecount_post + nodecount_post ≤ 0nodecount_postnodecount_post ≤ 0nodecount_0 + nodecount_0 ≤ 0nodecount_0nodecount_0 ≤ 0j_post + j_post ≤ 0j_postj_post ≤ 0j_0 + j_0 ≤ 0j_0j_0 ≤ 0i_post + i_post ≤ 0i_posti_post ≤ 0i_0 + i_0 ≤ 0i_0i_0 ≤ 0edgecount_post + edgecount_post ≤ 0edgecount_postedgecount_post ≤ 0edgecount_0 + edgecount_0 ≤ 0edgecount_0edgecount_0 ≤ 0___const_5_0 + ___const_5_0 ≤ 0___const_5_0___const_5_0 ≤ 0___const_20_0 + ___const_20_0 ≤ 0___const_20_0___const_20_0 ≤ 0

14 SCC Decomposition

We consider subproblems for each of the 4 SCC(s) of the program graph.

14.1 SCC Subproblem 1/4

Here we consider the SCC { 4, 15, 4_var_snapshot, 4* }.

14.1.1 Transition Removal

We remove transition 22 using the following ranking functions, which are bounded by 3.

4: 2 − 4⋅i_0 + 4⋅nodecount_0
15: −4⋅i_0 + 4⋅nodecount_0
4_var_snapshot: 1 − 4⋅i_0 + 4⋅nodecount_0
4*: 3 − 4⋅i_0 + 4⋅nodecount_0

14.1.2 Transition Removal

We remove transitions 35, 20 using the following ranking functions, which are bounded by −3.

4: −1
15: −3
4_var_snapshot: −2
4*: 0

14.1.3 Transition Removal

We remove transition 33 using the following ranking functions, which are bounded by 0.

4: 1
15: 0
4_var_snapshot: 0
4*: 0

14.1.4 Splitting Cut-Point Transitions

We consider 1 subproblems corresponding to sets of cut-point transitions as follows.

14.1.4.1 Cut-Point Subproblem 1/1

Here we consider cut-point transition 32.

14.1.4.1.1 Splitting Cut-Point Transitions

There remain no cut-point transition to consider. Hence the cooperation termination is trivial.

14.2 SCC Subproblem 2/4

Here we consider the SCC { 0, 1, 3, 1_var_snapshot, 1* }.

14.2.1 Transition Removal

We remove transition 3 using the following ranking functions, which are bounded by 2.

0: −2 + 4⋅edgecount_0 − 4⋅i_0
1: 1 + 4⋅edgecount_0 − 4⋅i_0
3: −1 + 4⋅edgecount_0 − 4⋅i_0
1_var_snapshot: 4⋅edgecount_0 − 4⋅i_0
1*: 2 + 4⋅edgecount_0 − 4⋅i_0

14.2.2 Transition Removal

We remove transitions 26, 28, 0, 19 using the following ranking functions, which are bounded by −4.

0: 0
1: −2
3: −4
1_var_snapshot: −3
1*: −1

14.2.3 Splitting Cut-Point Transitions

We consider 1 subproblems corresponding to sets of cut-point transitions as follows.

14.2.3.1 Cut-Point Subproblem 1/1

Here we consider cut-point transition 25.

14.2.3.1.1 Splitting Cut-Point Transitions

There remain no cut-point transition to consider. Hence the cooperation termination is trivial.

14.3 SCC Subproblem 3/4

Here we consider the SCC { 5, 6, 7, 8, 9, 6_var_snapshot, 6*, 8_var_snapshot, 8* }.

14.3.1 Transition Removal

We remove transition 8 using the following ranking functions, which are bounded by 5.

5: −5⋅i_0 + 5⋅nodecount_0
6: −5⋅i_0 + 5⋅nodecount_0
7: −5⋅i_0 + 5⋅nodecount_0
8: 3 − 5⋅i_0 + 5⋅nodecount_0
9: 1 − 5⋅i_0 + 5⋅nodecount_0
6_var_snapshot: −5⋅i_0 + 5⋅nodecount_0
6*: −5⋅i_0 + 5⋅nodecount_0
8_var_snapshot: 2 − 5⋅i_0 + 5⋅nodecount_0
8*: 4 − 5⋅i_0 + 5⋅nodecount_0

14.3.2 Transition Removal

We remove transition 6 using the following ranking functions, which are bounded by 3.

5: −2 + 5⋅edgecount_0 − 5⋅j_0
6: 1 + 5⋅edgecount_0 − 5⋅j_0
7: −1 + 5⋅edgecount_0 − 5⋅j_0
8: −3 + 5⋅edgecount_0 − 5⋅j_0
9: −5 + 5⋅edgecount_0 − 5⋅j_0
6_var_snapshot: 5⋅edgecount_0 − 5⋅j_0
6*: 2 + 5⋅edgecount_0 − 5⋅j_0
8_var_snapshot: −4 + 5⋅edgecount_0 − 5⋅j_0
8*: −2 + 5⋅edgecount_0 − 5⋅j_0

14.3.3 Transition Removal

We remove transitions 40, 42, 47, 49, 4, 5, 17, 18 using the following ranking functions, which are bounded by −5.

5: 3
6: 1
7: −1
8: −3
9: −5
6_var_snapshot: 0
6*: 2
8_var_snapshot: −4
8*: −2

14.3.4 Splitting Cut-Point Transitions

We consider 2 subproblems corresponding to sets of cut-point transitions as follows.

14.3.4.1 Cut-Point Subproblem 1/2

Here we consider cut-point transition 39.

14.3.4.1.1 Splitting Cut-Point Transitions

There remain no cut-point transition to consider. Hence the cooperation termination is trivial.

14.3.4.2 Cut-Point Subproblem 2/2

Here we consider cut-point transition 46.

14.3.4.2.1 Splitting Cut-Point Transitions

There remain no cut-point transition to consider. Hence the cooperation termination is trivial.

14.4 SCC Subproblem 4/4

Here we consider the SCC { 10, 11, 12, 13, 14, 12_var_snapshot, 12* }.

14.4.1 Transition Removal

We remove transitions 12, 13 using the following ranking functions, which are bounded by −3.

10: −3 − 7⋅i_0 + 7⋅source_0
11: −4 − 7⋅i_0 + 7⋅source_0
12: 1 − 7⋅i_0 + 7⋅source_0
13: −2 − 7⋅i_0 + 7⋅source_0
14: −1 − 7⋅i_0 + 7⋅source_0
12_var_snapshot: −7⋅i_0 + 7⋅source_0
12*: 2 − 7⋅i_0 + 7⋅source_0

14.4.2 Transition Removal

We remove transition 15 using the following ranking functions, which are bounded by 5.

10: −3 − 7⋅i_0 + 7⋅nodecount_0
11: −4 − 7⋅i_0 + 7⋅nodecount_0
12: 1 − 7⋅i_0 + 7⋅nodecount_0
13: −2 − 7⋅i_0 + 7⋅nodecount_0
14: −1 − 7⋅i_0 + 7⋅nodecount_0
12_var_snapshot: −7⋅i_0 + 7⋅nodecount_0
12*: 2 − 7⋅i_0 + 7⋅nodecount_0

14.4.3 Transition Removal

We remove transitions 54, 56, 10, 11, 16 using the following ranking functions, which are bounded by −6.

10: −1
11: −2
12: −4
13: 0
14: −6
12_var_snapshot: −5
12*: −3

14.4.4 Transition Removal

We remove transition 9 using the following ranking functions, which are bounded by 0.

10: 1
11: 0
12: 0
13: 0
14: 0
12_var_snapshot: 0
12*: 0

14.4.5 Splitting Cut-Point Transitions

We consider 1 subproblems corresponding to sets of cut-point transitions as follows.

14.4.5.1 Cut-Point Subproblem 1/1

Here we consider cut-point transition 53.

14.4.5.1.1 Splitting Cut-Point Transitions

There remain no cut-point transition to consider. Hence the cooperation termination is trivial.

Tool configuration

T2Cert