Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r312-tall-171662337700029.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool itstools
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 r312-tall-171662337700029
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 7.9K Apr 13 04:07 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Apr 13 04:07 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Apr 13 04:00 CTLFireability.txt
-rw-r--r-- 1 mcc users 85K Apr 13 04:00 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.0K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.9K Apr 13 04:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 62K Apr 13 04:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Apr 13 04:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 13 04:10 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 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 93K 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 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 1716657767107

Invoking MCC driver with
BK_TOOL=itstools
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
[2024-05-25 17:22:48] [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-25 17:22:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 17:22:48] [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-25 17:22:48] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-25 17:22:48] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 588 ms
[2024-05-25 17:22:48] [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 6 ms.
[2024-05-25 17:22:48] [INFO ] Built PT skeleton of HLPN with 30 places and 26 transitions 77 arcs in 3 ms.
[2024-05-25 17:22:48] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
// Phase 1: matrix 26 rows 30 cols
[2024-05-25 17:22:49] [INFO ] Computed 5 invariants in 13 ms
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, 10, 19, 1, 1, 1, 1, +inf, 1, +inf, 1, +inf, 19, 10, +inf]
FORMULA QuasiCertifProtocol-COL-18-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2024-05-25 17:22:49] [INFO ] Invariant cache hit.
[2024-05-25 17:22:49] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2024-05-25 17:22:49] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-25 17:22:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 17:22:49] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-25 17:22:49] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2024-05-25 17:22:49] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-25 17:22:49] [INFO ] Added : 2 causal constraints over 1 iterations in 17 ms. Result :sat
Minimization took 8 ms.
[2024-05-25 17:22:49] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-25 17:22:49] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-25 17:22:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 17:22:49] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-25 17:22:49] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-05-25 17:22:49] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 17:22:49] [INFO ] Added : 8 causal constraints over 2 iterations in 30 ms. Result :sat
Minimization took 6 ms.
[2024-05-25 17:22:49] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-25 17:22:49] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-05-25 17:22:49] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 17:22:49] [INFO ] Added : 13 causal constraints over 3 iterations in 24 ms. Result :sat
Minimization took 7 ms.
[2024-05-25 17:22:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 17:22:49] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-25 17:22:49] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-05-25 17:22:49] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-25 17:22:49] [INFO ] Added : 13 causal constraints over 3 iterations in 13 ms. Result :sat
Minimization took 6 ms.
[2024-05-25 17:22:49] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-25 17:22:49] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-25 17:22:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 17:22:49] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-25 17:22:49] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-05-25 17:22:49] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 17:22:49] [INFO ] Added : 7 causal constraints over 2 iterations in 9 ms. Result :sat
Minimization took 6 ms.
[2024-05-25 17:22:49] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-25 17:22:49] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-05-25 17:22:49] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 17:22:49] [INFO ] Added : 13 causal constraints over 3 iterations in 17 ms. Result :sat
Minimization took 7 ms.
[2024-05-25 17:22:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 17:22:49] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-25 17:22:49] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-05-25 17:22:49] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 17:22:49] [INFO ] Added : 13 causal constraints over 3 iterations in 12 ms. Result :sat
Minimization took 6 ms.
[2024-05-25 17:22:49] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-25 17:22:49] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-25 17:22:49] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 17:22:49] [INFO ] Added : 1 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 6 ms.
[2024-05-25 17:22:49] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2024-05-25 17:22:49] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-25 17:22:49] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 17:22:49] [INFO ] Added : 7 causal constraints over 2 iterations in 9 ms. Result :sat
Minimization took 7 ms.
[2024-05-25 17:22:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 17:22:49] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-25 17:22:49] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-05-25 17:22:49] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 17:22:49] [INFO ] Added : 7 causal constraints over 2 iterations in 19 ms. Result :sat
Minimization took 7 ms.
[2024-05-25 17:22:49] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-25 17:22:50] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-05-25 17:22:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 17:22:50] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-25 17:22:50] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2024-05-25 17:22:50] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-25 17:22:50] [INFO ] Added : 1 causal constraints over 1 iterations in 9 ms. Result :sat
Minimization took 9 ms.
[2024-05-25 17:22:50] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-25 17:22:50] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-25 17:22:50] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 17:22:50] [INFO ] Added : 6 causal constraints over 2 iterations in 9 ms. Result :sat
Minimization took 6 ms.
[2024-05-25 17:22:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 17:22:50] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-25 17:22:50] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-05-25 17:22:50] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 17:22:50] [INFO ] Added : 6 causal constraints over 2 iterations in 12 ms. Result :sat
Minimization took 5 ms.
[2024-05-25 17:22:50] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-25 17:22:50] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-05-25 17:22:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 17:22:50] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-25 17:22:50] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-25 17:22:50] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 17:22:50] [INFO ] Added : 9 causal constraints over 2 iterations in 20 ms. Result :sat
Minimization took 7 ms.
[2024-05-25 17:22:50] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-25 17:22:50] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-25 17:22:50] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 10 ms.
[2024-05-25 17:22:50] [INFO ] Added : 2 causal constraints over 1 iterations in 16 ms. Result :sat
Minimization took 6 ms.
[2024-05-25 17:22:50] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-25 17:22:50] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-25 17:22:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 17:22:50] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-25 17:22:50] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-05-25 17:22:50] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 17:22:50] [INFO ] Added : 6 causal constraints over 2 iterations in 8 ms. Result :sat
Minimization took 8 ms.
[2024-05-25 17:22:50] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-25 17:22:50] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-25 17:22:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 17:22:50] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-25 17:22:50] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-05-25 17:22:50] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 17:22:50] [INFO ] Added : 10 causal constraints over 2 iterations in 17 ms. Result :sat
Minimization took 5 ms.
[2024-05-25 17:22:50] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-25 17:22:50] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-25 17:22:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 17:22:50] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-25 17:22:50] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-25 17:22:50] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-25 17:22:50] [INFO ] Added : 4 causal constraints over 1 iterations in 13 ms. Result :sat
Minimization took 9 ms.
[2024-05-25 17:22:50] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-25 17:22:50] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2024-05-25 17:22:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 17:22:50] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-25 17:22:50] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-25 17:22:50] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 17:22:50] [INFO ] Added : 8 causal constraints over 2 iterations in 20 ms. Result :sat
Minimization took 6 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, 0] Max Struct:[+inf, +inf, 10, 19, 1, 1, 1, +inf, 1, +inf, 1, +inf, 19, 10, +inf]
Domain [tsid(19), tsid(19)] of place n9 breaks symmetries in sort tsid
[2024-05-25 17:22:50] [INFO ] Unfolded HLPN to a Petri net with 1398 places and 296 transitions 3119 arcs in 31 ms.
[2024-05-25 17:22:50] [INFO ] Unfolded 15 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, 0] Max Struct:[+inf, +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, 0] Max Struct:[+inf, +inf, 10, 19, 1, 1, 1, +inf, 1, +inf, 1, +inf, 19, 10, +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, 0] Max Struct:[+inf, +inf, 10, 19, 1, 1, 1, +inf, 1, +inf, 1, +inf, 19, 10, +inf]
// Phase 1: matrix 296 rows 1398 cols
[2024-05-25 17:22:50] [INFO ] Computed 1103 invariants in 49 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, 10, 19, 1, 1, 1, +inf, 1, +inf, 1, +inf, 19, 10, +inf]
RANDOM walk for 10000 steps (441 resets) in 179 ms. (55 steps per ms)
FORMULA QuasiCertifProtocol-COL-18-UpperBounds-14 10 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA QuasiCertifProtocol-COL-18-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA QuasiCertifProtocol-COL-18-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 120012 steps (368 resets) in 355 ms. (337 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[18, 0, 0, 0, 0, 19, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, 10, 19, 1, +inf, 1, +inf, 1, +inf, 19, +inf]
[2024-05-25 17:22:51] [INFO ] Invariant cache hit.
[2024-05-25 17:22:51] [INFO ] [Real]Absence check using 4 positive place invariants in 22 ms returned sat
[2024-05-25 17:22:51] [INFO ] [Real]Absence check using 4 positive and 1099 generalized place invariants in 180 ms returned sat
[2024-05-25 17:22:52] [INFO ] [Real]Absence check using state equation in 375 ms returned sat
[2024-05-25 17:22:52] [INFO ] Computed and/alt/rep : 216/254/216 causal constraints (skipped 60 transitions) in 27 ms.
[2024-05-25 17:22:52] [INFO ] Added : 19 causal constraints over 4 iterations in 249 ms. Result :sat
Minimization took 379 ms.
[2024-05-25 17:22:53] [INFO ] [Real]Absence check using 4 positive place invariants in 13 ms returned sat
[2024-05-25 17:22:53] [INFO ] [Real]Absence check using 4 positive and 1099 generalized place invariants in 172 ms returned sat
[2024-05-25 17:22:53] [INFO ] [Real]Absence check using state equation in 367 ms returned sat
[2024-05-25 17:22:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 17:22:53] [INFO ] [Nat]Absence check using 4 positive place invariants in 22 ms returned sat
[2024-05-25 17:22:53] [INFO ] [Nat]Absence check using 4 positive and 1099 generalized place invariants in 153 ms returned sat
[2024-05-25 17:22:54] [INFO ] [Nat]Absence check using state equation in 538 ms returned sat
[2024-05-25 17:22:54] [INFO ] Computed and/alt/rep : 216/254/216 causal constraints (skipped 60 transitions) in 40 ms.
[2024-05-25 17:22:55] [INFO ] Added : 69 causal constraints over 14 iterations in 622 ms. Result :sat
Minimization took 428 ms.
[2024-05-25 17:22:55] [INFO ] [Real]Absence check using 4 positive place invariants in 13 ms returned sat
[2024-05-25 17:22:55] [INFO ] [Real]Absence check using 4 positive and 1099 generalized place invariants in 161 ms returned sat
[2024-05-25 17:22:56] [INFO ] [Real]Absence check using state equation in 362 ms returned sat
[2024-05-25 17:22:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 17:22:56] [INFO ] [Nat]Absence check using 4 positive place invariants in 12 ms returned sat
[2024-05-25 17:22:56] [INFO ] [Nat]Absence check using 4 positive and 1099 generalized place invariants in 160 ms returned sat
[2024-05-25 17:22:57] [INFO ] [Nat]Absence check using state equation in 780 ms returned sat
[2024-05-25 17:22:57] [INFO ] Computed and/alt/rep : 216/254/216 causal constraints (skipped 60 transitions) in 22 ms.
[2024-05-25 17:22:58] [INFO ] Added : 79 causal constraints over 16 iterations in 652 ms. Result :sat
Minimization took 384 ms.
[2024-05-25 17:22:58] [INFO ] [Real]Absence check using 4 positive place invariants in 13 ms returned sat
[2024-05-25 17:22:58] [INFO ] [Real]Absence check using 4 positive and 1099 generalized place invariants in 168 ms returned sat
[2024-05-25 17:22:59] [INFO ] [Real]Absence check using state equation in 526 ms returned sat
[2024-05-25 17:22:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 17:22:59] [INFO ] [Nat]Absence check using 4 positive place invariants in 12 ms returned sat
[2024-05-25 17:22:59] [INFO ] [Nat]Absence check using 4 positive and 1099 generalized place invariants in 165 ms returned sat
[2024-05-25 17:23:00] [INFO ] [Nat]Absence check using state equation in 581 ms returned sat
[2024-05-25 17:23:00] [INFO ] Computed and/alt/rep : 216/254/216 causal constraints (skipped 60 transitions) in 20 ms.
[2024-05-25 17:23:00] [INFO ] Added : 59 causal constraints over 12 iterations in 507 ms. Result :sat
Minimization took 382 ms.
[2024-05-25 17:23:01] [INFO ] [Real]Absence check using 4 positive place invariants in 11 ms returned sat
[2024-05-25 17:23:01] [INFO ] [Real]Absence check using 4 positive and 1099 generalized place invariants in 173 ms returned sat
[2024-05-25 17:23:01] [INFO ] [Real]Absence check using state equation in 322 ms returned sat
[2024-05-25 17:23:01] [INFO ] Computed and/alt/rep : 216/254/216 causal constraints (skipped 60 transitions) in 22 ms.
[2024-05-25 17:23:02] [INFO ] Added : 61 causal constraints over 13 iterations in 630 ms. Result :sat
Minimization took 382 ms.
[2024-05-25 17:23:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 17:23:03] [INFO ] [Nat]Absence check using 4 positive place invariants in 11 ms returned sat
[2024-05-25 17:23:03] [INFO ] [Nat]Absence check using 4 positive and 1099 generalized place invariants in 163 ms returned sat
[2024-05-25 17:23:03] [INFO ] [Nat]Absence check using state equation in 303 ms returned sat
[2024-05-25 17:23:03] [INFO ] Computed and/alt/rep : 216/254/216 causal constraints (skipped 60 transitions) in 21 ms.
[2024-05-25 17:23:04] [INFO ] Added : 61 causal constraints over 13 iterations in 571 ms. Result :sat
Minimization took 338 ms.
[2024-05-25 17:23:04] [INFO ] [Real]Absence check using 4 positive place invariants in 12 ms returned sat
[2024-05-25 17:23:04] [INFO ] [Real]Absence check using 4 positive and 1099 generalized place invariants in 169 ms returned sat
[2024-05-25 17:23:05] [INFO ] [Real]Absence check using state equation in 657 ms returned unsat
[2024-05-25 17:23:05] [INFO ] [Real]Absence check using 4 positive place invariants in 12 ms returned sat
[2024-05-25 17:23:05] [INFO ] [Real]Absence check using 4 positive and 1099 generalized place invariants in 165 ms returned sat
[2024-05-25 17:23:06] [INFO ] [Real]Absence check using state equation in 348 ms returned sat
[2024-05-25 17:23:06] [INFO ] Computed and/alt/rep : 216/254/216 causal constraints (skipped 60 transitions) in 26 ms.
[2024-05-25 17:23:06] [INFO ] Added : 47 causal constraints over 10 iterations in 468 ms. Result :sat
Minimization took 346 ms.
[2024-05-25 17:23:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 17:23:07] [INFO ] [Nat]Absence check using 4 positive place invariants in 12 ms returned sat
[2024-05-25 17:23:07] [INFO ] [Nat]Absence check using 4 positive and 1099 generalized place invariants in 171 ms returned sat
[2024-05-25 17:23:07] [INFO ] [Nat]Absence check using state equation in 349 ms returned sat
[2024-05-25 17:23:07] [INFO ] Computed and/alt/rep : 216/254/216 causal constraints (skipped 60 transitions) in 20 ms.
[2024-05-25 17:23:08] [INFO ] Added : 47 causal constraints over 10 iterations in 445 ms. Result :sat
Minimization took 339 ms.
[2024-05-25 17:23:08] [INFO ] [Real]Absence check using 4 positive place invariants in 11 ms returned sat
[2024-05-25 17:23:08] [INFO ] [Real]Absence check using 4 positive and 1099 generalized place invariants in 162 ms returned sat
[2024-05-25 17:23:09] [INFO ] [Real]Absence check using state equation in 398 ms returned sat
[2024-05-25 17:23:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 17:23:09] [INFO ] [Nat]Absence check using 4 positive place invariants in 12 ms returned sat
[2024-05-25 17:23:09] [INFO ] [Nat]Absence check using 4 positive and 1099 generalized place invariants in 167 ms returned sat
[2024-05-25 17:23:10] [INFO ] [Nat]Absence check using state equation in 664 ms returned sat
[2024-05-25 17:23:10] [INFO ] Computed and/alt/rep : 216/254/216 causal constraints (skipped 60 transitions) in 19 ms.
[2024-05-25 17:23:11] [INFO ] Added : 78 causal constraints over 16 iterations in 636 ms. Result :sat
Minimization took 373 ms.
[2024-05-25 17:23:11] [INFO ] [Real]Absence check using 4 positive place invariants in 11 ms returned sat
[2024-05-25 17:23:11] [INFO ] [Real]Absence check using 4 positive and 1099 generalized place invariants in 174 ms returned sat
[2024-05-25 17:23:12] [INFO ] [Real]Absence check using state equation in 337 ms returned sat
[2024-05-25 17:23:12] [INFO ] Computed and/alt/rep : 216/254/216 causal constraints (skipped 60 transitions) in 21 ms.
[2024-05-25 17:23:12] [INFO ] Added : 25 causal constraints over 5 iterations in 273 ms. Result :sat
Minimization took 339 ms.
[2024-05-25 17:23:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 17:23:12] [INFO ] [Nat]Absence check using 4 positive place invariants in 12 ms returned sat
[2024-05-25 17:23:13] [INFO ] [Nat]Absence check using 4 positive and 1099 generalized place invariants in 164 ms returned sat
[2024-05-25 17:23:13] [INFO ] [Nat]Absence check using state equation in 315 ms returned sat
[2024-05-25 17:23:13] [INFO ] Computed and/alt/rep : 216/254/216 causal constraints (skipped 60 transitions) in 22 ms.
[2024-05-25 17:23:13] [INFO ] Added : 25 causal constraints over 5 iterations in 254 ms. Result :sat
Minimization took 331 ms.
[2024-05-25 17:23:14] [INFO ] [Real]Absence check using 4 positive place invariants in 15 ms returned sat
[2024-05-25 17:23:14] [INFO ] [Real]Absence check using 4 positive and 1099 generalized place invariants in 176 ms returned sat
[2024-05-25 17:23:14] [INFO ] [Real]Absence check using state equation in 284 ms returned sat
[2024-05-25 17:23:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 17:23:14] [INFO ] [Nat]Absence check using 4 positive place invariants in 12 ms returned sat
[2024-05-25 17:23:15] [INFO ] [Nat]Absence check using 4 positive and 1099 generalized place invariants in 195 ms returned sat
[2024-05-25 17:23:15] [INFO ] [Nat]Absence check using state equation in 510 ms returned sat
[2024-05-25 17:23:15] [INFO ] Computed and/alt/rep : 216/254/216 causal constraints (skipped 60 transitions) in 21 ms.
[2024-05-25 17:23:16] [INFO ] Added : 50 causal constraints over 10 iterations in 407 ms. Result :sat
Minimization took 368 ms.
[2024-05-25 17:23:16] [INFO ] [Real]Absence check using 4 positive place invariants in 11 ms returned sat
[2024-05-25 17:23:16] [INFO ] [Real]Absence check using 4 positive and 1099 generalized place invariants in 160 ms returned sat
[2024-05-25 17:23:17] [INFO ] [Real]Absence check using state equation in 615 ms returned sat
[2024-05-25 17:23:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 17:23:17] [INFO ] [Nat]Absence check using 4 positive place invariants in 11 ms returned sat
[2024-05-25 17:23:17] [INFO ] [Nat]Absence check using 4 positive and 1099 generalized place invariants in 168 ms returned sat
[2024-05-25 17:23:18] [INFO ] [Nat]Absence check using state equation in 631 ms returned sat
[2024-05-25 17:23:18] [INFO ] Computed and/alt/rep : 216/254/216 causal constraints (skipped 60 transitions) in 21 ms.
[2024-05-25 17:23:19] [INFO ] Added : 88 causal constraints over 18 iterations in 715 ms. Result :sat
Minimization took 460 ms.
[2024-05-25 17:23:19] [INFO ] [Real]Absence check using 4 positive place invariants in 11 ms returned sat
[2024-05-25 17:23:19] [INFO ] [Real]Absence check using 4 positive and 1099 generalized place invariants in 169 ms returned sat
[2024-05-25 17:23:20] [INFO ] [Real]Absence check using state equation in 1115 ms returned sat
[2024-05-25 17:23:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 17:23:21] [INFO ] [Nat]Absence check using 4 positive place invariants in 11 ms returned sat
[2024-05-25 17:23:21] [INFO ] [Nat]Absence check using 4 positive and 1099 generalized place invariants in 172 ms returned sat
[2024-05-25 17:23:22] [INFO ] [Nat]Absence check using state equation in 845 ms returned sat
[2024-05-25 17:23:22] [INFO ] Computed and/alt/rep : 216/254/216 causal constraints (skipped 60 transitions) in 19 ms.
[2024-05-25 17:23:22] [INFO ] Added : 77 causal constraints over 16 iterations in 698 ms. Result :sat
Minimization took 493 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[18, 0, 0, 0, 0, 19, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, 10, 19, 1, 19, 1, +inf, 1, +inf, 19, +inf]
FORMULA QuasiCertifProtocol-COL-18-UpperBounds-08 19 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-COL-18-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA QuasiCertifProtocol-COL-18-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA QuasiCertifProtocol-COL-18-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA QuasiCertifProtocol-COL-18-UpperBounds-13 19 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA QuasiCertifProtocol-COL-18-UpperBounds-03 19 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA QuasiCertifProtocol-COL-18-UpperBounds-02 10 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[19, 19, 361, 19, 361] Max Struct:[+inf, +inf, +inf, +inf, +inf]
Support contains 779 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 956 are kept as prefixes of interest. Removing 442 places using SCC suffix rule.6 ms
Discarding 442 places :
Also discarding 76 output transitions
Drop transitions (Output transitions of discarded places.) removed 76 transitions
Drop transitions (Empty/Sink Transition effects.) removed 100 transitions
Reduce isomorphic transitions removed 100 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 139 rules applied. Total rules applied 140 place count 918 transition count 119
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 141 place count 917 transition count 119
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 141 place count 917 transition count 99
Deduced a syphon composed of 20 places in 0 ms
Ensure Unique test removed 19 places
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 2 with 59 rules applied. Total rules applied 200 place count 878 transition count 99
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 201 place count 877 transition count 98
Ensure Unique test removed 19 places
Iterating post reduction 2 with 19 rules applied. Total rules applied 220 place count 858 transition count 98
Applied a total of 220 rules in 109 ms. Remains 858 /1398 variables (removed 540) and now considering 98/296 (removed 198) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 119 ms. Remains : 858/1398 places, 98/296 transitions.
When looking for a positive semi flow solution, solver replied unsat
// Phase 1: matrix 98 rows 858 cols
[2024-05-25 17:23:25] [INFO ] Computed 760 invariants in 7 ms
Current structural bounds on expressions (after invariants) : Max Seen:[19, 19, 361, 19, 361] Max Struct:[+inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000000 steps (10101 resets) in 24413 ms. (40 steps per ms)
BEST_FIRST walk for 3835927 steps (3358 resets) in 24307 ms. (157 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[19, 19, 361, 19, 361] Max Struct:[+inf, +inf, +inf, +inf, +inf]
[2024-05-25 17:24:14] [INFO ] Invariant cache hit.
[2024-05-25 17:24:14] [INFO ] [Real]Absence check using 0 positive and 760 generalized place invariants in 124 ms returned sat
[2024-05-25 17:24:14] [INFO ] [Real]Absence check using state equation in 139 ms returned unsat
[2024-05-25 17:24:14] [INFO ] [Real]Absence check using 0 positive and 760 generalized place invariants in 123 ms returned sat
[2024-05-25 17:24:14] [INFO ] [Real]Absence check using state equation in 141 ms returned unsat
[2024-05-25 17:24:14] [INFO ] [Real]Absence check using 0 positive and 760 generalized place invariants in 126 ms returned sat
[2024-05-25 17:24:16] [INFO ] [Real]Absence check using state equation in 1345 ms returned unsat
[2024-05-25 17:24:16] [INFO ] [Real]Absence check using 0 positive and 760 generalized place invariants in 158 ms returned sat
[2024-05-25 17:24:16] [INFO ] [Real]Absence check using state equation in 209 ms returned unsat
[2024-05-25 17:24:16] [INFO ] [Real]Absence check using 0 positive and 760 generalized place invariants in 135 ms returned sat
[2024-05-25 17:24:17] [INFO ] [Real]Absence check using state equation in 830 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[19, 19, 361, 19, 361] Max Struct:[19, 19, 361, 19, 361]
FORMULA QuasiCertifProtocol-COL-18-UpperBounds-15 361 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-COL-18-UpperBounds-12 19 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-COL-18-UpperBounds-10 361 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-COL-18-UpperBounds-01 19 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-COL-18-UpperBounds-00 19 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 5 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 )
[2024-05-25 17:24:17] [INFO ] Flatten gal took : 94 ms
[2024-05-25 17:24:18] [INFO ] Flatten gal took : 51 ms
[2024-05-25 17:24:18] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12392612905381788331.gal : 20 ms
[2024-05-25 17:24:18] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5065651277817663330.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/ReachabilityCardinality12392612905381788331.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5065651277817663330.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 89865 ms.

BK_STOP 1716657858163

--------------------
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.202405141337.jar
+ 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="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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