fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r345-tall-167889216700131
Last Updated
May 14, 2023

About the Execution of Smart+red for RERS17pb115-PT-9

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
8713.163 1800000.00 1883822.00 5015.40 [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.r345-tall-167889216700131.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 RERS17pb115-PT-9, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r345-tall-167889216700131
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 70M
-rw-r--r-- 1 mcc users 6.6K Feb 25 13:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Feb 25 13:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Feb 25 13:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 25 13:48 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:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Feb 25 16:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 25 14:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 159K Feb 25 14:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 18K Feb 25 13:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 115K Feb 25 13:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 2 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 69M 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 1679133325304

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=RERS17pb115-PT-9
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-18 09:55:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityDeadlock, -timeout, 180, -rebuildPNML]
[2023-03-18 09:55:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 09:55:28] [INFO ] Load time of PNML (sax parser for PT used): 1789 ms
[2023-03-18 09:55:28] [INFO ] Transformed 1399 places.
[2023-03-18 09:55:29] [INFO ] Transformed 144369 transitions.
[2023-03-18 09:55:29] [INFO ] Parsed PT model containing 1399 places and 144369 transitions and 577414 arcs in 2415 ms.
Parsed 1 properties from file /home/mcc/execution/ReachabilityDeadlock.xml in 2 ms.
Working with output stream class java.io.PrintStream
Built sparse matrix representations for Structural reductions in 44 ms.517521KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 1399/1399 places, 144369/144369 transitions.
Computed a total of 19 stabilizing places and 1 stable transitions
Ensure Unique test removed 18 places
Computed a total of 1 stabilizing places and 1 stable transitions
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 1381 transition count 144369
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 1380 transition count 144368
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 19 rules in 3567 ms. Remains 1380 /1399 variables (removed 19) and now considering 144368/144369 (removed 1) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 3580 ms. Remains : 1380/1399 places, 144368/144369 transitions.
Interrupted Random walk after 338946 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=11 )
[2023-03-18 09:56:04] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
// Phase 1: matrix 81237 rows 1380 cols
[2023-03-18 09:56:04] [INFO ] Computed 19 place invariants in 444 ms
[2023-03-18 09:56:27] [INFO ] [Real]Absence check using 19 positive place invariants in 91 ms returned sat
[2023-03-18 09:56:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 09:56:45] [INFO ] [Real]Absence check using state equation in 18748 ms returned sat
[2023-03-18 09:56:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 09:57:10] [INFO ] [Nat]Absence check using 19 positive place invariants in 107 ms returned sat
[2023-03-18 09:57:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 09:57:29] [INFO ] [Nat]Absence check using state equation in 18723 ms returned sat
[2023-03-18 09:57:30] [INFO ] State equation strengthened by 741 read => feed constraints.
[2023-03-18 09:57:36] [INFO ] [Nat]Added 741 Read/Feed constraints in 5788 ms returned sat
[2023-03-18 09:57:44] [INFO ] Deduced a trap composed of 72 places in 7362 ms of which 5 ms to minimize.
[2023-03-18 09:57:52] [INFO ] Deduced a trap composed of 72 places in 6640 ms of which 1 ms to minimize.
[2023-03-18 09:58:00] [INFO ] Deduced a trap composed of 40 places in 6940 ms of which 2 ms to minimize.
[2023-03-18 09:58:09] [INFO ] Deduced a trap composed of 72 places in 7526 ms of which 2 ms to minimize.
[2023-03-18 09:58:18] [INFO ] Deduced a trap composed of 48 places in 7905 ms of which 2 ms to minimize.
[2023-03-18 09:58:29] [INFO ] Deduced a trap composed of 128 places in 9537 ms of which 1 ms to minimize.
[2023-03-18 09:58:38] [INFO ] Deduced a trap composed of 40 places in 7980 ms of which 2 ms to minimize.
[2023-03-18 09:58:48] [INFO ] Deduced a trap composed of 64 places in 8305 ms of which 2 ms to minimize.
[2023-03-18 09:58:57] [INFO ] Deduced a trap composed of 64 places in 7923 ms of which 1 ms to minimize.
[2023-03-18 09:59:05] [INFO ] Deduced a trap composed of 64 places in 7743 ms of which 1 ms to minimize.
[2023-03-18 09:59:14] [INFO ] Deduced a trap composed of 16 places in 7265 ms of which 1 ms to minimize.
[2023-03-18 09:59:23] [INFO ] Deduced a trap composed of 34 places in 7579 ms of which 1 ms to minimize.
[2023-03-18 09:59:31] [INFO ] Deduced a trap composed of 48 places in 6925 ms of which 0 ms to minimize.
[2023-03-18 09:59:40] [INFO ] Deduced a trap composed of 72 places in 8245 ms of which 1 ms to minimize.
[2023-03-18 09:59:48] [INFO ] Deduced a trap composed of 80 places in 6435 ms of which 0 ms to minimize.
[2023-03-18 09:59:57] [INFO ] Deduced a trap composed of 128 places in 8090 ms of which 1 ms to minimize.
[2023-03-18 10:00:05] [INFO ] Deduced a trap composed of 96 places in 6831 ms of which 0 ms to minimize.
[2023-03-18 10:00:13] [INFO ] Deduced a trap composed of 128 places in 6951 ms of which 1 ms to minimize.
[2023-03-18 10:00:21] [INFO ] Deduced a trap composed of 96 places in 6647 ms of which 1 ms to minimize.
[2023-03-18 10:00:29] [INFO ] Deduced a trap composed of 128 places in 5950 ms of which 1 ms to minimize.
[2023-03-18 10:00:37] [INFO ] Deduced a trap composed of 72 places in 6562 ms of which 1 ms to minimize.
[2023-03-18 10:00:45] [INFO ] Deduced a trap composed of 96 places in 6976 ms of which 1 ms to minimize.
[2023-03-18 10:00:54] [INFO ] Deduced a trap composed of 64 places in 7693 ms of which 1 ms to minimize.
[2023-03-18 10:01:03] [INFO ] Deduced a trap composed of 40 places in 7479 ms of which 0 ms to minimize.
[2023-03-18 10:01:11] [INFO ] Deduced a trap composed of 96 places in 7408 ms of which 1 ms to minimize.
[2023-03-18 10:01:19] [INFO ] Deduced a trap composed of 96 places in 6483 ms of which 3 ms to minimize.
[2023-03-18 10:01:26] [INFO ] Deduced a trap composed of 128 places in 6020 ms of which 1 ms to minimize.
[2023-03-18 10:01:33] [INFO ] Deduced a trap composed of 64 places in 5889 ms of which 1 ms to minimize.
[2023-03-18 10:01:39] [INFO ] Deduced a trap composed of 64 places in 5581 ms of which 1 ms to minimize.
[2023-03-18 10:01:47] [INFO ] Deduced a trap composed of 128 places in 6617 ms of which 0 ms to minimize.
[2023-03-18 10:01:47] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking Deadlocks.
Interrupted Random directed walk after 197216 steps, including 0 resets, run timeout after 30004 ms. (steps per millisecond=6 )
Interrupted Random walk after 356275 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=11 )
Interrupted Random directed walk after 191464 steps, including 0 resets, run timeout after 30003 ms. (steps per millisecond=6 )
Interrupted Random walk after 361585 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=12 )
Starting structural reductions in DEADLOCK mode, iteration 0 : 1380/1380 places, 144368/144368 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 1296 ms. Remains 1380 /1380 variables (removed 0) and now considering 144368/144368 (removed 0) transitions.
[2023-03-18 10:03:49] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
[2023-03-18 10:03:49] [INFO ] Invariant cache hit.
[2023-03-18 10:03:57] [INFO ] Implicit Places using invariants in 8500 ms returned []
Implicit Place search using SMT only with invariants took 8503 ms to find 0 implicit places.
[2023-03-18 10:03:57] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
[2023-03-18 10:03:57] [INFO ] Invariant cache hit.
[2023-03-18 10:04:27] [INFO ] Performed 93934/144368 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-18 10:04:43] [INFO ] Dead Transitions using invariants and state equation in 46429 ms found 0 transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 56230 ms. Remains : 1380/1380 places, 144368/144368 transitions.
Interrupted Random walk after 359257 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=11 )
[2023-03-18 10:05:14] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
[2023-03-18 10:05:14] [INFO ] Invariant cache hit.
[2023-03-18 10:05:37] [INFO ] [Real]Absence check using 19 positive place invariants in 31 ms returned sat
[2023-03-18 10:05:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 10:05:55] [INFO ] [Real]Absence check using state equation in 18679 ms returned sat
[2023-03-18 10:05:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 10:06:19] [INFO ] [Nat]Absence check using 19 positive place invariants in 52 ms returned sat
[2023-03-18 10:06:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 10:06:39] [INFO ] [Nat]Absence check using state equation in 19959 ms returned sat
[2023-03-18 10:06:40] [INFO ] State equation strengthened by 741 read => feed constraints.
[2023-03-18 10:06:46] [INFO ] [Nat]Added 741 Read/Feed constraints in 6184 ms returned sat
[2023-03-18 10:06:53] [INFO ] Deduced a trap composed of 72 places in 6009 ms of which 1 ms to minimize.
[2023-03-18 10:07:01] [INFO ] Deduced a trap composed of 48 places in 6412 ms of which 1 ms to minimize.
[2023-03-18 10:07:09] [INFO ] Deduced a trap composed of 16 places in 6720 ms of which 0 ms to minimize.
[2023-03-18 10:07:16] [INFO ] Deduced a trap composed of 48 places in 6528 ms of which 1 ms to minimize.
[2023-03-18 10:07:25] [INFO ] Deduced a trap composed of 40 places in 7749 ms of which 7 ms to minimize.
[2023-03-18 10:07:34] [INFO ] Deduced a trap composed of 128 places in 7374 ms of which 1 ms to minimize.
[2023-03-18 10:07:41] [INFO ] Deduced a trap composed of 128 places in 5792 ms of which 0 ms to minimize.
[2023-03-18 10:07:48] [INFO ] Deduced a trap composed of 34 places in 6271 ms of which 1 ms to minimize.
[2023-03-18 10:07:55] [INFO ] Deduced a trap composed of 64 places in 6434 ms of which 1 ms to minimize.
[2023-03-18 10:08:03] [INFO ] Deduced a trap composed of 96 places in 6206 ms of which 0 ms to minimize.
[2023-03-18 10:08:10] [INFO ] Deduced a trap composed of 72 places in 6046 ms of which 0 ms to minimize.
[2023-03-18 10:08:18] [INFO ] Deduced a trap composed of 64 places in 6903 ms of which 1 ms to minimize.
[2023-03-18 10:08:25] [INFO ] Deduced a trap composed of 64 places in 6457 ms of which 1 ms to minimize.
[2023-03-18 10:08:33] [INFO ] Deduced a trap composed of 80 places in 7022 ms of which 1 ms to minimize.
[2023-03-18 10:08:41] [INFO ] Deduced a trap composed of 128 places in 6851 ms of which 1 ms to minimize.
[2023-03-18 10:08:48] [INFO ] Deduced a trap composed of 40 places in 4970 ms of which 1 ms to minimize.
[2023-03-18 10:08:55] [INFO ] Deduced a trap composed of 64 places in 6409 ms of which 0 ms to minimize.
[2023-03-18 10:09:03] [INFO ] Deduced a trap composed of 72 places in 6385 ms of which 0 ms to minimize.
[2023-03-18 10:09:11] [INFO ] Deduced a trap composed of 96 places in 7475 ms of which 1 ms to minimize.
[2023-03-18 10:09:20] [INFO ] Deduced a trap composed of 96 places in 7418 ms of which 1 ms to minimize.
[2023-03-18 10:09:27] [INFO ] Deduced a trap composed of 128 places in 6324 ms of which 2 ms to minimize.
[2023-03-18 10:09:35] [INFO ] Deduced a trap composed of 40 places in 6545 ms of which 1 ms to minimize.
[2023-03-18 10:09:43] [INFO ] Deduced a trap composed of 72 places in 6862 ms of which 0 ms to minimize.
[2023-03-18 10:09:50] [INFO ] Deduced a trap composed of 128 places in 6598 ms of which 0 ms to minimize.
[2023-03-18 10:09:58] [INFO ] Deduced a trap composed of 64 places in 6184 ms of which 1 ms to minimize.
[2023-03-18 10:10:05] [INFO ] Deduced a trap composed of 128 places in 5887 ms of which 1 ms to minimize.
[2023-03-18 10:10:12] [INFO ] Deduced a trap composed of 128 places in 6507 ms of which 1 ms to minimize.
[2023-03-18 10:10:20] [INFO ] Deduced a trap composed of 128 places in 6970 ms of which 1 ms to minimize.
[2023-03-18 10:10:27] [INFO ] Deduced a trap composed of 64 places in 5963 ms of which 0 ms to minimize.
[2023-03-18 10:10:34] [INFO ] Deduced a trap composed of 72 places in 5580 ms of which 0 ms to minimize.
[2023-03-18 10:10:41] [INFO ] Deduced a trap composed of 96 places in 6158 ms of which 1 ms to minimize.
[2023-03-18 10:10:49] [INFO ] Deduced a trap composed of 72 places in 6143 ms of which 1 ms to minimize.
[2023-03-18 10:10:57] [INFO ] Deduced a trap composed of 96 places in 6731 ms of which 1 ms to minimize.
[2023-03-18 10:10:57] [INFO ] Trap strengthening (SAT) tested/added 33/33 trap constraints in 250952 ms
Parikh directed walk for 100 steps, including 100 resets, run took 503 ms. (steps per millisecond=0 )
Interrupted Random directed walk after 192403 steps, including 0 resets, run timeout after 30003 ms. (steps per millisecond=6 )
Interrupted Random walk after 349144 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=11 )
Interrupted Random directed walk after 182232 steps, including 0 resets, run timeout after 30002 ms. (steps per millisecond=6 )
Interrupted Random walk after 328688 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=10 )
[2023-03-18 10:13:02] [INFO ] Flatten gal took : 4054 ms
[2023-03-18 10:13:02] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityDeadlock.sr.xml took 1 ms.
[2023-03-18 10:13:03] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1399 places, 144369 transitions and 577414 arcs took 307 ms.
Total runtime 1056265 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running RERS17pb115 (PT), instance 9
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: 1399 places, 144369 transitions, 577414 arcs.
TIME LIMIT: Killed by timeout after 1800 seconds
MemTotal: 16393232 kB
MemFree: 15179596 kB
After kill :
MemTotal: 16393232 kB
MemFree: 15892628 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="RERS17pb115-PT-9"
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 RERS17pb115-PT-9, 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 r345-tall-167889216700131"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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