fond
Model Checking Contest 2026
16th edition, Hamburg, Germany, June 23, 2026
Execution of r098-tall-177955695700663
Last Updated
Jun 17, 2026

About the Execution of ITS-Tools for DLCround-PT-12b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
891.084 17535.00 50099.00 216.30 TTTTFTTTFTFFFTFT 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.r098-tall-177955695700663.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 DLCround-PT-12b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r098-tall-177955695700663
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.3M
-rw-r--r-- 1 mcc users 8.3K Mar 6 17:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 91K Mar 6 17:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Mar 6 17:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 74K Mar 6 17:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Mar 15 09:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 15 09:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 09:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 09:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.1K Mar 6 17:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 50K Mar 6 17:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Mar 6 17:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 39K Mar 6 17:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 09:27 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 09:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 1.9M Mar 3 18:30 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 DLCround-PT-12b-ReachabilityFireability-2024-00
FORMULA_NAME DLCround-PT-12b-ReachabilityFireability-2024-01
FORMULA_NAME DLCround-PT-12b-ReachabilityFireability-2024-02
FORMULA_NAME DLCround-PT-12b-ReachabilityFireability-2024-03
FORMULA_NAME DLCround-PT-12b-ReachabilityFireability-2024-04
FORMULA_NAME DLCround-PT-12b-ReachabilityFireability-2024-05
FORMULA_NAME DLCround-PT-12b-ReachabilityFireability-2024-06
FORMULA_NAME DLCround-PT-12b-ReachabilityFireability-2024-07
FORMULA_NAME DLCround-PT-12b-ReachabilityFireability-2024-08
FORMULA_NAME DLCround-PT-12b-ReachabilityFireability-2024-09
FORMULA_NAME DLCround-PT-12b-ReachabilityFireability-2024-10
FORMULA_NAME DLCround-PT-12b-ReachabilityFireability-2024-11
FORMULA_NAME DLCround-PT-12b-ReachabilityFireability-2024-12
FORMULA_NAME DLCround-PT-12b-ReachabilityFireability-2024-13
FORMULA_NAME DLCround-PT-12b-ReachabilityFireability-2024-14
FORMULA_NAME DLCround-PT-12b-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1779647851782

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DLCround-PT-12b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202604301425
[2026-05-24 18:37:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-24 18:37:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 18:37:33] [INFO ] Load time of PNML (sax parser for PT used): 276 ms
[2026-05-24 18:37:33] [INFO ] Transformed 4848 places.
[2026-05-24 18:37:33] [INFO ] Transformed 7836 transitions.
[2026-05-24 18:37:33] [INFO ] Found NUPN structural information;
[2026-05-24 18:37:33] [INFO ] Parsed PT model containing 4848 places and 7836 transitions and 22188 arcs in 508 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (8 resets) in 2196 ms. (18 steps per ms) remains 7/16 properties
FORMULA DLCround-PT-12b-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-12b-ReachabilityFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-12b-ReachabilityFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-12b-ReachabilityFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-12b-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-12b-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-12b-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-12b-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-12b-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 174 ms. (228 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 472 ms. (84 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 274 ms. (145 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 133 ms. (298 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (8 resets) in 446 ms. (89 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 128 ms. (310 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 259 ms. (153 steps per ms) remains 7/7 properties
[2026-05-24 18:37:34] [INFO ] Flatten gal took : 715 ms
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10277657717755888466.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6961880940902706750.kers'
[2026-05-24 18:37:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10277657717755888466.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6961880940902706750.kers]
Culled 0 columns in 4 ms.
// Phase 1: matrix 7836 rows 4848 cols 22188 entries
Finished phase 1 with 4571 SingleSign rule and 0 generalized
[2026-05-24 18:37:35] [INFO ] Computed 277 invariants in 66 ms
Computed 277 P flows in 69 ms.
Exported basis to /tmp/petrispot-output-6961880940902706750.kers
Total runtime 76 ms.
[2026-05-24 18:37:35] [INFO ] Flatten gal took : 206 ms
[2026-05-24 18:37:35] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7436239553095233524.gal : 144 ms
[2026-05-24 18:37:35] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7608038114500197996.prop : 1 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/ReachabilityCardinality7436239553095233524.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7608038114500197996.prop' '--nowitness' '--gen-order' 'FOLLOW'
Excessive predecessor constraint size, skipping predecessor.

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 ...328
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 88/88 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Loading property file /tmp/ReachabilityCardinality7608038114500197996.prop.
At refinement iteration 2 (OVERLAPS) 3647/3735 variables, 186/274 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3735 variables, 3647/3921 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3735 variables, 0/3921 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 1113/4848 variables, 91/4012 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4848 variables, 1113/5125 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4848/12684 variables, and 5125 constraints, problems are : Problem set: 0 solved, 7 unsolved in 5035 ms.
Refiners :[Domain max(s): 4848/4848 constraints, Positive P Invariants (semi-flows): 277/277 constraints, State Equation: 0/4848 constraints, PredecessorRefiner: 7/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 88/88 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 3647/3735 variables, 186/274 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3735 variables, 3647/3921 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3735/12684 variables, and 3925 constraints, problems are : Problem set: 0 solved, 7 unsolved in 5045 ms.
Refiners :[Domain max(s): 3735/4848 constraints, Positive P Invariants (semi-flows): 186/277 constraints, State Equation: 0/4848 constraints, PredecessorRefiner: 2/5 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10466ms problems are : Problem set: 0 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 88 out of 4848 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4848/4848 places, 7836/7836 transitions.
Graph (trivial) has 4271 edges and 4848 vertex of which 696 / 4848 are part of one of the 54 SCC in 21 ms
Free SCC test removed 642 places
Drop transitions (Empty/Sink Transition effects.) removed 719 transitions
Reduce isomorphic transitions removed 719 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1691 transitions
Trivial Post-agglo rules discarded 1691 transitions
Performed 1691 trivial Post agglomeration. Transition count delta: 1691
Iterating post reduction 0 with 1691 rules applied. Total rules applied 1692 place count 4206 transition count 5426
Reduce places removed 1691 places and 0 transitions.
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 47 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 1 with 1772 rules applied. Total rules applied 3464 place count 2515 transition count 5345
Reduce places removed 34 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 38 rules applied. Total rules applied 3502 place count 2481 transition count 5341
Reduce places removed 2 places and 0 transitions.
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Iterating post reduction 3 with 24 rules applied. Total rules applied 3526 place count 2479 transition count 5319
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 4 with 22 rules applied. Total rules applied 3548 place count 2457 transition count 5319
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 47 Pre rules applied. Total rules applied 3548 place count 2457 transition count 5272
Deduced a syphon composed of 47 places in 42 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 5 with 94 rules applied. Total rules applied 3642 place count 2410 transition count 5272
Discarding 654 places :
Symmetric choice reduction at 5 with 654 rule applications. Total rules 4296 place count 1756 transition count 4618
Iterating global reduction 5 with 654 rules applied. Total rules applied 4950 place count 1756 transition count 4618
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 5 with 8 rules applied. Total rules applied 4958 place count 1756 transition count 4610
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 4964 place count 1752 transition count 4608
Performed 273 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 273 Pre rules applied. Total rules applied 4964 place count 1752 transition count 4335
Deduced a syphon composed of 273 places in 26 ms
Reduce places removed 273 places and 0 transitions.
Iterating global reduction 7 with 546 rules applied. Total rules applied 5510 place count 1479 transition count 4335
Discarding 67 places :
Symmetric choice reduction at 7 with 67 rule applications. Total rules 5577 place count 1412 transition count 3275
Iterating global reduction 7 with 67 rules applied. Total rules applied 5644 place count 1412 transition count 3275
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 7 with 19 rules applied. Total rules applied 5663 place count 1412 transition count 3256
Performed 363 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 363 places in 3 ms
Reduce places removed 363 places and 0 transitions.
Iterating global reduction 8 with 726 rules applied. Total rules applied 6389 place count 1049 transition count 2883
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 8 with 8 rules applied. Total rules applied 6397 place count 1049 transition count 2875
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 6400 place count 1046 transition count 2827
Iterating global reduction 9 with 3 rules applied. Total rules applied 6403 place count 1046 transition count 2827
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: -362
Deduced a syphon composed of 41 places in 2 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 9 with 82 rules applied. Total rules applied 6485 place count 1005 transition count 3189
Drop transitions (Empty/Sink Transition effects.) removed 39 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 43 transitions.
Iterating post reduction 9 with 43 rules applied. Total rules applied 6528 place count 1005 transition count 3146
Discarding 4 places :
Symmetric choice reduction at 10 with 4 rule applications. Total rules 6532 place count 1001 transition count 3035
Iterating global reduction 10 with 4 rules applied. Total rules applied 6536 place count 1001 transition count 3035
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 10 with 3 rules applied. Total rules applied 6539 place count 1001 transition count 3032
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -36
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 11 with 6 rules applied. Total rules applied 6545 place count 998 transition count 3068
Drop transitions (Redundant composition of simpler transitions.) removed 84 transitions
Redundant transition composition rules discarded 84 transitions
Iterating global reduction 11 with 84 rules applied. Total rules applied 6629 place count 998 transition count 2984
Discarding 10 places :
Symmetric choice reduction at 11 with 10 rule applications. Total rules 6639 place count 988 transition count 2974
Iterating global reduction 11 with 10 rules applied. Total rules applied 6649 place count 988 transition count 2974
Discarding 10 places :
Symmetric choice reduction at 11 with 10 rule applications. Total rules 6659 place count 978 transition count 2787
Iterating global reduction 11 with 10 rules applied. Total rules applied 6669 place count 978 transition count 2787
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 11 with 10 rules applied. Total rules applied 6679 place count 978 transition count 2777
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 12 with 26 rules applied. Total rules applied 6705 place count 965 transition count 2764
Discarding 12 places :
Symmetric choice reduction at 12 with 12 rule applications. Total rules 6717 place count 953 transition count 2550
Iterating global reduction 12 with 12 rules applied. Total rules applied 6729 place count 953 transition count 2550
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 12 with 8 rules applied. Total rules applied 6737 place count 953 transition count 2542
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 13 with 4 rules applied. Total rules applied 6741 place count 951 transition count 2563
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 13 with 2 rules applied. Total rules applied 6743 place count 951 transition count 2561
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 14 with 7 rules applied. Total rules applied 6750 place count 951 transition count 2554
Free-agglomeration rule applied 476 times with reduction of 207 identical transitions.
Iterating global reduction 14 with 476 rules applied. Total rules applied 7226 place count 951 transition count 1871
Reduce places removed 476 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 567 transitions
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 579 transitions.
Graph (complete) has 1604 edges and 475 vertex of which 461 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.1 ms
Discarding 14 places :
Also discarding 0 output transitions
Iterating post reduction 14 with 1056 rules applied. Total rules applied 8282 place count 461 transition count 1292
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 15 with 5 rules applied. Total rules applied 8287 place count 461 transition count 1287
Discarding 66 places :
Symmetric choice reduction at 16 with 66 rule applications. Total rules 8353 place count 395 transition count 1126
Iterating global reduction 16 with 66 rules applied. Total rules applied 8419 place count 395 transition count 1126
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -40
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 16 with 8 rules applied. Total rules applied 8427 place count 391 transition count 1166
Drop transitions (Empty/Sink Transition effects.) removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 16 with 40 rules applied. Total rules applied 8467 place count 391 transition count 1126
Drop transitions (Redundant composition of simpler transitions.) removed 98 transitions
Redundant transition composition rules discarded 98 transitions
Iterating global reduction 17 with 98 rules applied. Total rules applied 8565 place count 391 transition count 1028
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 1296 edges and 389 vertex of which 387 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Iterating post reduction 17 with 3 rules applied. Total rules applied 8568 place count 387 transition count 1028
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 18 with 3 rules applied. Total rules applied 8571 place count 387 transition count 1025
Discarding 24 places :
Symmetric choice reduction at 19 with 24 rule applications. Total rules 8595 place count 363 transition count 968
Iterating global reduction 19 with 24 rules applied. Total rules applied 8619 place count 363 transition count 968
Free-agglomeration rule applied 1 times.
Iterating global reduction 19 with 1 rules applied. Total rules applied 8620 place count 363 transition count 967
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 19 with 11 rules applied. Total rules applied 8631 place count 362 transition count 957
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 20 with 1 rules applied. Total rules applied 8632 place count 362 transition count 965
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 20 with 9 rules applied. Total rules applied 8641 place count 361 transition count 957
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 21 with 5 rules applied. Total rules applied 8646 place count 361 transition count 957
Applied a total of 8646 rules in 1919 ms. Remains 361 /4848 variables (removed 4487) and now considering 957/7836 (removed 6879) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1925 ms. Remains : 361/4848 places, 957/7836 transitions.
RANDOM walk for 40000 steps (8 resets) in 1619 ms. (24 steps per ms) remains 2/7 properties
FORMULA DLCround-PT-12b-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-12b-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-12b-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-12b-ReachabilityFireability-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-12b-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 282 ms. (141 steps per ms) remains 1/2 properties
FORMULA DLCround-PT-12b-ReachabilityFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 215 ms. (185 steps per ms) remains 1/1 properties
[2026-05-24 18:37:47] [INFO ] Flow matrix only has 559 transitions (discarded 398 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13371868744780337038.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13687140222527108327.kers'
[2026-05-24 18:37:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13371868744780337038.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13687140222527108327.kers]
Culling duplicate invariants (modulo rational): removing 82 columns.
Culled 82 columns in 0 ms.
// Phase 1: matrix 559 rows 279 cols 2822 entries
Finished phase 1 with 188 SingleSign rule and 0 generalized
[2026-05-24 18:37:47] [INFO ] Computed 173 invariants in 3 ms
Computed 173 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-13687140222527108327.kers
Total runtime 4 ms.
[2026-05-24 18:37:47] [INFO ] State equation strengthened by 134 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 180/216 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/216 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 82/298 variables, 46/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/298 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 61/359 variables, 61/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/359 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 557/916 variables, 359/532 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/916 variables, 134/666 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/916 variables, 0/666 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/918 variables, 1/667 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/918 variables, 0/667 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/920 variables, 1/668 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/920 variables, 0/668 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/920 variables, 0/668 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 920/920 variables, and 668 constraints, problems are : Problem set: 0 solved, 1 unsolved in 771 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 61/61 constraints, State Equation: 361/361 constraints, ReadFeed: 134/134 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/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 180/216 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/216 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 82/298 variables, 46/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/298 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 61/359 variables, 61/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/359 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 557/916 variables, 359/532 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/916 variables, 134/666 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/916 variables, 0/666 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/918 variables, 1/667 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/918 variables, 0/667 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/920 variables, 1/668 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/920 variables, 0/668 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/920 variables, 0/668 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 920/920 variables, and 668 constraints, problems are : Problem set: 0 solved, 1 unsolved in 512 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 61/61 constraints, State Equation: 361/361 constraints, ReadFeed: 134/134 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1317ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 45 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=45 )
FORMULA DLCround-PT-12b-ReachabilityFireability-2024-14 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 8 ms.
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 16361 ms.

BK_STOP 1779647869317

--------------------
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
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -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="DLCround-PT-12b"
export BK_EXAMINATION="ReachabilityFireability"
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 DLCround-PT-12b, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r098-tall-177955695700663"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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