Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r338-smll-178021499200246.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-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-5973
Executing tool itstools
Input is ErlangenMainframeV2-PT-bP05C05, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r338-smll-178021499200246
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 984K
-rw-r--r-- 1 mcc users 6.7K May 27 09:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K May 27 09:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 27 09:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 27 09:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 27 10:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 27 10:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 27 10:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 27 10:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 26 18:17 NewModel
-rw-r--r-- 1 mcc users 8.5K May 27 09:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 82K May 27 09:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K May 27 09:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K May 27 09:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 27 10:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 27 10:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 26 18:17 equiv_col
-rw-r--r-- 1 mcc users 8 May 26 18:17 instance
-rw-r--r-- 1 mcc users 6 May 26 18:17 iscolored
-rw-r--r-- 1 mcc users 610K May 26 18:17 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1780379845202

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ErlangenMainframeV2-PT-bP05C05
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202604301425
[2026-06-02 05:57:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-06-02 05:57:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-06-02 05:57:27] [INFO ] Load time of PNML (sax parser for PT used): 380 ms
[2026-06-02 05:57:27] [INFO ] Transformed 259 places.
[2026-06-02 05:57:28] [INFO ] Transformed 1015 transitions.
[2026-06-02 05:57:28] [INFO ] Found NUPN structural information;
[2026-06-02 05:57:28] [INFO ] Parsed PT model containing 259 places and 1015 transitions and 11939 arcs in 626 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 30 ms.
Working with output stream class java.io.PrintStream
FORMULA ErlangenMainframeV2-PT-bP05C05-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV2-PT-bP05C05-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV2-PT-bP05C05-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV2-PT-bP05C05-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV2-PT-bP05C05-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV2-PT-bP05C05-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-06-02 05:57:29] [INFO ] Flatten gal took : 658 ms
[2026-06-02 05:57:29] [INFO ] Flatten gal took : 344 ms
RANDOM walk for 40000 steps (8 resets) in 6664 ms. (6 steps per ms) remains 5/10 properties
FORMULA ErlangenMainframeV2-PT-bP05C05-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ErlangenMainframeV2-PT-bP05C05-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ErlangenMainframeV2-PT-bP05C05-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ErlangenMainframeV2-PT-bP05C05-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ErlangenMainframeV2-PT-bP05C05-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2026-06-02 05:57:30] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11057039117214252572.gal : 269 ms
[2026-06-02 05:57:30] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10699767372654156420.prop : 6 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.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality11057039117214252572.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10699767372654156420.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
BEST_FIRST walk for 40000 steps (8 resets) in 2298 ms. (17 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40000 steps (8 resets) in 884 ms. (45 steps per ms) remains 5/5 properties
Loading property file /tmp/ReachabilityCardinality10699767372654156420.prop.
BEST_FIRST walk for 40000 steps (8 resets) in 552 ms. (72 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (8 resets) in 612 ms. (65 steps per ms) remains 4/5 properties
FORMULA ErlangenMainframeV2-PT-bP05C05-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40000 steps (8 resets) in 551 ms. (72 steps per ms) remains 4/4 properties
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :2 after 3
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :3 after 5
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :5 after 6
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :6 after 12
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :12 after 99
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13132580653826170666.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-219733108276511482.kers'
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :99 after 1169
[2026-06-02 05:57:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13132580653826170666.kers, --Pflows, --basisKERS=/tmp/petrispot-output-219733108276511482.kers]
SDD proceeding with computation,5 properties remain. new max is 512
SDD size :1169 after 1223
Culled 0 columns in 2 ms.
// Phase 1: matrix 1015 rows 259 cols 11939 entries
Finished phase 1 with 238 SingleSign rule and 3 generalized
[2026-06-02 05:57:31] [INFO ] Computed 18 invariants in 10 ms
Computed 18 P flows in 14 ms.
Exported basis to /tmp/petrispot-output-219733108276511482.kers
Total runtime 16 ms.
Reachability property ErlangenMainframeV2-PT-bP05C05-ReachabilityCardinality-2024-02 is true.
FORMULA ErlangenMainframeV2-PT-bP05C05-ReachabilityCardinality-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :1223 after 12453
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :12453 after 12629
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 38/43 variables, 1/6 constraints. Problems are: Problem set: 1 solved, 3 unsolved
Invariant property ErlangenMainframeV2-PT-bP05C05-ReachabilityCardinality-2024-08 does not hold.
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :12629 after 4.34571e+06
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 38/44 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/44 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 129/172 variables, 11/55 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/172 variables, 129/184 constraints. Problems are: Problem set: 1 solved, 3 unsolved
SDD proceeding with computation,3 properties remain. new max is 2048
SDD size :4.34571e+06 after 4.36538e+06
At refinement iteration 7 (INCLUDED_ONLY) 0/172 variables, 0/184 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 87/259 variables, 6/190 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/259 variables, 87/277 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/259 variables, 0/277 constraints. Problems are: Problem set: 1 solved, 3 unsolved
SDD proceeding with computation,3 properties remain. new max is 4096
SDD size :4.36538e+06 after 9.75051e+06
At refinement iteration 11 (OVERLAPS) 1015/1274 variables, 259/536 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1274 variables, 0/536 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/1274 variables, 0/536 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1274/1274 variables, and 536 constraints, problems are : Problem set: 1 solved, 3 unsolved in 1574 ms.
Refiners :[Domain max(s): 259/259 constraints, Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 259/259 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 38/42 variables, 1/5 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 38/43 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/43 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 129/171 variables, 11/54 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/171 variables, 129/183 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/171 variables, 0/183 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 88/259 variables, 6/189 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/259 variables, 88/277 constraints. Problems are: Problem set: 1 solved, 3 unsolved
SDD proceeding with computation,3 properties remain. new max is 8192
SDD size :9.75051e+06 after 5.46238e+07
At refinement iteration 10 (INCLUDED_ONLY) 0/259 variables, 4/281 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/259 variables, 0/281 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 1015/1274 variables, 259/540 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1274 variables, 3/543 constraints. Problems are: Problem set: 1 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1274/1274 variables, and 543 constraints, problems are : Problem set: 1 solved, 3 unsolved in 5012 ms.
Refiners :[Domain max(s): 259/259 constraints, Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 259/259 constraints, PredecessorRefiner: 3/4 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6777ms problems are : Problem set: 1 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 259 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 259/259 places, 1015/1015 transitions.
Graph (trivial) has 225 edges and 259 vertex of which 12 / 259 are part of one of the 5 SCC in 10 ms
Free SCC test removed 7 places
Drop transitions (Empty/Sink Transition effects.) removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 101 transitions
Trivial Post-agglo rules discarded 101 transitions
Performed 101 trivial Post agglomeration. Transition count delta: 101
Iterating post reduction 0 with 101 rules applied. Total rules applied 102 place count 252 transition count 901
Reduce places removed 101 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 112 rules applied. Total rules applied 214 place count 151 transition count 890
Reduce places removed 3 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 5 rules applied. Total rules applied 219 place count 148 transition count 888
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 221 place count 146 transition count 888
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 221 place count 146 transition count 884
Deduced a syphon composed of 4 places in 4 ms
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 9 rules applied. Total rules applied 230 place count 141 transition count 884
Discarding 28 places :
Symmetric choice reduction at 4 with 28 rule applications. Total rules 258 place count 113 transition count 856
Iterating global reduction 4 with 28 rules applied. Total rules applied 286 place count 113 transition count 856
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 286 place count 113 transition count 851
Deduced a syphon composed of 5 places in 3 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 296 place count 108 transition count 851
Discarding 14 places :
Symmetric choice reduction at 4 with 14 rule applications. Total rules 310 place count 94 transition count 585
Ensure Unique test removed 4 places
Iterating global reduction 4 with 18 rules applied. Total rules applied 328 place count 90 transition count 585
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 336 place count 82 transition count 105
Iterating global reduction 4 with 8 rules applied. Total rules applied 344 place count 82 transition count 105
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 347 place count 79 transition count 99
Iterating global reduction 4 with 3 rules applied. Total rules applied 350 place count 79 transition count 99
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 4 with 52 rules applied. Total rules applied 402 place count 53 transition count 73
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 420 place count 44 transition count 93
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 430 place count 44 transition count 83
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 432 place count 42 transition count 78
Iterating global reduction 5 with 2 rules applied. Total rules applied 434 place count 42 transition count 78
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 438 place count 42 transition count 74
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 440 place count 41 transition count 78
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 6 with 19 rules applied. Total rules applied 459 place count 41 transition count 59
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 461 place count 40 transition count 63
Free-agglomeration rule applied 9 times.
Iterating global reduction 6 with 9 rules applied. Total rules applied 470 place count 40 transition count 54
Reduce places removed 9 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 6 with 19 rules applied. Total rules applied 489 place count 31 transition count 44
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 492 place count 31 transition count 41
Applied a total of 492 rules in 395 ms. Remains 31 /259 variables (removed 228) and now considering 41/1015 (removed 974) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 409 ms. Remains : 31/259 places, 41/1015 transitions.
RANDOM walk for 587 steps (0 resets) in 32 ms. (17 steps per ms) remains 0/3 properties
FORMULA ErlangenMainframeV2-PT-bP05C05-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ErlangenMainframeV2-PT-bP05C05-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ErlangenMainframeV2-PT-bP05C05-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
All properties solved without resorting to model-checking.
Total runtime 11484 ms.

BK_STOP 1780379858907

--------------------
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
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -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.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -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="ErlangenMainframeV2-PT-bP05C05"
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-5973"
echo " Executing tool itstools"
echo " Input is ErlangenMainframeV2-PT-bP05C05, 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 r338-smll-178021499200246"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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