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-165463872800382.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-10a, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r294-smll-165463872800382
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 51M
-rw-r--r-- 1 mcc users 7.3K May 30 15:15 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K May 30 15:15 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K May 30 15:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 72K May 30 15:08 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 25 13:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K 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 18K May 25 13:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 29 12:20 NewModel
-rw-r--r-- 1 mcc users 15K May 30 15:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 178K May 30 15:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K May 30 15:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K May 30 15:26 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 50M 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-10a-ReachabilityCardinality-00
FORMULA_NAME StigmergyElection-PT-10a-ReachabilityCardinality-01
FORMULA_NAME StigmergyElection-PT-10a-ReachabilityCardinality-02
FORMULA_NAME StigmergyElection-PT-10a-ReachabilityCardinality-03
FORMULA_NAME StigmergyElection-PT-10a-ReachabilityCardinality-04
FORMULA_NAME StigmergyElection-PT-10a-ReachabilityCardinality-05
FORMULA_NAME StigmergyElection-PT-10a-ReachabilityCardinality-06
FORMULA_NAME StigmergyElection-PT-10a-ReachabilityCardinality-07
FORMULA_NAME StigmergyElection-PT-10a-ReachabilityCardinality-08
FORMULA_NAME StigmergyElection-PT-10a-ReachabilityCardinality-09
FORMULA_NAME StigmergyElection-PT-10a-ReachabilityCardinality-10
FORMULA_NAME StigmergyElection-PT-10a-ReachabilityCardinality-11
FORMULA_NAME StigmergyElection-PT-10a-ReachabilityCardinality-12
FORMULA_NAME StigmergyElection-PT-10a-ReachabilityCardinality-13
FORMULA_NAME StigmergyElection-PT-10a-ReachabilityCardinality-14
FORMULA_NAME StigmergyElection-PT-10a-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1654876261775

