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.r550-tall-171734898600101.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 itstools
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 r550-tall-171734898600101
=====================================================================

--------------------
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 1717352128166

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CO4-PT-13
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2024-06-02 18:15:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-06-02 18:15:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:15:29] [INFO ] Load time of PNML (sax parser for PT used): 114 ms
[2024-06-02 18:15:29] [INFO ] Transformed 649 places.
[2024-06-02 18:15:29] [INFO ] Transformed 816 transitions.
[2024-06-02 18:15:29] [INFO ] Found NUPN structural information;
[2024-06-02 18:15:29] [INFO ] Parsed PT model containing 649 places and 816 transitions and 2232 arcs in 216 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Deduced a syphon composed of 172 places in 17 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:15:29] [INFO ] Computed 9 invariants in 27 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 (27 resets) in 33 ms. (294 steps per ms)
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-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-13-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 70004 steps (389 resets) in 75 ms. (921 steps per ms)
FORMULA CO4-PT-13-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
[2024-06-02 18:15:29] [INFO ] Invariant cache hit.
[2024-06-02 18:15:30] [INFO ] [Real]Absence check using 8 positive place invariants in 10 ms returned sat
[2024-06-02 18:15:30] [INFO ] [Real]Absence check using 8 positive and 1 generalized place invariants in 0 ms returned sat
[2024-06-02 18:15:30] [INFO ] [Real]Absence check using state equation in 158 ms returned sat
[2024-06-02 18:15:30] [INFO ] Computed and/alt/rep : 484/755/484 causal constraints (skipped 104 transitions) in 49 ms.
[2024-06-02 18:15:30] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:15:30] [INFO ] [Nat]Absence check using 8 positive place invariants in 9 ms returned sat
[2024-06-02 18:15:30] [INFO ] [Nat]Absence check using 8 positive and 1 generalized place invariants in 0 ms returned sat
[2024-06-02 18:15:30] [INFO ] [Nat]Absence check using state equation in 143 ms returned sat
[2024-06-02 18:15:30] [INFO ] Computed and/alt/rep : 484/755/484 causal constraints (skipped 104 transitions) in 95 ms.
[2024-06-02 18:15:31] [INFO ] Added : 88 causal constraints over 18 iterations in 795 ms. Result :sat
Minimization took 299 ms.
[2024-06-02 18:15:32] [INFO ] [Real]Absence check using 8 positive place invariants in 9 ms returned sat
[2024-06-02 18:15:32] [INFO ] [Real]Absence check using 8 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-02 18:15:32] [INFO ] [Real]Absence check using state equation in 147 ms returned sat
[2024-06-02 18:15:32] [INFO ] Computed and/alt/rep : 484/755/484 causal constraints (skipped 104 transitions) in 42 ms.
[2024-06-02 18:15:32] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:15:32] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2024-06-02 18:15:32] [INFO ] [Nat]Absence check using 8 positive and 1 generalized place invariants in 0 ms returned sat
[2024-06-02 18:15:32] [INFO ] [Nat]Absence check using state equation in 125 ms returned sat
[2024-06-02 18:15:32] [INFO ] Computed and/alt/rep : 484/755/484 causal constraints (skipped 104 transitions) in 50 ms.
[2024-06-02 18:15:33] [INFO ] Added : 103 causal constraints over 21 iterations in 770 ms. Result :sat
Minimization took 245 ms.
[2024-06-02 18:15:33] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2024-06-02 18:15:33] [INFO ] [Real]Absence check using 8 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-02 18:15:33] [INFO ] [Real]Absence check using state equation in 138 ms returned sat
[2024-06-02 18:15:34] [INFO ] Deduced a trap composed of 21 places in 184 ms of which 27 ms to minimize.
[2024-06-02 18:15:34] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:15:34] [INFO ] [Nat]Absence check using 8 positive place invariants in 11 ms returned sat
[2024-06-02 18:15:34] [INFO ] [Nat]Absence check using 8 positive and 1 generalized place invariants in 0 ms returned sat
[2024-06-02 18:15:34] [INFO ] [Nat]Absence check using state equation in 141 ms returned sat
[2024-06-02 18:15:34] [INFO ] Deduced a trap composed of 21 places in 152 ms of which 4 ms to minimize.
[2024-06-02 18:15:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 201 ms
[2024-06-02 18:15:34] [INFO ] Computed and/alt/rep : 484/755/484 causal constraints (skipped 104 transitions) in 36 ms.
[2024-06-02 18:15:35] [INFO ] Added : 108 causal constraints over 22 iterations in 765 ms. Result :sat
Minimization took 236 ms.
[2024-06-02 18:15:35] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2024-06-02 18:15:35] [INFO ] [Real]Absence check using 8 positive and 1 generalized place invariants in 2 ms returned sat
[2024-06-02 18:15:35] [INFO ] [Real]Absence check using state equation in 131 ms returned sat
[2024-06-02 18:15:35] [INFO ] Computed and/alt/rep : 484/755/484 causal constraints (skipped 104 transitions) in 32 ms.
[2024-06-02 18:15:36] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:15:36] [INFO ] [Nat]Absence check using 8 positive place invariants in 10 ms returned sat
[2024-06-02 18:15:36] [INFO ] [Nat]Absence check using 8 positive and 1 generalized place invariants in 2 ms returned sat
[2024-06-02 18:15:36] [INFO ] [Nat]Absence check using state equation in 185 ms returned sat
[2024-06-02 18:15:36] [INFO ] Computed and/alt/rep : 484/755/484 causal constraints (skipped 104 transitions) in 31 ms.
[2024-06-02 18:15:36] [INFO ] Added : 99 causal constraints over 20 iterations in 640 ms. Result :sat
Minimization took 226 ms.
[2024-06-02 18:15:37] [INFO ] [Real]Absence check using 8 positive place invariants in 9 ms returned sat
[2024-06-02 18:15:37] [INFO ] [Real]Absence check using 8 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-02 18:15:37] [INFO ] [Real]Absence check using state equation in 142 ms returned sat
[2024-06-02 18:15:37] [INFO ] Deduced a trap composed of 21 places in 94 ms of which 3 ms to minimize.
[2024-06-02 18:15:37] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:15:37] [INFO ] [Nat]Absence check using 8 positive place invariants in 9 ms returned sat
[2024-06-02 18:15:37] [INFO ] [Nat]Absence check using 8 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-02 18:15:37] [INFO ] [Nat]Absence check using state equation in 147 ms returned sat
[2024-06-02 18:15:37] [INFO ] Deduced a trap composed of 21 places in 93 ms of which 3 ms to minimize.
[2024-06-02 18:15:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 137 ms
[2024-06-02 18:15:38] [INFO ] Computed and/alt/rep : 484/755/484 causal constraints (skipped 104 transitions) in 28 ms.
[2024-06-02 18:15:39] [INFO ] Deduced a trap composed of 17 places in 124 ms of which 3 ms to minimize.
[2024-06-02 18:15:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 185 ms
[2024-06-02 18:15:39] [INFO ] Added : 145 causal constraints over 30 iterations in 1176 ms. Result :sat
Minimization took 359 ms.
[2024-06-02 18:15:39] [INFO ] [Real]Absence check using 8 positive place invariants in 11 ms returned sat
[2024-06-02 18:15:39] [INFO ] [Real]Absence check using 8 positive and 1 generalized place invariants in 0 ms returned sat
[2024-06-02 18:15:39] [INFO ] [Real]Absence check using state equation in 140 ms returned sat
[2024-06-02 18:15:39] [INFO ] Deduced a trap composed of 21 places in 97 ms of which 2 ms to minimize.
[2024-06-02 18:15:39] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:15:40] [INFO ] [Nat]Absence check using 8 positive place invariants in 9 ms returned sat
[2024-06-02 18:15:40] [INFO ] [Nat]Absence check using 8 positive and 1 generalized place invariants in 0 ms returned sat
[2024-06-02 18:15:40] [INFO ] [Nat]Absence check using state equation in 125 ms returned sat
[2024-06-02 18:15:40] [INFO ] Deduced a trap composed of 21 places in 100 ms of which 2 ms to minimize.
[2024-06-02 18:15:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 156 ms
[2024-06-02 18:15:40] [INFO ] Computed and/alt/rep : 484/755/484 causal constraints (skipped 104 transitions) in 31 ms.
[2024-06-02 18:15:40] [INFO ] Added : 79 causal constraints over 16 iterations in 545 ms. Result :sat
Minimization took 229 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-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, 0] Max Struct:[1, 1, 1]
Support contains 3 out of 477 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 477/477 places, 589/589 transitions.
Graph (trivial) has 478 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 271 transitions
Trivial Post-agglo rules discarded 271 transitions
Performed 271 trivial Post agglomeration. Transition count delta: 271
Iterating post reduction 0 with 296 rules applied. Total rules applied 298 place count 434 transition count 270
Reduce places removed 271 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 289 rules applied. Total rules applied 587 place count 163 transition count 252
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 607 place count 155 transition count 240
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 615 place count 151 transition count 236
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 619 place count 149 transition count 234
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 621 place count 148 transition count 233
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 621 place count 148 transition count 232
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 623 place count 147 transition count 232
Discarding 26 places :
Symmetric choice reduction at 6 with 26 rule applications. Total rules 649 place count 121 transition count 206
Iterating global reduction 6 with 26 rules applied. Total rules applied 675 place count 121 transition count 206
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 6 Pre rules applied. Total rules applied 675 place count 121 transition count 200
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 6 with 12 rules applied. Total rules applied 687 place count 115 transition count 200
Discarding 16 places :
Symmetric choice reduction at 6 with 16 rule applications. Total rules 703 place count 99 transition count 160
Iterating global reduction 6 with 16 rules applied. Total rules applied 719 place count 99 transition count 160
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 721 place count 99 transition count 158
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 723 place count 97 transition count 156
Iterating global reduction 7 with 2 rules applied. Total rules applied 725 place count 97 transition count 156
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 727 place count 97 transition count 154
Performed 34 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 8 with 68 rules applied. Total rules applied 795 place count 63 transition count 116
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 796 place count 63 transition count 115
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 828 place count 47 transition count 136
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 851 place count 47 transition count 113
Discarding 11 places :
Symmetric choice reduction at 10 with 11 rule applications. Total rules 862 place count 36 transition count 80
Iterating global reduction 10 with 11 rules applied. Total rules applied 873 place count 36 transition count 80
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 10 with 8 rules applied. Total rules applied 881 place count 36 transition count 72
Discarding 2 places :
Symmetric choice reduction at 11 with 2 rule applications. Total rules 883 place count 34 transition count 62
Iterating global reduction 11 with 2 rules applied. Total rules applied 885 place count 34 transition count 62
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 887 place count 34 transition count 60
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 889 place count 33 transition count 73
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 891 place count 33 transition count 71
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 903 place count 33 transition count 59
Free-agglomeration rule applied 7 times.
Iterating global reduction 13 with 7 rules applied. Total rules applied 910 place count 33 transition count 52
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 918 place count 26 transition count 51
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 14 with 1 rules applied. Total rules applied 919 place count 25 transition count 50
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 14 with 2 rules applied. Total rules applied 921 place count 23 transition count 50
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 922 place count 23 transition count 49
Discarding 1 places :
Symmetric choice reduction at 15 with 1 rule applications. Total rules 923 place count 22 transition count 46
Iterating global reduction 15 with 1 rules applied. Total rules applied 924 place count 22 transition count 46
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 15 with 1 rules applied. Total rules applied 925 place count 22 transition count 45
Free-agglomeration rule applied 2 times.
Iterating global reduction 16 with 2 rules applied. Total rules applied 927 place count 22 transition count 43
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 16 with 2 rules applied. Total rules applied 929 place count 20 transition count 43
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 931 place count 20 transition count 41
Applied a total of 931 rules in 92 ms. Remains 20 /477 variables (removed 457) and now considering 41/589 (removed 548) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 101 ms. Remains : 20/477 places, 41/589 transitions.
[2024-06-02 18:15:41] [INFO ] Flow matrix only has 33 transitions (discarded 8 similar events)
// Phase 1: matrix 33 rows 20 cols
[2024-06-02 18:15:41] [INFO ] Computed 5 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
RANDOM walk for 1000000 steps (2 resets) in 744 ms. (1342 steps per ms)
FORMULA CO4-PT-13-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-13-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (2 resets) in 301 ms. (3311 steps per ms)
FORMULA CO4-PT-13-UpperBounds-02 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 )
[2024-06-02 18:15:42] [INFO ] Flatten gal took : 25 ms
[2024-06-02 18:15:42] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:15:42] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2382984505960732510.gal : 6 ms
[2024-06-02 18:15:42] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17175614839350252080.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2382984505960732510.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17175614839350252080.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
its-reach command run as :

ITS tools runner thread asked to quit. Dying gracefully.
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
java.io.IOException: Stream closed
at java.base/java.io.BufferedInputStream.getBufIfOpen(BufferedInputStream.java:168)
at java.base/java.io.BufferedInputStream.read(BufferedInputStream.java:334)
at java.base/sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:270)
at java.base/sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:313)
at java.base/sun.nio.cs.StreamDecoder.read(StreamDecoder.java:188)
at java.base/java.io.InputStreamReader.read(InputStreamReader.java:177)
at java.base/java.io.BufferedReader.fill(BufferedReader.java:162)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:329)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:396)
at fr.lip6.move.gal.application.runner.its.ITSRunner$ITSInterpreter.run(ITSRunner.java:211)
at java.base/java.lang.Thread.run(Thread.java:840)
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 13332 ms.

BK_STOP 1717352142738

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//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//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="itstools"
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 itstools"
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 r550-tall-171734898600101"
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 ;