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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 684K
-rw-r--r-- 1 mcc users 6.3K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K 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 26K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 9.9K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K 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 248K 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-17-UpperBounds-00
FORMULA_NAME CO4-PT-17-UpperBounds-01
FORMULA_NAME CO4-PT-17-UpperBounds-02
FORMULA_NAME CO4-PT-17-UpperBounds-03
FORMULA_NAME CO4-PT-17-UpperBounds-04
FORMULA_NAME CO4-PT-17-UpperBounds-05
FORMULA_NAME CO4-PT-17-UpperBounds-06
FORMULA_NAME CO4-PT-17-UpperBounds-07
FORMULA_NAME CO4-PT-17-UpperBounds-08
FORMULA_NAME CO4-PT-17-UpperBounds-09
FORMULA_NAME CO4-PT-17-UpperBounds-10
FORMULA_NAME CO4-PT-17-UpperBounds-11
FORMULA_NAME CO4-PT-17-UpperBounds-12
FORMULA_NAME CO4-PT-17-UpperBounds-13
FORMULA_NAME CO4-PT-17-UpperBounds-14
FORMULA_NAME CO4-PT-17-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717359690033

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-17
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-02 20:21:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-02 20:21:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 20:21:31] [INFO ] Load time of PNML (sax parser for PT used): 108 ms
[2024-06-02 20:21:31] [INFO ] Transformed 967 places.
[2024-06-02 20:21:31] [INFO ] Transformed 1150 transitions.
[2024-06-02 20:21:31] [INFO ] Found NUPN structural information;
[2024-06-02 20:21:31] [INFO ] Parsed PT model containing 967 places and 1150 transitions and 2568 arcs in 220 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Deduced a syphon composed of 198 places in 11 ms
Reduce places removed 198 places and 238 transitions.
FORMULA CO4-PT-17-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-17-UpperBounds-08 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, 1] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
FORMULA CO4-PT-17-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Before main loop) : Max Seen:[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]
// Phase 1: matrix 912 rows 769 cols
[2024-06-02 20:21:31] [INFO ] Computed 9 invariants in 32 ms
Current structural bounds on expressions (after invariants) : Max Seen:[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]
RANDOM walk for 10000 steps (16 resets) in 33 ms. (294 steps per ms)
FORMULA CO4-PT-17-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-17-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-17-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 100000 steps (210 resets) in 164 ms. (606 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-02 20:21:31] [INFO ] Invariant cache hit.
[2024-06-02 20:21:32] [INFO ] [Real]Absence check using 9 positive place invariants in 17 ms returned sat
[2024-06-02 20:21:32] [INFO ] [Real]Absence check using state equation in 258 ms returned sat
[2024-06-02 20:21:32] [INFO ] Deduced a trap composed of 19 places in 198 ms of which 33 ms to minimize.
[2024-06-02 20:21:32] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 20:21:32] [INFO ] [Nat]Absence check using 9 positive place invariants in 16 ms returned sat
[2024-06-02 20:21:33] [INFO ] [Nat]Absence check using state equation in 219 ms returned sat
[2024-06-02 20:21:33] [INFO ] Deduced a trap composed of 19 places in 127 ms of which 4 ms to minimize.
[2024-06-02 20:21:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 208 ms
[2024-06-02 20:21:33] [INFO ] Computed and/alt/rep : 797/974/797 causal constraints (skipped 114 transitions) in 55 ms.
[2024-06-02 20:21:34] [INFO ] Added : 120 causal constraints over 24 iterations in 1366 ms. Result :sat
Minimization took 275 ms.
[2024-06-02 20:21:35] [INFO ] [Real]Absence check using 9 positive place invariants in 14 ms returned sat
[2024-06-02 20:21:35] [INFO ] [Real]Absence check using state equation in 227 ms returned sat
[2024-06-02 20:21:35] [INFO ] Deduced a trap composed of 19 places in 146 ms of which 3 ms to minimize.
[2024-06-02 20:21:35] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 20:21:35] [INFO ] [Nat]Absence check using 9 positive place invariants in 14 ms returned sat
[2024-06-02 20:21:35] [INFO ] [Nat]Absence check using state equation in 212 ms returned sat
[2024-06-02 20:21:36] [INFO ] Deduced a trap composed of 19 places in 120 ms of which 3 ms to minimize.
[2024-06-02 20:21:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 176 ms
[2024-06-02 20:21:36] [INFO ] Computed and/alt/rep : 797/974/797 causal constraints (skipped 114 transitions) in 58 ms.
[2024-06-02 20:21:37] [INFO ] Added : 116 causal constraints over 24 iterations in 1226 ms. Result :sat
Minimization took 271 ms.
[2024-06-02 20:21:37] [INFO ] [Real]Absence check using 9 positive place invariants in 14 ms returned sat
[2024-06-02 20:21:38] [INFO ] [Real]Absence check using state equation in 222 ms returned sat
[2024-06-02 20:21:38] [INFO ] Deduced a trap composed of 19 places in 124 ms of which 3 ms to minimize.
[2024-06-02 20:21:38] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 20:21:38] [INFO ] [Nat]Absence check using 9 positive place invariants in 14 ms returned sat
[2024-06-02 20:21:38] [INFO ] [Nat]Absence check using state equation in 219 ms returned sat
[2024-06-02 20:21:38] [INFO ] Deduced a trap composed of 19 places in 112 ms of which 3 ms to minimize.
[2024-06-02 20:21:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 173 ms
[2024-06-02 20:21:38] [INFO ] Computed and/alt/rep : 797/974/797 causal constraints (skipped 114 transitions) in 50 ms.
[2024-06-02 20:21:39] [INFO ] Added : 103 causal constraints over 21 iterations in 1004 ms. Result :sat
Minimization took 247 ms.
[2024-06-02 20:21:40] [INFO ] [Real]Absence check using 9 positive place invariants in 13 ms returned sat
[2024-06-02 20:21:40] [INFO ] [Real]Absence check using state equation in 213 ms returned sat
[2024-06-02 20:21:40] [INFO ] Deduced a trap composed of 19 places in 145 ms of which 3 ms to minimize.
[2024-06-02 20:21:40] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 20:21:40] [INFO ] [Nat]Absence check using 9 positive place invariants in 14 ms returned sat
[2024-06-02 20:21:41] [INFO ] [Nat]Absence check using state equation in 223 ms returned sat
[2024-06-02 20:21:41] [INFO ] Deduced a trap composed of 19 places in 151 ms of which 3 ms to minimize.
[2024-06-02 20:21:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 208 ms
[2024-06-02 20:21:41] [INFO ] Computed and/alt/rep : 797/974/797 causal constraints (skipped 114 transitions) in 49 ms.
[2024-06-02 20:21:42] [INFO ] Added : 91 causal constraints over 19 iterations in 923 ms. Result :sat
Minimization took 255 ms.
[2024-06-02 20:21:42] [INFO ] [Real]Absence check using 9 positive place invariants in 16 ms returned sat
[2024-06-02 20:21:42] [INFO ] [Real]Absence check using state equation in 221 ms returned sat
[2024-06-02 20:21:42] [INFO ] Deduced a trap composed of 19 places in 115 ms of which 3 ms to minimize.
[2024-06-02 20:21:43] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 20:21:43] [INFO ] [Nat]Absence check using 9 positive place invariants in 14 ms returned sat
[2024-06-02 20:21:43] [INFO ] [Nat]Absence check using state equation in 223 ms returned sat
[2024-06-02 20:21:43] [INFO ] Deduced a trap composed of 19 places in 117 ms of which 2 ms to minimize.
[2024-06-02 20:21:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 175 ms
[2024-06-02 20:21:43] [INFO ] Computed and/alt/rep : 797/974/797 causal constraints (skipped 114 transitions) in 54 ms.
[2024-06-02 20:21:44] [INFO ] Added : 105 causal constraints over 21 iterations in 1007 ms. Result :sat
Minimization took 257 ms.
[2024-06-02 20:21:44] [INFO ] [Real]Absence check using 9 positive place invariants in 13 ms returned sat
[2024-06-02 20:21:45] [INFO ] [Real]Absence check using state equation in 219 ms returned sat
[2024-06-02 20:21:45] [INFO ] Deduced a trap composed of 19 places in 145 ms of which 4 ms to minimize.
[2024-06-02 20:21:45] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 20:21:45] [INFO ] [Nat]Absence check using 9 positive place invariants in 19 ms returned sat
[2024-06-02 20:21:45] [INFO ] [Nat]Absence check using state equation in 201 ms returned sat
[2024-06-02 20:21:45] [INFO ] Deduced a trap composed of 19 places in 148 ms of which 4 ms to minimize.
[2024-06-02 20:21:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 209 ms
[2024-06-02 20:21:46] [INFO ] Computed and/alt/rep : 797/974/797 causal constraints (skipped 114 transitions) in 50 ms.
[2024-06-02 20:21:47] [INFO ] Added : 108 causal constraints over 22 iterations in 1049 ms. Result :sat
Minimization took 256 ms.
[2024-06-02 20:21:47] [INFO ] [Real]Absence check using 9 positive place invariants in 12 ms returned sat
[2024-06-02 20:21:47] [INFO ] [Real]Absence check using state equation in 227 ms returned sat
[2024-06-02 20:21:47] [INFO ] Deduced a trap composed of 19 places in 119 ms of which 2 ms to minimize.
[2024-06-02 20:21:47] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 20:21:48] [INFO ] [Nat]Absence check using 9 positive place invariants in 13 ms returned sat
[2024-06-02 20:21:48] [INFO ] [Nat]Absence check using state equation in 226 ms returned sat
[2024-06-02 20:21:48] [INFO ] Deduced a trap composed of 19 places in 120 ms of which 3 ms to minimize.
[2024-06-02 20:21:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 192 ms
[2024-06-02 20:21:48] [INFO ] Computed and/alt/rep : 797/974/797 causal constraints (skipped 114 transitions) in 56 ms.
[2024-06-02 20:21:49] [INFO ] Added : 106 causal constraints over 22 iterations in 1111 ms. Result :sat
Minimization took 262 ms.
[2024-06-02 20:21:50] [INFO ] [Real]Absence check using 9 positive place invariants in 13 ms returned sat
[2024-06-02 20:21:50] [INFO ] [Real]Absence check using state equation in 223 ms returned sat
[2024-06-02 20:21:50] [INFO ] Deduced a trap composed of 19 places in 117 ms of which 2 ms to minimize.
[2024-06-02 20:21:50] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 20:21:50] [INFO ] [Nat]Absence check using 9 positive place invariants in 13 ms returned sat
[2024-06-02 20:21:50] [INFO ] [Nat]Absence check using state equation in 221 ms returned sat
[2024-06-02 20:21:50] [INFO ] Deduced a trap composed of 19 places in 111 ms of which 3 ms to minimize.
[2024-06-02 20:21:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 163 ms
[2024-06-02 20:21:51] [INFO ] Computed and/alt/rep : 797/974/797 causal constraints (skipped 114 transitions) in 45 ms.
[2024-06-02 20:21:52] [INFO ] Added : 107 causal constraints over 22 iterations in 1069 ms. Result :sat
Minimization took 263 ms.
[2024-06-02 20:21:52] [INFO ] [Real]Absence check using 9 positive place invariants in 13 ms returned sat
[2024-06-02 20:21:52] [INFO ] [Real]Absence check using state equation in 228 ms returned sat
[2024-06-02 20:21:52] [INFO ] Deduced a trap composed of 19 places in 121 ms of which 3 ms to minimize.
[2024-06-02 20:21:52] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 20:21:53] [INFO ] [Nat]Absence check using 9 positive place invariants in 14 ms returned sat
[2024-06-02 20:21:53] [INFO ] [Nat]Absence check using state equation in 228 ms returned sat
[2024-06-02 20:21:53] [INFO ] Deduced a trap composed of 19 places in 119 ms of which 3 ms to minimize.
[2024-06-02 20:21:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 180 ms
[2024-06-02 20:21:53] [INFO ] Computed and/alt/rep : 797/974/797 causal constraints (skipped 114 transitions) in 43 ms.
[2024-06-02 20:21:54] [INFO ] Added : 105 causal constraints over 21 iterations in 1000 ms. Result :sat
Minimization took 252 ms.
[2024-06-02 20:21:54] [INFO ] [Real]Absence check using 9 positive place invariants in 13 ms returned sat
[2024-06-02 20:21:55] [INFO ] [Real]Absence check using state equation in 221 ms returned sat
[2024-06-02 20:21:55] [INFO ] Deduced a trap composed of 19 places in 116 ms of which 3 ms to minimize.
[2024-06-02 20:21:55] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 20:21:55] [INFO ] [Nat]Absence check using 9 positive place invariants in 14 ms returned sat
[2024-06-02 20:21:55] [INFO ] [Nat]Absence check using state equation in 219 ms returned sat
[2024-06-02 20:21:55] [INFO ] Deduced a trap composed of 19 places in 117 ms of which 3 ms to minimize.
[2024-06-02 20:21:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 171 ms
[2024-06-02 20:21:55] [INFO ] Computed and/alt/rep : 797/974/797 causal constraints (skipped 114 transitions) in 45 ms.
[2024-06-02 20:21:57] [INFO ] Added : 121 causal constraints over 25 iterations in 1196 ms. Result :sat
Minimization took 259 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
FORMULA CO4-PT-17-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-17-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-17-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-17-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-17-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-17-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-17-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-17-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 1]
Support contains 2 out of 769 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 769/769 places, 912/912 transitions.
Graph (trivial) has 793 edges and 769 vertex of which 2 / 769 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 1145 edges and 768 vertex of which 712 are kept as prefixes of interest. Removing 56 places using SCC suffix rule.2 ms
Discarding 56 places :
Also discarding 34 output transitions
Drop transitions (Output transitions of discarded places.) removed 34 transitions
Drop transitions (Empty/Sink Transition effects.) removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 372 transitions
Trivial Post-agglo rules discarded 372 transitions
Performed 372 trivial Post agglomeration. Transition count delta: 372
Iterating post reduction 0 with 396 rules applied. Total rules applied 398 place count 712 transition count 480
Reduce places removed 372 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 381 rules applied. Total rules applied 779 place count 340 transition count 471
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 2 with 9 rules applied. Total rules applied 788 place count 336 transition count 466
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 3 with 3 rules applied. Total rules applied 791 place count 335 transition count 464
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 793 place count 334 transition count 463
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 794 place count 333 transition count 463
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 794 place count 333 transition count 461
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 798 place count 331 transition count 461
Discarding 39 places :
Symmetric choice reduction at 6 with 39 rule applications. Total rules 837 place count 292 transition count 422
Iterating global reduction 6 with 39 rules applied. Total rules applied 876 place count 292 transition count 422
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 16 Pre rules applied. Total rules applied 876 place count 292 transition count 406
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 6 with 32 rules applied. Total rules applied 908 place count 276 transition count 406
Discarding 28 places :
Symmetric choice reduction at 6 with 28 rule applications. Total rules 936 place count 248 transition count 378
Iterating global reduction 6 with 28 rules applied. Total rules applied 964 place count 248 transition count 378
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 6 with 4 rules applied. Total rules applied 968 place count 248 transition count 374
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 969 place count 247 transition count 374
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 970 place count 246 transition count 372
Iterating global reduction 8 with 1 rules applied. Total rules applied 971 place count 246 transition count 372
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 972 place count 246 transition count 371
Performed 111 Post agglomeration using F-continuation condition with reduction of 14 identical transitions.
Deduced a syphon composed of 111 places in 0 ms
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 9 with 222 rules applied. Total rules applied 1194 place count 135 transition count 246
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 1198 place count 135 transition count 242
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 1199 place count 134 transition count 241
Iterating global reduction 10 with 1 rules applied. Total rules applied 1200 place count 134 transition count 241
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 43 places in 0 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 10 with 86 rules applied. Total rules applied 1286 place count 91 transition count 244
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 10 with 28 rules applied. Total rules applied 1314 place count 91 transition count 216
Discarding 39 places :
Symmetric choice reduction at 11 with 39 rule applications. Total rules 1353 place count 52 transition count 138
Iterating global reduction 11 with 39 rules applied. Total rules applied 1392 place count 52 transition count 138
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 11 with 27 rules applied. Total rules applied 1419 place count 52 transition count 111
Discarding 10 places :
Symmetric choice reduction at 12 with 10 rule applications. Total rules 1429 place count 42 transition count 82
Iterating global reduction 12 with 10 rules applied. Total rules applied 1439 place count 42 transition count 82
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 12 with 7 rules applied. Total rules applied 1446 place count 42 transition count 75
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -17
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 1448 place count 41 transition count 92
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 1451 place count 41 transition count 89
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 14 with 8 rules applied. Total rules applied 1459 place count 41 transition count 81
Free-agglomeration rule applied 5 times.
Iterating global reduction 14 with 5 rules applied. Total rules applied 1464 place count 41 transition count 76
Reduce places removed 5 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 14 with 8 rules applied. Total rules applied 1472 place count 36 transition count 73
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 15 with 1 rules applied. Total rules applied 1473 place count 36 transition count 73
Graph (complete) has 127 edges and 36 vertex of which 35 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 15 with 1 rules applied. Total rules applied 1474 place count 35 transition count 73
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 1475 place count 35 transition count 72
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 1476 place count 35 transition count 72
Graph (complete) has 124 edges and 35 vertex of which 34 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 1477 place count 34 transition count 72
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 1478 place count 34 transition count 71
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 1479 place count 34 transition count 71
Graph (complete) has 121 edges and 34 vertex of which 33 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 1480 place count 33 transition count 71
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 1481 place count 33 transition count 70
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 21 with 1 rules applied. Total rules applied 1482 place count 32 transition count 69
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 t83.t948.t11.t12 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 26 edges and 28 vertex of which 3 / 28 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 21 with 3 rules applied. Total rules applied 1485 place count 26 transition count 67
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 22 with 5 rules applied. Total rules applied 1490 place count 26 transition count 62
Discarding 1 places :
Symmetric choice reduction at 23 with 1 rule applications. Total rules 1491 place count 25 transition count 58
Iterating global reduction 23 with 1 rules applied. Total rules applied 1492 place count 25 transition count 58
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 23 with 1 rules applied. Total rules applied 1493 place count 25 transition count 57
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 1507 place count 25 transition count 43
Discarding 6 places :
Symmetric choice reduction at 24 with 6 rule applications. Total rules 1513 place count 19 transition count 35
Iterating global reduction 24 with 6 rules applied. Total rules applied 1519 place count 19 transition count 35
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 24 with 6 rules applied. Total rules applied 1525 place count 19 transition count 29
Discarding 3 places :
Symmetric choice reduction at 25 with 3 rule applications. Total rules 1528 place count 16 transition count 25
Iterating global reduction 25 with 3 rules applied. Total rules applied 1531 place count 16 transition count 25
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 25 with 3 rules applied. Total rules applied 1534 place count 16 transition count 22
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 26 with 2 rules applied. Total rules applied 1536 place count 15 transition count 21
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 30 edges and 15 vertex of which 8 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.0 ms
Discarding 7 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Iterating post reduction 26 with 2 rules applied. Total rules applied 1538 place count 8 transition count 14
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 27 with 4 rules applied. Total rules applied 1542 place count 8 transition count 10
Free-agglomeration rule applied 1 times.
Iterating global reduction 28 with 1 rules applied. Total rules applied 1543 place count 8 transition count 9
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 28 with 1 rules applied. Total rules applied 1544 place count 7 transition count 9
Applied a total of 1544 rules in 210 ms. Remains 7 /769 variables (removed 762) and now considering 9/912 (removed 903) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 219 ms. Remains : 7/769 places, 9/912 transitions.
// Phase 1: matrix 9 rows 7 cols
[2024-06-02 20:21:57] [INFO ] Computed 2 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[1, 1]
RANDOM walk for 1000000 steps (2 resets) in 391 ms. (2551 steps per ms)
FORMULA CO4-PT-17-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-17-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (2 resets) in 221 ms. (4504 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 27222 ms.
ITS solved all properties within timeout

BK_STOP 1717359718444

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

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