fond

jQuery Multi Level CSS Menu Css3Menu.com

Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r168-tall-165277017100765
Last Updated
Jun 22, 2022

About the Execution of ITS-Tools for PolyORBNT-COL-S05J80

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
572.615 33837.00 46783.00 133.00 1 1 1 1 3 1 4 1 1 1 1 81 4 3 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/mcc2022-input.r168-tall-165277017100765.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is PolyORBNT-COL-S05J80, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r168-tall-165277017100765
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 344K
-rw-r--r-- 1 mcc users 9.3K Apr 30 03:13 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Apr 30 03:13 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Apr 30 03:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 30 03:09 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.2K May 9 08:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 08:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 9 08:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 08:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 9 08:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 08:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_pt
-rw-r--r-- 1 mcc users 7 May 10 09:34 instance
-rw-r--r-- 1 mcc users 5 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 94K May 10 09:34 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 PolyORBNT-COL-S05J80-UpperBounds-00
FORMULA_NAME PolyORBNT-COL-S05J80-UpperBounds-01
FORMULA_NAME PolyORBNT-COL-S05J80-UpperBounds-02
FORMULA_NAME PolyORBNT-COL-S05J80-UpperBounds-03
FORMULA_NAME PolyORBNT-COL-S05J80-UpperBounds-04
FORMULA_NAME PolyORBNT-COL-S05J80-UpperBounds-05
FORMULA_NAME PolyORBNT-COL-S05J80-UpperBounds-06
FORMULA_NAME PolyORBNT-COL-S05J80-UpperBounds-07
FORMULA_NAME PolyORBNT-COL-S05J80-UpperBounds-08
FORMULA_NAME PolyORBNT-COL-S05J80-UpperBounds-09
FORMULA_NAME PolyORBNT-COL-S05J80-UpperBounds-10
FORMULA_NAME PolyORBNT-COL-S05J80-UpperBounds-11
FORMULA_NAME PolyORBNT-COL-S05J80-UpperBounds-12
FORMULA_NAME PolyORBNT-COL-S05J80-UpperBounds-13
FORMULA_NAME PolyORBNT-COL-S05J80-UpperBounds-14
FORMULA_NAME PolyORBNT-COL-S05J80-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1652939830699

