fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r034-smll-171620175100217
Last Updated
July 7, 2024

About the Execution of GreatSPN+red for AutonomousCar-PT-09a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
10606.436 160393.00 486400.00 415.70 T normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r034-smll-171620175100217.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is AutonomousCar-PT-09a, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r034-smll-171620175100217
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 22 14:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 19 17:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.5K Apr 12 18:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 47K Apr 12 18:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Apr 12 18:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Apr 12 18:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 781K May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME QuasiLiveness

=== Now, execution of the tool begins

BK_START 1716247794981

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=AutonomousCar-PT-09a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-20 23:29:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2024-05-20 23:29:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-20 23:29:58] [INFO ] Load time of PNML (sax parser for PT used): 619 ms
[2024-05-20 23:29:58] [INFO ] Transformed 89 places.
[2024-05-20 23:29:58] [INFO ] Transformed 1249 transitions.
[2024-05-20 23:29:58] [INFO ] Found NUPN structural information;
[2024-05-20 23:29:58] [INFO ] Parsed PT model containing 89 places and 1249 transitions and 15631 arcs in 941 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 89/89 places, 1249/1249 transitions.
Ensure Unique test removed 345 transitions
Reduce isomorphic transitions removed 345 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 355 rules applied. Total rules applied 355 place count 89 transition count 894
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 365 place count 79 transition count 894
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 6 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 369 place count 77 transition count 892
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 371 place count 76 transition count 892
Applied a total of 371 rules in 231 ms. Remains 76 /89 variables (removed 13) and now considering 892/1249 (removed 357) transitions.
[2024-05-20 23:29:59] [INFO ] Flow matrix only has 891 transitions (discarded 1 similar events)
// Phase 1: matrix 891 rows 76 cols
[2024-05-20 23:29:59] [INFO ] Computed 14 invariants in 59 ms
[2024-05-20 23:30:00] [INFO ] Implicit Places using invariants in 1697 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1776 ms to find 1 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 75/89 places, 892/1249 transitions.
Applied a total of 0 rules in 11 ms. Remains 75 /75 variables (removed 0) and now considering 892/892 (removed 0) transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 2059 ms. Remains : 75/89 places, 892/1249 transitions.
Discarding 49 transitions out of 892. Remains 843
Initial state reduction rules removed 1 formulas.
RANDOM walk for 40000 steps (2524 resets) in 6413 ms. (6 steps per ms) remains 563/842 properties
BEST_FIRST walk for 124 steps (0 resets) in 6 ms. (17 steps per ms) remains 563/563 properties
BEST_FIRST walk for 124 steps (0 resets) in 8 ms. (13 steps per ms) remains 563/563 properties
BEST_FIRST walk for 124 steps (0 resets) in 7 ms. (15 steps per ms) remains 563/563 properties
BEST_FIRST walk for 124 steps (0 resets) in 7 ms. (15 steps per ms) remains 563/563 properties
BEST_FIRST walk for 124 steps (0 resets) in 6 ms. (17 steps per ms) remains 563/563 properties
BEST_FIRST walk for 124 steps (0 resets) in 7 ms. (15 steps per ms) remains 563/563 properties
BEST_FIRST walk for 124 steps (0 resets) in 6 ms. (17 steps per ms) remains 563/563 properties
BEST_FIRST walk for 124 steps (0 resets) in 7 ms. (15 steps per ms) remains 563/563 properties
BEST_FIRST walk for 124 steps (0 resets) in 7 ms. (15 steps per ms) remains 563/563 properties
BEST_FIRST walk for 124 steps (0 resets) in 8 ms. (13 steps per ms) remains 563/563 properties
BEST_FIRST walk for 124 steps (0 resets) in 6 ms. (17 steps per ms) remains 563/563 properties
BEST_FIRST walk for 124 steps (0 resets) in 5 ms. (20 steps per ms) remains 563/563 properties
BEST_FIRST walk for 124 steps (0 resets) in 8 ms. (13 steps per ms) remains 563/563 properties
BEST_FIRST walk for 124 steps (0 resets) in 8 ms. (13 steps per ms) remains 563/563 properties
BEST_FIRST walk for 124 steps (0 resets) in 6 ms. (17 steps per ms) remains 563/563 properties
BEST_FIRST walk for 124 steps (0 resets) in 5 ms. (20 steps per ms) remains 563/563 properties
BEST_FIRST walk for 124 steps (0 resets) in 5 ms. (20 steps per ms) remains 563/563 properties
BEST_FIRST walk for 124 steps (0 resets) in 7 ms. (15 steps per ms) remains 563/563 properties
BEST_FIRST walk for 124 steps (0 resets) in 8 ms. (13 steps per ms) remains 563/563 properties
BEST_FIRST walk for 124 steps (0 resets) in 8 ms. (13 steps per ms) remains 563/563 properties
BEST_FIRST walk for 124 steps (0 resets) in 6 ms. (17 steps per ms) remains 563/563 properties
BEST_FIRST walk for 124 steps (0 resets) in 8 ms. (13 steps per ms) remains 563/563 properties
BEST_FIRST walk for 124 steps (0 resets) in 8 ms. (13 steps per ms) remains 563/563 properties
BEST_FIRST walk for 124 steps (0 resets) in 6 ms. (17 steps per ms) remains 563/563 properties
BEST_FIRST walk for 124 steps (0 resets) in 7 ms. (15 steps per ms) remains 563/563 properties
BEST_FIRST walk for 124 steps (0 resets) in 6 ms. (17 steps per ms) remains 563/563 properties
BEST_FIRST walk for 124 steps (0 resets) in 5 ms. (20 steps per ms) remains 563/563 properties
BEST_FIRST walk for 124 steps (0 resets) in 5 ms. (20 steps per ms) remains 563/563 properties
BEST_FIRST walk for 124 steps (0 resets) in 6 ms. (17 steps per ms) remains 563/563 properties
BEST_FIRST walk for 124 steps (0 resets) in 7 ms. (15 steps per ms) remains 563/563 properties
BEST_FIRST walk for 124 steps (0 resets) in 7 ms. (15 steps per ms) remains 563/563 properties
BEST_FIRST walk for 124 steps (0 resets) in 5 ms. (20 steps per ms) remains 563/563 properties
BEST_FIRST walk for 124 steps (0 resets) in 6 ms. (17 steps per ms) remains 563/563 properties
BEST_FIRST walk for 124 steps (0 resets) in 6 ms. (17 steps per ms) remains 563/563 properties
BEST_FIRST walk for 124 steps (0 resets) in 8 ms. (13 steps per ms) remains 563/563 properties
BEST_FIRST walk for 124 steps (0 resets) in 8 ms. (13 steps per ms) remains 563/563 properties
BEST_FIRST walk for 124 steps (0 resets) in 5 ms. (20 steps per ms) remains 563/563 properties
BEST_FIRST walk for 124 steps (0 resets) in 5 ms. (20 steps per ms) remains 563/563 properties
BEST_FIRST walk for 124 steps (0 resets) in 7 ms. (15 steps per ms) remains 563/563 properties
BEST_FIRST walk for 124 steps (0 resets) in 8 ms. (13 steps per ms) remains 563/563 properties
BEST_FIRST walk for 124 steps (0 resets) in 5 ms. (20 steps per ms) remains 563/563 properties
BEST_FIRST walk for 124 steps (0 resets) in 6 ms. (17 steps per ms) remains 563/563 properties
BEST_FIRST walk for 124 steps (0 resets) in 6 ms. (17 steps per ms) remains 563/563 properties
BEST_FIRST walk for 124 steps (0 resets) in 6 ms. (17 steps per ms) remains 563/563 properties
BEST_FIRST walk for 124 steps (0 resets) in 7 ms. (15 steps per ms) remains 563/563 properties
BEST_FIRST walk for 124 steps (0 resets) in 7 ms. (15 steps per ms) remains 563/563 properties
BEST_FIRST walk for 124 steps (0 resets) in 6 ms. (17 steps per ms) remains 563/563 properties
BEST_FIRST walk for 124 steps (0 resets) in 7 ms. (15 steps per ms) remains 563/563 properties
BEST_FIRST walk for 124 steps (0 resets) in 6 ms. (17 steps per ms) remains 563/563 properties
BEST_FIRST walk for 124 steps (0 resets) in 6 ms. (17 steps per ms) remains 563/563 properties
[2024-05-20 23:30:02] [INFO ] Flow matrix only has 891 transitions (discarded 1 similar events)
// Phase 1: matrix 891 rows 75 cols
[2024-05-20 23:30:02] [INFO ] Computed 13 invariants in 13 ms
[2024-05-20 23:30:03] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 563 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 563 unsolved
SMT process timed out in 20160ms, After SMT, problems are : Problem set: 0 solved, 563 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 56 out of 75 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 892/892 transitions.
Graph (complete) has 1003 edges and 75 vertex of which 73 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.38 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Applied a total of 1 rules in 235 ms. Remains 73 /75 variables (removed 2) and now considering 890/892 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 240 ms. Remains : 73/75 places, 890/892 transitions.
RANDOM walk for 3650774 steps (232353 resets) in 120004 ms. (30 steps per ms) remains 53/563 properties
BEST_FIRST walk for 400004 steps (1279 resets) in 1011 ms. (395 steps per ms) remains 52/53 properties
BEST_FIRST walk for 400004 steps (1495 resets) in 1100 ms. (363 steps per ms) remains 52/52 properties
BEST_FIRST walk for 400003 steps (1494 resets) in 1098 ms. (363 steps per ms) remains 51/52 properties
BEST_FIRST walk for 400003 steps (1473 resets) in 950 ms. (420 steps per ms) remains 50/51 properties
BEST_FIRST walk for 400004 steps (1284 resets) in 657 ms. (607 steps per ms) remains 49/50 properties
BEST_FIRST walk for 400004 steps (1270 resets) in 663 ms. (602 steps per ms) remains 46/49 properties
BEST_FIRST walk for 400004 steps (1273 resets) in 642 ms. (622 steps per ms) remains 43/46 properties
BEST_FIRST walk for 400003 steps (1376 resets) in 692 ms. (577 steps per ms) remains 42/43 properties
BEST_FIRST walk for 400004 steps (1497 resets) in 656 ms. (608 steps per ms) remains 42/42 properties
BEST_FIRST walk for 400003 steps (1487 resets) in 636 ms. (627 steps per ms) remains 41/42 properties
BEST_FIRST walk for 400004 steps (1293 resets) in 632 ms. (631 steps per ms) remains 38/41 properties
BEST_FIRST walk for 400003 steps (1291 resets) in 631 ms. (632 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (1498 resets) in 635 ms. (628 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (1489 resets) in 633 ms. (630 steps per ms) remains 37/38 properties
BEST_FIRST walk for 400004 steps (1495 resets) in 627 ms. (636 steps per ms) remains 36/37 properties
BEST_FIRST walk for 400003 steps (1292 resets) in 618 ms. (646 steps per ms) remains 35/36 properties
BEST_FIRST walk for 400004 steps (1491 resets) in 620 ms. (644 steps per ms) remains 35/35 properties
BEST_FIRST walk for 400004 steps (1505 resets) in 619 ms. (645 steps per ms) remains 34/35 properties
BEST_FIRST walk for 400004 steps (1482 resets) in 612 ms. (652 steps per ms) remains 33/34 properties
BEST_FIRST walk for 400003 steps (1491 resets) in 598 ms. (667 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400003 steps (1287 resets) in 604 ms. (661 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400004 steps (1295 resets) in 596 ms. (670 steps per ms) remains 31/33 properties
BEST_FIRST walk for 400004 steps (1494 resets) in 597 ms. (668 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400004 steps (1499 resets) in 597 ms. (668 steps per ms) remains 30/31 properties
BEST_FIRST walk for 400004 steps (1491 resets) in 599 ms. (666 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400003 steps (1469 resets) in 596 ms. (670 steps per ms) remains 29/30 properties
BEST_FIRST walk for 400004 steps (1482 resets) in 606 ms. (658 steps per ms) remains 28/29 properties
BEST_FIRST walk for 400004 steps (1291 resets) in 594 ms. (672 steps per ms) remains 26/28 properties
BEST_FIRST walk for 400004 steps (1289 resets) in 591 ms. (675 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (1289 resets) in 595 ms. (671 steps per ms) remains 25/26 properties
BEST_FIRST walk for 400004 steps (1485 resets) in 603 ms. (662 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400004 steps (1480 resets) in 624 ms. (640 steps per ms) remains 24/25 properties
BEST_FIRST walk for 400004 steps (1480 resets) in 841 ms. (475 steps per ms) remains 23/24 properties
BEST_FIRST walk for 400004 steps (1303 resets) in 816 ms. (489 steps per ms) remains 22/23 properties
BEST_FIRST walk for 400004 steps (1510 resets) in 624 ms. (640 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400004 steps (1464 resets) in 610 ms. (654 steps per ms) remains 21/22 properties
BEST_FIRST walk for 400003 steps (1286 resets) in 666 ms. (599 steps per ms) remains 20/21 properties
BEST_FIRST walk for 400004 steps (1402 resets) in 924 ms. (432 steps per ms) remains 20/20 properties
// Phase 1: matrix 890 rows 73 cols
[2024-05-20 23:31:00] [INFO ] Computed 11 invariants in 13 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 44/67 variables, 10/33 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 44/77 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 2/69 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 2/80 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/69 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 890/959 variables, 69/149 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/959 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 10 (OVERLAPS) 4/963 variables, 4/153 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/963 variables, 4/157 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/963 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 13 (OVERLAPS) 0/963 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 963/963 variables, and 157 constraints, problems are : Problem set: 0 solved, 20 unsolved in 3477 ms.
Refiners :[Domain max(s): 73/73 constraints, Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 73/73 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 44/67 variables, 10/33 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 44/77 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 2/69 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 2/80 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/69 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 890/959 variables, 69/149 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/959 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 10 (OVERLAPS) 4/963 variables, 4/153 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/963 variables, 4/157 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/963 variables, 20/177 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/963 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 14 (OVERLAPS) 0/963 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 963/963 variables, and 177 constraints, problems are : Problem set: 0 solved, 20 unsolved in 13550 ms.
Refiners :[Domain max(s): 73/73 constraints, Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 73/73 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 17482ms problems are : Problem set: 0 solved, 20 unsolved
Fused 20 Parikh solutions to 13 different solutions.
Parikh walk visited 0 properties in 1738 ms.
Support contains 23 out of 73 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 73/73 places, 890/890 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 72 transition count 880
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 72 transition count 880
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 72 transition count 879
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 13 place count 71 transition count 870
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 70 transition count 869
Applied a total of 14 rules in 273 ms. Remains 70 /73 variables (removed 3) and now considering 869/890 (removed 21) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 273 ms. Remains : 70/73 places, 869/890 transitions.
RANDOM walk for 4000000 steps (259014 resets) in 49544 ms. (80 steps per ms) remains 15/20 properties
BEST_FIRST walk for 400004 steps (1264 resets) in 538 ms. (742 steps per ms) remains 15/15 properties
BEST_FIRST walk for 400004 steps (1488 resets) in 439 ms. (909 steps per ms) remains 15/15 properties
BEST_FIRST walk for 400004 steps (1281 resets) in 440 ms. (907 steps per ms) remains 15/15 properties
BEST_FIRST walk for 400004 steps (1498 resets) in 438 ms. (911 steps per ms) remains 15/15 properties
BEST_FIRST walk for 400004 steps (1266 resets) in 448 ms. (890 steps per ms) remains 15/15 properties
BEST_FIRST walk for 400003 steps (1492 resets) in 451 ms. (884 steps per ms) remains 15/15 properties
BEST_FIRST walk for 400004 steps (1502 resets) in 428 ms. (932 steps per ms) remains 15/15 properties
BEST_FIRST walk for 400004 steps (1249 resets) in 451 ms. (884 steps per ms) remains 15/15 properties
BEST_FIRST walk for 400004 steps (1501 resets) in 426 ms. (936 steps per ms) remains 15/15 properties
BEST_FIRST walk for 400004 steps (1268 resets) in 449 ms. (888 steps per ms) remains 15/15 properties
BEST_FIRST walk for 400003 steps (1489 resets) in 436 ms. (915 steps per ms) remains 15/15 properties
BEST_FIRST walk for 400004 steps (1263 resets) in 450 ms. (886 steps per ms) remains 15/15 properties
BEST_FIRST walk for 400004 steps (1480 resets) in 440 ms. (907 steps per ms) remains 15/15 properties
BEST_FIRST walk for 400004 steps (1268 resets) in 513 ms. (778 steps per ms) remains 15/15 properties
BEST_FIRST walk for 400004 steps (1346 resets) in 452 ms. (883 steps per ms) remains 14/15 properties
// Phase 1: matrix 869 rows 70 cols
[2024-05-20 23:31:34] [INFO ] Computed 11 invariants in 8 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 46/64 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 868/932 variables, 64/74 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/932 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 7/939 variables, 6/80 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/939 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/939 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (OVERLAPS) 0/939 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 939/939 variables, and 81 constraints, problems are : Problem set: 0 solved, 14 unsolved in 2103 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 70/70 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 46/64 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 868/932 variables, 64/74 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/932 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 7/939 variables, 6/80 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/939 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/939 variables, 14/95 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/939 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (OVERLAPS) 0/939 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Int declared 939/939 variables, and 95 constraints, problems are : Problem set: 0 solved, 14 unsolved in 6813 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 70/70 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
After SMT, in 9284ms problems are : Problem set: 0 solved, 14 unsolved
Fused 14 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 18 out of 70 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 70/70 places, 869/869 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 68 transition count 849
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 68 transition count 849
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 68 transition count 848
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 15 place count 67 transition count 839
Applied a total of 15 rules in 184 ms. Remains 67 /70 variables (removed 3) and now considering 839/869 (removed 30) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 185 ms. Remains : 67/70 places, 839/869 transitions.
RANDOM walk for 4000000 steps (241202 resets) in 47216 ms. (84 steps per ms) remains 8/14 properties
BEST_FIRST walk for 4000004 steps (14621 resets) in 4387 ms. (911 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4000003 steps (14631 resets) in 4343 ms. (920 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4000004 steps (12237 resets) in 4416 ms. (905 steps per ms) remains 6/8 properties
BEST_FIRST walk for 4000003 steps (12280 resets) in 4466 ms. (895 steps per ms) remains 6/6 properties
BEST_FIRST walk for 4000004 steps (14552 resets) in 4288 ms. (932 steps per ms) remains 5/6 properties
BEST_FIRST walk for 4000004 steps (13262 resets) in 4349 ms. (919 steps per ms) remains 4/5 properties
// Phase 1: matrix 839 rows 67 cols
[2024-05-20 23:32:04] [INFO ] Computed 11 invariants in 12 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 22/29 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 812/841 variables, 29/33 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/841 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 65/906 variables, 38/71 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/906 variables, 7/78 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/906 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 0/906 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 906/906 variables, and 78 constraints, problems are : Problem set: 0 solved, 4 unsolved in 791 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 67/67 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 22/29 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 812/841 variables, 29/33 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/841 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 65/906 variables, 38/71 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/906 variables, 7/78 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/906 variables, 4/82 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/906 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 0/906 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 906/906 variables, and 82 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1414 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 67/67 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 2293ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 1 ms.
Support contains 7 out of 67 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 67/67 places, 839/839 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 63 transition count 799
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 63 transition count 799
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 14 place count 63 transition count 793
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 54 transitions
Reduce isomorphic transitions removed 54 transitions.
Iterating post reduction 0 with 60 rules applied. Total rules applied 74 place count 57 transition count 739
Applied a total of 74 rules in 98 ms. Remains 57 /67 variables (removed 10) and now considering 739/839 (removed 100) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 99 ms. Remains : 57/67 places, 739/839 transitions.
RANDOM walk for 4000000 steps (42959 resets) in 48414 ms. (82 steps per ms) remains 1/4 properties
BEST_FIRST walk for 4000004 steps (13654 resets) in 4612 ms. (867 steps per ms) remains 1/1 properties
// Phase 1: matrix 739 rows 57 cols
[2024-05-20 23:32:20] [INFO ] Computed 11 invariants in 12 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 708/720 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/720 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 76/796 variables, 45/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/796 variables, 10/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/796 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/796 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 796/796 variables, and 68 constraints, problems are : Problem set: 0 solved, 1 unsolved in 393 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 57/57 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 708/720 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/720 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 76/796 variables, 45/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/796 variables, 10/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/796 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/796 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/796 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 796/796 variables, and 69 constraints, problems are : Problem set: 0 solved, 1 unsolved in 627 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 57/57 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1077ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 57 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 57/57 places, 739/739 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 55 transition count 719
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 55 transition count 719
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 55 transition count 718
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 15 place count 54 transition count 709
Applied a total of 15 rules in 117 ms. Remains 54 /57 variables (removed 3) and now considering 709/739 (removed 30) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 117 ms. Remains : 54/57 places, 709/739 transitions.
RANDOM walk for 4000000 steps (24896 resets) in 47422 ms. (84 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000004 steps (18748 resets) in 4476 ms. (893 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 141341 steps, run visited all 1 properties in 589 ms. (steps per millisecond=239 )
Probabilistic random walk after 141341 steps, saw 20489 distinct states, run finished after 597 ms. (steps per millisecond=236 ) properties seen :1
Able to resolve query QuasiLiveness after proving 843 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK PROBABILISTIC_WALK BESTFIRST_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 157555 ms.
ITS solved all properties within timeout

BK_STOP 1716247955374

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination QuasiLiveness -timeout 180 -rebuildPNML

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="AutonomousCar-PT-09a"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is AutonomousCar-PT-09a, examination is QuasiLiveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r034-smll-171620175100217"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/AutonomousCar-PT-09a.tgz
mv AutonomousCar-PT-09a execution
cd execution
if [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "UpperBounds" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] || [ "QuasiLiveness" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "QuasiLiveness" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "QuasiLiveness" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "QuasiLiveness.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property QuasiLiveness.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "QuasiLiveness.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' QuasiLiveness.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] ; then
echo "FORMULA_NAME QuasiLiveness"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;