Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r167-tall-174881266200103.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool gold2024
Input is QuasiCertifProtocol-PT-28, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r167-tall-174881266200103
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.0M
-rw-r--r-- 1 mcc users 135K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 817K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 16K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 109K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 21K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 94K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 36K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 127K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 750K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 17K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 106K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.0K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.9K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 749K May 29 14:32 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME QuasiCertifProtocol-PT-28-UpperBounds-00
FORMULA_NAME QuasiCertifProtocol-PT-28-UpperBounds-01
FORMULA_NAME QuasiCertifProtocol-PT-28-UpperBounds-02
FORMULA_NAME QuasiCertifProtocol-PT-28-UpperBounds-03
FORMULA_NAME QuasiCertifProtocol-PT-28-UpperBounds-04
FORMULA_NAME QuasiCertifProtocol-PT-28-UpperBounds-05
FORMULA_NAME QuasiCertifProtocol-PT-28-UpperBounds-06
FORMULA_NAME QuasiCertifProtocol-PT-28-UpperBounds-07
FORMULA_NAME QuasiCertifProtocol-PT-28-UpperBounds-08
FORMULA_NAME QuasiCertifProtocol-PT-28-UpperBounds-09
FORMULA_NAME QuasiCertifProtocol-PT-28-UpperBounds-10
FORMULA_NAME QuasiCertifProtocol-PT-28-UpperBounds-11
FORMULA_NAME QuasiCertifProtocol-PT-28-UpperBounds-12
FORMULA_NAME QuasiCertifProtocol-PT-28-UpperBounds-13
FORMULA_NAME QuasiCertifProtocol-PT-28-UpperBounds-14
FORMULA_NAME QuasiCertifProtocol-PT-28-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748900427157

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-PT-28
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-06-02 21:40:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-02 21:40:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 21:40:28] [INFO ] Load time of PNML (sax parser for PT used): 135 ms
[2025-06-02 21:40:28] [INFO ] Transformed 2998 places.
[2025-06-02 21:40:28] [INFO ] Transformed 446 transitions.
[2025-06-02 21:40:28] [INFO ] Parsed PT model containing 2998 places and 446 transitions and 6489 arcs in 247 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Reduction of identical properties reduced properties to check from 16 to 15
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 16, 0, 0, 1, 1] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 16, 0, 0, 1, 1] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 446 rows 2998 cols
[2025-06-02 21:40:28] [INFO ] Computed 2553 invariants in 172 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 16, 0, 0, 1, 1] Max Struct:[841, 841, 1, 16, +inf, +inf, +inf, 1, 29, 29, 16, 1, +inf, +inf, 29]
FORMULA QuasiCertifProtocol-PT-28-UpperBounds-10 16 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 10000 steps (304 resets) in 102 ms. (97 steps per ms)
FORMULA QuasiCertifProtocol-PT-28-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA QuasiCertifProtocol-PT-28-UpperBounds-03 16 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 120012 steps (171 resets) in 227 ms. (526 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1] Max Struct:[841, 841, 1, +inf, +inf, +inf, 1, 29, 29, +inf, +inf, 29]
[2025-06-02 21:40:29] [INFO ] Invariant cache hit.
[2025-06-02 21:40:29] [INFO ] [Real]Absence check using 32 positive place invariants in 72 ms returned sat
[2025-06-02 21:40:30] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 461 ms returned sat
[2025-06-02 21:40:31] [INFO ] [Real]Absence check using state equation in 1604 ms returned sat
[2025-06-02 21:40:32] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:40:32] [INFO ] [Nat]Absence check using 32 positive place invariants in 59 ms returned sat
[2025-06-02 21:40:32] [INFO ] [Nat]Absence check using 32 positive and 2521 generalized place invariants in 479 ms returned sat
[2025-06-02 21:40:36] [INFO ] [Nat]Absence check using state equation in 3289 ms returned sat
[2025-06-02 21:40:36] [INFO ] Deduced a trap composed of 9 places in 178 ms of which 22 ms to minimize.
[2025-06-02 21:40:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 335 ms
[2025-06-02 21:40:36] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 73 ms.
Maximisation of solution failed !
Minimization took 2 ms.
[2025-06-02 21:40:37] [INFO ] [Real]Absence check using 32 positive place invariants in 75 ms returned sat
[2025-06-02 21:40:38] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 476 ms returned sat
[2025-06-02 21:40:39] [INFO ] [Real]Absence check using state equation in 1274 ms returned sat
[2025-06-02 21:40:39] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:40:39] [INFO ] [Nat]Absence check using 32 positive place invariants in 54 ms returned sat
[2025-06-02 21:40:40] [INFO ] [Nat]Absence check using 32 positive and 2521 generalized place invariants in 469 ms returned sat
[2025-06-02 21:40:41] [INFO ] [Nat]Absence check using state equation in 1594 ms returned sat
[2025-06-02 21:40:41] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 43 ms.
[2025-06-02 21:40:43] [INFO ] Added : 80 causal constraints over 16 iterations in 1264 ms. Result :sat
Minimization took 574 ms.
[2025-06-02 21:40:44] [INFO ] [Real]Absence check using 32 positive place invariants in 56 ms returned sat
[2025-06-02 21:40:44] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 439 ms returned sat
[2025-06-02 21:40:45] [INFO ] [Real]Absence check using state equation in 1231 ms returned sat
[2025-06-02 21:40:45] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 35 ms.
[2025-06-02 21:40:47] [INFO ] Added : 71 causal constraints over 15 iterations in 1233 ms. Result :sat
Minimization took 552 ms.
[2025-06-02 21:40:47] [INFO ] [Real]Absence check using 32 positive place invariants in 54 ms returned sat
[2025-06-02 21:40:48] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 493 ms returned sat
[2025-06-02 21:40:49] [INFO ] [Real]Absence check using state equation in 1361 ms returned sat
[2025-06-02 21:40:49] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:40:50] [INFO ] [Nat]Absence check using 32 positive place invariants in 62 ms returned sat
[2025-06-02 21:40:50] [INFO ] [Nat]Absence check using 32 positive and 2521 generalized place invariants in 435 ms returned sat
[2025-06-02 21:40:52] [INFO ] [Nat]Absence check using state equation in 2230 ms returned sat
[2025-06-02 21:40:52] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 42 ms.
[2025-06-02 21:40:53] [INFO ] Added : 61 causal constraints over 13 iterations in 955 ms. Result :sat
Minimization took 561 ms.
[2025-06-02 21:40:54] [INFO ] [Real]Absence check using 32 positive place invariants in 58 ms returned sat
[2025-06-02 21:40:55] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 478 ms returned sat
[2025-06-02 21:40:58] [INFO ] [Real]Absence check using state equation in 3021 ms returned sat
[2025-06-02 21:40:58] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:40:58] [INFO ] [Nat]Absence check using 32 positive place invariants in 55 ms returned sat
[2025-06-02 21:40:59] [INFO ] [Nat]Absence check using 32 positive and 2521 generalized place invariants in 412 ms returned sat
[2025-06-02 21:41:02] [INFO ] [Nat]Absence check using state equation in 3044 ms returned sat
[2025-06-02 21:41:03] [INFO ] Deduced a trap composed of 10 places in 1626 ms of which 16 ms to minimize.
[2025-06-02 21:41:03] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 4
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2025-06-02 21:41:04] [INFO ] [Real]Absence check using 32 positive place invariants in 53 ms returned sat
[2025-06-02 21:41:04] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 441 ms returned sat
[2025-06-02 21:41:07] [INFO ] [Real]Absence check using state equation in 2667 ms returned sat
[2025-06-02 21:41:07] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:41:07] [INFO ] [Nat]Absence check using 32 positive place invariants in 51 ms returned sat
[2025-06-02 21:41:08] [INFO ] [Nat]Absence check using 32 positive and 2521 generalized place invariants in 454 ms returned sat
[2025-06-02 21:41:10] [INFO ] [Nat]Absence check using state equation in 2703 ms returned sat
[2025-06-02 21:41:10] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 34 ms.
Maximisation of solution failed !
Minimization took 1 ms.
[2025-06-02 21:41:12] [INFO ] [Real]Absence check using 32 positive place invariants in 50 ms returned sat
[2025-06-02 21:41:13] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 452 ms returned sat
[2025-06-02 21:41:14] [INFO ] [Real]Absence check using state equation in 1267 ms returned sat
[2025-06-02 21:41:14] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 48 ms.
[2025-06-02 21:41:15] [INFO ] Added : 29 causal constraints over 6 iterations in 547 ms. Result :sat
Minimization took 551 ms.
[2025-06-02 21:41:16] [INFO ] [Real]Absence check using 32 positive place invariants in 51 ms returned sat
[2025-06-02 21:41:16] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 428 ms returned sat
[2025-06-02 21:41:17] [INFO ] [Real]Absence check using state equation in 1134 ms returned sat
[2025-06-02 21:41:17] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 31 ms.
[2025-06-02 21:41:17] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:41:18] [INFO ] [Nat]Absence check using 32 positive place invariants in 52 ms returned sat
[2025-06-02 21:41:18] [INFO ] [Nat]Absence check using 32 positive and 2521 generalized place invariants in 436 ms returned sat
[2025-06-02 21:41:20] [INFO ] [Nat]Absence check using state equation in 1533 ms returned sat
[2025-06-02 21:41:20] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 38 ms.
[2025-06-02 21:41:22] [INFO ] Added : 137 causal constraints over 28 iterations in 1995 ms. Result :sat
Minimization took 550 ms.
[2025-06-02 21:41:23] [INFO ] [Real]Absence check using 32 positive place invariants in 52 ms returned sat
[2025-06-02 21:41:23] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 470 ms returned sat
[2025-06-02 21:41:25] [INFO ] [Real]Absence check using state equation in 1609 ms returned sat
[2025-06-02 21:41:25] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 34 ms.
[2025-06-02 21:41:27] [INFO ] Added : 148 causal constraints over 30 iterations in 2297 ms. Result :sat
Minimization took 143 ms.
[2025-06-02 21:41:28] [INFO ] [Real]Absence check using 32 positive place invariants in 51 ms returned sat
[2025-06-02 21:41:28] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 433 ms returned sat
[2025-06-02 21:41:29] [INFO ] [Real]Absence check using state equation in 1432 ms returned sat
[2025-06-02 21:41:30] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 41 ms.
[2025-06-02 21:41:32] [INFO ] Added : 148 causal constraints over 30 iterations in 2414 ms. Result :sat
Minimization took 235 ms.
[2025-06-02 21:41:33] [INFO ] [Real]Absence check using 32 positive place invariants in 51 ms returned sat
[2025-06-02 21:41:33] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 851 ms returned sat
[2025-06-02 21:41:36] [INFO ] [Real]Absence check using state equation in 2446 ms returned unsat
[2025-06-02 21:41:36] [INFO ] [Real]Absence check using 32 positive place invariants in 52 ms returned sat
[2025-06-02 21:41:37] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 482 ms returned sat
[2025-06-02 21:41:37] [INFO ] [Real]Absence check using state equation in 93 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1] Max Struct:[841, 841, 1, +inf, +inf, +inf, 1, 29, 29, +inf, 1, 1]
FORMULA QuasiCertifProtocol-PT-28-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-28-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[841, 841, 1, +inf, +inf, +inf, 1, 29, 29, +inf]
Support contains 149 out of 2998 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2998/2998 places, 446/446 transitions.
Graph (complete) has 30318 edges and 2998 vertex of which 2965 are kept as prefixes of interest. Removing 33 places using SCC suffix rule.15 ms
Discarding 33 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 147 transitions
Reduce isomorphic transitions removed 147 transitions.
Discarding 29 places :
Implicit places reduction removed 29 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 203 rules applied. Total rules applied 204 place count 2936 transition count 272
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 231 place count 2909 transition count 272
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 30 Pre rules applied. Total rules applied 231 place count 2909 transition count 242
Deduced a syphon composed of 30 places in 2 ms
Ensure Unique test removed 57 places
Reduce places removed 87 places and 0 transitions.
Iterating global reduction 2 with 117 rules applied. Total rules applied 348 place count 2822 transition count 242
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 348 place count 2822 transition count 241
Deduced a syphon composed of 1 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 351 place count 2820 transition count 241
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 409 place count 2791 transition count 212
Applied a total of 409 rules in 549 ms. Remains 2791 /2998 variables (removed 207) and now considering 212/446 (removed 234) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 559 ms. Remains : 2791/2998 places, 212/446 transitions.
When looking for a positive semi flow solution, solver replied unsat
// Phase 1: matrix 212 rows 2791 cols
[2025-06-02 21:41:38] [INFO ] Computed 2579 invariants in 24 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[29, 841, 1, +inf, +inf, +inf, 1, 29, 3, +inf]
RANDOM walk for 1000000 steps (29838 resets) in 7355 ms. (135 steps per ms)
FORMULA QuasiCertifProtocol-PT-28-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA QuasiCertifProtocol-PT-28-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA QuasiCertifProtocol-PT-28-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 8000007 steps (13215 resets) in 16728 ms. (478 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 29, 29, 0, 21, 0, 0, 0] Max Struct:[29, 841, +inf, +inf, +inf, 29, 3, +inf]
[2025-06-02 21:42:02] [INFO ] Invariant cache hit.
[2025-06-02 21:42:02] [INFO ] [Real]Absence check using 29 positive place invariants in 45 ms returned sat
[2025-06-02 21:42:03] [INFO ] [Real]Absence check using 29 positive and 2550 generalized place invariants in 645 ms returned sat
[2025-06-02 21:42:04] [INFO ] [Real]Absence check using state equation in 824 ms returned sat
[2025-06-02 21:42:04] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:42:04] [INFO ] [Nat]Absence check using 29 positive place invariants in 34 ms returned sat
[2025-06-02 21:42:05] [INFO ] [Nat]Absence check using 29 positive and 2550 generalized place invariants in 1095 ms returned sat
[2025-06-02 21:42:06] [INFO ] [Nat]Absence check using state equation in 1221 ms returned sat
[2025-06-02 21:42:06] [INFO ] Computed and/alt/rep : 122/151/122 causal constraints (skipped 89 transitions) in 23 ms.
[2025-06-02 21:42:07] [INFO ] Added : 61 causal constraints over 13 iterations in 825 ms. Result :sat
Minimization took 6189 ms.
[2025-06-02 21:42:14] [INFO ] [Real]Absence check using 29 positive place invariants in 27 ms returned sat
[2025-06-02 21:42:14] [INFO ] [Real]Absence check using 29 positive and 2550 generalized place invariants in 507 ms returned sat
[2025-06-02 21:42:16] [INFO ] [Real]Absence check using state equation in 1976 ms returned unsat
[2025-06-02 21:42:16] [INFO ] [Real]Absence check using 29 positive place invariants in 32 ms returned sat
[2025-06-02 21:42:17] [INFO ] [Real]Absence check using 29 positive and 2550 generalized place invariants in 454 ms returned sat
[2025-06-02 21:42:17] [INFO ] [Real]Absence check using state equation in 646 ms returned unsat
[2025-06-02 21:42:18] [INFO ] [Real]Absence check using 29 positive place invariants in 28 ms returned sat
[2025-06-02 21:42:18] [INFO ] [Real]Absence check using 29 positive and 2550 generalized place invariants in 497 ms returned sat
[2025-06-02 21:42:20] [INFO ] [Real]Absence check using state equation in 1767 ms returned sat
[2025-06-02 21:42:20] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:42:20] [INFO ] [Nat]Absence check using 29 positive place invariants in 29 ms returned sat
[2025-06-02 21:42:21] [INFO ] [Nat]Absence check using 29 positive and 2550 generalized place invariants in 478 ms returned sat
[2025-06-02 21:42:23] [INFO ] [Nat]Absence check using state equation in 2294 ms returned sat
[2025-06-02 21:42:23] [INFO ] Computed and/alt/rep : 122/151/122 causal constraints (skipped 89 transitions) in 22 ms.
[2025-06-02 21:42:24] [INFO ] Added : 61 causal constraints over 13 iterations in 805 ms. Result :sat
Minimization took 5587 ms.
[2025-06-02 21:42:30] [INFO ] [Real]Absence check using 29 positive place invariants in 26 ms returned sat
[2025-06-02 21:42:30] [INFO ] [Real]Absence check using 29 positive and 2550 generalized place invariants in 484 ms returned sat
[2025-06-02 21:42:31] [INFO ] [Real]Absence check using state equation in 782 ms returned sat
[2025-06-02 21:42:31] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:42:31] [INFO ] [Nat]Absence check using 29 positive place invariants in 29 ms returned sat
[2025-06-02 21:42:32] [INFO ] [Nat]Absence check using 29 positive and 2550 generalized place invariants in 480 ms returned sat
[2025-06-02 21:42:33] [INFO ] [Nat]Absence check using state equation in 764 ms returned sat
[2025-06-02 21:42:33] [INFO ] Computed and/alt/rep : 122/151/122 causal constraints (skipped 89 transitions) in 22 ms.
[2025-06-02 21:42:34] [INFO ] Added : 65 causal constraints over 13 iterations in 844 ms. Result :sat
Minimization took 5573 ms.
[2025-06-02 21:42:39] [INFO ] [Real]Absence check using 29 positive place invariants in 27 ms returned sat
[2025-06-02 21:42:40] [INFO ] [Real]Absence check using 29 positive and 2550 generalized place invariants in 483 ms returned sat
[2025-06-02 21:42:41] [INFO ] [Real]Absence check using state equation in 791 ms returned sat
[2025-06-02 21:42:41] [INFO ] Computed and/alt/rep : 122/151/122 causal constraints (skipped 89 transitions) in 22 ms.
[2025-06-02 21:42:42] [INFO ] Added : 75 causal constraints over 15 iterations in 1022 ms. Result :sat
Minimization took 7164 ms.
[2025-06-02 21:42:49] [INFO ] [Real]Absence check using 29 positive place invariants in 27 ms returned sat
[2025-06-02 21:42:50] [INFO ] [Real]Absence check using 29 positive and 2550 generalized place invariants in 509 ms returned sat
[2025-06-02 21:42:51] [INFO ] [Real]Absence check using state equation in 914 ms returned sat
[2025-06-02 21:42:51] [INFO ] Computed and/alt/rep : 122/151/122 causal constraints (skipped 89 transitions) in 26 ms.
[2025-06-02 21:42:52] [INFO ] Added : 70 causal constraints over 14 iterations in 1086 ms. Result :sat
Minimization took 6263 ms.
[2025-06-02 21:42:59] [INFO ] [Real]Absence check using 29 positive place invariants in 34 ms returned sat
[2025-06-02 21:42:59] [INFO ] [Real]Absence check using 29 positive and 2550 generalized place invariants in 509 ms returned sat
[2025-06-02 21:43:00] [INFO ] [Real]Absence check using state equation in 706 ms returned sat
[2025-06-02 21:43:00] [INFO ] Computed and/alt/rep : 122/151/122 causal constraints (skipped 89 transitions) in 19 ms.
[2025-06-02 21:43:01] [INFO ] Added : 70 causal constraints over 14 iterations in 922 ms. Result :sat
Minimization took 5639 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 29, 29, 0, 21, 0, 0, 0] Max Struct:[29, 29, 29, +inf, +inf, 29, 3, +inf]
FORMULA QuasiCertifProtocol-PT-28-UpperBounds-04 29 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-28-UpperBounds-01 29 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 21, 0, 0, 0] Max Struct:[29, +inf, +inf, 29, 3, +inf]
Support contains 89 out of 2791 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2791/2791 places, 212/212 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Discarding 29 places :
Implicit places reduction removed 29 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 62 rules applied. Total rules applied 62 place count 2762 transition count 179
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 64 place count 2760 transition count 179
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 29 Pre rules applied. Total rules applied 64 place count 2760 transition count 150
Deduced a syphon composed of 29 places in 1 ms
Ensure Unique test removed 29 places
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 2 with 87 rules applied. Total rules applied 151 place count 2702 transition count 150
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 152 place count 2702 transition count 149
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 153 place count 2701 transition count 149
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 154 place count 2700 transition count 148
Applied a total of 154 rules in 414 ms. Remains 2700 /2791 variables (removed 91) and now considering 148/212 (removed 64) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 414 ms. Remains : 2700/2791 places, 148/212 transitions.
When looking for a positive semi flow solution, solver replied unsat
// Phase 1: matrix 148 rows 2700 cols
[2025-06-02 21:43:07] [INFO ] Computed 2552 invariants in 7 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 21, 0, 0, 0] Max Struct:[29, +inf, +inf, 29, 3, +inf]
RANDOM walk for 1000000 steps (8403 resets) in 25344 ms. (39 steps per ms)
BEST_FIRST walk for 2719379 steps (1206 resets) in 30006 ms. (90 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[20, 29, 29, 1, 1, 1] Max Struct:[29, +inf, +inf, 29, 3, +inf]
[2025-06-02 21:44:02] [INFO ] Invariant cache hit.
[2025-06-02 21:44:03] [INFO ] [Real]Absence check using 29 positive place invariants in 26 ms returned sat
[2025-06-02 21:44:03] [INFO ] [Real]Absence check using 29 positive and 2523 generalized place invariants in 458 ms returned sat
[2025-06-02 21:44:04] [INFO ] [Real]Absence check using state equation in 963 ms returned sat
[2025-06-02 21:44:04] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:44:04] [INFO ] [Nat]Absence check using 29 positive place invariants in 26 ms returned sat
[2025-06-02 21:44:05] [INFO ] [Nat]Absence check using 29 positive and 2523 generalized place invariants in 464 ms returned sat
[2025-06-02 21:44:06] [INFO ] [Nat]Absence check using state equation in 928 ms returned sat
[2025-06-02 21:44:06] [INFO ] Computed and/alt/rep : 31/31/31 causal constraints (skipped 88 transitions) in 20 ms.
[2025-06-02 21:44:06] [INFO ] Added : 1 causal constraints over 1 iterations in 149 ms. Result :sat
Minimization took 4443 ms.
[2025-06-02 21:44:11] [INFO ] [Real]Absence check using 29 positive place invariants in 26 ms returned sat
[2025-06-02 21:44:11] [INFO ] [Real]Absence check using 29 positive and 2523 generalized place invariants in 453 ms returned sat
[2025-06-02 21:44:13] [INFO ] [Real]Absence check using state equation in 1428 ms returned unsat
[2025-06-02 21:44:13] [INFO ] [Real]Absence check using 29 positive place invariants in 25 ms returned sat
[2025-06-02 21:44:13] [INFO ] [Real]Absence check using 29 positive and 2523 generalized place invariants in 431 ms returned sat
[2025-06-02 21:44:13] [INFO ] [Real]Absence check using state equation in 62 ms returned unsat
[2025-06-02 21:44:14] [INFO ] [Real]Absence check using 29 positive place invariants in 29 ms returned sat
[2025-06-02 21:44:14] [INFO ] [Real]Absence check using 29 positive and 2523 generalized place invariants in 466 ms returned sat
[2025-06-02 21:44:16] [INFO ] [Real]Absence check using state equation in 1966 ms returned unsat
[2025-06-02 21:44:16] [INFO ] [Real]Absence check using 29 positive place invariants in 25 ms returned sat
[2025-06-02 21:44:17] [INFO ] [Real]Absence check using 29 positive and 2523 generalized place invariants in 396 ms returned unsat
[2025-06-02 21:44:17] [INFO ] [Real]Absence check using 29 positive place invariants in 29 ms returned sat
[2025-06-02 21:44:18] [INFO ] [Real]Absence check using 29 positive and 2523 generalized place invariants in 470 ms returned sat
[2025-06-02 21:44:20] [INFO ] [Real]Absence check using state equation in 2141 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[20, 29, 29, 1, 1, 1] Max Struct:[29, 29, 29, 1, 1, 1]
FORMULA QuasiCertifProtocol-PT-28-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-28-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-28-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-28-UpperBounds-06 29 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-28-UpperBounds-05 29 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[29] Max Struct:[29]
Support contains 29 out of 2700 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2700/2700 places, 148/148 transitions.
Graph (complete) has 52288 edges and 2700 vertex of which 2669 are kept as prefixes of interest. Removing 31 places using SCC suffix rule.4 ms
Discarding 31 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 31 rules applied. Total rules applied 32 place count 2669 transition count 116
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 33 place count 2668 transition count 116
Reduce places removed 29 places and 29 transitions.
Iterating global reduction 2 with 29 rules applied. Total rules applied 62 place count 2639 transition count 87
Ensure Unique test removed 841 places
Iterating post reduction 2 with 841 rules applied. Total rules applied 903 place count 1798 transition count 87
Reduce places removed 29 places and 29 transitions.
Iterating global reduction 3 with 29 rules applied. Total rules applied 932 place count 1769 transition count 58
Ensure Unique test removed 841 places
Iterating post reduction 3 with 841 rules applied. Total rules applied 1773 place count 928 transition count 58
Reduce places removed 29 places and 29 transitions.
Iterating global reduction 4 with 29 rules applied. Total rules applied 1802 place count 899 transition count 29
Ensure Unique test removed 841 places
Iterating post reduction 4 with 841 rules applied. Total rules applied 2643 place count 58 transition count 29
Applied a total of 2643 rules in 234 ms. Remains 58 /2700 variables (removed 2642) and now considering 29/148 (removed 119) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 234 ms. Remains : 58/2700 places, 29/148 transitions.
// Phase 1: matrix 29 rows 58 cols
[2025-06-02 21:44:20] [INFO ] Computed 29 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[29] Max Struct:[29]
FORMULA QuasiCertifProtocol-PT-28-UpperBounds-00 29 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (33333 resets) in 1275 ms. (783 steps per ms)
BEST_FIRST walk for 0 steps (0 resets) in 0 ms. (0 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2025-06-02 21:44:22] [INFO ] Flatten gal took : 116 ms
[2025-06-02 21:44:22] [INFO ] Flatten gal took : 4 ms
[2025-06-02 21:44:22] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5979744215682412814.gal : 3 ms
[2025-06-02 21:44:22] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18098072042489307116.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality5979744215682412814.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality18098072042489307116.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 233912 ms.

BK_STOP 1748900662335

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="QuasiCertifProtocol-PT-28"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2024"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
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-5832"
echo " Executing tool gold2024"
echo " Input is QuasiCertifProtocol-PT-28, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r167-tall-174881266200103"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-PT-28.tgz
mv QuasiCertifProtocol-PT-28 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "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 [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "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 "UpperBounds.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 '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
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 ;