Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r294-smll-165463872800366.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is StigmergyElection-PT-09a, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r294-smll-165463872800366
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 17M
-rw-r--r-- 1 mcc users 5.7K May 30 15:07 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K May 30 15:07 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 30 15:00 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K May 30 15:00 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 25 13:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 25 13:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 25 13:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 25 13:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 29 12:20 NewModel
-rw-r--r-- 1 mcc users 8.4K May 30 15:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 86K May 30 15:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 30 15:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 94K May 30 15:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 25 13:05 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 25 13:05 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 12:20 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 12:20 instance
-rw-r--r-- 1 mcc users 6 May 29 12:20 iscolored
-rw-r--r-- 1 mcc users 17M May 29 12:20 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME StigmergyElection-PT-09a-ReachabilityCardinality-00
FORMULA_NAME StigmergyElection-PT-09a-ReachabilityCardinality-01
FORMULA_NAME StigmergyElection-PT-09a-ReachabilityCardinality-02
FORMULA_NAME StigmergyElection-PT-09a-ReachabilityCardinality-03
FORMULA_NAME StigmergyElection-PT-09a-ReachabilityCardinality-04
FORMULA_NAME StigmergyElection-PT-09a-ReachabilityCardinality-05
FORMULA_NAME StigmergyElection-PT-09a-ReachabilityCardinality-06
FORMULA_NAME StigmergyElection-PT-09a-ReachabilityCardinality-07
FORMULA_NAME StigmergyElection-PT-09a-ReachabilityCardinality-08
FORMULA_NAME StigmergyElection-PT-09a-ReachabilityCardinality-09
FORMULA_NAME StigmergyElection-PT-09a-ReachabilityCardinality-10
FORMULA_NAME StigmergyElection-PT-09a-ReachabilityCardinality-11
FORMULA_NAME StigmergyElection-PT-09a-ReachabilityCardinality-12
FORMULA_NAME StigmergyElection-PT-09a-ReachabilityCardinality-13
FORMULA_NAME StigmergyElection-PT-09a-ReachabilityCardinality-14
FORMULA_NAME StigmergyElection-PT-09a-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1654870270858

