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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 784K
-rw-r--r-- 1 mcc users 7.7K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 123K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 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 336K 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 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 1748602027148

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CO4-PT-20
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-05-30 10:47:08] [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-05-30 10:47:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 10:47:08] [INFO ] Load time of PNML (sax parser for PT used): 113 ms
[2025-05-30 10:47:08] [INFO ] Transformed 1178 places.
[2025-05-30 10:47:08] [INFO ] Transformed 1463 transitions.
[2025-05-30 10:47:08] [INFO ] Found NUPN structural information;
[2025-05-30 10:47:08] [INFO ] Parsed PT model containing 1178 places and 1463 transitions and 3734 arcs in 228 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Deduced a syphon composed of 187 places in 16 ms
Reduce places removed 187 places and 251 transitions.
FORMULA CO4-PT-20-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-20-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-20-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-20-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 1212 rows 991 cols
[2025-05-30 10:47:08] [INFO ] Computed 12 invariants in 55 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (210 resets) in 42 ms. (232 steps per ms)
FORMULA CO4-PT-20-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-20-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 100007 steps (349 resets) in 114 ms. (869 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-30 10:47:08] [INFO ] Invariant cache hit.
[2025-05-30 10:47:09] [INFO ] [Real]Absence check using 10 positive place invariants in 20 ms returned sat
[2025-05-30 10:47:09] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 2 ms returned sat
[2025-05-30 10:47:09] [INFO ] [Real]Absence check using state equation in 356 ms returned sat
[2025-05-30 10:47:09] [INFO ] Computed and/alt/rep : 1011/1378/1011 causal constraints (skipped 200 transitions) in 99 ms.
[2025-05-30 10:47:10] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:47:10] [INFO ] [Nat]Absence check using 10 positive place invariants in 18 ms returned sat
[2025-05-30 10:47:10] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 3 ms returned sat
[2025-05-30 10:47:10] [INFO ] [Nat]Absence check using state equation in 299 ms returned sat
[2025-05-30 10:47:10] [INFO ] Computed and/alt/rep : 1011/1378/1011 causal constraints (skipped 200 transitions) in 70 ms.
[2025-05-30 10:47:13] [INFO ] Deduced a trap composed of 69 places in 297 ms of which 38 ms to minimize.
[2025-05-30 10:47:13] [INFO ] Deduced a trap composed of 418 places in 219 ms of which 7 ms to minimize.
[2025-05-30 10:47:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 684 ms
[2025-05-30 10:47:13] [INFO ] Added : 174 causal constraints over 35 iterations in 2910 ms. Result :sat
Minimization took 703 ms.
[2025-05-30 10:47:14] [INFO ] [Real]Absence check using 10 positive place invariants in 18 ms returned sat
[2025-05-30 10:47:14] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 2 ms returned sat
[2025-05-30 10:47:14] [INFO ] [Real]Absence check using state equation in 336 ms returned sat
[2025-05-30 10:47:14] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:47:15] [INFO ] [Nat]Absence check using 10 positive place invariants in 18 ms returned sat
[2025-05-30 10:47:15] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 5 ms returned sat
[2025-05-30 10:47:15] [INFO ] [Nat]Absence check using state equation in 325 ms returned sat
[2025-05-30 10:47:15] [INFO ] Deduced a trap composed of 325 places in 206 ms of which 3 ms to minimize.
[2025-05-30 10:47:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 303 ms
[2025-05-30 10:47:15] [INFO ] Computed and/alt/rep : 1011/1378/1011 causal constraints (skipped 200 transitions) in 99 ms.
[2025-05-30 10:47:17] [INFO ] Deduced a trap composed of 28 places in 80 ms of which 2 ms to minimize.
[2025-05-30 10:47:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 183 ms
[2025-05-30 10:47:17] [INFO ] Added : 154 causal constraints over 32 iterations in 2153 ms. Result :sat
Minimization took 696 ms.
[2025-05-30 10:47:18] [INFO ] [Real]Absence check using 10 positive place invariants in 24 ms returned sat
[2025-05-30 10:47:18] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 3 ms returned sat
[2025-05-30 10:47:19] [INFO ] [Real]Absence check using state equation in 326 ms returned sat
[2025-05-30 10:47:19] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:47:19] [INFO ] [Nat]Absence check using 10 positive place invariants in 18 ms returned sat
[2025-05-30 10:47:19] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 3 ms returned sat
[2025-05-30 10:47:19] [INFO ] [Nat]Absence check using state equation in 311 ms returned sat
[2025-05-30 10:47:19] [INFO ] Computed and/alt/rep : 1011/1378/1011 causal constraints (skipped 200 transitions) in 68 ms.
[2025-05-30 10:47:21] [INFO ] Added : 157 causal constraints over 32 iterations in 1878 ms. Result :sat
Minimization took 676 ms.
[2025-05-30 10:47:22] [INFO ] [Real]Absence check using 10 positive place invariants in 18 ms returned sat
[2025-05-30 10:47:22] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 2 ms returned sat
[2025-05-30 10:47:22] [INFO ] [Real]Absence check using state equation in 320 ms returned sat
[2025-05-30 10:47:22] [INFO ] Computed and/alt/rep : 1011/1378/1011 causal constraints (skipped 200 transitions) in 66 ms.
[2025-05-30 10:47:22] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:47:23] [INFO ] [Nat]Absence check using 10 positive place invariants in 18 ms returned sat
[2025-05-30 10:47:23] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 2 ms returned sat
[2025-05-30 10:47:23] [INFO ] [Nat]Absence check using state equation in 306 ms returned sat
[2025-05-30 10:47:23] [INFO ] Computed and/alt/rep : 1011/1378/1011 causal constraints (skipped 200 transitions) in 55 ms.
[2025-05-30 10:47:25] [INFO ] Added : 156 causal constraints over 32 iterations in 1854 ms. Result :sat
Minimization took 675 ms.
[2025-05-30 10:47:26] [INFO ] [Real]Absence check using 10 positive place invariants in 21 ms returned sat
[2025-05-30 10:47:26] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2025-05-30 10:47:26] [INFO ] [Real]Absence check using state equation in 330 ms returned sat
[2025-05-30 10:47:26] [INFO ] Computed and/alt/rep : 1011/1378/1011 causal constraints (skipped 200 transitions) in 58 ms.
[2025-05-30 10:47:26] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:47:26] [INFO ] [Nat]Absence check using 10 positive place invariants in 18 ms returned sat
[2025-05-30 10:47:26] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2025-05-30 10:47:27] [INFO ] [Nat]Absence check using state equation in 331 ms returned sat
[2025-05-30 10:47:27] [INFO ] Computed and/alt/rep : 1011/1378/1011 causal constraints (skipped 200 transitions) in 59 ms.
[2025-05-30 10:47:28] [INFO ] Added : 132 causal constraints over 27 iterations in 1559 ms. Result :sat
Minimization took 673 ms.
[2025-05-30 10:47:29] [INFO ] [Real]Absence check using 10 positive place invariants in 16 ms returned sat
[2025-05-30 10:47:29] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2025-05-30 10:47:29] [INFO ] [Real]Absence check using state equation in 283 ms returned sat
[2025-05-30 10:47:30] [INFO ] Deduced a trap composed of 27 places in 179 ms of which 4 ms to minimize.
[2025-05-30 10:47:30] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:47:30] [INFO ] [Nat]Absence check using 10 positive place invariants in 18 ms returned sat
[2025-05-30 10:47:30] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2025-05-30 10:47:30] [INFO ] [Nat]Absence check using state equation in 284 ms returned sat
[2025-05-30 10:47:30] [INFO ] Deduced a trap composed of 27 places in 174 ms of which 3 ms to minimize.
[2025-05-30 10:47:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 250 ms
[2025-05-30 10:47:31] [INFO ] Computed and/alt/rep : 1011/1378/1011 causal constraints (skipped 200 transitions) in 62 ms.
[2025-05-30 10:47:32] [INFO ] Deduced a trap composed of 28 places in 246 ms of which 5 ms to minimize.
[2025-05-30 10:47:32] [INFO ] Deduced a trap composed of 26 places in 229 ms of which 5 ms to minimize.
[2025-05-30 10:47:33] [INFO ] Deduced a trap composed of 24 places in 236 ms of which 5 ms to minimize.
[2025-05-30 10:47:33] [INFO ] Deduced a trap composed of 83 places in 212 ms of which 5 ms to minimize.
[2025-05-30 10:47:33] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1175 ms
[2025-05-30 10:47:33] [INFO ] Added : 112 causal constraints over 23 iterations in 2599 ms. Result :sat
Minimization took 680 ms.
[2025-05-30 10:47:34] [INFO ] [Real]Absence check using 10 positive place invariants in 17 ms returned sat
[2025-05-30 10:47:34] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 2 ms returned sat
[2025-05-30 10:47:34] [INFO ] [Real]Absence check using state equation in 340 ms returned sat
[2025-05-30 10:47:34] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:47:34] [INFO ] [Nat]Absence check using 10 positive place invariants in 17 ms returned sat
[2025-05-30 10:47:34] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2025-05-30 10:47:35] [INFO ] [Nat]Absence check using state equation in 311 ms returned sat
[2025-05-30 10:47:35] [INFO ] Deduced a trap composed of 21 places in 201 ms of which 4 ms to minimize.
[2025-05-30 10:47:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 280 ms
[2025-05-30 10:47:35] [INFO ] Computed and/alt/rep : 1011/1378/1011 causal constraints (skipped 200 transitions) in 61 ms.
[2025-05-30 10:47:37] [INFO ] Added : 184 causal constraints over 37 iterations in 2171 ms. Result :sat
Minimization took 688 ms.
[2025-05-30 10:47:38] [INFO ] [Real]Absence check using 10 positive place invariants in 17 ms returned sat
[2025-05-30 10:47:38] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 2 ms returned sat
[2025-05-30 10:47:38] [INFO ] [Real]Absence check using state equation in 318 ms returned sat
[2025-05-30 10:47:38] [INFO ] Computed and/alt/rep : 1011/1378/1011 causal constraints (skipped 200 transitions) in 56 ms.
[2025-05-30 10:47:39] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:47:39] [INFO ] [Nat]Absence check using 10 positive place invariants in 17 ms returned sat
[2025-05-30 10:47:39] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2025-05-30 10:47:39] [INFO ] [Nat]Absence check using state equation in 317 ms returned sat
[2025-05-30 10:47:39] [INFO ] Computed and/alt/rep : 1011/1378/1011 causal constraints (skipped 200 transitions) in 58 ms.
[2025-05-30 10:47:41] [INFO ] Added : 164 causal constraints over 33 iterations in 1922 ms. Result :sat
Minimization took 662 ms.
[2025-05-30 10:47:42] [INFO ] [Real]Absence check using 10 positive place invariants in 16 ms returned sat
[2025-05-30 10:47:42] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2025-05-30 10:47:42] [INFO ] [Real]Absence check using state equation in 309 ms returned sat
[2025-05-30 10:47:42] [INFO ] Computed and/alt/rep : 1011/1378/1011 causal constraints (skipped 200 transitions) in 57 ms.
[2025-05-30 10:47:42] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:47:43] [INFO ] [Nat]Absence check using 10 positive place invariants in 18 ms returned sat
[2025-05-30 10:47:43] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 2 ms returned sat
[2025-05-30 10:47:43] [INFO ] [Nat]Absence check using state equation in 306 ms returned sat
[2025-05-30 10:47:43] [INFO ] Computed and/alt/rep : 1011/1378/1011 causal constraints (skipped 200 transitions) in 59 ms.
[2025-05-30 10:47:45] [INFO ] Deduced a trap composed of 68 places in 193 ms of which 4 ms to minimize.
[2025-05-30 10:47:45] [INFO ] Deduced a trap composed of 269 places in 192 ms of which 4 ms to minimize.
[2025-05-30 10:47:45] [INFO ] Deduced a trap composed of 425 places in 185 ms of which 4 ms to minimize.
[2025-05-30 10:47:45] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 786 ms
[2025-05-30 10:47:46] [INFO ] Added : 150 causal constraints over 30 iterations in 2583 ms. Result :sat
Minimization took 678 ms.
[2025-05-30 10:47:46] [INFO ] [Real]Absence check using 10 positive place invariants in 16 ms returned sat
[2025-05-30 10:47:46] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 4 ms returned sat
[2025-05-30 10:47:47] [INFO ] [Real]Absence check using state equation in 320 ms returned sat
[2025-05-30 10:47:47] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:47:47] [INFO ] [Nat]Absence check using 10 positive place invariants in 18 ms returned sat
[2025-05-30 10:47:47] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 3 ms returned sat
[2025-05-30 10:47:47] [INFO ] [Nat]Absence check using state equation in 300 ms returned sat
[2025-05-30 10:47:47] [INFO ] Computed and/alt/rep : 1011/1378/1011 causal constraints (skipped 200 transitions) in 60 ms.
[2025-05-30 10:47:50] [INFO ] Deduced a trap composed of 23 places in 185 ms of which 4 ms to minimize.
[2025-05-30 10:47:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 283 ms
[2025-05-30 10:47:50] [INFO ] Added : 192 causal constraints over 39 iterations in 2596 ms. Result :sat
Minimization took 678 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Support contains 10 out of 991 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 991/991 places, 1212/1212 transitions.
Graph (trivial) has 998 edges and 991 vertex of which 3 / 991 are part of one of the 1 SCC in 6 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) 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 (Output transitions of discarded places.) removed 26 transitions
Drop transitions (Empty/Sink Transition effects.) removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 589 transitions
Trivial Post-agglo rules discarded 589 transitions
Performed 589 trivial Post agglomeration. Transition count delta: 589
Iterating post reduction 0 with 625 rules applied. Total rules applied 627 place count 933 transition count 558
Reduce places removed 589 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 1 with 619 rules applied. Total rules applied 1246 place count 344 transition count 528
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 2 with 32 rules applied. Total rules applied 1278 place count 330 transition count 510
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
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 3 with 9 rules applied. Total rules applied 1287 place count 325 transition count 506
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
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 4 with 6 rules applied. Total rules applied 1293 place count 323 transition count 502
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 5 with 10 rules applied. Total rules applied 1303 place count 321 transition count 494
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1309 place count 315 transition count 494
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 4 Pre rules applied. Total rules applied 1309 place count 315 transition count 490
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 1317 place count 311 transition count 490
Discarding 49 places :
Symmetric choice reduction at 7 with 49 rule applications. Total rules 1366 place count 262 transition count 441
Iterating global reduction 7 with 49 rules applied. Total rules applied 1415 place count 262 transition count 441
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 14 Pre rules applied. Total rules applied 1415 place count 262 transition count 427
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 1443 place count 248 transition count 427
Discarding 29 places :
Symmetric choice reduction at 7 with 29 rule applications. Total rules 1472 place count 219 transition count 373
Iterating global reduction 7 with 29 rules applied. Total rules applied 1501 place count 219 transition count 373
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 1505 place count 219 transition count 369
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 1508 place count 216 transition count 365
Iterating global reduction 8 with 3 rules applied. Total rules applied 1511 place count 216 transition count 365
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 1514 place count 216 transition count 362
Performed 75 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 75 places in 1 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 9 with 150 rules applied. Total rules applied 1664 place count 141 transition count 277
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 1668 place count 141 transition count 273
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: -40
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 10 with 74 rules applied. Total rules applied 1742 place count 104 transition count 313
Drop transitions (Empty/Sink Transition effects.) removed 44 transitions
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 61 transitions.
Iterating post reduction 10 with 61 rules applied. Total rules applied 1803 place count 104 transition count 252
Discarding 25 places :
Symmetric choice reduction at 11 with 25 rule applications. Total rules 1828 place count 79 transition count 184
Iterating global reduction 11 with 25 rules applied. Total rules applied 1853 place count 79 transition count 184
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 11 with 17 rules applied. Total rules applied 1870 place count 79 transition count 167
Discarding 6 places :
Symmetric choice reduction at 12 with 6 rule applications. Total rules 1876 place count 73 transition count 139
Iterating global reduction 12 with 6 rules applied. Total rules applied 1882 place count 73 transition count 139
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 12 with 5 rules applied. Total rules applied 1887 place count 73 transition count 134
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 13 with 4 rules applied. Total rules applied 1891 place count 71 transition count 154
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 13 with 8 rules applied. Total rules applied 1899 place count 71 transition count 146
Drop transitions (Redundant composition of simpler transitions.) removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 14 with 15 rules applied. Total rules applied 1914 place count 71 transition count 131
Discarding 1 places :
Symmetric choice reduction at 14 with 1 rule applications. Total rules 1915 place count 70 transition count 129
Iterating global reduction 14 with 1 rules applied. Total rules applied 1916 place count 70 transition count 129
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 1917 place count 70 transition count 128
Free-agglomeration rule applied 13 times.
Iterating global reduction 15 with 13 rules applied. Total rules applied 1930 place count 70 transition count 115
Reduce places removed 13 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 15 with 18 rules applied. Total rules applied 1948 place count 57 transition count 110
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 16 with 1 rules applied. Total rules applied 1949 place count 57 transition count 110
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 16 with 1 rules applied. Total rules applied 1950 place count 56 transition count 109
Reduce places removed 3 places and 0 transitions.
Graph (trivial) has 27 edges and 53 vertex of which 5 / 53 are part of one of the 2 SCC in 0 ms
Free SCC test removed 3 places
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 16 with 5 rules applied. Total rules applied 1955 place count 50 transition count 108
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 17 with 8 rules applied. Total rules applied 1963 place count 49 transition count 101
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 18 with 2 Pre rules applied. Total rules applied 1963 place count 49 transition count 99
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 18 with 4 rules applied. Total rules applied 1967 place count 47 transition count 99
Drop transitions (Redundant composition of simpler transitions.) removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 18 with 15 rules applied. Total rules applied 1982 place count 47 transition count 84
Discarding 2 places :
Symmetric choice reduction at 18 with 2 rule applications. Total rules 1984 place count 45 transition count 80
Iterating global reduction 18 with 2 rules applied. Total rules applied 1986 place count 45 transition count 80
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 18 with 2 rules applied. Total rules applied 1988 place count 45 transition count 78
Free-agglomeration rule applied 8 times.
Iterating global reduction 19 with 8 rules applied. Total rules applied 1996 place count 45 transition count 70
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 19 with 8 rules applied. Total rules applied 2004 place count 37 transition count 70
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 20 with 6 rules applied. Total rules applied 2010 place count 37 transition count 64
Free-agglomeration rule applied 2 times.
Iterating global reduction 20 with 2 rules applied. Total rules applied 2012 place count 37 transition count 62
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 20 with 4 rules applied. Total rules applied 2016 place count 35 transition count 60
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 21 with 1 rules applied. Total rules applied 2017 place count 35 transition count 60
Applied a total of 2017 rules in 200 ms. Remains 35 /991 variables (removed 956) and now considering 60/1212 (removed 1152) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 211 ms. Remains : 35/991 places, 60/1212 transitions.
[2025-05-30 10:47:51] [INFO ] Flow matrix only has 57 transitions (discarded 3 similar events)
// Phase 1: matrix 57 rows 35 cols
[2025-05-30 10:47:51] [INFO ] Computed 7 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (2 resets) in 853 ms. (1170 steps per ms)
FORMULA CO4-PT-20-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-20-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-20-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-20-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-20-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-20-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-20-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-20-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-20-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-20-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (2 resets) in 278 ms. (3584 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-05-30 10:47:52] [INFO ] Flatten gal took : 25 ms
[2025-05-30 10:47:52] [INFO ] Flatten gal took : 8 ms
[2025-05-30 10:47:52] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1604639009669778583.gal : 4 ms
[2025-05-30 10:47:52] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7292368965062505449.prop : 1 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/ReachabilityCardinality1604639009669778583.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7292368965062505449.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.

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 44219 ms.

BK_STOP 1748602072630

--------------------
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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ 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="CO4-PT-20"
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 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 r055-tall-174854041300067"
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.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 ;