Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2022-input.r193-tajo-165281577000126.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2022-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is RERS17pb115-PT-8, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r193-tajo-165281577000126
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 70M
-rw-r--r-- 1 mcc users 7.6K Apr 30 06:40 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Apr 30 06:40 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Apr 30 06:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 30 06:36 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.3K May 9 08:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 9 08:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K May 9 08:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 9 08:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:34 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 9 08:34 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 2 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 69M May 10 09:34 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 1653139772466

Running Version 202205111006
[2022-05-21 13:29:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityDeadlock, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2022-05-21 13:29:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-21 13:29:35] [INFO ] Load time of PNML (sax parser for PT used): 2078 ms
[2022-05-21 13:29:35] [INFO ] Transformed 1399 places.
[2022-05-21 13:29:36] [INFO ] Transformed 144369 transitions.
[2022-05-21 13:29:36] [INFO ] Parsed PT model containing 1399 places and 144369 transitions in 2657 ms.
Parsed 1 properties from file /home/mcc/execution/ReachabilityDeadlock.xml in 4 ms.
Working with output stream class java.io.PrintStream
Built sparse matrix representations for Structural reductions in 48 ms.252708KB memory used
Starting structural reductions in DEADLOCKS 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 4826 ms. Remains 1380 /1399 variables (removed 19) and now considering 144368/144369 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 1380/1399 places, 144368/144369 transitions.
Interrupted Random walk after 227076 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=7 )
[2022-05-21 13:30:12] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
// Phase 1: matrix 81237 rows 1380 cols
[2022-05-21 13:30:13] [INFO ] Computed 19 place invariants in 555 ms
[2022-05-21 13:30:34] [INFO ] [Real]Absence check using 19 positive place invariants in 70 ms returned sat
[2022-05-21 13:30:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 13:30:53] [INFO ] [Real]Absence check using state equation in 19329 ms returned sat
[2022-05-21 13:30:55] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 13:31:16] [INFO ] [Nat]Absence check using 19 positive place invariants in 67 ms returned sat
[2022-05-21 13:31:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 13:31:34] [INFO ] [Nat]Absence check using state equation in 18734 ms returned sat
[2022-05-21 13:31:36] [INFO ] State equation strengthened by 741 read => feed constraints.
[2022-05-21 13:31:42] [INFO ] [Nat]Added 741 Read/Feed constraints in 6120 ms returned sat
[2022-05-21 13:31:49] [INFO ] Deduced a trap composed of 40 places in 5408 ms of which 5 ms to minimize.
[2022-05-21 13:31:58] [INFO ] Deduced a trap composed of 64 places in 6945 ms of which 3 ms to minimize.
[2022-05-21 13:32:05] [INFO ] Deduced a trap composed of 40 places in 5858 ms of which 1 ms to minimize.
[2022-05-21 13:32:13] [INFO ] Deduced a trap composed of 72 places in 6396 ms of which 2 ms to minimize.
[2022-05-21 13:32:23] [INFO ] Deduced a trap composed of 96 places in 8132 ms of which 2 ms to minimize.
[2022-05-21 13:32:32] [INFO ] Deduced a trap composed of 64 places in 7796 ms of which 1 ms to minimize.
[2022-05-21 13:32:40] [INFO ] Deduced a trap composed of 72 places in 6797 ms of which 1 ms to minimize.
[2022-05-21 13:32:49] [INFO ] Deduced a trap composed of 64 places in 7890 ms of which 1 ms to minimize.
[2022-05-21 13:33:00] [INFO ] Deduced a trap composed of 128 places in 9462 ms of which 2 ms to minimize.
[2022-05-21 13:33:09] [INFO ] Deduced a trap composed of 34 places in 7389 ms of which 2 ms to minimize.
[2022-05-21 13:33:18] [INFO ] Deduced a trap composed of 16 places in 7048 ms of which 1 ms to minimize.
[2022-05-21 13:33:29] [INFO ] Deduced a trap composed of 128 places in 9851 ms of which 1 ms to minimize.
[2022-05-21 13:33:37] [INFO ] Deduced a trap composed of 48 places in 6408 ms of which 0 ms to minimize.
[2022-05-21 13:33:45] [INFO ] Deduced a trap composed of 128 places in 6850 ms of which 1 ms to minimize.
[2022-05-21 13:33:53] [INFO ] Deduced a trap composed of 72 places in 6038 ms of which 1 ms to minimize.
[2022-05-21 13:34:02] [INFO ] Deduced a trap composed of 96 places in 7887 ms of which 3 ms to minimize.
[2022-05-21 13:34:11] [INFO ] Deduced a trap composed of 96 places in 7561 ms of which 1 ms to minimize.
[2022-05-21 13:34:21] [INFO ] Deduced a trap composed of 72 places in 8156 ms of which 1 ms to minimize.
[2022-05-21 13:34:31] [INFO ] Deduced a trap composed of 64 places in 8113 ms of which 1 ms to minimize.
[2022-05-21 13:34:40] [INFO ] Deduced a trap composed of 96 places in 7128 ms of which 1 ms to minimize.
[2022-05-21 13:34:48] [INFO ] Deduced a trap composed of 64 places in 6825 ms of which 0 ms to minimize.
[2022-05-21 13:34:56] [INFO ] Deduced a trap composed of 80 places in 6269 ms of which 1 ms to minimize.
[2022-05-21 13:35:05] [INFO ] Deduced a trap composed of 40 places in 7190 ms of which 1 ms to minimize.
[2022-05-21 13:35:13] [INFO ] Deduced a trap composed of 128 places in 6358 ms of which 0 ms to minimize.
[2022-05-21 13:35:21] [INFO ] Deduced a trap composed of 96 places in 6465 ms of which 1 ms to minimize.
[2022-05-21 13:35:28] [INFO ] Deduced a trap composed of 48 places in 5874 ms of which 1 ms to minimize.
[2022-05-21 13:35:36] [INFO ] Deduced a trap composed of 128 places in 6666 ms of which 0 ms to minimize.
[2022-05-21 13:35:44] [INFO ] Deduced a trap composed of 128 places in 6537 ms of which 1 ms to minimize.
[2022-05-21 13:35:52] [INFO ] Deduced a trap composed of 72 places in 6309 ms of which 0 ms to minimize.
[2022-05-21 13:36:00] [INFO ] Deduced a trap composed of 72 places in 6560 ms of which 1 ms to minimize.
[2022-05-21 13:36:00] [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 142375 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=4 )
Interrupted Random walk after 241186 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=8 )
Interrupted Random directed walk after 122329 steps, including 0 resets, run timeout after 30004 ms. (steps per millisecond=4 )
Interrupted Random walk after 211577 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=7 )
Starting structural reductions in DEADLOCKS 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 2471 ms. Remains 1380 /1380 variables (removed 0) and now considering 144368/144368 (removed 0) transitions.
[2022-05-21 13:38:03] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
// Phase 1: matrix 81237 rows 1380 cols
[2022-05-21 13:38:03] [INFO ] Computed 19 place invariants in 344 ms
[2022-05-21 13:38:11] [INFO ] Implicit Places using invariants in 8139 ms returned []
Implicit Place search using SMT only with invariants took 8140 ms to find 0 implicit places.
[2022-05-21 13:38:11] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
// Phase 1: matrix 81237 rows 1380 cols
[2022-05-21 13:38:11] [INFO ] Computed 19 place invariants in 329 ms
[2022-05-21 13:38:41] [INFO ] Performed 92750/144368 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2022-05-21 13:38:57] [INFO ] Dead Transitions using invariants and state equation in 46626 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1380/1380 places, 144368/144368 transitions.
Interrupted Random walk after 272194 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=9 )
[2022-05-21 13:39:28] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
// Phase 1: matrix 81237 rows 1380 cols
[2022-05-21 13:39:28] [INFO ] Computed 19 place invariants in 397 ms
[2022-05-21 13:39:51] [INFO ] [Real]Absence check using 19 positive place invariants in 78 ms returned sat
[2022-05-21 13:39:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 13:40:12] [INFO ] [Real]Absence check using state equation in 21218 ms returned sat
[2022-05-21 13:40:14] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 13:40:36] [INFO ] [Nat]Absence check using 19 positive place invariants in 67 ms returned sat
[2022-05-21 13:40:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 13:40:56] [INFO ] [Nat]Absence check using state equation in 19383 ms returned sat
[2022-05-21 13:40:57] [INFO ] State equation strengthened by 741 read => feed constraints.
[2022-05-21 13:41:03] [INFO ] [Nat]Added 741 Read/Feed constraints in 6248 ms returned sat
[2022-05-21 13:41:10] [INFO ] Deduced a trap composed of 40 places in 5635 ms of which 1 ms to minimize.
[2022-05-21 13:41:19] [INFO ] Deduced a trap composed of 64 places in 7142 ms of which 1 ms to minimize.
[2022-05-21 13:41:26] [INFO ] Deduced a trap composed of 40 places in 5608 ms of which 1 ms to minimize.
[2022-05-21 13:41:34] [INFO ] Deduced a trap composed of 72 places in 6744 ms of which 2 ms to minimize.
[2022-05-21 13:41:44] [INFO ] Deduced a trap composed of 96 places in 7783 ms of which 2 ms to minimize.
[2022-05-21 13:41:52] [INFO ] Deduced a trap composed of 64 places in 6583 ms of which 0 ms to minimize.
[2022-05-21 13:42:00] [INFO ] Deduced a trap composed of 72 places in 6809 ms of which 1 ms to minimize.
[2022-05-21 13:42:10] [INFO ] Deduced a trap composed of 64 places in 7391 ms of which 1 ms to minimize.
[2022-05-21 13:42:21] [INFO ] Deduced a trap composed of 128 places in 9343 ms of which 2 ms to minimize.
[2022-05-21 13:42:29] [INFO ] Deduced a trap composed of 34 places in 7176 ms of which 2 ms to minimize.
[2022-05-21 13:42:37] [INFO ] Deduced a trap composed of 16 places in 6759 ms of which 1 ms to minimize.
[2022-05-21 13:42:49] [INFO ] Deduced a trap composed of 128 places in 9975 ms of which 2 ms to minimize.
[2022-05-21 13:42:57] [INFO ] Deduced a trap composed of 48 places in 6455 ms of which 0 ms to minimize.
[2022-05-21 13:43:06] [INFO ] Deduced a trap composed of 128 places in 7337 ms of which 0 ms to minimize.
[2022-05-21 13:43:13] [INFO ] Deduced a trap composed of 72 places in 5642 ms of which 1 ms to minimize.
[2022-05-21 13:43:22] [INFO ] Deduced a trap composed of 96 places in 7306 ms of which 1 ms to minimize.
[2022-05-21 13:43:30] [INFO ] Deduced a trap composed of 96 places in 6129 ms of which 1 ms to minimize.
[2022-05-21 13:43:39] [INFO ] Deduced a trap composed of 72 places in 7632 ms of which 1 ms to minimize.
[2022-05-21 13:43:48] [INFO ] Deduced a trap composed of 64 places in 7450 ms of which 1 ms to minimize.
[2022-05-21 13:43:57] [INFO ] Deduced a trap composed of 96 places in 6815 ms of which 1 ms to minimize.
[2022-05-21 13:44:04] [INFO ] Deduced a trap composed of 64 places in 6346 ms of which 1 ms to minimize.
[2022-05-21 13:44:12] [INFO ] Deduced a trap composed of 80 places in 5774 ms of which 0 ms to minimize.
[2022-05-21 13:44:19] [INFO ] Deduced a trap composed of 40 places in 5972 ms of which 0 ms to minimize.
[2022-05-21 13:44:27] [INFO ] Deduced a trap composed of 128 places in 6746 ms of which 0 ms to minimize.
[2022-05-21 13:44:36] [INFO ] Deduced a trap composed of 96 places in 6911 ms of which 0 ms to minimize.
[2022-05-21 13:44:44] [INFO ] Deduced a trap composed of 48 places in 6796 ms of which 2 ms to minimize.
[2022-05-21 13:44:52] [INFO ] Deduced a trap composed of 128 places in 6343 ms of which 4 ms to minimize.
[2022-05-21 13:44:59] [INFO ] Deduced a trap composed of 128 places in 6313 ms of which 1 ms to minimize.
[2022-05-21 13:45:08] [INFO ] Deduced a trap composed of 72 places in 7113 ms of which 0 ms to minimize.
[2022-05-21 13:45:16] [INFO ] Deduced a trap composed of 72 places in 5844 ms of which 1 ms to minimize.
[2022-05-21 13:45:16] [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 160551 steps, including 0 resets, run timeout after 30002 ms. (steps per millisecond=5 )
Interrupted Random walk after 313058 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=10 )
Interrupted Random directed walk after 162068 steps, including 0 resets, run timeout after 30006 ms. (steps per millisecond=5 )
Interrupted Random walk after 322804 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=10 )
[2022-05-21 13:47:21] [INFO ] Flatten gal took : 4659 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin6929834015966384436
[2022-05-21 13:47:24] [INFO ] Too many transitions (144369) to apply POR reductions. Disabling POR matrices.
[2022-05-21 13:47:26] [INFO ] Built C files in 1803ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6929834015966384436
Running compilation step : cd /tmp/ltsmin6929834015966384436;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-05-21 13:47:28] [INFO ] Applying decomposition
[2022-05-21 13:47:33] [INFO ] Flatten gal took : 4453 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph11394045879804636336.txt' '-o' '/tmp/graph11394045879804636336.bin' '-w' '/tmp/graph11394045879804636336.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph11394045879804636336.bin' '-l' '-1' '-v' '-w' '/tmp/graph11394045879804636336.weights' '-q' '0' '-e' '0.001'
[2022-05-21 13:47:42] [INFO ] Decomposing Gal with order
[2022-05-21 13:47:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-21 13:47:54] [INFO ] Removed a total of 435001 redundant transitions.
[2022-05-21 13:47:56] [INFO ] Flatten gal took : 8559 ms
[2022-05-21 13:48:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 2473 labels/synchronizations in 9973 ms.
[2022-05-21 13:48:12] [INFO ] Time to serialize gal into /tmp/ReachabilityDeadlock9564030171244981090.gal : 507 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityDeadlock9564030171244981090.gal' '-t' 'CGAL' '-ctl' 'DEADLOCK'

its-ctl command run as :

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

BK_STOP 1653141194198

--------------------
content from stderr:

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityDeadlock = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityDeadlock -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination ReachabilityDeadlock -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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-8"
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-4028"
echo " Executing tool itstools"
echo " Input is RERS17pb115-PT-8, 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 r193-tajo-165281577000126"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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