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.r352-tall-167889221100101.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 gold2022
Input is RERS17pb115-PT-3, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r352-tall-167889221100101
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 70M
-rw-r--r-- 1 mcc users 4.9K Feb 25 13:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 44K Feb 25 13:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Feb 25 13:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K Feb 25 13:46 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K 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 17K Feb 25 16:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 13:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K Feb 25 13:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 13:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K Feb 25 13:54 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 1679142654803

Running Version 202205111006
[2023-03-18 12:30:56] [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]
[2023-03-18 12:30:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 12:30:58] [INFO ] Load time of PNML (sax parser for PT used): 2104 ms
[2023-03-18 12:30:58] [INFO ] Transformed 1399 places.
[2023-03-18 12:30:58] [INFO ] Transformed 144369 transitions.
[2023-03-18 12:30:58] [INFO ] Parsed PT model containing 1399 places and 144369 transitions in 2718 ms.
Parsed 1 properties from file /home/mcc/execution/ReachabilityDeadlock.xml in 7 ms.
Working with output stream class java.io.PrintStream
Built sparse matrix representations for Structural reductions in 37 ms.238458KB 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 4833 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 283247 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=9 )
[2023-03-18 12:31:34] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
// Phase 1: matrix 81237 rows 1380 cols
[2023-03-18 12:31:35] [INFO ] Computed 19 place invariants in 483 ms
[2023-03-18 12:31:59] [INFO ] [Real]Absence check using 19 positive place invariants in 84 ms returned sat
[2023-03-18 12:31:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 12:32:19] [INFO ] [Real]Absence check using state equation in 19468 ms returned sat
[2023-03-18 12:32:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 12:32:44] [INFO ] [Nat]Absence check using 19 positive place invariants in 43 ms returned sat
[2023-03-18 12:32:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 12:33:03] [INFO ] [Nat]Absence check using state equation in 19434 ms returned sat
[2023-03-18 12:33:05] [INFO ] State equation strengthened by 741 read => feed constraints.
[2023-03-18 12:33:10] [INFO ] [Nat]Added 741 Read/Feed constraints in 5740 ms returned sat
[2023-03-18 12:33:20] [INFO ] Deduced a trap composed of 48 places in 8285 ms of which 5 ms to minimize.
[2023-03-18 12:33:31] [INFO ] Deduced a trap composed of 72 places in 9241 ms of which 3 ms to minimize.
[2023-03-18 12:33:42] [INFO ] Deduced a trap composed of 64 places in 9435 ms of which 2 ms to minimize.
[2023-03-18 12:33:53] [INFO ] Deduced a trap composed of 72 places in 9260 ms of which 5 ms to minimize.
[2023-03-18 12:34:04] [INFO ] Deduced a trap composed of 40 places in 9629 ms of which 1 ms to minimize.
[2023-03-18 12:34:16] [INFO ] Deduced a trap composed of 72 places in 10184 ms of which 1 ms to minimize.
[2023-03-18 12:34:27] [INFO ] Deduced a trap composed of 40 places in 9910 ms of which 2 ms to minimize.
[2023-03-18 12:34:37] [INFO ] Deduced a trap composed of 16 places in 7971 ms of which 1 ms to minimize.
[2023-03-18 12:34:47] [INFO ] Deduced a trap composed of 96 places in 8333 ms of which 2 ms to minimize.
[2023-03-18 12:34:55] [INFO ] Deduced a trap composed of 64 places in 7349 ms of which 2 ms to minimize.
[2023-03-18 12:35:06] [INFO ] Deduced a trap composed of 64 places in 8999 ms of which 1 ms to minimize.
[2023-03-18 12:35:17] [INFO ] Deduced a trap composed of 72 places in 9284 ms of which 1 ms to minimize.
[2023-03-18 12:35:28] [INFO ] Deduced a trap composed of 96 places in 9651 ms of which 2 ms to minimize.
[2023-03-18 12:35:38] [INFO ] Deduced a trap composed of 48 places in 8641 ms of which 2 ms to minimize.
[2023-03-18 12:35:48] [INFO ] Deduced a trap composed of 96 places in 7914 ms of which 1 ms to minimize.
[2023-03-18 12:35:57] [INFO ] Deduced a trap composed of 72 places in 7535 ms of which 1 ms to minimize.
[2023-03-18 12:36:06] [INFO ] Deduced a trap composed of 128 places in 7866 ms of which 1 ms to minimize.
[2023-03-18 12:36:16] [INFO ] Deduced a trap composed of 96 places in 7656 ms of which 1 ms to minimize.
[2023-03-18 12:36:25] [INFO ] Deduced a trap composed of 128 places in 7200 ms of which 1 ms to minimize.
[2023-03-18 12:36:33] [INFO ] Deduced a trap composed of 96 places in 7300 ms of which 1 ms to minimize.
[2023-03-18 12:36:43] [INFO ] Deduced a trap composed of 64 places in 7887 ms of which 1 ms to minimize.
[2023-03-18 12:36:52] [INFO ] Deduced a trap composed of 96 places in 7553 ms of which 1 ms to minimize.
[2023-03-18 12:37:01] [INFO ] Deduced a trap composed of 128 places in 7385 ms of which 1 ms to minimize.
[2023-03-18 12:37:09] [INFO ] Deduced a trap composed of 64 places in 6484 ms of which 1 ms to minimize.
[2023-03-18 12:37:17] [INFO ] Deduced a trap composed of 128 places in 6995 ms of which 1 ms to minimize.
[2023-03-18 12:37:27] [INFO ] Deduced a trap composed of 128 places in 8546 ms of which 1 ms to minimize.
[2023-03-18 12:37:27] [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 183905 steps, including 0 resets, run timeout after 30004 ms. (steps per millisecond=6 )
Interrupted Random walk after 336764 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=11 )
Interrupted Random directed walk after 173016 steps, including 0 resets, run timeout after 30002 ms. (steps per millisecond=5 )
Interrupted Random walk after 255044 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=8 )
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 2237 ms. Remains 1380 /1380 variables (removed 0) and now considering 144368/144368 (removed 0) transitions.
[2023-03-18 12:39:30] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
// Phase 1: matrix 81237 rows 1380 cols
[2023-03-18 12:39:30] [INFO ] Computed 19 place invariants in 329 ms
[2023-03-18 12:39:40] [INFO ] Implicit Places using invariants in 9951 ms returned []
Implicit Place search using SMT only with invariants took 9953 ms to find 0 implicit places.
[2023-03-18 12:39:40] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
// Phase 1: matrix 81237 rows 1380 cols
[2023-03-18 12:39:40] [INFO ] Computed 19 place invariants in 339 ms
[2023-03-18 12:40:10] [INFO ] Performed 85908/144368 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-18 12:40:30] [INFO ] Dead Transitions using invariants and state equation in 50675 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1380/1380 places, 144368/144368 transitions.
Interrupted Random walk after 294253 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=9 )
[2023-03-18 12:41:00] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
// Phase 1: matrix 81237 rows 1380 cols
[2023-03-18 12:41:01] [INFO ] Computed 19 place invariants in 370 ms
[2023-03-18 12:41:25] [INFO ] [Real]Absence check using 19 positive place invariants in 83 ms returned sat
[2023-03-18 12:41:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 12:41:45] [INFO ] [Real]Absence check using state equation in 20436 ms returned sat
[2023-03-18 12:41:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 12:42:10] [INFO ] [Nat]Absence check using 19 positive place invariants in 43 ms returned sat
[2023-03-18 12:42:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 12:42:31] [INFO ] [Nat]Absence check using state equation in 20635 ms returned sat
[2023-03-18 12:42:32] [INFO ] State equation strengthened by 741 read => feed constraints.
[2023-03-18 12:42:38] [INFO ] [Nat]Added 741 Read/Feed constraints in 6580 ms returned sat
[2023-03-18 12:42:48] [INFO ] Deduced a trap composed of 48 places in 8509 ms of which 1 ms to minimize.
[2023-03-18 12:42:58] [INFO ] Deduced a trap composed of 72 places in 8671 ms of which 2 ms to minimize.
[2023-03-18 12:43:08] [INFO ] Deduced a trap composed of 64 places in 8181 ms of which 1 ms to minimize.
[2023-03-18 12:43:18] [INFO ] Deduced a trap composed of 72 places in 8205 ms of which 1 ms to minimize.
[2023-03-18 12:43:28] [INFO ] Deduced a trap composed of 40 places in 9247 ms of which 1 ms to minimize.
[2023-03-18 12:43:39] [INFO ] Deduced a trap composed of 72 places in 9025 ms of which 1 ms to minimize.
[2023-03-18 12:43:50] [INFO ] Deduced a trap composed of 40 places in 9073 ms of which 2 ms to minimize.
[2023-03-18 12:43:58] [INFO ] Deduced a trap composed of 16 places in 7083 ms of which 16 ms to minimize.
[2023-03-18 12:44:07] [INFO ] Deduced a trap composed of 96 places in 7566 ms of which 2 ms to minimize.
[2023-03-18 12:44:15] [INFO ] Deduced a trap composed of 64 places in 6979 ms of which 1 ms to minimize.
[2023-03-18 12:44:25] [INFO ] Deduced a trap composed of 64 places in 8595 ms of which 1 ms to minimize.
[2023-03-18 12:44:35] [INFO ] Deduced a trap composed of 72 places in 8541 ms of which 1 ms to minimize.
[2023-03-18 12:44:46] [INFO ] Deduced a trap composed of 96 places in 9106 ms of which 3 ms to minimize.
[2023-03-18 12:44:56] [INFO ] Deduced a trap composed of 48 places in 8763 ms of which 2 ms to minimize.
[2023-03-18 12:45:05] [INFO ] Deduced a trap composed of 96 places in 7341 ms of which 1 ms to minimize.
[2023-03-18 12:45:14] [INFO ] Deduced a trap composed of 72 places in 7248 ms of which 2 ms to minimize.
[2023-03-18 12:45:23] [INFO ] Deduced a trap composed of 128 places in 7576 ms of which 3 ms to minimize.
[2023-03-18 12:45:32] [INFO ] Deduced a trap composed of 96 places in 7502 ms of which 1 ms to minimize.
[2023-03-18 12:45:42] [INFO ] Deduced a trap composed of 128 places in 7677 ms of which 1 ms to minimize.
[2023-03-18 12:45:50] [INFO ] Deduced a trap composed of 96 places in 6988 ms of which 0 ms to minimize.
[2023-03-18 12:45:59] [INFO ] Deduced a trap composed of 64 places in 7633 ms of which 0 ms to minimize.
[2023-03-18 12:46:08] [INFO ] Deduced a trap composed of 96 places in 7680 ms of which 1 ms to minimize.
[2023-03-18 12:46:17] [INFO ] Deduced a trap composed of 128 places in 7560 ms of which 1 ms to minimize.
[2023-03-18 12:46:25] [INFO ] Deduced a trap composed of 64 places in 6540 ms of which 0 ms to minimize.
[2023-03-18 12:46:34] [INFO ] Deduced a trap composed of 128 places in 6976 ms of which 1 ms to minimize.
[2023-03-18 12:46:44] [INFO ] Deduced a trap composed of 128 places in 8317 ms of which 1 ms to minimize.
[2023-03-18 12:46:51] [INFO ] Deduced a trap composed of 34 places in 5877 ms of which 0 ms to minimize.
[2023-03-18 12:46:51] [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 191852 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=6 )
Interrupted Random walk after 360302 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=12 )
Interrupted Random directed walk after 188700 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=6 )
Interrupted Random walk after 369812 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=12 )
[2023-03-18 12:48:56] [INFO ] Flatten gal took : 4507 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin17623454012508924005
[2023-03-18 12:48:59] [INFO ] Too many transitions (144369) to apply POR reductions. Disabling POR matrices.
[2023-03-18 12:49:01] [INFO ] Built C files in 1654ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17623454012508924005
Running compilation step : cd /tmp/ltsmin17623454012508924005;'/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'
[2023-03-18 12:49:02] [INFO ] Applying decomposition
[2023-03-18 12:49:06] [INFO ] Flatten gal took : 4345 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/graph6388196912229649564.txt' '-o' '/tmp/graph6388196912229649564.bin' '-w' '/tmp/graph6388196912229649564.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph6388196912229649564.bin' '-l' '-1' '-v' '-w' '/tmp/graph6388196912229649564.weights' '-q' '0' '-e' '0.001'
[2023-03-18 12:49:15] [INFO ] Decomposing Gal with order
[2023-03-18 12:49:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 12:49:27] [INFO ] Removed a total of 435583 redundant transitions.
[2023-03-18 12:49:29] [INFO ] Flatten gal took : 7729 ms
[2023-03-18 12:49:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 4087 labels/synchronizations in 13289 ms.
[2023-03-18 12:49:48] [INFO ] Time to serialize gal into /tmp/ReachabilityDeadlock16613991819982685327.gal : 334 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/ReachabilityDeadlock16613991819982685327.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/ltsmin17623454012508924005;'/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/ltsmin17623454012508924005;'/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)

BK_STOP 1679144218468

--------------------
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
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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-3"
export BK_EXAMINATION="ReachabilityDeadlock"
export BK_TOOL="gold2022"
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 gold2022"
echo " Input is RERS17pb115-PT-3, 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 r352-tall-167889221100101"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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