fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r191-tall-167838876100017
Last Updated
May 14, 2023

About the Execution of 2022-gold for EnergyBus-PT-none

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
551.871 22285.00 36909.00 183.10 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.5M
-rw-r--r-- 1 mcc users 6.7K Feb 26 15:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Feb 26 15:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 26 15:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 26 15:49 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 16:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.8K Feb 26 15:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 64K Feb 26 15:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Feb 26 15:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 26 15:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 3.2M Mar 5 18:22 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 1678564022021

Running Version 202205111006
[2023-03-11 19:47:03] [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]
[2023-03-11 19:47:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 19:47:03] [INFO ] Load time of PNML (sax parser for PT used): 385 ms
[2023-03-11 19:47:03] [INFO ] Transformed 157 places.
[2023-03-11 19:47:03] [INFO ] Transformed 4430 transitions.
[2023-03-11 19:47:03] [INFO ] Found NUPN structural information;
[2023-03-11 19:47:03] [INFO ] Parsed PT model containing 157 places and 4430 transitions in 533 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Deduced a syphon composed of 4 places in 27 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-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 647 out of 1913 initially.
// Phase 1: matrix 647 rows 153 cols
[2023-03-11 19:47:04] [INFO ] Computed 23 place invariants in 26 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 204 ms. (steps per millisecond=49 ) properties (out of 15) seen :10
FORMULA EnergyBus-PT-none-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EnergyBus-PT-none-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EnergyBus-PT-none-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EnergyBus-PT-none-UpperBounds-11 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-07 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
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 5) seen :0
[2023-03-11 19:47:04] [INFO ] Flow matrix only has 647 transitions (discarded 1266 similar events)
// Phase 1: matrix 647 rows 153 cols
[2023-03-11 19:47:04] [INFO ] Computed 23 place invariants in 19 ms
[2023-03-11 19:47:04] [INFO ] [Real]Absence check using 21 positive place invariants in 8 ms returned sat
[2023-03-11 19:47:04] [INFO ] [Real]Absence check using 21 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-11 19:47:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 19:47:04] [INFO ] [Real]Absence check using state equation in 147 ms returned sat
[2023-03-11 19:47:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 19:47:04] [INFO ] [Nat]Absence check using 21 positive place invariants in 7 ms returned sat
[2023-03-11 19:47:04] [INFO ] [Nat]Absence check using 21 positive and 2 generalized place invariants in 0 ms returned sat
[2023-03-11 19:47:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 19:47:04] [INFO ] [Nat]Absence check using state equation in 110 ms returned sat
[2023-03-11 19:47:04] [INFO ] State equation strengthened by 463 read => feed constraints.
[2023-03-11 19:47:05] [INFO ] [Nat]Added 463 Read/Feed constraints in 56 ms returned sat
[2023-03-11 19:47:05] [INFO ] Computed and/alt/rep : 161/446/160 causal constraints (skipped 486 transitions) in 147 ms.
[2023-03-11 19:47:06] [INFO ] Added : 104 causal constraints over 22 iterations in 1197 ms. Result :sat
Minimization took 100 ms.
[2023-03-11 19:47:06] [INFO ] [Real]Absence check using 21 positive place invariants in 5 ms returned sat
[2023-03-11 19:47:06] [INFO ] [Real]Absence check using 21 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-11 19:47:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 19:47:06] [INFO ] [Real]Absence check using state equation in 115 ms returned sat
[2023-03-11 19:47:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 19:47:06] [INFO ] [Nat]Absence check using 21 positive place invariants in 5 ms returned sat
[2023-03-11 19:47:06] [INFO ] [Nat]Absence check using 21 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-11 19:47:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 19:47:06] [INFO ] [Nat]Absence check using state equation in 108 ms returned sat
[2023-03-11 19:47:06] [INFO ] [Nat]Added 463 Read/Feed constraints in 57 ms returned sat
[2023-03-11 19:47:07] [INFO ] Deduced a trap composed of 32 places in 204 ms of which 4 ms to minimize.
[2023-03-11 19:47:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 264 ms
[2023-03-11 19:47:07] [INFO ] Computed and/alt/rep : 161/446/160 causal constraints (skipped 486 transitions) in 297 ms.
[2023-03-11 19:47:08] [INFO ] Added : 112 causal constraints over 23 iterations in 1186 ms. Result :sat
Minimization took 134 ms.
[2023-03-11 19:47:08] [INFO ] [Real]Absence check using 21 positive place invariants in 4 ms returned sat
[2023-03-11 19:47:08] [INFO ] [Real]Absence check using 21 positive and 2 generalized place invariants in 0 ms returned sat
[2023-03-11 19:47:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 19:47:08] [INFO ] [Real]Absence check using state equation in 115 ms returned sat
[2023-03-11 19:47:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 19:47:08] [INFO ] [Nat]Absence check using 21 positive place invariants in 5 ms returned sat
[2023-03-11 19:47:08] [INFO ] [Nat]Absence check using 21 positive and 2 generalized place invariants in 0 ms returned sat
[2023-03-11 19:47:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 19:47:08] [INFO ] [Nat]Absence check using state equation in 117 ms returned sat
[2023-03-11 19:47:08] [INFO ] [Nat]Added 463 Read/Feed constraints in 56 ms returned sat
[2023-03-11 19:47:09] [INFO ] Deduced a trap composed of 10 places in 189 ms of which 1 ms to minimize.
[2023-03-11 19:47:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 241 ms
[2023-03-11 19:47:09] [INFO ] Computed and/alt/rep : 161/446/160 causal constraints (skipped 486 transitions) in 91 ms.
[2023-03-11 19:47:10] [INFO ] Deduced a trap composed of 17 places in 301 ms of which 1 ms to minimize.
[2023-03-11 19:47:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 366 ms
[2023-03-11 19:47:10] [INFO ] Added : 113 causal constraints over 23 iterations in 1410 ms. Result :sat
Minimization took 126 ms.
[2023-03-11 19:47:10] [INFO ] [Real]Absence check using 21 positive place invariants in 5 ms returned sat
[2023-03-11 19:47:10] [INFO ] [Real]Absence check using 21 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-11 19:47:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 19:47:10] [INFO ] [Real]Absence check using state equation in 132 ms returned sat
[2023-03-11 19:47:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 19:47:10] [INFO ] [Nat]Absence check using 21 positive place invariants in 5 ms returned sat
[2023-03-11 19:47:10] [INFO ] [Nat]Absence check using 21 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-11 19:47:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 19:47:11] [INFO ] [Nat]Absence check using state equation in 106 ms returned sat
[2023-03-11 19:47:11] [INFO ] [Nat]Added 463 Read/Feed constraints in 60 ms returned sat
[2023-03-11 19:47:11] [INFO ] Deduced a trap composed of 10 places in 128 ms of which 1 ms to minimize.
[2023-03-11 19:47:11] [INFO ] Deduced a trap composed of 32 places in 161 ms of which 1 ms to minimize.
[2023-03-11 19:47:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 383 ms
[2023-03-11 19:47:11] [INFO ] Computed and/alt/rep : 161/446/160 causal constraints (skipped 486 transitions) in 153 ms.
[2023-03-11 19:47:12] [INFO ] Added : 132 causal constraints over 27 iterations in 1318 ms. Result :sat
Minimization took 179 ms.
[2023-03-11 19:47:13] [INFO ] [Real]Absence check using 21 positive place invariants in 4 ms returned sat
[2023-03-11 19:47:13] [INFO ] [Real]Absence check using 21 positive and 2 generalized place invariants in 0 ms returned sat
[2023-03-11 19:47:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 19:47:13] [INFO ] [Real]Absence check using state equation in 109 ms returned sat
[2023-03-11 19:47:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 19:47:13] [INFO ] [Nat]Absence check using 21 positive place invariants in 7 ms returned sat
[2023-03-11 19:47:13] [INFO ] [Nat]Absence check using 21 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-11 19:47:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 19:47:13] [INFO ] [Nat]Absence check using state equation in 108 ms returned sat
[2023-03-11 19:47:13] [INFO ] [Nat]Added 463 Read/Feed constraints in 63 ms returned sat
[2023-03-11 19:47:13] [INFO ] Deduced a trap composed of 9 places in 231 ms of which 1 ms to minimize.
[2023-03-11 19:47:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 286 ms
[2023-03-11 19:47:13] [INFO ] Computed and/alt/rep : 161/446/160 causal constraints (skipped 486 transitions) in 91 ms.
[2023-03-11 19:47:14] [INFO ] Added : 107 causal constraints over 22 iterations in 1024 ms. Result :sat
Minimization took 111 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0]
Support contains 5 out of 153 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 153/153 places, 1913/1913 transitions.
Graph (trivial) has 132 edges and 153 vertex of which 17 / 153 are part of one of the 6 SCC in 3 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 751 edges and 142 vertex of which 138 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.14 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 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 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 825
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 53 place count 105 transition count 572
Iterating global reduction 2 with 20 rules applied. Total rules applied 73 place count 105 transition count 572
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 2 with 30 rules applied. Total rules applied 103 place count 105 transition count 542
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 119 place count 97 transition count 534
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 3 with 27 rules applied. Total rules applied 146 place count 97 transition count 507
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 147 place count 96 transition count 505
Iterating global reduction 4 with 1 rules applied. Total rules applied 148 place count 96 transition count 505
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 164 place count 88 transition count 530
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 172 place count 88 transition count 522
Drop transitions removed 41 transitions
Redundant transition composition rules discarded 41 transitions
Iterating global reduction 5 with 41 rules applied. Total rules applied 213 place count 88 transition count 481
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 5 Pre rules applied. Total rules applied 213 place count 88 transition count 476
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 227 place count 79 transition count 476
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 241 place count 72 transition count 469
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 22 edges and 72 vertex of which 2 / 72 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 243 place count 71 transition count 468
Drop transitions removed 2 transitions
Ensure Unique test removed 192 transitions
Reduce isomorphic transitions removed 194 transitions.
Iterating post reduction 6 with 194 rules applied. Total rules applied 437 place count 71 transition count 274
Ensure Unique test removed 1 places
Iterating post reduction 7 with 1 rules applied. Total rules applied 438 place count 70 transition count 274
Drop transitions removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 8 with 15 rules applied. Total rules applied 453 place count 70 transition count 259
Free-agglomeration rule applied 8 times.
Iterating global reduction 8 with 8 rules applied. Total rules applied 461 place count 70 transition count 251
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 8 with 8 rules applied. Total rules applied 469 place count 62 transition count 251
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 9 with 1 rules applied. Total rules applied 470 place count 62 transition count 261
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 477 place count 61 transition count 255
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 10 with 6 rules applied. Total rules applied 483 place count 61 transition count 249
Applied a total of 483 rules in 265 ms. Remains 61 /153 variables (removed 92) and now considering 249/1913 (removed 1664) transitions.
Finished structural reductions, in 1 iterations. Remains : 61/153 places, 249/1913 transitions.
Normalized transition count is 150 out of 249 initially.
// Phase 1: matrix 150 rows 61 cols
[2023-03-11 19:47:16] [INFO ] Computed 17 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1207 ms. (steps per millisecond=828 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 486 ms. (steps per millisecond=2057 ) properties (out of 5) seen :3
FORMULA EnergyBus-PT-none-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EnergyBus-PT-none-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EnergyBus-PT-none-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 444 ms. (steps per millisecond=2252 ) properties (out of 2) seen :1
FORMULA EnergyBus-PT-none-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2023-03-11 19:47:18] [INFO ] Flow matrix only has 150 transitions (discarded 99 similar events)
// Phase 1: matrix 150 rows 61 cols
[2023-03-11 19:47:18] [INFO ] Computed 17 place invariants in 2 ms
[2023-03-11 19:47:19] [INFO ] [Real]Absence check using 17 positive place invariants in 3 ms returned sat
[2023-03-11 19:47:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 19:47:19] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2023-03-11 19:47:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 19:47:19] [INFO ] [Nat]Absence check using 17 positive place invariants in 5 ms returned sat
[2023-03-11 19:47:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 19:47:19] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2023-03-11 19:47:19] [INFO ] State equation strengthened by 111 read => feed constraints.
[2023-03-11 19:47:19] [INFO ] [Nat]Added 111 Read/Feed constraints in 13 ms returned sat
[2023-03-11 19:47:19] [INFO ] Computed and/alt/rep : 45/202/43 causal constraints (skipped 105 transitions) in 11 ms.
[2023-03-11 19:47:19] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 0 ms to minimize.
[2023-03-11 19:47:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 44 ms
[2023-03-11 19:47:19] [INFO ] Added : 25 causal constraints over 7 iterations in 136 ms. Result :sat
Minimization took 25 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 61 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 61/61 places, 249/249 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 59 transition count 223
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 59 transition count 223
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 59 transition count 221
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 10 place count 57 transition count 219
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 12 place count 57 transition count 217
Applied a total of 12 rules in 28 ms. Remains 57 /61 variables (removed 4) and now considering 217/249 (removed 32) transitions.
Finished structural reductions, in 1 iterations. Remains : 57/61 places, 217/249 transitions.
Normalized transition count is 113 out of 217 initially.
// Phase 1: matrix 113 rows 57 cols
[2023-03-11 19:47:19] [INFO ] Computed 17 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1106 ms. (steps per millisecond=904 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 442 ms. (steps per millisecond=2262 ) properties (out of 1) seen :0
[2023-03-11 19:47:20] [INFO ] Flow matrix only has 113 transitions (discarded 104 similar events)
// Phase 1: matrix 113 rows 57 cols
[2023-03-11 19:47:20] [INFO ] Computed 17 place invariants in 6 ms
[2023-03-11 19:47:20] [INFO ] [Real]Absence check using 17 positive place invariants in 3 ms returned sat
[2023-03-11 19:47:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 19:47:20] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-11 19:47:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 19:47:20] [INFO ] [Nat]Absence check using 17 positive place invariants in 3 ms returned sat
[2023-03-11 19:47:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 19:47:21] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2023-03-11 19:47:21] [INFO ] State equation strengthened by 79 read => feed constraints.
[2023-03-11 19:47:21] [INFO ] [Nat]Added 79 Read/Feed constraints in 16 ms returned sat
[2023-03-11 19:47:21] [INFO ] Computed and/alt/rep : 39/169/39 causal constraints (skipped 72 transitions) in 8 ms.
[2023-03-11 19:47:21] [INFO ] Added : 15 causal constraints over 4 iterations in 44 ms. Result :sat
Minimization took 16 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 57 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 57/57 places, 217/217 transitions.
Applied a total of 0 rules in 6 ms. Remains 57 /57 variables (removed 0) and now considering 217/217 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 57/57 places, 217/217 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 57/57 places, 217/217 transitions.
Applied a total of 0 rules in 6 ms. Remains 57 /57 variables (removed 0) and now considering 217/217 (removed 0) transitions.
[2023-03-11 19:47:21] [INFO ] Flow matrix only has 113 transitions (discarded 104 similar events)
// Phase 1: matrix 113 rows 57 cols
[2023-03-11 19:47:21] [INFO ] Computed 17 place invariants in 3 ms
[2023-03-11 19:47:21] [INFO ] Implicit Places using invariants in 169 ms returned [3, 4, 5, 19, 45]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 172 ms to find 5 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 52/57 places, 217/217 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 52 transition count 216
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 51 transition count 216
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 51 transition count 215
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 50 transition count 215
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 14 place count 45 transition count 210
Drop transitions removed 37 transitions
Redundant transition composition rules discarded 37 transitions
Iterating global reduction 2 with 37 rules applied. Total rules applied 51 place count 45 transition count 173
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 53 place count 45 transition count 171
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 55 place count 43 transition count 171
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 61 place count 43 transition count 171
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 65 place count 43 transition count 167
Applied a total of 65 rules in 23 ms. Remains 43 /52 variables (removed 9) and now considering 167/217 (removed 50) transitions.
[2023-03-11 19:47:21] [INFO ] Flow matrix only has 81 transitions (discarded 86 similar events)
// Phase 1: matrix 81 rows 43 cols
[2023-03-11 19:47:21] [INFO ] Computed 12 place invariants in 1 ms
[2023-03-11 19:47:21] [INFO ] Implicit Places using invariants in 73 ms returned [28, 33]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 74 ms to find 2 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 41/57 places, 167/217 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 38 transition count 164
Applied a total of 6 rules in 6 ms. Remains 38 /41 variables (removed 3) and now considering 164/167 (removed 3) transitions.
[2023-03-11 19:47:21] [INFO ] Flow matrix only has 78 transitions (discarded 86 similar events)
// Phase 1: matrix 78 rows 38 cols
[2023-03-11 19:47:21] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-11 19:47:21] [INFO ] Implicit Places using invariants in 43 ms returned []
[2023-03-11 19:47:21] [INFO ] Flow matrix only has 78 transitions (discarded 86 similar events)
// Phase 1: matrix 78 rows 38 cols
[2023-03-11 19:47:21] [INFO ] Computed 10 place invariants in 0 ms
[2023-03-11 19:47:21] [INFO ] State equation strengthened by 39 read => feed constraints.
[2023-03-11 19:47:21] [INFO ] Implicit Places using invariants and state equation in 73 ms returned [7, 30]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 120 ms to find 2 implicit places.
Starting structural reductions in SAFETY mode, iteration 3 : 36/57 places, 164/217 transitions.
Applied a total of 0 rules in 3 ms. Remains 36 /36 variables (removed 0) and now considering 164/164 (removed 0) transitions.
Finished structural reductions, in 4 iterations. Remains : 36/57 places, 164/217 transitions.
Normalized transition count is 78 out of 164 initially.
// Phase 1: matrix 78 rows 36 cols
[2023-03-11 19:47:21] [INFO ] Computed 8 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 838 ms. (steps per millisecond=1193 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 319 ms. (steps per millisecond=3134 ) properties (out of 1) seen :0
[2023-03-11 19:47:22] [INFO ] Flow matrix only has 78 transitions (discarded 86 similar events)
// Phase 1: matrix 78 rows 36 cols
[2023-03-11 19:47:22] [INFO ] Computed 8 place invariants in 1 ms
[2023-03-11 19:47:22] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-11 19:47:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 19:47:22] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2023-03-11 19:47:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 19:47:22] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-11 19:47:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 19:47:22] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2023-03-11 19:47:22] [INFO ] State equation strengthened by 39 read => feed constraints.
[2023-03-11 19:47:22] [INFO ] [Nat]Added 39 Read/Feed constraints in 4 ms returned sat
[2023-03-11 19:47:22] [INFO ] Computed and/alt/rep : 38/209/38 causal constraints (skipped 38 transitions) in 6 ms.
[2023-03-11 19:47:22] [INFO ] Added : 23 causal constraints over 5 iterations in 37 ms. Result :sat
Minimization took 17 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 36 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 36/36 places, 164/164 transitions.
Applied a total of 0 rules in 2 ms. Remains 36 /36 variables (removed 0) and now considering 164/164 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 36/36 places, 164/164 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 36/36 places, 164/164 transitions.
Applied a total of 0 rules in 3 ms. Remains 36 /36 variables (removed 0) and now considering 164/164 (removed 0) transitions.
[2023-03-11 19:47:22] [INFO ] Flow matrix only has 78 transitions (discarded 86 similar events)
// Phase 1: matrix 78 rows 36 cols
[2023-03-11 19:47:22] [INFO ] Computed 8 place invariants in 0 ms
[2023-03-11 19:47:22] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-03-11 19:47:22] [INFO ] Flow matrix only has 78 transitions (discarded 86 similar events)
// Phase 1: matrix 78 rows 36 cols
[2023-03-11 19:47:22] [INFO ] Computed 8 place invariants in 1 ms
[2023-03-11 19:47:22] [INFO ] State equation strengthened by 39 read => feed constraints.
[2023-03-11 19:47:22] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
[2023-03-11 19:47:22] [INFO ] Redundant transitions in 23 ms returned [108, 142, 143, 161, 163]
Found 5 redundant transitions using SMT.
Drop transitions removed 5 transitions
Redundant transitions reduction (with SMT) removed 5 transitions.
[2023-03-11 19:47:22] [INFO ] Flow matrix only has 75 transitions (discarded 84 similar events)
// Phase 1: matrix 75 rows 36 cols
[2023-03-11 19:47:22] [INFO ] Computed 8 place invariants in 1 ms
[2023-03-11 19:47:23] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Starting structural reductions in SAFETY mode, iteration 1 : 36/36 places, 159/164 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 35 transition count 158
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 35 transition count 157
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 35 transition count 156
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 5 place count 34 transition count 154
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 34 transition count 154
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 34 transition count 153
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 33 transition count 153
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 2 with 8 rules applied. Total rules applied 16 place count 33 transition count 145
Applied a total of 16 rules in 19 ms. Remains 33 /36 variables (removed 3) and now considering 145/159 (removed 14) transitions.
[2023-03-11 19:47:23] [INFO ] Flow matrix only has 68 transitions (discarded 77 similar events)
// Phase 1: matrix 68 rows 33 cols
[2023-03-11 19:47:23] [INFO ] Computed 8 place invariants in 0 ms
[2023-03-11 19:47:23] [INFO ] Implicit Places using invariants in 33 ms returned [10]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 34 ms to find 1 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 32/36 places, 145/164 transitions.
Applied a total of 0 rules in 7 ms. Remains 32 /32 variables (removed 0) and now considering 145/145 (removed 0) transitions.
Finished structural reductions, in 3 iterations. Remains : 32/36 places, 145/164 transitions.
Normalized transition count is 68 out of 145 initially.
// Phase 1: matrix 68 rows 32 cols
[2023-03-11 19:47:23] [INFO ] Computed 7 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 720 ms. (steps per millisecond=1388 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 274 ms. (steps per millisecond=3649 ) properties (out of 1) seen :0
[2023-03-11 19:47:24] [INFO ] Flow matrix only has 68 transitions (discarded 77 similar events)
// Phase 1: matrix 68 rows 32 cols
[2023-03-11 19:47:24] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-11 19:47:24] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2023-03-11 19:47:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 19:47:24] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2023-03-11 19:47:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 19:47:24] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2023-03-11 19:47:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 19:47:24] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2023-03-11 19:47:24] [INFO ] State equation strengthened by 34 read => feed constraints.
[2023-03-11 19:47:24] [INFO ] [Nat]Added 34 Read/Feed constraints in 4 ms returned sat
[2023-03-11 19:47:24] [INFO ] Computed and/alt/rep : 40/204/40 causal constraints (skipped 26 transitions) in 4 ms.
[2023-03-11 19:47:24] [INFO ] Added : 25 causal constraints over 6 iterations in 37 ms. Result :sat
Minimization took 15 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
FORMULA EnergyBus-PT-none-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.
Total runtime 20920 ms.

BK_STOP 1678564044306

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

+ export LANG=C
+ LANG=C
+ 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
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -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=@none -Xss128m -Xms40m -Xmx8192m

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="gold2022"
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-5348"
echo " Executing tool gold2022"
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 r191-tall-167838876100017"
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 ;