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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 764K
-rw-r--r-- 1 mcc users 5.9K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K 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 18K 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 120K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K 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 344K 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-21-UpperBounds-00
FORMULA_NAME CO4-PT-21-UpperBounds-01
FORMULA_NAME CO4-PT-21-UpperBounds-02
FORMULA_NAME CO4-PT-21-UpperBounds-03
FORMULA_NAME CO4-PT-21-UpperBounds-04
FORMULA_NAME CO4-PT-21-UpperBounds-05
FORMULA_NAME CO4-PT-21-UpperBounds-06
FORMULA_NAME CO4-PT-21-UpperBounds-07
FORMULA_NAME CO4-PT-21-UpperBounds-08
FORMULA_NAME CO4-PT-21-UpperBounds-09
FORMULA_NAME CO4-PT-21-UpperBounds-10
FORMULA_NAME CO4-PT-21-UpperBounds-11
FORMULA_NAME CO4-PT-21-UpperBounds-12
FORMULA_NAME CO4-PT-21-UpperBounds-13
FORMULA_NAME CO4-PT-21-UpperBounds-14
FORMULA_NAME CO4-PT-21-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748602036058

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-21
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-05-30 10:47:17] [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:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 10:47:17] [INFO ] Load time of PNML (sax parser for PT used): 113 ms
[2025-05-30 10:47:17] [INFO ] Transformed 1400 places.
[2025-05-30 10:47:17] [INFO ] Transformed 1583 transitions.
[2025-05-30 10:47:17] [INFO ] Found NUPN structural information;
[2025-05-30 10:47:17] [INFO ] Parsed PT model containing 1400 places and 1583 transitions and 3434 arcs in 224 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Deduced a syphon composed of 307 places in 15 ms
Reduce places removed 307 places and 347 transitions.
FORMULA CO4-PT-21-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-21-UpperBounds-03 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 1236 rows 1093 cols
[2025-05-30 10:47:17] [INFO ] Computed 9 invariants in 53 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 (21 resets) in 30 ms. (322 steps per ms)
FORMULA CO4-PT-21-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-21-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-21-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-21-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-21-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 90002 steps (195 resets) in 144 ms. (620 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-30 10:47:17] [INFO ] Invariant cache hit.
[2025-05-30 10:47:18] [INFO ] [Real]Absence check using 9 positive place invariants in 21 ms returned sat
[2025-05-30 10:47:18] [INFO ] [Real]Absence check using state equation in 368 ms returned sat
[2025-05-30 10:47:18] [INFO ] Computed and/alt/rep : 1121/1303/1121 causal constraints (skipped 114 transitions) in 90 ms.
[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 9 positive place invariants in 21 ms returned sat
[2025-05-30 10:47:19] [INFO ] [Nat]Absence check using state equation in 354 ms returned sat
[2025-05-30 10:47:19] [INFO ] Computed and/alt/rep : 1121/1303/1121 causal constraints (skipped 114 transitions) in 63 ms.
[2025-05-30 10:47:22] [INFO ] Added : 172 causal constraints over 35 iterations in 2202 ms. Result :sat
Minimization took 653 ms.
[2025-05-30 10:47:22] [INFO ] [Real]Absence check using 9 positive place invariants in 18 ms returned sat
[2025-05-30 10:47:23] [INFO ] [Real]Absence check using state equation in 383 ms returned sat
[2025-05-30 10:47:23] [INFO ] Computed and/alt/rep : 1121/1303/1121 causal constraints (skipped 114 transitions) in 69 ms.
[2025-05-30 10:47:23] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:47:23] [INFO ] [Nat]Absence check using 9 positive place invariants in 20 ms returned sat
[2025-05-30 10:47:24] [INFO ] [Nat]Absence check using state equation in 361 ms returned sat
[2025-05-30 10:47:24] [INFO ] Computed and/alt/rep : 1121/1303/1121 causal constraints (skipped 114 transitions) in 66 ms.
[2025-05-30 10:47:25] [INFO ] Added : 139 causal constraints over 28 iterations in 1632 ms. Result :sat
Minimization took 638 ms.
[2025-05-30 10:47:26] [INFO ] [Real]Absence check using 9 positive place invariants in 18 ms returned sat
[2025-05-30 10:47:27] [INFO ] [Real]Absence check using state equation in 319 ms returned sat
[2025-05-30 10:47:27] [INFO ] Computed and/alt/rep : 1121/1303/1121 causal constraints (skipped 114 transitions) in 67 ms.
[2025-05-30 10:47:27] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:47:27] [INFO ] [Nat]Absence check using 9 positive place invariants in 21 ms returned sat
[2025-05-30 10:47:27] [INFO ] [Nat]Absence check using state equation in 334 ms returned sat
[2025-05-30 10:47:28] [INFO ] Computed and/alt/rep : 1121/1303/1121 causal constraints (skipped 114 transitions) in 59 ms.
[2025-05-30 10:47:30] [INFO ] Added : 185 causal constraints over 37 iterations in 2110 ms. Result :sat
Minimization took 627 ms.
[2025-05-30 10:47:30] [INFO ] [Real]Absence check using 9 positive place invariants in 19 ms returned sat
[2025-05-30 10:47:31] [INFO ] [Real]Absence check using state equation in 306 ms returned sat
[2025-05-30 10:47:31] [INFO ] Computed and/alt/rep : 1121/1303/1121 causal constraints (skipped 114 transitions) in 70 ms.
[2025-05-30 10:47:31] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:47:31] [INFO ] [Nat]Absence check using 9 positive place invariants in 20 ms returned sat
[2025-05-30 10:47:32] [INFO ] [Nat]Absence check using state equation in 318 ms returned sat
[2025-05-30 10:47:32] [INFO ] Computed and/alt/rep : 1121/1303/1121 causal constraints (skipped 114 transitions) in 59 ms.
[2025-05-30 10:47:34] [INFO ] Added : 172 causal constraints over 35 iterations in 2045 ms. Result :sat
Minimization took 638 ms.
[2025-05-30 10:47:34] [INFO ] [Real]Absence check using 9 positive place invariants in 19 ms returned sat
[2025-05-30 10:47:35] [INFO ] [Real]Absence check using state equation in 290 ms returned sat
[2025-05-30 10:47:35] [INFO ] Computed and/alt/rep : 1121/1303/1121 causal constraints (skipped 114 transitions) in 70 ms.
[2025-05-30 10:47:35] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:47:35] [INFO ] [Nat]Absence check using 9 positive place invariants in 21 ms returned sat
[2025-05-30 10:47:36] [INFO ] [Nat]Absence check using state equation in 336 ms returned sat
[2025-05-30 10:47:36] [INFO ] Computed and/alt/rep : 1121/1303/1121 causal constraints (skipped 114 transitions) in 67 ms.
[2025-05-30 10:47:37] [INFO ] Added : 162 causal constraints over 33 iterations in 1888 ms. Result :sat
Minimization took 667 ms.
[2025-05-30 10:47:38] [INFO ] [Real]Absence check using 9 positive place invariants in 19 ms returned sat
[2025-05-30 10:47:39] [INFO ] [Real]Absence check using state equation in 338 ms returned sat
[2025-05-30 10:47:39] [INFO ] Computed and/alt/rep : 1121/1303/1121 causal constraints (skipped 114 transitions) in 65 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 9 positive place invariants in 21 ms returned sat
[2025-05-30 10:47:40] [INFO ] [Nat]Absence check using state equation in 369 ms returned sat
[2025-05-30 10:47:40] [INFO ] Computed and/alt/rep : 1121/1303/1121 causal constraints (skipped 114 transitions) in 62 ms.
[2025-05-30 10:47:42] [INFO ] Added : 166 causal constraints over 34 iterations in 1915 ms. Result :sat
Minimization took 796 ms.
[2025-05-30 10:47:43] [INFO ] [Real]Absence check using 9 positive place invariants in 18 ms returned sat
[2025-05-30 10:47:43] [INFO ] [Real]Absence check using state equation in 342 ms returned sat
[2025-05-30 10:47:43] [INFO ] Computed and/alt/rep : 1121/1303/1121 causal constraints (skipped 114 transitions) in 56 ms.
[2025-05-30 10:47:43] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:47:43] [INFO ] [Nat]Absence check using 9 positive place invariants in 19 ms returned sat
[2025-05-30 10:47:44] [INFO ] [Nat]Absence check using state equation in 320 ms returned sat
[2025-05-30 10:47:44] [INFO ] Computed and/alt/rep : 1121/1303/1121 causal constraints (skipped 114 transitions) in 62 ms.
[2025-05-30 10:47:46] [INFO ] Added : 179 causal constraints over 36 iterations in 2110 ms. Result :sat
Minimization took 819 ms.
[2025-05-30 10:47:47] [INFO ] [Real]Absence check using 9 positive place invariants in 18 ms returned sat
[2025-05-30 10:47:47] [INFO ] [Real]Absence check using state equation in 327 ms returned sat
[2025-05-30 10:47:47] [INFO ] Computed and/alt/rep : 1121/1303/1121 causal constraints (skipped 114 transitions) in 139 ms.
[2025-05-30 10:47:48] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:47:48] [INFO ] [Nat]Absence check using 9 positive place invariants in 20 ms returned sat
[2025-05-30 10:47:48] [INFO ] [Nat]Absence check using state equation in 306 ms returned sat
[2025-05-30 10:47:48] [INFO ] Computed and/alt/rep : 1121/1303/1121 causal constraints (skipped 114 transitions) in 58 ms.
[2025-05-30 10:47:50] [INFO ] Added : 162 causal constraints over 33 iterations in 1944 ms. Result :sat
Minimization took 817 ms.
[2025-05-30 10:47:51] [INFO ] [Real]Absence check using 9 positive place invariants in 18 ms returned sat
[2025-05-30 10:47:51] [INFO ] [Real]Absence check using state equation in 356 ms returned sat
[2025-05-30 10:47:52] [INFO ] Computed and/alt/rep : 1121/1303/1121 causal constraints (skipped 114 transitions) in 62 ms.
[2025-05-30 10:47:52] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:47:52] [INFO ] [Nat]Absence check using 9 positive place invariants in 20 ms returned sat
[2025-05-30 10:47:52] [INFO ] [Nat]Absence check using state equation in 308 ms returned sat
[2025-05-30 10:47:52] [INFO ] Computed and/alt/rep : 1121/1303/1121 causal constraints (skipped 114 transitions) in 64 ms.
[2025-05-30 10:47:54] [INFO ] Added : 157 causal constraints over 32 iterations in 1860 ms. Result :sat
Minimization took 802 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[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] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1]
Support contains 9 out of 1093 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1093/1093 places, 1236/1236 transitions.
Graph (trivial) has 1104 edges and 1093 vertex of which 3 / 1093 are part of one of the 1 SCC in 8 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 1468 edges and 1091 vertex of which 1027 are kept as prefixes of interest. Removing 64 places using SCC suffix rule.3 ms
Discarding 64 places :
Also discarding 38 output transitions
Drop transitions (Output transitions of discarded places.) removed 38 transitions
Drop transitions (Empty/Sink Transition effects.) removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 671 transitions
Trivial Post-agglo rules discarded 671 transitions
Performed 671 trivial Post agglomeration. Transition count delta: 671
Iterating post reduction 0 with 699 rules applied. Total rules applied 701 place count 1027 transition count 496
Reduce places removed 671 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 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 1 with 682 rules applied. Total rules applied 1383 place count 356 transition count 485
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 11 rules applied. Total rules applied 1394 place count 351 transition count 479
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 3 with 4 rules applied. Total rules applied 1398 place count 349 transition count 477
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 4 with 3 rules applied. Total rules applied 1401 place count 348 transition count 475
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 5 with 7 rules applied. Total rules applied 1408 place count 347 transition count 469
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 1413 place count 342 transition count 469
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 2 Pre rules applied. Total rules applied 1413 place count 342 transition count 467
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 1417 place count 340 transition count 467
Discarding 41 places :
Symmetric choice reduction at 7 with 41 rule applications. Total rules 1458 place count 299 transition count 426
Iterating global reduction 7 with 41 rules applied. Total rules applied 1499 place count 299 transition count 426
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 16 Pre rules applied. Total rules applied 1499 place count 299 transition count 410
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 7 with 32 rules applied. Total rules applied 1531 place count 283 transition count 410
Discarding 28 places :
Symmetric choice reduction at 7 with 28 rule applications. Total rules 1559 place count 255 transition count 382
Iterating global reduction 7 with 28 rules applied. Total rules applied 1587 place count 255 transition count 382
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 4 rules applied. Total rules applied 1591 place count 255 transition count 378
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1592 place count 254 transition count 378
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1593 place count 253 transition count 376
Iterating global reduction 9 with 1 rules applied. Total rules applied 1594 place count 253 transition count 376
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 1595 place count 253 transition count 375
Performed 108 Post agglomeration using F-continuation condition with reduction of 14 identical transitions.
Deduced a syphon composed of 108 places in 0 ms
Reduce places removed 108 places and 0 transitions.
Iterating global reduction 10 with 216 rules applied. Total rules applied 1811 place count 145 transition count 253
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 10 with 3 rules applied. Total rules applied 1814 place count 145 transition count 250
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 1815 place count 144 transition count 249
Iterating global reduction 11 with 1 rules applied. Total rules applied 1816 place count 144 transition count 249
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 11 with 82 rules applied. Total rules applied 1898 place count 103 transition count 251
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 11 with 25 rules applied. Total rules applied 1923 place count 103 transition count 226
Discarding 34 places :
Symmetric choice reduction at 12 with 34 rule applications. Total rules 1957 place count 69 transition count 158
Iterating global reduction 12 with 34 rules applied. Total rules applied 1991 place count 69 transition count 158
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 12 with 23 rules applied. Total rules applied 2014 place count 69 transition count 135
Discarding 6 places :
Symmetric choice reduction at 13 with 6 rule applications. Total rules 2020 place count 63 transition count 117
Iterating global reduction 13 with 6 rules applied. Total rules applied 2026 place count 63 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 2029 place count 63 transition count 114
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 14 with 2 rules applied. Total rules applied 2031 place count 63 transition count 112
Free-agglomeration rule applied 6 times.
Iterating global reduction 14 with 6 rules applied. Total rules applied 2037 place count 63 transition count 106
Reduce places removed 6 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 14 with 8 rules applied. Total rules applied 2045 place count 57 transition count 104
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 15 with 3 rules applied. Total rules applied 2048 place count 57 transition count 104
Graph (complete) has 182 edges and 57 vertex of which 56 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 15 with 1 rules applied. Total rules applied 2049 place count 56 transition count 104
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 16 with 1 rules applied. Total rules applied 2050 place count 56 transition count 103
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 17 with 1 rules applied. Total rules applied 2051 place count 56 transition count 103
Graph (complete) has 179 edges and 56 vertex of which 55 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 17 with 1 rules applied. Total rules applied 2052 place count 55 transition count 103
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 18 with 1 rules applied. Total rules applied 2053 place count 55 transition count 102
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 19 with 1 rules applied. Total rules applied 2054 place count 55 transition count 102
Graph (complete) has 176 edges and 55 vertex of which 54 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 19 with 1 rules applied. Total rules applied 2055 place count 54 transition count 102
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 20 with 1 rules applied. Total rules applied 2056 place count 54 transition count 101
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 21 with 1 rules applied. Total rules applied 2057 place count 53 transition count 100
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t173.t174.t1374.t81.t82.t83 and 1 places that fell out of Prefix Of Interest.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 36 edges and 49 vertex of which 5 / 49 are part of one of the 2 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 21 with 3 rules applied. Total rules applied 2060 place count 46 transition count 98
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 22 with 7 rules applied. Total rules applied 2067 place count 46 transition count 91
Discarding 2 places :
Symmetric choice reduction at 23 with 2 rule applications. Total rules 2069 place count 44 transition count 88
Iterating global reduction 23 with 2 rules applied. Total rules applied 2071 place count 44 transition count 88
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 23 with 1 rules applied. Total rules applied 2072 place count 44 transition count 87
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 24 with 2 rules applied. Total rules applied 2074 place count 43 transition count 86
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 24 with 14 rules applied. Total rules applied 2088 place count 43 transition count 72
Discarding 6 places :
Symmetric choice reduction at 24 with 6 rule applications. Total rules 2094 place count 37 transition count 66
Iterating global reduction 24 with 6 rules applied. Total rules applied 2100 place count 37 transition count 66
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 24 with 5 rules applied. Total rules applied 2105 place count 37 transition count 61
Discarding 3 places :
Symmetric choice reduction at 25 with 3 rule applications. Total rules 2108 place count 34 transition count 58
Iterating global reduction 25 with 3 rules applied. Total rules applied 2111 place count 34 transition count 58
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 25 with 3 rules applied. Total rules applied 2114 place count 34 transition count 55
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 26 with 1 rules applied. Total rules applied 2115 place count 34 transition count 54
Free-agglomeration rule applied 6 times.
Iterating global reduction 26 with 6 rules applied. Total rules applied 2121 place count 34 transition count 48
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 26 with 6 rules applied. Total rules applied 2127 place count 28 transition count 48
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 27 with 4 rules applied. Total rules applied 2131 place count 28 transition count 48
Applied a total of 2131 rules in 335 ms. Remains 28 /1093 variables (removed 1065) and now considering 48/1236 (removed 1188) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 347 ms. Remains : 28/1093 places, 48/1236 transitions.
[2025-05-30 10:47:55] [INFO ] Flow matrix only has 41 transitions (discarded 7 similar events)
// Phase 1: matrix 41 rows 28 cols
[2025-05-30 10:47:55] [INFO ] Computed 3 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (2 resets) in 856 ms. (1166 steps per ms)
FORMULA CO4-PT-21-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-21-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-21-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-21-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-21-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-21-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-21-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 2000001 steps (4 resets) in 539 ms. (3703 steps per ms)
FORMULA CO4-PT-21-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CO4-PT-21-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
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:57] [INFO ] Flatten gal took : 24 ms
[2025-05-30 10:47:57] [INFO ] Flatten gal took : 15 ms
[2025-05-30 10:47:57] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2840279270641493917.gal : 6 ms
[2025-05-30 10:47:57] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9518532448272795364.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/ReachabilityCardinality2840279270641493917.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9518532448272795364.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 40125 ms.

BK_STOP 1748602077528

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

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