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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 712K
-rw-r--r-- 1 mcc users 7.2K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K 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 52K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K 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 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 9.3K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 96K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 32K 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 336K 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-20-UpperBounds-00
FORMULA_NAME CO4-PT-20-UpperBounds-01
FORMULA_NAME CO4-PT-20-UpperBounds-02
FORMULA_NAME CO4-PT-20-UpperBounds-03
FORMULA_NAME CO4-PT-20-UpperBounds-04
FORMULA_NAME CO4-PT-20-UpperBounds-05
FORMULA_NAME CO4-PT-20-UpperBounds-06
FORMULA_NAME CO4-PT-20-UpperBounds-07
FORMULA_NAME CO4-PT-20-UpperBounds-08
FORMULA_NAME CO4-PT-20-UpperBounds-09
FORMULA_NAME CO4-PT-20-UpperBounds-10
FORMULA_NAME CO4-PT-20-UpperBounds-11
FORMULA_NAME CO4-PT-20-UpperBounds-12
FORMULA_NAME CO4-PT-20-UpperBounds-13
FORMULA_NAME CO4-PT-20-UpperBounds-14
FORMULA_NAME CO4-PT-20-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717352972061

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-20
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 18:29:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-02 18:29:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:29:33] [INFO ] Load time of PNML (sax parser for PT used): 127 ms
[2024-06-02 18:29:33] [INFO ] Transformed 1178 places.
[2024-06-02 18:29:33] [INFO ] Transformed 1463 transitions.
[2024-06-02 18:29:33] [INFO ] Found NUPN structural information;
[2024-06-02 18:29:33] [INFO ] Parsed PT model containing 1178 places and 1463 transitions and 3734 arcs in 244 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Deduced a syphon composed of 187 places in 16 ms
Reduce places removed 187 places and 251 transitions.
FORMULA CO4-PT-20-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-20-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-20-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] Max Struct:[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] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 1212 rows 991 cols
[2024-06-02 18:29:33] [INFO ] Computed 12 invariants in 48 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (201 resets) in 42 ms. (232 steps per ms)
FORMULA CO4-PT-20-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-20-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-20-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 100008 steps (346 resets) in 110 ms. (900 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-02 18:29:33] [INFO ] Invariant cache hit.
[2024-06-02 18:29:34] [INFO ] [Real]Absence check using 10 positive place invariants in 19 ms returned sat
[2024-06-02 18:29:34] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 4 ms returned sat
[2024-06-02 18:29:34] [INFO ] [Real]Absence check using state equation in 351 ms returned sat
[2024-06-02 18:29:34] [INFO ] Computed and/alt/rep : 1011/1378/1011 causal constraints (skipped 200 transitions) in 101 ms.
[2024-06-02 18:29:34] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:29:35] [INFO ] [Nat]Absence check using 10 positive place invariants in 18 ms returned sat
[2024-06-02 18:29:35] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 3 ms returned sat
[2024-06-02 18:29:35] [INFO ] [Nat]Absence check using state equation in 342 ms returned sat
[2024-06-02 18:29:35] [INFO ] Computed and/alt/rep : 1011/1378/1011 causal constraints (skipped 200 transitions) in 70 ms.
[2024-06-02 18:29:37] [INFO ] Added : 128 causal constraints over 26 iterations in 1627 ms. Result :sat
Minimization took 714 ms.
[2024-06-02 18:29:38] [INFO ] [Real]Absence check using 10 positive place invariants in 18 ms returned sat
[2024-06-02 18:29:38] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2024-06-02 18:29:38] [INFO ] [Real]Absence check using state equation in 330 ms returned sat
[2024-06-02 18:29:38] [INFO ] Computed and/alt/rep : 1011/1378/1011 causal constraints (skipped 200 transitions) in 79 ms.
[2024-06-02 18:29:38] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:29:38] [INFO ] [Nat]Absence check using 10 positive place invariants in 20 ms returned sat
[2024-06-02 18:29:38] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 2 ms returned sat
[2024-06-02 18:29:39] [INFO ] [Nat]Absence check using state equation in 303 ms returned sat
[2024-06-02 18:29:39] [INFO ] Computed and/alt/rep : 1011/1378/1011 causal constraints (skipped 200 transitions) in 64 ms.
[2024-06-02 18:29:41] [INFO ] Deduced a trap composed of 23 places in 254 ms of which 39 ms to minimize.
[2024-06-02 18:29:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 367 ms
[2024-06-02 18:29:41] [INFO ] Added : 177 causal constraints over 36 iterations in 2492 ms. Result :sat
Minimization took 829 ms.
[2024-06-02 18:29:42] [INFO ] [Real]Absence check using 10 positive place invariants in 16 ms returned sat
[2024-06-02 18:29:42] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2024-06-02 18:29:43] [INFO ] [Real]Absence check using state equation in 308 ms returned sat
[2024-06-02 18:29:43] [INFO ] Computed and/alt/rep : 1011/1378/1011 causal constraints (skipped 200 transitions) in 60 ms.
[2024-06-02 18:29:43] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:29:43] [INFO ] [Nat]Absence check using 10 positive place invariants in 22 ms returned sat
[2024-06-02 18:29:43] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 2 ms returned sat
[2024-06-02 18:29:43] [INFO ] [Nat]Absence check using state equation in 328 ms returned sat
[2024-06-02 18:29:43] [INFO ] Computed and/alt/rep : 1011/1378/1011 causal constraints (skipped 200 transitions) in 63 ms.
[2024-06-02 18:29:45] [INFO ] Added : 122 causal constraints over 25 iterations in 1586 ms. Result :sat
Minimization took 706 ms.
[2024-06-02 18:29:46] [INFO ] [Real]Absence check using 10 positive place invariants in 18 ms returned sat
[2024-06-02 18:29:46] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2024-06-02 18:29:46] [INFO ] [Real]Absence check using state equation in 293 ms returned sat
[2024-06-02 18:29:46] [INFO ] Computed and/alt/rep : 1011/1378/1011 causal constraints (skipped 200 transitions) in 57 ms.
[2024-06-02 18:29:46] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:29:47] [INFO ] [Nat]Absence check using 10 positive place invariants in 22 ms returned sat
[2024-06-02 18:29:47] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2024-06-02 18:29:47] [INFO ] [Nat]Absence check using state equation in 302 ms returned sat
[2024-06-02 18:29:47] [INFO ] Computed and/alt/rep : 1011/1378/1011 causal constraints (skipped 200 transitions) in 59 ms.
[2024-06-02 18:29:48] [INFO ] Added : 124 causal constraints over 25 iterations in 1509 ms. Result :sat
Minimization took 683 ms.
[2024-06-02 18:29:49] [INFO ] [Real]Absence check using 10 positive place invariants in 24 ms returned sat
[2024-06-02 18:29:49] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2024-06-02 18:29:50] [INFO ] [Real]Absence check using state equation in 305 ms returned sat
[2024-06-02 18:29:50] [INFO ] Computed and/alt/rep : 1011/1378/1011 causal constraints (skipped 200 transitions) in 54 ms.
[2024-06-02 18:29:50] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:29:50] [INFO ] [Nat]Absence check using 10 positive place invariants in 18 ms returned sat
[2024-06-02 18:29:50] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 2 ms returned sat
[2024-06-02 18:29:50] [INFO ] [Nat]Absence check using state equation in 340 ms returned sat
[2024-06-02 18:29:50] [INFO ] Computed and/alt/rep : 1011/1378/1011 causal constraints (skipped 200 transitions) in 60 ms.
[2024-06-02 18:29:52] [INFO ] Deduced a trap composed of 23 places in 208 ms of which 6 ms to minimize.
[2024-06-02 18:29:53] [INFO ] Deduced a trap composed of 337 places in 192 ms of which 4 ms to minimize.
[2024-06-02 18:29:53] [INFO ] Deduced a trap composed of 162 places in 200 ms of which 4 ms to minimize.
[2024-06-02 18:29:53] [INFO ] Deduced a trap composed of 418 places in 193 ms of which 3 ms to minimize.
[2024-06-02 18:29:53] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1070 ms
[2024-06-02 18:29:53] [INFO ] Added : 144 causal constraints over 29 iterations in 2874 ms. Result :sat
Minimization took 693 ms.
[2024-06-02 18:29:54] [INFO ] [Real]Absence check using 10 positive place invariants in 16 ms returned sat
[2024-06-02 18:29:54] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 3 ms returned sat
[2024-06-02 18:29:54] [INFO ] [Real]Absence check using state equation in 306 ms returned sat
[2024-06-02 18:29:55] [INFO ] Computed and/alt/rep : 1011/1378/1011 causal constraints (skipped 200 transitions) in 62 ms.
[2024-06-02 18:29:55] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:29:55] [INFO ] [Nat]Absence check using 10 positive place invariants in 17 ms returned sat
[2024-06-02 18:29:55] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2024-06-02 18:29:55] [INFO ] [Nat]Absence check using state equation in 311 ms returned sat
[2024-06-02 18:29:55] [INFO ] Computed and/alt/rep : 1011/1378/1011 causal constraints (skipped 200 transitions) in 55 ms.
[2024-06-02 18:29:57] [INFO ] Added : 164 causal constraints over 33 iterations in 1933 ms. Result :sat
Minimization took 678 ms.
[2024-06-02 18:29:58] [INFO ] [Real]Absence check using 10 positive place invariants in 16 ms returned sat
[2024-06-02 18:29:58] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2024-06-02 18:29:58] [INFO ] [Real]Absence check using state equation in 312 ms returned sat
[2024-06-02 18:29:58] [INFO ] Computed and/alt/rep : 1011/1378/1011 causal constraints (skipped 200 transitions) in 66 ms.
[2024-06-02 18:29:59] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:29:59] [INFO ] [Nat]Absence check using 10 positive place invariants in 18 ms returned sat
[2024-06-02 18:29:59] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2024-06-02 18:29:59] [INFO ] [Nat]Absence check using state equation in 317 ms returned sat
[2024-06-02 18:29:59] [INFO ] Computed and/alt/rep : 1011/1378/1011 causal constraints (skipped 200 transitions) in 64 ms.
[2024-06-02 18:30:01] [INFO ] Deduced a trap composed of 339 places in 209 ms of which 4 ms to minimize.
[2024-06-02 18:30:01] [INFO ] Deduced a trap composed of 346 places in 204 ms of which 4 ms to minimize.
[2024-06-02 18:30:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 564 ms
[2024-06-02 18:30:01] [INFO ] Added : 135 causal constraints over 27 iterations in 2275 ms. Result :sat
Minimization took 691 ms.
[2024-06-02 18:30:02] [INFO ] [Real]Absence check using 10 positive place invariants in 17 ms returned sat
[2024-06-02 18:30:02] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 3 ms returned sat
[2024-06-02 18:30:03] [INFO ] [Real]Absence check using state equation in 286 ms returned sat
[2024-06-02 18:30:03] [INFO ] Computed and/alt/rep : 1011/1378/1011 causal constraints (skipped 200 transitions) in 62 ms.
[2024-06-02 18:30:03] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:30:03] [INFO ] [Nat]Absence check using 10 positive place invariants in 18 ms returned sat
[2024-06-02 18:30:03] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 3 ms returned sat
[2024-06-02 18:30:03] [INFO ] [Nat]Absence check using state equation in 289 ms returned sat
[2024-06-02 18:30:03] [INFO ] Computed and/alt/rep : 1011/1378/1011 causal constraints (skipped 200 transitions) in 61 ms.
[2024-06-02 18:30:05] [INFO ] Added : 131 causal constraints over 27 iterations in 1588 ms. Result :sat
Minimization took 683 ms.
[2024-06-02 18:30:06] [INFO ] [Real]Absence check using 10 positive place invariants in 17 ms returned sat
[2024-06-02 18:30:06] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 2 ms returned sat
[2024-06-02 18:30:06] [INFO ] [Real]Absence check using state equation in 356 ms returned sat
[2024-06-02 18:30:06] [INFO ] Computed and/alt/rep : 1011/1378/1011 causal constraints (skipped 200 transitions) in 62 ms.
[2024-06-02 18:30:06] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:30:07] [INFO ] [Nat]Absence check using 10 positive place invariants in 18 ms returned sat
[2024-06-02 18:30:07] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 2 ms returned sat
[2024-06-02 18:30:07] [INFO ] [Nat]Absence check using state equation in 319 ms returned sat
[2024-06-02 18:30:07] [INFO ] Computed and/alt/rep : 1011/1378/1011 causal constraints (skipped 200 transitions) in 65 ms.
[2024-06-02 18:30:09] [INFO ] Added : 131 causal constraints over 27 iterations in 1609 ms. Result :sat
Minimization took 679 ms.
[2024-06-02 18:30:09] [INFO ] [Real]Absence check using 10 positive place invariants in 17 ms returned sat
[2024-06-02 18:30:09] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 4 ms returned sat
[2024-06-02 18:30:10] [INFO ] [Real]Absence check using state equation in 318 ms returned sat
[2024-06-02 18:30:10] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:30:10] [INFO ] [Nat]Absence check using 10 positive place invariants in 17 ms returned sat
[2024-06-02 18:30:10] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 6 ms returned sat
[2024-06-02 18:30:10] [INFO ] [Nat]Absence check using state equation in 316 ms returned sat
[2024-06-02 18:30:10] [INFO ] Computed and/alt/rep : 1011/1378/1011 causal constraints (skipped 200 transitions) in 72 ms.
[2024-06-02 18:30:12] [INFO ] Deduced a trap composed of 30 places in 206 ms of which 4 ms to minimize.
[2024-06-02 18:30:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 304 ms
[2024-06-02 18:30:13] [INFO ] Added : 165 causal constraints over 33 iterations in 2266 ms. Result :sat
Minimization took 689 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Support contains 10 out of 991 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 991/991 places, 1212/1212 transitions.
Graph (trivial) has 995 edges and 991 vertex of which 3 / 991 are part of one of the 1 SCC in 5 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 1661 edges and 989 vertex of which 933 are kept as prefixes of interest. Removing 56 places using SCC suffix rule.3 ms
Discarding 56 places :
Also discarding 26 output transitions
Drop transitions (Output transitions of discarded places.) removed 26 transitions
Drop transitions (Empty/Sink Transition effects.) removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 586 transitions
Trivial Post-agglo rules discarded 586 transitions
Performed 586 trivial Post agglomeration. Transition count delta: 586
Iterating post reduction 0 with 622 rules applied. Total rules applied 624 place count 933 transition count 561
Reduce places removed 586 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 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 613 rules applied. Total rules applied 1237 place count 347 transition count 534
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 2 with 29 rules applied. Total rules applied 1266 place count 334 transition count 518
Reduce places removed 6 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 12 rules applied. Total rules applied 1278 place count 328 transition count 512
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 1287 place count 325 transition count 506
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 5 with 16 rules applied. Total rules applied 1303 place count 322 transition count 493
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 15 rules applied. Total rules applied 1318 place count 311 transition count 489
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 3 Pre rules applied. Total rules applied 1318 place count 311 transition count 486
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 1324 place count 308 transition count 486
Discarding 50 places :
Symmetric choice reduction at 7 with 50 rule applications. Total rules 1374 place count 258 transition count 436
Iterating global reduction 7 with 50 rules applied. Total rules applied 1424 place count 258 transition count 436
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 13 Pre rules applied. Total rules applied 1424 place count 258 transition count 423
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 7 with 26 rules applied. Total rules applied 1450 place count 245 transition count 423
Discarding 29 places :
Symmetric choice reduction at 7 with 29 rule applications. Total rules 1479 place count 216 transition count 372
Iterating global reduction 7 with 29 rules applied. Total rules applied 1508 place count 216 transition count 372
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 7 with 7 rules applied. Total rules applied 1515 place count 216 transition count 365
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1516 place count 215 transition count 365
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 1519 place count 212 transition count 362
Iterating global reduction 9 with 3 rules applied. Total rules applied 1522 place count 212 transition count 362
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 1525 place count 212 transition count 359
Performed 75 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 75 places in 0 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 10 with 150 rules applied. Total rules applied 1675 place count 137 transition count 274
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 10 with 5 rules applied. Total rules applied 1680 place count 137 transition count 269
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: -45
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 11 with 76 rules applied. Total rules applied 1756 place count 99 transition count 314
Drop transitions (Empty/Sink Transition effects.) removed 38 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 56 transitions.
Iterating post reduction 11 with 56 rules applied. Total rules applied 1812 place count 99 transition count 258
Discarding 24 places :
Symmetric choice reduction at 12 with 24 rule applications. Total rules 1836 place count 75 transition count 186
Iterating global reduction 12 with 24 rules applied. Total rules applied 1860 place count 75 transition count 186
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 12 with 17 rules applied. Total rules applied 1877 place count 75 transition count 169
Discarding 5 places :
Symmetric choice reduction at 13 with 5 rule applications. Total rules 1882 place count 70 transition count 147
Iterating global reduction 13 with 5 rules applied. Total rules applied 1887 place count 70 transition count 147
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 13 with 2 rules applied. Total rules applied 1889 place count 70 transition count 145
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 14 with 4 rules applied. Total rules applied 1893 place count 70 transition count 141
Free-agglomeration rule applied 12 times.
Iterating global reduction 14 with 12 rules applied. Total rules applied 1905 place count 70 transition count 129
Reduce places removed 12 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 14 with 14 rules applied. Total rules applied 1919 place count 58 transition count 127
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 15 with 1 rules applied. Total rules applied 1920 place count 58 transition count 127
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 15 with 1 rules applied. Total rules applied 1921 place count 57 transition count 126
Reduce places removed 3 places and 0 transitions.
Graph (trivial) has 29 edges and 54 vertex of which 5 / 54 are part of one of the 2 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 15 with 4 rules applied. Total rules applied 1925 place count 51 transition count 126
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 35 edges and 50 vertex of which 6 / 50 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Iterating post reduction 16 with 10 rules applied. Total rules applied 1935 place count 45 transition count 118
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 17 with 17 rules applied. Total rules applied 1952 place count 45 transition count 101
Discarding 1 places :
Symmetric choice reduction at 18 with 1 rule applications. Total rules 1953 place count 44 transition count 98
Iterating global reduction 18 with 1 rules applied. Total rules applied 1954 place count 44 transition count 98
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 18 with 1 rules applied. Total rules applied 1955 place count 44 transition count 97
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 19 with 13 rules applied. Total rules applied 1968 place count 44 transition count 84
Discarding 1 places :
Symmetric choice reduction at 19 with 1 rule applications. Total rules 1969 place count 43 transition count 82
Iterating global reduction 19 with 1 rules applied. Total rules applied 1970 place count 43 transition count 82
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 19 with 1 rules applied. Total rules applied 1971 place count 43 transition count 81
Free-agglomeration rule applied 4 times.
Iterating global reduction 20 with 4 rules applied. Total rules applied 1975 place count 43 transition count 77
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 20 with 5 rules applied. Total rules applied 1980 place count 39 transition count 76
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 21 with 2 rules applied. Total rules applied 1982 place count 39 transition count 74
Free-agglomeration rule applied 1 times.
Iterating global reduction 21 with 1 rules applied. Total rules applied 1983 place count 39 transition count 73
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 21 with 3 rules applied. Total rules applied 1986 place count 38 transition count 71
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 22 with 5 rules applied. Total rules applied 1991 place count 38 transition count 71
Applied a total of 1991 rules in 178 ms. Remains 38 /991 variables (removed 953) and now considering 71/1212 (removed 1141) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 197 ms. Remains : 38/991 places, 71/1212 transitions.
[2024-06-02 18:30:13] [INFO ] Flow matrix only has 65 transitions (discarded 6 similar events)
// Phase 1: matrix 65 rows 38 cols
[2024-06-02 18:30:14] [INFO ] Computed 6 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (2 resets) in 1067 ms. (936 steps per ms)
FORMULA CO4-PT-20-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-20-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-20-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-20-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-20-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-20-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-20-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-20-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-20-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 2000001 steps (4 resets) in 615 ms. (3246 steps per ms)
FORMULA CO4-PT-20-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
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 42451 ms.
ITS solved all properties within timeout

BK_STOP 1717353015746

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

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