Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r002-tall-174853729800680.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool itstools
Input is AutonomousCar-PT-05b, examination is StateSpace
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r002-tall-174853729800680
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 584K
-rw-r--r-- 1 mcc users 7.7K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 36K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.1K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 93K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.8K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 159K May 29 14:32 model.pnml

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

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

no data necessary for post analysis


=== Now, execution of the tool begins

BK_START 1748649940198

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=StateSpace
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-05b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
StateSpace PT
Running Version 202505121319
[2025-05-31 00:05:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StateSpace, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-31 00:05:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-31 00:05:41] [INFO ] Load time of PNML (sax parser for PT used): 91 ms
[2025-05-31 00:05:41] [INFO ] Transformed 255 places.
[2025-05-31 00:05:41] [INFO ] Transformed 490 transitions.
[2025-05-31 00:05:41] [INFO ] Found NUPN structural information;
[2025-05-31 00:05:41] [INFO ] Parsed PT model containing 255 places and 490 transitions and 2527 arcs in 185 ms.
Starting structural reductions in STATESPACE mode, iteration 0 : 255/255 places, 490/490 transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 00:05:41] [INFO ] Redundant transitions in 29 ms returned []
Running 489 sub problems to find dead transitions.
// Phase 1: matrix 490 rows 255 cols
[2025-05-31 00:05:41] [INFO ] Computed 10 invariants in 15 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/254 variables, 254/254 constraints. Problems are: Problem set: 0 solved, 489 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/254 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 489 unsolved
At refinement iteration 2 (OVERLAPS) 1/255 variables, 10/264 constraints. Problems are: Problem set: 0 solved, 489 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 1/265 constraints. Problems are: Problem set: 0 solved, 489 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:05:51] [INFO ] Deduced a trap composed of 18 places in 186 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:05:51] [INFO ] Deduced a trap composed of 16 places in 138 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:05:51] [INFO ] Deduced a trap composed of 20 places in 126 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:05:51] [INFO ] Deduced a trap composed of 25 places in 122 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:05:52] [INFO ] Deduced a trap composed of 30 places in 120 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:05:52] [INFO ] Deduced a trap composed of 31 places in 112 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:05:52] [INFO ] Deduced a trap composed of 32 places in 142 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:05:52] [INFO ] Deduced a trap composed of 33 places in 126 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:05:52] [INFO ] Deduced a trap composed of 33 places in 132 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:05:52] [INFO ] Deduced a trap composed of 25 places in 126 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:05:52] [INFO ] Deduced a trap composed of 30 places in 113 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:05:53] [INFO ] Deduced a trap composed of 38 places in 106 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:05:53] [INFO ] Deduced a trap composed of 39 places in 119 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:05:53] [INFO ] Deduced a trap composed of 40 places in 116 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:05:53] [INFO ] Deduced a trap composed of 41 places in 116 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:05:53] [INFO ] Deduced a trap composed of 41 places in 126 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:05:53] [INFO ] Deduced a trap composed of 45 places in 131 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:05:53] [INFO ] Deduced a trap composed of 48 places in 138 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:05:54] [INFO ] Deduced a trap composed of 25 places in 114 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:05:54] [INFO ] Deduced a trap composed of 47 places in 124 ms of which 18 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/255 variables, 20/285 constraints. Problems are: Problem set: 0 solved, 489 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:05:54] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:05:54] [INFO ] Deduced a trap composed of 36 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:05:55] [INFO ] Deduced a trap composed of 36 places in 145 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:05:55] [INFO ] Deduced a trap composed of 35 places in 131 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:05:55] [INFO ] Deduced a trap composed of 38 places in 148 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:05:55] [INFO ] Deduced a trap composed of 30 places in 162 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:05:56] [INFO ] Deduced a trap composed of 35 places in 120 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:05:56] [INFO ] Deduced a trap composed of 38 places in 112 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:05:56] [INFO ] Deduced a trap composed of 35 places in 117 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:05:56] [INFO ] Deduced a trap composed of 35 places in 112 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:05:56] [INFO ] Deduced a trap composed of 38 places in 128 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:05:57] [INFO ] Deduced a trap composed of 43 places in 94 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:05:57] [INFO ] Deduced a trap composed of 44 places in 76 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:05:57] [INFO ] Deduced a trap composed of 45 places in 65 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:05:57] [INFO ] Deduced a trap composed of 46 places in 58 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:05:57] [INFO ] Deduced a trap composed of 17 places in 126 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:05:58] [INFO ] Deduced a trap composed of 25 places in 92 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:05:58] [INFO ] Deduced a trap composed of 12 places in 93 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/255 variables, 18/303 constraints. Problems are: Problem set: 0 solved, 489 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:06:01] [INFO ] Deduced a trap composed of 43 places in 81 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:06:01] [INFO ] Deduced a trap composed of 43 places in 90 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:06:01] [INFO ] Deduced a trap composed of 43 places in 98 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:06:02] [INFO ] Deduced a trap composed of 44 places in 78 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:06:02] [INFO ] Deduced a trap composed of 45 places in 79 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:06:02] [INFO ] Deduced a trap composed of 46 places in 73 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/255 variables, 6/309 constraints. Problems are: Problem set: 0 solved, 489 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:06:08] [INFO ] Deduced a trap composed of 44 places in 104 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:06:08] [INFO ] Deduced a trap composed of 46 places in 94 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:06:08] [INFO ] Deduced a trap composed of 46 places in 92 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/255 variables, 3/312 constraints. Problems are: Problem set: 0 solved, 489 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 255/745 variables, and 312 constraints, problems are : Problem set: 0 solved, 489 unsolved in 30039 ms.
Refiners :[Domain max(s): 255/255 constraints, Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/255 constraints, PredecessorRefiner: 489/489 constraints, Known Traps: 47/47 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 489 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/254 variables, 254/254 constraints. Problems are: Problem set: 0 solved, 489 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/254 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 489 unsolved
At refinement iteration 2 (OVERLAPS) 1/255 variables, 10/264 constraints. Problems are: Problem set: 0 solved, 489 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 1/265 constraints. Problems are: Problem set: 0 solved, 489 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/255 variables, 47/312 constraints. Problems are: Problem set: 0 solved, 489 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:06:15] [INFO ] Deduced a trap composed of 38 places in 109 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:06:16] [INFO ] Deduced a trap composed of 38 places in 90 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:06:16] [INFO ] Deduced a trap composed of 45 places in 74 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:06:16] [INFO ] Deduced a trap composed of 45 places in 61 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:06:16] [INFO ] Deduced a trap composed of 46 places in 88 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:06:16] [INFO ] Deduced a trap composed of 46 places in 92 ms of which 21 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/255 variables, 6/318 constraints. Problems are: Problem set: 0 solved, 489 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:06:20] [INFO ] Deduced a trap composed of 37 places in 123 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:06:21] [INFO ] Deduced a trap composed of 35 places in 88 ms of which 7 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/255 variables, 2/320 constraints. Problems are: Problem set: 0 solved, 489 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/255 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 489 unsolved
Problem TDEAD10 is UNSAT
Problem TDEAD447 is UNSAT
At refinement iteration 8 (OVERLAPS) 490/745 variables, 255/575 constraints. Problems are: Problem set: 2 solved, 487 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/745 variables, 487/1062 constraints. Problems are: Problem set: 2 solved, 487 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 745/745 variables, and 1062 constraints, problems are : Problem set: 2 solved, 487 unsolved in 30020 ms.
Refiners :[Domain max(s): 255/255 constraints, Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 487/489 constraints, Known Traps: 55/55 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60855ms problems are : Problem set: 2 solved, 487 unsolved
Search for dead transitions found 2 dead transitions in 60875ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in STATESPACE mode, iteration 1 : 255/255 places, 488/490 transitions.
Reduce places removed 1 places and 0 transitions.
Starting structural reductions in STATESPACE mode, iteration 2 : 254/255 places, 488/490 transitions.
Finished structural reductions in STATESPACE mode , in 2 iterations and 61046 ms. Remains : 254/255 places, 488/490 transitions.
Final net has 254 places and 488 transitions.
[2025-05-31 00:06:42] [INFO ] Flatten gal took : 86 ms
[2025-05-31 00:06:43] [INFO ] Applying decomposition
[2025-05-31 00:06:43] [INFO ] Flatten gal took : 63 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph18156456992515807858.txt' '-o' '/tmp/graph18156456992515807858.bin' '-w' '/tmp/graph18156456992515807858.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph18156456992515807858.bin' '-l' '-1' '-v' '-w' '/tmp/graph18156456992515807858.weights' '-q' '0' '-e' '0.001'
[2025-05-31 00:06:43] [INFO ] Decomposing Gal with order
[2025-05-31 00:06:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 00:06:43] [INFO ] Removed a total of 699 redundant transitions.
[2025-05-31 00:06:43] [INFO ] Flatten gal took : 100 ms
[2025-05-31 00:06:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 24 labels/synchronizations in 13 ms.
[2025-05-31 00:06:43] [INFO ] Time to serialize gal into /tmp/StateSpace15294316294828561931.gal : 8 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/StateSpace15294316294828561931.gal' '-t' 'CGAL' '--stats'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...220
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,1.58e+11,0.081746,6612,704,128,4103,1034,534,4445,93,3901,0
Total reachable state count : 158000170058

Max variable value : 1
STATE_SPACE MAX_TOKEN_IN_PLACE 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Maximum sum along a path : 10
STATE_SPACE MAX_TOKEN_PER_MARKING 10 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Exact state count : 158000170058
STATE_SPACE STATES 158000170058 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Total runtime 62252 ms.

BK_STOP 1748650003780

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ StateSpace = StateSpace ]]
+ [[ -f modelMain.xml ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution StateSpace -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination StateSpace -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="AutonomousCar-PT-05b"
export BK_EXAMINATION="StateSpace"
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-5832"
echo " Executing tool itstools"
echo " Input is AutonomousCar-PT-05b, examination is StateSpace"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r002-tall-174853729800680"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/AutonomousCar-PT-05b.tgz
mv AutonomousCar-PT-05b execution
cd execution
if [ "StateSpace" = "ReachabilityDeadlock" ] || [ "StateSpace" = "UpperBounds" ] || [ "StateSpace" = "QuasiLiveness" ] || [ "StateSpace" = "StableMarking" ] || [ "StateSpace" = "Liveness" ] || [ "StateSpace" = "OneSafe" ] || [ "StateSpace" = "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 [ "StateSpace" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "StateSpace" != "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 "StateSpace.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 '' StateSpace.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "StateSpace" = "ReachabilityDeadlock" ] || [ "StateSpace" = "QuasiLiveness" ] || [ "StateSpace" = "StableMarking" ] || [ "StateSpace" = "Liveness" ] || [ "StateSpace" = "OneSafe" ] ; then
echo "FORMULA_NAME StateSpace"
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 ;