About the Execution of Smart+red for SafeBus-COL-15
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
1170.008 | 1800000.00 | 1838737.00 | 4951.00 | [undef] | Time out reached |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r377-smll-167891828200141.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool smartxred
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 r377-smll-167891828200141
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 5.9K Feb 26 02:12 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K Feb 26 02:12 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 26 02:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 26 02:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Feb 26 02:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 168K Feb 26 02:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Feb 26 02:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 26 02:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 42K Mar 5 18:23 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
FORMULA_NAME ReachabilityDeadlock
=== Now, execution of the tool begins
BK_START 1679091905942
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=smartxred
BK_EXAMINATION=ReachabilityDeadlock
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=SafeBus-COL-15
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-17 22:25:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityDeadlock, -timeout, 180, -rebuildPNML]
[2023-03-17 22:25:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-17 22:25:09] [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.
[2023-03-17 22:25:10] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-17 22:25:10] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1078 ms
[2023-03-17 22:25:10] [INFO ] Detected 1 constant HL places corresponding to 15 PT places.
[2023-03-17 22:25:10] [INFO ] Imported 20 HL places and 14 HL transitions for a total of 636 PT places and 59206.0 transition bindings in 40 ms.
Parsed 1 properties from file /home/mcc/execution/ReachabilityDeadlock.xml in 3 ms.
Working with output stream class java.io.PrintStream
[2023-03-17 22:25:10] [INFO ] Built PT skeleton of HLPN with 20 places and 14 transitions 68 arcs in 16 ms.
[2023-03-17 22:25:10] [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
[2023-03-17 22:25:11] [INFO ] Unfolded HLPN to a Petri net with 636 places and 4801 transitions 34264 arcs in 297 ms.
[2023-03-17 22:25:11] [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 11 ms.36834KB 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 1971 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 1972 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 1505 ms. Remains 606 /606 variables (removed 0) and now considering 4771/4771 (removed 0) transitions.
[2023-03-17 22:25:14] [INFO ] Flow matrix only has 1412 transitions (discarded 3359 similar events)
// Phase 1: matrix 1412 rows 606 cols
[2023-03-17 22:25:14] [INFO ] Computed 65 place invariants in 109 ms
[2023-03-17 22:25:18] [INFO ] Implicit Places using invariants in 3286 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 3348 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 4 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 1707 ms. Remains 576 /591 variables (removed 15) and now considering 4756/4771 (removed 15) transitions.
[2023-03-17 22:25:19] [INFO ] Flow matrix only has 1397 transitions (discarded 3359 similar events)
// Phase 1: matrix 1397 rows 576 cols
[2023-03-17 22:25:19] [INFO ] Computed 50 place invariants in 48 ms
[2023-03-17 22:25:21] [INFO ] Implicit Places using invariants in 2129 ms returned []
[2023-03-17 22:25:21] [INFO ] Flow matrix only has 1397 transitions (discarded 3359 similar events)
[2023-03-17 22:25:21] [INFO ] Invariant cache hit.
[2023-03-17 22:25:22] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-17 22:25:30] [INFO ] Implicit Places using invariants and state equation in 8392 ms returned []
Implicit Place search using SMT with State Equation took 10534 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 17095 ms. Remains : 576/606 places, 4756/4771 transitions.
Random walk for 1250000 steps, including 0 resets, run took 23401 ms (no deadlock found). (steps per millisecond=53 )
Random directed walk for 1250000 steps, including 0 resets, run took 16166 ms (no deadlock found). (steps per millisecond=77 )
[2023-03-17 22:26:09] [INFO ] Flow matrix only has 1397 transitions (discarded 3359 similar events)
[2023-03-17 22:26:09] [INFO ] Invariant cache hit.
[2023-03-17 22:26:11] [INFO ] [Real]Absence check using 20 positive place invariants in 27 ms returned sat
[2023-03-17 22:26:13] [INFO ] [Real]Absence check using 20 positive and 30 generalized place invariants in 1944 ms returned sat
[2023-03-17 22:26:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 22:26:14] [INFO ] [Real]Absence check using state equation in 1473 ms returned sat
[2023-03-17 22:26:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 22:26:15] [INFO ] [Nat]Absence check using 20 positive place invariants in 35 ms returned sat
[2023-03-17 22:26:15] [INFO ] [Nat]Absence check using 20 positive and 30 generalized place invariants in 91 ms returned sat
[2023-03-17 22:26:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 22:26:18] [INFO ] [Nat]Absence check using state equation in 2081 ms returned sat
[2023-03-17 22:26:18] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-17 22:26:19] [INFO ] [Nat]Added 241 Read/Feed constraints in 1065 ms returned sat
[2023-03-17 22:26:19] [INFO ] Deduced a trap composed of 74 places in 394 ms of which 22 ms to minimize.
[2023-03-17 22:26:20] [INFO ] Deduced a trap composed of 61 places in 379 ms of which 2 ms to minimize.
[2023-03-17 22:26:20] [INFO ] Deduced a trap composed of 61 places in 321 ms of which 2 ms to minimize.
[2023-03-17 22:26:20] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1697 ms
[2023-03-17 22:26:21] [INFO ] Computed and/alt/rep : 30/45/30 causal constraints (skipped 1352 transitions) in 537 ms.
[2023-03-17 22:26:21] [INFO ] Added : 1 causal constraints over 1 iterations in 785 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 17 ms.
Parikh directed walk for 29100 steps, including 1000 resets, run took 766 ms. (steps per millisecond=37 )
Random directed walk for 500003 steps, including 0 resets, run took 5929 ms (no deadlock found). (steps per millisecond=84 )
Random walk for 500000 steps, including 0 resets, run took 8785 ms (no deadlock found). (steps per millisecond=56 )
Random directed walk for 500009 steps, including 0 resets, run took 6625 ms (no deadlock found). (steps per millisecond=75 )
Random walk for 500000 steps, including 0 resets, run took 8925 ms (no deadlock found). (steps per millisecond=56 )
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 1298 ms. Remains 576 /576 variables (removed 0) and now considering 4756/4756 (removed 0) transitions.
[2023-03-17 22:26:54] [INFO ] Flow matrix only has 1397 transitions (discarded 3359 similar events)
[2023-03-17 22:26:54] [INFO ] Invariant cache hit.
[2023-03-17 22:26:56] [INFO ] Implicit Places using invariants in 2080 ms returned []
[2023-03-17 22:26:56] [INFO ] Flow matrix only has 1397 transitions (discarded 3359 similar events)
[2023-03-17 22:26:56] [INFO ] Invariant cache hit.
[2023-03-17 22:26:56] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-17 22:27:06] [INFO ] Implicit Places using invariants and state equation in 10241 ms returned []
Implicit Place search using SMT with State Equation took 12329 ms to find 0 implicit places.
[2023-03-17 22:27:07] [INFO ] Redundant transitions in 607 ms returned []
[2023-03-17 22:27:07] [INFO ] Flow matrix only has 1397 transitions (discarded 3359 similar events)
[2023-03-17 22:27:07] [INFO ] Invariant cache hit.
[2023-03-17 22:27:18] [INFO ] Dead Transitions using invariants and state equation in 11592 ms found 225 transitions.
Found 225 dead transitions using SMT.
Drop transitions removed 225 transitions
Dead transitions reduction (with SMT) removed 225 transitions
Starting structural reductions in DEADLOCK mode, iteration 1 : 576/576 places, 4531/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 1315 ms. Remains 576 /576 variables (removed 0) and now considering 4531/4531 (removed 0) transitions.
[2023-03-17 22:27:20] [INFO ] Redundant transitions in 489 ms returned []
Finished structural reductions in DEADLOCK mode , in 2 iterations and 27669 ms. Remains : 576/576 places, 4531/4756 transitions.
Random walk for 1250000 steps, including 0 resets, run took 21517 ms (no deadlock found). (steps per millisecond=58 )
Random directed walk for 1250002 steps, including 0 resets, run took 15045 ms (no deadlock found). (steps per millisecond=83 )
[2023-03-17 22:27:57] [INFO ] Flow matrix only has 1397 transitions (discarded 3134 similar events)
[2023-03-17 22:27:57] [INFO ] Invariant cache hit.
[2023-03-17 22:27:58] [INFO ] [Real]Absence check using 20 positive place invariants in 27 ms returned sat
[2023-03-17 22:28:00] [INFO ] [Real]Absence check using 20 positive and 30 generalized place invariants in 2080 ms returned sat
[2023-03-17 22:28:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 22:28:01] [INFO ] [Real]Absence check using state equation in 1422 ms returned sat
[2023-03-17 22:28:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 22:28:02] [INFO ] [Nat]Absence check using 20 positive place invariants in 24 ms returned sat
[2023-03-17 22:28:02] [INFO ] [Nat]Absence check using 20 positive and 30 generalized place invariants in 74 ms returned sat
[2023-03-17 22:28:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 22:28:03] [INFO ] [Nat]Absence check using state equation in 1185 ms returned sat
[2023-03-17 22:28:03] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-17 22:28:04] [INFO ] [Nat]Added 241 Read/Feed constraints in 619 ms returned sat
[2023-03-17 22:28:04] [INFO ] Deduced a trap composed of 61 places in 242 ms of which 2 ms to minimize.
[2023-03-17 22:28:05] [INFO ] Deduced a trap composed of 87 places in 218 ms of which 0 ms to minimize.
[2023-03-17 22:28:06] [INFO ] Deduced a trap composed of 74 places in 210 ms of which 1 ms to minimize.
[2023-03-17 22:28:06] [INFO ] Deduced a trap composed of 74 places in 207 ms of which 1 ms to minimize.
[2023-03-17 22:28:06] [INFO ] Deduced a trap composed of 74 places in 209 ms of which 1 ms to minimize.
[2023-03-17 22:28:07] [INFO ] Deduced a trap composed of 74 places in 211 ms of which 1 ms to minimize.
[2023-03-17 22:28:07] [INFO ] Deduced a trap composed of 61 places in 231 ms of which 1 ms to minimize.
[2023-03-17 22:28:08] [INFO ] Deduced a trap composed of 100 places in 212 ms of which 1 ms to minimize.
[2023-03-17 22:28:08] [INFO ] Deduced a trap composed of 87 places in 215 ms of which 1 ms to minimize.
[2023-03-17 22:28:08] [INFO ] Deduced a trap composed of 87 places in 211 ms of which 1 ms to minimize.
[2023-03-17 22:28:09] [INFO ] Deduced a trap composed of 87 places in 205 ms of which 1 ms to minimize.
[2023-03-17 22:28:09] [INFO ] Deduced a trap composed of 74 places in 212 ms of which 1 ms to minimize.
[2023-03-17 22:28:09] [INFO ] Deduced a trap composed of 74 places in 320 ms of which 1 ms to minimize.
[2023-03-17 22:28:10] [INFO ] Deduced a trap composed of 74 places in 208 ms of which 0 ms to minimize.
[2023-03-17 22:28:10] [INFO ] Deduced a trap composed of 61 places in 221 ms of which 0 ms to minimize.
[2023-03-17 22:28:11] [INFO ] Deduced a trap composed of 74 places in 211 ms of which 1 ms to minimize.
[2023-03-17 22:28:11] [INFO ] Deduced a trap composed of 61 places in 253 ms of which 1 ms to minimize.
[2023-03-17 22:28:11] [INFO ] Deduced a trap composed of 61 places in 327 ms of which 0 ms to minimize.
[2023-03-17 22:28:14] [INFO ] Deduced a trap composed of 61 places in 312 ms of which 1 ms to minimize.
[2023-03-17 22:28:15] [INFO ] Deduced a trap composed of 74 places in 215 ms of which 0 ms to minimize.
[2023-03-17 22:28:15] [INFO ] Deduced a trap composed of 61 places in 215 ms of which 0 ms to minimize.
[2023-03-17 22:28:17] [INFO ] Deduced a trap composed of 74 places in 302 ms of which 1 ms to minimize.
[2023-03-17 22:28:18] [INFO ] Deduced a trap composed of 61 places in 297 ms of which 1 ms to minimize.
[2023-03-17 22:28:18] [INFO ] Deduced a trap composed of 61 places in 296 ms of which 1 ms to minimize.
[2023-03-17 22:28:19] [INFO ] Deduced a trap composed of 61 places in 359 ms of which 1 ms to minimize.
[2023-03-17 22:28:19] [INFO ] Deduced a trap composed of 74 places in 274 ms of which 0 ms to minimize.
[2023-03-17 22:28:19] [INFO ] Deduced a trap composed of 61 places in 319 ms of which 0 ms to minimize.
[2023-03-17 22:28:20] [INFO ] Trap strengthening (SAT) tested/added 28/27 trap constraints in 16008 ms
[2023-03-17 22:28:20] [INFO ] Computed and/alt/rep : 30/45/30 causal constraints (skipped 1352 transitions) in 212 ms.
[2023-03-17 22:28:21] [INFO ] Added : 1 causal constraints over 1 iterations in 545 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 23 ms.
Parikh directed walk for 31700 steps, including 1000 resets, run took 802 ms. (steps per millisecond=39 )
Random directed walk for 500001 steps, including 0 resets, run took 6027 ms (no deadlock found). (steps per millisecond=82 )
Random walk for 500000 steps, including 0 resets, run took 8503 ms (no deadlock found). (steps per millisecond=58 )
Random directed walk for 500002 steps, including 0 resets, run took 6163 ms (no deadlock found). (steps per millisecond=81 )
Random walk for 500000 steps, including 0 resets, run took 8860 ms (no deadlock found). (steps per millisecond=56 )
[2023-03-17 22:28:52] [INFO ] Flatten gal took : 785 ms
[2023-03-17 22:28:52] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityDeadlock.sr.xml took 2 ms.
[2023-03-17 22:28:52] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 606 places, 4771 transitions and 34129 arcs took 54 ms.
Total runtime 223197 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running SafeBus (COL), instance 15
Examination ReachabilityDeadlock
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/DeadlockParse.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//rem_exec//smart
PNML FILE: model.pnml
Petri model created: 606 places, 4771 transitions, 34129 arcs.
TIME LIMIT: Killed by timeout after 1800 seconds
MemTotal: 16393216 kB
MemFree: 14989388 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16113168 kB
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityDeadlock -timeout 180 -rebuildPNML
Caught signal 15, terminating.
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="smartxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool smartxred"
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 r377-smll-167891828200141"
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 '
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 ;