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.r553-tall-171734900800053.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 ltsminxred
Input is CO4-PT-07, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r553-tall-171734900800053
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 5.7K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 73K 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.1K 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 12K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 129K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K 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 98K 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-07-UpperBounds-00
FORMULA_NAME CO4-PT-07-UpperBounds-01
FORMULA_NAME CO4-PT-07-UpperBounds-02
FORMULA_NAME CO4-PT-07-UpperBounds-03
FORMULA_NAME CO4-PT-07-UpperBounds-04
FORMULA_NAME CO4-PT-07-UpperBounds-05
FORMULA_NAME CO4-PT-07-UpperBounds-06
FORMULA_NAME CO4-PT-07-UpperBounds-07
FORMULA_NAME CO4-PT-07-UpperBounds-08
FORMULA_NAME CO4-PT-07-UpperBounds-09
FORMULA_NAME CO4-PT-07-UpperBounds-10
FORMULA_NAME CO4-PT-07-UpperBounds-11
FORMULA_NAME CO4-PT-07-UpperBounds-12
FORMULA_NAME CO4-PT-07-UpperBounds-13
FORMULA_NAME CO4-PT-07-UpperBounds-14
FORMULA_NAME CO4-PT-07-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717351397177

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CO4-PT-07
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 18:03:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-02 18:03:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:03:18] [INFO ] Load time of PNML (sax parser for PT used): 79 ms
[2024-06-02 18:03:18] [INFO ] Transformed 384 places.
[2024-06-02 18:03:18] [INFO ] Transformed 456 transitions.
[2024-06-02 18:03:18] [INFO ] Found NUPN structural information;
[2024-06-02 18:03:18] [INFO ] Parsed PT model containing 384 places and 456 transitions and 1022 arcs in 177 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Deduced a syphon composed of 100 places in 4 ms
Reduce places removed 100 places and 120 transitions.
FORMULA CO4-PT-07-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-07-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-07-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-07-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[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] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 336 rows 284 cols
[2024-06-02 18:03:18] [INFO ] Computed 6 invariants in 26 ms
Current structural bounds on expressions (after invariants) : Max Seen:[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]
RANDOM walk for 10000 steps (46 resets) in 26 ms. (370 steps per ms)
FORMULA CO4-PT-07-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-07-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-07-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-07-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-07-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 70000 steps (123 resets) in 82 ms. (843 steps per ms)
FORMULA CO4-PT-07-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
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:03:18] [INFO ] Invariant cache hit.
[2024-06-02 18:03:18] [INFO ] [Real]Absence check using 6 positive place invariants in 9 ms returned sat
[2024-06-02 18:03:19] [INFO ] [Real]Absence check using state equation in 114 ms returned sat
[2024-06-02 18:03:19] [INFO ] Computed and/alt/rep : 293/381/293 causal constraints (skipped 42 transitions) in 27 ms.
[2024-06-02 18:03:19] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:03:19] [INFO ] [Nat]Absence check using 6 positive place invariants in 14 ms returned sat
[2024-06-02 18:03:19] [INFO ] [Nat]Absence check using state equation in 80 ms returned sat
[2024-06-02 18:03:19] [INFO ] Computed and/alt/rep : 293/381/293 causal constraints (skipped 42 transitions) in 21 ms.
[2024-06-02 18:03:19] [INFO ] Added : 48 causal constraints over 10 iterations in 246 ms. Result :sat
Minimization took 80 ms.
[2024-06-02 18:03:19] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2024-06-02 18:03:19] [INFO ] [Real]Absence check using state equation in 82 ms returned sat
[2024-06-02 18:03:19] [INFO ] Computed and/alt/rep : 293/381/293 causal constraints (skipped 42 transitions) in 23 ms.
[2024-06-02 18:03:19] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:03:20] [INFO ] [Nat]Absence check using 6 positive place invariants in 6 ms returned sat
[2024-06-02 18:03:20] [INFO ] [Nat]Absence check using state equation in 71 ms returned sat
[2024-06-02 18:03:20] [INFO ] Computed and/alt/rep : 293/381/293 causal constraints (skipped 42 transitions) in 20 ms.
[2024-06-02 18:03:20] [INFO ] Added : 45 causal constraints over 9 iterations in 211 ms. Result :sat
Minimization took 76 ms.
[2024-06-02 18:03:20] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2024-06-02 18:03:20] [INFO ] [Real]Absence check using state equation in 74 ms returned sat
[2024-06-02 18:03:20] [INFO ] Computed and/alt/rep : 293/381/293 causal constraints (skipped 42 transitions) in 19 ms.
[2024-06-02 18:03:20] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:03:20] [INFO ] [Nat]Absence check using 6 positive place invariants in 6 ms returned sat
[2024-06-02 18:03:20] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2024-06-02 18:03:20] [INFO ] Computed and/alt/rep : 293/381/293 causal constraints (skipped 42 transitions) in 19 ms.
[2024-06-02 18:03:20] [INFO ] Added : 43 causal constraints over 9 iterations in 194 ms. Result :sat
Minimization took 80 ms.
[2024-06-02 18:03:21] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2024-06-02 18:03:21] [INFO ] [Real]Absence check using state equation in 82 ms returned sat
[2024-06-02 18:03:21] [INFO ] Computed and/alt/rep : 293/381/293 causal constraints (skipped 42 transitions) in 21 ms.
[2024-06-02 18:03:21] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:03:21] [INFO ] [Nat]Absence check using 6 positive place invariants in 5 ms returned sat
[2024-06-02 18:03:21] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2024-06-02 18:03:21] [INFO ] Computed and/alt/rep : 293/381/293 causal constraints (skipped 42 transitions) in 19 ms.
[2024-06-02 18:03:21] [INFO ] Added : 47 causal constraints over 10 iterations in 214 ms. Result :sat
Minimization took 75 ms.
[2024-06-02 18:03:21] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2024-06-02 18:03:21] [INFO ] [Real]Absence check using state equation in 72 ms returned sat
[2024-06-02 18:03:21] [INFO ] Computed and/alt/rep : 293/381/293 causal constraints (skipped 42 transitions) in 19 ms.
[2024-06-02 18:03:21] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:03:22] [INFO ] [Nat]Absence check using 6 positive place invariants in 6 ms returned sat
[2024-06-02 18:03:22] [INFO ] [Nat]Absence check using state equation in 75 ms returned sat
[2024-06-02 18:03:22] [INFO ] Computed and/alt/rep : 293/381/293 causal constraints (skipped 42 transitions) in 19 ms.
[2024-06-02 18:03:22] [INFO ] Added : 43 causal constraints over 9 iterations in 198 ms. Result :sat
Minimization took 74 ms.
[2024-06-02 18:03:22] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2024-06-02 18:03:22] [INFO ] [Real]Absence check using state equation in 72 ms returned sat
[2024-06-02 18:03:22] [INFO ] Computed and/alt/rep : 293/381/293 causal constraints (skipped 42 transitions) in 20 ms.
[2024-06-02 18:03:22] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:03:22] [INFO ] [Nat]Absence check using 6 positive place invariants in 5 ms returned sat
[2024-06-02 18:03:22] [INFO ] [Nat]Absence check using state equation in 71 ms returned sat
[2024-06-02 18:03:22] [INFO ] Computed and/alt/rep : 293/381/293 causal constraints (skipped 42 transitions) in 18 ms.
[2024-06-02 18:03:23] [INFO ] Added : 43 causal constraints over 9 iterations in 204 ms. Result :sat
Minimization took 75 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-07-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-07-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-07-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-07-UpperBounds-08 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 284 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 284/284 places, 336/336 transitions.
Graph (trivial) has 286 edges and 284 vertex of which 2 / 284 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 430 edges and 283 vertex of which 253 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 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 127 transitions
Trivial Post-agglo rules discarded 127 transitions
Performed 127 trivial Post agglomeration. Transition count delta: 127
Iterating post reduction 0 with 144 rules applied. Total rules applied 146 place count 253 transition count 173
Reduce places removed 127 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 1 with 132 rules applied. Total rules applied 278 place count 126 transition count 168
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 283 place count 124 transition count 165
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 286 place count 123 transition count 163
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 289 place count 122 transition count 161
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 3 rules applied. Total rules applied 292 place count 121 transition count 159
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 293 place count 120 transition count 159
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 293 place count 120 transition count 158
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 295 place count 119 transition count 158
Discarding 17 places :
Symmetric choice reduction at 7 with 17 rule applications. Total rules 312 place count 102 transition count 141
Iterating global reduction 7 with 17 rules applied. Total rules applied 329 place count 102 transition count 141
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 5 Pre rules applied. Total rules applied 329 place count 102 transition count 136
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 7 with 10 rules applied. Total rules applied 339 place count 97 transition count 136
Discarding 11 places :
Symmetric choice reduction at 7 with 11 rule applications. Total rules 350 place count 86 transition count 125
Iterating global reduction 7 with 11 rules applied. Total rules applied 361 place count 86 transition count 125
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 362 place count 86 transition count 124
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 363 place count 85 transition count 123
Iterating global reduction 8 with 1 rules applied. Total rules applied 364 place count 85 transition count 123
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 365 place count 85 transition count 122
Performed 35 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 9 with 70 rules applied. Total rules applied 435 place count 50 transition count 83
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 459 place count 38 transition count 84
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 9 with 8 rules applied. Total rules applied 467 place count 38 transition count 76
Discarding 11 places :
Symmetric choice reduction at 10 with 11 rule applications. Total rules 478 place count 27 transition count 54
Iterating global reduction 10 with 11 rules applied. Total rules applied 489 place count 27 transition count 54
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 10 with 8 rules applied. Total rules applied 497 place count 27 transition count 46
Discarding 3 places :
Symmetric choice reduction at 11 with 3 rule applications. Total rules 500 place count 24 transition count 37
Iterating global reduction 11 with 3 rules applied. Total rules applied 503 place count 24 transition count 37
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 505 place count 24 transition count 35
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 12 with 2 rules applied. Total rules applied 507 place count 23 transition count 50
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 12 with 3 rules applied. Total rules applied 510 place count 23 transition count 47
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 13 with 8 rules applied. Total rules applied 518 place count 23 transition count 39
Free-agglomeration rule applied 4 times.
Iterating global reduction 13 with 4 rules applied. Total rules applied 522 place count 23 transition count 35
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 13 with 5 rules applied. Total rules applied 527 place count 19 transition count 34
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 14 with 1 rules applied. Total rules applied 528 place count 19 transition count 34
Graph (complete) has 55 edges and 19 vertex of which 18 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 529 place count 18 transition count 34
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 530 place count 18 transition count 33
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 531 place count 18 transition count 33
Graph (complete) has 52 edges and 18 vertex of which 17 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 16 with 1 rules applied. Total rules applied 532 place count 17 transition count 33
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 17 with 1 rules applied. Total rules applied 533 place count 17 transition count 32
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 18 with 1 rules applied. Total rules applied 534 place count 17 transition count 32
Graph (complete) has 49 edges and 17 vertex of which 16 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 18 with 1 rules applied. Total rules applied 535 place count 16 transition count 32
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 19 with 1 rules applied. Total rules applied 536 place count 16 transition count 31
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 20 with 1 rules applied. Total rules applied 537 place count 15 transition count 30
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 t87.t401.t15.t16 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 20 with 2 rules applied. Total rules applied 539 place count 12 transition count 28
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 21 with 6 rules applied. Total rules applied 545 place count 12 transition count 22
Discarding 2 places :
Symmetric choice reduction at 21 with 2 rule applications. Total rules 547 place count 10 transition count 18
Iterating global reduction 21 with 2 rules applied. Total rules applied 549 place count 10 transition count 18
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 21 with 2 rules applied. Total rules applied 551 place count 10 transition count 16
Discarding 1 places :
Symmetric choice reduction at 22 with 1 rule applications. Total rules 552 place count 9 transition count 14
Iterating global reduction 22 with 1 rules applied. Total rules applied 553 place count 9 transition count 14
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 22 with 1 rules applied. Total rules applied 554 place count 9 transition count 13
Free-agglomeration rule applied 1 times.
Iterating global reduction 23 with 1 rules applied. Total rules applied 555 place count 9 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 23 with 1 rules applied. Total rules applied 556 place count 8 transition count 12
Applied a total of 556 rules in 119 ms. Remains 8 /284 variables (removed 276) and now considering 12/336 (removed 324) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 130 ms. Remains : 8/284 places, 12/336 transitions.
// Phase 1: matrix 12 rows 8 cols
[2024-06-02 18:03:23] [INFO ] Computed 2 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[1, 1]
RANDOM walk for 1000000 steps (2 resets) in 389 ms. (2564 steps per ms)
FORMULA CO4-PT-07-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-07-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000000 steps (2 resets) in 224 ms. (4444 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 5644 ms.
ITS solved all properties within timeout

BK_STOP 1717351403967

--------------------
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-07"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is CO4-PT-07, 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 r553-tall-171734900800053"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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