fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r352-tall-167889221100091
Last Updated
May 14, 2023

About the Execution of 2022-gold for RERS17pb115-PT-1

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16216.976 1569138.00 2178967.00 12919.40 [undef] Cannot compute

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-167889221100091.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-1, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r352-tall-167889221100091
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 70M
-rw-r--r-- 1 mcc users 7.7K Feb 25 13:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Feb 25 13:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Feb 25 13:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 67K Feb 25 13:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 16:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Feb 25 16:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 13:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 139K Feb 25 13:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Feb 25 13:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K 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 1679141654882

Running Version 202205111006
[2023-03-18 12:14:16] [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:14:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 12:14:18] [INFO ] Load time of PNML (sax parser for PT used): 2382 ms
[2023-03-18 12:14:18] [INFO ] Transformed 1399 places.
[2023-03-18 12:14:19] [INFO ] Transformed 144369 transitions.
[2023-03-18 12:14:19] [INFO ] Found NUPN structural information;
[2023-03-18 12:14:19] [INFO ] Parsed PT model containing 1399 places and 144369 transitions in 3014 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 51 ms.482328KB 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 4885 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 320242 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=10 )
[2023-03-18 12:14:55] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
// Phase 1: matrix 81237 rows 1380 cols
[2023-03-18 12:14:55] [INFO ] Computed 19 place invariants in 479 ms
[2023-03-18 12:15:22] [INFO ] [Real]Absence check using 19 positive place invariants in 228 ms returned sat
[2023-03-18 12:15:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 12:15:41] [INFO ] [Real]Absence check using state equation in 19506 ms returned sat
[2023-03-18 12:15:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 12:16:07] [INFO ] [Nat]Absence check using 19 positive place invariants in 51 ms returned sat
[2023-03-18 12:16:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 12:16:26] [INFO ] [Nat]Absence check using state equation in 19764 ms returned sat
[2023-03-18 12:16:27] [INFO ] State equation strengthened by 741 read => feed constraints.
[2023-03-18 12:16:34] [INFO ] [Nat]Added 741 Read/Feed constraints in 6320 ms returned sat
[2023-03-18 12:16:46] [INFO ] Deduced a trap composed of 40 places in 9826 ms of which 11 ms to minimize.
[2023-03-18 12:16:58] [INFO ] Deduced a trap composed of 72 places in 11446 ms of which 3 ms to minimize.
[2023-03-18 12:17:11] [INFO ] Deduced a trap composed of 64 places in 10978 ms of which 3 ms to minimize.
[2023-03-18 12:17:23] [INFO ] Deduced a trap composed of 16 places in 10877 ms of which 3 ms to minimize.
[2023-03-18 12:17:36] [INFO ] Deduced a trap composed of 128 places in 11039 ms of which 2 ms to minimize.
[2023-03-18 12:17:49] [INFO ] Deduced a trap composed of 48 places in 11312 ms of which 2 ms to minimize.
[2023-03-18 12:18:01] [INFO ] Deduced a trap composed of 96 places in 11235 ms of which 2 ms to minimize.
[2023-03-18 12:18:15] [INFO ] Deduced a trap composed of 96 places in 12017 ms of which 2 ms to minimize.
[2023-03-18 12:18:27] [INFO ] Deduced a trap composed of 72 places in 11139 ms of which 12 ms to minimize.
[2023-03-18 12:18:39] [INFO ] Deduced a trap composed of 48 places in 10326 ms of which 2 ms to minimize.
[2023-03-18 12:18:50] [INFO ] Deduced a trap composed of 72 places in 9768 ms of which 2 ms to minimize.
[2023-03-18 12:19:02] [INFO ] Deduced a trap composed of 72 places in 9796 ms of which 1 ms to minimize.
[2023-03-18 12:19:12] [INFO ] Deduced a trap composed of 64 places in 8601 ms of which 1 ms to minimize.
[2023-03-18 12:19:23] [INFO ] Deduced a trap composed of 40 places in 9412 ms of which 2 ms to minimize.
[2023-03-18 12:19:34] [INFO ] Deduced a trap composed of 96 places in 9704 ms of which 1 ms to minimize.
[2023-03-18 12:19:43] [INFO ] Deduced a trap composed of 128 places in 8316 ms of which 1 ms to minimize.
[2023-03-18 12:19:54] [INFO ] Deduced a trap composed of 96 places in 9011 ms of which 1 ms to minimize.
[2023-03-18 12:20:04] [INFO ] Deduced a trap composed of 176 places in 8439 ms of which 1 ms to minimize.
[2023-03-18 12:20:13] [INFO ] Deduced a trap composed of 64 places in 8271 ms of which 1 ms to minimize.
[2023-03-18 12:20:23] [INFO ] Deduced a trap composed of 128 places in 8560 ms of which 1 ms to minimize.
[2023-03-18 12:20:33] [INFO ] Deduced a trap composed of 96 places in 7882 ms of which 1 ms to minimize.
[2023-03-18 12:20:43] [INFO ] Deduced a trap composed of 128 places in 8881 ms of which 2 ms to minimize.
[2023-03-18 12:20:43] [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 204280 steps, including 0 resets, run timeout after 30002 ms. (steps per millisecond=6 )
Interrupted Random walk after 344139 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=11 )
Interrupted Random directed walk after 206818 steps, including 0 resets, run timeout after 30002 ms. (steps per millisecond=6 )
Interrupted Random walk after 295258 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=9 )
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 1981 ms. Remains 1380 /1380 variables (removed 0) and now considering 144368/144368 (removed 0) transitions.
[2023-03-18 12:22:45] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
// Phase 1: matrix 81237 rows 1380 cols
[2023-03-18 12:22:46] [INFO ] Computed 19 place invariants in 371 ms
[2023-03-18 12:22:55] [INFO ] Implicit Places using invariants in 9594 ms returned []
Implicit Place search using SMT only with invariants took 9598 ms to find 0 implicit places.
[2023-03-18 12:22:55] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
// Phase 1: matrix 81237 rows 1380 cols
[2023-03-18 12:22:55] [INFO ] Computed 19 place invariants in 354 ms
[2023-03-18 12:23:25] [INFO ] Performed 84600/144368 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-18 12:23:47] [INFO ] Dead Transitions using invariants and state equation in 51920 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1380/1380 places, 144368/144368 transitions.
Interrupted Random walk after 273453 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=9 )
[2023-03-18 12:24:17] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
// Phase 1: matrix 81237 rows 1380 cols
[2023-03-18 12:24:17] [INFO ] Computed 19 place invariants in 290 ms
[2023-03-18 12:24:43] [INFO ] [Real]Absence check using 19 positive place invariants in 213 ms returned sat
[2023-03-18 12:24:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 12:25:02] [INFO ] [Real]Absence check using state equation in 19237 ms returned sat
[2023-03-18 12:25:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 12:25:28] [INFO ] [Nat]Absence check using 19 positive place invariants in 48 ms returned sat
[2023-03-18 12:25:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 12:25:48] [INFO ] [Nat]Absence check using state equation in 20083 ms returned sat
[2023-03-18 12:25:49] [INFO ] State equation strengthened by 741 read => feed constraints.
[2023-03-18 12:25:55] [INFO ] [Nat]Added 741 Read/Feed constraints in 5929 ms returned sat
[2023-03-18 12:26:07] [INFO ] Deduced a trap composed of 40 places in 9959 ms of which 2 ms to minimize.
[2023-03-18 12:26:18] [INFO ] Deduced a trap composed of 72 places in 10122 ms of which 1 ms to minimize.
[2023-03-18 12:26:30] [INFO ] Deduced a trap composed of 64 places in 9931 ms of which 1 ms to minimize.
[2023-03-18 12:26:41] [INFO ] Deduced a trap composed of 16 places in 9565 ms of which 1 ms to minimize.
[2023-03-18 12:26:52] [INFO ] Deduced a trap composed of 128 places in 9740 ms of which 1 ms to minimize.
[2023-03-18 12:27:03] [INFO ] Deduced a trap composed of 48 places in 10122 ms of which 2 ms to minimize.
[2023-03-18 12:27:15] [INFO ] Deduced a trap composed of 96 places in 10022 ms of which 2 ms to minimize.
[2023-03-18 12:27:27] [INFO ] Deduced a trap composed of 96 places in 10603 ms of which 1 ms to minimize.
[2023-03-18 12:27:39] [INFO ] Deduced a trap composed of 72 places in 10106 ms of which 2 ms to minimize.
[2023-03-18 12:27:50] [INFO ] Deduced a trap composed of 48 places in 9585 ms of which 2 ms to minimize.
[2023-03-18 12:28:00] [INFO ] Deduced a trap composed of 72 places in 9347 ms of which 1 ms to minimize.
[2023-03-18 12:28:11] [INFO ] Deduced a trap composed of 72 places in 9547 ms of which 1 ms to minimize.
[2023-03-18 12:28:21] [INFO ] Deduced a trap composed of 64 places in 8248 ms of which 6 ms to minimize.
[2023-03-18 12:28:31] [INFO ] Deduced a trap composed of 40 places in 8882 ms of which 1 ms to minimize.
[2023-03-18 12:28:42] [INFO ] Deduced a trap composed of 96 places in 9297 ms of which 2 ms to minimize.
[2023-03-18 12:28:51] [INFO ] Deduced a trap composed of 128 places in 7655 ms of which 1 ms to minimize.
[2023-03-18 12:29:02] [INFO ] Deduced a trap composed of 96 places in 9661 ms of which 2 ms to minimize.
[2023-03-18 12:29:13] [INFO ] Deduced a trap composed of 176 places in 9312 ms of which 2 ms to minimize.
[2023-03-18 12:29:24] [INFO ] Deduced a trap composed of 64 places in 9085 ms of which 1 ms to minimize.
[2023-03-18 12:29:33] [INFO ] Deduced a trap composed of 128 places in 8294 ms of which 1 ms to minimize.
[2023-03-18 12:29:44] [INFO ] Deduced a trap composed of 96 places in 8733 ms of which 1 ms to minimize.
[2023-03-18 12:29:55] [INFO ] Deduced a trap composed of 128 places in 10236 ms of which 1 ms to minimize.
[2023-03-18 12:30:04] [INFO ] Deduced a trap composed of 80 places in 7119 ms of which 1 ms to minimize.
[2023-03-18 12:30:04] [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 208016 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=6 )
Interrupted Random walk after 352531 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=11 )
Interrupted Random directed walk after 173110 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=5 )
Interrupted Random walk after 291239 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=9 )
[2023-03-18 12:32:09] [INFO ] Flatten gal took : 4428 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin14526407684652600394
[2023-03-18 12:32:12] [INFO ] Too many transitions (144369) to apply POR reductions. Disabling POR matrices.
[2023-03-18 12:32:14] [INFO ] Built C files in 1516ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14526407684652600394
Running compilation step : cd /tmp/ltsmin14526407684652600394;'/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:32:16] [INFO ] Applying decomposition
[2023-03-18 12:32:20] [INFO ] Flatten gal took : 4623 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/graph1231863332677443460.txt' '-o' '/tmp/graph1231863332677443460.bin' '-w' '/tmp/graph1231863332677443460.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph1231863332677443460.bin' '-l' '-1' '-v' '-w' '/tmp/graph1231863332677443460.weights' '-q' '0' '-e' '0.001'
[2023-03-18 12:32:28] [INFO ] Decomposing Gal with order
[2023-03-18 12:32:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 12:32:42] [INFO ] Removed a total of 435221 redundant transitions.
[2023-03-18 12:32:43] [INFO ] Flatten gal took : 8009 ms
[2023-03-18 12:33:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 3055 labels/synchronizations in 15037 ms.
[2023-03-18 12:33:03] [INFO ] Time to serialize gal into /tmp/ReachabilityDeadlock8570851505174353297.gal : 385 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/ReachabilityDeadlock8570851505174353297.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.
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/ltsmin14526407684652600394;'/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/ltsmin14526407684652600394;'/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 1679143224020

--------------------
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-1"
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-1, 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-167889221100091"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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