Running Version 202205111006
[2022-06-10 14:11:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -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, 3600]
[2022-06-10 14:11:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-10 14:11:14] [INFO ] Load time of PNML (sax parser for PT used): 1623 ms
[2022-06-10 14:11:14] [INFO ] Transformed 128 places.
[2022-06-10 14:11:14] [INFO ] Transformed 18490 transitions.
[2022-06-10 14:11:14] [INFO ] Found NUPN structural information;
[2022-06-10 14:11:14] [INFO ] Parsed PT model containing 128 places and 18490 transitions in 1983 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 24 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 17295 transitions
Reduce redundant transitions removed 17295 transitions.
FORMULA StigmergyElection-PT-09a-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-09a-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-09a-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-09a-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 6 resets, run finished after 1349 ms. (steps per millisecond=7 ) properties (out of 12) seen :6
FORMULA StigmergyElection-PT-09a-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-09a-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-09a-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-09a-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-09a-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-09a-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2022-06-10 14:11:16] [INFO ] Flow matrix only has 1168 transitions (discarded 27 similar events)
// Phase 1: matrix 1168 rows 128 cols
[2022-06-10 14:11:16] [INFO ] Computed 10 place invariants in 49 ms
[2022-06-10 14:11:17] [INFO ] After 321ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2022-06-10 14:11:17] [INFO ] [Nat]Absence check using 10 positive place invariants in 9 ms returned sat
[2022-06-10 14:11:18] [INFO ] After 927ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :4
[2022-06-10 14:11:18] [INFO ] State equation strengthened by 1066 read => feed constraints.
[2022-06-10 14:11:19] [INFO ] After 964ms SMT Verify possible using 1066 Read/Feed constraints in natural domain returned unsat :2 sat :4
[2022-06-10 14:11:20] [INFO ] Deduced a trap composed of 12 places in 712 ms of which 14 ms to minimize.
[2022-06-10 14:11:20] [INFO ] Deduced a trap composed of 14 places in 554 ms of which 2 ms to minimize.
[2022-06-10 14:11:21] [INFO ] Deduced a trap composed of 12 places in 652 ms of which 2 ms to minimize.
[2022-06-10 14:11:22] [INFO ] Deduced a trap composed of 12 places in 662 ms of which 2 ms to minimize.
[2022-06-10 14:11:23] [INFO ] Deduced a trap composed of 14 places in 543 ms of which 2 ms to minimize.
[2022-06-10 14:11:23] [INFO ] Deduced a trap composed of 12 places in 397 ms of which 1 ms to minimize.
[2022-06-10 14:11:24] [INFO ] Deduced a trap composed of 13 places in 389 ms of which 1 ms to minimize.
[2022-06-10 14:11:24] [INFO ] Deduced a trap composed of 12 places in 323 ms of which 0 ms to minimize.
[2022-06-10 14:11:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 8 trap constraints in 4902 ms
[2022-06-10 14:11:25] [INFO ] Deduced a trap composed of 13 places in 318 ms of which 1 ms to minimize.
[2022-06-10 14:11:25] [INFO ] Deduced a trap composed of 13 places in 310 ms of which 0 ms to minimize.
[2022-06-10 14:11:26] [INFO ] Deduced a trap composed of 13 places in 416 ms of which 1 ms to minimize.
[2022-06-10 14:11:26] [INFO ] Deduced a trap composed of 13 places in 362 ms of which 2 ms to minimize.
[2022-06-10 14:11:27] [INFO ] Deduced a trap composed of 13 places in 319 ms of which 1 ms to minimize.
[2022-06-10 14:11:27] [INFO ] Deduced a trap composed of 12 places in 233 ms of which 1 ms to minimize.
[2022-06-10 14:11:27] [INFO ] Deduced a trap composed of 13 places in 272 ms of which 1 ms to minimize.
[2022-06-10 14:11:28] [INFO ] Deduced a trap composed of 13 places in 208 ms of which 1 ms to minimize.
[2022-06-10 14:11:28] [INFO ] Deduced a trap composed of 12 places in 214 ms of which 1 ms to minimize.
[2022-06-10 14:11:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 9 trap constraints in 3710 ms
[2022-06-10 14:11:29] [INFO ] Deduced a trap composed of 13 places in 320 ms of which 1 ms to minimize.
[2022-06-10 14:11:29] [INFO ] Deduced a trap composed of 13 places in 257 ms of which 1 ms to minimize.
[2022-06-10 14:11:29] [INFO ] Deduced a trap composed of 12 places in 134 ms of which 1 ms to minimize.
[2022-06-10 14:11:30] [INFO ] Deduced a trap composed of 12 places in 175 ms of which 1 ms to minimize.
[2022-06-10 14:11:30] [INFO ] Deduced a trap composed of 12 places in 161 ms of which 1 ms to minimize.
[2022-06-10 14:11:30] [INFO ] Deduced a trap composed of 12 places in 158 ms of which 0 ms to minimize.
[2022-06-10 14:11:31] [INFO ] Deduced a trap composed of 12 places in 111 ms of which 0 ms to minimize.
[2022-06-10 14:11:31] [INFO ] Deduced a trap composed of 12 places in 157 ms of which 0 ms to minimize.
[2022-06-10 14:11:31] [INFO ] Deduced a trap composed of 12 places in 218 ms of which 0 ms to minimize.
[2022-06-10 14:11:32] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 3279 ms
[2022-06-10 14:11:32] [INFO ] Deduced a trap composed of 12 places in 261 ms of which 1 ms to minimize.
[2022-06-10 14:11:32] [INFO ] Deduced a trap composed of 12 places in 267 ms of which 0 ms to minimize.
[2022-06-10 14:11:33] [INFO ] Deduced a trap composed of 12 places in 220 ms of which 1 ms to minimize.
[2022-06-10 14:11:33] [INFO ] Deduced a trap composed of 12 places in 218 ms of which 1 ms to minimize.
[2022-06-10 14:11:33] [INFO ] Deduced a trap composed of 12 places in 179 ms of which 1 ms to minimize.
[2022-06-10 14:11:34] [INFO ] Deduced a trap composed of 12 places in 181 ms of which 1 ms to minimize.
[2022-06-10 14:11:34] [INFO ] Deduced a trap composed of 12 places in 104 ms of which 0 ms to minimize.
[2022-06-10 14:11:34] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2063 ms
[2022-06-10 14:11:34] [INFO ] After 15915ms SMT Verify possible using trap constraints in natural domain returned unsat :4 sat :2
Attempting to minimize the solution found.
Minimization took 317 ms.
[2022-06-10 14:11:34] [INFO ] After 17430ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :2
FORMULA StigmergyElection-PT-09a-ReachabilityCardinality-09 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyElection-PT-09a-ReachabilityCardinality-03 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyElection-PT-09a-ReachabilityCardinality-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyElection-PT-09a-ReachabilityCardinality-01 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 6 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 493 ms.
Support contains 3 out of 128 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 128/128 places, 1195/1195 transitions.
Graph (complete) has 424 edges and 128 vertex of which 119 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.28 ms
Discarding 9 places :
Also discarding 9 output transitions
Drop transitions removed 9 transitions
Drop transitions removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 44 rules applied. Total rules applied 45 place count 119 transition count 1142
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 40 rules applied. Total rules applied 85 place count 103 transition count 1118
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 93 place count 95 transition count 1118
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 17 Pre rules applied. Total rules applied 93 place count 95 transition count 1101
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 127 place count 78 transition count 1101
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 145 place count 60 transition count 1083
Iterating global reduction 3 with 18 rules applied. Total rules applied 163 place count 60 transition count 1083
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 179 place count 44 transition count 1066
Iterating global reduction 3 with 16 rules applied. Total rules applied 195 place count 44 transition count 1066
Ensure Unique test removed 262 transitions
Reduce isomorphic transitions removed 262 transitions.
Iterating post reduction 3 with 262 rules applied. Total rules applied 457 place count 44 transition count 804
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 458 place count 43 transition count 803
Iterating global reduction 4 with 1 rules applied. Total rules applied 459 place count 43 transition count 803
Ensure Unique test removed 256 transitions
Reduce isomorphic transitions removed 256 transitions.
Iterating post reduction 4 with 256 rules applied. Total rules applied 715 place count 43 transition count 547
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 731 place count 35 transition count 539
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 739 place count 27 transition count 531
Iterating global reduction 5 with 8 rules applied. Total rules applied 747 place count 27 transition count 531
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 748 place count 27 transition count 530
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 750 place count 26 transition count 529
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 751 place count 25 transition count 528
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 752 place count 24 transition count 528
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 753 place count 23 transition count 527
Iterating global reduction 6 with 1 rules applied. Total rules applied 754 place count 23 transition count 527
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 756 place count 22 transition count 526
Performed 8 Post agglomeration using F-continuation condition with reduction of 494 identical transitions.
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 6 with 23 rules applied. Total rules applied 779 place count 7 transition count 24
Drop transitions removed 8 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 6 with 16 rules applied. Total rules applied 795 place count 7 transition count 8
Applied a total of 795 rules in 501 ms. Remains 7 /128 variables (removed 121) and now considering 8/1195 (removed 1187) transitions.
Finished structural reductions, in 1 iterations. Remains : 7/128 places, 8/1195 transitions.
Finished random walk after 7 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=7 )
FORMULA StigmergyElection-PT-09a-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-09a-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 22837 ms.

BK_STOP 1654870295798

--------------------
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
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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 ReachabilityCardinality -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 3600 -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="StigmergyElection-PT-09a"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
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 StigmergyElection-PT-09a, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r294-smll-165463872800366"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/StigmergyElection-PT-09a.tgz
mv StigmergyElection-PT-09a execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;