Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r089-tall-165260117700169.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2021
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 r089-tall-165260117700169
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.4M
-rw-r--r-- 1 mcc users 6.6K Apr 29 14:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Apr 29 14:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Apr 29 14:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Apr 29 14:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K May 9 07:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 07:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 07:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 9 07:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 07:45 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 9 07:45 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 3.2M May 10 09: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 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 1652726705507

Running Version 0
[2022-05-16 18:45:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-16 18:45:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 18:45:07] [INFO ] Load time of PNML (sax parser for PT used): 321 ms
[2022-05-16 18:45:07] [INFO ] Transformed 157 places.
[2022-05-16 18:45:07] [INFO ] Transformed 4430 transitions.
[2022-05-16 18:45:07] [INFO ] Found NUPN structural information;
[2022-05-16 18:45:07] [INFO ] Parsed PT model containing 157 places and 4430 transitions in 404 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 692 ms.
Deduced a syphon composed of 4 places in 25 ms
Reduce places removed 4 places and 825 transitions.
Ensure Unique test removed 1692 transitions
Reduce redundant transitions removed 1692 transitions.
Normalized transition count is 647 out of 1913 initially.
// Phase 1: matrix 647 rows 153 cols
[2022-05-16 18:45:09] [INFO ] Computed 23 place invariants in 27 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 199 ms. (steps per millisecond=50 ) properties (out of 16) seen :11
FORMULA EnergyBus-PT-none-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EnergyBus-PT-none-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EnergyBus-PT-none-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EnergyBus-PT-none-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EnergyBus-PT-none-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EnergyBus-PT-none-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EnergyBus-PT-none-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EnergyBus-PT-none-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EnergyBus-PT-none-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EnergyBus-PT-none-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EnergyBus-PT-none-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 5) seen :0
[2022-05-16 18:45:10] [INFO ] Flow matrix only has 647 transitions (discarded 1266 similar events)
// Phase 1: matrix 647 rows 153 cols
[2022-05-16 18:45:10] [INFO ] Computed 23 place invariants in 6 ms
[2022-05-16 18:45:10] [INFO ] [Real]Absence check using 21 positive place invariants in 9 ms returned sat
[2022-05-16 18:45:10] [INFO ] [Real]Absence check using 21 positive and 2 generalized place invariants in 1 ms returned sat
[2022-05-16 18:45:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:45:10] [INFO ] [Real]Absence check using state equation in 127 ms returned sat
[2022-05-16 18:45:10] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 18:45:10] [INFO ] [Nat]Absence check using 21 positive place invariants in 6 ms returned sat
[2022-05-16 18:45:10] [INFO ] [Nat]Absence check using 21 positive and 2 generalized place invariants in 0 ms returned sat
[2022-05-16 18:45:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 18:45:10] [INFO ] [Nat]Absence check using state equation in 110 ms returned sat
[2022-05-16 18:45:10] [INFO ] State equation strengthened by 468 read => feed constraints.
[2022-05-16 18:45:11] [INFO ] [Nat]Added 468 Read/Feed constraints in 70 ms returned sat
[2022-05-16 18:45:11] [INFO ] Deduced a trap composed of 5 places in 58 ms of which 5 ms to minimize.
[2022-05-16 18:45:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 135 ms
[2022-05-16 18:45:11] [INFO ] Computed and/alt/rep : 161/446/160 causal constraints (skipped 486 transitions) in 166 ms.
[2022-05-16 18:45:12] [INFO ] Added : 134 causal constraints over 27 iterations in 1747 ms. Result :sat
Minimization took 153 ms.
[2022-05-16 18:45:13] [INFO ] [Real]Absence check using 21 positive place invariants in 5 ms returned sat
[2022-05-16 18:45:13] [INFO ] [Real]Absence check using 21 positive and 2 generalized place invariants in 3 ms returned sat
[2022-05-16 18:45:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:45:13] [INFO ] [Real]Absence check using state equation in 112 ms returned sat
[2022-05-16 18:45:13] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 18:45:13] [INFO ] [Nat]Absence check using 21 positive place invariants in 5 ms returned sat
[2022-05-16 18:45:13] [INFO ] [Nat]Absence check using 21 positive and 2 generalized place invariants in 8 ms returned sat
[2022-05-16 18:45:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 18:45:13] [INFO ] [Nat]Absence check using state equation in 109 ms returned sat
[2022-05-16 18:45:13] [INFO ] [Nat]Added 468 Read/Feed constraints in 70 ms returned sat
[2022-05-16 18:45:13] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 1 ms to minimize.
[2022-05-16 18:45:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 73 ms
[2022-05-16 18:45:13] [INFO ] Computed and/alt/rep : 161/446/160 causal constraints (skipped 486 transitions) in 296 ms.
[2022-05-16 18:45:15] [INFO ] Deduced a trap composed of 7 places in 126 ms of which 1 ms to minimize.
[2022-05-16 18:45:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 189 ms
[2022-05-16 18:45:15] [INFO ] Added : 139 causal constraints over 28 iterations in 1955 ms. Result :sat
Minimization took 167 ms.
[2022-05-16 18:45:15] [INFO ] [Real]Absence check using 21 positive place invariants in 4 ms returned sat
[2022-05-16 18:45:15] [INFO ] [Real]Absence check using 21 positive and 2 generalized place invariants in 2 ms returned sat
[2022-05-16 18:45:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:45:15] [INFO ] [Real]Absence check using state equation in 106 ms returned sat
[2022-05-16 18:45:15] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 18:45:15] [INFO ] [Nat]Absence check using 21 positive place invariants in 5 ms returned sat
[2022-05-16 18:45:15] [INFO ] [Nat]Absence check using 21 positive and 2 generalized place invariants in 1 ms returned sat
[2022-05-16 18:45:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 18:45:15] [INFO ] [Nat]Absence check using state equation in 100 ms returned sat
[2022-05-16 18:45:16] [INFO ] [Nat]Added 468 Read/Feed constraints in 67 ms returned sat
[2022-05-16 18:45:16] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 2 ms to minimize.
[2022-05-16 18:45:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 91 ms
[2022-05-16 18:45:16] [INFO ] Computed and/alt/rep : 161/446/160 causal constraints (skipped 486 transitions) in 115 ms.
[2022-05-16 18:45:17] [INFO ] Added : 130 causal constraints over 26 iterations in 1548 ms. Result :sat
Minimization took 119 ms.
[2022-05-16 18:45:17] [INFO ] [Real]Absence check using 21 positive place invariants in 5 ms returned sat
[2022-05-16 18:45:17] [INFO ] [Real]Absence check using 21 positive and 2 generalized place invariants in 1 ms returned sat
[2022-05-16 18:45:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:45:17] [INFO ] [Real]Absence check using state equation in 103 ms returned sat
[2022-05-16 18:45:17] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 18:45:18] [INFO ] [Nat]Absence check using 21 positive place invariants in 5 ms returned sat
[2022-05-16 18:45:18] [INFO ] [Nat]Absence check using 21 positive and 2 generalized place invariants in 1 ms returned sat
[2022-05-16 18:45:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 18:45:18] [INFO ] [Nat]Absence check using state equation in 92 ms returned sat
[2022-05-16 18:45:18] [INFO ] [Nat]Added 468 Read/Feed constraints in 61 ms returned sat
[2022-05-16 18:45:18] [INFO ] Deduced a trap composed of 5 places in 298 ms of which 1 ms to minimize.
[2022-05-16 18:45:18] [INFO ] Deduced a trap composed of 9 places in 302 ms of which 4 ms to minimize.
[2022-05-16 18:45:19] [INFO ] Deduced a trap composed of 5 places in 283 ms of which 0 ms to minimize.
[2022-05-16 18:45:19] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1002 ms
[2022-05-16 18:45:19] [INFO ] Computed and/alt/rep : 161/446/160 causal constraints (skipped 486 transitions) in 81 ms.
[2022-05-16 18:45:20] [INFO ] Added : 127 causal constraints over 27 iterations in 1384 ms. Result :sat
Minimization took 122 ms.
[2022-05-16 18:45:20] [INFO ] [Real]Absence check using 21 positive place invariants in 5 ms returned sat
[2022-05-16 18:45:20] [INFO ] [Real]Absence check using 21 positive and 2 generalized place invariants in 1 ms returned sat
[2022-05-16 18:45:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:45:20] [INFO ] [Real]Absence check using state equation in 99 ms returned sat
[2022-05-16 18:45:20] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 18:45:20] [INFO ] [Nat]Absence check using 21 positive place invariants in 5 ms returned sat
[2022-05-16 18:45:20] [INFO ] [Nat]Absence check using 21 positive and 2 generalized place invariants in 0 ms returned sat
[2022-05-16 18:45:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 18:45:20] [INFO ] [Nat]Absence check using state equation in 97 ms returned sat
[2022-05-16 18:45:21] [INFO ] [Nat]Added 468 Read/Feed constraints in 73 ms returned sat
[2022-05-16 18:45:21] [INFO ] Deduced a trap composed of 5 places in 13 ms of which 0 ms to minimize.
[2022-05-16 18:45:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 76 ms
[2022-05-16 18:45:21] [INFO ] Computed and/alt/rep : 161/446/160 causal constraints (skipped 486 transitions) in 85 ms.
[2022-05-16 18:45:22] [INFO ] Added : 132 causal constraints over 27 iterations in 1363 ms. Result :sat
Minimization took 124 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0]
Incomplete Parikh walk after 324600 steps, including 1000 resets, run finished after 1676 ms. (steps per millisecond=193 ) properties (out of 5) seen :4 could not realise parikh vector
FORMULA EnergyBus-PT-none-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA EnergyBus-PT-none-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA EnergyBus-PT-none-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA EnergyBus-PT-none-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 260800 steps, including 1000 resets, run finished after 4231 ms. (steps per millisecond=61 ) properties (out of 1) seen :0 could not realise parikh vector
Incomplete Parikh walk after 266700 steps, including 1000 resets, run finished after 4466 ms. (steps per millisecond=59 ) properties (out of 1) seen :0 could not realise parikh vector
Incomplete Parikh walk after 478300 steps, including 1000 resets, run finished after 1395 ms. (steps per millisecond=342 ) properties (out of 1) seen :0 could not realise parikh vector
Incomplete Parikh walk after 485700 steps, including 1000 resets, run finished after 1797 ms. (steps per millisecond=270 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 153 places. Attempting structural reductions.
Drop transitions removed 2 transitions
Starting structural reductions, iteration 0 : 153/153 places, 1911/1911 transitions.
Graph (trivial) has 137 edges and 153 vertex of which 17 / 153 are part of one of the 6 SCC in 9 ms
Free SCC test removed 11 places
Drop transitions removed 29 transitions
Ensure Unique test removed 1038 transitions
Reduce isomorphic transitions removed 1067 transitions.
Graph (complete) has 749 edges and 142 vertex of which 138 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.11 ms
Discarding 4 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions 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 835
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 832
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 823
Deduced a syphon composed of 9 places in 2 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 823
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 55 place count 103 transition count 520
Iterating global reduction 2 with 22 rules applied. Total rules applied 77 place count 103 transition count 520
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 490
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 125 place count 94 transition count 481
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 3 with 27 rules applied. Total rules applied 152 place count 94 transition count 454
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 153 place count 93 transition count 452
Iterating global reduction 4 with 1 rules applied. Total rules applied 154 place count 93 transition count 452
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 170 place count 85 transition count 477
Drop transitions 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 178 place count 85 transition count 469
Drop transitions removed 40 transitions
Redundant transition composition rules discarded 40 transitions
Iterating global reduction 5 with 40 rules applied. Total rules applied 218 place count 85 transition count 429
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 5 Pre rules applied. Total rules applied 218 place count 85 transition count 424
Deduced a syphon composed of 5 places in 1 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 232 place count 76 transition count 424
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 244 place count 70 transition count 418
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 24 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 246 place count 69 transition count 417
Drop transitions 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 416 place count 69 transition count 247
Ensure Unique test removed 1 places
Iterating post reduction 7 with 1 rules applied. Total rules applied 417 place count 68 transition count 247
Drop transitions removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 8 with 15 rules applied. Total rules applied 432 place count 68 transition count 232
Free-agglomeration rule applied 10 times.
Iterating global reduction 8 with 10 rules applied. Total rules applied 442 place count 68 transition count 222
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 8 with 10 rules applied. Total rules applied 452 place count 58 transition count 222
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 9 with 1 rules applied. Total rules applied 453 place count 58 transition count 232
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 9 with 7 rules applied. Total rules applied 460 place count 57 transition count 226
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 10 with 6 rules applied. Total rules applied 466 place count 57 transition count 220
Applied a total of 466 rules in 259 ms. Remains 57 /153 variables (removed 96) and now considering 220/1911 (removed 1691) transitions.
Finished structural reductions, in 1 iterations. Remains : 57/153 places, 220/1911 transitions.
Normalized transition count is 131 out of 220 initially.
// Phase 1: matrix 131 rows 57 cols
[2022-05-16 18:45:36] [INFO ] Computed 17 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1002 ms. (steps per millisecond=998 ) properties (out of 1) seen :1
FORMULA EnergyBus-PT-none-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.

BK_STOP 1652726738537

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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="gold2021"
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-4028"
echo " Executing tool gold2021"
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 r089-tall-165260117700169"
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.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 ;