Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r212-tall-174901993900208.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 ShieldRVt-PT-002B, examination is StateSpace
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r212-tall-174901993900208
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 7.6K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K 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 18K 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 134K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K 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:33 equiv_col
-rw-r--r-- 1 mcc users 5 May 29 14:33 instance
-rw-r--r-- 1 mcc users 6 May 29 14:33 iscolored
-rw-r--r-- 1 mcc users 24K May 29 14:33 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 1749095683079

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=StateSpace
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVt-PT-002B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
StateSpace PT
Running Version 202505121319
[2025-06-05 03:54:44] [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-05 03:54:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-05 03:54:44] [INFO ] Load time of PNML (sax parser for PT used): 51 ms
[2025-06-05 03:54:44] [INFO ] Transformed 103 places.
[2025-06-05 03:54:44] [INFO ] Transformed 103 transitions.
[2025-06-05 03:54:44] [INFO ] Found NUPN structural information;
[2025-06-05 03:54:44] [INFO ] Parsed PT model containing 103 places and 103 transitions and 242 arcs in 141 ms.
Starting structural reductions in STATESPACE mode, iteration 0 : 103/103 places, 103/103 transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 03:54:44] [INFO ] Redundant transitions in 4 ms returned []
Running 102 sub problems to find dead transitions.
// Phase 1: matrix 103 rows 103 cols
[2025-06-05 03:54:44] [INFO ] Computed 9 invariants in 9 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 102/102 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (OVERLAPS) 1/103 variables, 9/111 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 102 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:54:45] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:54:45] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:54:45] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:54:46] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:54:46] [INFO ] Deduced a trap composed of 22 places in 23 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:54:46] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:54:46] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:54:46] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:54:46] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:54:46] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:54:46] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:54:46] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:54:46] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 13/125 constraints. Problems are: Problem set: 0 solved, 102 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:54:46] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:54:46] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:54:46] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:54:46] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 4/129 constraints. Problems are: Problem set: 0 solved, 102 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:54:47] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:54:47] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:54:47] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:54:47] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:54:47] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:54:47] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:54:47] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:54:47] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/103 variables, 8/137 constraints. Problems are: Problem set: 0 solved, 102 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:54:47] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:54:47] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:54:47] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:54:47] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:54:48] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/103 variables, 5/142 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/103 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 9 (OVERLAPS) 103/206 variables, 103/245 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/206 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 102 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:54:49] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 2 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/206 variables, 1/246 constraints. Problems are: Problem set: 0 solved, 102 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:54:50] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/206 variables, 1/247 constraints. Problems are: Problem set: 0 solved, 102 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:54:50] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:54:51] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/206 variables, 2/249 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/206 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 102 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:54:52] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 2 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/206 variables, 1/250 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/206 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 17 (OVERLAPS) 0/206 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Real declared 206/206 variables, and 250 constraints, problems are : Problem set: 0 solved, 102 unsolved in 9608 ms.
Refiners :[Domain max(s): 103/103 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 35/35 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 102 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 102/102 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (OVERLAPS) 1/103 variables, 9/111 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 35/147 constraints. Problems are: Problem set: 0 solved, 102 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:54:54] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/103 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (OVERLAPS) 103/206 variables, 103/251 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/206 variables, 102/353 constraints. Problems are: Problem set: 0 solved, 102 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:54:55] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:54:55] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:54:56] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:54:56] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:54:56] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/206 variables, 5/358 constraints. Problems are: Problem set: 0 solved, 102 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:54:57] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/206 variables, 1/359 constraints. Problems are: Problem set: 0 solved, 102 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:54:58] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:54:58] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/206 variables, 2/361 constraints. Problems are: Problem set: 0 solved, 102 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:55:00] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/206 variables, 1/362 constraints. Problems are: Problem set: 0 solved, 102 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:55:02] [INFO ] Deduced a trap composed of 27 places in 35 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/206 variables, 1/363 constraints. Problems are: Problem set: 0 solved, 102 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:55:04] [INFO ] Deduced a trap along path composed of 9 places in 38 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:55:06] [INFO ] Deduced a trap along path composed of 7 places in 20 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/206 variables, 2/365 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/206 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 102 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:55:12] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 2 ms to minimize.
At refinement iteration 16 (OVERLAPS) 0/206 variables, 1/366 constraints. Problems are: Problem set: 0 solved, 102 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:55:16] [INFO ] Deduced a trap along path composed of 9 places in 37 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:55:17] [INFO ] Deduced a trap along path composed of 9 places in 26 ms of which 0 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/206 variables, 2/368 constraints. Problems are: Problem set: 0 solved, 102 unsolved
Error getting values : (error "ParserException while parsing response: ((t0 1)
(t1 1)
(t2 1)
(t3 1)
(t4 1)
(t5 1)
(t6 1)
(t7 1)
(t8 1)
(t9 1)
(t10 0)
(t11 0)
(t12 0)
(t13 1)
(t14 1)
(t15 1)
(t16 1)
(t17 1)
(t18 1)
(t19 0)
(t20 0)
(t21 0)
(t22 1)
(t23 1)
(t24 0)
(t25 timeout
1) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 206/206 variables, and 368 constraints, problems are : Problem set: 0 solved, 102 unsolved in 30013 ms.
Refiners :[Domain max(s): 103/103 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 47/47 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 39681ms problems are : Problem set: 0 solved, 102 unsolved
Search for dead transitions found 0 dead transitions in 39690ms
Finished structural reductions in STATESPACE mode , in 1 iterations and 39793 ms. Remains : 103/103 places, 103/103 transitions.
Final net has 103 places and 103 transitions.
[2025-06-05 03:55:24] [INFO ] Flatten gal took : 31 ms
[2025-06-05 03:55:24] [INFO ] Applying decomposition
[2025-06-05 03:55:24] [INFO ] Flatten gal took : 9 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/graph13640424439671535047.txt' '-o' '/tmp/graph13640424439671535047.bin' '-w' '/tmp/graph13640424439671535047.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13640424439671535047.bin' '-l' '-1' '-v' '-w' '/tmp/graph13640424439671535047.weights' '-q' '0' '-e' '0.001'
[2025-06-05 03:55:24] [INFO ] Decomposing Gal with order
[2025-06-05 03:55:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 03:55:24] [INFO ] Removed a total of 12 redundant transitions.
[2025-06-05 03:55:24] [INFO ] Flatten gal took : 45 ms
[2025-06-05 03:55:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2025-06-05 03:55:24] [INFO ] Time to serialize gal into /tmp/StateSpace11193645846293581895.gal : 5 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/StateSpace11193645846293581895.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.65284e+08,0.056915,5884,489,28,3545,157,256,6727,38,324,0
Total reachable state count : 165284395

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

BK_STOP 1749095724744

--------------------
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="ShieldRVt-PT-002B"
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 ShieldRVt-PT-002B, 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 r212-tall-174901993900208"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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