Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r549-tall-171734897900125.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
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 r549-tall-171734897900125
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 696K
-rw-r--r-- 1 mcc users 8.6K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 99K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 11K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 121K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 43K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 260K Jun 2 16:33 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME CO4-PT-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 1717358348040

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CO4-PT-16
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-02 19:59:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-02 19:59:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 19:59:09] [INFO ] Load time of PNML (sax parser for PT used): 112 ms
[2024-06-02 19:59:09] [INFO ] Transformed 837 places.
[2024-06-02 19:59:09] [INFO ] Transformed 1122 transitions.
[2024-06-02 19:59:09] [INFO ] Found NUPN structural information;
[2024-06-02 19:59:09] [INFO ] Parsed PT model containing 837 places and 1122 transitions and 3052 arcs in 218 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Deduced a syphon composed of 116 places in 10 ms
Reduce places removed 116 places and 180 transitions.
FORMULA CO4-PT-16-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, 0, 0, 0] Max Struct:[1, 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, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 942 rows 721 cols
[2024-06-02 19:59:09] [INFO ] Computed 12 invariants in 56 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 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, 1]
RANDOM walk for 10000 steps (229 resets) in 48 ms. (204 steps per ms)
FORMULA CO4-PT-16-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-16-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-16-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-16-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-16-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-16-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-16-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 80008 steps (311 resets) in 75 ms. (1052 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]
[2024-06-02 19:59:09] [INFO ] Invariant cache hit.
[2024-06-02 19:59:10] [INFO ] [Real]Absence check using 11 positive place invariants in 18 ms returned sat
[2024-06-02 19:59:10] [INFO ] [Real]Absence check using 11 positive and 1 generalized place invariants in 3 ms returned sat
[2024-06-02 19:59:10] [INFO ] [Real]Absence check using state equation in 336 ms returned sat
[2024-06-02 19:59:10] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:59:10] [INFO ] [Nat]Absence check using 11 positive place invariants in 18 ms returned sat
[2024-06-02 19:59:10] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-02 19:59:11] [INFO ] [Nat]Absence check using state equation in 334 ms returned sat
[2024-06-02 19:59:11] [INFO ] Deduced a trap composed of 61 places in 389 ms of which 41 ms to minimize.
[2024-06-02 19:59:11] [INFO ] Deduced a trap composed of 335 places in 217 ms of which 11 ms to minimize.
[2024-06-02 19:59:12] [INFO ] Deduced a trap composed of 49 places in 262 ms of which 5 ms to minimize.
[2024-06-02 19:59:12] [INFO ] Deduced a trap composed of 411 places in 200 ms of which 4 ms to minimize.
[2024-06-02 19:59:12] [INFO ] Deduced a trap composed of 212 places in 176 ms of which 4 ms to minimize.
[2024-06-02 19:59:12] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1471 ms
[2024-06-02 19:59:12] [INFO ] Computed and/alt/rep : 741/1099/741 causal constraints (skipped 200 transitions) in 61 ms.
[2024-06-02 19:59:14] [INFO ] Added : 125 causal constraints over 25 iterations in 1365 ms. Result :sat
Minimization took 402 ms.
[2024-06-02 19:59:14] [INFO ] [Real]Absence check using 11 positive place invariants in 13 ms returned sat
[2024-06-02 19:59:14] [INFO ] [Real]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-02 19:59:14] [INFO ] [Real]Absence check using state equation in 249 ms returned sat
[2024-06-02 19:59:14] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:59:15] [INFO ] [Nat]Absence check using 11 positive place invariants in 13 ms returned sat
[2024-06-02 19:59:15] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 0 ms returned sat
[2024-06-02 19:59:15] [INFO ] [Nat]Absence check using state equation in 207 ms returned sat
[2024-06-02 19:59:15] [INFO ] Deduced a trap composed of 68 places in 200 ms of which 4 ms to minimize.
[2024-06-02 19:59:15] [INFO ] Deduced a trap composed of 49 places in 231 ms of which 4 ms to minimize.
[2024-06-02 19:59:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 516 ms
[2024-06-02 19:59:15] [INFO ] Computed and/alt/rep : 741/1099/741 causal constraints (skipped 200 transitions) in 56 ms.
[2024-06-02 19:59:17] [INFO ] Deduced a trap composed of 210 places in 220 ms of which 4 ms to minimize.
[2024-06-02 19:59:17] [INFO ] Deduced a trap composed of 222 places in 200 ms of which 4 ms to minimize.
[2024-06-02 19:59:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 549 ms
[2024-06-02 19:59:17] [INFO ] Added : 118 causal constraints over 24 iterations in 1777 ms. Result :sat
Minimization took 402 ms.
[2024-06-02 19:59:18] [INFO ] [Real]Absence check using 11 positive place invariants in 13 ms returned sat
[2024-06-02 19:59:18] [INFO ] [Real]Absence check using 11 positive and 1 generalized place invariants in 0 ms returned sat
[2024-06-02 19:59:18] [INFO ] [Real]Absence check using state equation in 227 ms returned sat
[2024-06-02 19:59:18] [INFO ] Deduced a trap composed of 63 places in 150 ms of which 3 ms to minimize.
[2024-06-02 19:59:18] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:59:18] [INFO ] [Nat]Absence check using 11 positive place invariants in 14 ms returned sat
[2024-06-02 19:59:18] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-02 19:59:18] [INFO ] [Nat]Absence check using state equation in 213 ms returned sat
[2024-06-02 19:59:19] [INFO ] Deduced a trap composed of 63 places in 148 ms of which 3 ms to minimize.
[2024-06-02 19:59:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 215 ms
[2024-06-02 19:59:19] [INFO ] Computed and/alt/rep : 741/1099/741 causal constraints (skipped 200 transitions) in 69 ms.
[2024-06-02 19:59:19] [INFO ] Added : 58 causal constraints over 12 iterations in 686 ms. Result :sat
Minimization took 362 ms.
[2024-06-02 19:59:20] [INFO ] [Real]Absence check using 11 positive place invariants in 13 ms returned sat
[2024-06-02 19:59:20] [INFO ] [Real]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-02 19:59:20] [INFO ] [Real]Absence check using state equation in 233 ms returned sat
[2024-06-02 19:59:20] [INFO ] Deduced a trap composed of 49 places in 139 ms of which 3 ms to minimize.
[2024-06-02 19:59:20] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:59:20] [INFO ] [Nat]Absence check using 11 positive place invariants in 15 ms returned sat
[2024-06-02 19:59:20] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-02 19:59:21] [INFO ] [Nat]Absence check using state equation in 228 ms returned sat
[2024-06-02 19:59:21] [INFO ] Deduced a trap composed of 49 places in 132 ms of which 3 ms to minimize.
[2024-06-02 19:59:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 190 ms
[2024-06-02 19:59:21] [INFO ] Computed and/alt/rep : 741/1099/741 causal constraints (skipped 200 transitions) in 51 ms.
[2024-06-02 19:59:22] [INFO ] Added : 72 causal constraints over 15 iterations in 795 ms. Result :sat
Minimization took 369 ms.
[2024-06-02 19:59:22] [INFO ] [Real]Absence check using 11 positive place invariants in 18 ms returned sat
[2024-06-02 19:59:22] [INFO ] [Real]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-02 19:59:22] [INFO ] [Real]Absence check using state equation in 240 ms returned sat
[2024-06-02 19:59:23] [INFO ] Deduced a trap composed of 55 places in 194 ms of which 4 ms to minimize.
[2024-06-02 19:59:23] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:59:23] [INFO ] [Nat]Absence check using 11 positive place invariants in 16 ms returned sat
[2024-06-02 19:59:23] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 0 ms returned sat
[2024-06-02 19:59:23] [INFO ] [Nat]Absence check using state equation in 239 ms returned sat
[2024-06-02 19:59:23] [INFO ] Deduced a trap composed of 55 places in 202 ms of which 4 ms to minimize.
[2024-06-02 19:59:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 252 ms
[2024-06-02 19:59:23] [INFO ] Computed and/alt/rep : 741/1099/741 causal constraints (skipped 200 transitions) in 48 ms.
[2024-06-02 19:59:24] [INFO ] Added : 85 causal constraints over 17 iterations in 860 ms. Result :sat
Minimization took 387 ms.
[2024-06-02 19:59:25] [INFO ] [Real]Absence check using 11 positive place invariants in 13 ms returned sat
[2024-06-02 19:59:25] [INFO ] [Real]Absence check using 11 positive and 1 generalized place invariants in 3 ms returned sat
[2024-06-02 19:59:25] [INFO ] [Real]Absence check using state equation in 227 ms returned sat
[2024-06-02 19:59:25] [INFO ] Computed and/alt/rep : 741/1099/741 causal constraints (skipped 200 transitions) in 55 ms.
[2024-06-02 19:59:25] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:59:25] [INFO ] [Nat]Absence check using 11 positive place invariants in 14 ms returned sat
[2024-06-02 19:59:25] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 0 ms returned sat
[2024-06-02 19:59:26] [INFO ] [Nat]Absence check using state equation in 225 ms returned sat
[2024-06-02 19:59:26] [INFO ] Computed and/alt/rep : 741/1099/741 causal constraints (skipped 200 transitions) in 52 ms.
[2024-06-02 19:59:27] [INFO ] Deduced a trap composed of 20 places in 151 ms of which 3 ms to minimize.
[2024-06-02 19:59:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 235 ms
[2024-06-02 19:59:27] [INFO ] Added : 149 causal constraints over 31 iterations in 1795 ms. Result :sat
Minimization took 399 ms.
[2024-06-02 19:59:28] [INFO ] [Real]Absence check using 11 positive place invariants in 13 ms returned sat
[2024-06-02 19:59:28] [INFO ] [Real]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-02 19:59:28] [INFO ] [Real]Absence check using state equation in 246 ms returned sat
[2024-06-02 19:59:28] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:59:28] [INFO ] [Nat]Absence check using 11 positive place invariants in 14 ms returned sat
[2024-06-02 19:59:28] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 0 ms returned sat
[2024-06-02 19:59:29] [INFO ] [Nat]Absence check using state equation in 236 ms returned sat
[2024-06-02 19:59:29] [INFO ] Deduced a trap composed of 55 places in 196 ms of which 5 ms to minimize.
[2024-06-02 19:59:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 252 ms
[2024-06-02 19:59:29] [INFO ] Computed and/alt/rep : 741/1099/741 causal constraints (skipped 200 transitions) in 50 ms.
[2024-06-02 19:59:30] [INFO ] Added : 93 causal constraints over 19 iterations in 989 ms. Result :sat
Minimization took 382 ms.
[2024-06-02 19:59:30] [INFO ] [Real]Absence check using 11 positive place invariants in 14 ms returned sat
[2024-06-02 19:59:30] [INFO ] [Real]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-02 19:59:31] [INFO ] [Real]Absence check using state equation in 207 ms returned sat
[2024-06-02 19:59:31] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:59:31] [INFO ] [Nat]Absence check using 11 positive place invariants in 15 ms returned sat
[2024-06-02 19:59:31] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 0 ms returned sat
[2024-06-02 19:59:31] [INFO ] [Nat]Absence check using state equation in 225 ms returned sat
[2024-06-02 19:59:31] [INFO ] Computed and/alt/rep : 741/1099/741 causal constraints (skipped 200 transitions) in 56 ms.
[2024-06-02 19:59:32] [INFO ] Added : 81 causal constraints over 17 iterations in 859 ms. Result :sat
Minimization took 363 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-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-16-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-16-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-16-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 1, 0] Max Struct:[1, 1, 1, 1]
Support contains 4 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 6 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 355 transitions
Trivial Post-agglo rules discarded 355 transitions
Performed 355 trivial Post agglomeration. Transition count delta: 355
Iterating post reduction 0 with 386 rules applied. Total rules applied 388 place count 675 transition count 534
Reduce places removed 355 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 1 with 384 rules applied. Total rules applied 772 place count 320 transition count 505
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 29 rules applied. Total rules applied 801 place count 307 transition count 489
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 9 rules applied. Total rules applied 810 place count 304 transition count 483
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 4 with 9 rules applied. Total rules applied 819 place count 301 transition count 477
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 825 place count 298 transition count 474
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 825 place count 298 transition count 473
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 827 place count 297 transition count 473
Discarding 49 places :
Symmetric choice reduction at 6 with 49 rule applications. Total rules 876 place count 248 transition count 424
Iterating global reduction 6 with 49 rules applied. Total rules applied 925 place count 248 transition count 424
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 14 Pre rules applied. Total rules applied 925 place count 248 transition count 410
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 6 with 28 rules applied. Total rules applied 953 place count 234 transition count 410
Discarding 31 places :
Symmetric choice reduction at 6 with 31 rule applications. Total rules 984 place count 203 transition count 355
Iterating global reduction 6 with 31 rules applied. Total rules applied 1015 place count 203 transition count 355
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 6 with 7 rules applied. Total rules applied 1022 place count 203 transition count 348
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1023 place count 202 transition count 348
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 1027 place count 198 transition count 343
Iterating global reduction 8 with 4 rules applied. Total rules applied 1031 place count 198 transition count 343
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 1035 place count 198 transition count 339
Performed 74 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 74 places in 0 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 9 with 148 rules applied. Total rules applied 1183 place count 124 transition count 255
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 1187 place count 124 transition count 251
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: -38
Deduced a syphon composed of 37 places in 1 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 10 with 74 rules applied. Total rules applied 1261 place count 87 transition count 289
Drop transitions (Empty/Sink Transition effects.) removed 56 transitions
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 76 transitions.
Iterating post reduction 10 with 76 rules applied. Total rules applied 1337 place count 87 transition count 213
Discarding 28 places :
Symmetric choice reduction at 11 with 28 rule applications. Total rules 1365 place count 59 transition count 146
Iterating global reduction 11 with 28 rules applied. Total rules applied 1393 place count 59 transition count 146
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 11 with 20 rules applied. Total rules applied 1413 place count 59 transition count 126
Discarding 5 places :
Symmetric choice reduction at 12 with 5 rule applications. Total rules 1418 place count 54 transition count 105
Iterating global reduction 12 with 5 rules applied. Total rules applied 1423 place count 54 transition count 105
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 12 with 3 rules applied. Total rules applied 1426 place count 54 transition count 102
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 1428 place count 53 transition count 117
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 13 with 3 rules applied. Total rules applied 1431 place count 53 transition count 114
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 14 with 10 rules applied. Total rules applied 1441 place count 53 transition count 104
Discarding 1 places :
Symmetric choice reduction at 14 with 1 rule applications. Total rules 1442 place count 52 transition count 102
Iterating global reduction 14 with 1 rules applied. Total rules applied 1443 place count 52 transition count 102
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 1444 place count 52 transition count 101
Free-agglomeration rule applied 11 times.
Iterating global reduction 15 with 11 rules applied. Total rules applied 1455 place count 52 transition count 90
Reduce places removed 11 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 15 with 13 rules applied. Total rules applied 1468 place count 41 transition count 88
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 1469 place count 41 transition count 88
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 16 with 1 rules applied. Total rules applied 1470 place count 40 transition count 87
Reduce places removed 3 places and 0 transitions.
Graph (trivial) has 23 edges and 37 vertex of which 5 / 37 are part of one of the 2 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 16 with 4 rules applied. Total rules applied 1474 place count 34 transition count 87
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 25 edges and 33 vertex of which 6 / 33 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 1484 place count 28 transition count 79
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 1507 place count 28 transition count 56
Discarding 1 places :
Symmetric choice reduction at 19 with 1 rule applications. Total rules 1508 place count 27 transition count 54
Iterating global reduction 19 with 1 rules applied. Total rules applied 1509 place count 27 transition count 54
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 19 with 1 rules applied. Total rules applied 1510 place count 27 transition count 53
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 20 with 4 rules applied. Total rules applied 1514 place count 27 transition count 49
Free-agglomeration rule applied 2 times.
Iterating global reduction 20 with 2 rules applied. Total rules applied 1516 place count 27 transition count 47
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 20 with 2 rules applied. Total rules applied 1518 place count 25 transition count 47
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 21 with 2 rules applied. Total rules applied 1520 place count 25 transition count 45
Free-agglomeration rule applied 1 times.
Iterating global reduction 21 with 1 rules applied. Total rules applied 1521 place count 25 transition count 44
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 21 with 1 rules applied. Total rules applied 1522 place count 24 transition count 44
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 22 with 2 rules applied. Total rules applied 1524 place count 24 transition count 42
Free-agglomeration rule applied 1 times.
Iterating global reduction 22 with 1 rules applied. Total rules applied 1525 place count 24 transition count 41
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 22 with 3 rules applied. Total rules applied 1528 place count 23 transition count 39
Applied a total of 1528 rules in 232 ms. Remains 23 /721 variables (removed 698) and now considering 39/942 (removed 903) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 241 ms. Remains : 23/721 places, 39/942 transitions.
[2024-06-02 19:59:33] [INFO ] Flow matrix only has 34 transitions (discarded 5 similar events)
// Phase 1: matrix 34 rows 23 cols
[2024-06-02 19:59:33] [INFO ] Computed 6 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 1, 0] Max Struct:[1, 1, 1, 1]
FORMULA CO4-PT-16-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (2 resets) in 894 ms. (1117 steps per ms)
FORMULA CO4-PT-16-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-16-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-16-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000000 steps (2 resets) in 298 ms. (3344 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 )
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 25292 ms.
ITS solved all properties within timeout

BK_STOP 1717358374553

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML

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="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
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 r549-tall-171734897900125"
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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;