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-167889212000116.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 RERS17pb115-PT-6, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r339-tall-167889212000116
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 70M
-rw-r--r-- 1 mcc users 7.4K Feb 25 13:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Feb 25 13:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 25 13:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 25 13:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 16:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Feb 25 16:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 14:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 144K Feb 25 14:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Feb 25 14:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 25 14:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 2 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 69M 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 1679095373198

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=RERS17pb115-PT-6
Not applying reductions.
Model is PT
ReachabilityDeadlock PT
Running Version 202303021504
[2023-03-17 23:22:54] [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-17 23:22:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-17 23:22:56] [INFO ] Load time of PNML (sax parser for PT used): 2098 ms
[2023-03-17 23:22:56] [INFO ] Transformed 1399 places.
[2023-03-17 23:22:57] [INFO ] Transformed 144369 transitions.
[2023-03-17 23:22:57] [INFO ] Parsed PT model containing 1399 places and 144369 transitions and 577414 arcs in 2633 ms.
Parsed 1 properties from file /home/mcc/execution/ReachabilityDeadlock.xml in 2 ms.
Working with output stream class java.io.PrintStream
Built sparse matrix representations for Structural reductions in 35 ms.286315KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 1399/1399 places, 144369/144369 transitions.
Computed a total of 19 stabilizing places and 1 stable transitions
Ensure Unique test removed 18 places
Computed a total of 1 stabilizing places and 1 stable transitions
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 1381 transition count 144369
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 1380 transition count 144368
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 19 rules in 3405 ms. Remains 1380 /1399 variables (removed 19) and now considering 144368/144369 (removed 1) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 3419 ms. Remains : 1380/1399 places, 144368/144369 transitions.
Interrupted Random walk after 327248 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=10 )
[2023-03-17 23:23:31] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
// Phase 1: matrix 81237 rows 1380 cols
[2023-03-17 23:23:32] [INFO ] Computed 19 place invariants in 412 ms
[2023-03-17 23:23:56] [INFO ] [Real]Absence check using 19 positive place invariants in 94 ms returned sat
[2023-03-17 23:23:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 23:24:15] [INFO ] [Real]Absence check using state equation in 18862 ms returned sat
[2023-03-17 23:24:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 23:24:40] [INFO ] [Nat]Absence check using 19 positive place invariants in 88 ms returned sat
[2023-03-17 23:24:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 23:24:59] [INFO ] [Nat]Absence check using state equation in 18871 ms returned sat
[2023-03-17 23:25:00] [INFO ] State equation strengthened by 741 read => feed constraints.
[2023-03-17 23:25:06] [INFO ] [Nat]Added 741 Read/Feed constraints in 6165 ms returned sat
[2023-03-17 23:25:14] [INFO ] Deduced a trap composed of 72 places in 7073 ms of which 9 ms to minimize.
[2023-03-17 23:25:22] [INFO ] Deduced a trap composed of 64 places in 6641 ms of which 1 ms to minimize.
[2023-03-17 23:25:30] [INFO ] Deduced a trap composed of 96 places in 6753 ms of which 1 ms to minimize.
[2023-03-17 23:25:39] [INFO ] Deduced a trap composed of 128 places in 8201 ms of which 3 ms to minimize.
[2023-03-17 23:25:48] [INFO ] Deduced a trap composed of 80 places in 7767 ms of which 1 ms to minimize.
[2023-03-17 23:25:56] [INFO ] Deduced a trap composed of 48 places in 7301 ms of which 1 ms to minimize.
[2023-03-17 23:26:05] [INFO ] Deduced a trap composed of 64 places in 7269 ms of which 1 ms to minimize.
[2023-03-17 23:26:15] [INFO ] Deduced a trap composed of 34 places in 8724 ms of which 1 ms to minimize.
[2023-03-17 23:26:24] [INFO ] Deduced a trap composed of 48 places in 7797 ms of which 1 ms to minimize.
[2023-03-17 23:26:32] [INFO ] Deduced a trap composed of 64 places in 7419 ms of which 1 ms to minimize.
[2023-03-17 23:26:40] [INFO ] Deduced a trap composed of 128 places in 6890 ms of which 4 ms to minimize.
[2023-03-17 23:26:48] [INFO ] Deduced a trap composed of 40 places in 6810 ms of which 0 ms to minimize.
[2023-03-17 23:26:56] [INFO ] Deduced a trap composed of 128 places in 7165 ms of which 1 ms to minimize.
[2023-03-17 23:27:05] [INFO ] Deduced a trap composed of 128 places in 7845 ms of which 1 ms to minimize.
[2023-03-17 23:27:13] [INFO ] Deduced a trap composed of 96 places in 6507 ms of which 0 ms to minimize.
[2023-03-17 23:27:21] [INFO ] Deduced a trap composed of 72 places in 6790 ms of which 1 ms to minimize.
[2023-03-17 23:27:29] [INFO ] Deduced a trap composed of 16 places in 6679 ms of which 1 ms to minimize.
[2023-03-17 23:27:37] [INFO ] Deduced a trap composed of 72 places in 6883 ms of which 1 ms to minimize.
[2023-03-17 23:27:45] [INFO ] Deduced a trap composed of 40 places in 7002 ms of which 1 ms to minimize.
[2023-03-17 23:27:53] [INFO ] Deduced a trap composed of 72 places in 6882 ms of which 1 ms to minimize.
[2023-03-17 23:28:01] [INFO ] Deduced a trap composed of 64 places in 7052 ms of which 0 ms to minimize.
[2023-03-17 23:28:09] [INFO ] Deduced a trap composed of 64 places in 6668 ms of which 1 ms to minimize.
[2023-03-17 23:28:17] [INFO ] Deduced a trap composed of 64 places in 6344 ms of which 0 ms to minimize.
[2023-03-17 23:28:25] [INFO ] Deduced a trap composed of 96 places in 6928 ms of which 0 ms to minimize.
[2023-03-17 23:28:33] [INFO ] Deduced a trap composed of 72 places in 6972 ms of which 0 ms to minimize.
[2023-03-17 23:28:41] [INFO ] Deduced a trap composed of 128 places in 6467 ms of which 0 ms to minimize.
[2023-03-17 23:28:48] [INFO ] Deduced a trap composed of 96 places in 6303 ms of which 0 ms to minimize.
[2023-03-17 23:28:56] [INFO ] Deduced a trap composed of 96 places in 6311 ms of which 1 ms to minimize.
[2023-03-17 23:29:03] [INFO ] Deduced a trap composed of 128 places in 6386 ms of which 1 ms to minimize.
[2023-03-17 23:29:11] [INFO ] Deduced a trap composed of 96 places in 6516 ms of which 1 ms to minimize.
[2023-03-17 23:29:19] [INFO ] Deduced a trap composed of 128 places in 6608 ms of which 0 ms to minimize.
[2023-03-17 23:29:19] [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 185517 steps, including 0 resets, run timeout after 30003 ms. (steps per millisecond=6 )
Interrupted Random walk after 327989 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=10 )
Interrupted Random directed walk after 180113 steps, including 0 resets, run timeout after 30003 ms. (steps per millisecond=6 )
Interrupted Random walk after 323404 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=10 )
Starting structural reductions in DEADLOCK mode, iteration 0 : 1380/1380 places, 144368/144368 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 1271 ms. Remains 1380 /1380 variables (removed 0) and now considering 144368/144368 (removed 0) transitions.
[2023-03-17 23:31:20] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
[2023-03-17 23:31:20] [INFO ] Invariant cache hit.
[2023-03-17 23:31:29] [INFO ] Implicit Places using invariants in 9550 ms returned []
Implicit Place search using SMT only with invariants took 9551 ms to find 0 implicit places.
[2023-03-17 23:31:29] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
[2023-03-17 23:31:29] [INFO ] Invariant cache hit.
[2023-03-17 23:32:00] [INFO ] Performed 94804/144368 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 23:32:15] [INFO ] Dead Transitions using invariants and state equation in 45776 ms found 0 transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 56600 ms. Remains : 1380/1380 places, 144368/144368 transitions.
Interrupted Random walk after 341236 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=11 )
[2023-03-17 23:32:45] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
[2023-03-17 23:32:45] [INFO ] Invariant cache hit.
[2023-03-17 23:33:08] [INFO ] [Real]Absence check using 19 positive place invariants in 32 ms returned sat
[2023-03-17 23:33:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 23:33:27] [INFO ] [Real]Absence check using state equation in 18805 ms returned sat
[2023-03-17 23:33:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 23:33:51] [INFO ] [Nat]Absence check using 19 positive place invariants in 90 ms returned sat
[2023-03-17 23:33:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 23:34:09] [INFO ] [Nat]Absence check using state equation in 18669 ms returned sat
[2023-03-17 23:34:10] [INFO ] State equation strengthened by 741 read => feed constraints.
[2023-03-17 23:34:16] [INFO ] [Nat]Added 741 Read/Feed constraints in 5659 ms returned sat
[2023-03-17 23:34:23] [INFO ] Deduced a trap composed of 96 places in 6486 ms of which 1 ms to minimize.
[2023-03-17 23:34:31] [INFO ] Deduced a trap composed of 80 places in 7203 ms of which 1 ms to minimize.
[2023-03-17 23:34:39] [INFO ] Deduced a trap composed of 16 places in 6431 ms of which 2 ms to minimize.
[2023-03-17 23:34:47] [INFO ] Deduced a trap composed of 128 places in 6904 ms of which 1 ms to minimize.
[2023-03-17 23:34:54] [INFO ] Deduced a trap composed of 40 places in 6049 ms of which 1 ms to minimize.
[2023-03-17 23:35:01] [INFO ] Deduced a trap composed of 64 places in 6158 ms of which 1 ms to minimize.
[2023-03-17 23:35:10] [INFO ] Deduced a trap composed of 48 places in 7650 ms of which 1 ms to minimize.
[2023-03-17 23:35:19] [INFO ] Deduced a trap composed of 64 places in 7775 ms of which 1 ms to minimize.
[2023-03-17 23:35:28] [INFO ] Deduced a trap composed of 72 places in 7554 ms of which 2 ms to minimize.
[2023-03-17 23:35:36] [INFO ] Deduced a trap composed of 128 places in 7470 ms of which 1 ms to minimize.
[2023-03-17 23:35:46] [INFO ] Deduced a trap composed of 48 places in 8082 ms of which 1 ms to minimize.
[2023-03-17 23:35:54] [INFO ] Deduced a trap composed of 128 places in 7337 ms of which 1 ms to minimize.
[2023-03-17 23:36:02] [INFO ] Deduced a trap composed of 64 places in 6986 ms of which 1 ms to minimize.
[2023-03-17 23:36:10] [INFO ] Deduced a trap composed of 72 places in 6855 ms of which 1 ms to minimize.
[2023-03-17 23:36:19] [INFO ] Deduced a trap composed of 40 places in 7561 ms of which 1 ms to minimize.
[2023-03-17 23:36:27] [INFO ] Deduced a trap composed of 72 places in 7206 ms of which 1 ms to minimize.
[2023-03-17 23:36:35] [INFO ] Deduced a trap composed of 72 places in 6440 ms of which 0 ms to minimize.
[2023-03-17 23:36:44] [INFO ] Deduced a trap composed of 128 places in 7391 ms of which 1 ms to minimize.
[2023-03-17 23:36:53] [INFO ] Deduced a trap composed of 64 places in 8226 ms of which 1 ms to minimize.
[2023-03-17 23:37:02] [INFO ] Deduced a trap composed of 128 places in 7649 ms of which 2 ms to minimize.
[2023-03-17 23:37:10] [INFO ] Deduced a trap composed of 72 places in 7004 ms of which 0 ms to minimize.
[2023-03-17 23:37:18] [INFO ] Deduced a trap composed of 96 places in 6812 ms of which 1 ms to minimize.
[2023-03-17 23:37:27] [INFO ] Deduced a trap composed of 64 places in 7351 ms of which 0 ms to minimize.
[2023-03-17 23:37:36] [INFO ] Deduced a trap composed of 128 places in 7879 ms of which 1 ms to minimize.
[2023-03-17 23:37:45] [INFO ] Deduced a trap composed of 96 places in 7070 ms of which 0 ms to minimize.
[2023-03-17 23:37:52] [INFO ] Deduced a trap composed of 128 places in 6416 ms of which 5 ms to minimize.
[2023-03-17 23:38:00] [INFO ] Deduced a trap composed of 128 places in 6479 ms of which 0 ms to minimize.
[2023-03-17 23:38:08] [INFO ] Deduced a trap composed of 128 places in 6340 ms of which 1 ms to minimize.
[2023-03-17 23:38:15] [INFO ] Deduced a trap composed of 40 places in 5698 ms of which 0 ms to minimize.
[2023-03-17 23:38:21] [INFO ] Deduced a trap composed of 34 places in 5074 ms of which 0 ms to minimize.
[2023-03-17 23:38:28] [INFO ] Deduced a trap composed of 64 places in 5344 ms of which 1 ms to minimize.
[2023-03-17 23:38:33] [INFO ] Trap strengthening (SAT) tested/added 32/31 trap constraints in 257883 ms
[2023-03-17 23:38:33] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed... while checking Deadlocks.
Interrupted Random directed walk after 187331 steps, including 0 resets, run timeout after 30004 ms. (steps per millisecond=6 )
Interrupted Random walk after 337189 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=11 )
Interrupted Random directed walk after 189734 steps, including 0 resets, run timeout after 30005 ms. (steps per millisecond=6 )
Interrupted Random walk after 344760 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=11 )
[2023-03-17 23:40:38] [INFO ] Flatten gal took : 3856 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin3316893117311351452
[2023-03-17 23:40:41] [INFO ] Too many transitions (144369) to apply POR reductions. Disabling POR matrices.
[2023-03-17 23:40:43] [INFO ] Built C files in 1919ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3316893117311351452
Running compilation step : cd /tmp/ltsmin3316893117311351452;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2023-03-17 23:40:44] [INFO ] Applying decomposition
[2023-03-17 23:40:48] [INFO ] Flatten gal took : 4126 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph6930821574942745340.txt' '-o' '/tmp/graph6930821574942745340.bin' '-w' '/tmp/graph6930821574942745340.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph6930821574942745340.bin' '-l' '-1' '-v' '-w' '/tmp/graph6930821574942745340.weights' '-q' '0' '-e' '0.001'
[2023-03-17 23:40:57] [INFO ] Decomposing Gal with order
[2023-03-17 23:40:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-17 23:41:08] [INFO ] Removed a total of 435474 redundant transitions.
[2023-03-17 23:41:09] [INFO ] Flatten gal took : 6686 ms
[2023-03-17 23:41:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 3783 labels/synchronizations in 15658 ms.
[2023-03-17 23:41:30] [INFO ] Time to serialize gal into /tmp/ReachabilityDeadlock5593097262810190540.gal : 473 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.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityDeadlock5593097262810190540.gal' '-t' 'CGAL' '-ctl' 'DEADLOCK'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...234
No direction supplied, using forward translation only.

BK_STOP 1679096800771

--------------------
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="RERS17pb115-PT-6"
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 RERS17pb115-PT-6, 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-167889212000116"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/RERS17pb115-PT-6.tgz
mv RERS17pb115-PT-6 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 ;