fond
Model Checking Contest 2026
16th edition, Hamburg, Germany, June 23, 2026
Execution of r072-tall-177946970500427
Last Updated
Jun 17, 2026

About the Execution of ITS-Tools for CryptoMiner-PT-D20N100

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
314.684 5778.00 12446.00 68.10 T normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r072-tall-177946970500427.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-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-5973
Executing tool itstools
Input is CryptoMiner-PT-D20N100, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r072-tall-177946970500427
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 888K
-rw-r--r-- 1 mcc users 26K Mar 6 13:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 158K Mar 6 13:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 13K Mar 6 13:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 79K Mar 6 13:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 19K Mar 15 08:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Mar 15 08:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Mar 15 08:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 33K Mar 15 08:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 35K Mar 6 13:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 200K Mar 6 13:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 23K Mar 6 13:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 146K Mar 6 13:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.9K Mar 15 08:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 9.2K Mar 15 08:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 8 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 27K Mar 3 18:30 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME QuasiLiveness

=== Now, execution of the tool begins

BK_START 1779524299113

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=CryptoMiner-PT-D20N100
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
QuasiLiveness PT
Running Version 202604301425
[2026-05-23 08:18:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2026-05-23 08:18:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 08:18:20] [INFO ] Load time of PNML (sax parser for PT used): 54 ms
[2026-05-23 08:18:20] [INFO ] Transformed 63 places.
[2026-05-23 08:18:20] [INFO ] Transformed 63 transitions.
[2026-05-23 08:18:20] [INFO ] Parsed PT model containing 63 places and 63 transitions and 187 arcs in 153 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 63/63 places, 63/63 transitions.
Graph (trivial) has 41 edges and 63 vertex of which 21 / 63 are part of one of the 1 SCC in 5 ms
Free SCC test removed 20 places
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 42 transition count 43
Applied a total of 2 rules in 26 ms. Remains 42 /63 variables (removed 21) and now considering 43/63 (removed 20) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5705012183402029843.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-759525238573143215.kers'
[2026-05-23 08:18:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5705012183402029843.kers, --Pflows, --basisKERS=/tmp/petrispot-output-759525238573143215.kers]
Normalized transition count is 42 out of 43 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 42 rows 42 cols 102 entries
Finished phase 1 with 42 SingleSign rule and 0 generalized
[2026-05-23 08:18:20] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-759525238573143215.kers
Total runtime 2 ms.
[2026-05-23 08:18:20] [INFO ] Implicit Places using invariants in 181 ms returned []
[2026-05-23 08:18:20] [INFO ] Invariant cache hit.
[2026-05-23 08:18:20] [INFO ] State equation strengthened by 20 read => feed constraints.
[2026-05-23 08:18:20] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 300 ms to find 0 implicit places.
Running 40 sub problems to find dead transitions.
[2026-05-23 08:18:20] [INFO ] Invariant cache hit.
[2026-05-23 08:18:20] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (OVERLAPS) 42/83 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (OVERLAPS) 1/84 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (OVERLAPS) 0/84 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Real declared 84/85 variables, and 62 constraints, problems are : Problem set: 0 solved, 40 unsolved in 1044 ms.
Refiners :[State Equation: 42/42 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 40 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (OVERLAPS) 42/83 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (OVERLAPS) 1/84 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/84 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/84 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 8 (OVERLAPS) 0/84 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Int declared 84/85 variables, and 102 constraints, problems are : Problem set: 0 solved, 40 unsolved in 1264 ms.
Refiners :[State Equation: 42/42 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2362ms problems are : Problem set: 0 solved, 40 unsolved
Search for dead transitions found 0 dead transitions in 2385ms
Starting structural reductions in LIVENESS mode, iteration 1 : 42/63 places, 43/63 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 2743 ms. Remains : 42/63 places, 43/63 transitions.
Discarding 22 transitions out of 43. Remains 21
Initial state reduction rules removed 1 formulas.
RANDOM walk for 40122 steps (565 resets) in 600 ms. (66 steps per ms) remains 19/20 properties
BEST_FIRST walk for 4001 steps (130 resets) in 131 ms. (30 steps per ms) remains 13/19 properties
BEST_FIRST walk for 4000 steps (128 resets) in 115 ms. (34 steps per ms) remains 12/13 properties
BEST_FIRST walk for 4000 steps (132 resets) in 91 ms. (43 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4000 steps (128 resets) in 59 ms. (66 steps per ms) remains 8/12 properties
BEST_FIRST walk for 4002 steps (130 resets) in 49 ms. (80 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4000 steps (131 resets) in 45 ms. (86 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4001 steps (130 resets) in 51 ms. (76 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4000 steps (125 resets) in 43 ms. (90 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4000 steps (135 resets) in 30 ms. (129 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4000 steps (129 resets) in 44 ms. (88 steps per ms) remains 8/8 properties
[2026-05-23 08:18:23] [INFO ] Invariant cache hit.
[2026-05-23 08:18:23] [INFO ] State equation strengthened by 20 read => feed constraints.
[2026-05-23 08:18:23] [INFO ] Flatten gal took : 37 ms
[2026-05-23 08:18:23] [INFO ] Flatten gal took : 10 ms
[2026-05-23 08:18:23] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3461998568325734390.gal : 7 ms
[2026-05-23 08:18:23] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15309399918368629637.prop : 1 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.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality3461998568325734390.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15309399918368629637.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Loading property file /tmp/ReachabilityCardinality15309399918368629637.prop.
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :4 after 9
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :9 after 19
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :19 after 60
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :60 after 190
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :190 after 855
At refinement iteration 1 (OVERLAPS) 30/47 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 8 unsolved
SDD proceeding with computation,8 properties remain. new max is 256
SDD size :855 after 6132
SDD proceeding with computation,8 properties remain. new max is 512
SDD size :6132 after 111600
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 14/61 variables, 13/38 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/61 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 8 unsolved
SDD proceeding with computation,8 properties remain. new max is 1024
SDD size :111600 after 4.82458e+06
At refinement iteration 7 (OVERLAPS) 2/63 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/63 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/63 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 2/65 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/65 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/65 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 2/67 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/67 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/67 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (OVERLAPS) 2/69 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/69 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/69 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (OVERLAPS) 2/71 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/71 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/71 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 22 (OVERLAPS) 2/73 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/73 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/73 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 25 (OVERLAPS) 2/75 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/75 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/75 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 28 (OVERLAPS) 2/77 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/77 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/77 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 31 (OVERLAPS) 2/79 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/79 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/79 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 34 (OVERLAPS) 2/81 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/81 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/81 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 37 (OVERLAPS) 2/83 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/83 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/83 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 40 (OVERLAPS) 1/84 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/84 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 42 (OVERLAPS) 0/84 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 84/85 variables, and 62 constraints, problems are : Problem set: 0 solved, 8 unsolved in 970 ms.
Refiners :[State Equation: 42/42 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Reachability property qltransition_12 is true.
Reachability property qltransition_10 is true.
Reachability property qltransition_9 is true.
Reachability property qltransition_8 is true.
Reachability property qltransition_7 is true.
Reachability property qltransition_6 is true.
Reachability property qltransition_5 is true.
Reachability property qltransition_4 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 1025 fixpoint passes
After SMT solving in domain Int declared 47/85 variables, and 17 constraints, problems are : Problem set: 8 solved, 0 unsolved in 65 ms.
Refiners :[State Equation: 17/42 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 0/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1054ms problems are : Problem set: 8 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Able to resolve query QuasiLiveness after proving 21 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK DECISION_DIAGRAMS COLLATERAL_PROCESSING BESTFIRST_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 4582 ms.

BK_STOP 1779524304891

--------------------
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
+ [[ QuasiLiveness = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution QuasiLiveness -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ 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.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination QuasiLiveness -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800

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="CryptoMiner-PT-D20N100"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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-5973"
echo " Executing tool itstools"
echo " Input is CryptoMiner-PT-D20N100, examination is QuasiLiveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r072-tall-177946970500427"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CryptoMiner-PT-D20N100.tgz
mv CryptoMiner-PT-D20N100 execution
cd execution
if [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "UpperBounds" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] || [ "QuasiLiveness" = "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 [ "QuasiLiveness" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "QuasiLiveness" != "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 "QuasiLiveness.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 '' QuasiLiveness.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] ; then
echo "FORMULA_NAME QuasiLiveness"
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 ;