About the Execution of 2023-gold for PolyORBNT-COL-S10J80
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
720.623 | 66847.00 | 86165.00 | 251.50 | 1 4 1 3 1 1 3 10 1 1 4 10 1 4 1 81 | 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-171654460800271.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 PolyORBNT-COL-S10J80, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r307-tajo-171654460800271
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 600K
-rw-r--r-- 1 mcc users 6.7K Apr 12 11:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Apr 12 11:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Apr 12 10:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 12 10:45 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:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 12 14:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 150K Apr 12 14:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 12 13:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 97K Apr 12 13:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 95K 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 PolyORBNT-COL-S10J80-UpperBounds-00
FORMULA_NAME PolyORBNT-COL-S10J80-UpperBounds-01
FORMULA_NAME PolyORBNT-COL-S10J80-UpperBounds-02
FORMULA_NAME PolyORBNT-COL-S10J80-UpperBounds-03
FORMULA_NAME PolyORBNT-COL-S10J80-UpperBounds-04
FORMULA_NAME PolyORBNT-COL-S10J80-UpperBounds-05
FORMULA_NAME PolyORBNT-COL-S10J80-UpperBounds-06
FORMULA_NAME PolyORBNT-COL-S10J80-UpperBounds-07
FORMULA_NAME PolyORBNT-COL-S10J80-UpperBounds-08
FORMULA_NAME PolyORBNT-COL-S10J80-UpperBounds-09
FORMULA_NAME PolyORBNT-COL-S10J80-UpperBounds-10
FORMULA_NAME PolyORBNT-COL-S10J80-UpperBounds-11
FORMULA_NAME PolyORBNT-COL-S10J80-UpperBounds-12
FORMULA_NAME PolyORBNT-COL-S10J80-UpperBounds-13
FORMULA_NAME PolyORBNT-COL-S10J80-UpperBounds-14
FORMULA_NAME PolyORBNT-COL-S10J80-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1717129796785
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=PolyORBNT-COL-S10J80
Not applying reductions.
Model is COL
UpperBounds COL
Running Version 202304061127
[2024-05-31 04:29:58] [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-31 04:29:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 04:29:58] [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-31 04:29:59] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-31 04:29:59] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 504 ms
[2024-05-31 04:29:59] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 1694 PT places and 13742.0 transition bindings in 19 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
[2024-05-31 04:29:59] [INFO ] Built PT skeleton of HLPN with 48 places and 38 transitions 140 arcs in 4 ms.
[2024-05-31 04:29:59] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
// Phase 1: matrix 38 rows 48 cols
[2024-05-31 04:29:59] [INFO ] Computed 13 invariants in 6 ms
FORMULA PolyORBNT-COL-S10J80-UpperBounds-15 81 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBNT-COL-S10J80-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBNT-COL-S10J80-UpperBounds-11 10 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBNT-COL-S10J80-UpperBounds-07 10 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBNT-COL-S10J80-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2024-05-31 04:29:59] [INFO ] Invariant cache hit.
[2024-05-31 04:29:59] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2024-05-31 04:29:59] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-31 04:29:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 04:29:59] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2024-05-31 04:29:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 04:29:59] [INFO ] [Nat]Absence check using 6 positive place invariants in 8 ms returned sat
[2024-05-31 04:29:59] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2024-05-31 04:29:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 04:29:59] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2024-05-31 04:29:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 04:29:59] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-31 04:29:59] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 3 ms to minimize.
[2024-05-31 04:29:59] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 1 ms to minimize.
[2024-05-31 04:29:59] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2024-05-31 04:29:59] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 167 ms
[2024-05-31 04:29:59] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-31 04:29:59] [INFO ] Added : 36 causal constraints over 8 iterations in 41 ms. Result :sat
Minimization took 21 ms.
[2024-05-31 04:29:59] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-31 04:29:59] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-31 04:29:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 04:29:59] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-05-31 04:29:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 04:29:59] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-05-31 04:29:59] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2024-05-31 04:29:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 04:30:00] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2024-05-31 04:30:00] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-31 04:30:00] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 16 ms.
[2024-05-31 04:30:00] [INFO ] Added : 21 causal constraints over 5 iterations in 357 ms. Result :sat
Minimization took 204 ms.
[2024-05-31 04:30:00] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-31 04:30:00] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-31 04:30:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 04:30:00] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2024-05-31 04:30:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 04:30:00] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-05-31 04:30:00] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2024-05-31 04:30:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 04:30:00] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2024-05-31 04:30:00] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-31 04:30:00] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 7 ms.
[2024-05-31 04:30:00] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 1 ms to minimize.
[2024-05-31 04:30:00] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 0 ms to minimize.
[2024-05-31 04:30:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 97 ms
[2024-05-31 04:30:00] [INFO ] Added : 36 causal constraints over 8 iterations in 203 ms. Result :sat
Minimization took 13 ms.
[2024-05-31 04:30:01] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-31 04:30:01] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-31 04:30:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 04:30:01] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-05-31 04:30:01] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 04:30:01] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-31 04:30:01] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-31 04:30:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 04:30:01] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2024-05-31 04:30:01] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-05-31 04:30:01] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
[2024-05-31 04:30:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 78 ms
[2024-05-31 04:30:01] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-31 04:30:01] [INFO ] Added : 21 causal constraints over 5 iterations in 29 ms. Result :sat
Minimization took 51 ms.
[2024-05-31 04:30:01] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-05-31 04:30:01] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2024-05-31 04:30:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 04:30:01] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-05-31 04:30:01] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 04:30:01] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-31 04:30:01] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-31 04:30:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 04:30:01] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2024-05-31 04:30:01] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-31 04:30:01] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-31 04:30:01] [INFO ] Added : 4 causal constraints over 1 iterations in 17 ms. Result :sat
Minimization took 7 ms.
[2024-05-31 04:30:01] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-31 04:30:01] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned unsat
[2024-05-31 04:30:01] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-31 04:30:01] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2024-05-31 04:30:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 04:30:01] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-05-31 04:30:01] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 04:30:01] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-31 04:30:01] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-31 04:30:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 04:30:01] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-05-31 04:30:01] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-05-31 04:30:01] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 0 ms to minimize.
[2024-05-31 04:30:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 31 ms
[2024-05-31 04:30:01] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 11 ms.
[2024-05-31 04:30:01] [INFO ] Deduced a trap composed of 25 places in 73 ms of which 0 ms to minimize.
[2024-05-31 04:30:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 81 ms
[2024-05-31 04:30:01] [INFO ] Added : 33 causal constraints over 7 iterations in 191 ms. Result :sat
Minimization took 22 ms.
[2024-05-31 04:30:01] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-05-31 04:30:01] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2024-05-31 04:30:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 04:30:01] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-05-31 04:30:01] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 04:30:01] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-31 04:30:01] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2024-05-31 04:30:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 04:30:01] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2024-05-31 04:30:01] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-31 04:30:01] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-31 04:30:01] [INFO ] Added : 3 causal constraints over 1 iterations in 10 ms. Result :sat
Minimization took 13 ms.
[2024-05-31 04:30:01] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-31 04:30:01] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-31 04:30:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 04:30:01] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-05-31 04:30:01] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 04:30:01] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-31 04:30:01] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-31 04:30:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 04:30:02] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-05-31 04:30:02] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-31 04:30:02] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 0 ms to minimize.
[2024-05-31 04:30:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 35 ms
[2024-05-31 04:30:02] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-31 04:30:02] [INFO ] Added : 19 causal constraints over 4 iterations in 325 ms. Result :sat
Minimization took 104 ms.
[2024-05-31 04:30:02] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-31 04:30:02] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-31 04:30:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 04:30:02] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-05-31 04:30:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 04:30:02] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-31 04:30:02] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-31 04:30:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 04:30:02] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-05-31 04:30:02] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-31 04:30:02] [INFO ] Deduced a trap composed of 14 places in 20 ms of which 0 ms to minimize.
[2024-05-31 04:30:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
[2024-05-31 04:30:02] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-31 04:30:02] [INFO ] Added : 10 causal constraints over 2 iterations in 364 ms. Result :sat
Minimization took 71 ms.
[2024-05-31 04:30:03] [INFO ] [Real]Absence check using 6 positive place invariants in 9 ms returned sat
[2024-05-31 04:30:03] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-31 04:30:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 04:30:03] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-05-31 04:30:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 04:30:03] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-05-31 04:30:03] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2024-05-31 04:30:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 04:30:03] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-05-31 04:30:03] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-31 04:30:03] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 1 ms to minimize.
[2024-05-31 04:30:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 31 ms
[2024-05-31 04:30:03] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-31 04:30:03] [INFO ] Added : 36 causal constraints over 8 iterations in 51 ms. Result :sat
Minimization took 13 ms.
Current structural bounds on expressions (after SMT) : [-1, 10, -1, 3, -1, 3, 1, -1, 10, 10, -1]
FORMULA PolyORBNT-COL-S10J80-UpperBounds-06 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.
[2024-05-31 04:30:03] [INFO ] Unfolded HLPN to a Petri net with 1694 places and 13580 transitions 119919 arcs in 231 ms.
[2024-05-31 04:30:03] [INFO ] Unfolded 10 HLPN properties in 0 ms.
Deduced a syphon composed of 80 places in 66 ms
Reduce places removed 80 places and 80 transitions.
Ensure Unique test removed 10110 transitions
Reduce redundant transitions removed 10110 transitions.
Incomplete random walk after 10000 steps, including 560 resets, run finished after 275 ms. (steps per millisecond=36 ) properties (out of 10) seen :2
Incomplete Best-First random walk after 10000 steps, including 104 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 10) seen :2
Incomplete Best-First random walk after 10000 steps, including 106 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 10) seen :2
Incomplete Best-First random walk after 10000 steps, including 103 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 10) seen :2
Incomplete Best-First random walk after 10001 steps, including 106 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 10) seen :2
Incomplete Best-First random walk after 10001 steps, including 103 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 10) seen :2
Incomplete Best-First random walk after 10001 steps, including 94 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 10) seen :15
FORMULA PolyORBNT-COL-S10J80-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 105 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 9) seen :2
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 9) seen :2
Incomplete Best-First random walk after 10001 steps, including 106 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 9) seen :2
[2024-05-31 04:30:04] [INFO ] Flow matrix only has 3381 transitions (discarded 9 similar events)
// Phase 1: matrix 3381 rows 1614 cols
[2024-05-31 04:30:04] [INFO ] Computed 192 invariants in 260 ms
[2024-05-31 04:30:04] [INFO ] [Real]Absence check using 185 positive place invariants in 60 ms returned sat
[2024-05-31 04:30:05] [INFO ] [Real]Absence check using 185 positive and 7 generalized place invariants in 60 ms returned sat
[2024-05-31 04:30:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 04:30:06] [INFO ] [Real]Absence check using state equation in 1052 ms returned sat
[2024-05-31 04:30:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 04:30:06] [INFO ] [Nat]Absence check using 185 positive place invariants in 49 ms returned sat
[2024-05-31 04:30:06] [INFO ] [Nat]Absence check using 185 positive and 7 generalized place invariants in 44 ms returned sat
[2024-05-31 04:30:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 04:30:07] [INFO ] [Nat]Absence check using state equation in 730 ms returned sat
[2024-05-31 04:30:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 04:30:07] [INFO ] [Nat]Added 1 Read/Feed constraints in 205 ms returned sat
[2024-05-31 04:30:08] [INFO ] Deduced a trap composed of 408 places in 821 ms of which 2 ms to minimize.
[2024-05-31 04:30:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1304 ms
[2024-05-31 04:30:09] [INFO ] Computed and/alt/rep : 2147/6063/2147 causal constraints (skipped 1223 transitions) in 579 ms.
[2024-05-31 04:30:11] [INFO ] Added : 5 causal constraints over 1 iterations in 2535 ms. Result :unknown
[2024-05-31 04:30:11] [INFO ] [Real]Absence check using 185 positive place invariants in 55 ms returned sat
[2024-05-31 04:30:11] [INFO ] [Real]Absence check using 185 positive and 7 generalized place invariants in 25 ms returned unsat
[2024-05-31 04:30:11] [INFO ] [Real]Absence check using 185 positive place invariants in 65 ms returned sat
[2024-05-31 04:30:11] [INFO ] [Real]Absence check using 185 positive and 7 generalized place invariants in 75 ms returned sat
[2024-05-31 04:30:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 04:30:12] [INFO ] [Real]Absence check using state equation in 921 ms returned sat
[2024-05-31 04:30:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 04:30:13] [INFO ] [Nat]Absence check using 185 positive place invariants in 94 ms returned sat
[2024-05-31 04:30:13] [INFO ] [Nat]Absence check using 185 positive and 7 generalized place invariants in 53 ms returned sat
[2024-05-31 04:30:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 04:30:16] [INFO ] [Nat]Absence check using state equation in 3269 ms returned sat
[2024-05-31 04:30:17] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-31 04:30:17] [INFO ] [Nat]Added 1 Read/Feed constraints in 1480 ms returned unknown
[2024-05-31 04:30:18] [INFO ] [Real]Absence check using 185 positive place invariants in 72 ms returned sat
[2024-05-31 04:30:18] [INFO ] [Real]Absence check using 185 positive and 7 generalized place invariants in 65 ms returned sat
[2024-05-31 04:30:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 04:30:19] [INFO ] [Real]Absence check using state equation in 1172 ms returned sat
[2024-05-31 04:30:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 04:30:19] [INFO ] [Nat]Absence check using 185 positive place invariants in 102 ms returned sat
[2024-05-31 04:30:19] [INFO ] [Nat]Absence check using 185 positive and 7 generalized place invariants in 59 ms returned sat
[2024-05-31 04:30:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 04:30:22] [INFO ] [Nat]Absence check using state equation in 2180 ms returned sat
[2024-05-31 04:30:22] [INFO ] [Nat]Added 1 Read/Feed constraints in 675 ms returned sat
[2024-05-31 04:30:23] [INFO ] Deduced a trap composed of 399 places in 1091 ms of which 1 ms to minimize.
[2024-05-31 04:30:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1581 ms
[2024-05-31 04:30:24] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed... while checking expression at index 3
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1002)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
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-31 04:30:24] [INFO ] [Real]Absence check using 185 positive place invariants in 66 ms returned sat
[2024-05-31 04:30:24] [INFO ] [Real]Absence check using 185 positive and 7 generalized place invariants in 54 ms returned unsat
[2024-05-31 04:30:25] [INFO ] [Real]Absence check using 185 positive place invariants in 46 ms returned sat
[2024-05-31 04:30:25] [INFO ] [Real]Absence check using 185 positive and 7 generalized place invariants in 37 ms returned unsat
[2024-05-31 04:30:25] [INFO ] [Real]Absence check using 185 positive place invariants in 61 ms returned sat
[2024-05-31 04:30:25] [INFO ] [Real]Absence check using 185 positive and 7 generalized place invariants in 24 ms returned unsat
[2024-05-31 04:30:25] [INFO ] [Real]Absence check using 185 positive place invariants in 77 ms returned sat
[2024-05-31 04:30:25] [INFO ] [Real]Absence check using 185 positive and 7 generalized place invariants in 48 ms returned sat
[2024-05-31 04:30:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 04:30:26] [INFO ] [Real]Absence check using state equation in 1131 ms returned sat
[2024-05-31 04:30:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 04:30:27] [INFO ] [Nat]Absence check using 185 positive place invariants in 49 ms returned sat
[2024-05-31 04:30:27] [INFO ] [Nat]Absence check using 185 positive and 7 generalized place invariants in 34 ms returned sat
[2024-05-31 04:30:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 04:30:31] [INFO ] [Nat]Absence check using state equation in 4249 ms returned sat
[2024-05-31 04:30:32] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-31 04:30:32] [INFO ] [Nat]Added 1 Read/Feed constraints in 545 ms returned unknown
[2024-05-31 04:30:32] [INFO ] [Real]Absence check using 185 positive place invariants in 68 ms returned sat
[2024-05-31 04:30:32] [INFO ] [Real]Absence check using 185 positive and 7 generalized place invariants in 47 ms returned sat
[2024-05-31 04:30:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 04:30:33] [INFO ] [Real]Absence check using state equation in 1174 ms returned sat
[2024-05-31 04:30:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 04:30:33] [INFO ] [Nat]Absence check using 185 positive place invariants in 61 ms returned sat
[2024-05-31 04:30:33] [INFO ] [Nat]Absence check using 185 positive and 7 generalized place invariants in 42 ms returned unsat
Current structural bounds on expressions (after SMT) : [2147483647, 4, 2147483647, 3, 1, 1, 4, 10, 1] Max seen :[0, 4, 0, 0, 1, 1, 4, 3, 1]
FORMULA PolyORBNT-COL-S10J80-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J80-UpperBounds-10 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J80-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J80-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J80-UpperBounds-01 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 164 out of 1614 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1614/1614 places, 3390/3390 transitions.
Ensure Unique test removed 10 places
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 1604 transition count 3387
Reduce places removed 3 places and 0 transitions.
Performed 81 Post agglomeration using F-continuation condition.Transition count delta: 81
Iterating post reduction 1 with 84 rules applied. Total rules applied 97 place count 1601 transition count 3306
Reduce places removed 81 places and 0 transitions.
Iterating post reduction 2 with 81 rules applied. Total rules applied 178 place count 1520 transition count 3306
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 178 place count 1520 transition count 3301
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 188 place count 1515 transition count 3301
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 192 place count 1513 transition count 3299
Applied a total of 192 rules in 770 ms. Remains 1513 /1614 variables (removed 101) and now considering 3299/3390 (removed 91) transitions.
[2024-05-31 04:30:34] [INFO ] Flow matrix only has 3290 transitions (discarded 9 similar events)
// Phase 1: matrix 3290 rows 1513 cols
[2024-05-31 04:30:34] [INFO ] Computed 182 invariants in 104 ms
[2024-05-31 04:30:37] [INFO ] Dead Transitions using invariants and state equation in 2603 ms found 615 transitions.
Found 615 dead transitions using SMT.
Drop transitions removed 615 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 615 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1513/1614 places, 2684/3390 transitions.
Applied a total of 0 rules in 177 ms. Remains 1513 /1513 variables (removed 0) and now considering 2684/2684 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3562 ms. Remains : 1513/1614 places, 2684/3390 transitions.
Normalized transition count is 2675 out of 2684 initially.
// Phase 1: matrix 2675 rows 1513 cols
[2024-05-31 04:30:37] [INFO ] Computed 182 invariants in 67 ms
Incomplete random walk after 1000000 steps, including 70608 resets, run finished after 14284 ms. (steps per millisecond=70 ) properties (out of 4) seen :9
FORMULA PolyORBNT-COL-S10J80-UpperBounds-03 3 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 6640 resets, run finished after 3027 ms. (steps per millisecond=330 ) properties (out of 3) seen :6
Incomplete Best-First random walk after 1000000 steps, including 6396 resets, run finished after 3752 ms. (steps per millisecond=266 ) properties (out of 3) seen :6
Incomplete Best-First random walk after 1000001 steps, including 5152 resets, run finished after 3580 ms. (steps per millisecond=279 ) properties (out of 3) seen :6
[2024-05-31 04:31:02] [INFO ] Flow matrix only has 2675 transitions (discarded 9 similar events)
// Phase 1: matrix 2675 rows 1513 cols
[2024-05-31 04:31:02] [INFO ] Computed 182 invariants in 142 ms
[2024-05-31 04:31:02] [INFO ] [Real]Absence check using 176 positive place invariants in 81 ms returned sat
[2024-05-31 04:31:02] [INFO ] [Real]Absence check using 176 positive and 6 generalized place invariants in 18 ms returned unsat
[2024-05-31 04:31:03] [INFO ] [Real]Absence check using 176 positive place invariants in 64 ms returned sat
[2024-05-31 04:31:03] [INFO ] [Real]Absence check using 176 positive and 6 generalized place invariants in 13 ms returned unsat
[2024-05-31 04:31:03] [INFO ] [Real]Absence check using 176 positive place invariants in 62 ms returned sat
[2024-05-31 04:31:03] [INFO ] [Real]Absence check using 176 positive and 6 generalized place invariants in 32 ms returned unsat
Current structural bounds on expressions (after SMT) : [1, 1, 4] Max seen :[1, 1, 4]
FORMULA PolyORBNT-COL-S10J80-UpperBounds-13 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J80-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J80-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 64712 ms.
BK_STOP 1717129863632
--------------------
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="PolyORBNT-COL-S10J80"
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 PolyORBNT-COL-S10J80, 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-171654460800271"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-COL-S10J80.tgz
mv PolyORBNT-COL-S10J80 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 ;