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

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

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

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

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME CO4-PT-16-UpperBounds-00
FORMULA_NAME CO4-PT-16-UpperBounds-01
FORMULA_NAME CO4-PT-16-UpperBounds-02
FORMULA_NAME CO4-PT-16-UpperBounds-03
FORMULA_NAME CO4-PT-16-UpperBounds-04
FORMULA_NAME CO4-PT-16-UpperBounds-05
FORMULA_NAME CO4-PT-16-UpperBounds-06
FORMULA_NAME CO4-PT-16-UpperBounds-07
FORMULA_NAME CO4-PT-16-UpperBounds-08
FORMULA_NAME CO4-PT-16-UpperBounds-09
FORMULA_NAME CO4-PT-16-UpperBounds-10
FORMULA_NAME CO4-PT-16-UpperBounds-11
FORMULA_NAME CO4-PT-16-UpperBounds-12
FORMULA_NAME CO4-PT-16-UpperBounds-13
FORMULA_NAME CO4-PT-16-UpperBounds-14
FORMULA_NAME CO4-PT-16-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717351909205

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-16
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 18:11:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-02 18:11:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:11:50] [INFO ] Load time of PNML (sax parser for PT used): 111 ms
[2024-06-02 18:11:50] [INFO ] Transformed 837 places.
[2024-06-02 18:11:50] [INFO ] Transformed 1122 transitions.
[2024-06-02 18:11:50] [INFO ] Found NUPN structural information;
[2024-06-02 18:11:50] [INFO ] Parsed PT model containing 837 places and 1122 transitions and 3052 arcs in 225 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 9 ms.
Deduced a syphon composed of 116 places in 9 ms
Reduce places removed 116 places and 180 transitions.
FORMULA CO4-PT-16-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 942 rows 721 cols
[2024-06-02 18:11:50] [INFO ] Computed 12 invariants in 44 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (227 resets) in 66 ms. (149 steps per ms)
FORMULA CO4-PT-16-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-16-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-16-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-16-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-16-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-16-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 90004 steps (334 resets) in 87 ms. (1022 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-02 18:11:50] [INFO ] Invariant cache hit.
[2024-06-02 18:11:51] [INFO ] [Real]Absence check using 11 positive place invariants in 21 ms returned sat
[2024-06-02 18:11:51] [INFO ] [Real]Absence check using 11 positive and 1 generalized place invariants in 10 ms returned sat
[2024-06-02 18:11:51] [INFO ] [Real]Absence check using state equation in 261 ms returned sat
[2024-06-02 18:11:51] [INFO ] Deduced a trap composed of 61 places in 386 ms of which 53 ms to minimize.
[2024-06-02 18:11:52] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:11:52] [INFO ] [Nat]Absence check using 11 positive place invariants in 14 ms returned sat
[2024-06-02 18:11:52] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 0 ms returned sat
[2024-06-02 18:11:52] [INFO ] [Nat]Absence check using state equation in 209 ms returned sat
[2024-06-02 18:11:52] [INFO ] Deduced a trap composed of 61 places in 285 ms of which 6 ms to minimize.
[2024-06-02 18:11:53] [INFO ] Deduced a trap composed of 335 places in 178 ms of which 7 ms to minimize.
[2024-06-02 18:11:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 588 ms
[2024-06-02 18:11:53] [INFO ] Computed and/alt/rep : 741/1099/741 causal constraints (skipped 200 transitions) in 77 ms.
[2024-06-02 18:11:54] [INFO ] Deduced a trap composed of 19 places in 114 ms of which 2 ms to minimize.
[2024-06-02 18:11:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 206 ms
[2024-06-02 18:11:54] [INFO ] Added : 113 causal constraints over 23 iterations in 1450 ms. Result :sat
Minimization took 379 ms.
[2024-06-02 18:11:55] [INFO ] [Real]Absence check using 11 positive place invariants in 12 ms returned sat
[2024-06-02 18:11:55] [INFO ] [Real]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-02 18:11:55] [INFO ] [Real]Absence check using state equation in 223 ms returned sat
[2024-06-02 18:11:55] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:11:55] [INFO ] [Nat]Absence check using 11 positive place invariants in 14 ms returned sat
[2024-06-02 18:11:55] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-02 18:11:55] [INFO ] [Nat]Absence check using state equation in 201 ms returned sat
[2024-06-02 18:11:55] [INFO ] Deduced a trap composed of 61 places in 209 ms of which 4 ms to minimize.
[2024-06-02 18:11:56] [INFO ] Deduced a trap composed of 335 places in 201 ms of which 4 ms to minimize.
[2024-06-02 18:11:56] [INFO ] Deduced a trap composed of 49 places in 204 ms of which 4 ms to minimize.
[2024-06-02 18:11:56] [INFO ] Deduced a trap composed of 411 places in 195 ms of which 4 ms to minimize.
[2024-06-02 18:11:56] [INFO ] Deduced a trap composed of 212 places in 168 ms of which 15 ms to minimize.
[2024-06-02 18:11:56] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1173 ms
[2024-06-02 18:11:56] [INFO ] Computed and/alt/rep : 741/1099/741 causal constraints (skipped 200 transitions) in 53 ms.
[2024-06-02 18:11:58] [INFO ] Added : 125 causal constraints over 25 iterations in 1210 ms. Result :sat
Minimization took 372 ms.
[2024-06-02 18:11:58] [INFO ] [Real]Absence check using 11 positive place invariants in 13 ms returned sat
[2024-06-02 18:11:58] [INFO ] [Real]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-02 18:11:58] [INFO ] [Real]Absence check using state equation in 203 ms returned sat
[2024-06-02 18:11:58] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:11:58] [INFO ] [Nat]Absence check using 11 positive place invariants in 13 ms returned sat
[2024-06-02 18:11:58] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-02 18:11:59] [INFO ] [Nat]Absence check using state equation in 209 ms returned sat
[2024-06-02 18:11:59] [INFO ] Deduced a trap composed of 68 places in 210 ms of which 4 ms to minimize.
[2024-06-02 18:11:59] [INFO ] Deduced a trap composed of 49 places in 214 ms of which 4 ms to minimize.
[2024-06-02 18:11:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 513 ms
[2024-06-02 18:11:59] [INFO ] Computed and/alt/rep : 741/1099/741 causal constraints (skipped 200 transitions) in 57 ms.
[2024-06-02 18:12:01] [INFO ] Deduced a trap composed of 210 places in 188 ms of which 4 ms to minimize.
[2024-06-02 18:12:01] [INFO ] Deduced a trap composed of 222 places in 197 ms of which 4 ms to minimize.
[2024-06-02 18:12:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 515 ms
[2024-06-02 18:12:01] [INFO ] Added : 118 causal constraints over 24 iterations in 1732 ms. Result :sat
Minimization took 371 ms.
[2024-06-02 18:12:01] [INFO ] [Real]Absence check using 11 positive place invariants in 12 ms returned sat
[2024-06-02 18:12:01] [INFO ] [Real]Absence check using 11 positive and 1 generalized place invariants in 0 ms returned sat
[2024-06-02 18:12:02] [INFO ] [Real]Absence check using state equation in 205 ms returned sat
[2024-06-02 18:12:02] [INFO ] Deduced a trap composed of 63 places in 125 ms of which 3 ms to minimize.
[2024-06-02 18:12:02] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:12:02] [INFO ] [Nat]Absence check using 11 positive place invariants in 14 ms returned sat
[2024-06-02 18:12:02] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-02 18:12:02] [INFO ] [Nat]Absence check using state equation in 214 ms returned sat
[2024-06-02 18:12:02] [INFO ] Deduced a trap composed of 63 places in 142 ms of which 3 ms to minimize.
[2024-06-02 18:12:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 202 ms
[2024-06-02 18:12:02] [INFO ] Computed and/alt/rep : 741/1099/741 causal constraints (skipped 200 transitions) in 48 ms.
[2024-06-02 18:12:03] [INFO ] Added : 58 causal constraints over 12 iterations in 624 ms. Result :sat
Minimization took 342 ms.
[2024-06-02 18:12:04] [INFO ] [Real]Absence check using 11 positive place invariants in 15 ms returned sat
[2024-06-02 18:12:04] [INFO ] [Real]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-02 18:12:04] [INFO ] [Real]Absence check using state equation in 195 ms returned sat
[2024-06-02 18:12:04] [INFO ] Deduced a trap composed of 49 places in 129 ms of which 3 ms to minimize.
[2024-06-02 18:12:04] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:12:04] [INFO ] [Nat]Absence check using 11 positive place invariants in 14 ms returned sat
[2024-06-02 18:12:04] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-02 18:12:04] [INFO ] [Nat]Absence check using state equation in 210 ms returned sat
[2024-06-02 18:12:04] [INFO ] Deduced a trap composed of 49 places in 127 ms of which 3 ms to minimize.
[2024-06-02 18:12:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 182 ms
[2024-06-02 18:12:04] [INFO ] Computed and/alt/rep : 741/1099/741 causal constraints (skipped 200 transitions) in 45 ms.
[2024-06-02 18:12:05] [INFO ] Added : 72 causal constraints over 15 iterations in 758 ms. Result :sat
Minimization took 354 ms.
[2024-06-02 18:12:06] [INFO ] [Real]Absence check using 11 positive place invariants in 16 ms returned sat
[2024-06-02 18:12:06] [INFO ] [Real]Absence check using 11 positive and 1 generalized place invariants in 0 ms returned sat
[2024-06-02 18:12:06] [INFO ] [Real]Absence check using state equation in 211 ms returned sat
[2024-06-02 18:12:06] [INFO ] Deduced a trap composed of 55 places in 179 ms of which 3 ms to minimize.
[2024-06-02 18:12:06] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:12:06] [INFO ] [Nat]Absence check using 11 positive place invariants in 13 ms returned sat
[2024-06-02 18:12:06] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 0 ms returned sat
[2024-06-02 18:12:07] [INFO ] [Nat]Absence check using state equation in 235 ms returned sat
[2024-06-02 18:12:07] [INFO ] Deduced a trap composed of 55 places in 185 ms of which 4 ms to minimize.
[2024-06-02 18:12:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 241 ms
[2024-06-02 18:12:07] [INFO ] Computed and/alt/rep : 741/1099/741 causal constraints (skipped 200 transitions) in 45 ms.
[2024-06-02 18:12:08] [INFO ] Added : 85 causal constraints over 17 iterations in 806 ms. Result :sat
Minimization took 354 ms.
[2024-06-02 18:12:08] [INFO ] [Real]Absence check using 11 positive place invariants in 12 ms returned sat
[2024-06-02 18:12:08] [INFO ] [Real]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-02 18:12:08] [INFO ] [Real]Absence check using state equation in 210 ms returned sat
[2024-06-02 18:12:08] [INFO ] Computed and/alt/rep : 741/1099/741 causal constraints (skipped 200 transitions) in 48 ms.
[2024-06-02 18:12:09] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:12:09] [INFO ] [Nat]Absence check using 11 positive place invariants in 13 ms returned sat
[2024-06-02 18:12:09] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-02 18:12:09] [INFO ] [Nat]Absence check using state equation in 208 ms returned sat
[2024-06-02 18:12:09] [INFO ] Computed and/alt/rep : 741/1099/741 causal constraints (skipped 200 transitions) in 44 ms.
[2024-06-02 18:12:10] [INFO ] Deduced a trap composed of 20 places in 145 ms of which 2 ms to minimize.
[2024-06-02 18:12:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 219 ms
[2024-06-02 18:12:11] [INFO ] Added : 149 causal constraints over 31 iterations in 1661 ms. Result :sat
Minimization took 372 ms.
[2024-06-02 18:12:11] [INFO ] [Real]Absence check using 11 positive place invariants in 12 ms returned sat
[2024-06-02 18:12:11] [INFO ] [Real]Absence check using 11 positive and 1 generalized place invariants in 0 ms returned sat
[2024-06-02 18:12:11] [INFO ] [Real]Absence check using state equation in 210 ms returned sat
[2024-06-02 18:12:11] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:12:11] [INFO ] [Nat]Absence check using 11 positive place invariants in 13 ms returned sat
[2024-06-02 18:12:11] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-02 18:12:12] [INFO ] [Nat]Absence check using state equation in 226 ms returned sat
[2024-06-02 18:12:12] [INFO ] Deduced a trap composed of 55 places in 183 ms of which 4 ms to minimize.
[2024-06-02 18:12:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 248 ms
[2024-06-02 18:12:12] [INFO ] Computed and/alt/rep : 741/1099/741 causal constraints (skipped 200 transitions) in 46 ms.
[2024-06-02 18:12:13] [INFO ] Added : 93 causal constraints over 19 iterations in 893 ms. Result :sat
Minimization took 362 ms.
[2024-06-02 18:12:13] [INFO ] [Real]Absence check using 11 positive place invariants in 12 ms returned sat
[2024-06-02 18:12:13] [INFO ] [Real]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-02 18:12:14] [INFO ] [Real]Absence check using state equation in 210 ms returned sat
[2024-06-02 18:12:14] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:12:14] [INFO ] [Nat]Absence check using 11 positive place invariants in 14 ms returned sat
[2024-06-02 18:12:14] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-02 18:12:14] [INFO ] [Nat]Absence check using state equation in 214 ms returned sat
[2024-06-02 18:12:14] [INFO ] Computed and/alt/rep : 741/1099/741 causal constraints (skipped 200 transitions) in 49 ms.
[2024-06-02 18:12:15] [INFO ] Added : 81 causal constraints over 17 iterations in 821 ms. Result :sat
Minimization took 347 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1]
FORMULA CO4-PT-16-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-16-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-16-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-16-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-16-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-16-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-16-UpperBounds-02 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 721 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 721/721 places, 942/942 transitions.
Graph (trivial) has 747 edges and 721 vertex of which 2 / 721 are part of one of the 1 SCC in 4 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 1392 edges and 720 vertex of which 675 are kept as prefixes of interest. Removing 45 places using SCC suffix rule.2 ms
Discarding 45 places :
Also discarding 20 output transitions
Drop transitions (Output transitions of discarded places.) removed 20 transitions
Drop transitions (Empty/Sink Transition effects.) removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 357 transitions
Trivial Post-agglo rules discarded 357 transitions
Performed 357 trivial Post agglomeration. Transition count delta: 357
Iterating post reduction 0 with 388 rules applied. Total rules applied 390 place count 675 transition count 532
Reduce places removed 357 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 1 with 386 rules applied. Total rules applied 776 place count 318 transition count 503
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 29 rules applied. Total rules applied 805 place count 305 transition count 487
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 9 rules applied. Total rules applied 814 place count 302 transition count 481
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 4 with 9 rules applied. Total rules applied 823 place count 299 transition count 475
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 829 place count 296 transition count 472
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 829 place count 296 transition count 471
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 831 place count 295 transition count 471
Discarding 49 places :
Symmetric choice reduction at 6 with 49 rule applications. Total rules 880 place count 246 transition count 422
Iterating global reduction 6 with 49 rules applied. Total rules applied 929 place count 246 transition count 422
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 14 Pre rules applied. Total rules applied 929 place count 246 transition count 408
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 6 with 28 rules applied. Total rules applied 957 place count 232 transition count 408
Discarding 31 places :
Symmetric choice reduction at 6 with 31 rule applications. Total rules 988 place count 201 transition count 353
Iterating global reduction 6 with 31 rules applied. Total rules applied 1019 place count 201 transition count 353
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 7 rules applied. Total rules applied 1026 place count 201 transition count 346
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1027 place count 200 transition count 346
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 1031 place count 196 transition count 341
Iterating global reduction 8 with 4 rules applied. Total rules applied 1035 place count 196 transition count 341
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 1039 place count 196 transition count 337
Performed 74 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 74 places in 0 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 9 with 148 rules applied. Total rules applied 1187 place count 122 transition count 253
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 1191 place count 122 transition count 249
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: -42
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 10 with 78 rules applied. Total rules applied 1269 place count 83 transition count 291
Drop transitions (Empty/Sink Transition effects.) removed 58 transitions
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 78 transitions.
Iterating post reduction 10 with 78 rules applied. Total rules applied 1347 place count 83 transition count 213
Discarding 28 places :
Symmetric choice reduction at 11 with 28 rule applications. Total rules 1375 place count 55 transition count 146
Iterating global reduction 11 with 28 rules applied. Total rules applied 1403 place count 55 transition count 146
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 11 with 20 rules applied. Total rules applied 1423 place count 55 transition count 126
Discarding 6 places :
Symmetric choice reduction at 12 with 6 rule applications. Total rules 1429 place count 49 transition count 101
Iterating global reduction 12 with 6 rules applied. Total rules applied 1435 place count 49 transition count 101
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 12 with 4 rules applied. Total rules applied 1439 place count 49 transition count 97
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 1441 place count 48 transition count 112
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 1444 place count 48 transition count 109
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 14 with 12 rules applied. Total rules applied 1456 place count 48 transition count 97
Discarding 1 places :
Symmetric choice reduction at 14 with 1 rule applications. Total rules 1457 place count 47 transition count 95
Iterating global reduction 14 with 1 rules applied. Total rules applied 1458 place count 47 transition count 95
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 1459 place count 47 transition count 94
Free-agglomeration rule applied 11 times.
Iterating global reduction 15 with 11 rules applied. Total rules applied 1470 place count 47 transition count 83
Reduce places removed 11 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 15 with 13 rules applied. Total rules applied 1483 place count 36 transition count 81
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 1484 place count 36 transition count 81
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 16 with 1 rules applied. Total rules applied 1485 place count 35 transition count 80
Reduce places removed 3 places and 0 transitions.
Graph (trivial) has 18 edges and 32 vertex of which 5 / 32 are part of one of the 2 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 16 with 4 rules applied. Total rules applied 1489 place count 29 transition count 80
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (trivial) has 20 edges and 28 vertex of which 6 / 28 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Iterating post reduction 17 with 10 rules applied. Total rules applied 1499 place count 23 transition count 72
Drop transitions (Empty/Sink Transition effects.) removed 15 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 18 with 23 rules applied. Total rules applied 1522 place count 23 transition count 49
Discarding 1 places :
Symmetric choice reduction at 19 with 1 rule applications. Total rules 1523 place count 22 transition count 47
Iterating global reduction 19 with 1 rules applied. Total rules applied 1524 place count 22 transition count 47
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 19 with 1 rules applied. Total rules applied 1525 place count 22 transition count 46
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 20 with 3 rules applied. Total rules applied 1528 place count 22 transition count 43
Free-agglomeration rule applied 2 times.
Iterating global reduction 20 with 2 rules applied. Total rules applied 1530 place count 22 transition count 41
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 20 with 2 rules applied. Total rules applied 1532 place count 20 transition count 41
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 21 with 4 rules applied. Total rules applied 1536 place count 20 transition count 37
Free-agglomeration rule applied 1 times.
Iterating global reduction 21 with 1 rules applied. Total rules applied 1537 place count 20 transition count 36
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 21 with 1 rules applied. Total rules applied 1538 place count 19 transition count 36
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 22 with 2 rules applied. Total rules applied 1540 place count 19 transition count 34
Free-agglomeration rule applied 1 times.
Iterating global reduction 22 with 1 rules applied. Total rules applied 1541 place count 19 transition count 33
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 22 with 3 rules applied. Total rules applied 1544 place count 18 transition count 31
Applied a total of 1544 rules in 194 ms. Remains 18 /721 variables (removed 703) and now considering 31/942 (removed 911) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 202 ms. Remains : 18/721 places, 31/942 transitions.
[2024-06-02 18:12:16] [INFO ] Flow matrix only has 27 transitions (discarded 4 similar events)
// Phase 1: matrix 27 rows 18 cols
[2024-06-02 18:12:16] [INFO ] Computed 6 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 798 ms. (1251 steps per ms)
FORMULA CO4-PT-16-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-16-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000000 steps (2 resets) in 281 ms. (3546 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 26892 ms.
ITS solved all properties within timeout

BK_STOP 1717351937243

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CO4-PT-16"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="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-16, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r553-tall-171734901000125"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CO4-PT-16.tgz
mv CO4-PT-16 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;