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-165281606200131.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-COL-06, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r216-oct2-165281606200131
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 304K
-rw-r--r-- 1 mcc users 8.5K Apr 29 11:33 CTLCardinality.txt
-rw-r--r-- 1 mcc users 94K Apr 29 11:33 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Apr 29 11:31 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Apr 29 11:31 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K May 9 08:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 08:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 9 08:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 9 08:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 9 08:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_pt
-rw-r--r-- 1 mcc users 3 May 10 09:34 instance
-rw-r--r-- 1 mcc users 5 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 42K 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 1653217709608

Running Version 0
[2022-05-22 11:08:31] [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:08:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-22 11:08:31] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
[2022-05-22 11:08:31] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-22 11:08:31] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 551 ms
[2022-05-22 11:08:32] [INFO ] Detected 1 constant HL places corresponding to 6 PT places.
[2022-05-22 11:08:32] [INFO ] Imported 20 HL places and 14 HL transitions for a total of 150 PT places and 2029.0 transition bindings in 17 ms.
Parsed 1 properties from file /home/mcc/execution/ReachabilityDeadlock.xml in 1 ms.
Working with output stream class java.io.PrintStream
[2022-05-22 11:08:32] [INFO ] Built PT skeleton of HLPN with 20 places and 14 transitions in 2 ms.
[2022-05-22 11:08:32] [INFO ] Skeletonized HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1000_13888086991185611913.dot
Reduce places removed 3 places and 0 transitions.
Prefix of Interest using HLPN skeleton for deadlock discarded 0 places and 0 transitions.
[2022-05-22 11:08:32] [INFO ] Unfolded HLPN to a Petri net with 150 places and 463 transitions in 34 ms.
[2022-05-22 11:08:32] [INFO ] Unfolded HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1001_359415695290571800.dot
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 12 places and 12 transitions.
Built sparse matrix representations for Structural reductions in 1 ms.12369KB memory used
Starting structural reductions, iteration 0 : 138/138 places, 451/451 transitions.
Applied a total of 0 rules in 52 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:08:32] [INFO ] Flow matrix only has 242 transitions (discarded 209 similar events)
// Phase 1: matrix 242 rows 138 cols
[2022-05-22 11:08:32] [INFO ] Computed 29 place invariants in 65 ms
[2022-05-22 11:08:32] [INFO ] Implicit Places using invariants in 370 ms returned [91, 92, 93, 94, 95, 96]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 393 ms to find 6 implicit places.
[2022-05-22 11:08:32] [INFO ] Redundant transitions in 25 ms returned []
[2022-05-22 11:08:32] [INFO ] Flow matrix only has 242 transitions (discarded 209 similar events)
// Phase 1: matrix 242 rows 132 cols
[2022-05-22 11:08:32] [INFO ] Computed 23 place invariants in 4 ms
[2022-05-22 11:08:32] [INFO ] Dead Transitions using invariants and state equation in 211 ms returned [31, 37, 43, 49, 55, 61, 68, 74, 80, 86, 92, 98, 105, 111, 117, 123, 129, 135, 142, 148, 154, 160, 166, 172, 179, 185, 191, 197, 203, 209, 216, 222, 228, 234, 240, 246]
Found 36 dead transitions using SMT.
Drop transitions removed 36 transitions
Dead transitions reduction (with SMT) removed 36 transitions :[246, 240, 234, 228, 222, 216, 209, 203, 197, 191, 185, 179, 172, 166, 160, 154, 148, 142, 135, 129, 123, 117, 111, 105, 98, 92, 86, 80, 74, 68, 61, 55, 49, 43, 37, 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 1 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 46 ms. Remains 120 /132 variables (removed 12) and now considering 523/415 (removed -108) transitions.
[2022-05-22 11:08:32] [INFO ] Flow matrix only has 350 transitions (discarded 173 similar events)
// Phase 1: matrix 350 rows 120 cols
[2022-05-22 11:08:32] [INFO ] Computed 23 place invariants in 9 ms
[2022-05-22 11:08:33] [INFO ] Implicit Places using invariants in 126 ms returned []
[2022-05-22 11:08:33] [INFO ] Flow matrix only has 350 transitions (discarded 173 similar events)
// Phase 1: matrix 350 rows 120 cols
[2022-05-22 11:08:33] [INFO ] Computed 23 place invariants in 4 ms
[2022-05-22 11:08:33] [INFO ] State equation strengthened by 43 read => feed constraints.
[2022-05-22 11:08:33] [INFO ] Implicit Places using invariants and state equation in 626 ms returned []
Implicit Place search using SMT with State Equation took 754 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 3058 ms (no deadlock found). (steps per millisecond=408 )
Random directed walk for 1250000 steps, including 0 resets, run took 2690 ms (no deadlock found). (steps per millisecond=464 )
[2022-05-22 11:08:39] [INFO ] Flow matrix only has 350 transitions (discarded 173 similar events)
// Phase 1: matrix 350 rows 120 cols
[2022-05-22 11:08:39] [INFO ] Computed 23 place invariants in 3 ms
[2022-05-22 11:08:39] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2022-05-22 11:08:39] [INFO ] [Real]Absence check using 11 positive and 12 generalized place invariants in 48 ms returned sat
[2022-05-22 11:08:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-22 11:08:39] [INFO ] [Real]Absence check using state equation in 76 ms returned sat
[2022-05-22 11:08:39] [INFO ] Solution in real domain found non-integer solution.
[2022-05-22 11:08:40] [INFO ] [Nat]Absence check using 11 positive place invariants in 9 ms returned sat
[2022-05-22 11:08:40] [INFO ] [Nat]Absence check using 11 positive and 12 generalized place invariants in 4 ms returned sat
[2022-05-22 11:08:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-22 11:08:40] [INFO ] [Nat]Absence check using state equation in 112 ms returned sat
[2022-05-22 11:08:40] [INFO ] State equation strengthened by 43 read => feed constraints.
[2022-05-22 11:08:40] [INFO ] [Nat]Added 43 Read/Feed constraints in 97 ms returned sat
[2022-05-22 11:08:40] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 2 ms to minimize.
[2022-05-22 11:08:40] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 5 ms to minimize.
[2022-05-22 11:08:40] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 2 ms to minimize.
[2022-05-22 11:08:40] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 212 ms
[2022-05-22 11:08:40] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 308 transitions) in 40 ms.
[2022-05-22 11:08:41] [INFO ] Added : 36 causal constraints over 8 iterations in 262 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 5 ms.
Parikh directed walk for 136800 steps, including 1000 resets, run took 436 ms. (steps per millisecond=313 )
Random directed walk for 500005 steps, including 0 resets, run took 1101 ms (no deadlock found). (steps per millisecond=454 )
Random walk for 500000 steps, including 0 resets, run took 1177 ms (no deadlock found). (steps per millisecond=424 )
Random directed walk for 500000 steps, including 0 resets, run took 982 ms (no deadlock found). (steps per millisecond=509 )
Random walk for 500000 steps, including 0 resets, run took 1241 ms (no deadlock found). (steps per millisecond=402 )
Starting structural reductions, iteration 0 : 120/120 places, 523/523 transitions.
Applied a total of 0 rules in 19 ms. Remains 120 /120 variables (removed 0) and now considering 523/523 (removed 0) transitions.
[2022-05-22 11:08:46] [INFO ] Flow matrix only has 350 transitions (discarded 173 similar events)
// Phase 1: matrix 350 rows 120 cols
[2022-05-22 11:08:46] [INFO ] Computed 23 place invariants in 2 ms
[2022-05-22 11:08:46] [INFO ] Implicit Places using invariants in 172 ms returned []
[2022-05-22 11:08:46] [INFO ] Flow matrix only has 350 transitions (discarded 173 similar events)
// Phase 1: matrix 350 rows 120 cols
[2022-05-22 11:08:46] [INFO ] Computed 23 place invariants in 8 ms
[2022-05-22 11:08:46] [INFO ] State equation strengthened by 43 read => feed constraints.
[2022-05-22 11:08:46] [INFO ] Implicit Places using invariants and state equation in 526 ms returned []
Implicit Place search using SMT with State Equation took 702 ms to find 0 implicit places.
[2022-05-22 11:08:46] [INFO ] Redundant transitions in 27 ms returned []
[2022-05-22 11:08:46] [INFO ] Flow matrix only has 350 transitions (discarded 173 similar events)
// Phase 1: matrix 350 rows 120 cols
[2022-05-22 11:08:46] [INFO ] Computed 23 place invariants in 3 ms
[2022-05-22 11:08:47] [INFO ] Dead Transitions using invariants and state equation in 217 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 3023 ms (no deadlock found). (steps per millisecond=413 )
Random directed walk for 1250003 steps, including 0 resets, run took 2524 ms (no deadlock found). (steps per millisecond=495 )
[2022-05-22 11:08:52] [INFO ] Flow matrix only has 350 transitions (discarded 173 similar events)
// Phase 1: matrix 350 rows 120 cols
[2022-05-22 11:08:52] [INFO ] Computed 23 place invariants in 8 ms
[2022-05-22 11:08:52] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2022-05-22 11:08:52] [INFO ] [Real]Absence check using 11 positive and 12 generalized place invariants in 61 ms returned sat
[2022-05-22 11:08:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-22 11:08:52] [INFO ] [Real]Absence check using state equation in 103 ms returned sat
[2022-05-22 11:08:52] [INFO ] Solution in real domain found non-integer solution.
[2022-05-22 11:08:52] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2022-05-22 11:08:52] [INFO ] [Nat]Absence check using 11 positive and 12 generalized place invariants in 6 ms returned sat
[2022-05-22 11:08:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-22 11:08:53] [INFO ] [Nat]Absence check using state equation in 140 ms returned sat
[2022-05-22 11:08:53] [INFO ] State equation strengthened by 43 read => feed constraints.
[2022-05-22 11:08:53] [INFO ] [Nat]Added 43 Read/Feed constraints in 86 ms returned sat
[2022-05-22 11:08:53] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 13 ms to minimize.
[2022-05-22 11:08:53] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 0 ms to minimize.
[2022-05-22 11:08:53] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 0 ms to minimize.
[2022-05-22 11:08:53] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 232 ms
[2022-05-22 11:08:53] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 308 transitions) in 58 ms.
[2022-05-22 11:08:53] [INFO ] Added : 36 causal constraints over 8 iterations in 229 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 3 ms.
Parikh directed walk for 136800 steps, including 1000 resets, run took 481 ms. (steps per millisecond=284 )
Random directed walk for 500000 steps, including 0 resets, run took 1050 ms (no deadlock found). (steps per millisecond=476 )
Random walk for 500000 steps, including 0 resets, run took 1187 ms (no deadlock found). (steps per millisecond=421 )
Random directed walk for 500001 steps, including 0 resets, run took 1041 ms (no deadlock found). (steps per millisecond=480 )
Random walk for 500000 steps, including 0 resets, run took 1161 ms (no deadlock found). (steps per millisecond=430 )
[2022-05-22 11:08:58] [INFO ] Flatten gal took : 66 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin13812478342675344928
[2022-05-22 11:08:58] [INFO ] Computing symmetric may disable matrix : 451 transitions.
[2022-05-22 11:08:58] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-22 11:08:58] [INFO ] Applying decomposition
[2022-05-22 11:08:58] [INFO ] Computing symmetric may enable matrix : 451 transitions.
[2022-05-22 11:08:58] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-22 11:08:58] [INFO ] Flatten gal took : 37 ms
[2022-05-22 11:08:58] [INFO ] Computing Do-Not-Accords matrix : 451 transitions.
[2022-05-22 11:08:58] [INFO ] Computation of Completed DNA matrix. took 27 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-22 11:08:58] [INFO ] Built C files in 120ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13812478342675344928
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/ltsmin13812478342675344928]
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/graph5809337943427057279.txt, -o, /tmp/graph5809337943427057279.bin, -w, /tmp/graph5809337943427057279.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/graph5809337943427057279.bin, -l, -1, -v, -w, /tmp/graph5809337943427057279.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-05-22 11:08:58] [INFO ] Decomposing Gal with order
[2022-05-22 11:08:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-22 11:08:59] [INFO ] Removed a total of 472 redundant transitions.
[2022-05-22 11:08:59] [INFO ] Flatten gal took : 137 ms
[2022-05-22 11:08:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 292 labels/synchronizations in 22 ms.
[2022-05-22 11:08:59] [INFO ] Time to serialize gal into /tmp/ReachabilityDeadlock10036292059080153968.gal : 16 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/ReachabilityDeadlock10036292059080153968.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/ReachabilityDeadlock10036292059080153968.gal -t CGAL -ctl DEADLOCK
No direction supplied, using forward translation only.
Compilation finished in 2406 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin13812478342675344928]
Link finished in 51 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/ltsmin13812478342675344928]
LTSmin run took 478686 ms.
FORMULA ReachabilityDeadlock FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.

BK_STOP 1653218220459

--------------------
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-COL-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-COL-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-165281606200131"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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