fond
Model Checking Contest 2026
16th edition, Hamburg, Germany, June 23, 2026
Execution of r338-smll-178021499100142
Last Updated
Jun 17, 2026

About the Execution of ITS-Tools for ErlangenMainframeV1-PT-bP12C04

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
11462.619 105299.00 330404.00 207.10 FFTTTTFTFFTFTTTT normal

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-178021499100142.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 ErlangenMainframeV1-PT-bP12C04, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r338-smll-178021499100142
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 86M
-rw-r--r-- 1 mcc users 7.8K May 27 08:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K May 27 08:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K May 27 08:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 27 08:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 27 10:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 27 10:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 27 10:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 27 10:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 26 18:17 NewModel
-rw-r--r-- 1 mcc users 13K May 27 08:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 142K May 27 08:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K May 27 08:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 48K May 27 08:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 27 10:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 27 10:36 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 85M 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 ErlangenMainframeV1-PT-bP12C04-ReachabilityCardinality-2024-00
FORMULA_NAME ErlangenMainframeV1-PT-bP12C04-ReachabilityCardinality-2024-01
FORMULA_NAME ErlangenMainframeV1-PT-bP12C04-ReachabilityCardinality-2024-02
FORMULA_NAME ErlangenMainframeV1-PT-bP12C04-ReachabilityCardinality-2024-03
FORMULA_NAME ErlangenMainframeV1-PT-bP12C04-ReachabilityCardinality-2024-04
FORMULA_NAME ErlangenMainframeV1-PT-bP12C04-ReachabilityCardinality-2024-05
FORMULA_NAME ErlangenMainframeV1-PT-bP12C04-ReachabilityCardinality-2024-06
FORMULA_NAME ErlangenMainframeV1-PT-bP12C04-ReachabilityCardinality-2024-07
FORMULA_NAME ErlangenMainframeV1-PT-bP12C04-ReachabilityCardinality-2024-08
FORMULA_NAME ErlangenMainframeV1-PT-bP12C04-ReachabilityCardinality-2024-09
FORMULA_NAME ErlangenMainframeV1-PT-bP12C04-ReachabilityCardinality-2024-10
FORMULA_NAME ErlangenMainframeV1-PT-bP12C04-ReachabilityCardinality-2024-11
FORMULA_NAME ErlangenMainframeV1-PT-bP12C04-ReachabilityCardinality-2024-12
FORMULA_NAME ErlangenMainframeV1-PT-bP12C04-ReachabilityCardinality-2024-13
FORMULA_NAME ErlangenMainframeV1-PT-bP12C04-ReachabilityCardinality-2024-14
FORMULA_NAME ErlangenMainframeV1-PT-bP12C04-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1780311041991

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ErlangenMainframeV1-PT-bP12C04
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202604301425
[2026-06-01 10:50:44] [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-01 10:50:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-06-01 10:50:49] [INFO ] Load time of PNML (sax parser for PT used): 4490 ms
[2026-06-01 10:50:49] [INFO ] Transformed 337 places.
[2026-06-01 10:50:49] [INFO ] Transformed 62560 transitions.
[2026-06-01 10:50:49] [INFO ] Found NUPN structural information;
[2026-06-01 10:50:49] [INFO ] Parsed PT model containing 337 places and 62560 transitions and 1701269 arcs in 5189 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 29 ms.
Working with output stream class java.io.PrintStream
FORMULA ErlangenMainframeV1-PT-bP12C04-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV1-PT-bP12C04-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV1-PT-bP12C04-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV1-PT-bP12C04-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-06-01 10:51:09] [INFO ] Flatten gal took : 16278 ms
RANDOM walk for 40000 steps (8 resets) in 111541 ms. (0 steps per ms) remains 4/12 properties
FORMULA ErlangenMainframeV1-PT-bP12C04-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ErlangenMainframeV1-PT-bP12C04-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ErlangenMainframeV1-PT-bP12C04-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ErlangenMainframeV1-PT-bP12C04-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ErlangenMainframeV1-PT-bP12C04-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ErlangenMainframeV1-PT-bP12C04-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ErlangenMainframeV1-PT-bP12C04-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ErlangenMainframeV1-PT-bP12C04-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2026-06-01 10:51:22] [INFO ] Flatten gal took : 13405 ms
BEST_FIRST walk for 26297 steps (5 resets) in 20014 ms. (1 steps per ms) remains 4/4 properties
[2026-06-01 10:51:25] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12066940915305948102.gal : 2435 ms
[2026-06-01 10:51:25] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17377391342463937424.prop : 13 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/ReachabilityCardinality12066940915305948102.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17377391342463937424.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 40003 steps (8 resets) in 14230 ms. (2 steps per ms) remains 4/4 properties
BEST_FIRST walk for 35652 steps (8 resets) in 20019 ms. (1 steps per ms) remains 4/4 properties
BEST_FIRST walk for 34768 steps (8 resets) in 20008 ms. (1 steps per ms) remains 4/4 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1785163741144477573.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-384055444896730084.kers'
[2026-06-01 10:51:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1785163741144477573.kers, --Pflows, --basisKERS=/tmp/petrispot-output-384055444896730084.kers]
Culled 0 columns in 287 ms.
// Phase 1: matrix 62560 rows 337 cols 1701269 entries
Finished phase 1 with 304 SingleSign rule and 3 generalized
[2026-06-01 10:51:40] [INFO ] Computed 30 invariants in 1272 ms
Computed 30 P flows in 1273 ms.
Exported basis to /tmp/petrispot-output-384055444896730084.kers
Total runtime 1479 ms.
Excessive predecessor constraint size, skipping predecessor.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 254/292 variables, 17/55 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/292 variables, 254/309 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/292 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 18/310 variables, 1/310 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/310 variables, 18/328 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/310 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 27/337 variables, 12/340 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/337 variables, 27/367 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/337 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SMT process timed out in 7778ms, After SMT, problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 38 out of 337 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 337/337 places, 62560/62560 transitions.
Graph (trivial) has 218 edges and 337 vertex of which 10 / 337 are part of one of the 4 SCC in 31 ms
Free SCC test removed 6 places
Drop transitions (Empty/Sink Transition effects.) removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 82 transitions
Trivial Post-agglo rules discarded 82 transitions
Performed 82 trivial Post agglomeration. Transition count delta: 82
Iterating post reduction 0 with 82 rules applied. Total rules applied 83 place count 331 transition count 62467
Reduce places removed 82 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 87 rules applied. Total rules applied 170 place count 249 transition count 62462
Reduce places removed 1 places and 0 transitions.
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Iterating post reduction 2 with 18 rules applied. Total rules applied 188 place count 248 transition count 62445
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 19 rules applied. Total rules applied 207 place count 231 transition count 62443
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 11 Pre rules applied. Total rules applied 207 place count 231 transition count 62432
Deduced a syphon composed of 11 places in 88 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 229 place count 220 transition count 62432
Discarding 30 places :
Symmetric choice reduction at 4 with 30 rule applications. Total rules 259 place count 190 transition count 62402
Iterating global reduction 4 with 30 rules applied. Total rules applied 289 place count 190 transition count 62402
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 289 place count 190 transition count 62400
Deduced a syphon composed of 2 places in 85 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 293 place count 188 transition count 62400
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 304 place count 177 transition count 42025
Ensure Unique test removed 4 places
Iterating global reduction 4 with 15 rules applied. Total rules applied 319 place count 173 transition count 42025
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 325 place count 167 transition count 2089
Iterating global reduction 4 with 6 rules applied. Total rules applied 331 place count 167 transition count 2089
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 332 place count 166 transition count 2087
Iterating global reduction 4 with 1 rules applied. Total rules applied 333 place count 166 transition count 2087
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 4 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 4 with 70 rules applied. Total rules applied 403 place count 131 transition count 2052
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 4 places in 3 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 411 place count 127 transition count 2058
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 421 place count 127 transition count 2048
Free-agglomeration rule applied 18 times.
Iterating global reduction 4 with 18 rules applied. Total rules applied 439 place count 127 transition count 2030
Reduce places removed 18 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 25 rules applied. Total rules applied 464 place count 109 transition count 2023
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 466 place count 109 transition count 2021
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 467 place count 109 transition count 3555
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 468 place count 108 transition count 3555
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 470 place count 108 transition count 3555
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 471 place count 108 transition count 3555
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 472 place count 107 transition count 3554
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 473 place count 106 transition count 3554
Applied a total of 473 rules in 27692 ms. Remains 106 /337 variables (removed 231) and now considering 3554/62560 (removed 59006) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27715 ms. Remains : 106/337 places, 3554/62560 transitions.
RANDOM walk for 40000 steps (8 resets) in 4489 ms. (8 steps per ms) remains 3/4 properties
FORMULA ErlangenMainframeV1-PT-bP12C04-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 157 ms. (253 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 378 ms. (105 steps per ms) remains 2/3 properties
FORMULA ErlangenMainframeV1-PT-bP12C04-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 399 ms. (100 steps per ms) remains 1/2 properties
FORMULA ErlangenMainframeV1-PT-bP12C04-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2026-06-01 10:52:15] [INFO ] Flow matrix only has 2017 transitions (discarded 1537 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15133597135023830626.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10013906932072255231.kers'
[2026-06-01 10:52:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15133597135023830626.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10013906932072255231.kers]
Culled 0 columns in 11 ms.
// Phase 1: matrix 2017 rows 106 cols 42484 entries
Finished phase 1 with 78 SingleSign rule and 3 generalized
[2026-06-01 10:52:15] [INFO ] Computed 25 invariants in 37 ms
Computed 25 P flows in 38 ms.
Exported basis to /tmp/petrispot-output-10013906932072255231.kers
Total runtime 48 ms.
[2026-06-01 10:52:15] [INFO ] State equation strengthened by 1540 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 24/29 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 42/71 variables, 12/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1973/2044 variables, 71/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2044 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 19/2063 variables, 6/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2063 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2063 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 17/2080 variables, 2/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2080 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 12/2092 variables, 2/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2092 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 31/2123 variables, 29/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2123 variables, 1539/1671 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2123 variables, 0/1671 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/2123 variables, 0/1671 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2123/2123 variables, and 1671 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1256 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 106/106 constraints, ReadFeed: 1540/1540 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 24/29 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 42/71 variables, 12/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1973/2044 variables, 71/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2044 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 19/2063 variables, 6/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2063 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2063 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 17/2080 variables, 2/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2080 variables, 2/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2080 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 12/2092 variables, 2/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2092 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 31/2123 variables, 29/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2123 variables, 1539/1673 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2123 variables, 0/1673 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/2123 variables, 0/1673 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2123/2123 variables, and 1673 constraints, problems are : Problem set: 0 solved, 1 unsolved in 8111 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 106/106 constraints, ReadFeed: 1540/1540 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9523ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 203 ms.
Support contains 5 out of 106 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 106/106 places, 3554/3554 transitions.
Graph (trivial) has 54 edges and 106 vertex of which 2 / 106 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 105 transition count 3540
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 25 place count 93 transition count 3540
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 25 place count 93 transition count 3539
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 27 place count 92 transition count 3539
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 31 place count 88 transition count 1714
Ensure Unique test removed 2 places
Iterating global reduction 2 with 6 rules applied. Total rules applied 37 place count 86 transition count 1714
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 77 place count 66 transition count 1694
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 83 place count 66 transition count 1688
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 89 place count 60 transition count 1593
Ensure Unique test removed 4 places
Iterating global reduction 3 with 10 rules applied. Total rules applied 99 place count 56 transition count 1593
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 101 place count 55 transition count 1592
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -22
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 107 place count 52 transition count 1614
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 118 place count 52 transition count 1603
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 119 place count 51 transition count 1602
Iterating global reduction 4 with 1 rules applied. Total rules applied 120 place count 51 transition count 1602
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 126 place count 51 transition count 1596
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 130 place count 51 transition count 1592
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 130 place count 51 transition count 1591
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 132 place count 50 transition count 1591
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 134 place count 49 transition count 1601
Free-agglomeration rule applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 136 place count 49 transition count 1599
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 138 place count 47 transition count 1599
Applied a total of 138 rules in 682 ms. Remains 47 /106 variables (removed 59) and now considering 1599/3554 (removed 1955) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 682 ms. Remains : 47/106 places, 1599/3554 transitions.
RANDOM walk for 6032 steps (1 resets) in 1992 ms. (3 steps per ms) remains 0/1 properties
FORMULA ErlangenMainframeV1-PT-bP12C04-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 102768 ms.

BK_STOP 1780311147290

--------------------
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="ErlangenMainframeV1-PT-bP12C04"
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 ErlangenMainframeV1-PT-bP12C04, 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-178021499100142"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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