fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r216-oct2-165281606300166
Last Updated
Jun 22, 2022

About the Execution of 2021-gold for SafeBus-PT-06

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
5927.571 402290.00 1527300.00 185.50 F normal

Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2022-input.r216-oct2-165281606300166.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/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 SafeBus-PT-06, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r216-oct2-165281606300166
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 896K
-rw-r--r-- 1 mcc users 18K Apr 29 11:33 CTLCardinality.txt
-rw-r--r-- 1 mcc users 129K Apr 29 11:33 CTLCardinality.xml
-rw-r--r-- 1 mcc users 42K Apr 29 11:32 CTLFireability.txt
-rw-r--r-- 1 mcc users 221K Apr 29 11:32 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 7.1K May 9 08:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 39K May 9 08:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 17K May 9 08:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 71K May 9 08:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.6K May 9 08:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.2K May 9 08:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 303K 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 1653217781357

Running Version 0
[2022-05-22 11:09:42] [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-22 11:09:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-22 11:09:42] [INFO ] Load time of PNML (sax parser for PT used): 63 ms
[2022-05-22 11:09:42] [INFO ] Transformed 144 places.
[2022-05-22 11:09:42] [INFO ] Transformed 451 transitions.
[2022-05-22 11:09:42] [INFO ] Parsed PT model containing 144 places and 451 transitions in 98 ms.
Parsed 1 properties from file /home/mcc/execution/ReachabilityDeadlock.xml in 3 ms.
Working with output stream class java.io.PrintStream
Reduce places removed 6 places and 0 transitions.
Built sparse matrix representations for Structural reductions in 4 ms.15303KB memory used
Starting structural reductions, iteration 0 : 138/138 places, 451/451 transitions.
Applied a total of 0 rules in 44 ms. Remains 138 /138 variables (removed 0) and now considering 451/451 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 138/138 places, 451/451 transitions.
Starting structural reductions, iteration 0 : 138/138 places, 451/451 transitions.
Applied a total of 0 rules in 21 ms. Remains 138 /138 variables (removed 0) and now considering 451/451 (removed 0) transitions.
[2022-05-22 11:09:42] [INFO ] Flow matrix only has 242 transitions (discarded 209 similar events)
// Phase 1: matrix 242 rows 138 cols
[2022-05-22 11:09:42] [INFO ] Computed 29 place invariants in 17 ms
[2022-05-22 11:09:43] [INFO ] Implicit Places using invariants in 303 ms returned [114, 115, 116, 117, 118, 119]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 326 ms to find 6 implicit places.
[2022-05-22 11:09:43] [INFO ] Redundant transitions in 20 ms returned []
[2022-05-22 11:09:43] [INFO ] Flow matrix only has 242 transitions (discarded 209 similar events)
// Phase 1: matrix 242 rows 132 cols
[2022-05-22 11:09:43] [INFO ] Computed 23 place invariants in 5 ms
[2022-05-22 11:09:43] [INFO ] Dead Transitions using invariants and state equation in 166 ms returned [31, 38, 45, 52, 59, 66, 67, 74, 81, 88, 95, 102, 103, 110, 117, 124, 131, 138, 139, 146, 153, 160, 167, 174, 175, 182, 189, 196, 203, 210, 211, 218, 225, 232, 239, 246]
Found 36 dead transitions using SMT.
Drop transitions removed 36 transitions
Dead transitions reduction (with SMT) removed 36 transitions :[246, 239, 232, 225, 218, 211, 210, 203, 196, 189, 182, 175, 174, 167, 160, 153, 146, 139, 138, 131, 124, 117, 110, 103, 102, 95, 88, 81, 74, 67, 66, 59, 52, 45, 38, 31]
Starting structural reductions, iteration 1 : 132/138 places, 415/451 transitions.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 132 transition count 409
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 126 transition count 409
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -114
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 120 transition count 523
Applied a total of 24 rules in 38 ms. Remains 120 /132 variables (removed 12) and now considering 523/415 (removed -108) transitions.
[2022-05-22 11:09:43] [INFO ] Flow matrix only has 350 transitions (discarded 173 similar events)
// Phase 1: matrix 350 rows 120 cols
[2022-05-22 11:09:43] [INFO ] Computed 23 place invariants in 5 ms
[2022-05-22 11:09:43] [INFO ] Implicit Places using invariants in 115 ms returned []
[2022-05-22 11:09:43] [INFO ] Flow matrix only has 350 transitions (discarded 173 similar events)
// Phase 1: matrix 350 rows 120 cols
[2022-05-22 11:09:43] [INFO ] Computed 23 place invariants in 4 ms
[2022-05-22 11:09:43] [INFO ] State equation strengthened by 43 read => feed constraints.
[2022-05-22 11:09:44] [INFO ] Implicit Places using invariants and state equation in 527 ms returned []
Implicit Place search using SMT with State Equation took 651 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 120/138 places, 523/451 transitions.
Random walk for 1250000 steps, including 0 resets, run took 3118 ms (no deadlock found). (steps per millisecond=400 )
Random directed walk for 1250000 steps, including 0 resets, run took 2647 ms (no deadlock found). (steps per millisecond=472 )
[2022-05-22 11:09:49] [INFO ] Flow matrix only has 350 transitions (discarded 173 similar events)
// Phase 1: matrix 350 rows 120 cols
[2022-05-22 11:09:49] [INFO ] Computed 23 place invariants in 10 ms
[2022-05-22 11:09:49] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2022-05-22 11:09:50] [INFO ] [Real]Absence check using 8 positive and 15 generalized place invariants in 27 ms returned sat
[2022-05-22 11:09:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-22 11:09:50] [INFO ] [Real]Absence check using state equation in 80 ms returned sat
[2022-05-22 11:09:50] [INFO ] Solution in real domain found non-integer solution.
[2022-05-22 11:09:50] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2022-05-22 11:09:50] [INFO ] [Nat]Absence check using 8 positive and 15 generalized place invariants in 16 ms returned sat
[2022-05-22 11:09:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-22 11:09:50] [INFO ] [Nat]Absence check using state equation in 98 ms returned sat
[2022-05-22 11:09:50] [INFO ] State equation strengthened by 43 read => feed constraints.
[2022-05-22 11:09:50] [INFO ] [Nat]Added 43 Read/Feed constraints in 57 ms returned sat
[2022-05-22 11:09:50] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 2 ms to minimize.
[2022-05-22 11:09:50] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
[2022-05-22 11:09:50] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 1 ms to minimize.
[2022-05-22 11:09:50] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
[2022-05-22 11:09:50] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2022-05-22 11:09:50] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 299 ms
[2022-05-22 11:09:50] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 308 transitions) in 35 ms.
[2022-05-22 11:09:50] [INFO ] Added : 36 causal constraints over 8 iterations in 199 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 4 ms.
Parikh directed walk for 136700 steps, including 1000 resets, run took 392 ms. (steps per millisecond=348 )
Random directed walk for 500000 steps, including 0 resets, run took 966 ms (no deadlock found). (steps per millisecond=517 )
Random walk for 500000 steps, including 0 resets, run took 1245 ms (no deadlock found). (steps per millisecond=401 )
Random directed walk for 500000 steps, including 0 resets, run took 1033 ms (no deadlock found). (steps per millisecond=484 )
Random walk for 500000 steps, including 0 resets, run took 1123 ms (no deadlock found). (steps per millisecond=445 )
Starting structural reductions, iteration 0 : 120/120 places, 523/523 transitions.
Applied a total of 0 rules in 21 ms. Remains 120 /120 variables (removed 0) and now considering 523/523 (removed 0) transitions.
[2022-05-22 11:09:55] [INFO ] Flow matrix only has 350 transitions (discarded 173 similar events)
// Phase 1: matrix 350 rows 120 cols
[2022-05-22 11:09:55] [INFO ] Computed 23 place invariants in 8 ms
[2022-05-22 11:09:55] [INFO ] Implicit Places using invariants in 120 ms returned []
[2022-05-22 11:09:55] [INFO ] Flow matrix only has 350 transitions (discarded 173 similar events)
// Phase 1: matrix 350 rows 120 cols
[2022-05-22 11:09:55] [INFO ] Computed 23 place invariants in 4 ms
[2022-05-22 11:09:55] [INFO ] State equation strengthened by 43 read => feed constraints.
[2022-05-22 11:09:56] [INFO ] Implicit Places using invariants and state equation in 512 ms returned []
Implicit Place search using SMT with State Equation took 645 ms to find 0 implicit places.
[2022-05-22 11:09:56] [INFO ] Redundant transitions in 36 ms returned []
[2022-05-22 11:09:56] [INFO ] Flow matrix only has 350 transitions (discarded 173 similar events)
// Phase 1: matrix 350 rows 120 cols
[2022-05-22 11:09:56] [INFO ] Computed 23 place invariants in 3 ms
[2022-05-22 11:09:56] [INFO ] Dead Transitions using invariants and state equation in 314 ms returned []
Finished structural reductions, in 1 iterations. Remains : 120/120 places, 523/523 transitions.
Random walk for 1250000 steps, including 0 resets, run took 2811 ms (no deadlock found). (steps per millisecond=444 )
Random directed walk for 1250004 steps, including 0 resets, run took 2464 ms (no deadlock found). (steps per millisecond=507 )
[2022-05-22 11:10:01] [INFO ] Flow matrix only has 350 transitions (discarded 173 similar events)
// Phase 1: matrix 350 rows 120 cols
[2022-05-22 11:10:01] [INFO ] Computed 23 place invariants in 5 ms
[2022-05-22 11:10:02] [INFO ] [Real]Absence check using 8 positive place invariants in 1 ms returned sat
[2022-05-22 11:10:02] [INFO ] [Real]Absence check using 8 positive and 15 generalized place invariants in 24 ms returned sat
[2022-05-22 11:10:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-22 11:10:02] [INFO ] [Real]Absence check using state equation in 77 ms returned sat
[2022-05-22 11:10:02] [INFO ] Solution in real domain found non-integer solution.
[2022-05-22 11:10:02] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2022-05-22 11:10:02] [INFO ] [Nat]Absence check using 8 positive and 15 generalized place invariants in 11 ms returned sat
[2022-05-22 11:10:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-22 11:10:02] [INFO ] [Nat]Absence check using state equation in 92 ms returned sat
[2022-05-22 11:10:02] [INFO ] State equation strengthened by 43 read => feed constraints.
[2022-05-22 11:10:02] [INFO ] [Nat]Added 43 Read/Feed constraints in 50 ms returned sat
[2022-05-22 11:10:02] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
[2022-05-22 11:10:02] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
[2022-05-22 11:10:02] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 0 ms to minimize.
[2022-05-22 11:10:02] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 0 ms to minimize.
[2022-05-22 11:10:02] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 0 ms to minimize.
[2022-05-22 11:10:02] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 331 ms
[2022-05-22 11:10:03] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 308 transitions) in 72 ms.
[2022-05-22 11:10:03] [INFO ] Added : 36 causal constraints over 8 iterations in 273 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 3 ms.
Parikh directed walk for 136700 steps, including 1000 resets, run took 374 ms. (steps per millisecond=365 )
Random directed walk for 500000 steps, including 0 resets, run took 948 ms (no deadlock found). (steps per millisecond=527 )
Random walk for 500000 steps, including 0 resets, run took 1119 ms (no deadlock found). (steps per millisecond=446 )
Random directed walk for 500000 steps, including 0 resets, run took 947 ms (no deadlock found). (steps per millisecond=527 )
Random walk for 500000 steps, including 0 resets, run took 1117 ms (no deadlock found). (steps per millisecond=447 )
[2022-05-22 11:10:08] [INFO ] Flatten gal took : 143 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin10563548971981149826
[2022-05-22 11:10:08] [INFO ] Applying decomposition
[2022-05-22 11:10:08] [INFO ] Flatten gal took : 37 ms
[2022-05-22 11:10:08] [INFO ] Computing symmetric may disable matrix : 451 transitions.
[2022-05-22 11:10:08] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-22 11:10:08] [INFO ] Computing symmetric may enable matrix : 451 transitions.
[2022-05-22 11:10:08] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-22 11:10:08] [INFO ] Computing Do-Not-Accords matrix : 451 transitions.
[2022-05-22 11:10:08] [INFO ] Computation of Completed DNA matrix. took 21 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-22 11:10:08] [INFO ] Built C files in 208ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10563548971981149826
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/ltsmin10563548971981149826]
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/graph16362849156092044485.txt, -o, /tmp/graph16362849156092044485.bin, -w, /tmp/graph16362849156092044485.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/graph16362849156092044485.bin, -l, -1, -v, -w, /tmp/graph16362849156092044485.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-05-22 11:10:08] [INFO ] Decomposing Gal with order
[2022-05-22 11:10:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-22 11:10:08] [INFO ] Removed a total of 364 redundant transitions.
[2022-05-22 11:10:09] [INFO ] Flatten gal took : 284 ms
[2022-05-22 11:10:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 193 labels/synchronizations in 16 ms.
[2022-05-22 11:10:09] [INFO ] Time to serialize gal into /tmp/ReachabilityDeadlock17645680977546514181.gal : 55 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/ReachabilityDeadlock17645680977546514181.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/ReachabilityDeadlock17645680977546514181.gal -t CGAL -ctl DEADLOCK
No direction supplied, using forward translation only.
Compilation finished in 3538 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin10563548971981149826]
Link finished in 113 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/ltsmin10563548971981149826]
LTSmin run took 371128 ms.
FORMULA ReachabilityDeadlock FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.

BK_STOP 1653218183647

--------------------
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="SafeBus-PT-06"
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 SafeBus-PT-06, 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 r216-oct2-165281606300166"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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