Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r234-tall-165286038300416.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2021
Input is ShieldPPPt-PT-040B, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r234-tall-165286038300416
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 956K
-rw-r--r-- 1 mcc users 5.5K Apr 29 13:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 56K Apr 29 13:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K Apr 29 13:43 CTLFireability.txt
-rw-r--r-- 1 mcc users 36K Apr 29 13:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K May 9 08:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 08:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 9 08:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 08:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 08:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:56 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 762K 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 1653035080086

Running Version 0
[2022-05-20 08:24:41] [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-20 08:24:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 08:24:41] [INFO ] Load time of PNML (sax parser for PT used): 309 ms
[2022-05-20 08:24:42] [INFO ] Transformed 3123 places.
[2022-05-20 08:24:42] [INFO ] Transformed 2843 transitions.
[2022-05-20 08:24:42] [INFO ] Found NUPN structural information;
[2022-05-20 08:24:42] [INFO ] Parsed PT model containing 3123 places and 2843 transitions in 492 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 7 ms.25798KB memory used
Starting structural reductions, iteration 0 : 3123/3123 places, 2843/2843 transitions.
Drop transitions removed 763 transitions
Trivial Post-agglo rules discarded 763 transitions
Performed 763 trivial Post agglomeration. Transition count delta: 763
Iterating post reduction 0 with 763 rules applied. Total rules applied 763 place count 3123 transition count 2080
Reduce places removed 763 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 765 rules applied. Total rules applied 1528 place count 2360 transition count 2078
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1529 place count 2359 transition count 2078
Performed 160 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 160 Pre rules applied. Total rules applied 1529 place count 2359 transition count 1918
Deduced a syphon composed of 160 places in 9 ms
Reduce places removed 160 places and 0 transitions.
Iterating global reduction 3 with 320 rules applied. Total rules applied 1849 place count 2199 transition count 1918
Discarding 280 places :
Symmetric choice reduction at 3 with 280 rule applications. Total rules 2129 place count 1919 transition count 1638
Iterating global reduction 3 with 280 rules applied. Total rules applied 2409 place count 1919 transition count 1638
Performed 120 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 120 Pre rules applied. Total rules applied 2409 place count 1919 transition count 1518
Deduced a syphon composed of 120 places in 12 ms
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 3 with 240 rules applied. Total rules applied 2649 place count 1799 transition count 1518
Performed 679 Post agglomeration using F-continuation condition.Transition count delta: 679
Deduced a syphon composed of 679 places in 4 ms
Reduce places removed 679 places and 0 transitions.
Iterating global reduction 3 with 1358 rules applied. Total rules applied 4007 place count 1120 transition count 839
Renaming transitions due to excessive name length > 1024 char.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 3 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 4209 place count 1019 transition count 839
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 18 places in 3 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 4245 place count 1001 transition count 839
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 4246 place count 1000 transition count 838
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 4247 place count 999 transition count 838
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 4247 place count 999 transition count 836
Deduced a syphon composed of 2 places in 15 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 4251 place count 997 transition count 836
Applied a total of 4251 rules in 1147 ms. Remains 997 /3123 variables (removed 2126) and now considering 836/2843 (removed 2007) transitions.
Finished structural reductions, in 1 iterations. Remains : 997/3123 places, 836/2843 transitions.
Random walk for 1250000 steps, including 0 resets, run took 7180 ms (no deadlock found). (steps per millisecond=174 )
Random directed walk for 1250003 steps, including 0 resets, run took 5206 ms (no deadlock found). (steps per millisecond=240 )
// Phase 1: matrix 836 rows 997 cols
[2022-05-20 08:24:55] [INFO ] Computed 440 place invariants in 22 ms
[2022-05-20 08:24:56] [INFO ] [Real]Absence check using 440 positive place invariants in 309 ms returned sat
[2022-05-20 08:24:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 08:24:58] [INFO ] [Real]Absence check using state equation in 1599 ms returned sat
[2022-05-20 08:24:58] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 08:24:58] [INFO ] [Nat]Absence check using 440 positive place invariants in 256 ms returned sat
[2022-05-20 08:24:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 08:25:00] [INFO ] [Nat]Absence check using state equation in 1699 ms returned sat
[2022-05-20 08:25:00] [INFO ] Computed and/alt/rep : 832/1309/832 causal constraints (skipped 0 transitions) in 58 ms.
[2022-05-20 08:25:12] [INFO ] Added : 742 causal constraints over 149 iterations in 12350 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 61 ms.
Parikh directed walk for 444800 steps, including 1004 resets, run took 2770 ms. (steps per millisecond=160 )
Random directed walk for 500001 steps, including 0 resets, run took 2339 ms (no deadlock found). (steps per millisecond=213 )
Random walk for 500000 steps, including 0 resets, run took 2976 ms (no deadlock found). (steps per millisecond=168 )
Random directed walk for 500000 steps, including 0 resets, run took 2328 ms (no deadlock found). (steps per millisecond=214 )
Random walk for 500000 steps, including 0 resets, run took 2990 ms (no deadlock found). (steps per millisecond=167 )
Starting structural reductions, iteration 0 : 997/997 places, 836/836 transitions.
Applied a total of 0 rules in 24 ms. Remains 997 /997 variables (removed 0) and now considering 836/836 (removed 0) transitions.
// Phase 1: matrix 836 rows 997 cols
[2022-05-20 08:25:26] [INFO ] Computed 440 place invariants in 4 ms
[2022-05-20 08:25:27] [INFO ] Implicit Places using invariants in 700 ms returned [980, 984]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 704 ms to find 2 implicit places.
[2022-05-20 08:25:27] [INFO ] Redundant transitions in 54 ms returned []
// Phase 1: matrix 836 rows 995 cols
[2022-05-20 08:25:27] [INFO ] Computed 438 place invariants in 6 ms
[2022-05-20 08:25:27] [INFO ] Dead Transitions using invariants and state equation in 480 ms returned []
Starting structural reductions, iteration 1 : 995/997 places, 836/836 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 993 transition count 834
Applied a total of 4 rules in 38 ms. Remains 993 /995 variables (removed 2) and now considering 834/836 (removed 2) transitions.
// Phase 1: matrix 834 rows 993 cols
[2022-05-20 08:25:27] [INFO ] Computed 438 place invariants in 7 ms
[2022-05-20 08:25:28] [INFO ] Implicit Places using invariants in 529 ms returned []
// Phase 1: matrix 834 rows 993 cols
[2022-05-20 08:25:28] [INFO ] Computed 438 place invariants in 11 ms
[2022-05-20 08:25:29] [INFO ] Implicit Places using invariants and state equation in 856 ms returned []
Implicit Place search using SMT with State Equation took 1386 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 993/997 places, 834/836 transitions.
Random walk for 1250000 steps, including 0 resets, run took 7138 ms (no deadlock found). (steps per millisecond=175 )
Random directed walk for 1250003 steps, including 0 resets, run took 5608 ms (no deadlock found). (steps per millisecond=222 )
// Phase 1: matrix 834 rows 993 cols
[2022-05-20 08:25:41] [INFO ] Computed 438 place invariants in 9 ms
[2022-05-20 08:25:42] [INFO ] [Real]Absence check using 438 positive place invariants in 228 ms returned sat
[2022-05-20 08:25:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 08:25:43] [INFO ] [Real]Absence check using state equation in 1622 ms returned sat
[2022-05-20 08:25:43] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 08:25:44] [INFO ] [Nat]Absence check using 438 positive place invariants in 226 ms returned sat
[2022-05-20 08:25:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 08:25:45] [INFO ] [Nat]Absence check using state equation in 1244 ms returned sat
[2022-05-20 08:25:45] [INFO ] Computed and/alt/rep : 830/1303/830 causal constraints (skipped 0 transitions) in 49 ms.
[2022-05-20 08:25:57] [INFO ] Added : 728 causal constraints over 146 iterations in 12004 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 53 ms.
Parikh directed walk for 504600 steps, including 457 resets, run took 3550 ms. (steps per millisecond=142 )
Random directed walk for 500000 steps, including 0 resets, run took 2179 ms (no deadlock found). (steps per millisecond=229 )
Random walk for 500000 steps, including 0 resets, run took 2823 ms (no deadlock found). (steps per millisecond=177 )
Random directed walk for 500001 steps, including 0 resets, run took 2190 ms (no deadlock found). (steps per millisecond=228 )
Random walk for 500000 steps, including 0 resets, run took 2794 ms (no deadlock found). (steps per millisecond=178 )
[2022-05-20 08:26:11] [INFO ] Flatten gal took : 355 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin16595856837903713746
[2022-05-20 08:26:12] [INFO ] Too many transitions (2843) to apply POR reductions. Disabling POR matrices.
[2022-05-20 08:26:12] [INFO ] Applying decomposition
[2022-05-20 08:26:12] [INFO ] Built C files in 278ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16595856837903713746
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin16595856837903713746]
[2022-05-20 08:26:12] [INFO ] Flatten gal took : 342 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph11126553601940971661.txt, -o, /tmp/graph11126553601940971661.bin, -w, /tmp/graph11126553601940971661.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph11126553601940971661.bin, -l, -1, -v, -w, /tmp/graph11126553601940971661.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-05-20 08:26:13] [INFO ] Decomposing Gal with order
[2022-05-20 08:26:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 08:26:14] [INFO ] Removed a total of 240 redundant transitions.
[2022-05-20 08:26:15] [INFO ] Flatten gal took : 803 ms
[2022-05-20 08:26:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 57 ms.
[2022-05-20 08:26:15] [INFO ] Time to serialize gal into /tmp/ReachabilityDeadlock9955247680389854338.gal : 105 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityDeadlock9955247680389854338.gal, -t, CGAL, -ctl, DEADLOCK], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityDeadlock9955247680389854338.gal -t CGAL -ctl DEADLOCK
No direction supplied, using forward translation only.
Compilation finished in 37080 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin16595856837903713746]
Link finished in 73 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, -d], workingDir=/tmp/ltsmin16595856837903713746]
Detected timeout of ITS tools.
[2022-05-20 08:36:46] [INFO ] Applying decomposition
[2022-05-20 08:36:46] [INFO ] Flatten gal took : 222 ms
[2022-05-20 08:36:46] [INFO ] Decomposing Gal with order
[2022-05-20 08:36:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 08:36:47] [INFO ] Flatten gal took : 350 ms
[2022-05-20 08:36:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 28 ms.
[2022-05-20 08:36:48] [INFO ] Time to serialize gal into /tmp/ReachabilityDeadlock12942265304046896007.gal : 77 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityDeadlock12942265304046896007.gal, -t, CGAL, -ctl, DEADLOCK], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityDeadlock12942265304046896007.gal -t CGAL -ctl DEADLOCK
No direction supplied, using forward translation only.
Detected timeout of ITS tools.
[2022-05-20 08:47:19] [INFO ] Flatten gal took : 237 ms
[2022-05-20 08:47:19] [INFO ] Input system was already deterministic with 2843 transitions.
[2022-05-20 08:47:19] [INFO ] Transformed 3123 places.
[2022-05-20 08:47:19] [INFO ] Transformed 2843 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-05-20 08:47:21] [INFO ] Time to serialize gal into /tmp/ReachabilityDeadlock10921767324715762482.gal : 26 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityDeadlock10921767324715762482.gal, -t, CGAL, -ctl, DEADLOCK, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityDeadlock10921767324715762482.gal -t CGAL -ctl DEADLOCK --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.

BK_TIME_CONFINEMENT_REACHED

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

+ 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
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -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=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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="ShieldPPPt-PT-040B"
export BK_EXAMINATION="ReachabilityDeadlock"
export BK_TOOL="gold2021"
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 gold2021"
echo " Input is ShieldPPPt-PT-040B, 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 r234-tall-165286038300416"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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