Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 8.0K Apr 12 15:35 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K Apr 12 15:35 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Apr 12 15:29 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Apr 12 15:29 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 07:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 07:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 16:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 134K Apr 12 16:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Apr 12 16:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Apr 12 16:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 42K May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME ReachabilityDeadlock

=== Now, execution of the tool begins

BK_START 1716816587236

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityDeadlock
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=SafeBus-COL-15
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-27 13:29:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityDeadlock, -timeout, 180, -rebuildPNML]
[2024-05-27 13:29:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 13:29:48] [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.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-27 13:29:48] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-27 13:29:49] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 599 ms
[2024-05-27 13:29:49] [INFO ] Detected 1 constant HL places corresponding to 15 PT places.
[2024-05-27 13:29:49] [INFO ] Imported 20 HL places and 14 HL transitions for a total of 636 PT places and 59206.0 transition bindings in 39 ms.
Parsed 1 properties from file /home/mcc/execution/ReachabilityDeadlock.xml in 1 ms.
Working with output stream class java.io.PrintStream
[2024-05-27 13:29:49] [INFO ] Built PT skeleton of HLPN with 20 places and 14 transitions 68 arcs in 4 ms.
[2024-05-27 13:29:49] [INFO ] Skeletonized 1 HLPN properties in 0 ms.
Reduce places removed 3 places and 0 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Prefix of Interest using HLPN skeleton for deadlock discarded 0 places and 0 transitions.
Domain [It(15), It(15)] of place AMC breaks symmetries in sort It
[2024-05-27 13:29:49] [INFO ] Unfolded HLPN to a Petri net with 636 places and 4801 transitions 34264 arcs in 111 ms.
[2024-05-27 13:29:49] [INFO ] Unfolded 1 HLPN properties in 0 ms.
Deduced a syphon composed of 15 places in 14 ms
Reduce places removed 30 places and 30 transitions.
Built sparse matrix representations for Structural reductions in 4 ms.22967KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 606/606 places, 4771/4771 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 1266 ms. Remains 606 /606 variables (removed 0) and now considering 4771/4771 (removed 0) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 1277 ms. Remains : 606/606 places, 4771/4771 transitions.
Starting structural reductions in DEADLOCK mode, iteration 0 : 606/606 places, 4771/4771 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 1033 ms. Remains 606 /606 variables (removed 0) and now considering 4771/4771 (removed 0) transitions.
[2024-05-27 13:29:51] [INFO ] Flow matrix only has 1412 transitions (discarded 3359 similar events)
// Phase 1: matrix 1412 rows 606 cols
[2024-05-27 13:29:51] [INFO ] Computed 65 invariants in 72 ms
[2024-05-27 13:29:53] [INFO ] Implicit Places using invariants in 1545 ms returned [496, 497, 498, 499, 500, 501, 502, 503, 504, 505, 506, 507, 508, 509, 510]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 1583 ms to find 15 implicit places.
Starting structural reductions in DEADLOCK mode, iteration 1 : 591/606 places, 4771/4771 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 15 Pre rules applied. Total rules applied 0 place count 591 transition count 4756
Deduced a syphon composed of 15 places in 3 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 0 with 30 rules applied. Total rules applied 30 place count 576 transition count 4756
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 30 rules in 1102 ms. Remains 576 /591 variables (removed 15) and now considering 4756/4771 (removed 15) transitions.
[2024-05-27 13:29:54] [INFO ] Flow matrix only has 1397 transitions (discarded 3359 similar events)
// Phase 1: matrix 1397 rows 576 cols
[2024-05-27 13:29:54] [INFO ] Computed 50 invariants in 35 ms
[2024-05-27 13:29:55] [INFO ] Implicit Places using invariants in 1141 ms returned []
[2024-05-27 13:29:55] [INFO ] Flow matrix only has 1397 transitions (discarded 3359 similar events)
[2024-05-27 13:29:55] [INFO ] Invariant cache hit.
[2024-05-27 13:29:55] [INFO ] State equation strengthened by 241 read => feed constraints.
[2024-05-27 13:30:01] [INFO ] Implicit Places using invariants and state equation in 6335 ms returned []
Implicit Place search using SMT with State Equation took 7480 ms to find 0 implicit places.
Starting structural reductions in DEADLOCK mode, iteration 2 : 576/606 places, 4756/4771 transitions.
Finished structural reductions in DEADLOCK mode , in 2 iterations and 11202 ms. Remains : 576/606 places, 4756/4771 transitions.
Random walk for 1250000 steps, including 0 resets, run took 15850 ms (no deadlock found). (steps per millisecond=78 )
Random directed walk for 1250003 steps, including 0 resets, run took 11369 ms (no deadlock found). (steps per millisecond=109 )
[2024-05-27 13:30:28] [INFO ] Flow matrix only has 1397 transitions (discarded 3359 similar events)
[2024-05-27 13:30:28] [INFO ] Invariant cache hit.
[2024-05-27 13:30:29] [INFO ] [Real]Absence check using 20 positive place invariants in 20 ms returned sat
[2024-05-27 13:30:31] [INFO ] [Real]Absence check using 20 positive and 30 generalized place invariants in 1355 ms returned sat
[2024-05-27 13:30:32] [INFO ] [Real]Absence check using state equation in 1078 ms returned sat
[2024-05-27 13:30:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 13:30:32] [INFO ] [Nat]Absence check using 20 positive place invariants in 34 ms returned sat
[2024-05-27 13:30:32] [INFO ] [Nat]Absence check using 20 positive and 30 generalized place invariants in 86 ms returned sat
[2024-05-27 13:30:33] [INFO ] [Nat]Absence check using state equation in 1039 ms returned sat
[2024-05-27 13:30:34] [INFO ] State equation strengthened by 241 read => feed constraints.
[2024-05-27 13:30:34] [INFO ] [Nat]Added 241 Read/Feed constraints in 578 ms returned sat
[2024-05-27 13:30:34] [INFO ] Deduced a trap composed of 61 places in 225 ms of which 18 ms to minimize.
[2024-05-27 13:30:38] [INFO ] Deduced a trap composed of 61 places in 169 ms of which 2 ms to minimize.
[2024-05-27 13:30:38] [INFO ] Deduced a trap composed of 74 places in 144 ms of which 2 ms to minimize.
[2024-05-27 13:30:39] [INFO ] Deduced a trap composed of 61 places in 139 ms of which 2 ms to minimize.
[2024-05-27 13:30:39] [INFO ] Deduced a trap composed of 61 places in 147 ms of which 3 ms to minimize.
[2024-05-27 13:30:39] [INFO ] Deduced a trap composed of 74 places in 142 ms of which 2 ms to minimize.
[2024-05-27 13:30:39] [INFO ] Deduced a trap composed of 61 places in 142 ms of which 2 ms to minimize.
[2024-05-27 13:30:40] [INFO ] Deduced a trap composed of 74 places in 140 ms of which 2 ms to minimize.
[2024-05-27 13:30:40] [INFO ] Deduced a trap composed of 61 places in 145 ms of which 2 ms to minimize.
[2024-05-27 13:30:40] [INFO ] Deduced a trap composed of 87 places in 146 ms of which 2 ms to minimize.
[2024-05-27 13:30:40] [INFO ] Deduced a trap composed of 74 places in 142 ms of which 2 ms to minimize.
[2024-05-27 13:30:40] [INFO ] Deduced a trap composed of 74 places in 146 ms of which 2 ms to minimize.
[2024-05-27 13:30:41] [INFO ] Deduced a trap composed of 61 places in 137 ms of which 1 ms to minimize.
[2024-05-27 13:30:42] [INFO ] Deduced a trap composed of 61 places in 134 ms of which 2 ms to minimize.
[2024-05-27 13:30:42] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 7972 ms
[2024-05-27 13:30:42] [INFO ] Computed and/alt/rep : 30/45/30 causal constraints (skipped 1352 transitions) in 231 ms.
[2024-05-27 13:30:43] [INFO ] Added : 2 causal constraints over 2 iterations in 486 ms. Result :sat
Parikh directed walk for 48800 steps, including 1000 resets, run took 716 ms. (steps per millisecond=68 )
Random directed walk for 500010 steps, including 0 resets, run took 4566 ms (no deadlock found). (steps per millisecond=109 )
Random walk for 500000 steps, including 0 resets, run took 6213 ms (no deadlock found). (steps per millisecond=80 )
Random directed walk for 500012 steps, including 0 resets, run took 4524 ms (no deadlock found). (steps per millisecond=110 )
Random walk for 500000 steps, including 0 resets, run took 6237 ms (no deadlock found). (steps per millisecond=80 )
Starting structural reductions in DEADLOCK mode, iteration 0 : 576/576 places, 4756/4756 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 942 ms. Remains 576 /576 variables (removed 0) and now considering 4756/4756 (removed 0) transitions.
[2024-05-27 13:31:06] [INFO ] Flow matrix only has 1397 transitions (discarded 3359 similar events)
[2024-05-27 13:31:06] [INFO ] Invariant cache hit.
[2024-05-27 13:31:07] [INFO ] Implicit Places using invariants in 1134 ms returned []
[2024-05-27 13:31:07] [INFO ] Flow matrix only has 1397 transitions (discarded 3359 similar events)
[2024-05-27 13:31:07] [INFO ] Invariant cache hit.
[2024-05-27 13:31:07] [INFO ] State equation strengthened by 241 read => feed constraints.
[2024-05-27 13:31:13] [INFO ] Implicit Places using invariants and state equation in 6500 ms returned []
Implicit Place search using SMT with State Equation took 7636 ms to find 0 implicit places.
[2024-05-27 13:31:14] [INFO ] Redundant transitions in 372 ms returned []
Running 4741 sub problems to find dead transitions.
[2024-05-27 13:31:14] [INFO ] Flow matrix only has 1397 transitions (discarded 3359 similar events)
[2024-05-27 13:31:14] [INFO ] Invariant cache hit.
[2024-05-27 13:31:14] [INFO ] State equation strengthened by 241 read => feed constraints.
Problem TDEAD211 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD661 is UNSAT
Problem TDEAD886 is UNSAT
Problem TDEAD1111 is UNSAT
Problem TDEAD1336 is UNSAT
Problem TDEAD1561 is UNSAT
Problem TDEAD1786 is UNSAT
Problem TDEAD2011 is UNSAT
Problem TDEAD2236 is UNSAT
Problem TDEAD2461 is UNSAT
Problem TDEAD2686 is UNSAT
Problem TDEAD2911 is UNSAT
Problem TDEAD3136 is UNSAT
Problem TDEAD3361 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/576 variables, 20/20 constraints. Problems are: Problem set: 15 solved, 4726 unsolved
SMT process timed out in 57328ms, After SMT, problems are : Problem set: 15 solved, 4726 unsolved
Search for dead transitions found 15 dead transitions in 57396ms
Found 15 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 15 transitions
Dead transitions reduction (with SMT) removed 15 transitions
Starting structural reductions in DEADLOCK mode, iteration 1 : 576/576 places, 4741/4756 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 946 ms. Remains 576 /576 variables (removed 0) and now considering 4741/4741 (removed 0) transitions.
[2024-05-27 13:32:13] [INFO ] Redundant transitions in 322 ms returned []
Finished structural reductions in DEADLOCK mode , in 2 iterations and 67655 ms. Remains : 576/576 places, 4741/4756 transitions.
Random walk for 1250000 steps, including 0 resets, run took 15766 ms (no deadlock found). (steps per millisecond=79 )
Random directed walk for 1250000 steps, including 0 resets, run took 11253 ms (no deadlock found). (steps per millisecond=111 )
[2024-05-27 13:32:40] [INFO ] Flow matrix only has 1397 transitions (discarded 3344 similar events)
[2024-05-27 13:32:40] [INFO ] Invariant cache hit.
[2024-05-27 13:32:40] [INFO ] [Real]Absence check using 20 positive place invariants in 19 ms returned sat
[2024-05-27 13:32:41] [INFO ] [Real]Absence check using 20 positive and 30 generalized place invariants in 898 ms returned sat
[2024-05-27 13:32:42] [INFO ] [Real]Absence check using state equation in 954 ms returned sat
[2024-05-27 13:32:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 13:32:43] [INFO ] [Nat]Absence check using 20 positive place invariants in 31 ms returned sat
[2024-05-27 13:32:43] [INFO ] [Nat]Absence check using 20 positive and 30 generalized place invariants in 319 ms returned sat
[2024-05-27 13:32:44] [INFO ] [Nat]Absence check using state equation in 1117 ms returned sat
[2024-05-27 13:32:44] [INFO ] State equation strengthened by 241 read => feed constraints.
[2024-05-27 13:32:45] [INFO ] [Nat]Added 241 Read/Feed constraints in 349 ms returned sat
[2024-05-27 13:32:45] [INFO ] Deduced a trap composed of 74 places in 148 ms of which 2 ms to minimize.
[2024-05-27 13:32:45] [INFO ] Deduced a trap composed of 61 places in 141 ms of which 2 ms to minimize.
[2024-05-27 13:32:45] [INFO ] Deduced a trap composed of 61 places in 141 ms of which 2 ms to minimize.
[2024-05-27 13:32:46] [INFO ] Deduced a trap composed of 75 places in 142 ms of which 2 ms to minimize.
[2024-05-27 13:32:46] [INFO ] Deduced a trap composed of 62 places in 152 ms of which 2 ms to minimize.
[2024-05-27 13:32:46] [INFO ] Deduced a trap composed of 62 places in 143 ms of which 2 ms to minimize.
[2024-05-27 13:32:46] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1468 ms
[2024-05-27 13:32:46] [INFO ] Computed and/alt/rep : 30/45/30 causal constraints (skipped 1352 transitions) in 186 ms.
[2024-05-27 13:32:46] [INFO ] Added : 1 causal constraints over 1 iterations in 364 ms. Result :sat
Parikh directed walk for 56600 steps, including 1000 resets, run took 801 ms. (steps per millisecond=70 )
Random directed walk for 500002 steps, including 0 resets, run took 4542 ms (no deadlock found). (steps per millisecond=110 )
Random walk for 500000 steps, including 0 resets, run took 6222 ms (no deadlock found). (steps per millisecond=80 )
Random directed walk for 500001 steps, including 0 resets, run took 4548 ms (no deadlock found). (steps per millisecond=109 )
Random walk for 500000 steps, including 0 resets, run took 6161 ms (no deadlock found). (steps per millisecond=81 )
[2024-05-27 13:33:09] [INFO ] Flatten gal took : 460 ms
[2024-05-27 13:33:09] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityDeadlock.sr.xml took 2 ms.
[2024-05-27 13:33:09] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 606 places, 4771 transitions and 34129 arcs took 33 ms.
Total runtime 201476 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running SafeBus-COL-15

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/410/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 606
TRANSITIONS: 4771
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.148s, Sys 0.019s]


SAVING FILE /home/mcc/execution/410/model (.net / .def) ...
EXPORT TIME: [User 0.018s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 676
MODEL NAME: /home/mcc/execution/410/model
606 places, 4771 transitions.

No place bound informations found.
No place bound informations found.
No place bound informations found.
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityDeadlock -timeout 180 -rebuildPNML

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-15"
export BK_EXAMINATION="ReachabilityDeadlock"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is SafeBus-COL-15, 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 r342-tall-171679093200236"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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