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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 620K
-rw-r--r-- 1 mcc users 6.9K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K 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 10K 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 8.7K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K 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 191K 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-13-UpperBounds-00
FORMULA_NAME CO4-PT-13-UpperBounds-01
FORMULA_NAME CO4-PT-13-UpperBounds-02
FORMULA_NAME CO4-PT-13-UpperBounds-03
FORMULA_NAME CO4-PT-13-UpperBounds-04
FORMULA_NAME CO4-PT-13-UpperBounds-05
FORMULA_NAME CO4-PT-13-UpperBounds-06
FORMULA_NAME CO4-PT-13-UpperBounds-07
FORMULA_NAME CO4-PT-13-UpperBounds-08
FORMULA_NAME CO4-PT-13-UpperBounds-09
FORMULA_NAME CO4-PT-13-UpperBounds-10
FORMULA_NAME CO4-PT-13-UpperBounds-11
FORMULA_NAME CO4-PT-13-UpperBounds-12
FORMULA_NAME CO4-PT-13-UpperBounds-13
FORMULA_NAME CO4-PT-13-UpperBounds-14
FORMULA_NAME CO4-PT-13-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717351723148

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-13
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 18:08:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-02 18:08:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:08:44] [INFO ] Load time of PNML (sax parser for PT used): 99 ms
[2024-06-02 18:08:44] [INFO ] Transformed 649 places.
[2024-06-02 18:08:44] [INFO ] Transformed 816 transitions.
[2024-06-02 18:08:44] [INFO ] Found NUPN structural information;
[2024-06-02 18:08:44] [INFO ] Parsed PT model containing 649 places and 816 transitions and 2232 arcs in 198 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Deduced a syphon composed of 172 places in 15 ms
Reduce places removed 172 places and 227 transitions.
FORMULA CO4-PT-13-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-13-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-13-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-13-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-13-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[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] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 589 rows 477 cols
[2024-06-02 18:08:44] [INFO ] Computed 9 invariants in 26 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (18 resets) in 30 ms. (322 steps per ms)
FORMULA CO4-PT-13-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-13-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-13-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-13-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-13-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 60003 steps (380 resets) in 66 ms. (895 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:08:44] [INFO ] Invariant cache hit.
[2024-06-02 18:08:45] [INFO ] [Real]Absence check using 8 positive place invariants in 13 ms returned sat
[2024-06-02 18:08:45] [INFO ] [Real]Absence check using 8 positive and 1 generalized place invariants in 15 ms returned sat
[2024-06-02 18:08:45] [INFO ] [Real]Absence check using state equation in 250 ms returned sat
[2024-06-02 18:08:45] [INFO ] Computed and/alt/rep : 484/755/484 causal constraints (skipped 104 transitions) in 100 ms.
[2024-06-02 18:08:45] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:08:45] [INFO ] [Nat]Absence check using 8 positive place invariants in 10 ms returned sat
[2024-06-02 18:08:45] [INFO ] [Nat]Absence check using 8 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-02 18:08:45] [INFO ] [Nat]Absence check using state equation in 143 ms returned sat
[2024-06-02 18:08:45] [INFO ] Computed and/alt/rep : 484/755/484 causal constraints (skipped 104 transitions) in 37 ms.
[2024-06-02 18:08:46] [INFO ] Added : 88 causal constraints over 18 iterations in 729 ms. Result :sat
Minimization took 322 ms.
[2024-06-02 18:08:47] [INFO ] [Real]Absence check using 8 positive place invariants in 9 ms returned sat
[2024-06-02 18:08:47] [INFO ] [Real]Absence check using 8 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-02 18:08:47] [INFO ] [Real]Absence check using state equation in 163 ms returned sat
[2024-06-02 18:08:47] [INFO ] Computed and/alt/rep : 484/755/484 causal constraints (skipped 104 transitions) in 43 ms.
[2024-06-02 18:08:47] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:08:47] [INFO ] [Nat]Absence check using 8 positive place invariants in 9 ms returned sat
[2024-06-02 18:08:47] [INFO ] [Nat]Absence check using 8 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-02 18:08:47] [INFO ] [Nat]Absence check using state equation in 138 ms returned sat
[2024-06-02 18:08:47] [INFO ] Computed and/alt/rep : 484/755/484 causal constraints (skipped 104 transitions) in 39 ms.
[2024-06-02 18:08:48] [INFO ] Added : 103 causal constraints over 21 iterations in 783 ms. Result :sat
Minimization took 277 ms.
[2024-06-02 18:08:48] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2024-06-02 18:08:48] [INFO ] [Real]Absence check using 8 positive and 1 generalized place invariants in 4 ms returned sat
[2024-06-02 18:08:49] [INFO ] [Real]Absence check using state equation in 129 ms returned sat
[2024-06-02 18:08:49] [INFO ] Deduced a trap composed of 21 places in 195 ms of which 34 ms to minimize.
[2024-06-02 18:08:49] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:08:49] [INFO ] [Nat]Absence check using 8 positive place invariants in 9 ms returned sat
[2024-06-02 18:08:49] [INFO ] [Nat]Absence check using 8 positive and 1 generalized place invariants in 3 ms returned sat
[2024-06-02 18:08:49] [INFO ] [Nat]Absence check using state equation in 138 ms returned sat
[2024-06-02 18:08:49] [INFO ] Deduced a trap composed of 21 places in 146 ms of which 4 ms to minimize.
[2024-06-02 18:08:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 184 ms
[2024-06-02 18:08:49] [INFO ] Computed and/alt/rep : 484/755/484 causal constraints (skipped 104 transitions) in 39 ms.
[2024-06-02 18:08:50] [INFO ] Added : 108 causal constraints over 22 iterations in 766 ms. Result :sat
Minimization took 230 ms.
[2024-06-02 18:08:50] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2024-06-02 18:08:50] [INFO ] [Real]Absence check using 8 positive and 1 generalized place invariants in 2 ms returned sat
[2024-06-02 18:08:51] [INFO ] [Real]Absence check using state equation in 138 ms returned sat
[2024-06-02 18:08:51] [INFO ] Computed and/alt/rep : 484/755/484 causal constraints (skipped 104 transitions) in 33 ms.
[2024-06-02 18:08:51] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:08:51] [INFO ] [Nat]Absence check using 8 positive place invariants in 11 ms returned sat
[2024-06-02 18:08:51] [INFO ] [Nat]Absence check using 8 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-02 18:08:51] [INFO ] [Nat]Absence check using state equation in 130 ms returned sat
[2024-06-02 18:08:51] [INFO ] Computed and/alt/rep : 484/755/484 causal constraints (skipped 104 transitions) in 30 ms.
[2024-06-02 18:08:52] [INFO ] Added : 99 causal constraints over 20 iterations in 661 ms. Result :sat
Minimization took 223 ms.
[2024-06-02 18:08:52] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2024-06-02 18:08:52] [INFO ] [Real]Absence check using 8 positive and 1 generalized place invariants in 0 ms returned sat
[2024-06-02 18:08:52] [INFO ] [Real]Absence check using state equation in 129 ms returned sat
[2024-06-02 18:08:52] [INFO ] Deduced a trap composed of 21 places in 99 ms of which 2 ms to minimize.
[2024-06-02 18:08:52] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:08:52] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2024-06-02 18:08:52] [INFO ] [Nat]Absence check using 8 positive and 1 generalized place invariants in 0 ms returned sat
[2024-06-02 18:08:52] [INFO ] [Nat]Absence check using state equation in 128 ms returned sat
[2024-06-02 18:08:53] [INFO ] Deduced a trap composed of 21 places in 86 ms of which 3 ms to minimize.
[2024-06-02 18:08:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 128 ms
[2024-06-02 18:08:53] [INFO ] Computed and/alt/rep : 484/755/484 causal constraints (skipped 104 transitions) in 31 ms.
[2024-06-02 18:08:54] [INFO ] Deduced a trap composed of 17 places in 130 ms of which 3 ms to minimize.
[2024-06-02 18:08:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 188 ms
[2024-06-02 18:08:54] [INFO ] Added : 145 causal constraints over 30 iterations in 1206 ms. Result :sat
Minimization took 350 ms.
[2024-06-02 18:08:54] [INFO ] [Real]Absence check using 8 positive place invariants in 9 ms returned sat
[2024-06-02 18:08:54] [INFO ] [Real]Absence check using 8 positive and 1 generalized place invariants in 2 ms returned sat
[2024-06-02 18:08:54] [INFO ] [Real]Absence check using state equation in 129 ms returned sat
[2024-06-02 18:08:55] [INFO ] Deduced a trap composed of 21 places in 111 ms of which 3 ms to minimize.
[2024-06-02 18:08:55] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:08:55] [INFO ] [Nat]Absence check using 8 positive place invariants in 13 ms returned sat
[2024-06-02 18:08:55] [INFO ] [Nat]Absence check using 8 positive and 1 generalized place invariants in 0 ms returned sat
[2024-06-02 18:08:55] [INFO ] [Nat]Absence check using state equation in 130 ms returned sat
[2024-06-02 18:08:55] [INFO ] Deduced a trap composed of 21 places in 94 ms of which 2 ms to minimize.
[2024-06-02 18:08:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 134 ms
[2024-06-02 18:08:55] [INFO ] Computed and/alt/rep : 484/755/484 causal constraints (skipped 104 transitions) in 38 ms.
[2024-06-02 18:08:55] [INFO ] Added : 79 causal constraints over 16 iterations in 546 ms. Result :sat
Minimization took 220 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-13-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-13-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-13-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-13-UpperBounds-01 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 477 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 477/477 places, 589/589 transitions.
Graph (trivial) has 480 edges and 477 vertex of which 3 / 477 are part of one of the 1 SCC in 4 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (complete) has 874 edges and 475 vertex of which 434 are kept as prefixes of interest. Removing 41 places using SCC suffix rule.2 ms
Discarding 41 places :
Also discarding 20 output transitions
Drop transitions (Output transitions of discarded places.) removed 20 transitions
Drop transitions (Empty/Sink Transition effects.) removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 272 transitions
Trivial Post-agglo rules discarded 272 transitions
Performed 272 trivial Post agglomeration. Transition count delta: 272
Iterating post reduction 0 with 297 rules applied. Total rules applied 299 place count 434 transition count 269
Reduce places removed 272 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 290 rules applied. Total rules applied 589 place count 162 transition count 251
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 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 2 with 20 rules applied. Total rules applied 609 place count 154 transition count 239
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 3 with 8 rules applied. Total rules applied 617 place count 150 transition count 235
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 4 rules applied. Total rules applied 621 place count 148 transition count 233
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 623 place count 147 transition count 232
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 623 place count 147 transition count 231
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 625 place count 146 transition count 231
Discarding 26 places :
Symmetric choice reduction at 6 with 26 rule applications. Total rules 651 place count 120 transition count 205
Iterating global reduction 6 with 26 rules applied. Total rules applied 677 place count 120 transition count 205
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 6 Pre rules applied. Total rules applied 677 place count 120 transition count 199
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 6 with 12 rules applied. Total rules applied 689 place count 114 transition count 199
Discarding 16 places :
Symmetric choice reduction at 6 with 16 rule applications. Total rules 705 place count 98 transition count 159
Iterating global reduction 6 with 16 rules applied. Total rules applied 721 place count 98 transition count 159
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 723 place count 98 transition count 157
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 725 place count 96 transition count 155
Iterating global reduction 7 with 2 rules applied. Total rules applied 727 place count 96 transition count 155
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 729 place count 96 transition count 153
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 8 with 70 rules applied. Total rules applied 799 place count 61 transition count 114
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 801 place count 61 transition count 112
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 9 with 32 rules applied. Total rules applied 833 place count 45 transition count 133
Drop transitions (Empty/Sink Transition effects.) removed 15 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 9 with 23 rules applied. Total rules applied 856 place count 45 transition count 110
Discarding 11 places :
Symmetric choice reduction at 10 with 11 rule applications. Total rules 867 place count 34 transition count 77
Iterating global reduction 10 with 11 rules applied. Total rules applied 878 place count 34 transition count 77
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 10 with 8 rules applied. Total rules applied 886 place count 34 transition count 69
Discarding 2 places :
Symmetric choice reduction at 11 with 2 rule applications. Total rules 888 place count 32 transition count 59
Iterating global reduction 11 with 2 rules applied. Total rules applied 890 place count 32 transition count 59
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 892 place count 32 transition count 57
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
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 894 place count 31 transition count 70
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 897 place count 31 transition count 67
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 13 with 12 rules applied. Total rules applied 909 place count 31 transition count 55
Free-agglomeration rule applied 7 times.
Iterating global reduction 13 with 7 rules applied. Total rules applied 916 place count 31 transition count 48
Reduce places removed 7 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 13 with 8 rules applied. Total rules applied 924 place count 24 transition count 47
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 14 with 1 rules applied. Total rules applied 925 place count 23 transition count 46
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 14 with 2 rules applied. Total rules applied 927 place count 21 transition count 46
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 15 with 1 rules applied. Total rules applied 928 place count 21 transition count 45
Discarding 1 places :
Symmetric choice reduction at 15 with 1 rule applications. Total rules 929 place count 20 transition count 42
Iterating global reduction 15 with 1 rules applied. Total rules applied 930 place count 20 transition count 42
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 15 with 1 rules applied. Total rules applied 931 place count 20 transition count 41
Free-agglomeration rule applied 2 times.
Iterating global reduction 16 with 2 rules applied. Total rules applied 933 place count 20 transition count 39
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 16 with 2 rules applied. Total rules applied 935 place count 18 transition count 39
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 937 place count 18 transition count 37
Applied a total of 937 rules in 152 ms. Remains 18 /477 variables (removed 459) and now considering 37/589 (removed 552) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 172 ms. Remains : 18/477 places, 37/589 transitions.
[2024-06-02 18:08:56] [INFO ] Flow matrix only has 29 transitions (discarded 8 similar events)
// Phase 1: matrix 29 rows 18 cols
[2024-06-02 18:08:56] [INFO ] Computed 5 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 803 ms. (1243 steps per ms)
FORMULA CO4-PT-13-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-13-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (2 resets) in 369 ms. (2702 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 13448 ms.
ITS solved all properties within timeout

BK_STOP 1717351737813

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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-13"
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-13, 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-171734900900101"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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