Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r128-smll-174876524000160.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 MedleyA-PT-08, examination is StateSpace
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r128-smll-174876524000160
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 7.0K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K 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 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 124K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K 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 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 90K 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 1748851581127

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=StateSpace
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-08
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
StateSpace PT
Running Version 202505121319
[2025-06-02 08:06:23] [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-06-02 08:06:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 08:06:24] [INFO ] Load time of PNML (sax parser for PT used): 181 ms
[2025-06-02 08:06:24] [INFO ] Transformed 147 places.
[2025-06-02 08:06:24] [INFO ] Transformed 312 transitions.
[2025-06-02 08:06:24] [INFO ] Found NUPN structural information;
[2025-06-02 08:06:24] [INFO ] Parsed PT model containing 147 places and 312 transitions and 1378 arcs in 412 ms.
Starting structural reductions in STATESPACE mode, iteration 0 : 147/147 places, 312/312 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 08:06:24] [INFO ] Redundant transitions in 31 ms returned []
Running 305 sub problems to find dead transitions.
// Phase 1: matrix 306 rows 147 cols
[2025-06-02 08:06:24] [INFO ] Computed 11 invariants in 28 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 144/144 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/144 variables, 5/149 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/144 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 305 unsolved
Problem TDEAD161 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD268 is UNSAT
At refinement iteration 3 (OVERLAPS) 3/147 variables, 6/155 constraints. Problems are: Problem set: 48 solved, 257 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/147 variables, 3/158 constraints. Problems are: Problem set: 48 solved, 257 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:06:34] [INFO ] Deduced a trap composed of 26 places in 353 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:06:34] [INFO ] Deduced a trap composed of 30 places in 228 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:06:34] [INFO ] Deduced a trap composed of 35 places in 188 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:06:34] [INFO ] Deduced a trap composed of 42 places in 171 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:06:35] [INFO ] Deduced a trap composed of 54 places in 149 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:06:35] [INFO ] Deduced a trap composed of 28 places in 274 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:06:35] [INFO ] Deduced a trap composed of 22 places in 170 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:06:35] [INFO ] Deduced a trap composed of 24 places in 158 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:06:36] [INFO ] Deduced a trap composed of 25 places in 215 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:06:36] [INFO ] Deduced a trap composed of 21 places in 232 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:06:36] [INFO ] Deduced a trap composed of 25 places in 165 ms of which 22 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/147 variables, 11/169 constraints. Problems are: Problem set: 48 solved, 257 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:06:38] [INFO ] Deduced a trap composed of 37 places in 158 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:06:39] [INFO ] Deduced a trap composed of 28 places in 139 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:06:39] [INFO ] Deduced a trap composed of 28 places in 108 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:06:39] [INFO ] Deduced a trap composed of 25 places in 81 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:06:39] [INFO ] Deduced a trap composed of 33 places in 78 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:06:39] [INFO ] Deduced a trap composed of 21 places in 98 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:06:39] [INFO ] Deduced a trap composed of 25 places in 123 ms of which 7 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/147 variables, 7/176 constraints. Problems are: Problem set: 48 solved, 257 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/147 variables, 0/176 constraints. Problems are: Problem set: 48 solved, 257 unsolved
At refinement iteration 8 (OVERLAPS) 306/453 variables, 147/323 constraints. Problems are: Problem set: 48 solved, 257 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:06:46] [INFO ] Deduced a trap composed of 26 places in 253 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:06:47] [INFO ] Deduced a trap composed of 63 places in 212 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:06:47] [INFO ] Deduced a trap composed of 28 places in 221 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:06:47] [INFO ] Deduced a trap composed of 28 places in 210 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:06:48] [INFO ] Deduced a trap composed of 25 places in 238 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:06:48] [INFO ] Deduced a trap composed of 49 places in 179 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:06:48] [INFO ] Deduced a trap composed of 24 places in 126 ms of which 7 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/453 variables, 7/330 constraints. Problems are: Problem set: 48 solved, 257 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:06:55] [INFO ] Deduced a trap along path composed of 3 places in 37 ms of which 8 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((t0 1.0)
(t1 0.0)
(t2 1.0)
(t3 0.0)
(t4 1.0)
(t5 1.0)
(t6 1.0)
(t7 0.0)
(t8 0.0)
(t9 0.0)
(t10 1.0)
(t11 1.0)
(t12 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 453/453 variables, and 331 constraints, problems are : Problem set: 48 solved, 257 unsolved in 30041 ms.
Refiners :[Domain max(s): 147/147 constraints, Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 147/147 constraints, PredecessorRefiner: 305/305 constraints, Known Traps: 25/25 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 48 solved, 257 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 144/144 constraints. Problems are: Problem set: 48 solved, 257 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/144 variables, 5/149 constraints. Problems are: Problem set: 48 solved, 257 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/144 variables, 0/149 constraints. Problems are: Problem set: 48 solved, 257 unsolved
At refinement iteration 3 (OVERLAPS) 3/147 variables, 6/155 constraints. Problems are: Problem set: 48 solved, 257 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/147 variables, 3/158 constraints. Problems are: Problem set: 48 solved, 257 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/147 variables, 25/183 constraints. Problems are: Problem set: 48 solved, 257 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:06:57] [INFO ] Deduced a trap composed of 45 places in 256 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:06:57] [INFO ] Deduced a trap composed of 58 places in 129 ms of which 17 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/147 variables, 2/185 constraints. Problems are: Problem set: 48 solved, 257 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:06:59] [INFO ] Deduced a trap composed of 37 places in 140 ms of which 14 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/147 variables, 1/186 constraints. Problems are: Problem set: 48 solved, 257 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/147 variables, 0/186 constraints. Problems are: Problem set: 48 solved, 257 unsolved
At refinement iteration 9 (OVERLAPS) 306/453 variables, 147/333 constraints. Problems are: Problem set: 48 solved, 257 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/453 variables, 257/590 constraints. Problems are: Problem set: 48 solved, 257 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:07:17] [INFO ] Deduced a trap composed of 25 places in 152 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:07:18] [INFO ] Deduced a trap composed of 29 places in 132 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:07:18] [INFO ] Deduced a trap composed of 37 places in 278 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:07:19] [INFO ] Deduced a trap composed of 33 places in 232 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:07:19] [INFO ] Deduced a trap composed of 35 places in 126 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:07:20] [INFO ] Deduced a trap composed of 33 places in 79 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:07:21] [INFO ] Deduced a trap composed of 25 places in 193 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:07:22] [INFO ] Deduced a trap composed of 30 places in 165 ms of which 25 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 453/453 variables, and 598 constraints, problems are : Problem set: 48 solved, 257 unsolved in 30020 ms.
Refiners :[Domain max(s): 147/147 constraints, Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 147/147 constraints, PredecessorRefiner: 257/305 constraints, Known Traps: 36/36 constraints, Known Traps Along Path: 0/1 constraints]
After SMT, in 60863ms problems are : Problem set: 48 solved, 257 unsolved
Search for dead transitions found 48 dead transitions in 60902ms
Found 48 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 48 transitions
Dead transitions reduction (with SMT) removed 48 transitions
Starting structural reductions in STATESPACE mode, iteration 1 : 147/147 places, 258/312 transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 08:07:25] [INFO ] Redundant transitions in 6 ms returned []
Finished structural reductions in STATESPACE mode , in 2 iterations and 61196 ms. Remains : 147/147 places, 258/312 transitions.
Final net has 147 places and 258 transitions.
[2025-06-02 08:07:25] [INFO ] Flatten gal took : 162 ms
[2025-06-02 08:07:26] [INFO ] Applying decomposition
[2025-06-02 08:07:26] [INFO ] Flatten gal took : 47 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/graph12581096249868319614.txt' '-o' '/tmp/graph12581096249868319614.bin' '-w' '/tmp/graph12581096249868319614.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12581096249868319614.bin' '-l' '-1' '-v' '-w' '/tmp/graph12581096249868319614.weights' '-q' '0' '-e' '0.001'
[2025-06-02 08:07:26] [INFO ] Decomposing Gal with order
[2025-06-02 08:07:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 08:07:26] [INFO ] Removed a total of 392 redundant transitions.
[2025-06-02 08:07:26] [INFO ] Flatten gal took : 276 ms
[2025-06-02 08:07:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 72 labels/synchronizations in 75 ms.
[2025-06-02 08:07:26] [INFO ] Time to serialize gal into /tmp/StateSpace3592768309629972816.gal : 39 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/StateSpace3592768309629972816.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 ...219
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,3.17792e+07,1.25321,32520,1006,381,38889,3427,418,160223,136,21166,0
Total reachable state count : 31779202

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

BK_STOP 1748851648341

--------------------
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
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ 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="MedleyA-PT-08"
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 MedleyA-PT-08, 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 r128-smll-174876524000160"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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