fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r330-tall-171662363000201
Last Updated
July 7, 2024

About the Execution of 2023-gold for RERS17pb115-PT-9

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
0.000 1219348.00 0.00 0.00 [undef] Cannot compute

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r330-tall-171662363000201.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is RERS17pb115-PT-9, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r330-tall-171662363000201
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 70M
-rw-r--r-- 1 mcc users 7.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.3K May 19 07:13 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 16:19 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 19 07:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:52 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.2K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 19 07:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 19 15:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 2 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 69M May 18 16:43 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 1716800258902

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=gold2023
BK_EXAMINATION=ReachabilityDeadlock
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=RERS17pb115-PT-9
Not applying reductions.
Model is PT
ReachabilityDeadlock PT
Running Version 202304061127
[2024-05-27 08:57:40] [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]
[2024-05-27 08:57:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 08:57:42] [INFO ] Load time of PNML (sax parser for PT used): 1956 ms
[2024-05-27 08:57:42] [INFO ] Transformed 1399 places.
[2024-05-27 08:57:43] [INFO ] Transformed 144369 transitions.
[2024-05-27 08:57:43] [INFO ] Parsed PT model containing 1399 places and 144369 transitions and 577414 arcs in 2554 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 39 ms.211260KB 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 3914 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 3928 ms. Remains : 1380/1399 places, 144368/144369 transitions.
Interrupted Random walk after 317889 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=10 )
[2024-05-27 08:58:18] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
// Phase 1: matrix 81237 rows 1380 cols
[2024-05-27 08:58:18] [INFO ] Computed 19 invariants in 543 ms
[2024-05-27 08:58:44] [INFO ] [Real]Absence check using 19 positive place invariants in 107 ms returned sat
[2024-05-27 08:58:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 08:59:03] [INFO ] [Real]Absence check using state equation in 19802 ms returned sat
[2024-05-27 08:59:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 08:59:29] [INFO ] [Nat]Absence check using 19 positive place invariants in 110 ms returned sat
[2024-05-27 08:59:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 08:59:48] [INFO ] [Nat]Absence check using state equation in 19614 ms returned sat
[2024-05-27 08:59:50] [INFO ] State equation strengthened by 741 read => feed constraints.
[2024-05-27 08:59:56] [INFO ] [Nat]Added 741 Read/Feed constraints in 5966 ms returned sat
[2024-05-27 09:00:05] [INFO ] Deduced a trap composed of 72 places in 7698 ms of which 6 ms to minimize.
[2024-05-27 09:00:13] [INFO ] Deduced a trap composed of 72 places in 6953 ms of which 1 ms to minimize.
[2024-05-27 09:00:21] [INFO ] Deduced a trap composed of 40 places in 6838 ms of which 1 ms to minimize.
[2024-05-27 09:00:30] [INFO ] Deduced a trap composed of 72 places in 7569 ms of which 12 ms to minimize.
[2024-05-27 09:00:39] [INFO ] Deduced a trap composed of 48 places in 8276 ms of which 1 ms to minimize.
[2024-05-27 09:00:50] [INFO ] Deduced a trap composed of 128 places in 9683 ms of which 2 ms to minimize.
[2024-05-27 09:01:00] [INFO ] Deduced a trap composed of 40 places in 8961 ms of which 2 ms to minimize.
[2024-05-27 09:01:11] [INFO ] Deduced a trap composed of 64 places in 8986 ms of which 1 ms to minimize.
[2024-05-27 09:01:21] [INFO ] Deduced a trap composed of 64 places in 9593 ms of which 2 ms to minimize.
[2024-05-27 09:01:32] [INFO ] Deduced a trap composed of 64 places in 8824 ms of which 2 ms to minimize.
[2024-05-27 09:01:41] [INFO ] Deduced a trap composed of 16 places in 8188 ms of which 1 ms to minimize.
[2024-05-27 09:01:50] [INFO ] Deduced a trap composed of 34 places in 8086 ms of which 2 ms to minimize.
[2024-05-27 09:01:59] [INFO ] Deduced a trap composed of 48 places in 7558 ms of which 1 ms to minimize.
[2024-05-27 09:02:09] [INFO ] Deduced a trap composed of 72 places in 9029 ms of which 3 ms to minimize.
[2024-05-27 09:02:17] [INFO ] Deduced a trap composed of 80 places in 6555 ms of which 1 ms to minimize.
[2024-05-27 09:02:27] [INFO ] Deduced a trap composed of 128 places in 8576 ms of which 1 ms to minimize.
[2024-05-27 09:02:36] [INFO ] Deduced a trap composed of 96 places in 7352 ms of which 1 ms to minimize.
[2024-05-27 09:02:45] [INFO ] Deduced a trap composed of 128 places in 7870 ms of which 3 ms to minimize.
[2024-05-27 09:02:54] [INFO ] Deduced a trap composed of 96 places in 7372 ms of which 1 ms to minimize.
[2024-05-27 09:03:02] [INFO ] Deduced a trap composed of 128 places in 6722 ms of which 1 ms to minimize.
[2024-05-27 09:03:11] [INFO ] Deduced a trap composed of 72 places in 7291 ms of which 0 ms to minimize.
[2024-05-27 09:03:20] [INFO ] Deduced a trap composed of 96 places in 7715 ms of which 1 ms to minimize.
[2024-05-27 09:03:30] [INFO ] Deduced a trap composed of 64 places in 9166 ms of which 0 ms to minimize.
[2024-05-27 09:03:40] [INFO ] Deduced a trap composed of 40 places in 8664 ms of which 1 ms to minimize.
[2024-05-27 09:03:49] [INFO ] Deduced a trap composed of 96 places in 8138 ms of which 1 ms to minimize.
[2024-05-27 09:03:58] [INFO ] Deduced a trap composed of 96 places in 7453 ms of which 0 ms to minimize.
[2024-05-27 09:04:06] [INFO ] Deduced a trap composed of 128 places in 6230 ms of which 0 ms to minimize.
[2024-05-27 09:04:06] [INFO ] Trap strengthening (SAT) tested/added 27/27 trap constraints in 249827 ms
Interrupted Random directed walk after 157022 steps, including 0 resets, run timeout after 30007 ms. (steps per millisecond=5 )
Interrupted Random walk after 269620 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=8 )
Interrupted Random directed walk after 160861 steps, including 0 resets, run timeout after 30002 ms. (steps per millisecond=5 )
Interrupted Random walk after 265437 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=8 )
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 1338 ms. Remains 1380 /1380 variables (removed 0) and now considering 144368/144368 (removed 0) transitions.
[2024-05-27 09:06:07] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
[2024-05-27 09:06:07] [INFO ] Invariant cache hit.
[2024-05-27 09:06:18] [INFO ] Implicit Places using invariants in 10736 ms returned []
Implicit Place search using SMT only with invariants took 10741 ms to find 0 implicit places.
[2024-05-27 09:06:18] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
[2024-05-27 09:06:18] [INFO ] Invariant cache hit.
[2024-05-27 09:06:48] [INFO ] Performed 87323/144368 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2024-05-27 09:07:07] [INFO ] Dead Transitions using invariants and state equation in 49193 ms found 0 transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 61274 ms. Remains : 1380/1380 places, 144368/144368 transitions.
Interrupted Random walk after 271089 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=9 )
[2024-05-27 09:07:37] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
[2024-05-27 09:07:37] [INFO ] Invariant cache hit.
[2024-05-27 09:08:00] [INFO ] [Real]Absence check using 19 positive place invariants in 36 ms returned sat
[2024-05-27 09:08:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 09:08:20] [INFO ] [Real]Absence check using state equation in 19629 ms returned sat
[2024-05-27 09:08:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 09:08:44] [INFO ] [Nat]Absence check using 19 positive place invariants in 50 ms returned sat
[2024-05-27 09:08:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 09:09:04] [INFO ] [Nat]Absence check using state equation in 19511 ms returned sat
[2024-05-27 09:09:04] [INFO ] State equation strengthened by 741 read => feed constraints.
[2024-05-27 09:09:11] [INFO ] [Nat]Added 741 Read/Feed constraints in 6849 ms returned sat
[2024-05-27 09:09:19] [INFO ] Deduced a trap composed of 72 places in 6641 ms of which 1 ms to minimize.
[2024-05-27 09:09:27] [INFO ] Deduced a trap composed of 48 places in 7045 ms of which 1 ms to minimize.
[2024-05-27 09:09:36] [INFO ] Deduced a trap composed of 16 places in 7480 ms of which 1 ms to minimize.
[2024-05-27 09:09:45] [INFO ] Deduced a trap composed of 48 places in 7361 ms of which 1 ms to minimize.
[2024-05-27 09:09:54] [INFO ] Deduced a trap composed of 40 places in 8374 ms of which 1 ms to minimize.
[2024-05-27 09:10:03] [INFO ] Deduced a trap composed of 128 places in 7778 ms of which 0 ms to minimize.
[2024-05-27 09:10:11] [INFO ] Deduced a trap composed of 128 places in 6153 ms of which 0 ms to minimize.
[2024-05-27 09:10:19] [INFO ] Deduced a trap composed of 34 places in 6777 ms of which 6 ms to minimize.
[2024-05-27 09:10:27] [INFO ] Deduced a trap composed of 64 places in 7175 ms of which 1 ms to minimize.
[2024-05-27 09:10:35] [INFO ] Deduced a trap composed of 96 places in 6967 ms of which 1 ms to minimize.
[2024-05-27 09:10:43] [INFO ] Deduced a trap composed of 72 places in 6683 ms of which 1 ms to minimize.
[2024-05-27 09:10:52] [INFO ] Deduced a trap composed of 64 places in 7605 ms of which 1 ms to minimize.
[2024-05-27 09:11:01] [INFO ] Deduced a trap composed of 64 places in 7297 ms of which 1 ms to minimize.
[2024-05-27 09:11:10] [INFO ] Deduced a trap composed of 80 places in 7833 ms of which 1 ms to minimize.
[2024-05-27 09:11:19] [INFO ] Deduced a trap composed of 128 places in 7596 ms of which 1 ms to minimize.
[2024-05-27 09:11:26] [INFO ] Deduced a trap composed of 40 places in 5265 ms of which 1 ms to minimize.
[2024-05-27 09:11:34] [INFO ] Deduced a trap composed of 64 places in 7181 ms of which 1 ms to minimize.
[2024-05-27 09:11:42] [INFO ] Deduced a trap composed of 72 places in 7006 ms of which 4 ms to minimize.
[2024-05-27 09:11:52] [INFO ] Deduced a trap composed of 96 places in 8822 ms of which 2 ms to minimize.
[2024-05-27 09:12:03] [INFO ] Deduced a trap composed of 96 places in 8970 ms of which 1 ms to minimize.
[2024-05-27 09:12:11] [INFO ] Deduced a trap composed of 128 places in 6763 ms of which 1 ms to minimize.
[2024-05-27 09:12:19] [INFO ] Deduced a trap composed of 40 places in 7143 ms of which 0 ms to minimize.
[2024-05-27 09:12:29] [INFO ] Deduced a trap composed of 72 places in 8173 ms of which 1 ms to minimize.
[2024-05-27 09:12:38] [INFO ] Deduced a trap composed of 128 places in 7544 ms of which 3 ms to minimize.
[2024-05-27 09:12:46] [INFO ] Deduced a trap composed of 64 places in 7043 ms of which 2 ms to minimize.
[2024-05-27 09:12:54] [INFO ] Deduced a trap composed of 128 places in 6576 ms of which 1 ms to minimize.
[2024-05-27 09:13:03] [INFO ] Deduced a trap composed of 128 places in 7903 ms of which 0 ms to minimize.
[2024-05-27 09:13:12] [INFO ] Deduced a trap composed of 128 places in 8006 ms of which 17 ms to minimize.
[2024-05-27 09:13:20] [INFO ] Deduced a trap composed of 64 places in 6352 ms of which 12 ms to minimize.
[2024-05-27 09:13:27] [INFO ] Deduced a trap composed of 72 places in 6152 ms of which 0 ms to minimize.
[2024-05-27 09:13: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 145138 steps, including 0 resets, run timeout after 30005 ms. (steps per millisecond=4 )
Interrupted Random walk after 246417 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=8 )
Interrupted Random directed walk after 149894 steps, including 0 resets, run timeout after 30002 ms. (steps per millisecond=4 )
Interrupted Random walk after 250744 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=8 )
[2024-05-27 09:15:33] [INFO ] Flatten gal took : 4696 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin9815339969627411880
[2024-05-27 09:15:37] [INFO ] Too many transitions (144369) to apply POR reductions. Disabling POR matrices.
[2024-05-27 09:15:40] [INFO ] Built C files in 3161ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9815339969627411880
Running compilation step : cd /tmp/ltsmin9815339969627411880;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-27 09:15:42] [INFO ] Applying decomposition
[2024-05-27 09:15:46] [INFO ] Flatten gal took : 4147 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph12897564038855457915.txt' '-o' '/tmp/graph12897564038855457915.bin' '-w' '/tmp/graph12897564038855457915.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph12897564038855457915.bin' '-l' '-1' '-v' '-w' '/tmp/graph12897564038855457915.weights' '-q' '0' '-e' '0.001'
[2024-05-27 09:15:54] [INFO ] Decomposing Gal with order
[2024-05-27 09:15:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 09:16:05] [INFO ] Removed a total of 435423 redundant transitions.
[2024-05-27 09:16:07] [INFO ] Flatten gal took : 6740 ms
[2024-05-27 09:16:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 3504 labels/synchronizations in 15322 ms.
[2024-05-27 09:16:28] [INFO ] Time to serialize gal into /tmp/ReachabilityDeadlock3532828666767539983.gal : 441 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.202304061127/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityDeadlock3532828666767539983.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.202304061127/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...234

BK_STOP 1716801478250

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /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-9"
export BK_EXAMINATION="ReachabilityDeadlock"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is RERS17pb115-PT-9, 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 r330-tall-171662363000201"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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