Running Version 202205111006
[2022-05-19 05:57:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-19 05:57:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-19 05:57:11] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2022-05-19 05:57:12] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-19 05:57:12] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 655 ms
[2022-05-19 05:57:12] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 1269 PT places and 2592.0 transition bindings in 22 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
[2022-05-19 05:57:12] [INFO ] Built PT skeleton of HLPN with 48 places and 38 transitions 140 arcs in 6 ms.
[2022-05-19 05:57:12] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
// Phase 1: matrix 38 rows 48 cols
[2022-05-19 05:57:12] [INFO ] Computed 13 place invariants in 12 ms
FORMULA PolyORBNT-COL-S05J80-UpperBounds-11 81 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBNT-COL-S05J80-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBNT-COL-S05J80-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
// Phase 1: matrix 38 rows 48 cols
[2022-05-19 05:57:12] [INFO ] Computed 13 place invariants in 4 ms
[2022-05-19 05:57:12] [INFO ] [Real]Absence check using 6 positive place invariants in 9 ms returned sat
[2022-05-19 05:57:12] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 8 ms returned sat
[2022-05-19 05:57:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 05:57:12] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2022-05-19 05:57:12] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 05:57:12] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-19 05:57:12] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2022-05-19 05:57:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 05:57:12] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2022-05-19 05:57:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 05:57:12] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2022-05-19 05:57:12] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-19 05:57:12] [INFO ] Added : 3 causal constraints over 1 iterations in 16 ms. Result :sat
Minimization took 9 ms.
[2022-05-19 05:57:13] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2022-05-19 05:57:13] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 8 ms returned sat
[2022-05-19 05:57:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 05:57:13] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2022-05-19 05:57:13] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 05:57:13] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-19 05:57:13] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2022-05-19 05:57:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 05:57:13] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2022-05-19 05:57:13] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2022-05-19 05:57:13] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 3 ms to minimize.
[2022-05-19 05:57:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 37 ms
[2022-05-19 05:57:13] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-19 05:57:13] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
[2022-05-19 05:57:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 48 ms
[2022-05-19 05:57:13] [INFO ] Added : 33 causal constraints over 7 iterations in 248 ms. Result :sat
Minimization took 61 ms.
[2022-05-19 05:57:13] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-19 05:57:13] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2022-05-19 05:57:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 05:57:13] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2022-05-19 05:57:13] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 05:57:13] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-19 05:57:13] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-19 05:57:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 05:57:13] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2022-05-19 05:57:13] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2022-05-19 05:57:13] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
[2022-05-19 05:57:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 32 ms
[2022-05-19 05:57:13] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-19 05:57:13] [INFO ] Deduced a trap composed of 25 places in 27 ms of which 1 ms to minimize.
[2022-05-19 05:57:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 38 ms
[2022-05-19 05:57:13] [INFO ] Added : 36 causal constraints over 8 iterations in 86 ms. Result :sat
Minimization took 13 ms.
[2022-05-19 05:57:13] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-19 05:57:13] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 0 ms returned unsat
[2022-05-19 05:57:13] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-19 05:57:13] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2022-05-19 05:57:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 05:57:13] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2022-05-19 05:57:13] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 05:57:13] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-19 05:57:13] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2022-05-19 05:57:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 05:57:13] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2022-05-19 05:57:13] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2022-05-19 05:57:13] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-19 05:57:13] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 1 ms to minimize.
[2022-05-19 05:57:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 31 ms
[2022-05-19 05:57:13] [INFO ] Added : 36 causal constraints over 8 iterations in 79 ms. Result :sat
Minimization took 11 ms.
[2022-05-19 05:57:13] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-19 05:57:13] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2022-05-19 05:57:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 05:57:13] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2022-05-19 05:57:13] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 05:57:13] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-19 05:57:13] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2022-05-19 05:57:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 05:57:13] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2022-05-19 05:57:13] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2022-05-19 05:57:13] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-19 05:57:14] [INFO ] Added : 21 causal constraints over 5 iterations in 309 ms. Result :sat
Minimization took 61 ms.
[2022-05-19 05:57:14] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-19 05:57:14] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-19 05:57:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 05:57:14] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2022-05-19 05:57:14] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 05:57:14] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-19 05:57:14] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-19 05:57:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 05:57:14] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2022-05-19 05:57:14] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2022-05-19 05:57:14] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2022-05-19 05:57:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 40 ms
[2022-05-19 05:57:14] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-19 05:57:14] [INFO ] Added : 13 causal constraints over 3 iterations in 24 ms. Result :sat
Minimization took 9 ms.
[2022-05-19 05:57:14] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-19 05:57:14] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 4 ms returned sat
[2022-05-19 05:57:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 05:57:14] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2022-05-19 05:57:14] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 05:57:14] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-19 05:57:14] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2022-05-19 05:57:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 05:57:14] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2022-05-19 05:57:14] [INFO ] [Nat]Added 1 Read/Feed constraints in 36 ms returned sat
[2022-05-19 05:57:14] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-19 05:57:14] [INFO ] Added : 36 causal constraints over 8 iterations in 49 ms. Result :sat
Minimization took 16 ms.
[2022-05-19 05:57:14] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-19 05:57:14] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2022-05-19 05:57:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 05:57:14] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2022-05-19 05:57:14] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 05:57:14] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-19 05:57:14] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-19 05:57:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 05:57:14] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2022-05-19 05:57:14] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2022-05-19 05:57:14] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2022-05-19 05:57:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 38 ms
[2022-05-19 05:57:14] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 5 ms.
[2022-05-19 05:57:14] [INFO ] Added : 36 causal constraints over 8 iterations in 109 ms. Result :sat
Minimization took 11 ms.
[2022-05-19 05:57:14] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-19 05:57:14] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-19 05:57:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 05:57:14] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2022-05-19 05:57:14] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 05:57:15] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-19 05:57:15] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2022-05-19 05:57:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 05:57:15] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2022-05-19 05:57:15] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2022-05-19 05:57:15] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2022-05-19 05:57:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 36 ms
[2022-05-19 05:57:15] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-19 05:57:15] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 1 ms to minimize.
[2022-05-19 05:57:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 41 ms
[2022-05-19 05:57:15] [INFO ] Added : 36 causal constraints over 8 iterations in 163 ms. Result :sat
Minimization took 172 ms.
[2022-05-19 05:57:15] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned sat
[2022-05-19 05:57:15] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2022-05-19 05:57:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 05:57:15] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2022-05-19 05:57:15] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 05:57:15] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-19 05:57:15] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-19 05:57:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 05:57:15] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2022-05-19 05:57:15] [INFO ] [Nat]Added 1 Read/Feed constraints in 5 ms returned sat
[2022-05-19 05:57:15] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2022-05-19 05:57:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 39 ms
[2022-05-19 05:57:15] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 5 ms.
[2022-05-19 05:57:15] [INFO ] Added : 21 causal constraints over 5 iterations in 28 ms. Result :sat
Minimization took 43 ms.
[2022-05-19 05:57:15] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-19 05:57:15] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2022-05-19 05:57:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 05:57:15] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2022-05-19 05:57:15] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 05:57:15] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-19 05:57:15] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-19 05:57:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 05:57:15] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2022-05-19 05:57:15] [INFO ] [Nat]Added 1 Read/Feed constraints in 35 ms returned sat
[2022-05-19 05:57:15] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-19 05:57:15] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 1 ms to minimize.
[2022-05-19 05:57:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 38 ms
[2022-05-19 05:57:15] [INFO ] Added : 36 causal constraints over 8 iterations in 85 ms. Result :sat
Minimization took 14 ms.
[2022-05-19 05:57:15] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-19 05:57:15] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-19 05:57:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 05:57:15] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2022-05-19 05:57:15] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 05:57:15] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-19 05:57:15] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-19 05:57:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 05:57:15] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2022-05-19 05:57:15] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2022-05-19 05:57:15] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 0 ms to minimize.
[2022-05-19 05:57:15] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 1 ms to minimize.
[2022-05-19 05:57:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 55 ms
[2022-05-19 05:57:15] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-19 05:57:16] [INFO ] Added : 36 causal constraints over 8 iterations in 39 ms. Result :sat
Minimization took 13 ms.
Current structural bounds on expressions (after SMT) : [-1, 1, 1, 3, -1, 5, 1, -1, -1, 10, 3, -1, -1]
FORMULA PolyORBNT-COL-S05J80-UpperBounds-04 3 TECHNIQUES TOPOLOGICAL SAT_SMT CPN_APPROX INITIAL_STATE
Transition Run forces synchronizations/join behavior on parameter j of sort Jobs
Transition trans_376 forces synchronizations/join behavior on parameter s of sort Sources
Symmetric sort wr.t. initial and guards and successors and join/free detected :States
Arc [42:1*[$t, 0, $j]] contains constants of sort States
Transition WillPerformWork : constants on arcs in [[42:1*[$t, 0, $j]]] introduces in States(2) partition with 1 elements that refines current partition to 2 subsets.
[2022-05-19 05:57:16] [INFO ] Unfolded HLPN to a Petri net with 1269 places and 2430 transitions 14624 arcs in 52 ms.
[2022-05-19 05:57:16] [INFO ] Unfolded 12 HLPN properties in 1 ms.
Deduced a syphon composed of 80 places in 12 ms
Reduce places removed 80 places and 80 transitions.
Ensure Unique test removed 655 transitions
Reduce redundant transitions removed 655 transitions.
Incomplete random walk after 10000 steps, including 694 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 12) seen :19
FORMULA PolyORBNT-COL-S05J80-UpperBounds-13 3 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S05J80-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S05J80-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 249 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 10001 steps, including 107 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 9) seen :14
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 9) seen :10
Incomplete Best-First random walk after 10001 steps, including 118 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 9) seen :14
Incomplete Best-First random walk after 10001 steps, including 109 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 9) seen :10
Incomplete Best-First random walk after 10001 steps, including 115 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 9) seen :14
Incomplete Best-First random walk after 10001 steps, including 64 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 9) seen :10
Incomplete Best-First random walk after 10000 steps, including 117 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 9) seen :14
Incomplete Best-First random walk after 10001 steps, including 78 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 9) seen :14
[2022-05-19 05:57:16] [INFO ] Flow matrix only has 1691 transitions (discarded 4 similar events)
// Phase 1: matrix 1691 rows 1189 cols
[2022-05-19 05:57:16] [INFO ] Computed 182 place invariants in 195 ms
[2022-05-19 05:57:16] [INFO ] [Real]Absence check using 175 positive place invariants in 47 ms returned sat
[2022-05-19 05:57:16] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 38 ms returned unsat
[2022-05-19 05:57:17] [INFO ] [Real]Absence check using 175 positive place invariants in 46 ms returned sat
[2022-05-19 05:57:17] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 32 ms returned unsat
[2022-05-19 05:57:17] [INFO ] [Real]Absence check using 175 positive place invariants in 53 ms returned sat
[2022-05-19 05:57:17] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 51 ms returned unsat
[2022-05-19 05:57:17] [INFO ] [Real]Absence check using 175 positive place invariants in 49 ms returned sat
[2022-05-19 05:57:17] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 26 ms returned sat
[2022-05-19 05:57:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 05:57:18] [INFO ] [Real]Absence check using state equation in 503 ms returned sat
[2022-05-19 05:57:18] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 05:57:18] [INFO ] [Nat]Absence check using 175 positive place invariants in 52 ms returned sat
[2022-05-19 05:57:18] [INFO ] [Nat]Absence check using 175 positive and 7 generalized place invariants in 22 ms returned sat
[2022-05-19 05:57:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 05:57:18] [INFO ] [Nat]Absence check using state equation in 459 ms returned sat
[2022-05-19 05:57:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 05:57:18] [INFO ] [Nat]Added 1 Read/Feed constraints in 106 ms returned sat
[2022-05-19 05:57:19] [INFO ] Computed and/alt/rep : 949/2209/949 causal constraints (skipped 736 transitions) in 151 ms.
[2022-05-19 05:57:19] [INFO ] Added : 8 causal constraints over 2 iterations in 510 ms. Result :sat
Minimization took 267 ms.
[2022-05-19 05:57:19] [INFO ] [Real]Absence check using 175 positive place invariants in 50 ms returned sat
[2022-05-19 05:57:19] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 21 ms returned unsat
[2022-05-19 05:57:20] [INFO ] [Real]Absence check using 175 positive place invariants in 50 ms returned sat
[2022-05-19 05:57:20] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 24 ms returned sat
[2022-05-19 05:57:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 05:57:20] [INFO ] [Real]Absence check using state equation in 500 ms returned sat
[2022-05-19 05:57:20] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 05:57:20] [INFO ] [Nat]Absence check using 175 positive place invariants in 63 ms returned sat
[2022-05-19 05:57:20] [INFO ] [Nat]Absence check using 175 positive and 7 generalized place invariants in 18 ms returned unsat
[2022-05-19 05:57:21] [INFO ] [Real]Absence check using 175 positive place invariants in 47 ms returned sat
[2022-05-19 05:57:21] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 24 ms returned sat
[2022-05-19 05:57:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 05:57:21] [INFO ] [Real]Absence check using state equation in 843 ms returned sat
[2022-05-19 05:57:21] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 05:57:22] [INFO ] [Nat]Absence check using 175 positive place invariants in 65 ms returned sat
[2022-05-19 05:57:22] [INFO ] [Nat]Absence check using 175 positive and 7 generalized place invariants in 23 ms returned sat
[2022-05-19 05:57:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 05:57:26] [INFO ] [Nat]Absence check using state equation in 4789 ms returned unknown
[2022-05-19 05:57:27] [INFO ] [Real]Absence check using 175 positive place invariants in 47 ms returned sat
[2022-05-19 05:57:27] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 34 ms returned unsat
[2022-05-19 05:57:27] [INFO ] [Real]Absence check using 175 positive place invariants in 46 ms returned sat
[2022-05-19 05:57:27] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 25 ms returned unsat
Current structural bounds on expressions (after SMT) : [1, 1, 4, 1, 1, 1, 10, 1, 1] Max seen :[1, 1, 4, 0, 1, 1, 4, 1, 1]
FORMULA PolyORBNT-COL-S05J80-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J80-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J80-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J80-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J80-UpperBounds-06 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J80-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J80-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J80-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 1 out of 1189 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1189/1189 places, 1695/1695 transitions.
Ensure Unique test removed 5 places
Drop transitions removed 86 transitions
Trivial Post-agglo rules discarded 86 transitions
Performed 86 trivial Post agglomeration. Transition count delta: 86
Iterating post reduction 0 with 91 rules applied. Total rules applied 91 place count 1184 transition count 1609
Reduce places removed 86 places and 0 transitions.
Iterating post reduction 1 with 86 rules applied. Total rules applied 177 place count 1098 transition count 1609
Performed 85 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 85 Pre rules applied. Total rules applied 177 place count 1098 transition count 1524
Deduced a syphon composed of 85 places in 2 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 2 with 170 rules applied. Total rules applied 347 place count 1013 transition count 1524
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 348 place count 1012 transition count 1523
Iterating global reduction 2 with 1 rules applied. Total rules applied 349 place count 1012 transition count 1523
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 353 place count 1010 transition count 1521
Applied a total of 353 rules in 690 ms. Remains 1010 /1189 variables (removed 179) and now considering 1521/1695 (removed 174) transitions.
[2022-05-19 05:57:28] [INFO ] Flow matrix only has 1517 transitions (discarded 4 similar events)
// Phase 1: matrix 1517 rows 1010 cols
[2022-05-19 05:57:28] [INFO ] Computed 177 place invariants in 125 ms
[2022-05-19 05:57:29] [INFO ] Dead Transitions using invariants and state equation in 1209 ms found 95 transitions.
Found 95 dead transitions using SMT.
Drop transitions removed 95 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 95 transitions.
Starting structural reductions in SAFETY mode, iteration 1 : 1010/1189 places, 1426/1695 transitions.
Applied a total of 0 rules in 93 ms. Remains 1010 /1010 variables (removed 0) and now considering 1426/1426 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1010/1189 places, 1426/1695 transitions.
Normalized transition count is 1422 out of 1426 initially.
// Phase 1: matrix 1422 rows 1010 cols
[2022-05-19 05:57:29] [INFO ] Computed 177 place invariants in 28 ms
Incomplete random walk after 1000000 steps, including 52054 resets, run finished after 6101 ms. (steps per millisecond=163 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 1000001 steps, including 1922 resets, run finished after 1481 ms. (steps per millisecond=675 ) properties (out of 1) seen :4
[2022-05-19 05:57:37] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
// Phase 1: matrix 1422 rows 1010 cols
[2022-05-19 05:57:37] [INFO ] Computed 177 place invariants in 33 ms
[2022-05-19 05:57:37] [INFO ] [Real]Absence check using 170 positive place invariants in 37 ms returned sat
[2022-05-19 05:57:37] [INFO ] [Real]Absence check using 170 positive and 7 generalized place invariants in 22 ms returned sat
[2022-05-19 05:57:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 05:57:37] [INFO ] [Real]Absence check using state equation in 624 ms returned sat
[2022-05-19 05:57:37] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 05:57:38] [INFO ] [Nat]Absence check using 170 positive place invariants in 38 ms returned sat
[2022-05-19 05:57:38] [INFO ] [Nat]Absence check using 170 positive and 7 generalized place invariants in 21 ms returned sat
[2022-05-19 05:57:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 05:57:44] [INFO ] [Nat]Absence check using state equation in 6336 ms returned unsat
Current structural bounds on expressions (after SMT) : [4] Max seen :[4]
FORMULA PolyORBNT-COL-S05J80-UpperBounds-12 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 32642 ms.

BK_STOP 1652939864536

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBNT-COL-S05J80"
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 PolyORBNT-COL-S05J80, 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 r168-tall-165277017100765"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-COL-S05J80.tgz
mv PolyORBNT-COL-S05J80 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 ;