fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r339-tall-167889212100166
Last Updated
May 14, 2023

About the Execution of ITS-Tools for RERS2020-PT-pb107

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
3553.355 848693.00 925841.00 2343.80 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/mcc2023-input.r339-tall-167889212100166.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is RERS2020-PT-pb107, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r339-tall-167889212100166
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 59M
-rw-r--r-- 1 mcc users 6.9K Feb 26 08:35 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Feb 26 08:35 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 26 08:30 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 26 08:30 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Feb 25 16:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Feb 25 16:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.4K Feb 26 08:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 93K Feb 26 08:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K Feb 26 08:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Feb 26 08:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 59M Mar 5 18:23 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 ReachabilityDeadlock

=== Now, execution of the tool begins

BK_START 1679100135463

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityDeadlock
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=RERS2020-PT-pb107
Not applying reductions.
Model is PT
ReachabilityDeadlock PT
Running Version 202303021504
[2023-03-18 00:42:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityDeadlock, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2023-03-18 00:42:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 00:42:19] [INFO ] Load time of PNML (sax parser for PT used): 2055 ms
[2023-03-18 00:42:19] [INFO ] Transformed 1382 places.
[2023-03-18 00:42:20] [INFO ] Transformed 104643 transitions.
[2023-03-18 00:42:20] [INFO ] Found NUPN structural information;
[2023-03-18 00:42:20] [INFO ] Parsed PT model containing 1382 places and 104643 transitions and 417030 arcs in 2427 ms.
Parsed 1 properties from file /home/mcc/execution/ReachabilityDeadlock.xml in 2 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 11427 transitions
Reduce redundant transitions removed 11427 transitions.
Built sparse matrix representations for Structural reductions in 51 ms.250823KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 1382/1382 places, 93216/93216 transitions.
Computed a total of 273 stabilizing places and 30825 stable transitions
Graph (complete) has 95856 edges and 1382 vertex of which 1381 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.448 ms
Discarding 1 places :
Also discarding 0 output transitions
Ensure Unique test removed 12 places
Computed a total of 261 stabilizing places and 30825 stable transitions
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 1369 transition count 93215
Reduce places removed 1 places and 0 transitions.
Computed a total of 260 stabilizing places and 30824 stable transitions
Iterating post reduction 1 with 1 rules applied. Total rules applied 15 place count 1368 transition count 93215
Computed a total of 260 stabilizing places and 30824 stable transitions
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 15 place count 1368 transition count 93213
Deduced a syphon composed of 2 places in 63 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 19 place count 1366 transition count 93213
Computed a total of 260 stabilizing places and 30824 stable transitions
Performed 17 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 17 places in 119 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 53 place count 1349 transition count 93193
Ensure Unique test removed 439 transitions
Reduce isomorphic transitions removed 439 transitions.
Computed a total of 258 stabilizing places and 30686 stable transitions
Iterating post reduction 2 with 439 rules applied. Total rules applied 492 place count 1349 transition count 92754
Computed a total of 258 stabilizing places and 30686 stable transitions
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 66 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 500 place count 1345 transition count 92750
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 96 transitions.
Computed a total of 258 stabilizing places and 30630 stable transitions
Iterating post reduction 3 with 96 rules applied. Total rules applied 596 place count 1345 transition count 92654
Computed a total of 258 stabilizing places and 30630 stable transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 54 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 598 place count 1344 transition count 92655
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Computed a total of 258 stabilizing places and 30630 stable transitions
Iterating post reduction 4 with 3 rules applied. Total rules applied 601 place count 1344 transition count 92652
Computed a total of 258 stabilizing places and 30630 stable transitions
Computed a total of 258 stabilizing places and 30630 stable transitions
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 602 place count 1343 transition count 92651
Computed a total of 257 stabilizing places and 30632 stable transitions
Computed a total of 257 stabilizing places and 30632 stable transitions
Applied a total of 602 rules in 6560 ms. Remains 1343 /1382 variables (removed 39) and now considering 92651/93216 (removed 565) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 6570 ms. Remains : 1343/1382 places, 92651/93216 transitions.
Interrupted Random walk after 549584 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=18 )
[2023-03-18 00:42:57] [INFO ] Flow matrix only has 62309 transitions (discarded 30342 similar events)
// Phase 1: matrix 62309 rows 1343 cols
[2023-03-18 00:42:58] [INFO ] Computed 12 place invariants in 348 ms
[2023-03-18 00:43:08] [INFO ] [Real]Absence check using 12 positive place invariants in 44 ms returned sat
[2023-03-18 00:43:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 00:43:20] [INFO ] [Real]Absence check using state equation in 12495 ms returned sat
[2023-03-18 00:43:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 00:43:30] [INFO ] [Nat]Absence check using 12 positive place invariants in 30 ms returned sat
[2023-03-18 00:43:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 00:43:43] [INFO ] [Nat]Absence check using state equation in 12259 ms returned sat
[2023-03-18 00:43:44] [INFO ] State equation strengthened by 3673 read => feed constraints.
[2023-03-18 00:43:51] [INFO ] [Nat]Added 3673 Read/Feed constraints in 6811 ms returned sat
[2023-03-18 00:43:58] [INFO ] Deduced a trap composed of 20 places in 6087 ms of which 5 ms to minimize.
[2023-03-18 00:44:05] [INFO ] Deduced a trap composed of 16 places in 6215 ms of which 2 ms to minimize.
[2023-03-18 00:44:11] [INFO ] Deduced a trap composed of 40 places in 5780 ms of which 2 ms to minimize.
[2023-03-18 00:44:17] [INFO ] Deduced a trap composed of 84 places in 5161 ms of which 2 ms to minimize.
[2023-03-18 00:44:25] [INFO ] Deduced a trap composed of 69 places in 6759 ms of which 1 ms to minimize.
[2023-03-18 00:44:32] [INFO ] Deduced a trap composed of 66 places in 6002 ms of which 2 ms to minimize.
[2023-03-18 00:44:39] [INFO ] Deduced a trap composed of 47 places in 6061 ms of which 1 ms to minimize.
[2023-03-18 00:44:46] [INFO ] Deduced a trap composed of 138 places in 6022 ms of which 1 ms to minimize.
[2023-03-18 00:44:54] [INFO ] Deduced a trap composed of 28 places in 6609 ms of which 1 ms to minimize.
[2023-03-18 00:45:01] [INFO ] Deduced a trap composed of 54 places in 6739 ms of which 1 ms to minimize.
[2023-03-18 00:45:09] [INFO ] Deduced a trap composed of 171 places in 6750 ms of which 1 ms to minimize.
[2023-03-18 00:45:18] [INFO ] Deduced a trap composed of 208 places in 7889 ms of which 4 ms to minimize.
[2023-03-18 00:45:26] [INFO ] Deduced a trap composed of 64 places in 7975 ms of which 1 ms to minimize.
[2023-03-18 00:45:35] [INFO ] Deduced a trap composed of 122 places in 7958 ms of which 1 ms to minimize.
[2023-03-18 00:45:43] [INFO ] Deduced a trap composed of 209 places in 6764 ms of which 2 ms to minimize.
[2023-03-18 00:45:50] [INFO ] Deduced a trap composed of 68 places in 6573 ms of which 2 ms to minimize.
[2023-03-18 00:45:58] [INFO ] Deduced a trap composed of 176 places in 6745 ms of which 1 ms to minimize.
[2023-03-18 00:46:05] [INFO ] Deduced a trap composed of 51 places in 6684 ms of which 1 ms to minimize.
[2023-03-18 00:46:12] [INFO ] Deduced a trap composed of 73 places in 5249 ms of which 1 ms to minimize.
[2023-03-18 00:46:17] [INFO ] Deduced a trap composed of 96 places in 4437 ms of which 2 ms to minimize.
[2023-03-18 00:46:22] [INFO ] Deduced a trap composed of 76 places in 4600 ms of which 4 ms to minimize.
[2023-03-18 00:46:26] [INFO ] Deduced a trap composed of 204 places in 3213 ms of which 1 ms to minimize.
[2023-03-18 00:46:28] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 157890 ms
[2023-03-18 00:46:39] [INFO ] Computed and/alt/rep : 255/1158/255 causal constraints (skipped 62053 transitions) in 10469 ms.
[2023-03-18 00:46:50] [INFO ] Added : 7 causal constraints over 3 iterations in 21756 ms. Result :sat
Interrupted Parikh directed walk after 8706 steps, including 8706 resets, run timeout after 30003 ms. (steps per millisecond=0 )
Parikh directed walk for 8706 steps, including 8706 resets, run took 30004 ms. (steps per millisecond=0 )
Interrupted Random directed walk after 357523 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=11 )
Random walk for 500000 steps, including 0 resets, run took 24868 ms (no deadlock found). (steps per millisecond=20 )
Interrupted Random directed walk after 356269 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=11 )
Random walk for 500000 steps, including 0 resets, run took 24490 ms (no deadlock found). (steps per millisecond=20 )
Starting structural reductions in DEADLOCK mode, iteration 0 : 1343/1343 places, 92651/92651 transitions.
Computed a total of 257 stabilizing places and 30632 stable transitions
Computed a total of 257 stabilizing places and 30632 stable transitions
Computed a total of 257 stabilizing places and 30632 stable transitions
Applied a total of 0 rules in 891 ms. Remains 1343 /1343 variables (removed 0) and now considering 92651/92651 (removed 0) transitions.
[2023-03-18 00:49:12] [INFO ] Flow matrix only has 62309 transitions (discarded 30342 similar events)
[2023-03-18 00:49:12] [INFO ] Invariant cache hit.
[2023-03-18 00:49:15] [INFO ] Implicit Places using invariants in 3697 ms returned []
Implicit Place search using SMT only with invariants took 3700 ms to find 0 implicit places.
[2023-03-18 00:49:16] [INFO ] Flow matrix only has 62309 transitions (discarded 30342 similar events)
[2023-03-18 00:49:16] [INFO ] Invariant cache hit.
[2023-03-18 00:49:46] [INFO ] Performed 82398/92651 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-18 00:49:49] [INFO ] Dead Transitions using invariants and state equation in 33906 ms found 0 transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 38500 ms. Remains : 1343/1343 places, 92651/92651 transitions.
Interrupted Random walk after 589721 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=19 )
[2023-03-18 00:50:19] [INFO ] Flow matrix only has 62309 transitions (discarded 30342 similar events)
[2023-03-18 00:50:19] [INFO ] Invariant cache hit.
[2023-03-18 00:50:29] [INFO ] [Real]Absence check using 12 positive place invariants in 29 ms returned sat
[2023-03-18 00:50:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 00:50:43] [INFO ] [Real]Absence check using state equation in 13252 ms returned sat
[2023-03-18 00:50:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 00:50:54] [INFO ] [Nat]Absence check using 12 positive place invariants in 27 ms returned sat
[2023-03-18 00:50:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 00:51:06] [INFO ] [Nat]Absence check using state equation in 12531 ms returned sat
[2023-03-18 00:51:07] [INFO ] State equation strengthened by 3673 read => feed constraints.
[2023-03-18 00:51:13] [INFO ] [Nat]Added 3673 Read/Feed constraints in 6329 ms returned sat
[2023-03-18 00:51:22] [INFO ] Deduced a trap composed of 70 places in 7270 ms of which 2 ms to minimize.
[2023-03-18 00:51:29] [INFO ] Deduced a trap composed of 16 places in 7024 ms of which 2 ms to minimize.
[2023-03-18 00:51:37] [INFO ] Deduced a trap composed of 16 places in 6878 ms of which 2 ms to minimize.
[2023-03-18 00:51:46] [INFO ] Deduced a trap composed of 30 places in 7713 ms of which 2 ms to minimize.
[2023-03-18 00:51:54] [INFO ] Deduced a trap composed of 66 places in 7639 ms of which 2 ms to minimize.
[2023-03-18 00:52:03] [INFO ] Deduced a trap composed of 80 places in 8011 ms of which 1 ms to minimize.
[2023-03-18 00:52:12] [INFO ] Deduced a trap composed of 64 places in 7876 ms of which 2 ms to minimize.
[2023-03-18 00:52:20] [INFO ] Deduced a trap composed of 23 places in 7929 ms of which 2 ms to minimize.
[2023-03-18 00:52:29] [INFO ] Deduced a trap composed of 47 places in 7380 ms of which 2 ms to minimize.
[2023-03-18 00:52:37] [INFO ] Deduced a trap composed of 77 places in 7407 ms of which 1 ms to minimize.
[2023-03-18 00:52:45] [INFO ] Deduced a trap composed of 20 places in 7509 ms of which 2 ms to minimize.
[2023-03-18 00:52:54] [INFO ] Deduced a trap composed of 96 places in 7463 ms of which 2 ms to minimize.
[2023-03-18 00:53:02] [INFO ] Deduced a trap composed of 100 places in 7427 ms of which 4 ms to minimize.
[2023-03-18 00:53:10] [INFO ] Deduced a trap composed of 70 places in 6882 ms of which 2 ms to minimize.
[2023-03-18 00:53:17] [INFO ] Deduced a trap composed of 104 places in 6684 ms of which 2 ms to minimize.
[2023-03-18 00:53:25] [INFO ] Deduced a trap composed of 141 places in 6734 ms of which 2 ms to minimize.
[2023-03-18 00:53:32] [INFO ] Deduced a trap composed of 52 places in 6159 ms of which 1 ms to minimize.
[2023-03-18 00:53:40] [INFO ] Deduced a trap composed of 120 places in 7507 ms of which 1 ms to minimize.
[2023-03-18 00:53:48] [INFO ] Deduced a trap composed of 217 places in 7601 ms of which 2 ms to minimize.
[2023-03-18 00:53:57] [INFO ] Deduced a trap composed of 147 places in 7565 ms of which 1 ms to minimize.
[2023-03-18 00:54:05] [INFO ] Deduced a trap composed of 170 places in 7296 ms of which 1 ms to minimize.
[2023-03-18 00:54:12] [INFO ] Deduced a trap composed of 26 places in 6218 ms of which 1 ms to minimize.
[2023-03-18 00:54:20] [INFO ] Deduced a trap composed of 20 places in 7294 ms of which 1 ms to minimize.
[2023-03-18 00:54:28] [INFO ] Deduced a trap composed of 76 places in 7007 ms of which 1 ms to minimize.
[2023-03-18 00:54:36] [INFO ] Deduced a trap composed of 39 places in 6991 ms of which 1 ms to minimize.
[2023-03-18 00:54:43] [INFO ] Deduced a trap composed of 98 places in 6510 ms of which 2 ms to minimize.
[2023-03-18 00:54:49] [INFO ] Deduced a trap composed of 88 places in 5027 ms of which 1 ms to minimize.
[2023-03-18 00:54:54] [INFO ] Deduced a trap composed of 88 places in 4736 ms of which 1 ms to minimize.
[2023-03-18 00:55:00] [INFO ] Deduced a trap composed of 69 places in 4754 ms of which 2 ms to minimize.
[2023-03-18 00:55:08] [INFO ] Deduced a trap composed of 160 places in 6905 ms of which 2 ms to minimize.
[2023-03-18 00:55:15] [INFO ] Deduced a trap composed of 162 places in 6913 ms of which 1 ms to minimize.
[2023-03-18 00:55:23] [INFO ] Deduced a trap composed of 123 places in 6858 ms of which 1 ms to minimize.
[2023-03-18 00:55:30] [INFO ] Deduced a trap composed of 141 places in 6579 ms of which 2 ms to minimize.
[2023-03-18 00:55:32] [INFO ] Trap strengthening (SAT) tested/added 34/33 trap constraints in 258010 ms
[2023-03-18 00:55:42] [INFO ] Computed and/alt/rep : 255/1158/255 causal constraints (skipped 62053 transitions) in 10001 ms.
[2023-03-18 00:55:53] [INFO ] Deduced a trap composed of 12 places in 8260 ms of which 2 ms to minimize.
[2023-03-18 00:55:53] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking Deadlocks.
Interrupted Random directed walk after 346044 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=11 )
Finished random walk after 284 steps, including 0 resets, run found a deadlock after 27 ms. (steps per millisecond=10 )
FORMULA ReachabilityDeadlock TRUE TECHNIQUES TOPOLOGICAL STRUCTURAL_REDUCTION RANDOM_WALK
Total runtime 845446 ms.

