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.r571-tall-171734910200096.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 gold2023
Input is CO4-PT-20, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r571-tall-171734910200096
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 712K
-rw-r--r-- 1 mcc users 7.2K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 9.3K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 96K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 32K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 336K Jun 2 16:33 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

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

=== Now, execution of the tool begins

BK_START 1717368927859

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CO4-PT-20
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-06-02 22:55:29] [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]
[2024-06-02 22:55:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 22:55:29] [INFO ] Load time of PNML (sax parser for PT used): 87 ms
[2024-06-02 22:55:29] [INFO ] Transformed 1178 places.
[2024-06-02 22:55:29] [INFO ] Transformed 1463 transitions.
[2024-06-02 22:55:29] [INFO ] Found NUPN structural information;
[2024-06-02 22:55:29] [INFO ] Parsed PT model containing 1178 places and 1463 transitions and 3734 arcs in 158 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 4 ms.
Deduced a syphon composed of 187 places in 16 ms
Reduce places removed 187 places and 251 transitions.
FORMULA CO4-PT-20-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-20-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-20-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 1212 rows 991 cols
[2024-06-02 22:55:29] [INFO ] Computed 12 invariants in 30 ms
Incomplete random walk after 10000 steps, including 205 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 13) seen :2
FORMULA CO4-PT-20-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CO4-PT-20-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 34 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 11) seen :2
FORMULA CO4-PT-20-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-20-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 9) seen :0
[2024-06-02 22:55:29] [INFO ] Invariant cache hit.
[2024-06-02 22:55:30] [INFO ] [Real]Absence check using 10 positive place invariants in 19 ms returned sat
[2024-06-02 22:55:30] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 2 ms returned sat
[2024-06-02 22:55:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 22:55:30] [INFO ] [Real]Absence check using state equation in 315 ms returned sat
[2024-06-02 22:55:30] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:55:30] [INFO ] [Nat]Absence check using 10 positive place invariants in 17 ms returned sat
[2024-06-02 22:55:30] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 2 ms returned sat
[2024-06-02 22:55:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 22:55:30] [INFO ] [Nat]Absence check using state equation in 298 ms returned sat
[2024-06-02 22:55:31] [INFO ] Computed and/alt/rep : 1011/1378/1011 causal constraints (skipped 200 transitions) in 69 ms.
[2024-06-02 22:55:33] [INFO ] Added : 183 causal constraints over 37 iterations in 2180 ms. Result :sat
Minimization took 164 ms.
[2024-06-02 22:55:33] [INFO ] [Real]Absence check using 10 positive place invariants in 15 ms returned sat
[2024-06-02 22:55:33] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2024-06-02 22:55:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 22:55:33] [INFO ] [Real]Absence check using state equation in 301 ms returned sat
[2024-06-02 22:55:33] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:55:34] [INFO ] [Nat]Absence check using 10 positive place invariants in 17 ms returned sat
[2024-06-02 22:55:34] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 5 ms returned sat
[2024-06-02 22:55:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 22:55:34] [INFO ] [Nat]Absence check using state equation in 303 ms returned sat
[2024-06-02 22:55:34] [INFO ] Deduced a trap composed of 371 places in 256 ms of which 3 ms to minimize.
[2024-06-02 22:55:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 354 ms
[2024-06-02 22:55:34] [INFO ] Computed and/alt/rep : 1011/1378/1011 causal constraints (skipped 200 transitions) in 74 ms.
[2024-06-02 22:55:36] [INFO ] Added : 150 causal constraints over 30 iterations in 1734 ms. Result :sat
Minimization took 146 ms.
[2024-06-02 22:55:36] [INFO ] [Real]Absence check using 10 positive place invariants in 16 ms returned sat
[2024-06-02 22:55:36] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 2 ms returned sat
[2024-06-02 22:55:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 22:55:37] [INFO ] [Real]Absence check using state equation in 283 ms returned sat
[2024-06-02 22:55:37] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:55:37] [INFO ] [Nat]Absence check using 10 positive place invariants in 17 ms returned sat
[2024-06-02 22:55:37] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 3 ms returned sat
[2024-06-02 22:55:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 22:55:37] [INFO ] [Nat]Absence check using state equation in 282 ms returned sat
[2024-06-02 22:55:37] [INFO ] Deduced a trap composed of 142 places in 260 ms of which 1 ms to minimize.
[2024-06-02 22:55:38] [INFO ] Deduced a trap composed of 453 places in 259 ms of which 1 ms to minimize.
[2024-06-02 22:55:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 661 ms
[2024-06-02 22:55:38] [INFO ] Computed and/alt/rep : 1011/1378/1011 causal constraints (skipped 200 transitions) in 66 ms.
[2024-06-02 22:55:39] [INFO ] Added : 82 causal constraints over 17 iterations in 997 ms. Result :sat
Minimization took 117 ms.
[2024-06-02 22:55:39] [INFO ] [Real]Absence check using 10 positive place invariants in 15 ms returned sat
[2024-06-02 22:55:39] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 2 ms returned sat
[2024-06-02 22:55:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 22:55:39] [INFO ] [Real]Absence check using state equation in 301 ms returned sat
[2024-06-02 22:55:39] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:55:40] [INFO ] [Nat]Absence check using 10 positive place invariants in 16 ms returned sat
[2024-06-02 22:55:40] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2024-06-02 22:55:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 22:55:40] [INFO ] [Nat]Absence check using state equation in 296 ms returned sat
[2024-06-02 22:55:40] [INFO ] Computed and/alt/rep : 1011/1378/1011 causal constraints (skipped 200 transitions) in 53 ms.
[2024-06-02 22:55:42] [INFO ] Deduced a trap composed of 24 places in 253 ms of which 1 ms to minimize.
[2024-06-02 22:55:42] [INFO ] Deduced a trap composed of 386 places in 251 ms of which 1 ms to minimize.
[2024-06-02 22:55:43] [INFO ] Deduced a trap composed of 280 places in 240 ms of which 1 ms to minimize.
[2024-06-02 22:55:43] [INFO ] Deduced a trap composed of 500 places in 245 ms of which 1 ms to minimize.
[2024-06-02 22:55:43] [INFO ] Deduced a trap composed of 310 places in 171 ms of which 1 ms to minimize.
[2024-06-02 22:55:43] [INFO ] Deduced a trap composed of 317 places in 170 ms of which 0 ms to minimize.
[2024-06-02 22:55:44] [INFO ] Deduced a trap composed of 308 places in 168 ms of which 1 ms to minimize.
[2024-06-02 22:55:44] [INFO ] Deduced a trap composed of 645 places in 232 ms of which 1 ms to minimize.
[2024-06-02 22:55:44] [INFO ] Deduced a trap composed of 446 places in 228 ms of which 1 ms to minimize.
[2024-06-02 22:55:44] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2502 ms
[2024-06-02 22:55:44] [INFO ] Added : 175 causal constraints over 35 iterations in 4470 ms. Result :sat
Minimization took 48 ms.
[2024-06-02 22:55:45] [INFO ] [Real]Absence check using 10 positive place invariants in 19 ms returned sat
[2024-06-02 22:55:45] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2024-06-02 22:55:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 22:55:45] [INFO ] [Real]Absence check using state equation in 296 ms returned sat
[2024-06-02 22:55:45] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:55:45] [INFO ] [Nat]Absence check using 10 positive place invariants in 16 ms returned sat
[2024-06-02 22:55:45] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2024-06-02 22:55:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 22:55:45] [INFO ] [Nat]Absence check using state equation in 300 ms returned sat
[2024-06-02 22:55:46] [INFO ] Deduced a trap composed of 445 places in 246 ms of which 0 ms to minimize.
[2024-06-02 22:55:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 330 ms
[2024-06-02 22:55:46] [INFO ] Computed and/alt/rep : 1011/1378/1011 causal constraints (skipped 200 transitions) in 54 ms.
[2024-06-02 22:55:47] [INFO ] Added : 147 causal constraints over 30 iterations in 1674 ms. Result :sat
Minimization took 141 ms.
[2024-06-02 22:55:48] [INFO ] [Real]Absence check using 10 positive place invariants in 15 ms returned sat
[2024-06-02 22:55:48] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2024-06-02 22:55:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 22:55:48] [INFO ] [Real]Absence check using state equation in 276 ms returned sat
[2024-06-02 22:55:48] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:55:48] [INFO ] [Nat]Absence check using 10 positive place invariants in 15 ms returned sat
[2024-06-02 22:55:48] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 2 ms returned sat
[2024-06-02 22:55:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 22:55:48] [INFO ] [Nat]Absence check using state equation in 276 ms returned sat
[2024-06-02 22:55:49] [INFO ] Deduced a trap composed of 362 places in 256 ms of which 1 ms to minimize.
[2024-06-02 22:55:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 358 ms
[2024-06-02 22:55:49] [INFO ] Computed and/alt/rep : 1011/1378/1011 causal constraints (skipped 200 transitions) in 56 ms.
[2024-06-02 22:55:50] [INFO ] Added : 116 causal constraints over 24 iterations in 1379 ms. Result :sat
Minimization took 113 ms.
[2024-06-02 22:55:50] [INFO ] [Real]Absence check using 10 positive place invariants in 14 ms returned sat
[2024-06-02 22:55:50] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 3 ms returned sat
[2024-06-02 22:55:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 22:55:51] [INFO ] [Real]Absence check using state equation in 287 ms returned sat
[2024-06-02 22:55:51] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:55:51] [INFO ] [Nat]Absence check using 10 positive place invariants in 16 ms returned sat
[2024-06-02 22:55:51] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2024-06-02 22:55:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 22:55:51] [INFO ] [Nat]Absence check using state equation in 286 ms returned sat
[2024-06-02 22:55:52] [INFO ] Deduced a trap composed of 362 places in 265 ms of which 0 ms to minimize.
[2024-06-02 22:55:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 383 ms
[2024-06-02 22:55:52] [INFO ] Computed and/alt/rep : 1011/1378/1011 causal constraints (skipped 200 transitions) in 53 ms.
[2024-06-02 22:55:53] [INFO ] Added : 116 causal constraints over 24 iterations in 1363 ms. Result :sat
Minimization took 112 ms.
[2024-06-02 22:55:53] [INFO ] [Real]Absence check using 10 positive place invariants in 14 ms returned sat
[2024-06-02 22:55:53] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2024-06-02 22:55:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 22:55:54] [INFO ] [Real]Absence check using state equation in 285 ms returned sat
[2024-06-02 22:55:54] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:55:54] [INFO ] [Nat]Absence check using 10 positive place invariants in 16 ms returned sat
[2024-06-02 22:55:54] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2024-06-02 22:55:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 22:55:54] [INFO ] [Nat]Absence check using state equation in 299 ms returned sat
[2024-06-02 22:55:54] [INFO ] Computed and/alt/rep : 1011/1378/1011 causal constraints (skipped 200 transitions) in 53 ms.
[2024-06-02 22:55:56] [INFO ] Deduced a trap composed of 24 places in 154 ms of which 0 ms to minimize.
[2024-06-02 22:55:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 245 ms
[2024-06-02 22:55:56] [INFO ] Added : 126 causal constraints over 26 iterations in 1803 ms. Result :sat
Minimization took 139 ms.
[2024-06-02 22:55:56] [INFO ] [Real]Absence check using 10 positive place invariants in 15 ms returned sat
[2024-06-02 22:55:56] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 2 ms returned sat
[2024-06-02 22:55:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 22:55:57] [INFO ] [Real]Absence check using state equation in 301 ms returned sat
[2024-06-02 22:55:57] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:55:57] [INFO ] [Nat]Absence check using 10 positive place invariants in 16 ms returned sat
[2024-06-02 22:55:57] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2024-06-02 22:55:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 22:55:57] [INFO ] [Nat]Absence check using state equation in 301 ms returned sat
[2024-06-02 22:55:57] [INFO ] Deduced a trap composed of 444 places in 225 ms of which 1 ms to minimize.
[2024-06-02 22:55:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 304 ms
[2024-06-02 22:55:57] [INFO ] Computed and/alt/rep : 1011/1378/1011 causal constraints (skipped 200 transitions) in 57 ms.
[2024-06-02 22:56:00] [INFO ] Added : 242 causal constraints over 49 iterations in 2713 ms. Result :sat
Minimization took 176 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
FORMULA CO4-PT-20-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-20-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-20-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-20-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-20-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-20-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 3 out of 991 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 991/991 places, 1212/1212 transitions.
Graph (trivial) has 1016 edges and 991 vertex of which 3 / 991 are part of one of the 1 SCC in 5 ms
Free SCC test removed 2 places
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (complete) has 1661 edges and 989 vertex of which 933 are kept as prefixes of interest. Removing 56 places using SCC suffix rule.3 ms
Discarding 56 places :
Also discarding 26 output transitions
Drop transitions removed 26 transitions
Drop transitions removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Drop transitions removed 607 transitions
Trivial Post-agglo rules discarded 607 transitions
Performed 607 trivial Post agglomeration. Transition count delta: 607
Iterating post reduction 0 with 643 rules applied. Total rules applied 645 place count 933 transition count 540
Reduce places removed 607 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 1 with 637 rules applied. Total rules applied 1282 place count 326 transition count 510
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 2 with 33 rules applied. Total rules applied 1315 place count 312 transition count 491
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 12 rules applied. Total rules applied 1327 place count 306 transition count 485
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 4 with 9 rules applied. Total rules applied 1336 place count 303 transition count 479
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 7 rules applied. Total rules applied 1343 place count 300 transition count 475
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1344 place count 299 transition count 475
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 2 Pre rules applied. Total rules applied 1344 place count 299 transition count 473
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 1348 place count 297 transition count 473
Discarding 50 places :
Symmetric choice reduction at 7 with 50 rule applications. Total rules 1398 place count 247 transition count 423
Iterating global reduction 7 with 50 rules applied. Total rules applied 1448 place count 247 transition count 423
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 14 Pre rules applied. Total rules applied 1448 place count 247 transition count 409
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 7 with 28 rules applied. Total rules applied 1476 place count 233 transition count 409
Discarding 29 places :
Symmetric choice reduction at 7 with 29 rule applications. Total rules 1505 place count 204 transition count 358
Iterating global reduction 7 with 29 rules applied. Total rules applied 1534 place count 204 transition count 358
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 7 rules applied. Total rules applied 1541 place count 204 transition count 351
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1542 place count 203 transition count 351
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 1545 place count 200 transition count 348
Iterating global reduction 9 with 3 rules applied. Total rules applied 1548 place count 200 transition count 348
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 1551 place count 200 transition count 345
Performed 75 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 75 places in 0 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 10 with 150 rules applied. Total rules applied 1701 place count 125 transition count 260
Drop transitions removed 1 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 10 with 5 rules applied. Total rules applied 1706 place count 125 transition count 255
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: -47
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 11 with 78 rules applied. Total rules applied 1784 place count 86 transition count 302
Drop transitions removed 62 transitions
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 82 transitions.
Iterating post reduction 11 with 82 rules applied. Total rules applied 1866 place count 86 transition count 220
Discarding 29 places :
Symmetric choice reduction at 12 with 29 rule applications. Total rules 1895 place count 57 transition count 151
Iterating global reduction 12 with 29 rules applied. Total rules applied 1924 place count 57 transition count 151
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 12 with 21 rules applied. Total rules applied 1945 place count 57 transition count 130
Discarding 7 places :
Symmetric choice reduction at 13 with 7 rule applications. Total rules 1952 place count 50 transition count 101
Iterating global reduction 13 with 7 rules applied. Total rules applied 1959 place count 50 transition count 101
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 13 with 4 rules applied. Total rules applied 1963 place count 50 transition count 97
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 1965 place count 49 transition count 112
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 14 with 3 rules applied. Total rules applied 1968 place count 49 transition count 109
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 15 with 12 rules applied. Total rules applied 1980 place count 49 transition count 97
Discarding 1 places :
Symmetric choice reduction at 15 with 1 rule applications. Total rules 1981 place count 48 transition count 95
Iterating global reduction 15 with 1 rules applied. Total rules applied 1982 place count 48 transition count 95
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 15 with 1 rules applied. Total rules applied 1983 place count 48 transition count 94
Free-agglomeration rule applied 11 times.
Iterating global reduction 16 with 11 rules applied. Total rules applied 1994 place count 48 transition count 83
Reduce places removed 11 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 16 with 13 rules applied. Total rules applied 2007 place count 37 transition count 81
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 17 with 1 rules applied. Total rules applied 2008 place count 37 transition count 81
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 17 with 1 rules applied. Total rules applied 2009 place count 36 transition count 80
Reduce places removed 3 places and 0 transitions.
Graph (trivial) has 18 edges and 33 vertex of which 5 / 33 are part of one of the 2 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 17 with 4 rules applied. Total rules applied 2013 place count 30 transition count 80
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (trivial) has 20 edges and 29 vertex of which 6 / 29 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Iterating post reduction 18 with 10 rules applied. Total rules applied 2023 place count 24 transition count 72
Drop transitions removed 15 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 19 with 23 rules applied. Total rules applied 2046 place count 24 transition count 49
Discarding 1 places :
Symmetric choice reduction at 20 with 1 rule applications. Total rules 2047 place count 23 transition count 47
Iterating global reduction 20 with 1 rules applied. Total rules applied 2048 place count 23 transition count 47
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 20 with 1 rules applied. Total rules applied 2049 place count 23 transition count 46
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 21 with 6 rules applied. Total rules applied 2055 place count 23 transition count 40
Free-agglomeration rule applied 3 times.
Iterating global reduction 21 with 3 rules applied. Total rules applied 2058 place count 23 transition count 37
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 21 with 3 rules applied. Total rules applied 2061 place count 20 transition count 37
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 22 with 2 rules applied. Total rules applied 2063 place count 20 transition count 35
Free-agglomeration rule applied 1 times.
Iterating global reduction 22 with 1 rules applied. Total rules applied 2064 place count 20 transition count 34
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 22 with 3 rules applied. Total rules applied 2067 place count 19 transition count 32
Applied a total of 2067 rules in 160 ms. Remains 19 /991 variables (removed 972) and now considering 32/1212 (removed 1180) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 160 ms. Remains : 19/991 places, 32/1212 transitions.
Successfully produced net in file /tmp/petri1000_3128934658074715420.dot
Successfully produced net in file /tmp/petri1001_9733493248368436998.dot
Drop transitions removed 2 transitions
Dominated transitions for bounds rules discarded 2 transitions
Normalized transition count is 25 out of 30 initially.
// Phase 1: matrix 25 rows 19 cols
[2024-06-02 22:56:01] [INFO ] Computed 7 invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 762 ms. (steps per millisecond=1312 ) properties (out of 3) seen :3
FORMULA CO4-PT-20-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CO4-PT-20-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CO4-PT-20-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 32680 ms.

BK_STOP 1717368962957

--------------------
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.202304061127.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /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="CO4-PT-20"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is CO4-PT-20, 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 r571-tall-171734910200096"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CO4-PT-20.tgz
mv CO4-PT-20 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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -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 ;