Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2022-input.r193-tajo-165281576900036.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 RERS17pb113-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-165281576900036
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 15M
-rw-r--r-- 1 mcc users 8.1K Apr 30 05:37 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K Apr 30 05:37 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Apr 30 05:35 CTLFireability.txt
-rw-r--r-- 1 mcc users 34K Apr 30 05:35 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K May 9 08:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 08:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K May 9 08:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 08:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 9 08:32 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 15M 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 1653136432397

Running Version 202205111006
[2022-05-21 12:33:53] [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 12:33:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-21 12:33:54] [INFO ] Load time of PNML (sax parser for PT used): 748 ms
[2022-05-21 12:33:54] [INFO ] Transformed 639 places.
[2022-05-21 12:33:54] [INFO ] Transformed 31353 transitions.
[2022-05-21 12:33:54] [INFO ] Parsed PT model containing 639 places and 31353 transitions in 1023 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 29 ms.53154KB memory used
Starting structural reductions in DEADLOCKS mode, iteration 0 : 639/639 places, 31353/31353 transitions.
Computed a total of 13 stabilizing places and 1 stable transitions
Ensure Unique test removed 12 places
Computed a total of 1 stabilizing places and 1 stable transitions
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 627 transition count 31353
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 13 place count 626 transition count 31352
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 13 rules in 951 ms. Remains 626 /639 variables (removed 13) and now considering 31352/31353 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 626/639 places, 31352/31353 transitions.
Interrupted Random walk after 806380 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=26 )
[2022-05-21 12:34:26] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
// Phase 1: matrix 18325 rows 626 cols
[2022-05-21 12:34:26] [INFO ] Computed 13 place invariants in 176 ms
[2022-05-21 12:34:30] [INFO ] [Real]Absence check using 13 positive place invariants in 19 ms returned sat
[2022-05-21 12:34:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 12:34:48] [INFO ] [Real]Absence check using state equation in 18366 ms returned sat
[2022-05-21 12:34:49] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 12:34:53] [INFO ] [Nat]Absence check using 13 positive place invariants in 22 ms returned sat
[2022-05-21 12:34:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 12:35:08] [INFO ] [Nat]Absence check using state equation in 14729 ms returned sat
[2022-05-21 12:35:08] [INFO ] State equation strengthened by 268 read => feed constraints.
[2022-05-21 12:35:11] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-21 12:35:12] [INFO ] [Nat]Added 268 Read/Feed constraints in 4306 ms returned sat
[2022-05-21 12:35:14] [INFO ] Deduced a trap composed of 40 places in 1816 ms of which 5 ms to minimize.
[2022-05-21 12:35:17] [INFO ] Deduced a trap composed of 40 places in 1675 ms of which 3 ms to minimize.
[2022-05-21 12:35:19] [INFO ] Deduced a trap composed of 48 places in 1718 ms of which 1 ms to minimize.
[2022-05-21 12:35:22] [INFO ] Deduced a trap composed of 40 places in 1536 ms of which 1 ms to minimize.
[2022-05-21 12:35:24] [INFO ] Deduced a trap composed of 64 places in 1402 ms of which 1 ms to minimize.
[2022-05-21 12:35:25] [INFO ] Deduced a trap composed of 40 places in 1208 ms of which 1 ms to minimize.
[2022-05-21 12:35:28] [INFO ] Deduced a trap composed of 48 places in 1539 ms of which 1 ms to minimize.
[2022-05-21 12:35:29] [INFO ] Deduced a trap composed of 64 places in 1150 ms of which 0 ms to minimize.
[2022-05-21 12:35:32] [INFO ] Deduced a trap composed of 64 places in 1695 ms of which 1 ms to minimize.
[2022-05-21 12:35:34] [INFO ] Deduced a trap composed of 65 places in 1422 ms of which 0 ms to minimize.
[2022-05-21 12:35:36] [INFO ] Deduced a trap composed of 64 places in 1154 ms of which 0 ms to minimize.
[2022-05-21 12:35:38] [INFO ] Deduced a trap composed of 24 places in 1760 ms of which 1 ms to minimize.
[2022-05-21 12:35:40] [INFO ] Deduced a trap composed of 48 places in 1313 ms of which 0 ms to minimize.
[2022-05-21 12:35:42] [INFO ] Deduced a trap composed of 48 places in 1479 ms of which 1 ms to minimize.
[2022-05-21 12:35:44] [INFO ] Deduced a trap composed of 40 places in 1463 ms of which 0 ms to minimize.
[2022-05-21 12:35:46] [INFO ] Deduced a trap composed of 40 places in 1513 ms of which 0 ms to minimize.
[2022-05-21 12:35:48] [INFO ] Deduced a trap composed of 48 places in 1467 ms of which 1 ms to minimize.
[2022-05-21 12:35:51] [INFO ] Deduced a trap composed of 64 places in 1021 ms of which 0 ms to minimize.
[2022-05-21 12:35:53] [INFO ] Deduced a trap composed of 64 places in 1172 ms of which 1 ms to minimize.
[2022-05-21 12:35:56] [INFO ] Deduced a trap composed of 48 places in 978 ms of which 1 ms to minimize.
[2022-05-21 12:35:58] [INFO ] Deduced a trap composed of 64 places in 753 ms of which 1 ms to minimize.
[2022-05-21 12:35:59] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 46569 ms
[2022-05-21 12:36:02] [INFO ] Computed and/alt/rep : 1/9/1 causal constraints (skipped 18323 transitions) in 3048 ms.
[2022-05-21 12:36:03] [INFO ] Added : 0 causal constraints over 0 iterations in 4684 ms. Result :sat
Interrupted Parikh directed walk after 45890 steps, including 45890 resets, run timeout after 30001 ms. (steps per millisecond=1 )
Parikh directed walk for 45890 steps, including 45890 resets, run took 30004 ms. (steps per millisecond=1 )
Random directed walk for 500022 steps, including 0 resets, run took 27420 ms (no deadlock found). (steps per millisecond=18 )
Random walk for 500000 steps, including 0 resets, run took 14976 ms (no deadlock found). (steps per millisecond=33 )
Random directed walk for 500011 steps, including 0 resets, run took 27327 ms (no deadlock found). (steps per millisecond=18 )
Random walk for 500000 steps, including 0 resets, run took 21775 ms (no deadlock found). (steps per millisecond=22 )
Starting structural reductions in DEADLOCKS mode, iteration 0 : 626/626 places, 31352/31352 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 310 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
[2022-05-21 12:38:06] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
// Phase 1: matrix 18325 rows 626 cols
[2022-05-21 12:38:06] [INFO ] Computed 13 place invariants in 116 ms
[2022-05-21 12:38:08] [INFO ] Implicit Places using invariants in 2199 ms returned []
Implicit Place search using SMT only with invariants took 2201 ms to find 0 implicit places.
[2022-05-21 12:38:08] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
// Phase 1: matrix 18325 rows 626 cols
[2022-05-21 12:38:08] [INFO ] Computed 13 place invariants in 69 ms
[2022-05-21 12:38:18] [INFO ] Dead Transitions using invariants and state equation in 9678 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 626/626 places, 31352/31352 transitions.
Interrupted Random walk after 755514 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=25 )
[2022-05-21 12:38:48] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
// Phase 1: matrix 18325 rows 626 cols
[2022-05-21 12:38:48] [INFO ] Computed 13 place invariants in 103 ms
[2022-05-21 12:38:51] [INFO ] [Real]Absence check using 13 positive place invariants in 16 ms returned sat
[2022-05-21 12:38:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 12:39:09] [INFO ] [Real]Absence check using state equation in 18129 ms returned sat
[2022-05-21 12:39:10] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 12:39:13] [INFO ] [Nat]Absence check using 13 positive place invariants in 20 ms returned sat
[2022-05-21 12:39:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 12:39:35] [INFO ] [Nat]Absence check using state equation in 21358 ms returned sat
[2022-05-21 12:39:35] [INFO ] State equation strengthened by 268 read => feed constraints.
[2022-05-21 12:39:39] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-21 12:39:41] [INFO ] [Nat]Added 268 Read/Feed constraints in 5618 ms returned sat
[2022-05-21 12:39:43] [INFO ] Deduced a trap composed of 40 places in 2141 ms of which 1 ms to minimize.
[2022-05-21 12:39:46] [INFO ] Deduced a trap composed of 40 places in 1583 ms of which 1 ms to minimize.
[2022-05-21 12:39:48] [INFO ] Deduced a trap composed of 24 places in 1870 ms of which 1 ms to minimize.
[2022-05-21 12:39:50] [INFO ] Deduced a trap composed of 40 places in 1017 ms of which 4 ms to minimize.
[2022-05-21 12:39:53] [INFO ] Deduced a trap composed of 64 places in 2101 ms of which 1 ms to minimize.
[2022-05-21 12:39:55] [INFO ] Deduced a trap composed of 40 places in 1570 ms of which 1 ms to minimize.
[2022-05-21 12:39:57] [INFO ] Deduced a trap composed of 48 places in 1375 ms of which 1 ms to minimize.
[2022-05-21 12:39:59] [INFO ] Deduced a trap composed of 48 places in 977 ms of which 0 ms to minimize.
[2022-05-21 12:40:01] [INFO ] Deduced a trap composed of 64 places in 1255 ms of which 1 ms to minimize.
[2022-05-21 12:40:03] [INFO ] Deduced a trap composed of 48 places in 1145 ms of which 1 ms to minimize.
[2022-05-21 12:40:05] [INFO ] Deduced a trap composed of 64 places in 1486 ms of which 1 ms to minimize.
[2022-05-21 12:40:07] [INFO ] Deduced a trap composed of 64 places in 1512 ms of which 1 ms to minimize.
[2022-05-21 12:40:09] [INFO ] Deduced a trap composed of 65 places in 1057 ms of which 1 ms to minimize.
[2022-05-21 12:40:10] [INFO ] Deduced a trap composed of 40 places in 807 ms of which 2 ms to minimize.
[2022-05-21 12:40:13] [INFO ] Deduced a trap composed of 48 places in 1192 ms of which 1 ms to minimize.
[2022-05-21 12:40:14] [INFO ] Deduced a trap composed of 48 places in 949 ms of which 1 ms to minimize.
[2022-05-21 12:40:16] [INFO ] Deduced a trap composed of 64 places in 1124 ms of which 0 ms to minimize.
[2022-05-21 12:40:18] [INFO ] Deduced a trap composed of 40 places in 908 ms of which 0 ms to minimize.
[2022-05-21 12:40:20] [INFO ] Deduced a trap composed of 64 places in 1314 ms of which 1 ms to minimize.
[2022-05-21 12:40:22] [INFO ] Deduced a trap composed of 64 places in 1050 ms of which 1 ms to minimize.
[2022-05-21 12:40:24] [INFO ] Deduced a trap composed of 48 places in 1013 ms of which 0 ms to minimize.
[2022-05-21 12:40:26] [INFO ] Deduced a trap composed of 64 places in 683 ms of which 1 ms to minimize.
[2022-05-21 12:40:27] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 46631 ms
[2022-05-21 12:40:31] [INFO ] Computed and/alt/rep : 1/9/1 causal constraints (skipped 18323 transitions) in 3231 ms.
[2022-05-21 12:40:32] [INFO ] Added : 0 causal constraints over 0 iterations in 4802 ms. Result :sat
Interrupted Parikh directed walk after 49971 steps, including 49971 resets, run timeout after 30001 ms. (steps per millisecond=1 )
Parikh directed walk for 49971 steps, including 49971 resets, run took 30003 ms. (steps per millisecond=1 )
Interrupted Random directed walk after 470276 steps, including 0 resets, run timeout after 30002 ms. (steps per millisecond=15 )
Random walk for 500000 steps, including 0 resets, run took 18248 ms (no deadlock found). (steps per millisecond=27 )
Interrupted Random directed walk after 460902 steps, including 0 resets, run timeout after 30002 ms. (steps per millisecond=15 )
Random walk for 500000 steps, including 0 resets, run took 26970 ms (no deadlock found). (steps per millisecond=18 )
[2022-05-21 12:42:50] [INFO ] Flatten gal took : 1369 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin15136412862987933528
[2022-05-21 12:42:51] [INFO ] Too many transitions (31353) to apply POR reductions. Disabling POR matrices.
[2022-05-21 12:42:52] [INFO ] Built C files in 603ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15136412862987933528
Running compilation step : cd /tmp/ltsmin15136412862987933528;'/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 12:42:52] [INFO ] Applying decomposition
[2022-05-21 12:42:54] [INFO ] Flatten gal took : 1614 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/graph17991865608519145355.txt' '-o' '/tmp/graph17991865608519145355.bin' '-w' '/tmp/graph17991865608519145355.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph17991865608519145355.bin' '-l' '-1' '-v' '-w' '/tmp/graph17991865608519145355.weights' '-q' '0' '-e' '0.001'
[2022-05-21 12:42:58] [INFO ] Decomposing Gal with order
[2022-05-21 12:42:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-21 12:43:02] [INFO ] Removed a total of 91896 redundant transitions.
[2022-05-21 12:43:03] [INFO ] Flatten gal took : 3304 ms
[2022-05-21 12:43:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 1134 labels/synchronizations in 1732 ms.
[2022-05-21 12:43:06] [INFO ] Time to serialize gal into /tmp/ReachabilityDeadlock13813876674010120090.gal : 328 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/ReachabilityDeadlock13813876674010120090.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...226
No direction supplied, using forward translation only.
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15136412862987933528;'/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' killed by timeout after 360 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15136412862987933528;'/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' killed by timeout after 360 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Detected timeout of ITS tools.
[2022-05-21 12:56:14] [INFO ] Flatten gal took : 3465 ms
[2022-05-21 12:56:15] [INFO ] Time to serialize gal into /tmp/ReachabilityDeadlock14604271310011730641.gal : 195 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/ReachabilityDeadlock14604271310011730641.gal' '-t' 'CGAL' '-ctl' 'DEADLOCK' '--gen-order' 'FOLLOW'

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...247
No direction supplied, using forward translation only.

BK_TIME_CONFINEMENT_REACHED

--------------------
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="RERS17pb113-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 RERS17pb113-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-165281576900036"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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