Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r072-tall-174860068200829.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is EnergyBus-PT-none, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r072-tall-174860068200829
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.7M
-rw-r--r-- 1 mcc users 6.9K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 200K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 5 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 3.2M May 29 14:32 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

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

=== Now, execution of the tool begins

BK_START 1748862967365

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=EnergyBus-PT-none
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2025-06-02 11:16:08] [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]
[2025-06-02 11:16:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 11:16:08] [INFO ] Load time of PNML (sax parser for PT used): 280 ms
[2025-06-02 11:16:08] [INFO ] Transformed 157 places.
[2025-06-02 11:16:08] [INFO ] Transformed 4430 transitions.
[2025-06-02 11:16:08] [INFO ] Found NUPN structural information;
[2025-06-02 11:16:08] [INFO ] Parsed PT model containing 157 places and 4430 transitions and 63389 arcs in 421 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Deduced a syphon composed of 4 places in 19 ms
Reduce places removed 4 places and 825 transitions.
Ensure Unique test removed 1692 transitions
Reduce redundant transitions removed 1692 transitions.
FORMULA EnergyBus-PT-none-UpperBounds-07 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]
[2025-06-02 11:16:09] [INFO ] Flow matrix only has 647 transitions (discarded 1266 similar events)
// Phase 1: matrix 647 rows 153 cols
[2025-06-02 11:16:09] [INFO ] Computed 23 invariants in 25 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 (2 resets) in 279 ms. (35 steps per ms)
FORMULA EnergyBus-PT-none-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EnergyBus-PT-none-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EnergyBus-PT-none-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EnergyBus-PT-none-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EnergyBus-PT-none-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EnergyBus-PT-none-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EnergyBus-PT-none-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EnergyBus-PT-none-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EnergyBus-PT-none-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EnergyBus-PT-none-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EnergyBus-PT-none-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EnergyBus-PT-none-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 30003 steps (6 resets) in 61 ms. (483 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
[2025-06-02 11:16:09] [INFO ] Flow matrix only has 647 transitions (discarded 1266 similar events)
[2025-06-02 11:16:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 11:16:09] [INFO ] [Real]Absence check using 21 positive place invariants in 12 ms returned sat
[2025-06-02 11:16:09] [INFO ] [Real]Absence check using 21 positive and 2 generalized place invariants in 5 ms returned sat
[2025-06-02 11:16:09] [INFO ] [Real]Absence check using state equation in 184 ms returned sat
[2025-06-02 11:16:09] [INFO ] State equation strengthened by 463 read => feed constraints.
[2025-06-02 11:16:10] [INFO ] [Real]Added 463 Read/Feed constraints in 92 ms returned sat
[2025-06-02 11:16:10] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 11:16:10] [INFO ] [Nat]Absence check using 21 positive place invariants in 7 ms returned sat
[2025-06-02 11:16:10] [INFO ] [Nat]Absence check using 21 positive and 2 generalized place invariants in 3 ms returned sat
[2025-06-02 11:16:10] [INFO ] [Nat]Absence check using state equation in 184 ms returned sat
[2025-06-02 11:16:10] [INFO ] [Nat]Added 463 Read/Feed constraints in 80 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 11:16:10] [INFO ] Deduced a trap composed of 7 places in 159 ms of which 8 ms to minimize.
[2025-06-02 11:16:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 327 ms
[2025-06-02 11:16:10] [INFO ] Computed and/alt/rep : 161/446/160 causal constraints (skipped 486 transitions) in 137 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 11:16:13] [INFO ] Deduced a trap composed of 9 places in 185 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 11:16:13] [INFO ] Deduced a trap composed of 22 places in 164 ms of which 3 ms to minimize.
[2025-06-02 11:16:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 487 ms
[2025-06-02 11:16:13] [INFO ] Added : 119 causal constraints over 24 iterations in 3049 ms. Result :sat
Minimization took 501 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 11:16:14] [INFO ] [Real]Absence check using 21 positive place invariants in 5 ms returned sat
[2025-06-02 11:16:14] [INFO ] [Real]Absence check using 21 positive and 2 generalized place invariants in 3 ms returned sat
[2025-06-02 11:16:14] [INFO ] [Real]Absence check using state equation in 110 ms returned sat
[2025-06-02 11:16:14] [INFO ] [Real]Added 463 Read/Feed constraints in 171 ms returned sat
[2025-06-02 11:16:14] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 11:16:14] [INFO ] [Nat]Absence check using 21 positive place invariants in 5 ms returned sat
[2025-06-02 11:16:14] [INFO ] [Nat]Absence check using 21 positive and 2 generalized place invariants in 2 ms returned sat
[2025-06-02 11:16:14] [INFO ] [Nat]Absence check using state equation in 121 ms returned sat
[2025-06-02 11:16:14] [INFO ] [Nat]Added 463 Read/Feed constraints in 65 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 11:16:15] [INFO ] Deduced a trap composed of 7 places in 206 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 11:16:15] [INFO ] Deduced a trap composed of 8 places in 196 ms of which 6 ms to minimize.
[2025-06-02 11:16:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 538 ms
[2025-06-02 11:16:15] [INFO ] Computed and/alt/rep : 161/446/160 causal constraints (skipped 486 transitions) in 257 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 11:16:17] [INFO ] Deduced a trap composed of 5 places in 189 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 11:16:17] [INFO ] Deduced a trap composed of 5 places in 189 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 11:16:17] [INFO ] Deduced a trap composed of 9 places in 180 ms of which 4 ms to minimize.
[2025-06-02 11:16:18] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 718 ms
[2025-06-02 11:16:18] [INFO ] Added : 139 causal constraints over 28 iterations in 2581 ms. Result :sat
Minimization took 476 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 11:16:18] [INFO ] [Real]Absence check using 21 positive place invariants in 13 ms returned sat
[2025-06-02 11:16:18] [INFO ] [Real]Absence check using 21 positive and 2 generalized place invariants in 1 ms returned sat
[2025-06-02 11:16:18] [INFO ] [Real]Absence check using state equation in 111 ms returned sat
[2025-06-02 11:16:18] [INFO ] [Real]Added 463 Read/Feed constraints in 68 ms returned sat
[2025-06-02 11:16:18] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 11:16:18] [INFO ] [Nat]Absence check using 21 positive place invariants in 8 ms returned sat
[2025-06-02 11:16:18] [INFO ] [Nat]Absence check using 21 positive and 2 generalized place invariants in 5 ms returned sat
[2025-06-02 11:16:19] [INFO ] [Nat]Absence check using state equation in 109 ms returned sat
[2025-06-02 11:16:19] [INFO ] [Nat]Added 463 Read/Feed constraints in 63 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 11:16:19] [INFO ] Deduced a trap composed of 7 places in 210 ms of which 6 ms to minimize.
[2025-06-02 11:16:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 299 ms
[2025-06-02 11:16:19] [INFO ] Computed and/alt/rep : 161/446/160 causal constraints (skipped 486 transitions) in 61 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 11:16:21] [INFO ] Deduced a trap composed of 5 places in 326 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 11:16:21] [INFO ] Deduced a trap composed of 9 places in 322 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 11:16:21] [INFO ] Deduced a trap composed of 15 places in 315 ms of which 9 ms to minimize.
[2025-06-02 11:16:21] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1138 ms
[2025-06-02 11:16:22] [INFO ] Added : 110 causal constraints over 23 iterations in 2657 ms. Result :sat
Minimization took 455 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Support contains 3 out of 153 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 153/153 places, 1913/1913 transitions.
Graph (trivial) has 133 edges and 153 vertex of which 17 / 153 are part of one of the 6 SCC in 2 ms
Free SCC test removed 11 places
Drop transitions (Empty/Sink Transition effects.) removed 29 transitions
Ensure Unique test removed 1038 transitions
Reduce isomorphic transitions removed 1067 transitions.
Graph (complete) has 751 edges and 142 vertex of which 138 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.13 ms
Discarding 4 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 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 0 with 6 rules applied. Total rules applied 8 place count 138 transition count 837
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 15 place count 134 transition count 834
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 15 place count 134 transition count 825
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 33 place count 125 transition count 825
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 55 place count 103 transition count 522
Iterating global reduction 2 with 22 rules applied. Total rules applied 77 place count 103 transition count 522
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 2 with 30 rules applied. Total rules applied 107 place count 103 transition count 492
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 123 place count 95 transition count 484
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 3 with 27 rules applied. Total rules applied 150 place count 95 transition count 457
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 151 place count 94 transition count 455
Iterating global reduction 4 with 1 rules applied. Total rules applied 152 place count 94 transition count 455
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -25
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 168 place count 86 transition count 480
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 176 place count 86 transition count 472
Drop transitions (Redundant composition of simpler transitions.) removed 41 transitions
Redundant transition composition rules discarded 41 transitions
Iterating global reduction 5 with 41 rules applied. Total rules applied 217 place count 86 transition count 431
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 5 Pre rules applied. Total rules applied 217 place count 86 transition count 426
Deduced a syphon composed of 5 places in 2 ms
Ensure Unique test removed 4 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 231 place count 77 transition count 426
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 245 place count 70 transition count 419
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 20 edges and 70 vertex of which 2 / 70 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 5 with 2 rules applied. Total rules applied 247 place count 69 transition count 418
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 168 transitions
Reduce isomorphic transitions removed 170 transitions.
Iterating post reduction 6 with 170 rules applied. Total rules applied 417 place count 69 transition count 248
Ensure Unique test removed 1 places
Iterating post reduction 7 with 1 rules applied. Total rules applied 418 place count 68 transition count 248
Drop transitions (Redundant composition of simpler transitions.) removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 8 with 15 rules applied. Total rules applied 433 place count 68 transition count 233
Free-agglomeration rule applied 8 times.
Iterating global reduction 8 with 8 rules applied. Total rules applied 441 place count 68 transition count 225
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 8 with 8 rules applied. Total rules applied 449 place count 60 transition count 225
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 9 with 1 rules applied. Total rules applied 450 place count 60 transition count 235
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 9 with 9 rules applied. Total rules applied 459 place count 59 transition count 227
Applied a total of 459 rules in 234 ms. Remains 59 /153 variables (removed 94) and now considering 227/1913 (removed 1686) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 242 ms. Remains : 59/153 places, 227/1913 transitions.
[2025-06-02 11:16:23] [INFO ] Flow matrix only has 116 transitions (discarded 111 similar events)
// Phase 1: matrix 116 rows 59 cols
[2025-06-02 11:16:23] [INFO ] Computed 17 invariants in 1 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 1086 ms. (919 steps per ms)
FORMULA EnergyBus-PT-none-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EnergyBus-PT-none-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EnergyBus-PT-none-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 2000002 steps (4 resets) in 1017 ms. (1964 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 )
[2025-06-02 11:16:25] [INFO ] Flatten gal took : 47 ms
[2025-06-02 11:16:25] [INFO ] Flatten gal took : 19 ms
[2025-06-02 11:16:25] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4409175997113671249.gal : 12 ms
[2025-06-02 11:16:25] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6031263770493628418.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4409175997113671249.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6031263770493628418.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 17174 ms.

BK_STOP 1748862985759

--------------------
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
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /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="EnergyBus-PT-none"
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-5832"
echo " Executing tool itstools"
echo " Input is EnergyBus-PT-none, 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 r072-tall-174860068200829"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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