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.r121-tall-162075406800347.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 IBMB2S565S3960-PT-none, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r121-tall-162075406800347
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 584K
-rw-r--r-- 1 mcc users 38K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 140K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 27K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 93K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Apr 26 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 26 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.0K Apr 26 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 26 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.4K Mar 23 18:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 23 18:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Mar 23 01:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 23 01:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.2K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 5 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 127K 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 IBMB2S565S3960-PT-none-UpperBounds-00
FORMULA_NAME IBMB2S565S3960-PT-none-UpperBounds-01
FORMULA_NAME IBMB2S565S3960-PT-none-UpperBounds-02
FORMULA_NAME IBMB2S565S3960-PT-none-UpperBounds-03
FORMULA_NAME IBMB2S565S3960-PT-none-UpperBounds-04
FORMULA_NAME IBMB2S565S3960-PT-none-UpperBounds-05
FORMULA_NAME IBMB2S565S3960-PT-none-UpperBounds-06
FORMULA_NAME IBMB2S565S3960-PT-none-UpperBounds-07
FORMULA_NAME IBMB2S565S3960-PT-none-UpperBounds-08
FORMULA_NAME IBMB2S565S3960-PT-none-UpperBounds-09
FORMULA_NAME IBMB2S565S3960-PT-none-UpperBounds-10
FORMULA_NAME IBMB2S565S3960-PT-none-UpperBounds-11
FORMULA_NAME IBMB2S565S3960-PT-none-UpperBounds-12
FORMULA_NAME IBMB2S565S3960-PT-none-UpperBounds-13
FORMULA_NAME IBMB2S565S3960-PT-none-UpperBounds-14
FORMULA_NAME IBMB2S565S3960-PT-none-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1620837770538

