About the Execution of ITS-Tools for DES-PT-20a
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 470.027 | 51288.00 | 59014.00 | 6764.10 | 1 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/mcc2021-input.r064-tall-162038396700083.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is DES-PT-20a, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r064-tall-162038396700083
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 400K
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 99K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.8K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 98K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.0K Mar 28 15:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 28 15:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K Mar 28 15:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 15:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 23 03:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 23 03:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 22 12:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K Mar 22 12:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 4 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 57K May 5 16:51 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 DES-PT-20a-UpperBounds-00
FORMULA_NAME DES-PT-20a-UpperBounds-01
FORMULA_NAME DES-PT-20a-UpperBounds-02
FORMULA_NAME DES-PT-20a-UpperBounds-03
FORMULA_NAME DES-PT-20a-UpperBounds-04
FORMULA_NAME DES-PT-20a-UpperBounds-05
FORMULA_NAME DES-PT-20a-UpperBounds-06
FORMULA_NAME DES-PT-20a-UpperBounds-07
FORMULA_NAME DES-PT-20a-UpperBounds-08
FORMULA_NAME DES-PT-20a-UpperBounds-09
FORMULA_NAME DES-PT-20a-UpperBounds-10
FORMULA_NAME DES-PT-20a-UpperBounds-11
FORMULA_NAME DES-PT-20a-UpperBounds-12
FORMULA_NAME DES-PT-20a-UpperBounds-13
FORMULA_NAME DES-PT-20a-UpperBounds-14
FORMULA_NAME DES-PT-20a-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1620468920207
Running Version 0
[2021-05-08 10:15:27] [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]
[2021-05-08 10:15:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-08 10:15:27] [INFO ] Load time of PNML (sax parser for PT used): 52 ms
[2021-05-08 10:15:27] [INFO ] Transformed 195 places.
[2021-05-08 10:15:27] [INFO ] Transformed 152 transitions.
[2021-05-08 10:15:27] [INFO ] Found NUPN structural information;
[2021-05-08 10:15:27] [INFO ] Parsed PT model containing 195 places and 152 transitions in 93 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
// Phase 1: matrix 138 rows 195 cols
[2021-05-08 10:15:27] [INFO ] Computed 59 place invariants in 22 ms
Incomplete random walk after 10000 steps, including 228 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 16) seen :9
FORMULA DES-PT-20a-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20a-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20a-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20a-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20a-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20a-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20a-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20a-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20a-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 43 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 52 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 7) seen :0
// Phase 1: matrix 138 rows 195 cols
[2021-05-08 10:15:27] [INFO ] Computed 59 place invariants in 6 ms
[2021-05-08 10:15:27] [INFO ] [Real]Absence check using 34 positive place invariants in 14 ms returned sat
[2021-05-08 10:15:27] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 9 ms returned sat
[2021-05-08 10:15:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 10:15:27] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2021-05-08 10:15:27] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 10:15:28] [INFO ] [Nat]Absence check using 34 positive place invariants in 8 ms returned sat
[2021-05-08 10:15:28] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 43 ms returned sat
[2021-05-08 10:15:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 10:15:28] [INFO ] [Nat]Absence check using state equation in 141 ms returned sat
[2021-05-08 10:15:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-08 10:15:28] [INFO ] [Nat]Added 1 Read/Feed constraints in 6 ms returned sat
[2021-05-08 10:15:28] [INFO ] Computed and/alt/rep : 130/393/130 causal constraints (skipped 7 transitions) in 12 ms.
[2021-05-08 10:15:28] [INFO ] Added : 65 causal constraints over 14 iterations in 280 ms. Result :sat
Minimization took 60 ms.
[2021-05-08 10:15:28] [INFO ] [Real]Absence check using 34 positive place invariants in 7 ms returned sat
[2021-05-08 10:15:28] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 7 ms returned sat
[2021-05-08 10:15:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 10:15:28] [INFO ] [Real]Absence check using state equation in 62 ms returned sat
[2021-05-08 10:15:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 10:15:28] [INFO ] [Nat]Absence check using 34 positive place invariants in 26 ms returned sat
[2021-05-08 10:15:28] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 25 ms returned sat
[2021-05-08 10:15:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 10:15:28] [INFO ] [Nat]Absence check using state equation in 104 ms returned sat
[2021-05-08 10:15:28] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2021-05-08 10:15:28] [INFO ] Computed and/alt/rep : 130/393/130 causal constraints (skipped 7 transitions) in 18 ms.
[2021-05-08 10:15:29] [INFO ] Added : 57 causal constraints over 12 iterations in 166 ms. Result :sat
Minimization took 64 ms.
[2021-05-08 10:15:29] [INFO ] [Real]Absence check using 34 positive place invariants in 7 ms returned sat
[2021-05-08 10:15:29] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 8 ms returned sat
[2021-05-08 10:15:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 10:15:29] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2021-05-08 10:15:29] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 10:15:29] [INFO ] [Nat]Absence check using 34 positive place invariants in 8 ms returned sat
[2021-05-08 10:15:29] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 24 ms returned sat
[2021-05-08 10:15:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 10:15:29] [INFO ] [Nat]Absence check using state equation in 110 ms returned sat
[2021-05-08 10:15:29] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2021-05-08 10:15:29] [INFO ] Computed and/alt/rep : 130/393/130 causal constraints (skipped 7 transitions) in 13 ms.
[2021-05-08 10:15:29] [INFO ] Added : 57 causal constraints over 12 iterations in 155 ms. Result :sat
Minimization took 64 ms.
[2021-05-08 10:15:29] [INFO ] [Real]Absence check using 34 positive place invariants in 7 ms returned sat
[2021-05-08 10:15:29] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 8 ms returned sat
[2021-05-08 10:15:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 10:15:29] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2021-05-08 10:15:29] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 10:15:29] [INFO ] [Nat]Absence check using 34 positive place invariants in 7 ms returned sat
[2021-05-08 10:15:29] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 21 ms returned sat
[2021-05-08 10:15:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 10:15:30] [INFO ] [Nat]Absence check using state equation in 122 ms returned sat
[2021-05-08 10:15:30] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2021-05-08 10:15:30] [INFO ] Computed and/alt/rep : 130/393/130 causal constraints (skipped 7 transitions) in 9 ms.
[2021-05-08 10:15:30] [INFO ] Added : 103 causal constraints over 22 iterations in 329 ms. Result :sat
Minimization took 58 ms.
[2021-05-08 10:15:30] [INFO ] [Real]Absence check using 34 positive place invariants in 7 ms returned sat
[2021-05-08 10:15:30] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 8 ms returned sat
[2021-05-08 10:15:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 10:15:30] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2021-05-08 10:15:30] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 10:15:30] [INFO ] [Nat]Absence check using 34 positive place invariants in 7 ms returned sat
[2021-05-08 10:15:30] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 24 ms returned sat
[2021-05-08 10:15:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 10:15:30] [INFO ] [Nat]Absence check using state equation in 115 ms returned sat
[2021-05-08 10:15:30] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2021-05-08 10:15:30] [INFO ] Computed and/alt/rep : 130/393/130 causal constraints (skipped 7 transitions) in 10 ms.
[2021-05-08 10:15:30] [INFO ] Added : 63 causal constraints over 13 iterations in 174 ms. Result :sat
Minimization took 78 ms.
[2021-05-08 10:15:31] [INFO ] [Real]Absence check using 34 positive place invariants in 6 ms returned sat
[2021-05-08 10:15:31] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 7 ms returned sat
[2021-05-08 10:15:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 10:15:31] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2021-05-08 10:15:31] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 10:15:31] [INFO ] [Nat]Absence check using 34 positive place invariants in 7 ms returned sat
[2021-05-08 10:15:31] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 36 ms returned sat
[2021-05-08 10:15:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 10:15:31] [INFO ] [Nat]Absence check using state equation in 157 ms returned sat
[2021-05-08 10:15:31] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2021-05-08 10:15:31] [INFO ] Computed and/alt/rep : 130/393/130 causal constraints (skipped 7 transitions) in 10 ms.
[2021-05-08 10:15:31] [INFO ] Added : 107 causal constraints over 22 iterations in 310 ms. Result :sat
Minimization took 65 ms.
[2021-05-08 10:15:31] [INFO ] [Real]Absence check using 34 positive place invariants in 9 ms returned sat
[2021-05-08 10:15:31] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 7 ms returned sat
[2021-05-08 10:15:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 10:15:31] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2021-05-08 10:15:31] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 10:15:31] [INFO ] [Nat]Absence check using 34 positive place invariants in 7 ms returned sat
[2021-05-08 10:15:31] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 25 ms returned sat
[2021-05-08 10:15:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 10:15:32] [INFO ] [Nat]Absence check using state equation in 119 ms returned sat
[2021-05-08 10:15:32] [INFO ] [Nat]Added 1 Read/Feed constraints in 9 ms returned sat
[2021-05-08 10:15:32] [INFO ] Computed and/alt/rep : 130/393/130 causal constraints (skipped 7 transitions) in 10 ms.
[2021-05-08 10:15:32] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 4 ms to minimize.
[2021-05-08 10:15:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 58 ms
[2021-05-08 10:15:32] [INFO ] Added : 60 causal constraints over 12 iterations in 229 ms. Result :sat
Minimization took 45 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Parikh walk after 32100 steps, including 1294 resets, run finished after 138 ms. (steps per millisecond=232 ) properties (out of 7) seen :2 could not realise parikh vector
FORMULA DES-PT-20a-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DES-PT-20a-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 82700 steps, including 1751 resets, run finished after 276 ms. (steps per millisecond=299 ) properties (out of 5) seen :1 could not realise parikh vector
FORMULA DES-PT-20a-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 59400 steps, including 888 resets, run finished after 186 ms. (steps per millisecond=319 ) properties (out of 4) seen :0 could not realise parikh vector
Incomplete Parikh walk after 69600 steps, including 1416 resets, run finished after 209 ms. (steps per millisecond=333 ) properties (out of 4) seen :0 could not realise parikh vector
Incomplete Parikh walk after 26800 steps, including 1125 resets, run finished after 80 ms. (steps per millisecond=335 ) properties (out of 4) seen :0 could not realise parikh vector
Incomplete Parikh walk after 26800 steps, including 1169 resets, run finished after 79 ms. (steps per millisecond=339 ) properties (out of 4) seen :0 could not realise parikh vector
Incomplete Parikh walk after 32600 steps, including 1267 resets, run finished after 94 ms. (steps per millisecond=346 ) properties (out of 4) seen :0 could not realise parikh vector
Support contains 4 out of 195 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 195/195 places, 138/138 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 195 transition count 136
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 194 transition count 135
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 194 transition count 135
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 10 place count 194 transition count 135
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 193 transition count 134
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 12 place count 192 transition count 134
Applied a total of 12 rules in 68 ms. Remains 192 /195 variables (removed 3) and now considering 134/138 (removed 4) transitions.
Finished structural reductions, in 1 iterations. Remains : 192/195 places, 134/138 transitions.
// Phase 1: matrix 134 rows 192 cols
[2021-05-08 10:15:33] [INFO ] Computed 60 place invariants in 5 ms
Incomplete random walk after 1000000 steps, including 13699 resets, run finished after 2920 ms. (steps per millisecond=342 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2240 resets, run finished after 1106 ms. (steps per millisecond=904 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2288 resets, run finished after 1115 ms. (steps per millisecond=896 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2282 resets, run finished after 1116 ms. (steps per millisecond=896 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2253 resets, run finished after 1099 ms. (steps per millisecond=909 ) properties (out of 4) seen :0
// Phase 1: matrix 134 rows 192 cols
[2021-05-08 10:15:40] [INFO ] Computed 60 place invariants in 8 ms
[2021-05-08 10:15:40] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2021-05-08 10:15:40] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 11 ms returned sat
[2021-05-08 10:15:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 10:15:40] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2021-05-08 10:15:40] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 10:15:40] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2021-05-08 10:15:41] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 50 ms returned sat
[2021-05-08 10:15:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 10:15:41] [INFO ] [Nat]Absence check using state equation in 91 ms returned sat
[2021-05-08 10:15:41] [INFO ] State equation strengthened by 2 read => feed constraints.
[2021-05-08 10:15:41] [INFO ] [Nat]Added 2 Read/Feed constraints in 8 ms returned sat
[2021-05-08 10:15:41] [INFO ] Computed and/alt/rep : 125/233/125 causal constraints (skipped 6 transitions) in 9 ms.
[2021-05-08 10:15:41] [INFO ] Added : 96 causal constraints over 20 iterations in 203 ms. Result :sat
Minimization took 36 ms.
[2021-05-08 10:15:41] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2021-05-08 10:15:41] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 7 ms returned sat
[2021-05-08 10:15:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 10:15:41] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2021-05-08 10:15:41] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 10:15:41] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2021-05-08 10:15:41] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 68 ms returned sat
[2021-05-08 10:15:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 10:15:41] [INFO ] [Nat]Absence check using state equation in 83 ms returned sat
[2021-05-08 10:15:41] [INFO ] [Nat]Added 2 Read/Feed constraints in 2 ms returned sat
[2021-05-08 10:15:41] [INFO ] Computed and/alt/rep : 125/233/125 causal constraints (skipped 6 transitions) in 9 ms.
[2021-05-08 10:15:41] [INFO ] Added : 65 causal constraints over 14 iterations in 166 ms. Result :sat
Minimization took 30 ms.
[2021-05-08 10:15:41] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2021-05-08 10:15:41] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 8 ms returned sat
[2021-05-08 10:15:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 10:15:41] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2021-05-08 10:15:41] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 10:15:42] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2021-05-08 10:15:42] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 52 ms returned sat
[2021-05-08 10:15:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 10:15:42] [INFO ] [Nat]Absence check using state equation in 114 ms returned sat
[2021-05-08 10:15:42] [INFO ] [Nat]Added 2 Read/Feed constraints in 7 ms returned sat
[2021-05-08 10:15:42] [INFO ] Computed and/alt/rep : 125/233/125 causal constraints (skipped 6 transitions) in 8 ms.
[2021-05-08 10:15:42] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 1 ms to minimize.
[2021-05-08 10:15:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 49 ms
[2021-05-08 10:15:42] [INFO ] Added : 108 causal constraints over 23 iterations in 292 ms. Result :sat
Minimization took 36 ms.
[2021-05-08 10:15:42] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2021-05-08 10:15:42] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 8 ms returned sat
[2021-05-08 10:15:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 10:15:42] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2021-05-08 10:15:42] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 10:15:42] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2021-05-08 10:15:42] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 69 ms returned sat
[2021-05-08 10:15:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 10:15:42] [INFO ] [Nat]Absence check using state equation in 80 ms returned sat
[2021-05-08 10:15:42] [INFO ] [Nat]Added 2 Read/Feed constraints in 2 ms returned sat
[2021-05-08 10:15:42] [INFO ] Computed and/alt/rep : 125/233/125 causal constraints (skipped 6 transitions) in 9 ms.
[2021-05-08 10:15:42] [INFO ] Added : 61 causal constraints over 13 iterations in 145 ms. Result :sat
Minimization took 30 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1] Max seen :[0, 0, 0, 0]
Incomplete Parikh walk after 34900 steps, including 660 resets, run finished after 105 ms. (steps per millisecond=332 ) properties (out of 4) seen :0 could not realise parikh vector
Incomplete Parikh walk after 85200 steps, including 1370 resets, run finished after 255 ms. (steps per millisecond=334 ) properties (out of 4) seen :0 could not realise parikh vector
Incomplete Parikh walk after 49000 steps, including 897 resets, run finished after 147 ms. (steps per millisecond=333 ) properties (out of 4) seen :0 could not realise parikh vector
Incomplete Parikh walk after 71800 steps, including 1051 resets, run finished after 220 ms. (steps per millisecond=326 ) properties (out of 4) seen :0 could not realise parikh vector
Support contains 4 out of 192 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 192/192 places, 134/134 transitions.
Applied a total of 0 rules in 12 ms. Remains 192 /192 variables (removed 0) and now considering 134/134 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 192/192 places, 134/134 transitions.
Starting structural reductions, iteration 0 : 192/192 places, 134/134 transitions.
Applied a total of 0 rules in 7 ms. Remains 192 /192 variables (removed 0) and now considering 134/134 (removed 0) transitions.
// Phase 1: matrix 134 rows 192 cols
[2021-05-08 10:15:43] [INFO ] Computed 60 place invariants in 3 ms
[2021-05-08 10:15:43] [INFO ] Implicit Places using invariants in 99 ms returned []
// Phase 1: matrix 134 rows 192 cols
[2021-05-08 10:15:43] [INFO ] Computed 60 place invariants in 3 ms
[2021-05-08 10:15:43] [INFO ] State equation strengthened by 2 read => feed constraints.
[2021-05-08 10:15:44] [INFO ] Implicit Places using invariants and state equation in 217 ms returned []
Implicit Place search using SMT with State Equation took 319 ms to find 0 implicit places.
[2021-05-08 10:15:44] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 134 rows 192 cols
[2021-05-08 10:15:44] [INFO ] Computed 60 place invariants in 3 ms
[2021-05-08 10:15:44] [INFO ] Dead Transitions using invariants and state equation in 76 ms returned []
Finished structural reductions, in 1 iterations. Remains : 192/192 places, 134/134 transitions.
Starting property specific reduction for DES-PT-20a-UpperBounds-09
// Phase 1: matrix 134 rows 192 cols
[2021-05-08 10:15:44] [INFO ] Computed 60 place invariants in 4 ms
Incomplete random walk after 10000 steps, including 131 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
// Phase 1: matrix 134 rows 192 cols
[2021-05-08 10:15:44] [INFO ] Computed 60 place invariants in 3 ms
[2021-05-08 10:15:44] [INFO ] [Real]Absence check using 35 positive place invariants in 7 ms returned sat
[2021-05-08 10:15:44] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 8 ms returned sat
[2021-05-08 10:15:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 10:15:44] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2021-05-08 10:15:44] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 10:15:44] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2021-05-08 10:15:44] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 50 ms returned sat
[2021-05-08 10:15:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 10:15:44] [INFO ] [Nat]Absence check using state equation in 79 ms returned sat
[2021-05-08 10:15:44] [INFO ] State equation strengthened by 2 read => feed constraints.
[2021-05-08 10:15:44] [INFO ] [Nat]Added 2 Read/Feed constraints in 11 ms returned sat
[2021-05-08 10:15:44] [INFO ] Computed and/alt/rep : 125/233/125 causal constraints (skipped 6 transitions) in 9 ms.
[2021-05-08 10:15:44] [INFO ] Added : 96 causal constraints over 20 iterations in 204 ms. Result :sat
Minimization took 37 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 71800 steps, including 1048 resets, run finished after 214 ms. (steps per millisecond=335 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 192 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 192/192 places, 134/134 transitions.
Applied a total of 0 rules in 8 ms. Remains 192 /192 variables (removed 0) and now considering 134/134 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 192/192 places, 134/134 transitions.
// Phase 1: matrix 134 rows 192 cols
[2021-05-08 10:15:44] [INFO ] Computed 60 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 13675 resets, run finished after 2838 ms. (steps per millisecond=352 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2303 resets, run finished after 1073 ms. (steps per millisecond=931 ) properties (out of 1) seen :0
// Phase 1: matrix 134 rows 192 cols
[2021-05-08 10:15:48] [INFO ] Computed 60 place invariants in 13 ms
[2021-05-08 10:15:48] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2021-05-08 10:15:48] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 8 ms returned sat
[2021-05-08 10:15:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 10:15:48] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2021-05-08 10:15:48] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 10:15:49] [INFO ] [Nat]Absence check using 35 positive place invariants in 12 ms returned sat
[2021-05-08 10:15:49] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 51 ms returned sat
[2021-05-08 10:15:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 10:15:49] [INFO ] [Nat]Absence check using state equation in 85 ms returned sat
[2021-05-08 10:15:49] [INFO ] State equation strengthened by 2 read => feed constraints.
[2021-05-08 10:15:49] [INFO ] [Nat]Added 2 Read/Feed constraints in 6 ms returned sat
[2021-05-08 10:15:49] [INFO ] Computed and/alt/rep : 125/233/125 causal constraints (skipped 6 transitions) in 12 ms.
[2021-05-08 10:15:49] [INFO ] Added : 96 causal constraints over 20 iterations in 210 ms. Result :sat
Minimization took 37 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 71800 steps, including 1047 resets, run finished after 210 ms. (steps per millisecond=341 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 192 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 192/192 places, 134/134 transitions.
Applied a total of 0 rules in 7 ms. Remains 192 /192 variables (removed 0) and now considering 134/134 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 192/192 places, 134/134 transitions.
Starting structural reductions, iteration 0 : 192/192 places, 134/134 transitions.
Applied a total of 0 rules in 7 ms. Remains 192 /192 variables (removed 0) and now considering 134/134 (removed 0) transitions.
// Phase 1: matrix 134 rows 192 cols
[2021-05-08 10:15:49] [INFO ] Computed 60 place invariants in 1 ms
[2021-05-08 10:15:49] [INFO ] Implicit Places using invariants in 98 ms returned []
// Phase 1: matrix 134 rows 192 cols
[2021-05-08 10:15:49] [INFO ] Computed 60 place invariants in 2 ms
[2021-05-08 10:15:49] [INFO ] State equation strengthened by 2 read => feed constraints.
[2021-05-08 10:15:49] [INFO ] Implicit Places using invariants and state equation in 205 ms returned []
Implicit Place search using SMT with State Equation took 306 ms to find 0 implicit places.
[2021-05-08 10:15:49] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 134 rows 192 cols
[2021-05-08 10:15:49] [INFO ] Computed 60 place invariants in 2 ms
[2021-05-08 10:15:50] [INFO ] Dead Transitions using invariants and state equation in 73 ms returned []
Finished structural reductions, in 1 iterations. Remains : 192/192 places, 134/134 transitions.
Ending property specific reduction for DES-PT-20a-UpperBounds-09 in 5889 ms.
Starting property specific reduction for DES-PT-20a-UpperBounds-10
// Phase 1: matrix 134 rows 192 cols
[2021-05-08 10:15:50] [INFO ] Computed 60 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 133 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
// Phase 1: matrix 134 rows 192 cols
[2021-05-08 10:15:50] [INFO ] Computed 60 place invariants in 1 ms
[2021-05-08 10:15:50] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2021-05-08 10:15:50] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 7 ms returned sat
[2021-05-08 10:15:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 10:15:50] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2021-05-08 10:15:50] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 10:15:50] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2021-05-08 10:15:50] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 70 ms returned sat
[2021-05-08 10:15:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 10:15:50] [INFO ] [Nat]Absence check using state equation in 78 ms returned sat
[2021-05-08 10:15:50] [INFO ] State equation strengthened by 2 read => feed constraints.
[2021-05-08 10:15:50] [INFO ] [Nat]Added 2 Read/Feed constraints in 2 ms returned sat
[2021-05-08 10:15:50] [INFO ] Computed and/alt/rep : 125/233/125 causal constraints (skipped 6 transitions) in 8 ms.
[2021-05-08 10:15:50] [INFO ] Added : 65 causal constraints over 14 iterations in 144 ms. Result :sat
Minimization took 30 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 49000 steps, including 905 resets, run finished after 143 ms. (steps per millisecond=342 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 192 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 192/192 places, 134/134 transitions.
Applied a total of 0 rules in 5 ms. Remains 192 /192 variables (removed 0) and now considering 134/134 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 192/192 places, 134/134 transitions.
// Phase 1: matrix 134 rows 192 cols
[2021-05-08 10:15:50] [INFO ] Computed 60 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 13684 resets, run finished after 2878 ms. (steps per millisecond=347 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2269 resets, run finished after 1120 ms. (steps per millisecond=892 ) properties (out of 1) seen :0
// Phase 1: matrix 134 rows 192 cols
[2021-05-08 10:15:54] [INFO ] Computed 60 place invariants in 1 ms
[2021-05-08 10:15:54] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2021-05-08 10:15:54] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 12 ms returned sat
[2021-05-08 10:15:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 10:15:54] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2021-05-08 10:15:54] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 10:15:54] [INFO ] [Nat]Absence check using 35 positive place invariants in 16 ms returned sat
[2021-05-08 10:15:54] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 68 ms returned sat
[2021-05-08 10:15:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 10:15:55] [INFO ] [Nat]Absence check using state equation in 80 ms returned sat
[2021-05-08 10:15:55] [INFO ] State equation strengthened by 2 read => feed constraints.
[2021-05-08 10:15:55] [INFO ] [Nat]Added 2 Read/Feed constraints in 2 ms returned sat
[2021-05-08 10:15:55] [INFO ] Computed and/alt/rep : 125/233/125 causal constraints (skipped 6 transitions) in 8 ms.
[2021-05-08 10:15:55] [INFO ] Added : 65 causal constraints over 14 iterations in 167 ms. Result :sat
Minimization took 31 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 49000 steps, including 903 resets, run finished after 146 ms. (steps per millisecond=335 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 192 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 192/192 places, 134/134 transitions.
Applied a total of 0 rules in 6 ms. Remains 192 /192 variables (removed 0) and now considering 134/134 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 192/192 places, 134/134 transitions.
Starting structural reductions, iteration 0 : 192/192 places, 134/134 transitions.
Applied a total of 0 rules in 5 ms. Remains 192 /192 variables (removed 0) and now considering 134/134 (removed 0) transitions.
// Phase 1: matrix 134 rows 192 cols
[2021-05-08 10:15:55] [INFO ] Computed 60 place invariants in 2 ms
[2021-05-08 10:15:55] [INFO ] Implicit Places using invariants in 97 ms returned []
// Phase 1: matrix 134 rows 192 cols
[2021-05-08 10:15:55] [INFO ] Computed 60 place invariants in 2 ms
[2021-05-08 10:15:55] [INFO ] State equation strengthened by 2 read => feed constraints.
[2021-05-08 10:15:55] [INFO ] Implicit Places using invariants and state equation in 188 ms returned []
Implicit Place search using SMT with State Equation took 286 ms to find 0 implicit places.
[2021-05-08 10:15:55] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 134 rows 192 cols
[2021-05-08 10:15:55] [INFO ] Computed 60 place invariants in 2 ms
[2021-05-08 10:15:55] [INFO ] Dead Transitions using invariants and state equation in 88 ms returned []
Finished structural reductions, in 1 iterations. Remains : 192/192 places, 134/134 transitions.
Ending property specific reduction for DES-PT-20a-UpperBounds-10 in 5732 ms.
Starting property specific reduction for DES-PT-20a-UpperBounds-12
// Phase 1: matrix 134 rows 192 cols
[2021-05-08 10:15:55] [INFO ] Computed 60 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 135 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
// Phase 1: matrix 134 rows 192 cols
[2021-05-08 10:15:55] [INFO ] Computed 60 place invariants in 2 ms
[2021-05-08 10:15:55] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2021-05-08 10:15:55] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 8 ms returned sat
[2021-05-08 10:15:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 10:15:55] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2021-05-08 10:15:55] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 10:15:55] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2021-05-08 10:15:56] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 60 ms returned sat
[2021-05-08 10:15:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 10:15:56] [INFO ] [Nat]Absence check using state equation in 101 ms returned sat
[2021-05-08 10:15:56] [INFO ] State equation strengthened by 2 read => feed constraints.
[2021-05-08 10:15:56] [INFO ] [Nat]Added 2 Read/Feed constraints in 7 ms returned sat
[2021-05-08 10:15:56] [INFO ] Computed and/alt/rep : 125/233/125 causal constraints (skipped 6 transitions) in 9 ms.
[2021-05-08 10:15:56] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2021-05-08 10:15:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 54 ms
[2021-05-08 10:15:56] [INFO ] Added : 108 causal constraints over 23 iterations in 286 ms. Result :sat
Minimization took 35 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 85200 steps, including 1360 resets, run finished after 253 ms. (steps per millisecond=336 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 192 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 192/192 places, 134/134 transitions.
Applied a total of 0 rules in 6 ms. Remains 192 /192 variables (removed 0) and now considering 134/134 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 192/192 places, 134/134 transitions.
// Phase 1: matrix 134 rows 192 cols
[2021-05-08 10:15:56] [INFO ] Computed 60 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 13622 resets, run finished after 2843 ms. (steps per millisecond=351 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2235 resets, run finished after 1093 ms. (steps per millisecond=914 ) properties (out of 1) seen :0
// Phase 1: matrix 134 rows 192 cols
[2021-05-08 10:16:00] [INFO ] Computed 60 place invariants in 1 ms
[2021-05-08 10:16:00] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2021-05-08 10:16:00] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 8 ms returned sat
[2021-05-08 10:16:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 10:16:00] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2021-05-08 10:16:00] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 10:16:00] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2021-05-08 10:16:00] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 53 ms returned sat
[2021-05-08 10:16:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 10:16:00] [INFO ] [Nat]Absence check using state equation in 103 ms returned sat
[2021-05-08 10:16:00] [INFO ] State equation strengthened by 2 read => feed constraints.
[2021-05-08 10:16:00] [INFO ] [Nat]Added 2 Read/Feed constraints in 7 ms returned sat
[2021-05-08 10:16:00] [INFO ] Computed and/alt/rep : 125/233/125 causal constraints (skipped 6 transitions) in 8 ms.
[2021-05-08 10:16:01] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 0 ms to minimize.
[2021-05-08 10:16:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 42 ms
[2021-05-08 10:16:01] [INFO ] Added : 108 causal constraints over 23 iterations in 274 ms. Result :sat
Minimization took 35 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 85200 steps, including 1359 resets, run finished after 246 ms. (steps per millisecond=346 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 192 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 192/192 places, 134/134 transitions.
Applied a total of 0 rules in 6 ms. Remains 192 /192 variables (removed 0) and now considering 134/134 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 192/192 places, 134/134 transitions.
Starting structural reductions, iteration 0 : 192/192 places, 134/134 transitions.
Applied a total of 0 rules in 5 ms. Remains 192 /192 variables (removed 0) and now considering 134/134 (removed 0) transitions.
// Phase 1: matrix 134 rows 192 cols
[2021-05-08 10:16:01] [INFO ] Computed 60 place invariants in 1 ms
[2021-05-08 10:16:01] [INFO ] Implicit Places using invariants in 123 ms returned []
// Phase 1: matrix 134 rows 192 cols
[2021-05-08 10:16:01] [INFO ] Computed 60 place invariants in 2 ms
[2021-05-08 10:16:01] [INFO ] State equation strengthened by 2 read => feed constraints.
[2021-05-08 10:16:01] [INFO ] Implicit Places using invariants and state equation in 178 ms returned []
Implicit Place search using SMT with State Equation took 310 ms to find 0 implicit places.
[2021-05-08 10:16:01] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 134 rows 192 cols
[2021-05-08 10:16:01] [INFO ] Computed 60 place invariants in 2 ms
[2021-05-08 10:16:01] [INFO ] Dead Transitions using invariants and state equation in 104 ms returned []
Finished structural reductions, in 1 iterations. Remains : 192/192 places, 134/134 transitions.
Ending property specific reduction for DES-PT-20a-UpperBounds-12 in 6183 ms.
Starting property specific reduction for DES-PT-20a-UpperBounds-13
// Phase 1: matrix 134 rows 192 cols
[2021-05-08 10:16:01] [INFO ] Computed 60 place invariants in 2 ms
Incomplete random walk after 10000 steps, including 134 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
// Phase 1: matrix 134 rows 192 cols
[2021-05-08 10:16:02] [INFO ] Computed 60 place invariants in 1 ms
[2021-05-08 10:16:02] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2021-05-08 10:16:02] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 7 ms returned sat
[2021-05-08 10:16:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 10:16:02] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2021-05-08 10:16:02] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 10:16:02] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2021-05-08 10:16:02] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 69 ms returned sat
[2021-05-08 10:16:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 10:16:02] [INFO ] [Nat]Absence check using state equation in 82 ms returned sat
[2021-05-08 10:16:02] [INFO ] State equation strengthened by 2 read => feed constraints.
[2021-05-08 10:16:02] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2021-05-08 10:16:02] [INFO ] Computed and/alt/rep : 125/233/125 causal constraints (skipped 6 transitions) in 8 ms.
[2021-05-08 10:16:02] [INFO ] Added : 61 causal constraints over 13 iterations in 148 ms. Result :sat
Minimization took 29 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 34900 steps, including 654 resets, run finished after 106 ms. (steps per millisecond=329 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 192 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 192/192 places, 134/134 transitions.
Applied a total of 0 rules in 6 ms. Remains 192 /192 variables (removed 0) and now considering 134/134 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 192/192 places, 134/134 transitions.
// Phase 1: matrix 134 rows 192 cols
[2021-05-08 10:16:02] [INFO ] Computed 60 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 13692 resets, run finished after 2818 ms. (steps per millisecond=354 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2292 resets, run finished after 1080 ms. (steps per millisecond=925 ) properties (out of 1) seen :0
// Phase 1: matrix 134 rows 192 cols
[2021-05-08 10:16:06] [INFO ] Computed 60 place invariants in 2 ms
[2021-05-08 10:16:06] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2021-05-08 10:16:06] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 7 ms returned sat
[2021-05-08 10:16:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 10:16:06] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2021-05-08 10:16:06] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 10:16:06] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2021-05-08 10:16:06] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 68 ms returned sat
[2021-05-08 10:16:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 10:16:06] [INFO ] [Nat]Absence check using state equation in 77 ms returned sat
[2021-05-08 10:16:06] [INFO ] State equation strengthened by 2 read => feed constraints.
[2021-05-08 10:16:06] [INFO ] [Nat]Added 2 Read/Feed constraints in 2 ms returned sat
[2021-05-08 10:16:06] [INFO ] Computed and/alt/rep : 125/233/125 causal constraints (skipped 6 transitions) in 6 ms.
[2021-05-08 10:16:06] [INFO ] Added : 61 causal constraints over 13 iterations in 141 ms. Result :sat
Minimization took 30 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 34900 steps, including 653 resets, run finished after 101 ms. (steps per millisecond=345 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 192 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 192/192 places, 134/134 transitions.
Applied a total of 0 rules in 6 ms. Remains 192 /192 variables (removed 0) and now considering 134/134 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 192/192 places, 134/134 transitions.
Starting structural reductions, iteration 0 : 192/192 places, 134/134 transitions.
Applied a total of 0 rules in 5 ms. Remains 192 /192 variables (removed 0) and now considering 134/134 (removed 0) transitions.
// Phase 1: matrix 134 rows 192 cols
[2021-05-08 10:16:07] [INFO ] Computed 60 place invariants in 2 ms
[2021-05-08 10:16:07] [INFO ] Implicit Places using invariants in 128 ms returned []
// Phase 1: matrix 134 rows 192 cols
[2021-05-08 10:16:07] [INFO ] Computed 60 place invariants in 1 ms
[2021-05-08 10:16:07] [INFO ] State equation strengthened by 2 read => feed constraints.
[2021-05-08 10:16:07] [INFO ] Implicit Places using invariants and state equation in 190 ms returned []
Implicit Place search using SMT with State Equation took 320 ms to find 0 implicit places.
[2021-05-08 10:16:07] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 134 rows 192 cols
[2021-05-08 10:16:07] [INFO ] Computed 60 place invariants in 1 ms
[2021-05-08 10:16:07] [INFO ] Dead Transitions using invariants and state equation in 83 ms returned []
Finished structural reductions, in 1 iterations. Remains : 192/192 places, 134/134 transitions.
Ending property specific reduction for DES-PT-20a-UpperBounds-13 in 5511 ms.
[2021-05-08 10:16:07] [INFO ] Flatten gal took : 51 ms
[2021-05-08 10:16:07] [INFO ] Applying decomposition
[2021-05-08 10:16:07] [INFO ] Flatten gal took : 17 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph3384085088543268547.txt, -o, /tmp/graph3384085088543268547.bin, -w, /tmp/graph3384085088543268547.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph3384085088543268547.bin, -l, -1, -v, -w, /tmp/graph3384085088543268547.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-08 10:16:07] [INFO ] Decomposing Gal with order
[2021-05-08 10:16:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-08 10:16:07] [INFO ] Removed a total of 23 redundant transitions.
[2021-05-08 10:16:07] [INFO ] Flatten gal took : 42 ms
[2021-05-08 10:16:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 4 ms.
[2021-05-08 10:16:07] [INFO ] Time to serialize gal into /tmp/UpperBounds14471529108130734938.gal : 7 ms
[2021-05-08 10:16:07] [INFO ] Time to serialize properties into /tmp/UpperBounds3619474478071380285.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds14471529108130734938.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds3619474478071380285.prop, --nowitness], workingDir=/home/mcc/execution]
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds14471529108130734938.gal -t CGAL -reachable-file /tmp/UpperBounds3619474478071380285.prop --nowitness
Loading property file /tmp/UpperBounds3619474478071380285.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,3.96119e+12,1.60944,53836,4788,1830,112307,4305,248,162070,217,19467,0
Total reachable state count : 3961190091904
Verifying 4 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DES-PT-20a-UpperBounds-09 :0 <= u14.p9 <= 1
FORMULA DES-PT-20a-UpperBounds-09 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DES-PT-20a-UpperBounds-09,0,2.38641,54100,1,0,112307,22026,425,229406,281,83885,4541
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DES-PT-20a-UpperBounds-10 :0 <= u13.p46 <= 1
FORMULA DES-PT-20a-UpperBounds-10 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DES-PT-20a-UpperBounds-10,0,2.53645,54100,1,0,112307,25752,466,255716,320,94556,5149
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DES-PT-20a-UpperBounds-12 :0 <= u14.p7 <= 1
FORMULA DES-PT-20a-UpperBounds-12 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DES-PT-20a-UpperBounds-12,0,2.81064,60440,1,0,112307,34061,495,295961,361,131782,5255
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DES-PT-20a-UpperBounds-13 :0 <= u13.p50 <= 1
FORMULA DES-PT-20a-UpperBounds-13 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DES-PT-20a-UpperBounds-13,0,2.81134,60440,1,0,112307,34069,514,295965,392,131862,5284
BK_STOP 1620468971495
--------------------
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="DES-PT-20a"
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-4028"
echo " Executing tool itstools"
echo " Input is DES-PT-20a, 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 r064-tall-162038396700083"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-20a.tgz
mv DES-PT-20a 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 '
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 ;