BK_STOP 1679100984156

--------------------
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
+ [[ ReachabilityDeadlock = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityDeadlock -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
+ 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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityDeadlock -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="RERS2020-PT-pb107"
export BK_EXAMINATION="ReachabilityDeadlock"
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-5348"
echo " Executing tool itstools"
echo " Input is RERS2020-PT-pb107, examination is ReachabilityDeadlock"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r339-tall-167889212100166"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/RERS2020-PT-pb107.tgz
mv RERS2020-PT-pb107 execution
cd execution
if [ "ReachabilityDeadlock" = "ReachabilityDeadlock" ] || [ "ReachabilityDeadlock" = "UpperBounds" ] || [ "ReachabilityDeadlock" = "QuasiLiveness" ] || [ "ReachabilityDeadlock" = "StableMarking" ] || [ "ReachabilityDeadlock" = "Liveness" ] || [ "ReachabilityDeadlock" = "OneSafe" ] || [ "ReachabilityDeadlock" = "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 [ "ReachabilityDeadlock" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityDeadlock" != "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 "ReachabilityDeadlock.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityDeadlock.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityDeadlock.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 '' ReachabilityDeadlock.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityDeadlock" = "ReachabilityDeadlock" ] || [ "ReachabilityDeadlock" = "QuasiLiveness" ] || [ "ReachabilityDeadlock" = "StableMarking" ] || [ "ReachabilityDeadlock" = "Liveness" ] || [ "ReachabilityDeadlock" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityDeadlock"
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 ;