About the Execution of 2023-gold for PolyORBLF-COL-S04J04T06
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 610.495 | 27030.00 | 43321.00 | 118.20 | 1 1 3 5 1 1 3 4 3 2 1 1 1 4 1 1 | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2024-input.r307-tajo-171654460400076.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is PolyORBLF-COL-S04J04T06, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r307-tajo-171654460400076
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 600K
-rw-r--r-- 1 mcc users 8.9K Apr 11 17:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K Apr 11 17:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Apr 11 17:00 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Apr 11 17:00 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.3K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 11 17:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 90K Apr 11 17:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 11 17:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 86K Apr 11 17:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 154K May 18 16:43 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 PolyORBLF-COL-S04J04T06-UpperBounds-00
FORMULA_NAME PolyORBLF-COL-S04J04T06-UpperBounds-01
FORMULA_NAME PolyORBLF-COL-S04J04T06-UpperBounds-02
FORMULA_NAME PolyORBLF-COL-S04J04T06-UpperBounds-03
FORMULA_NAME PolyORBLF-COL-S04J04T06-UpperBounds-04
FORMULA_NAME PolyORBLF-COL-S04J04T06-UpperBounds-05
FORMULA_NAME PolyORBLF-COL-S04J04T06-UpperBounds-06
FORMULA_NAME PolyORBLF-COL-S04J04T06-UpperBounds-07
FORMULA_NAME PolyORBLF-COL-S04J04T06-UpperBounds-08
FORMULA_NAME PolyORBLF-COL-S04J04T06-UpperBounds-09
FORMULA_NAME PolyORBLF-COL-S04J04T06-UpperBounds-10
FORMULA_NAME PolyORBLF-COL-S04J04T06-UpperBounds-11
FORMULA_NAME PolyORBLF-COL-S04J04T06-UpperBounds-12
FORMULA_NAME PolyORBLF-COL-S04J04T06-UpperBounds-13
FORMULA_NAME PolyORBLF-COL-S04J04T06-UpperBounds-14
FORMULA_NAME PolyORBLF-COL-S04J04T06-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1717110238633
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-COL-S04J04T06
Not applying reductions.
Model is COL
UpperBounds COL
Running Version 202304061127
[2024-05-30 23:04:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-30 23:04:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 23:04:00] [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.
[2024-05-30 23:04:01] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-30 23:04:01] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 812 ms
[2024-05-30 23:04:01] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 554 PT places and 3040.0 transition bindings in 56 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
[2024-05-30 23:04:01] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 6 ms.
[2024-05-30 23:04:01] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
Normalized transition count is 64 out of 65 initially.
// Phase 1: matrix 64 rows 81 cols
[2024-05-30 23:04:01] [INFO ] Computed 26 invariants in 11 ms
FORMULA PolyORBLF-COL-S04J04T06-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2024-05-30 23:04:01] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2024-05-30 23:04:01] [INFO ] Computed 26 invariants in 7 ms
[2024-05-30 23:04:01] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2024-05-30 23:04:01] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 8 ms returned sat
[2024-05-30 23:04:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-30 23:04:01] [INFO ] [Real]Absence check using state equation in 72 ms returned sat
[2024-05-30 23:04:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 23:04:02] [INFO ] [Nat]Absence check using 11 positive place invariants in 17 ms returned sat
[2024-05-30 23:04:02] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2024-05-30 23:04:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-30 23:04:02] [INFO ] [Nat]Absence check using state equation in 91 ms returned sat
[2024-05-30 23:04:02] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-30 23:04:02] [INFO ] [Nat]Added 8 Read/Feed constraints in 32 ms returned sat
[2024-05-30 23:04:02] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 14 ms.
[2024-05-30 23:04:02] [INFO ] Deduced a trap composed of 27 places in 126 ms of which 5 ms to minimize.
[2024-05-30 23:04:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 174 ms
[2024-05-30 23:04:02] [INFO ] Added : 61 causal constraints over 14 iterations in 401 ms. Result :sat
Minimization took 24 ms.
[2024-05-30 23:04:02] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-05-30 23:04:02] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2024-05-30 23:04:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-30 23:04:02] [INFO ] [Real]Absence check using state equation in 76 ms returned sat
[2024-05-30 23:04:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 23:04:02] [INFO ] [Nat]Absence check using 11 positive place invariants in 34 ms returned sat
[2024-05-30 23:04:02] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 41 ms returned sat
[2024-05-30 23:04:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-30 23:04:03] [INFO ] [Nat]Absence check using state equation in 132 ms returned sat
[2024-05-30 23:04:03] [INFO ] [Nat]Added 8 Read/Feed constraints in 5 ms returned sat
[2024-05-30 23:04:03] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-30 23:04:03] [INFO ] Added : 35 causal constraints over 7 iterations in 104 ms. Result :sat
Minimization took 85 ms.
[2024-05-30 23:04:03] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-30 23:04:03] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 38 ms returned sat
[2024-05-30 23:04:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-30 23:04:03] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2024-05-30 23:04:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 23:04:03] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-30 23:04:03] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2024-05-30 23:04:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-30 23:04:03] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2024-05-30 23:04:03] [INFO ] [Nat]Added 8 Read/Feed constraints in 9 ms returned sat
[2024-05-30 23:04:03] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-05-30 23:04:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 45 ms
[2024-05-30 23:04:03] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-30 23:04:03] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2024-05-30 23:04:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-30 23:04:03] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2024-05-30 23:04:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 23:04:03] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-30 23:04:03] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-30 23:04:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-30 23:04:03] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2024-05-30 23:04:03] [INFO ] [Nat]Added 8 Read/Feed constraints in 5 ms returned sat
[2024-05-30 23:04:03] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 17 ms.
[2024-05-30 23:04:03] [INFO ] Added : 28 causal constraints over 6 iterations in 72 ms. Result :sat
Minimization took 27 ms.
[2024-05-30 23:04:03] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-30 23:04:03] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned unsat
[2024-05-30 23:04:03] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-30 23:04:03] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-30 23:04:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-30 23:04:03] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2024-05-30 23:04:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 23:04:03] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-30 23:04:03] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2024-05-30 23:04:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-30 23:04:04] [INFO ] [Nat]Absence check using state equation in 76 ms returned sat
[2024-05-30 23:04:04] [INFO ] [Nat]Added 8 Read/Feed constraints in 9 ms returned sat
[2024-05-30 23:04:04] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 0 ms to minimize.
[2024-05-30 23:04:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 54 ms
[2024-05-30 23:04:04] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-30 23:04:04] [INFO ] Added : 26 causal constraints over 6 iterations in 57 ms. Result :sat
Minimization took 24 ms.
[2024-05-30 23:04:04] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-30 23:04:04] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-30 23:04:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-30 23:04:04] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2024-05-30 23:04:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 23:04:04] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-30 23:04:04] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-30 23:04:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-30 23:04:04] [INFO ] [Nat]Absence check using state equation in 177 ms returned sat
[2024-05-30 23:04:04] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2024-05-30 23:04:04] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 15 ms.
[2024-05-30 23:04:04] [INFO ] Added : 3 causal constraints over 1 iterations in 47 ms. Result :sat
Minimization took 12 ms.
[2024-05-30 23:04:04] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-30 23:04:04] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2024-05-30 23:04:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-30 23:04:04] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2024-05-30 23:04:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 23:04:04] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-30 23:04:04] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 8 ms returned sat
[2024-05-30 23:04:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-30 23:04:04] [INFO ] [Nat]Absence check using state equation in 154 ms returned sat
[2024-05-30 23:04:04] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2024-05-30 23:04:04] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-30 23:04:04] [INFO ] Added : 3 causal constraints over 1 iterations in 12 ms. Result :sat
Minimization took 12 ms.
[2024-05-30 23:04:04] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-30 23:04:04] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2024-05-30 23:04:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-30 23:04:04] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2024-05-30 23:04:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 23:04:04] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-30 23:04:04] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2024-05-30 23:04:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-30 23:04:04] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2024-05-30 23:04:04] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2024-05-30 23:04:04] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 10 ms.
[2024-05-30 23:04:05] [INFO ] Added : 26 causal constraints over 6 iterations in 66 ms. Result :sat
Minimization took 20 ms.
[2024-05-30 23:04:05] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-30 23:04:05] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-30 23:04:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-30 23:04:05] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2024-05-30 23:04:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 23:04:05] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-30 23:04:05] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2024-05-30 23:04:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-30 23:04:05] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2024-05-30 23:04:05] [INFO ] [Nat]Added 8 Read/Feed constraints in 6 ms returned sat
[2024-05-30 23:04:05] [INFO ] Deduced a trap composed of 30 places in 26 ms of which 1 ms to minimize.
[2024-05-30 23:04:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 53 ms
[2024-05-30 23:04:05] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 16 ms.
[2024-05-30 23:04:05] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
[2024-05-30 23:04:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 62 ms
[2024-05-30 23:04:05] [INFO ] Added : 56 causal constraints over 12 iterations in 198 ms. Result :sat
Minimization took 18 ms.
[2024-05-30 23:04:05] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-30 23:04:05] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-30 23:04:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-30 23:04:05] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2024-05-30 23:04:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 23:04:05] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2024-05-30 23:04:05] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2024-05-30 23:04:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-30 23:04:05] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2024-05-30 23:04:05] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2024-05-30 23:04:05] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 8 ms.
[2024-05-30 23:04:05] [INFO ] Added : 33 causal constraints over 7 iterations in 93 ms. Result :sat
Minimization took 13 ms.
[2024-05-30 23:04:05] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-30 23:04:05] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-30 23:04:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-30 23:04:05] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2024-05-30 23:04:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 23:04:05] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-30 23:04:05] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2024-05-30 23:04:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-30 23:04:05] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2024-05-30 23:04:05] [INFO ] [Nat]Added 8 Read/Feed constraints in 20 ms returned sat
[2024-05-30 23:04:05] [INFO ] Deduced a trap composed of 33 places in 40 ms of which 0 ms to minimize.
[2024-05-30 23:04:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 53 ms
[2024-05-30 23:04:05] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 9 ms.
[2024-05-30 23:04:06] [INFO ] Deduced a trap composed of 29 places in 31 ms of which 0 ms to minimize.
[2024-05-30 23:04:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 48 ms
[2024-05-30 23:04:06] [INFO ] Added : 63 causal constraints over 18 iterations in 212 ms. Result :sat
Minimization took 20 ms.
[2024-05-30 23:04:06] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-30 23:04:06] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2024-05-30 23:04:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-30 23:04:06] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2024-05-30 23:04:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 23:04:06] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-30 23:04:06] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-30 23:04:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-30 23:04:06] [INFO ] [Nat]Absence check using state equation in 87 ms returned sat
[2024-05-30 23:04:06] [INFO ] [Nat]Added 8 Read/Feed constraints in 5 ms returned sat
[2024-05-30 23:04:06] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-30 23:04:06] [INFO ] Added : 3 causal constraints over 1 iterations in 12 ms. Result :sat
Minimization took 13 ms.
[2024-05-30 23:04:06] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-30 23:04:06] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2024-05-30 23:04:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-30 23:04:06] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2024-05-30 23:04:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 23:04:06] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-30 23:04:06] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2024-05-30 23:04:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-30 23:04:06] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2024-05-30 23:04:06] [INFO ] [Nat]Added 8 Read/Feed constraints in 6 ms returned sat
[2024-05-30 23:04:06] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-30 23:04:06] [INFO ] Added : 58 causal constraints over 12 iterations in 92 ms. Result :sat
Minimization took 17 ms.
[2024-05-30 23:04:06] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-30 23:04:06] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned unsat
Current structural bounds on expressions (after SMT) : [1, 3, 5, 1, 1, 4, 4, 3, 2, 1, 1, 6, 4, 4, 1]
FORMULA PolyORBLF-COL-S04J04T06-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT CPN_APPROX INITIAL_STATE
FORMULA PolyORBLF-COL-S04J04T06-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT CPN_APPROX INITIAL_STATE
FORMULA PolyORBLF-COL-S04J04T06-UpperBounds-03 5 TECHNIQUES TOPOLOGICAL SAT_SMT CPN_APPROX INITIAL_STATE
Transition T_2315 forces synchronizations/join behavior on parameter t of sort Threads
Transition GoPerformWork forces synchronizations/join behavior on parameter j of sort Jobs
Transition T_0376 forces synchronizations/join behavior on parameter s of sort Sources
[2024-05-30 23:04:06] [INFO ] Unfolded HLPN to a Petri net with 554 places and 2998 transitions 20754 arcs in 91 ms.
[2024-05-30 23:04:06] [INFO ] Unfolded 12 HLPN properties in 0 ms.
Ensure Unique test removed 1626 transitions
Reduce redundant transitions removed 1626 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 12) seen :25
FORMULA PolyORBLF-COL-S04J04T06-UpperBounds-13 4 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S04J04T06-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S04J04T06-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S04J04T06-UpperBounds-09 2 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S04J04T06-UpperBounds-08 3 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S04J04T06-UpperBounds-07 4 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S04J04T06-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S04J04T06-UpperBounds-02 3 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S04J04T06-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :5
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 3) seen :5
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 3) seen :5
[2024-05-30 23:04:07] [INFO ] Flow matrix only has 1348 transitions (discarded 24 similar events)
// Phase 1: matrix 1348 rows 554 cols
[2024-05-30 23:04:07] [INFO ] Computed 50 invariants in 98 ms
[2024-05-30 23:04:07] [INFO ] [Real]Absence check using 19 positive place invariants in 115 ms returned sat
[2024-05-30 23:04:07] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 40 ms returned sat
[2024-05-30 23:04:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-30 23:04:07] [INFO ] [Real]Absence check using state equation in 312 ms returned sat
[2024-05-30 23:04:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 23:04:07] [INFO ] [Nat]Absence check using 19 positive place invariants in 6 ms returned sat
[2024-05-30 23:04:07] [INFO ] [Nat]Absence check using 19 positive and 31 generalized place invariants in 11 ms returned sat
[2024-05-30 23:04:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-30 23:04:08] [INFO ] [Nat]Absence check using state equation in 433 ms returned sat
[2024-05-30 23:04:08] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-30 23:04:09] [INFO ] [Nat]Added 120 Read/Feed constraints in 1434 ms returned sat
[2024-05-30 23:04:10] [INFO ] Deduced a trap composed of 212 places in 355 ms of which 1 ms to minimize.
[2024-05-30 23:04:10] [INFO ] Deduced a trap composed of 75 places in 371 ms of which 1 ms to minimize.
[2024-05-30 23:04:11] [INFO ] Deduced a trap composed of 167 places in 362 ms of which 1 ms to minimize.
[2024-05-30 23:04:12] [INFO ] Deduced a trap composed of 174 places in 458 ms of which 1 ms to minimize.
[2024-05-30 23:04:13] [INFO ] Deduced a trap composed of 75 places in 475 ms of which 1 ms to minimize.
[2024-05-30 23:04:13] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:919)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-30 23:04:13] [INFO ] [Real]Absence check using 19 positive place invariants in 6 ms returned sat
[2024-05-30 23:04:13] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 11 ms returned unsat
[2024-05-30 23:04:13] [INFO ] [Real]Absence check using 19 positive place invariants in 8 ms returned sat
[2024-05-30 23:04:13] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 16 ms returned unsat
Current structural bounds on expressions (after SMT) : [4, 1, 1] Max seen :[3, 1, 1]
FORMULA PolyORBLF-COL-S04J04T06-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S04J04T06-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 24 out of 554 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 554/554 places, 1372/1372 transitions.
Ensure Unique test removed 4 places
Drop transitions removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 58 rules applied. Total rules applied 58 place count 550 transition count 1318
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 112 place count 496 transition count 1318
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 60 Pre rules applied. Total rules applied 112 place count 496 transition count 1258
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 232 place count 436 transition count 1258
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 352 place count 376 transition count 1198
Free-agglomeration rule (complex) applied 12 times.
Iterating global reduction 2 with 12 rules applied. Total rules applied 364 place count 376 transition count 1186
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 376 place count 364 transition count 1186
Applied a total of 376 rules in 230 ms. Remains 364 /554 variables (removed 190) and now considering 1186/1372 (removed 186) transitions.
[2024-05-30 23:04:13] [INFO ] Flow matrix only has 1162 transitions (discarded 24 similar events)
// Phase 1: matrix 1162 rows 364 cols
[2024-05-30 23:04:13] [INFO ] Computed 46 invariants in 63 ms
[2024-05-30 23:04:14] [INFO ] Dead Transitions using invariants and state equation in 728 ms found 324 transitions.
Found 324 dead transitions using SMT.
Drop transitions removed 324 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 324 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 364/554 places, 862/1372 transitions.
Applied a total of 0 rules in 51 ms. Remains 364 /364 variables (removed 0) and now considering 862/862 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1027 ms. Remains : 364/554 places, 862/1372 transitions.
Normalized transition count is 838 out of 862 initially.
// Phase 1: matrix 838 rows 364 cols
[2024-05-30 23:04:14] [INFO ] Computed 46 invariants in 13 ms
Incomplete random walk after 1000000 steps, including 173 resets, run finished after 4108 ms. (steps per millisecond=243 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 1085 resets, run finished after 1814 ms. (steps per millisecond=551 ) properties (out of 1) seen :3
[2024-05-30 23:04:20] [INFO ] Flow matrix only has 838 transitions (discarded 24 similar events)
// Phase 1: matrix 838 rows 364 cols
[2024-05-30 23:04:20] [INFO ] Computed 46 invariants in 28 ms
[2024-05-30 23:04:20] [INFO ] [Real]Absence check using 12 positive place invariants in 6 ms returned sat
[2024-05-30 23:04:20] [INFO ] [Real]Absence check using 12 positive and 34 generalized place invariants in 31 ms returned sat
[2024-05-30 23:04:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-30 23:04:21] [INFO ] [Real]Absence check using state equation in 348 ms returned sat
[2024-05-30 23:04:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 23:04:21] [INFO ] [Nat]Absence check using 12 positive place invariants in 5 ms returned sat
[2024-05-30 23:04:21] [INFO ] [Nat]Absence check using 12 positive and 34 generalized place invariants in 16 ms returned sat
[2024-05-30 23:04:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-30 23:04:21] [INFO ] [Nat]Absence check using state equation in 208 ms returned sat
[2024-05-30 23:04:21] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-30 23:04:22] [INFO ] [Nat]Added 120 Read/Feed constraints in 700 ms returned sat
[2024-05-30 23:04:22] [INFO ] Deduced a trap composed of 69 places in 196 ms of which 0 ms to minimize.
[2024-05-30 23:04:22] [INFO ] Deduced a trap composed of 44 places in 191 ms of which 1 ms to minimize.
[2024-05-30 23:04:22] [INFO ] Deduced a trap composed of 99 places in 188 ms of which 1 ms to minimize.
[2024-05-30 23:04:23] [INFO ] Deduced a trap composed of 98 places in 221 ms of which 1 ms to minimize.
[2024-05-30 23:04:23] [INFO ] Deduced a trap composed of 105 places in 158 ms of which 0 ms to minimize.
[2024-05-30 23:04:24] [INFO ] Deduced a trap composed of 44 places in 193 ms of which 1 ms to minimize.
[2024-05-30 23:04:24] [INFO ] Deduced a trap composed of 142 places in 165 ms of which 0 ms to minimize.
[2024-05-30 23:04:24] [INFO ] Deduced a trap composed of 114 places in 219 ms of which 1 ms to minimize.
[2024-05-30 23:04:25] [INFO ] Deduced a trap composed of 46 places in 171 ms of which 1 ms to minimize.
[2024-05-30 23:04:25] [INFO ] Deduced a trap composed of 95 places in 179 ms of which 1 ms to minimize.
[2024-05-30 23:04:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 10 trap constraints in 3235 ms
Current structural bounds on expressions (after SMT) : [3] Max seen :[3]
FORMULA PolyORBLF-COL-S04J04T06-UpperBounds-06 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 24753 ms.
BK_STOP 1717110265663
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
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="PolyORBLF-COL-S04J04T06"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is PolyORBLF-COL-S04J04T06, 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 r307-tajo-171654460400076"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-COL-S04J04T06.tgz
mv PolyORBLF-COL-S04J04T06 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;