Running Version 202205111006
[2022-06-10 15:51:04] [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 15:51:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-10 15:51:07] [INFO ] Load time of PNML (sax parser for PT used): 3387 ms
[2022-06-10 15:51:07] [INFO ] Transformed 142 places.
[2022-06-10 15:51:08] [INFO ] Transformed 50162 transitions.
[2022-06-10 15:51:08] [INFO ] Found NUPN structural information;
[2022-06-10 15:51:08] [INFO ] Parsed PT model containing 142 places and 50162 transitions in 3980 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 46 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 47924 transitions
Reduce redundant transitions removed 47924 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 1807 ms. (steps per millisecond=5 ) properties (out of 16) seen :8
FORMULA StigmergyElection-PT-10a-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-10a-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-10a-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-10a-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-10a-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-10a-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-10a-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-10a-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 8) seen :1
FORMULA StigmergyElection-PT-10a-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2022-06-10 15:51:10] [INFO ] Flow matrix only has 2208 transitions (discarded 30 similar events)
// Phase 1: matrix 2208 rows 142 cols
[2022-06-10 15:51:10] [INFO ] Computed 11 place invariants in 47 ms
[2022-06-10 15:51:11] [INFO ] After 379ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2022-06-10 15:51:11] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2022-06-10 15:51:12] [INFO ] After 983ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :3
[2022-06-10 15:51:13] [INFO ] State equation strengthened by 2095 read => feed constraints.
[2022-06-10 15:51:13] [INFO ] After 804ms SMT Verify possible using 2095 Read/Feed constraints in natural domain returned unsat :4 sat :3
[2022-06-10 15:51:15] [INFO ] Deduced a trap composed of 13 places in 1320 ms of which 10 ms to minimize.
[2022-06-10 15:51:16] [INFO ] Deduced a trap composed of 12 places in 1205 ms of which 3 ms to minimize.
[2022-06-10 15:51:17] [INFO ] Deduced a trap composed of 13 places in 897 ms of which 2 ms to minimize.
[2022-06-10 15:51:18] [INFO ] Deduced a trap composed of 13 places in 637 ms of which 1 ms to minimize.
[2022-06-10 15:51:19] [INFO ] Deduced a trap composed of 12 places in 660 ms of which 1 ms to minimize.
[2022-06-10 15:51:19] [INFO ] Deduced a trap composed of 13 places in 717 ms of which 1 ms to minimize.
[2022-06-10 15:51:20] [INFO ] Deduced a trap composed of 12 places in 728 ms of which 1 ms to minimize.
[2022-06-10 15:51:21] [INFO ] Deduced a trap composed of 13 places in 659 ms of which 2 ms to minimize.
[2022-06-10 15:51:22] [INFO ] Deduced a trap composed of 13 places in 686 ms of which 1 ms to minimize.
[2022-06-10 15:51:22] [INFO ] Deduced a trap composed of 12 places in 540 ms of which 0 ms to minimize.
[2022-06-10 15:51:23] [INFO ] Deduced a trap composed of 12 places in 667 ms of which 1 ms to minimize.
[2022-06-10 15:51:24] [INFO ] Deduced a trap composed of 12 places in 731 ms of which 1 ms to minimize.
[2022-06-10 15:51:25] [INFO ] Deduced a trap composed of 13 places in 657 ms of which 1 ms to minimize.
[2022-06-10 15:51:25] [INFO ] Deduced a trap composed of 12 places in 436 ms of which 1 ms to minimize.
[2022-06-10 15:51:26] [INFO ] Deduced a trap composed of 12 places in 347 ms of which 1 ms to minimize.
[2022-06-10 15:51:26] [INFO ] Deduced a trap composed of 12 places in 623 ms of which 1 ms to minimize.
[2022-06-10 15:51:27] [INFO ] Deduced a trap composed of 12 places in 550 ms of which 1 ms to minimize.
[2022-06-10 15:51:27] [INFO ] Deduced a trap composed of 12 places in 390 ms of which 1 ms to minimize.
[2022-06-10 15:51:28] [INFO ] Deduced a trap composed of 12 places in 244 ms of which 1 ms to minimize.
[2022-06-10 15:51:28] [INFO ] Deduced a trap composed of 12 places in 225 ms of which 1 ms to minimize.
[2022-06-10 15:51:28] [INFO ] Deduced a trap composed of 12 places in 249 ms of which 1 ms to minimize.
[2022-06-10 15:51:29] [INFO ] Deduced a trap composed of 12 places in 256 ms of which 1 ms to minimize.
[2022-06-10 15:51:29] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 15528 ms
[2022-06-10 15:51:30] [INFO ] Deduced a trap composed of 12 places in 675 ms of which 1 ms to minimize.
[2022-06-10 15:51:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 765 ms
[2022-06-10 15:51:31] [INFO ] Deduced a trap composed of 12 places in 628 ms of which 0 ms to minimize.
[2022-06-10 15:51:31] [INFO ] Deduced a trap composed of 13 places in 651 ms of which 1 ms to minimize.
[2022-06-10 15:51:32] [INFO ] Deduced a trap composed of 12 places in 556 ms of which 1 ms to minimize.
[2022-06-10 15:51:32] [INFO ] Deduced a trap composed of 12 places in 416 ms of which 0 ms to minimize.
[2022-06-10 15:51:33] [INFO ] Deduced a trap composed of 12 places in 377 ms of which 1 ms to minimize.
[2022-06-10 15:51:33] [INFO ] Deduced a trap composed of 12 places in 259 ms of which 1 ms to minimize.
[2022-06-10 15:51:34] [INFO ] Deduced a trap composed of 12 places in 266 ms of which 0 ms to minimize.
[2022-06-10 15:51:34] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 3798 ms
[2022-06-10 15:51:34] [INFO ] After 21153ms SMT Verify possible using trap constraints in natural domain returned unsat :5 sat :2
Attempting to minimize the solution found.
Minimization took 303 ms.
[2022-06-10 15:51:34] [INFO ] After 22848ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :2
FORMULA StigmergyElection-PT-10a-ReachabilityCardinality-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyElection-PT-10a-ReachabilityCardinality-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyElection-PT-10a-ReachabilityCardinality-11 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyElection-PT-10a-ReachabilityCardinality-10 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyElection-PT-10a-ReachabilityCardinality-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 7 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 864 ms.
Support contains 27 out of 142 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 142/142 places, 2238/2238 transitions.
Graph (complete) has 501 edges and 142 vertex of which 134 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.36 ms
Discarding 8 places :
Also discarding 8 output transitions
Drop transitions removed 8 transitions
Drop transitions removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 39 rules applied. Total rules applied 40 place count 134 transition count 2191
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 25 rules applied. Total rules applied 65 place count 124 transition count 2176
Reduce places removed 5 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 8 rules applied. Total rules applied 73 place count 119 transition count 2173
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 79 place count 116 transition count 2170
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 13 Pre rules applied. Total rules applied 79 place count 116 transition count 2157
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 105 place count 103 transition count 2157
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 115 place count 93 transition count 2147
Iterating global reduction 4 with 10 rules applied. Total rules applied 125 place count 93 transition count 2147
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 132 place count 86 transition count 2140
Iterating global reduction 4 with 7 rules applied. Total rules applied 139 place count 86 transition count 2140
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 149 place count 86 transition count 2130
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 165 place count 78 transition count 2122
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 169 place count 74 transition count 2118
Iterating global reduction 5 with 4 rules applied. Total rules applied 173 place count 74 transition count 2118
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 181 place count 74 transition count 2110
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 5 with 2 rules applied. Total rules applied 183 place count 73 transition count 2109
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 184 place count 72 transition count 2108
Iterating global reduction 5 with 1 rules applied. Total rules applied 185 place count 72 transition count 2108
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 186 place count 72 transition count 2107
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 187 place count 72 transition count 2106
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 188 place count 71 transition count 2106
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 189 place count 71 transition count 2106
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 190 place count 70 transition count 2105
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 191 place count 69 transition count 2105
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 5 Pre rules applied. Total rules applied 191 place count 69 transition count 2100
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 7 with 10 rules applied. Total rules applied 201 place count 64 transition count 2100
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 202 place count 63 transition count 2099
Iterating global reduction 7 with 1 rules applied. Total rules applied 203 place count 63 transition count 2099
Performed 3 Post agglomeration using F-continuation condition with reduction of 511 identical transitions.
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 209 place count 60 transition count 1585
Drop transitions removed 2 transitions
Ensure Unique test removed 761 transitions
Reduce isomorphic transitions removed 763 transitions.
Iterating post reduction 7 with 763 rules applied. Total rules applied 972 place count 60 transition count 822
Performed 4 Post agglomeration using F-continuation condition with reduction of 383 identical transitions.
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 8 with 10 rules applied. Total rules applied 982 place count 54 transition count 435
Drop transitions removed 4 transitions
Ensure Unique test removed 282 transitions
Reduce isomorphic transitions removed 286 transitions.
Iterating post reduction 8 with 286 rules applied. Total rules applied 1268 place count 54 transition count 149
Drop transitions removed 47 transitions
Redundant transition composition rules discarded 47 transitions
Iterating global reduction 9 with 47 rules applied. Total rules applied 1315 place count 54 transition count 102
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 1316 place count 54 transition count 102
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 9 with 3 rules applied. Total rules applied 1319 place count 51 transition count 99
Applied a total of 1319 rules in 4565 ms. Remains 51 /142 variables (removed 91) and now considering 99/2238 (removed 2139) transitions.
Finished structural reductions, in 1 iterations. Remains : 51/142 places, 99/2238 transitions.
Finished random walk after 1202 steps, including 9 resets, run visited all 2 properties in 15 ms. (steps per millisecond=80 )
FORMULA StigmergyElection-PT-10a-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-10a-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 35980 ms.

BK_STOP 1654876300121

--------------------
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
++ 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 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-10a"
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-10a, 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-165463872800382"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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