Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2022-input.r193-tajo-165281577000131.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2022-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
......................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
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 r193-tajo-165281577000131
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 70M
-rw-r--r-- 1 mcc users 6.7K Apr 30 06:13 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Apr 30 06:13 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Apr 30 06:10 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 30 06:10 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:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 9 08:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 9 08:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 08:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:34 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 9 08:34 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 2 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 69M 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 1653139980196

Running Version 202205111006
[2022-05-21 13:33:01] [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-21 13:33:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-21 13:33:03] [INFO ] Load time of PNML (sax parser for PT used): 2183 ms
[2022-05-21 13:33:03] [INFO ] Transformed 1399 places.
[2022-05-21 13:33:04] [INFO ] Transformed 144369 transitions.
[2022-05-21 13:33:04] [INFO ] Parsed PT model containing 1399 places and 144369 transitions in 2925 ms.
Parsed 1 properties from file /home/mcc/execution/ReachabilityDeadlock.xml in 9 ms.
Working with output stream class java.io.PrintStream
Built sparse matrix representations for Structural reductions in 66 ms.397820KB memory used
Starting structural reductions in DEADLOCKS 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 6915 ms. Remains 1380 /1399 variables (removed 19) and now considering 144368/144369 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 1380/1399 places, 144368/144369 transitions.
Interrupted Random walk after 216469 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=7 )
[2022-05-21 13:33:42] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
// Phase 1: matrix 81237 rows 1380 cols
[2022-05-21 13:33:43] [INFO ] Computed 19 place invariants in 501 ms
[2022-05-21 13:34:05] [INFO ] [Real]Absence check using 19 positive place invariants in 89 ms returned sat
[2022-05-21 13:34:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 13:34:25] [INFO ] [Real]Absence check using state equation in 19539 ms returned sat
[2022-05-21 13:34:26] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 13:34:48] [INFO ] [Nat]Absence check using 19 positive place invariants in 100 ms returned sat
[2022-05-21 13:34:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 13:35:08] [INFO ] [Nat]Absence check using state equation in 20026 ms returned sat
[2022-05-21 13:35:09] [INFO ] State equation strengthened by 741 read => feed constraints.
[2022-05-21 13:35:14] [INFO ] [Nat]Added 741 Read/Feed constraints in 5203 ms returned sat
[2022-05-21 13:35:25] [INFO ] Deduced a trap composed of 72 places in 9779 ms of which 7 ms to minimize.
[2022-05-21 13:35:35] [INFO ] Deduced a trap composed of 72 places in 7483 ms of which 1 ms to minimize.
[2022-05-21 13:35:43] [INFO ] Deduced a trap composed of 40 places in 7239 ms of which 3 ms to minimize.
[2022-05-21 13:35:53] [INFO ] Deduced a trap composed of 72 places in 8917 ms of which 3 ms to minimize.
[2022-05-21 13:36:05] [INFO ] Deduced a trap composed of 48 places in 9621 ms of which 3 ms to minimize.
[2022-05-21 13:36:17] [INFO ] Deduced a trap composed of 128 places in 11519 ms of which 2 ms to minimize.
[2022-05-21 13:36:27] [INFO ] Deduced a trap composed of 40 places in 8689 ms of which 1 ms to minimize.
[2022-05-21 13:36:39] [INFO ] Deduced a trap composed of 64 places in 9834 ms of which 2 ms to minimize.
[2022-05-21 13:36:50] [INFO ] Deduced a trap composed of 64 places in 10028 ms of which 2 ms to minimize.
[2022-05-21 13:37:00] [INFO ] Deduced a trap composed of 64 places in 8181 ms of which 1 ms to minimize.
[2022-05-21 13:37:11] [INFO ] Deduced a trap composed of 16 places in 9696 ms of which 3 ms to minimize.
[2022-05-21 13:37:22] [INFO ] Deduced a trap composed of 34 places in 8762 ms of which 2 ms to minimize.
[2022-05-21 13:37:31] [INFO ] Deduced a trap composed of 48 places in 8158 ms of which 0 ms to minimize.
[2022-05-21 13:37:43] [INFO ] Deduced a trap composed of 72 places in 10380 ms of which 2 ms to minimize.
[2022-05-21 13:37:52] [INFO ] Deduced a trap composed of 80 places in 7656 ms of which 1 ms to minimize.
[2022-05-21 13:38:03] [INFO ] Deduced a trap composed of 128 places in 9691 ms of which 1 ms to minimize.
[2022-05-21 13:38:14] [INFO ] Deduced a trap composed of 96 places in 9075 ms of which 1 ms to minimize.
[2022-05-21 13:38:23] [INFO ] Deduced a trap composed of 128 places in 8221 ms of which 2 ms to minimize.
[2022-05-21 13:38:33] [INFO ] Deduced a trap composed of 96 places in 7952 ms of which 1 ms to minimize.
[2022-05-21 13:38:42] [INFO ] Deduced a trap composed of 128 places in 7169 ms of which 2 ms to minimize.
[2022-05-21 13:38:51] [INFO ] Deduced a trap composed of 72 places in 7759 ms of which 0 ms to minimize.
[2022-05-21 13:39:01] [INFO ] Deduced a trap composed of 96 places in 7950 ms of which 2 ms to minimize.
[2022-05-21 13:39:11] [INFO ] Deduced a trap composed of 64 places in 9047 ms of which 2 ms to minimize.
[2022-05-21 13:39:22] [INFO ] Deduced a trap composed of 40 places in 9327 ms of which 1 ms to minimize.
[2022-05-21 13:39:33] [INFO ] Deduced a trap composed of 96 places in 9383 ms of which 0 ms to minimize.
[2022-05-21 13:39:33] [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 144940 steps, including 0 resets, run timeout after 30004 ms. (steps per millisecond=4 )
Interrupted Random walk after 269976 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=8 )
Interrupted Random directed walk after 145450 steps, including 0 resets, run timeout after 30006 ms. (steps per millisecond=4 )
Interrupted Random walk after 244685 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=8 )
Starting structural reductions in DEADLOCKS 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 2581 ms. Remains 1380 /1380 variables (removed 0) and now considering 144368/144368 (removed 0) transitions.
[2022-05-21 13:41:35] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
// Phase 1: matrix 81237 rows 1380 cols
[2022-05-21 13:41:36] [INFO ] Computed 19 place invariants in 375 ms
[2022-05-21 13:41:43] [INFO ] Implicit Places using invariants in 8088 ms returned []
Implicit Place search using SMT only with invariants took 8089 ms to find 0 implicit places.
[2022-05-21 13:41:43] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
// Phase 1: matrix 81237 rows 1380 cols
[2022-05-21 13:41:44] [INFO ] Computed 19 place invariants in 376 ms
[2022-05-21 13:42:14] [INFO ] Performed 85553/144368 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2022-05-21 13:42:35] [INFO ] Dead Transitions using invariants and state equation in 51479 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1380/1380 places, 144368/144368 transitions.
Interrupted Random walk after 248295 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=8 )
[2022-05-21 13:43:05] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
// Phase 1: matrix 81237 rows 1380 cols
[2022-05-21 13:43:05] [INFO ] Computed 19 place invariants in 352 ms
[2022-05-21 13:43:24] [INFO ] [Real]Absence check using 19 positive place invariants in 69 ms returned sat
[2022-05-21 13:43:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 13:43:42] [INFO ] [Real]Absence check using state equation in 18001 ms returned sat
[2022-05-21 13:43:44] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 13:44:04] [INFO ] [Nat]Absence check using 19 positive place invariants in 88 ms returned sat
[2022-05-21 13:44:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 13:44:22] [INFO ] [Nat]Absence check using state equation in 18658 ms returned sat
[2022-05-21 13:44:23] [INFO ] State equation strengthened by 741 read => feed constraints.
[2022-05-21 13:44:29] [INFO ] [Nat]Added 741 Read/Feed constraints in 6063 ms returned sat
[2022-05-21 13:44:38] [INFO ] Deduced a trap composed of 72 places in 7612 ms of which 2 ms to minimize.
[2022-05-21 13:44:46] [INFO ] Deduced a trap composed of 72 places in 5965 ms of which 1 ms to minimize.
[2022-05-21 13:44:53] [INFO ] Deduced a trap composed of 40 places in 5830 ms of which 0 ms to minimize.
[2022-05-21 13:45:01] [INFO ] Deduced a trap composed of 72 places in 6843 ms of which 1 ms to minimize.
[2022-05-21 13:45:10] [INFO ] Deduced a trap composed of 48 places in 7031 ms of which 1 ms to minimize.
[2022-05-21 13:45:19] [INFO ] Deduced a trap composed of 128 places in 8598 ms of which 1 ms to minimize.
[2022-05-21 13:45:29] [INFO ] Deduced a trap composed of 40 places in 8051 ms of which 1 ms to minimize.
[2022-05-21 13:45:41] [INFO ] Deduced a trap composed of 64 places in 10417 ms of which 3 ms to minimize.
[2022-05-21 13:45:50] [INFO ] Deduced a trap composed of 64 places in 7751 ms of which 2 ms to minimize.
[2022-05-21 13:45:59] [INFO ] Deduced a trap composed of 64 places in 8332 ms of which 3 ms to minimize.
[2022-05-21 13:46:07] [INFO ] Deduced a trap composed of 16 places in 6465 ms of which 1 ms to minimize.
[2022-05-21 13:46:15] [INFO ] Deduced a trap composed of 34 places in 7115 ms of which 1 ms to minimize.
[2022-05-21 13:46:24] [INFO ] Deduced a trap composed of 48 places in 7608 ms of which 1 ms to minimize.
[2022-05-21 13:46:34] [INFO ] Deduced a trap composed of 72 places in 8321 ms of which 1 ms to minimize.
[2022-05-21 13:46:42] [INFO ] Deduced a trap composed of 80 places in 6723 ms of which 3 ms to minimize.
[2022-05-21 13:46:53] [INFO ] Deduced a trap composed of 128 places in 10179 ms of which 1 ms to minimize.
[2022-05-21 13:47:02] [INFO ] Deduced a trap composed of 96 places in 7624 ms of which 1 ms to minimize.
[2022-05-21 13:47:11] [INFO ] Deduced a trap composed of 128 places in 7517 ms of which 1 ms to minimize.
[2022-05-21 13:47:20] [INFO ] Deduced a trap composed of 96 places in 7538 ms of which 0 ms to minimize.
[2022-05-21 13:47:27] [INFO ] Deduced a trap composed of 128 places in 5944 ms of which 1 ms to minimize.
[2022-05-21 13:47:35] [INFO ] Deduced a trap composed of 72 places in 6601 ms of which 0 ms to minimize.
[2022-05-21 13:47:44] [INFO ] Deduced a trap composed of 96 places in 7843 ms of which 1 ms to minimize.
[2022-05-21 13:47:55] [INFO ] Deduced a trap composed of 64 places in 9653 ms of which 1 ms to minimize.
[2022-05-21 13:48:04] [INFO ] Deduced a trap composed of 40 places in 7965 ms of which 1 ms to minimize.
[2022-05-21 13:48:13] [INFO ] Deduced a trap composed of 96 places in 7730 ms of which 1 ms to minimize.
[2022-05-21 13:48:21] [INFO ] Deduced a trap composed of 96 places in 6485 ms of which 2 ms to minimize.
[2022-05-21 13:48:28] [INFO ] Deduced a trap composed of 128 places in 6410 ms of which 1 ms to minimize.
[2022-05-21 13:48:36] [INFO ] Deduced a trap composed of 64 places in 6028 ms of which 0 ms to minimize.
[2022-05-21 13:48:43] [INFO ] Deduced a trap composed of 64 places in 5903 ms of which 0 ms to minimize.
[2022-05-21 13:48:51] [INFO ] Deduced a trap composed of 128 places in 6973 ms of which 1 ms to minimize.
[2022-05-21 13:48:51] [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 146000 steps, including 0 resets, run timeout after 30004 ms. (steps per millisecond=4 )
Interrupted Random walk after 277046 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=9 )
Interrupted Random directed walk after 150201 steps, including 0 resets, run timeout after 30005 ms. (steps per millisecond=5 )
Interrupted Random walk after 206313 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=6 )
[2022-05-21 13:50:57] [INFO ] Flatten gal took : 4740 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin3831227508050594731
[2022-05-21 13:51:00] [INFO ] Too many transitions (144369) to apply POR reductions. Disabling POR matrices.
[2022-05-21 13:51:02] [INFO ] Built C files in 1945ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3831227508050594731
Running compilation step : cd /tmp/ltsmin3831227508050594731;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-05-21 13:51:04] [INFO ] Applying decomposition
[2022-05-21 13:51:08] [INFO ] Flatten gal took : 3855 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph11850556315916056236.txt' '-o' '/tmp/graph11850556315916056236.bin' '-w' '/tmp/graph11850556315916056236.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph11850556315916056236.bin' '-l' '-1' '-v' '-w' '/tmp/graph11850556315916056236.weights' '-q' '0' '-e' '0.001'
[2022-05-21 13:51:18] [INFO ] Decomposing Gal with order
[2022-05-21 13:51:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-21 13:51:32] [INFO ] Removed a total of 435851 redundant transitions.
[2022-05-21 13:51:34] [INFO ] Flatten gal took : 9388 ms
[2022-05-21 13:51:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 4150 labels/synchronizations in 8247 ms.
[2022-05-21 13:51:47] [INFO ] Time to serialize gal into /tmp/ReachabilityDeadlock9090946969509978416.gal : 522 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityDeadlock9090946969509978416.gal' '-t' 'CGAL' '-ctl' 'DEADLOCK'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/R...225
No direction supplied, using forward translation only.

BK_STOP 1653141415936

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

+ export LANG=C
+ LANG=C
+ 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
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -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=@none -Xss128m -Xms40m -Xmx8192m

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="itstools"
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 itstools"
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 r193-tajo-165281577000131"
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 ;