Running Version 0
[2021-05-12 16:42:57] [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-12 16:42:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-12 16:42:57] [INFO ] Load time of PNML (sax parser for PT used): 51 ms
[2021-05-12 16:42:57] [INFO ] Transformed 273 places.
[2021-05-12 16:42:57] [INFO ] Transformed 179 transitions.
[2021-05-12 16:42:57] [INFO ] Parsed PT model containing 273 places and 179 transitions in 92 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
// Phase 1: matrix 179 rows 273 cols
[2021-05-12 16:42:57] [INFO ] Computed 101 place invariants in 22 ms
Incomplete random walk after 10000 steps, including 38 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 16) seen :46
FORMULA IBMB2S565S3960-PT-none-UpperBounds-07 7 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 15) seen :9
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 15) seen :13
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 15) seen :11
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 15) seen :6
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 15) seen :11
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 15) seen :10
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 15) seen :12
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 15) seen :12
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 15) seen :12
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 15) seen :10
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 15) seen :16
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 15) seen :11
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 15) seen :10
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 15) seen :16
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 15) seen :18
// Phase 1: matrix 179 rows 273 cols
[2021-05-12 16:42:57] [INFO ] Computed 101 place invariants in 11 ms
[2021-05-12 16:42:58] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2021-05-12 16:42:58] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 28 ms returned sat
[2021-05-12 16:42:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 16:42:58] [INFO ] [Real]Absence check using state equation in 81 ms returned sat
[2021-05-12 16:42:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 16:42:58] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2021-05-12 16:42:58] [INFO ] [Nat]Absence check using 2 positive and 99 generalized place invariants in 15 ms returned sat
[2021-05-12 16:42:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 16:42:58] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2021-05-12 16:42:58] [INFO ] Computed and/alt/rep : 178/299/178 causal constraints (skipped 0 transitions) in 15 ms.
[2021-05-12 16:42:58] [INFO ] Added : 157 causal constraints over 32 iterations in 476 ms. Result :sat
Minimization took 83 ms.
[2021-05-12 16:42:59] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2021-05-12 16:42:59] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 15 ms returned sat
[2021-05-12 16:42:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 16:42:59] [INFO ] [Real]Absence check using state equation in 71 ms returned sat
[2021-05-12 16:42:59] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 16:42:59] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2021-05-12 16:42:59] [INFO ] [Nat]Absence check using 2 positive and 99 generalized place invariants in 15 ms returned sat
[2021-05-12 16:42:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 16:42:59] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2021-05-12 16:42:59] [INFO ] Computed and/alt/rep : 178/299/178 causal constraints (skipped 0 transitions) in 13 ms.
[2021-05-12 16:42:59] [INFO ] Added : 147 causal constraints over 30 iterations in 437 ms. Result :sat
Minimization took 70 ms.
[2021-05-12 16:42:59] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2021-05-12 16:42:59] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 17 ms returned sat
[2021-05-12 16:42:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 16:43:00] [INFO ] [Real]Absence check using state equation in 63 ms returned unsat
[2021-05-12 16:43:00] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2021-05-12 16:43:00] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 14 ms returned sat
[2021-05-12 16:43:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 16:43:00] [INFO ] [Real]Absence check using state equation in 66 ms returned sat
[2021-05-12 16:43:00] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 16:43:00] [INFO ] [Nat]Absence check using 2 positive place invariants in 7 ms returned sat
[2021-05-12 16:43:00] [INFO ] [Nat]Absence check using 2 positive and 99 generalized place invariants in 13 ms returned sat
[2021-05-12 16:43:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 16:43:00] [INFO ] [Nat]Absence check using state equation in 62 ms returned sat
[2021-05-12 16:43:00] [INFO ] Computed and/alt/rep : 178/299/178 causal constraints (skipped 0 transitions) in 12 ms.
[2021-05-12 16:43:00] [INFO ] Added : 157 causal constraints over 32 iterations in 457 ms. Result :sat
Minimization took 97 ms.
[2021-05-12 16:43:00] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2021-05-12 16:43:00] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 16 ms returned sat
[2021-05-12 16:43:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 16:43:00] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2021-05-12 16:43:00] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 16:43:01] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2021-05-12 16:43:01] [INFO ] [Nat]Absence check using 2 positive and 99 generalized place invariants in 13 ms returned sat
[2021-05-12 16:43:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 16:43:01] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2021-05-12 16:43:01] [INFO ] Computed and/alt/rep : 178/299/178 causal constraints (skipped 0 transitions) in 13 ms.
[2021-05-12 16:43:01] [INFO ] Added : 148 causal constraints over 30 iterations in 441 ms. Result :sat
Minimization took 65 ms.
[2021-05-12 16:43:01] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2021-05-12 16:43:01] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 13 ms returned sat
[2021-05-12 16:43:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 16:43:01] [INFO ] [Real]Absence check using state equation in 54 ms returned unsat
[2021-05-12 16:43:01] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2021-05-12 16:43:01] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 14 ms returned sat
[2021-05-12 16:43:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 16:43:01] [INFO ] [Real]Absence check using state equation in 63 ms returned sat
[2021-05-12 16:43:01] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 16:43:01] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2021-05-12 16:43:01] [INFO ] [Nat]Absence check using 2 positive and 99 generalized place invariants in 14 ms returned sat
[2021-05-12 16:43:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 16:43:01] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2021-05-12 16:43:01] [INFO ] Computed and/alt/rep : 178/299/178 causal constraints (skipped 0 transitions) in 12 ms.
[2021-05-12 16:43:02] [INFO ] Added : 148 causal constraints over 30 iterations in 382 ms. Result :sat
Minimization took 70 ms.
[2021-05-12 16:43:02] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2021-05-12 16:43:02] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 12 ms returned sat
[2021-05-12 16:43:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 16:43:02] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2021-05-12 16:43:02] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 16:43:02] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2021-05-12 16:43:02] [INFO ] [Nat]Absence check using 2 positive and 99 generalized place invariants in 13 ms returned sat
[2021-05-12 16:43:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 16:43:02] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2021-05-12 16:43:02] [INFO ] Computed and/alt/rep : 178/299/178 causal constraints (skipped 0 transitions) in 9 ms.
[2021-05-12 16:43:02] [INFO ] Added : 124 causal constraints over 25 iterations in 309 ms. Result :sat
Minimization took 52 ms.
[2021-05-12 16:43:03] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2021-05-12 16:43:03] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 13 ms returned sat
[2021-05-12 16:43:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 16:43:03] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2021-05-12 16:43:03] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 16:43:03] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2021-05-12 16:43:03] [INFO ] [Nat]Absence check using 2 positive and 99 generalized place invariants in 14 ms returned sat
[2021-05-12 16:43:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 16:43:03] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2021-05-12 16:43:03] [INFO ] Computed and/alt/rep : 178/299/178 causal constraints (skipped 0 transitions) in 11 ms.
[2021-05-12 16:43:03] [INFO ] Added : 120 causal constraints over 24 iterations in 328 ms. Result :sat
Minimization took 53 ms.
[2021-05-12 16:43:03] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2021-05-12 16:43:03] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 14 ms returned sat
[2021-05-12 16:43:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 16:43:03] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2021-05-12 16:43:03] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 16:43:03] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2021-05-12 16:43:03] [INFO ] [Nat]Absence check using 2 positive and 99 generalized place invariants in 13 ms returned sat
[2021-05-12 16:43:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 16:43:03] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2021-05-12 16:43:03] [INFO ] Computed and/alt/rep : 178/299/178 causal constraints (skipped 0 transitions) in 13 ms.
[2021-05-12 16:43:04] [INFO ] Added : 124 causal constraints over 25 iterations in 334 ms. Result :sat
Minimization took 51 ms.
[2021-05-12 16:43:04] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2021-05-12 16:43:04] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 14 ms returned sat
[2021-05-12 16:43:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 16:43:04] [INFO ] [Real]Absence check using state equation in 63 ms returned sat
[2021-05-12 16:43:04] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 16:43:04] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2021-05-12 16:43:04] [INFO ] [Nat]Absence check using 2 positive and 99 generalized place invariants in 14 ms returned sat
[2021-05-12 16:43:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 16:43:04] [INFO ] [Nat]Absence check using state equation in 64 ms returned sat
[2021-05-12 16:43:04] [INFO ] Computed and/alt/rep : 178/299/178 causal constraints (skipped 0 transitions) in 10 ms.
[2021-05-12 16:43:04] [INFO ] Added : 120 causal constraints over 25 iterations in 334 ms. Result :sat
Minimization took 53 ms.
[2021-05-12 16:43:04] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2021-05-12 16:43:04] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 13 ms returned sat
[2021-05-12 16:43:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 16:43:05] [INFO ] [Real]Absence check using state equation in 62 ms returned sat
[2021-05-12 16:43:05] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 16:43:05] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2021-05-12 16:43:05] [INFO ] [Nat]Absence check using 2 positive and 99 generalized place invariants in 13 ms returned sat
[2021-05-12 16:43:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 16:43:05] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2021-05-12 16:43:05] [INFO ] Computed and/alt/rep : 178/299/178 causal constraints (skipped 0 transitions) in 10 ms.
[2021-05-12 16:43:05] [INFO ] Added : 142 causal constraints over 29 iterations in 359 ms. Result :sat
Minimization took 66 ms.
[2021-05-12 16:43:05] [INFO ] [Real]Absence check using 2 positive place invariants in 43 ms returned sat
[2021-05-12 16:43:05] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 44 ms returned sat
[2021-05-12 16:43:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 16:43:05] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2021-05-12 16:43:05] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 16:43:05] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2021-05-12 16:43:05] [INFO ] [Nat]Absence check using 2 positive and 99 generalized place invariants in 13 ms returned sat
[2021-05-12 16:43:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 16:43:05] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2021-05-12 16:43:05] [INFO ] Computed and/alt/rep : 178/299/178 causal constraints (skipped 0 transitions) in 10 ms.
[2021-05-12 16:43:06] [INFO ] Added : 167 causal constraints over 35 iterations in 440 ms. Result :sat
Minimization took 109 ms.
[2021-05-12 16:43:06] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2021-05-12 16:43:06] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 12 ms returned sat
[2021-05-12 16:43:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 16:43:06] [INFO ] [Real]Absence check using state equation in 57 ms returned unsat
[2021-05-12 16:43:06] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2021-05-12 16:43:06] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 14 ms returned sat
[2021-05-12 16:43:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 16:43:06] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2021-05-12 16:43:06] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 16:43:06] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2021-05-12 16:43:06] [INFO ] [Nat]Absence check using 2 positive and 99 generalized place invariants in 14 ms returned sat
[2021-05-12 16:43:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 16:43:06] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2021-05-12 16:43:06] [INFO ] Computed and/alt/rep : 178/299/178 causal constraints (skipped 0 transitions) in 14 ms.
[2021-05-12 16:43:07] [INFO ] Added : 121 causal constraints over 25 iterations in 341 ms. Result :sat
Minimization took 52 ms.
Current structural bounds on expressions (after SMT) : [100, 900, 1, 100, 100, 1, 100, 100, 100, 100, 100, 300, 50, 7, 100] Max seen :[3, 1, 1, 2, 1, 1, 1, 5, 5, 5, 5, 1, 0, 7, 5]
FORMULA IBMB2S565S3960-PT-none-UpperBounds-14 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA IBMB2S565S3960-PT-none-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA IBMB2S565S3960-PT-none-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Incomplete Parikh walk after 39500 steps, including 101 resets, run finished after 133 ms. (steps per millisecond=296 ) properties (out of 12) seen :18 could not realise parikh vector
Incomplete Parikh walk after 53900 steps, including 105 resets, run finished after 201 ms. (steps per millisecond=268 ) properties (out of 12) seen :35 could not realise parikh vector
Incomplete Parikh walk after 59200 steps, including 111 resets, run finished after 152 ms. (steps per millisecond=389 ) properties (out of 12) seen :39 could not realise parikh vector
Incomplete Parikh walk after 46500 steps, including 101 resets, run finished after 110 ms. (steps per millisecond=422 ) properties (out of 12) seen :30 could not realise parikh vector
Incomplete Parikh walk after 41900 steps, including 103 resets, run finished after 99 ms. (steps per millisecond=423 ) properties (out of 12) seen :19 could not realise parikh vector
Incomplete Parikh walk after 50300 steps, including 103 resets, run finished after 118 ms. (steps per millisecond=426 ) properties (out of 12) seen :32 could not realise parikh vector
Incomplete Parikh walk after 40800 steps, including 103 resets, run finished after 97 ms. (steps per millisecond=420 ) properties (out of 12) seen :23 could not realise parikh vector
Incomplete Parikh walk after 57800 steps, including 108 resets, run finished after 141 ms. (steps per millisecond=409 ) properties (out of 12) seen :43 could not realise parikh vector
Incomplete Parikh walk after 58300 steps, including 108 resets, run finished after 135 ms. (steps per millisecond=431 ) properties (out of 12) seen :37 could not realise parikh vector
Incomplete Parikh walk after 50500 steps, including 105 resets, run finished after 117 ms. (steps per millisecond=431 ) properties (out of 12) seen :37 could not realise parikh vector
Incomplete Parikh walk after 54600 steps, including 104 resets, run finished after 133 ms. (steps per millisecond=410 ) properties (out of 12) seen :37 could not realise parikh vector
Incomplete Parikh walk after 35200 steps, including 100 resets, run finished after 82 ms. (steps per millisecond=429 ) properties (out of 12) seen :7 could not realise parikh vector
Support contains 12 out of 273 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 273/273 places, 179/179 transitions.
Graph (complete) has 415 edges and 273 vertex of which 231 are kept as prefixes of interest. Removing 42 places using SCC suffix rule.2267 ms
Discarding 42 places :
Also discarding 24 output transitions
Drop transitions removed 24 transitions
Ensure Unique test removed 84 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 0 with 163 rules applied. Total rules applied 164 place count 147 transition count 76
Reduce places removed 71 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 75 rules applied. Total rules applied 239 place count 76 transition count 72
Reduce places removed 2 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 2 with 8 rules applied. Total rules applied 247 place count 74 transition count 66
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 253 place count 68 transition count 66
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 19 Pre rules applied. Total rules applied 253 place count 68 transition count 47
Deduced a syphon composed of 19 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 4 with 40 rules applied. Total rules applied 293 place count 47 transition count 47
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 293 place count 47 transition count 46
Renaming transitions due to excessive name length > 1024 char.
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 296 place count 45 transition count 46
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 296 place count 45 transition count 45
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 298 place count 44 transition count 45
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 304 place count 38 transition count 39
Iterating global reduction 4 with 6 rules applied. Total rules applied 310 place count 38 transition count 39
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 318 place count 33 transition count 36
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 319 place count 32 transition count 35
Iterating global reduction 4 with 1 rules applied. Total rules applied 320 place count 32 transition count 35
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 4 with 2 rules applied. Total rules applied 322 place count 31 transition count 34
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 324 place count 30 transition count 34
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 327 place count 30 transition count 31
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 327 place count 30 transition count 30
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 329 place count 29 transition count 30
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 331 place count 29 transition count 28
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 333 place count 27 transition count 28
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 334 place count 27 transition count 27
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 335 place count 26 transition count 27
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 336 place count 26 transition count 26
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 337 place count 25 transition count 25
Applied a total of 337 rules in 2374 ms. Remains 25 /273 variables (removed 248) and now considering 25/179 (removed 154) transitions.
Finished structural reductions, in 1 iterations. Remains : 25/273 places, 25/179 transitions.
// Phase 1: matrix 25 rows 25 cols
[2021-05-12 16:43:11] [INFO ] Computed 3 place invariants in 1 ms
Incomplete random walk after 1000003 steps, including 15451 resets, run finished after 465 ms. (steps per millisecond=2150 ) properties (out of 12) seen :59
Incomplete Best-First random walk after 1000000 steps, including 27777 resets, run finished after 384 ms. (steps per millisecond=2604 ) properties (out of 12) seen :7
Incomplete Best-First random walk after 1000001 steps, including 4158 resets, run finished after 516 ms. (steps per millisecond=1937 ) properties (out of 12) seen :54
Incomplete Best-First random walk after 1000000 steps, including 4792 resets, run finished after 498 ms. (steps per millisecond=2008 ) properties (out of 12) seen :44
Incomplete Best-First random walk after 1000001 steps, including 3758 resets, run finished after 499 ms. (steps per millisecond=2004 ) properties (out of 12) seen :49
Incomplete Best-First random walk after 1000000 steps, including 4141 resets, run finished after 509 ms. (steps per millisecond=1964 ) properties (out of 12) seen :54
Incomplete Best-First random walk after 1000001 steps, including 5027 resets, run finished after 537 ms. (steps per millisecond=1862 ) properties (out of 12) seen :40
Incomplete Best-First random walk after 1000001 steps, including 6378 resets, run finished after 485 ms. (steps per millisecond=2061 ) properties (out of 12) seen :42
Incomplete Best-First random walk after 1000000 steps, including 2911 resets, run finished after 559 ms. (steps per millisecond=1788 ) properties (out of 12) seen :23
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 616 ms. (steps per millisecond=1623 ) properties (out of 12) seen :16
Incomplete Best-First random walk after 1000001 steps, including 4160 resets, run finished after 544 ms. (steps per millisecond=1838 ) properties (out of 12) seen :51
Incomplete Best-First random walk after 1000001 steps, including 3938 resets, run finished after 498 ms. (steps per millisecond=2008 ) properties (out of 12) seen :53
Incomplete Best-First random walk after 1000001 steps, including 5405 resets, run finished after 556 ms. (steps per millisecond=1798 ) properties (out of 12) seen :29
// Phase 1: matrix 25 rows 25 cols
[2021-05-12 16:43:17] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-12 16:43:17] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-12 16:43:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 16:43:17] [INFO ] [Real]Absence check using state equation in 6 ms returned unsat
[2021-05-12 16:43:17] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-12 16:43:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 16:43:17] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2021-05-12 16:43:17] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 16:43:17] [INFO ] [Nat]Absence check using 0 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-12 16:43:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 16:43:17] [INFO ] [Nat]Absence check using state equation in 6 ms returned unsat
[2021-05-12 16:43:17] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 0 ms returned sat
[2021-05-12 16:43:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 16:43:17] [INFO ] [Real]Absence check using state equation in 9 ms returned unsat
[2021-05-12 16:43:17] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-12 16:43:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 16:43:17] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2021-05-12 16:43:17] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 16:43:17] [INFO ] [Nat]Absence check using 0 positive and 3 generalized place invariants in 0 ms returned sat
[2021-05-12 16:43:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 16:43:17] [INFO ] [Nat]Absence check using state equation in 6 ms returned unsat
[2021-05-12 16:43:17] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-12 16:43:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 16:43:17] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2021-05-12 16:43:17] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 16:43:17] [INFO ] [Nat]Absence check using 0 positive and 3 generalized place invariants in 0 ms returned sat
[2021-05-12 16:43:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 16:43:17] [INFO ] [Nat]Absence check using state equation in 6 ms returned unsat
[2021-05-12 16:43:17] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-12 16:43:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 16:43:17] [INFO ] [Real]Absence check using state equation in 6 ms returned unsat
[2021-05-12 16:43:17] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-12 16:43:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 16:43:17] [INFO ] [Real]Absence check using state equation in 5 ms returned unsat
[2021-05-12 16:43:17] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-12 16:43:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 16:43:17] [INFO ] [Real]Absence check using state equation in 6 ms returned unsat
[2021-05-12 16:43:17] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-12 16:43:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 16:43:17] [INFO ] [Real]Absence check using state equation in 6 ms returned unsat
[2021-05-12 16:43:17] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-12 16:43:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 16:43:17] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2021-05-12 16:43:17] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 16:43:17] [INFO ] [Nat]Absence check using 0 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-12 16:43:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 16:43:17] [INFO ] [Nat]Absence check using state equation in 6 ms returned unsat
[2021-05-12 16:43:17] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 0 ms returned sat
[2021-05-12 16:43:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 16:43:18] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-12 16:43:18] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 16:43:18] [INFO ] [Nat]Absence check using 0 positive and 3 generalized place invariants in 0 ms returned sat
[2021-05-12 16:43:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 16:43:18] [INFO ] [Nat]Absence check using state equation in 6 ms returned unsat
[2021-05-12 16:43:18] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-12 16:43:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 16:43:18] [INFO ] [Real]Absence check using state equation in 6 ms returned unsat
Current structural bounds on expressions (after SMT) : [7, 3, 7, 3, 3, 7, 7, 7, 7, 3, 3, 7] Max seen :[7, 3, 7, 3, 3, 7, 7, 7, 7, 3, 3, 7]
FORMULA IBMB2S565S3960-PT-none-UpperBounds-15 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA IBMB2S565S3960-PT-none-UpperBounds-13 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA IBMB2S565S3960-PT-none-UpperBounds-12 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA IBMB2S565S3960-PT-none-UpperBounds-11 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA IBMB2S565S3960-PT-none-UpperBounds-10 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA IBMB2S565S3960-PT-none-UpperBounds-09 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA IBMB2S565S3960-PT-none-UpperBounds-08 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA IBMB2S565S3960-PT-none-UpperBounds-06 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA IBMB2S565S3960-PT-none-UpperBounds-04 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA IBMB2S565S3960-PT-none-UpperBounds-03 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA IBMB2S565S3960-PT-none-UpperBounds-01 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA IBMB2S565S3960-PT-none-UpperBounds-00 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.

BK_STOP 1620837808591

--------------------
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="IBMB2S565S3960-PT-none"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is IBMB2S565S3960-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 r121-tall-162075406800347"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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