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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 5.9K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K 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 7.5K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 76K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.8K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K 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 97K 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-06-UpperBounds-00
FORMULA_NAME CO4-PT-06-UpperBounds-01
FORMULA_NAME CO4-PT-06-UpperBounds-02
FORMULA_NAME CO4-PT-06-UpperBounds-03
FORMULA_NAME CO4-PT-06-UpperBounds-04
FORMULA_NAME CO4-PT-06-UpperBounds-05
FORMULA_NAME CO4-PT-06-UpperBounds-06
FORMULA_NAME CO4-PT-06-UpperBounds-07
FORMULA_NAME CO4-PT-06-UpperBounds-08
FORMULA_NAME CO4-PT-06-UpperBounds-09
FORMULA_NAME CO4-PT-06-UpperBounds-10
FORMULA_NAME CO4-PT-06-UpperBounds-11
FORMULA_NAME CO4-PT-06-UpperBounds-12
FORMULA_NAME CO4-PT-06-UpperBounds-13
FORMULA_NAME CO4-PT-06-UpperBounds-14
FORMULA_NAME CO4-PT-06-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717351488049

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-06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-02 18:04:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-02 18:04:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:04:49] [INFO ] Load time of PNML (sax parser for PT used): 89 ms
[2024-06-02 18:04:49] [INFO ] Transformed 383 places.
[2024-06-02 18:04:49] [INFO ] Transformed 454 transitions.
[2024-06-02 18:04:49] [INFO ] Found NUPN structural information;
[2024-06-02 18:04:49] [INFO ] Parsed PT model containing 383 places and 454 transitions and 1016 arcs in 188 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Deduced a syphon composed of 100 places in 4 ms
Reduce places removed 100 places and 120 transitions.
FORMULA CO4-PT-06-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-06-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-06-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-06-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-06-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-06-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-06-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-06-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[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] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 334 rows 283 cols
[2024-06-02 18:04:49] [INFO ] Computed 6 invariants in 24 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (9 resets) in 28 ms. (344 steps per ms)
FORMULA CO4-PT-06-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-06-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 60000 steps (117 resets) in 75 ms. (789 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
[2024-06-02 18:04:49] [INFO ] Invariant cache hit.
[2024-06-02 18:04:49] [INFO ] [Real]Absence check using 6 positive place invariants in 8 ms returned sat
[2024-06-02 18:04:49] [INFO ] [Real]Absence check using state equation in 95 ms returned sat
[2024-06-02 18:04:50] [INFO ] Computed and/alt/rep : 291/376/291 causal constraints (skipped 42 transitions) in 30 ms.
[2024-06-02 18:04:50] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:04:50] [INFO ] [Nat]Absence check using 6 positive place invariants in 6 ms returned sat
[2024-06-02 18:04:50] [INFO ] [Nat]Absence check using state equation in 86 ms returned sat
[2024-06-02 18:04:50] [INFO ] Computed and/alt/rep : 291/376/291 causal constraints (skipped 42 transitions) in 53 ms.
[2024-06-02 18:04:50] [INFO ] Added : 41 causal constraints over 9 iterations in 399 ms. Result :sat
Minimization took 95 ms.
[2024-06-02 18:04:50] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned sat
[2024-06-02 18:04:51] [INFO ] [Real]Absence check using state equation in 99 ms returned sat
[2024-06-02 18:04:51] [INFO ] Computed and/alt/rep : 291/376/291 causal constraints (skipped 42 transitions) in 23 ms.
[2024-06-02 18:04:51] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:04:51] [INFO ] [Nat]Absence check using 6 positive place invariants in 6 ms returned sat
[2024-06-02 18:04:51] [INFO ] [Nat]Absence check using state equation in 80 ms returned sat
[2024-06-02 18:04:51] [INFO ] Computed and/alt/rep : 291/376/291 causal constraints (skipped 42 transitions) in 20 ms.
[2024-06-02 18:04:51] [INFO ] Added : 47 causal constraints over 10 iterations in 241 ms. Result :sat
Minimization took 77 ms.
[2024-06-02 18:04:51] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2024-06-02 18:04:51] [INFO ] [Real]Absence check using state equation in 86 ms returned sat
[2024-06-02 18:04:51] [INFO ] Computed and/alt/rep : 291/376/291 causal constraints (skipped 42 transitions) in 19 ms.
[2024-06-02 18:04:51] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:04:51] [INFO ] [Nat]Absence check using 6 positive place invariants in 5 ms returned sat
[2024-06-02 18:04:51] [INFO ] [Nat]Absence check using state equation in 82 ms returned sat
[2024-06-02 18:04:52] [INFO ] Computed and/alt/rep : 291/376/291 causal constraints (skipped 42 transitions) in 35 ms.
[2024-06-02 18:04:52] [INFO ] Added : 41 causal constraints over 9 iterations in 229 ms. Result :sat
Minimization took 79 ms.
[2024-06-02 18:04:52] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned sat
[2024-06-02 18:04:52] [INFO ] [Real]Absence check using state equation in 80 ms returned sat
[2024-06-02 18:04:52] [INFO ] Computed and/alt/rep : 291/376/291 causal constraints (skipped 42 transitions) in 25 ms.
[2024-06-02 18:04:52] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:04:52] [INFO ] [Nat]Absence check using 6 positive place invariants in 6 ms returned sat
[2024-06-02 18:04:52] [INFO ] [Nat]Absence check using state equation in 79 ms returned sat
[2024-06-02 18:04:52] [INFO ] Computed and/alt/rep : 291/376/291 causal constraints (skipped 42 transitions) in 24 ms.
[2024-06-02 18:04:52] [INFO ] Added : 43 causal constraints over 9 iterations in 215 ms. Result :sat
Minimization took 76 ms.
[2024-06-02 18:04:53] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2024-06-02 18:04:53] [INFO ] [Real]Absence check using state equation in 79 ms returned sat
[2024-06-02 18:04:53] [INFO ] Deduced a trap composed of 198 places in 119 ms of which 20 ms to minimize.
[2024-06-02 18:04:53] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:04:53] [INFO ] [Nat]Absence check using 6 positive place invariants in 5 ms returned sat
[2024-06-02 18:04:53] [INFO ] [Nat]Absence check using state equation in 79 ms returned sat
[2024-06-02 18:04:53] [INFO ] Deduced a trap composed of 198 places in 99 ms of which 3 ms to minimize.
[2024-06-02 18:04:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 135 ms
[2024-06-02 18:04:53] [INFO ] Computed and/alt/rep : 291/376/291 causal constraints (skipped 42 transitions) in 22 ms.
[2024-06-02 18:04:53] [INFO ] Added : 49 causal constraints over 10 iterations in 227 ms. Result :sat
Minimization took 88 ms.
[2024-06-02 18:04:54] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned sat
[2024-06-02 18:04:54] [INFO ] [Real]Absence check using state equation in 79 ms returned sat
[2024-06-02 18:04:54] [INFO ] Computed and/alt/rep : 291/376/291 causal constraints (skipped 42 transitions) in 19 ms.
[2024-06-02 18:04:54] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:04:54] [INFO ] [Nat]Absence check using 6 positive place invariants in 6 ms returned sat
[2024-06-02 18:04:54] [INFO ] [Nat]Absence check using state equation in 75 ms returned sat
[2024-06-02 18:04:54] [INFO ] Computed and/alt/rep : 291/376/291 causal constraints (skipped 42 transitions) in 19 ms.
[2024-06-02 18:04:54] [INFO ] Added : 42 causal constraints over 9 iterations in 200 ms. Result :sat
Minimization took 81 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
FORMULA CO4-PT-06-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-06-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-06-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 0, 0] Max Struct:[1, 1, 1]
Support contains 3 out of 283 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 283/283 places, 334/334 transitions.
Graph (trivial) has 283 edges and 283 vertex of which 2 / 283 are part of one of the 1 SCC in 11 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 426 edges and 282 vertex of which 252 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.2 ms
Discarding 30 places :
Also discarding 17 output transitions
Drop transitions (Output transitions of discarded places.) removed 17 transitions
Drop transitions (Empty/Sink Transition effects.) removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 124 transitions
Trivial Post-agglo rules discarded 124 transitions
Performed 124 trivial Post agglomeration. Transition count delta: 124
Iterating post reduction 0 with 140 rules applied. Total rules applied 142 place count 252 transition count 175
Reduce places removed 124 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 1 with 131 rules applied. Total rules applied 273 place count 128 transition count 168
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 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 7 rules applied. Total rules applied 280 place count 125 transition count 164
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 283 place count 124 transition count 162
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 286 place count 123 transition count 160
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 5 with 4 rules applied. Total rules applied 290 place count 122 transition count 157
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 292 place count 120 transition count 157
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 2 Pre rules applied. Total rules applied 292 place count 120 transition count 155
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 296 place count 118 transition count 155
Discarding 17 places :
Symmetric choice reduction at 7 with 17 rule applications. Total rules 313 place count 101 transition count 138
Iterating global reduction 7 with 17 rules applied. Total rules applied 330 place count 101 transition count 138
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 5 Pre rules applied. Total rules applied 330 place count 101 transition count 133
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 7 with 10 rules applied. Total rules applied 340 place count 96 transition count 133
Discarding 10 places :
Symmetric choice reduction at 7 with 10 rule applications. Total rules 350 place count 86 transition count 123
Iterating global reduction 7 with 10 rules applied. Total rules applied 360 place count 86 transition count 123
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 361 place count 86 transition count 122
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 362 place count 85 transition count 121
Iterating global reduction 8 with 1 rules applied. Total rules applied 363 place count 85 transition count 121
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 364 place count 85 transition count 120
Performed 34 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 34 places in 1 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 9 with 68 rules applied. Total rules applied 432 place count 51 transition count 82
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 9 with 24 rules applied. Total rules applied 456 place count 39 transition count 83
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 9 with 8 rules applied. Total rules applied 464 place count 39 transition count 75
Discarding 11 places :
Symmetric choice reduction at 10 with 11 rule applications. Total rules 475 place count 28 transition count 53
Iterating global reduction 10 with 11 rules applied. Total rules applied 486 place count 28 transition count 53
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 10 with 8 rules applied. Total rules applied 494 place count 28 transition count 45
Discarding 2 places :
Symmetric choice reduction at 11 with 2 rule applications. Total rules 496 place count 26 transition count 39
Iterating global reduction 11 with 2 rules applied. Total rules applied 498 place count 26 transition count 39
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 500 place count 25 transition count 47
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 11 with 3 rules applied. Total rules applied 503 place count 25 transition count 44
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 12 with 9 rules applied. Total rules applied 512 place count 25 transition count 35
Free-agglomeration rule applied 4 times.
Iterating global reduction 12 with 4 rules applied. Total rules applied 516 place count 25 transition count 31
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 54 edges and 21 vertex of which 20 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 12 with 6 rules applied. Total rules applied 522 place count 20 transition count 30
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 523 place count 20 transition count 29
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 14 with 2 rules applied. Total rules applied 525 place count 20 transition count 29
Graph (complete) has 51 edges and 20 vertex of which 19 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 14 with 1 rules applied. Total rules applied 526 place count 19 transition count 29
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 15 with 1 rules applied. Total rules applied 527 place count 19 transition count 28
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 16 with 1 rules applied. Total rules applied 528 place count 18 transition count 27
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 t86.t400.t14.t15 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.
Iterating post reduction 16 with 2 rules applied. Total rules applied 530 place count 15 transition count 25
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 17 with 2 rules applied. Total rules applied 532 place count 15 transition count 23
Discarding 1 places :
Symmetric choice reduction at 17 with 1 rule applications. Total rules 533 place count 14 transition count 22
Iterating global reduction 17 with 1 rules applied. Total rules applied 534 place count 14 transition count 22
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 17 with 1 rules applied. Total rules applied 535 place count 14 transition count 21
Free-agglomeration rule applied 4 times.
Iterating global reduction 18 with 4 rules applied. Total rules applied 539 place count 14 transition count 17
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 18 with 4 rules applied. Total rules applied 543 place count 10 transition count 17
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 19 with 2 rules applied. Total rules applied 545 place count 10 transition count 15
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 546 place count 10 transition count 15
Applied a total of 546 rules in 117 ms. Remains 10 /283 variables (removed 273) and now considering 15/334 (removed 319) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 130 ms. Remains : 10/283 places, 15/334 transitions.
[2024-06-02 18:04:54] [INFO ] Flow matrix only has 12 transitions (discarded 3 similar events)
// Phase 1: matrix 12 rows 10 cols
[2024-06-02 18:04:54] [INFO ] Computed 2 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1, 0, 0] Max Struct:[1, 1, 1]
FORMULA CO4-PT-06-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (2 resets) in 484 ms. (2061 steps per ms)
FORMULA CO4-PT-06-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000000 steps (2 resets) in 331 ms. (3012 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-06-02 18:04:55] [INFO ] Flow matrix only has 12 transitions (discarded 3 similar events)
[2024-06-02 18:04:55] [INFO ] Invariant cache hit.
[2024-06-02 18:04:55] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-06-02 18:04:55] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2024-06-02 18:04:55] [INFO ] Computed and/alt/rep : 7/11/7 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-02 18:04:55] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:04:55] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-02 18:04:55] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2024-06-02 18:04:55] [INFO ] Computed and/alt/rep : 7/11/7 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-02 18:04:55] [INFO ] Added : 6 causal constraints over 3 iterations in 7 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[1]
Support contains 1 out of 10 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p207) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 10/10 places, 14/14 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 0 with 2 rules applied. Total rules applied 2 place count 10 transition count 12
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 8 transition count 12
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 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 7 place count 6 transition count 11
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 7 edges and 6 vertex of which 5 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Graph (trivial) has 5 edges and 5 vertex of which 3 / 5 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 2 with 6 rules applied. Total rules applied 13 place count 3 transition count 7
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 18 place count 3 transition count 2
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 18 place count 3 transition count 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 20 place count 2 transition count 1
Applied a total of 20 rules in 6 ms. Remains 2 /10 variables (removed 8) and now considering 1/14 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 2/10 places, 1/14 transitions.
// Phase 1: matrix 1 rows 2 cols
[2024-06-02 18:04:55] [INFO ] Computed 1 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[1]
FORMULA CO4-PT-06-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (500000 resets) in 170 ms. (5847 steps per ms)
BEST_FIRST walk for 0 steps (0 resets) in 0 ms. (0 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 6798 ms.
ITS solved all properties within timeout

BK_STOP 1717351496166

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

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