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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 648K
-rw-r--r-- 1 mcc users 6.2K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.3K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K 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 260K 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-16-UpperBounds-00
FORMULA_NAME CO4-PT-16-UpperBounds-01
FORMULA_NAME CO4-PT-16-UpperBounds-02
FORMULA_NAME CO4-PT-16-UpperBounds-03
FORMULA_NAME CO4-PT-16-UpperBounds-04
FORMULA_NAME CO4-PT-16-UpperBounds-05
FORMULA_NAME CO4-PT-16-UpperBounds-06
FORMULA_NAME CO4-PT-16-UpperBounds-07
FORMULA_NAME CO4-PT-16-UpperBounds-08
FORMULA_NAME CO4-PT-16-UpperBounds-09
FORMULA_NAME CO4-PT-16-UpperBounds-10
FORMULA_NAME CO4-PT-16-UpperBounds-11
FORMULA_NAME CO4-PT-16-UpperBounds-12
FORMULA_NAME CO4-PT-16-UpperBounds-13
FORMULA_NAME CO4-PT-16-UpperBounds-14
FORMULA_NAME CO4-PT-16-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748602006140

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-16
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-05-30 10:46:47] [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:46:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 10:46:47] [INFO ] Load time of PNML (sax parser for PT used): 108 ms
[2025-05-30 10:46:47] [INFO ] Transformed 837 places.
[2025-05-30 10:46:47] [INFO ] Transformed 1122 transitions.
[2025-05-30 10:46:47] [INFO ] Found NUPN structural information;
[2025-05-30 10:46:47] [INFO ] Parsed PT model containing 837 places and 1122 transitions and 3052 arcs in 211 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Deduced a syphon composed of 116 places in 11 ms
Reduce places removed 116 places and 180 transitions.
FORMULA CO4-PT-16-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-16-UpperBounds-15 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, 0, 0] Max Struct:[1, 1, 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, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 942 rows 721 cols
[2025-05-30 10:46:47] [INFO ] Computed 12 invariants in 40 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 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, 1, 1]
RANDOM walk for 10000 steps (147 resets) in 44 ms. (222 steps per ms)
FORMULA CO4-PT-16-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-16-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-16-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-16-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-16-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-16-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 80005 steps (320 resets) in 72 ms. (1095 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-30 10:46:47] [INFO ] Invariant cache hit.
[2025-05-30 10:46:48] [INFO ] [Real]Absence check using 11 positive place invariants in 15 ms returned sat
[2025-05-30 10:46:48] [INFO ] [Real]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-30 10:46:48] [INFO ] [Real]Absence check using state equation in 236 ms returned sat
[2025-05-30 10:46:48] [INFO ] Deduced a trap composed of 335 places in 267 ms of which 45 ms to minimize.
[2025-05-30 10:46:48] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:46:48] [INFO ] [Nat]Absence check using 11 positive place invariants in 14 ms returned sat
[2025-05-30 10:46:48] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-30 10:46:49] [INFO ] [Nat]Absence check using state equation in 256 ms returned sat
[2025-05-30 10:46:49] [INFO ] Deduced a trap composed of 335 places in 166 ms of which 3 ms to minimize.
[2025-05-30 10:46:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 258 ms
[2025-05-30 10:46:49] [INFO ] Computed and/alt/rep : 741/1099/741 causal constraints (skipped 200 transitions) in 68 ms.
[2025-05-30 10:46:50] [INFO ] Added : 55 causal constraints over 12 iterations in 694 ms. Result :sat
Minimization took 353 ms.
[2025-05-30 10:46:50] [INFO ] [Real]Absence check using 11 positive place invariants in 12 ms returned sat
[2025-05-30 10:46:50] [INFO ] [Real]Absence check using 11 positive and 1 generalized place invariants in 0 ms returned sat
[2025-05-30 10:46:50] [INFO ] [Real]Absence check using state equation in 206 ms returned sat
[2025-05-30 10:46:51] [INFO ] Computed and/alt/rep : 741/1099/741 causal constraints (skipped 200 transitions) in 77 ms.
[2025-05-30 10:46:51] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:46:51] [INFO ] [Nat]Absence check using 11 positive place invariants in 15 ms returned sat
[2025-05-30 10:46:51] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-30 10:46:51] [INFO ] [Nat]Absence check using state equation in 209 ms returned sat
[2025-05-30 10:46:51] [INFO ] Computed and/alt/rep : 741/1099/741 causal constraints (skipped 200 transitions) in 52 ms.
[2025-05-30 10:46:52] [INFO ] Added : 110 causal constraints over 22 iterations in 1045 ms. Result :sat
Minimization took 360 ms.
[2025-05-30 10:46:53] [INFO ] [Real]Absence check using 11 positive place invariants in 13 ms returned sat
[2025-05-30 10:46:53] [INFO ] [Real]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-30 10:46:53] [INFO ] [Real]Absence check using state equation in 211 ms returned sat
[2025-05-30 10:46:53] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:46:53] [INFO ] [Nat]Absence check using 11 positive place invariants in 14 ms returned sat
[2025-05-30 10:46:53] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 0 ms returned sat
[2025-05-30 10:46:53] [INFO ] [Nat]Absence check using state equation in 220 ms returned sat
[2025-05-30 10:46:53] [INFO ] Computed and/alt/rep : 741/1099/741 causal constraints (skipped 200 transitions) in 53 ms.
[2025-05-30 10:46:55] [INFO ] Deduced a trap composed of 55 places in 88 ms of which 2 ms to minimize.
[2025-05-30 10:46:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 173 ms
[2025-05-30 10:46:55] [INFO ] Added : 118 causal constraints over 24 iterations in 1342 ms. Result :sat
Minimization took 369 ms.
[2025-05-30 10:46:55] [INFO ] [Real]Absence check using 11 positive place invariants in 12 ms returned sat
[2025-05-30 10:46:55] [INFO ] [Real]Absence check using 11 positive and 1 generalized place invariants in 6 ms returned sat
[2025-05-30 10:46:55] [INFO ] [Real]Absence check using state equation in 205 ms returned sat
[2025-05-30 10:46:56] [INFO ] Deduced a trap composed of 55 places in 217 ms of which 4 ms to minimize.
[2025-05-30 10:46:56] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:46:56] [INFO ] [Nat]Absence check using 11 positive place invariants in 14 ms returned sat
[2025-05-30 10:46:56] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 0 ms returned sat
[2025-05-30 10:46:56] [INFO ] [Nat]Absence check using state equation in 224 ms returned sat
[2025-05-30 10:46:56] [INFO ] Deduced a trap composed of 55 places in 205 ms of which 4 ms to minimize.
[2025-05-30 10:46:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 270 ms
[2025-05-30 10:46:56] [INFO ] Computed and/alt/rep : 741/1099/741 causal constraints (skipped 200 transitions) in 51 ms.
[2025-05-30 10:46:57] [INFO ] Added : 89 causal constraints over 18 iterations in 927 ms. Result :sat
Minimization took 373 ms.
[2025-05-30 10:46:58] [INFO ] [Real]Absence check using 11 positive place invariants in 13 ms returned sat
[2025-05-30 10:46:58] [INFO ] [Real]Absence check using 11 positive and 1 generalized place invariants in 0 ms returned sat
[2025-05-30 10:46:58] [INFO ] [Real]Absence check using state equation in 211 ms returned sat
[2025-05-30 10:46:58] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:46:58] [INFO ] [Nat]Absence check using 11 positive place invariants in 24 ms returned sat
[2025-05-30 10:46:58] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 0 ms returned sat
[2025-05-30 10:46:58] [INFO ] [Nat]Absence check using state equation in 224 ms returned sat
[2025-05-30 10:46:58] [INFO ] Computed and/alt/rep : 741/1099/741 causal constraints (skipped 200 transitions) in 56 ms.
[2025-05-30 10:46:59] [INFO ] Added : 59 causal constraints over 12 iterations in 644 ms. Result :sat
Minimization took 346 ms.
[2025-05-30 10:47:00] [INFO ] [Real]Absence check using 11 positive place invariants in 12 ms returned sat
[2025-05-30 10:47:00] [INFO ] [Real]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-30 10:47:00] [INFO ] [Real]Absence check using state equation in 230 ms returned sat
[2025-05-30 10:47:00] [INFO ] Deduced a trap composed of 335 places in 163 ms of which 3 ms to minimize.
[2025-05-30 10:47:00] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:47:00] [INFO ] [Nat]Absence check using 11 positive place invariants in 13 ms returned sat
[2025-05-30 10:47:00] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 0 ms returned sat
[2025-05-30 10:47:00] [INFO ] [Nat]Absence check using state equation in 217 ms returned sat
[2025-05-30 10:47:01] [INFO ] Deduced a trap composed of 335 places in 146 ms of which 3 ms to minimize.
[2025-05-30 10:47:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 206 ms
[2025-05-30 10:47:01] [INFO ] Computed and/alt/rep : 741/1099/741 causal constraints (skipped 200 transitions) in 57 ms.
[2025-05-30 10:47:02] [INFO ] Deduced a trap composed of 203 places in 89 ms of which 4 ms to minimize.
[2025-05-30 10:47:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 157 ms
[2025-05-30 10:47:02] [INFO ] Added : 96 causal constraints over 20 iterations in 1154 ms. Result :sat
Minimization took 373 ms.
[2025-05-30 10:47:02] [INFO ] [Real]Absence check using 11 positive place invariants in 12 ms returned sat
[2025-05-30 10:47:02] [INFO ] [Real]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-30 10:47:03] [INFO ] [Real]Absence check using state equation in 209 ms returned sat
[2025-05-30 10:47:03] [INFO ] Deduced a trap composed of 63 places in 159 ms of which 3 ms to minimize.
[2025-05-30 10:47:03] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:47:03] [INFO ] [Nat]Absence check using 11 positive place invariants in 14 ms returned sat
[2025-05-30 10:47:03] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-30 10:47:03] [INFO ] [Nat]Absence check using state equation in 214 ms returned sat
[2025-05-30 10:47:03] [INFO ] Deduced a trap composed of 63 places in 133 ms of which 2 ms to minimize.
[2025-05-30 10:47:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 180 ms
[2025-05-30 10:47:03] [INFO ] Computed and/alt/rep : 741/1099/741 causal constraints (skipped 200 transitions) in 48 ms.
[2025-05-30 10:47:04] [INFO ] Added : 58 causal constraints over 12 iterations in 638 ms. Result :sat
Minimization took 364 ms.
[2025-05-30 10:47:04] [INFO ] [Real]Absence check using 11 positive place invariants in 13 ms returned sat
[2025-05-30 10:47:04] [INFO ] [Real]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-30 10:47:05] [INFO ] [Real]Absence check using state equation in 211 ms returned sat
[2025-05-30 10:47:05] [INFO ] Deduced a trap composed of 62 places in 202 ms of which 4 ms to minimize.
[2025-05-30 10:47:05] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:47:05] [INFO ] [Nat]Absence check using 11 positive place invariants in 14 ms returned sat
[2025-05-30 10:47:05] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-30 10:47:05] [INFO ] [Nat]Absence check using state equation in 216 ms returned sat
[2025-05-30 10:47:06] [INFO ] Deduced a trap composed of 62 places in 190 ms of which 4 ms to minimize.
[2025-05-30 10:47:06] [INFO ] Deduced a trap composed of 59 places in 184 ms of which 4 ms to minimize.
[2025-05-30 10:47:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 458 ms
[2025-05-30 10:47:06] [INFO ] Computed and/alt/rep : 741/1099/741 causal constraints (skipped 200 transitions) in 44 ms.
[2025-05-30 10:47:07] [INFO ] Added : 100 causal constraints over 20 iterations in 947 ms. Result :sat
Minimization took 377 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
FORMULA CO4-PT-16-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-16-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-16-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-16-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-16-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 0, 0] Max Struct:[1, 1, 1]
Support contains 3 out of 721 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 721/721 places, 942/942 transitions.
Graph (trivial) has 743 edges and 721 vertex of which 2 / 721 are part of one of the 1 SCC in 5 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 1392 edges and 720 vertex of which 675 are kept as prefixes of interest. Removing 45 places using SCC suffix rule.3 ms
Discarding 45 places :
Also discarding 20 output transitions
Drop transitions (Output transitions of discarded places.) removed 20 transitions
Drop transitions (Empty/Sink Transition effects.) removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 351 transitions
Trivial Post-agglo rules discarded 351 transitions
Performed 351 trivial Post agglomeration. Transition count delta: 351
Iterating post reduction 0 with 382 rules applied. Total rules applied 384 place count 675 transition count 538
Reduce places removed 351 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 378 rules applied. Total rules applied 762 place count 324 transition count 511
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 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 2 with 26 rules applied. Total rules applied 788 place count 312 transition count 497
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 3 with 6 rules applied. Total rules applied 794 place count 310 transition count 493
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 800 place count 308 transition count 489
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 5 rules applied. Total rules applied 805 place count 306 transition count 486
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 806 place count 305 transition count 486
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 806 place count 305 transition count 485
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 808 place count 304 transition count 485
Discarding 49 places :
Symmetric choice reduction at 7 with 49 rule applications. Total rules 857 place count 255 transition count 436
Iterating global reduction 7 with 49 rules applied. Total rules applied 906 place count 255 transition count 436
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 14 Pre rules applied. Total rules applied 906 place count 255 transition count 422
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 7 with 28 rules applied. Total rules applied 934 place count 241 transition count 422
Discarding 32 places :
Symmetric choice reduction at 7 with 32 rule applications. Total rules 966 place count 209 transition count 365
Iterating global reduction 7 with 32 rules applied. Total rules applied 998 place count 209 transition count 365
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 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 7 with 7 rules applied. Total rules applied 1005 place count 209 transition count 358
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1006 place count 208 transition count 358
Discarding 4 places :
Symmetric choice reduction at 9 with 4 rule applications. Total rules 1010 place count 204 transition count 353
Iterating global reduction 9 with 4 rules applied. Total rules applied 1014 place count 204 transition count 353
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 1018 place count 204 transition count 349
Performed 78 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 78 places in 1 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 10 with 156 rules applied. Total rules applied 1174 place count 126 transition count 259
Drop transitions (Empty/Sink Transition effects.) 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 1179 place count 126 transition count 254
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: -41
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 1257 place count 87 transition count 295
Drop transitions (Empty/Sink Transition effects.) removed 39 transitions
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 59 transitions.
Iterating post reduction 11 with 59 rules applied. Total rules applied 1316 place count 87 transition count 236
Discarding 26 places :
Symmetric choice reduction at 12 with 26 rule applications. Total rules 1342 place count 61 transition count 158
Iterating global reduction 12 with 26 rules applied. Total rules applied 1368 place count 61 transition count 158
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 12 with 19 rules applied. Total rules applied 1387 place count 61 transition count 139
Discarding 5 places :
Symmetric choice reduction at 13 with 5 rule applications. Total rules 1392 place count 56 transition count 117
Iterating global reduction 13 with 5 rules applied. Total rules applied 1397 place count 56 transition count 117
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 13 with 3 rules applied. Total rules applied 1400 place count 56 transition count 114
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 1402 place count 55 transition count 129
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 14 with 3 rules applied. Total rules applied 1405 place count 55 transition count 126
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 15 with 12 rules applied. Total rules applied 1417 place count 55 transition count 114
Free-agglomeration rule applied 12 times.
Iterating global reduction 15 with 12 rules applied. Total rules applied 1429 place count 55 transition count 102
Reduce places removed 12 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 15 with 14 rules applied. Total rules applied 1443 place count 43 transition count 100
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 16 with 1 rules applied. Total rules applied 1444 place count 43 transition count 99
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 1445 place count 43 transition count 99
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 16 with 1 rules applied. Total rules applied 1446 place count 42 transition count 98
Reduce places removed 3 places and 0 transitions.
Graph (trivial) has 21 edges and 39 vertex of which 5 / 39 are part of one of the 2 SCC in 1 ms
Free SCC test removed 3 places
Iterating post reduction 16 with 4 rules applied. Total rules applied 1450 place count 36 transition count 98
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (trivial) has 23 edges and 35 vertex of which 6 / 35 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Iterating post reduction 17 with 10 rules applied. Total rules applied 1460 place count 30 transition count 90
Drop transitions (Empty/Sink Transition effects.) removed 15 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 18 with 23 rules applied. Total rules applied 1483 place count 30 transition count 67
Discarding 1 places :
Symmetric choice reduction at 19 with 1 rule applications. Total rules 1484 place count 29 transition count 64
Iterating global reduction 19 with 1 rules applied. Total rules applied 1485 place count 29 transition count 64
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 19 with 1 rules applied. Total rules applied 1486 place count 29 transition count 63
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 20 with 7 rules applied. Total rules applied 1493 place count 29 transition count 56
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 104 edges and 28 vertex of which 27 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 20 with 3 rules applied. Total rules applied 1496 place count 27 transition count 55
Discarding 1 places :
Symmetric choice reduction at 21 with 1 rule applications. Total rules 1497 place count 26 transition count 53
Iterating global reduction 21 with 1 rules applied. Total rules applied 1498 place count 26 transition count 53
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 21 with 1 rules applied. Total rules applied 1499 place count 26 transition count 52
Free-agglomeration rule applied 2 times.
Iterating global reduction 22 with 2 rules applied. Total rules applied 1501 place count 26 transition count 50
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 22 with 2 rules applied. Total rules applied 1503 place count 24 transition count 50
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 23 with 2 rules applied. Total rules applied 1505 place count 24 transition count 48
Applied a total of 1505 rules in 183 ms. Remains 24 /721 variables (removed 697) and now considering 48/942 (removed 894) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 193 ms. Remains : 24/721 places, 48/942 transitions.
[2025-05-30 10:47:07] [INFO ] Flow matrix only has 45 transitions (discarded 3 similar events)
// Phase 1: matrix 45 rows 24 cols
[2025-05-30 10:47:07] [INFO ] Computed 5 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1, 0, 0] Max Struct:[1, 1, 1]
FORMULA CO4-PT-16-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (2 resets) in 867 ms. (1152 steps per ms)
FORMULA CO4-PT-16-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-16-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (2 resets) in 356 ms. (2801 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:09] [INFO ] Flatten gal took : 35 ms
[2025-05-30 10:47:09] [INFO ] Flatten gal took : 11 ms
[2025-05-30 10:47:09] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1387559009607767415.gal : 8 ms
[2025-05-30 10:47:09] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9417158904169323582.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/ReachabilityCardinality1387559009607767415.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9417158904169323582.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 ...328
Loading property file /tmp/ReachabilityCardinality9417158904169323582.prop.
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 22152 ms.

BK_STOP 1748602029564

--------------------
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-16"
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-16, 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-174854041300063"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CO4-PT-16.tgz
mv CO4-PT-16 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 ;