fond
Model Checking Contest 2025
15th edition, Paris, France, June 24, 2025
Execution of r167-tall-174881266200094
Last Updated
June 24, 2025

About the Execution of 2024-gold for QuasiCertifProtocol-COL-18

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15694.860 74155.00 86906.00 286.40 1 1 19 361 1 19 1 1 19 19 19 19 361 1 19 19 normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r167-tall-174881266200094.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool gold2024
Input is QuasiCertifProtocol-COL-18, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r167-tall-174881266200094
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 7.7K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_pt
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 5 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 93K May 29 14:32 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

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME QuasiCertifProtocol-COL-18-UpperBounds-00
FORMULA_NAME QuasiCertifProtocol-COL-18-UpperBounds-01
FORMULA_NAME QuasiCertifProtocol-COL-18-UpperBounds-02
FORMULA_NAME QuasiCertifProtocol-COL-18-UpperBounds-03
FORMULA_NAME QuasiCertifProtocol-COL-18-UpperBounds-04
FORMULA_NAME QuasiCertifProtocol-COL-18-UpperBounds-05
FORMULA_NAME QuasiCertifProtocol-COL-18-UpperBounds-06
FORMULA_NAME QuasiCertifProtocol-COL-18-UpperBounds-07
FORMULA_NAME QuasiCertifProtocol-COL-18-UpperBounds-08
FORMULA_NAME QuasiCertifProtocol-COL-18-UpperBounds-09
FORMULA_NAME QuasiCertifProtocol-COL-18-UpperBounds-10
FORMULA_NAME QuasiCertifProtocol-COL-18-UpperBounds-11
FORMULA_NAME QuasiCertifProtocol-COL-18-UpperBounds-12
FORMULA_NAME QuasiCertifProtocol-COL-18-UpperBounds-13
FORMULA_NAME QuasiCertifProtocol-COL-18-UpperBounds-14
FORMULA_NAME QuasiCertifProtocol-COL-18-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748899806128

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-COL-18
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
UpperBounds COL
Running Version 202405141337
[2025-06-02 21:30:07] [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]
[2025-06-02 21:30:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 21:30:07] [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.
[2025-06-02 21:30:07] [WARNING] Using fallBack plugin, rng conformance not checked
[2025-06-02 21:30:08] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 579 ms
[2025-06-02 21:30:08] [INFO ] Imported 30 HL places and 26 HL transitions for a total of 1398 PT places and 296.0 transition bindings in 19 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
[2025-06-02 21:30:08] [INFO ] Built PT skeleton of HLPN with 30 places and 26 transitions 77 arcs in 4 ms.
[2025-06-02 21:30:08] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
// Phase 1: matrix 26 rows 30 cols
[2025-06-02 21:30:08] [INFO ] Computed 5 invariants in 6 ms
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[0, 0, 0, 0, 1, 19, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 19, +inf, 1, 19, 1, 1, 19, 19, +inf, 19, 361, 1, 19, +inf]
FORMULA QuasiCertifProtocol-COL-18-UpperBounds-05 19 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-18-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2025-06-02 21:30:08] [INFO ] Invariant cache hit.
[2025-06-02 21:30:08] [INFO ] [Real]Absence check using 5 positive place invariants in 10 ms returned sat
[2025-06-02 21:30:08] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2025-06-02 21:30:08] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-02 21:30:08] [INFO ] Added : 5 causal constraints over 1 iterations in 21 ms. Result :sat
Minimization took 13 ms.
[2025-06-02 21:30:08] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:30:08] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2025-06-02 21:30:08] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2025-06-02 21:30:08] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-02 21:30:08] [INFO ] Added : 5 causal constraints over 1 iterations in 13 ms. Result :sat
Minimization took 5 ms.
[2025-06-02 21:30:08] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2025-06-02 21:30:08] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2025-06-02 21:30:08] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-02 21:30:08] [INFO ] Added : 2 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 6 ms.
[2025-06-02 21:30:08] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2025-06-02 21:30:08] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2025-06-02 21:30:08] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:30:08] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2025-06-02 21:30:08] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2025-06-02 21:30:08] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-02 21:30:08] [INFO ] Added : 7 causal constraints over 2 iterations in 18 ms. Result :sat
Minimization took 5 ms.
[2025-06-02 21:30:08] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2025-06-02 21:30:08] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2025-06-02 21:30:08] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:30:08] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2025-06-02 21:30:08] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2025-06-02 21:30:08] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-02 21:30:08] [INFO ] Added : 8 causal constraints over 2 iterations in 14 ms. Result :sat
Minimization took 6 ms.
[2025-06-02 21:30:08] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2025-06-02 21:30:08] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2025-06-02 21:30:08] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-02 21:30:08] [INFO ] Added : 6 causal constraints over 2 iterations in 11 ms. Result :sat
Minimization took 6 ms.
[2025-06-02 21:30:08] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:30:08] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2025-06-02 21:30:08] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2025-06-02 21:30:08] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-02 21:30:08] [INFO ] Added : 6 causal constraints over 2 iterations in 9 ms. Result :sat
Minimization took 6 ms.
[2025-06-02 21:30:08] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2025-06-02 21:30:08] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2025-06-02 21:30:08] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-02 21:30:08] [INFO ] Added : 1 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 6 ms.
[2025-06-02 21:30:08] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2025-06-02 21:30:09] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2025-06-02 21:30:09] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:30:09] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2025-06-02 21:30:09] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2025-06-02 21:30:09] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-02 21:30:09] [INFO ] Added : 8 causal constraints over 2 iterations in 10 ms. Result :sat
Minimization took 5 ms.
[2025-06-02 21:30:09] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2025-06-02 21:30:09] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2025-06-02 21:30:09] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:30:09] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2025-06-02 21:30:09] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2025-06-02 21:30:09] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-02 21:30:09] [INFO ] Added : 11 causal constraints over 3 iterations in 10 ms. Result :sat
Minimization took 6 ms.
[2025-06-02 21:30:09] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2025-06-02 21:30:09] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2025-06-02 21:30:09] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:30:09] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2025-06-02 21:30:09] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2025-06-02 21:30:09] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-02 21:30:09] [INFO ] Added : 3 causal constraints over 1 iterations in 16 ms. Result :sat
Minimization took 8 ms.
[2025-06-02 21:30:09] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2025-06-02 21:30:09] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2025-06-02 21:30:09] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:30:09] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2025-06-02 21:30:09] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2025-06-02 21:30:09] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-02 21:30:09] [INFO ] Added : 10 causal constraints over 2 iterations in 8 ms. Result :sat
Minimization took 5 ms.
[2025-06-02 21:30:09] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2025-06-02 21:30:09] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2025-06-02 21:30:09] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:30:09] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2025-06-02 21:30:09] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2025-06-02 21:30:09] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-02 21:30:09] [INFO ] Added : 11 causal constraints over 3 iterations in 29 ms. Result :sat
Minimization took 13 ms.
[2025-06-02 21:30:09] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2025-06-02 21:30:09] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2025-06-02 21:30:09] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-02 21:30:09] [INFO ] Added : 13 causal constraints over 3 iterations in 15 ms. Result :sat
Minimization took 8 ms.
[2025-06-02 21:30:09] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:30:09] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2025-06-02 21:30:09] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2025-06-02 21:30:09] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-02 21:30:09] [INFO ] Added : 13 causal constraints over 3 iterations in 11 ms. Result :sat
Minimization took 6 ms.
[2025-06-02 21:30:09] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2025-06-02 21:30:09] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2025-06-02 21:30:09] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:30:09] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2025-06-02 21:30:09] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2025-06-02 21:30:09] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-02 21:30:09] [INFO ] Added : 11 causal constraints over 3 iterations in 12 ms. Result :sat
Minimization took 5 ms.
[2025-06-02 21:30:09] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2025-06-02 21:30:09] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2025-06-02 21:30:09] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:30:09] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2025-06-02 21:30:09] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2025-06-02 21:30:09] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-02 21:30:09] [INFO ] Added : 4 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 19, +inf, 1, 1, 19, 19, +inf, 19, 361, 1, 19, +inf]
Domain [tsid(19), tsid(19)] of place n9 breaks symmetries in sort tsid
[2025-06-02 21:30:09] [INFO ] Unfolded HLPN to a Petri net with 1398 places and 296 transitions 3119 arcs in 25 ms.
[2025-06-02 21:30:09] [INFO ] Unfolded 14 HLPN properties in 0 ms.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 19, +inf, 1, 1, 19, 19, +inf, 19, 361, 1, 19, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 19, +inf, 1, 1, 19, 19, +inf, 19, 361, 1, 19, +inf]
// Phase 1: matrix 296 rows 1398 cols
[2025-06-02 21:30:09] [INFO ] Computed 1103 invariants in 61 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 19, +inf, 1, 1, 19, 19, +inf, 19, 361, 1, 19, +inf]
RANDOM walk for 10000 steps (443 resets) in 157 ms. (63 steps per ms)
FORMULA QuasiCertifProtocol-COL-18-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA QuasiCertifProtocol-COL-18-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 120012 steps (371 resets) in 344 ms. (347 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 19, +inf, 1, 19, 19, +inf, 19, 361, 19, +inf]
[2025-06-02 21:30:10] [INFO ] Invariant cache hit.
[2025-06-02 21:30:10] [INFO ] [Real]Absence check using 4 positive place invariants in 17 ms returned sat
[2025-06-02 21:30:10] [INFO ] [Real]Absence check using 4 positive and 1099 generalized place invariants in 170 ms returned sat
[2025-06-02 21:30:10] [INFO ] [Real]Absence check using state equation in 305 ms returned sat
[2025-06-02 21:30:11] [INFO ] Computed and/alt/rep : 216/254/216 causal constraints (skipped 60 transitions) in 36 ms.
[2025-06-02 21:30:11] [INFO ] Added : 35 causal constraints over 7 iterations in 436 ms. Result :sat
Minimization took 354 ms.
[2025-06-02 21:30:11] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:30:12] [INFO ] [Nat]Absence check using 4 positive place invariants in 13 ms returned sat
[2025-06-02 21:30:12] [INFO ] [Nat]Absence check using 4 positive and 1099 generalized place invariants in 177 ms returned sat
[2025-06-02 21:30:12] [INFO ] [Nat]Absence check using state equation in 324 ms returned sat
[2025-06-02 21:30:12] [INFO ] Computed and/alt/rep : 216/254/216 causal constraints (skipped 60 transitions) in 25 ms.
[2025-06-02 21:30:13] [INFO ] Added : 35 causal constraints over 7 iterations in 367 ms. Result :sat
Minimization took 334 ms.
[2025-06-02 21:30:13] [INFO ] [Real]Absence check using 4 positive place invariants in 15 ms returned sat
[2025-06-02 21:30:13] [INFO ] [Real]Absence check using 4 positive and 1099 generalized place invariants in 175 ms returned sat
[2025-06-02 21:30:14] [INFO ] [Real]Absence check using state equation in 347 ms returned sat
[2025-06-02 21:30:14] [INFO ] Computed and/alt/rep : 216/254/216 causal constraints (skipped 60 transitions) in 23 ms.
[2025-06-02 21:30:14] [INFO ] Added : 25 causal constraints over 5 iterations in 269 ms. Result :sat
Minimization took 330 ms.
[2025-06-02 21:30:14] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:30:14] [INFO ] [Nat]Absence check using 4 positive place invariants in 24 ms returned sat
[2025-06-02 21:30:15] [INFO ] [Nat]Absence check using 4 positive and 1099 generalized place invariants in 168 ms returned sat
[2025-06-02 21:30:15] [INFO ] [Nat]Absence check using state equation in 309 ms returned sat
[2025-06-02 21:30:15] [INFO ] Computed and/alt/rep : 216/254/216 causal constraints (skipped 60 transitions) in 24 ms.
[2025-06-02 21:30:15] [INFO ] Added : 25 causal constraints over 5 iterations in 260 ms. Result :sat
Minimization took 327 ms.
[2025-06-02 21:30:16] [INFO ] [Real]Absence check using 4 positive place invariants in 11 ms returned sat
[2025-06-02 21:30:16] [INFO ] [Real]Absence check using 4 positive and 1099 generalized place invariants in 181 ms returned sat
[2025-06-02 21:30:16] [INFO ] [Real]Absence check using state equation in 551 ms returned sat
[2025-06-02 21:30:17] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:30:17] [INFO ] [Nat]Absence check using 4 positive place invariants in 12 ms returned sat
[2025-06-02 21:30:17] [INFO ] [Nat]Absence check using 4 positive and 1099 generalized place invariants in 170 ms returned sat
[2025-06-02 21:30:17] [INFO ] [Nat]Absence check using state equation in 576 ms returned sat
[2025-06-02 21:30:17] [INFO ] Computed and/alt/rep : 216/254/216 causal constraints (skipped 60 transitions) in 23 ms.
[2025-06-02 21:30:18] [INFO ] Added : 59 causal constraints over 12 iterations in 521 ms. Result :sat
Minimization took 367 ms.
[2025-06-02 21:30:19] [INFO ] [Real]Absence check using 4 positive place invariants in 12 ms returned sat
[2025-06-02 21:30:19] [INFO ] [Real]Absence check using 4 positive and 1099 generalized place invariants in 155 ms returned sat
[2025-06-02 21:30:20] [INFO ] [Real]Absence check using state equation in 1087 ms returned sat
[2025-06-02 21:30:20] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:30:20] [INFO ] [Nat]Absence check using 4 positive place invariants in 11 ms returned sat
[2025-06-02 21:30:20] [INFO ] [Nat]Absence check using 4 positive and 1099 generalized place invariants in 179 ms returned sat
[2025-06-02 21:30:21] [INFO ] [Nat]Absence check using state equation in 838 ms returned sat
[2025-06-02 21:30:21] [INFO ] Computed and/alt/rep : 216/254/216 causal constraints (skipped 60 transitions) in 28 ms.
[2025-06-02 21:30:22] [INFO ] Added : 77 causal constraints over 16 iterations in 682 ms. Result :sat
Minimization took 487 ms.
[2025-06-02 21:30:22] [INFO ] [Real]Absence check using 4 positive place invariants in 11 ms returned sat
[2025-06-02 21:30:23] [INFO ] [Real]Absence check using 4 positive and 1099 generalized place invariants in 167 ms returned sat
[2025-06-02 21:30:23] [INFO ] [Real]Absence check using state equation in 349 ms returned sat
[2025-06-02 21:30:23] [INFO ] Computed and/alt/rep : 216/254/216 causal constraints (skipped 60 transitions) in 27 ms.
[2025-06-02 21:30:23] [INFO ] Added : 47 causal constraints over 10 iterations in 493 ms. Result :sat
Minimization took 388 ms.
[2025-06-02 21:30:24] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:30:24] [INFO ] [Nat]Absence check using 4 positive place invariants in 12 ms returned sat
[2025-06-02 21:30:24] [INFO ] [Nat]Absence check using 4 positive and 1099 generalized place invariants in 171 ms returned sat
[2025-06-02 21:30:25] [INFO ] [Nat]Absence check using state equation in 353 ms returned sat
[2025-06-02 21:30:25] [INFO ] Computed and/alt/rep : 216/254/216 causal constraints (skipped 60 transitions) in 23 ms.
[2025-06-02 21:30:25] [INFO ] Added : 47 causal constraints over 10 iterations in 448 ms. Result :sat
Minimization took 382 ms.
[2025-06-02 21:30:26] [INFO ] [Real]Absence check using 4 positive place invariants in 11 ms returned sat
[2025-06-02 21:30:26] [INFO ] [Real]Absence check using 4 positive and 1099 generalized place invariants in 172 ms returned sat
[2025-06-02 21:30:26] [INFO ] [Real]Absence check using state equation in 448 ms returned sat
[2025-06-02 21:30:26] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:30:27] [INFO ] [Nat]Absence check using 4 positive place invariants in 11 ms returned sat
[2025-06-02 21:30:27] [INFO ] [Nat]Absence check using 4 positive and 1099 generalized place invariants in 166 ms returned sat
[2025-06-02 21:30:27] [INFO ] [Nat]Absence check using state equation in 647 ms returned sat
[2025-06-02 21:30:27] [INFO ] Computed and/alt/rep : 216/254/216 causal constraints (skipped 60 transitions) in 22 ms.
[2025-06-02 21:30:28] [INFO ] Added : 70 causal constraints over 14 iterations in 879 ms. Result :sat
Minimization took 436 ms.
[2025-06-02 21:30:29] [INFO ] [Real]Absence check using 4 positive place invariants in 11 ms returned sat
[2025-06-02 21:30:29] [INFO ] [Real]Absence check using 4 positive and 1099 generalized place invariants in 171 ms returned sat
[2025-06-02 21:30:29] [INFO ] [Real]Absence check using state equation in 354 ms returned sat
[2025-06-02 21:30:29] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:30:30] [INFO ] [Nat]Absence check using 4 positive place invariants in 11 ms returned sat
[2025-06-02 21:30:30] [INFO ] [Nat]Absence check using 4 positive and 1099 generalized place invariants in 170 ms returned sat
[2025-06-02 21:30:30] [INFO ] [Nat]Absence check using state equation in 362 ms returned sat
[2025-06-02 21:30:30] [INFO ] Computed and/alt/rep : 216/254/216 causal constraints (skipped 60 transitions) in 20 ms.
[2025-06-02 21:30:31] [INFO ] Added : 78 causal constraints over 16 iterations in 622 ms. Result :sat
Minimization took 397 ms.
[2025-06-02 21:30:31] [INFO ] [Real]Absence check using 4 positive place invariants in 11 ms returned sat
[2025-06-02 21:30:32] [INFO ] [Real]Absence check using 4 positive and 1099 generalized place invariants in 172 ms returned sat
[2025-06-02 21:30:32] [INFO ] [Real]Absence check using state equation in 421 ms returned sat
[2025-06-02 21:30:32] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:30:32] [INFO ] [Nat]Absence check using 4 positive place invariants in 11 ms returned sat
[2025-06-02 21:30:32] [INFO ] [Nat]Absence check using 4 positive and 1099 generalized place invariants in 162 ms returned sat
[2025-06-02 21:30:33] [INFO ] [Nat]Absence check using state equation in 399 ms returned sat
[2025-06-02 21:30:33] [INFO ] Computed and/alt/rep : 216/254/216 causal constraints (skipped 60 transitions) in 22 ms.
[2025-06-02 21:30:33] [INFO ] Added : 29 causal constraints over 6 iterations in 283 ms. Result :sat
Minimization took 398 ms.
[2025-06-02 21:30:34] [INFO ] [Real]Absence check using 4 positive place invariants in 11 ms returned sat
[2025-06-02 21:30:34] [INFO ] [Real]Absence check using 4 positive and 1099 generalized place invariants in 145 ms returned sat
[2025-06-02 21:30:34] [INFO ] [Real]Absence check using state equation in 576 ms returned sat
[2025-06-02 21:30:34] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:30:35] [INFO ] [Nat]Absence check using 4 positive place invariants in 12 ms returned sat
[2025-06-02 21:30:35] [INFO ] [Nat]Absence check using 4 positive and 1099 generalized place invariants in 166 ms returned sat
[2025-06-02 21:30:35] [INFO ] [Nat]Absence check using state equation in 626 ms returned sat
[2025-06-02 21:30:35] [INFO ] Computed and/alt/rep : 216/254/216 causal constraints (skipped 60 transitions) in 21 ms.
[2025-06-02 21:30:36] [INFO ] Added : 88 causal constraints over 18 iterations in 683 ms. Result :sat
Minimization took 462 ms.
[2025-06-02 21:30:37] [INFO ] [Real]Absence check using 4 positive place invariants in 13 ms returned sat
[2025-06-02 21:30:37] [INFO ] [Real]Absence check using 4 positive and 1099 generalized place invariants in 170 ms returned sat
[2025-06-02 21:30:38] [INFO ] [Real]Absence check using state equation in 1056 ms returned sat
[2025-06-02 21:30:38] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:30:38] [INFO ] [Nat]Absence check using 4 positive place invariants in 12 ms returned sat
[2025-06-02 21:30:38] [INFO ] [Nat]Absence check using 4 positive and 1099 generalized place invariants in 185 ms returned sat
[2025-06-02 21:30:39] [INFO ] [Nat]Absence check using state equation in 999 ms returned sat
[2025-06-02 21:30:39] [INFO ] Computed and/alt/rep : 216/254/216 causal constraints (skipped 60 transitions) in 20 ms.
[2025-06-02 21:30:40] [INFO ] Added : 97 causal constraints over 20 iterations in 840 ms. Result :sat
Minimization took 460 ms.
[2025-06-02 21:30:41] [INFO ] [Real]Absence check using 4 positive place invariants in 10 ms returned sat
[2025-06-02 21:30:41] [INFO ] [Real]Absence check using 4 positive and 1099 generalized place invariants in 164 ms returned sat
[2025-06-02 21:30:42] [INFO ] [Real]Absence check using state equation in 757 ms returned sat
[2025-06-02 21:30:42] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:30:42] [INFO ] [Nat]Absence check using 4 positive place invariants in 11 ms returned sat
[2025-06-02 21:30:42] [INFO ] [Nat]Absence check using 4 positive and 1099 generalized place invariants in 173 ms returned sat
[2025-06-02 21:30:43] [INFO ] [Nat]Absence check using state equation in 580 ms returned sat
[2025-06-02 21:30:43] [INFO ] Computed and/alt/rep : 216/254/216 causal constraints (skipped 60 transitions) in 22 ms.
[2025-06-02 21:30:43] [INFO ] Added : 90 causal constraints over 18 iterations in 741 ms. Result :sat
Minimization took 422 ms.
[2025-06-02 21:30:44] [INFO ] [Real]Absence check using 4 positive place invariants in 11 ms returned sat
[2025-06-02 21:30:44] [INFO ] [Real]Absence check using 4 positive and 1099 generalized place invariants in 163 ms returned sat
[2025-06-02 21:30:45] [INFO ] [Real]Absence check using state equation in 391 ms returned sat
[2025-06-02 21:30:45] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:30:45] [INFO ] [Nat]Absence check using 4 positive place invariants in 12 ms returned sat
[2025-06-02 21:30:45] [INFO ] [Nat]Absence check using 4 positive and 1099 generalized place invariants in 173 ms returned sat
[2025-06-02 21:30:45] [INFO ] [Nat]Absence check using state equation in 341 ms returned sat
[2025-06-02 21:30:45] [INFO ] Computed and/alt/rep : 216/254/216 causal constraints (skipped 60 transitions) in 21 ms.
[2025-06-02 21:30:46] [INFO ] Added : 39 causal constraints over 8 iterations in 512 ms. Result :sat
Minimization took 373 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 19, +inf, 1, 19, 19, +inf, 19, 361, 19, +inf]
FORMULA QuasiCertifProtocol-COL-18-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA QuasiCertifProtocol-COL-18-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA QuasiCertifProtocol-COL-18-UpperBounds-14 19 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA QuasiCertifProtocol-COL-18-UpperBounds-12 361 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA QuasiCertifProtocol-COL-18-UpperBounds-09 19 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA QuasiCertifProtocol-COL-18-UpperBounds-08 19 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA QuasiCertifProtocol-COL-18-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA QuasiCertifProtocol-COL-18-UpperBounds-02 19 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA QuasiCertifProtocol-COL-18-UpperBounds-11 19 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[361, 19, 19] Max Struct:[+inf, +inf, +inf]
Support contains 399 out of 1398 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1398/1398 places, 296/296 transitions.
Graph (complete) has 9608 edges and 1398 vertex of which 556 are kept as prefixes of interest. Removing 842 places using SCC suffix rule.5 ms
Discarding 842 places :
Also discarding 116 output transitions
Drop transitions (Output transitions of discarded places.) removed 116 transitions
Drop transitions (Empty/Sink Transition effects.) removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Discarding 38 places :
Implicit places reduction removed 38 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 119 rules applied. Total rules applied 120 place count 518 transition count 99
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 121 place count 517 transition count 99
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 39 Pre rules applied. Total rules applied 121 place count 517 transition count 60
Deduced a syphon composed of 39 places in 0 ms
Ensure Unique test removed 37 places
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 2 with 115 rules applied. Total rules applied 236 place count 441 transition count 60
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 236 place count 441 transition count 59
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 239 place count 439 transition count 59
Applied a total of 239 rules in 63 ms. Remains 439 /1398 variables (removed 959) and now considering 59/296 (removed 237) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 439/1398 places, 59/296 transitions.
When looking for a positive semi flow solution, solver replied unsat
// Phase 1: matrix 59 rows 439 cols
[2025-06-02 21:30:48] [INFO ] Computed 380 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[361, 19, 19] Max Struct:[+inf, +inf, +inf]
RANDOM walk for 1000000 steps (16666 resets) in 17719 ms. (56 steps per ms)
BEST_FIRST walk for 2427495 steps (3869 resets) in 13050 ms. (186 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[361, 19, 19] Max Struct:[+inf, +inf, +inf]
[2025-06-02 21:31:19] [INFO ] Invariant cache hit.
[2025-06-02 21:31:19] [INFO ] [Real]Absence check using 0 positive and 380 generalized place invariants in 57 ms returned sat
[2025-06-02 21:31:19] [INFO ] [Real]Absence check using state equation in 230 ms returned unsat
[2025-06-02 21:31:19] [INFO ] [Real]Absence check using 0 positive and 380 generalized place invariants in 50 ms returned sat
[2025-06-02 21:31:19] [INFO ] [Real]Absence check using state equation in 68 ms returned unsat
[2025-06-02 21:31:19] [INFO ] [Real]Absence check using 0 positive and 380 generalized place invariants in 56 ms returned sat
[2025-06-02 21:31:19] [INFO ] [Real]Absence check using state equation in 73 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[361, 19, 19] Max Struct:[361, 19, 19]
FORMULA QuasiCertifProtocol-COL-18-UpperBounds-15 19 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-COL-18-UpperBounds-10 19 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-COL-18-UpperBounds-03 361 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2025-06-02 21:31:20] [INFO ] Flatten gal took : 48 ms
[2025-06-02 21:31:20] [INFO ] Flatten gal took : 25 ms
[2025-06-02 21:31:20] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3030903697591060619.gal : 76 ms
[2025-06-02 21:31:20] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6284350073925361932.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality3030903697591060619.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6284350073925361932.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 72841 ms.

BK_STOP 1748899880283

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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="QuasiCertifProtocol-COL-18"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2024"
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-5832"
echo " Executing tool gold2024"
echo " Input is QuasiCertifProtocol-COL-18, 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 r167-tall-174881266200094"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-COL-18.tgz
mv QuasiCertifProtocol-COL-18 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.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;