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

About the Execution of ITS-Tools for FireWire-PT-18

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
3226.915 214070.00 324512.00 583.50 TTTTTFFTFTFTTTTT 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.r130-smll-177955809000287.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 FireWire-PT-18, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r130-smll-177955809000287
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 636K
-rw-r--r-- 1 mcc users 7.9K Mar 7 05:17 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Mar 7 05:17 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Mar 7 05:17 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Mar 7 05:17 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 15 10:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 10:09 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 10:09 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 10:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Mar 7 05:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 143K Mar 7 05:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Mar 7 05:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K Mar 7 05:17 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 10:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 10:09 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 168K 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 FireWire-PT-18-ReachabilityFireability-2024-00
FORMULA_NAME FireWire-PT-18-ReachabilityFireability-2024-01
FORMULA_NAME FireWire-PT-18-ReachabilityFireability-2024-02
FORMULA_NAME FireWire-PT-18-ReachabilityFireability-2024-03
FORMULA_NAME FireWire-PT-18-ReachabilityFireability-2024-04
FORMULA_NAME FireWire-PT-18-ReachabilityFireability-2024-05
FORMULA_NAME FireWire-PT-18-ReachabilityFireability-2024-06
FORMULA_NAME FireWire-PT-18-ReachabilityFireability-2024-07
FORMULA_NAME FireWire-PT-18-ReachabilityFireability-2024-08
FORMULA_NAME FireWire-PT-18-ReachabilityFireability-2024-09
FORMULA_NAME FireWire-PT-18-ReachabilityFireability-2024-10
FORMULA_NAME FireWire-PT-18-ReachabilityFireability-2024-11
FORMULA_NAME FireWire-PT-18-ReachabilityFireability-2024-12
FORMULA_NAME FireWire-PT-18-ReachabilityFireability-2024-13
FORMULA_NAME FireWire-PT-18-ReachabilityFireability-2024-14
FORMULA_NAME FireWire-PT-18-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1779843585121

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-18
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202604301425
[2026-05-27 00:59:47] [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-27 00:59:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-27 00:59:48] [INFO ] Load time of PNML (sax parser for PT used): 264 ms
[2026-05-27 00:59:48] [INFO ] Transformed 437 places.
[2026-05-27 00:59:48] [INFO ] Transformed 707 transitions.
[2026-05-27 00:59:48] [INFO ] Found NUPN structural information;
[2026-05-27 00:59:48] [INFO ] Parsed PT model containing 437 places and 707 transitions and 2170 arcs in 506 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 30 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (15 resets) in 2598 ms. (15 steps per ms) remains 14/16 properties
FORMULA FireWire-PT-18-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FireWire-PT-18-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2026-05-27 00:59:49] [INFO ] Flatten gal took : 437 ms
BEST_FIRST walk for 40000 steps (16 resets) in 1437 ms. (27 steps per ms) remains 14/14 properties
[2026-05-27 00:59:49] [INFO ] Flatten gal took : 342 ms
BEST_FIRST walk for 40000 steps (19 resets) in 931 ms. (42 steps per ms) remains 14/14 properties
[2026-05-27 00:59:50] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8268733108461192897.gal : 98 ms
[2026-05-27 00:59:50] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10327984511880109502.prop : 12 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/ReachabilityCardinality8268733108461192897.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10327984511880109502.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40000 steps (13 resets) in 475 ms. (84 steps per ms) remains 14/14 properties

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 ...329
Loading property file /tmp/ReachabilityCardinality10327984511880109502.prop.
BEST_FIRST walk for 40000 steps (22 resets) in 610 ms. (65 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (8 resets) in 645 ms. (61 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (12 resets) in 715 ms. (55 steps per ms) remains 14/14 properties
SDD proceeding with computation,14 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,14 properties remain. new max is 8
SDD size :3 after 6
SDD proceeding with computation,14 properties remain. new max is 16
SDD size :6 after 16
SDD proceeding with computation,14 properties remain. new max is 32
SDD size :16 after 45
SDD proceeding with computation,14 properties remain. new max is 64
SDD size :45 after 411
SDD proceeding with computation,14 properties remain. new max is 128
SDD size :411 after 866
SDD proceeding with computation,14 properties remain. new max is 256
SDD size :866 after 3489
BEST_FIRST walk for 40000 steps (13 resets) in 758 ms. (52 steps per ms) remains 14/14 properties
SDD proceeding with computation,14 properties remain. new max is 512
SDD size :3489 after 7751
SDD proceeding with computation,14 properties remain. new max is 1024
SDD size :7751 after 23681
BEST_FIRST walk for 40000 steps (9 resets) in 402 ms. (99 steps per ms) remains 14/14 properties
SDD proceeding with computation,14 properties remain. new max is 2048
SDD size :23681 after 31894
BEST_FIRST walk for 40000 steps (19 resets) in 401 ms. (99 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40001 steps (20 resets) in 330 ms. (120 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40000 steps (12 resets) in 276 ms. (144 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (13 resets) in 254 ms. (156 steps per ms) remains 14/14 properties
SDD proceeding with computation,14 properties remain. new max is 4096
SDD size :31894 after 54516
BEST_FIRST walk for 40001 steps (11 resets) in 256 ms. (155 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40000 steps (20 resets) in 247 ms. (161 steps per ms) remains 14/14 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9474976533078046480.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10215137508416030272.kers'
[2026-05-27 00:59:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9474976533078046480.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10215137508416030272.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 707 rows 437 cols 2170 entries
Finished phase 1 with 428 SingleSign rule and 0 generalized
[2026-05-27 00:59:51] [INFO ] Computed 9 invariants in 6 ms
Computed 9 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-10215137508416030272.kers
Total runtime 9 ms.
Excessive predecessor constraint size, skipping predecessor.
SDD proceeding with computation,14 properties remain. new max is 8192
SDD size :54516 after 79984
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 166/166 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/166 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Problem FireWire-PT-18-ReachabilityFireability-2024-05 is UNSAT
FORMULA FireWire-PT-18-ReachabilityFireability-2024-05 FALSE TECHNIQUES SMT_REFINEMENT
Problem FireWire-PT-18-ReachabilityFireability-2024-06 is UNSAT
FORMULA FireWire-PT-18-ReachabilityFireability-2024-06 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 271/437 variables, 9/175 constraints. Problems are: Problem set: 2 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/437 variables, 271/446 constraints. Problems are: Problem set: 2 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/437 variables, 0/446 constraints. Problems are: Problem set: 2 solved, 12 unsolved
Invariant property FireWire-PT-18-ReachabilityFireability-2024-08 does not hold.
FORMULA FireWire-PT-18-ReachabilityFireability-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,13 properties remain. new max is 8192
SDD size :79984 after 310416
At refinement iteration 5 (OVERLAPS) 707/1144 variables, 437/883 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1144 variables, 0/883 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 0/1144 variables, 0/883 constraints. Problems are: Problem set: 3 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1144/1144 variables, and 883 constraints, problems are : Problem set: 3 solved, 11 unsolved in 3107 ms.
Refiners :[Domain max(s): 437/437 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 437/437 constraints, PredecessorRefiner: 14/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 117/117 constraints. Problems are: Problem set: 3 solved, 11 unsolved
Reachability property FireWire-PT-18-ReachabilityFireability-2024-11 is true.
FORMULA FireWire-PT-18-ReachabilityFireability-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Reachability property FireWire-PT-18-ReachabilityFireability-2024-03 is true.
FORMULA FireWire-PT-18-ReachabilityFireability-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,11 properties remain. new max is 8192
SDD size :310416 after 714487
At refinement iteration 1 (INCLUDED_ONLY) 0/117 variables, 0/117 constraints. Problems are: Problem set: 5 solved, 9 unsolved
Problem FireWire-PT-18-ReachabilityFireability-2024-00 is UNSAT
FORMULA FireWire-PT-18-ReachabilityFireability-2024-00 TRUE TECHNIQUES SMT_REFINEMENT
Problem FireWire-PT-18-ReachabilityFireability-2024-13 is UNSAT
FORMULA FireWire-PT-18-ReachabilityFireability-2024-13 TRUE TECHNIQUES SMT_REFINEMENT
Problem FireWire-PT-18-ReachabilityFireability-2024-14 is UNSAT
FORMULA FireWire-PT-18-ReachabilityFireability-2024-14 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 320/437 variables, 9/126 constraints. Problems are: Problem set: 8 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/437 variables, 320/446 constraints. Problems are: Problem set: 8 solved, 6 unsolved
SDD proceeding with computation,11 properties remain. new max is 16384
SDD size :714487 after 1.09878e+06
At refinement iteration 4 (INCLUDED_ONLY) 0/437 variables, 5/451 constraints. Problems are: Problem set: 8 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 1/452 constraints. Problems are: Problem set: 8 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/437 variables, 3/455 constraints. Problems are: Problem set: 8 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/437 variables, 0/455 constraints. Problems are: Problem set: 8 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 707/1144 variables, 437/892 constraints. Problems are: Problem set: 8 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1144 variables, 4/896 constraints. Problems are: Problem set: 8 solved, 6 unsolved
Reachability property FireWire-PT-18-ReachabilityFireability-2024-09 is true.
FORMULA FireWire-PT-18-ReachabilityFireability-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Reachability property FireWire-PT-18-ReachabilityFireability-2024-02 is true.
FORMULA FireWire-PT-18-ReachabilityFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,9 properties remain. new max is 16384
SDD size :1.09878e+06 after 1.71508e+06
At refinement iteration 10 (INCLUDED_ONLY) 0/1144 variables, 0/896 constraints. Problems are: Problem set: 10 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1144/1144 variables, and 896 constraints, problems are : Problem set: 10 solved, 4 unsolved in 5008 ms.
Refiners :[Domain max(s): 437/437 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 437/437 constraints, PredecessorRefiner: 8/7 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8386ms problems are : Problem set: 10 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 27 out of 437 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 437/437 places, 707/707 transitions.
Graph (trivial) has 282 edges and 437 vertex of which 9 / 437 are part of one of the 2 SCC in 12 ms
Free SCC test removed 7 places
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (complete) has 1272 edges and 430 vertex of which 420 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.3 ms
Discarding 10 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 0 with 64 rules applied. Total rules applied 66 place count 420 transition count 633
Reduce places removed 62 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 64 rules applied. Total rules applied 130 place count 358 transition count 631
Reduce places removed 1 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 2 with 6 rules applied. Total rules applied 136 place count 357 transition count 626
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 141 place count 352 transition count 626
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 12 Pre rules applied. Total rules applied 141 place count 352 transition count 614
Deduced a syphon composed of 12 places in 2 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 165 place count 340 transition count 614
Discarding 67 places :
Symmetric choice reduction at 4 with 67 rule applications. Total rules 232 place count 273 transition count 546
Iterating global reduction 4 with 67 rules applied. Total rules applied 299 place count 273 transition count 546
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 301 place count 273 transition count 544
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 6 Pre rules applied. Total rules applied 301 place count 273 transition count 538
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 313 place count 267 transition count 538
Discarding 16 places :
Symmetric choice reduction at 5 with 16 rule applications. Total rules 329 place count 251 transition count 516
Iterating global reduction 5 with 16 rules applied. Total rules applied 345 place count 251 transition count 516
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 350 place count 246 transition count 508
Iterating global reduction 5 with 5 rules applied. Total rules applied 355 place count 246 transition count 508
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 5 with 4 rules applied. Total rules applied 359 place count 246 transition count 504
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 361 place count 244 transition count 504
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 362 place count 243 transition count 501
Iterating global reduction 7 with 1 rules applied. Total rules applied 363 place count 243 transition count 501
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 364 place count 242 transition count 499
Iterating global reduction 7 with 1 rules applied. Total rules applied 365 place count 242 transition count 499
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 366 place count 241 transition count 496
Iterating global reduction 7 with 1 rules applied. Total rules applied 367 place count 241 transition count 496
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 368 place count 240 transition count 494
Iterating global reduction 7 with 1 rules applied. Total rules applied 369 place count 240 transition count 494
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 370 place count 239 transition count 491
Iterating global reduction 7 with 1 rules applied. Total rules applied 371 place count 239 transition count 491
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 372 place count 238 transition count 489
Iterating global reduction 7 with 1 rules applied. Total rules applied 373 place count 238 transition count 489
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 374 place count 237 transition count 486
Iterating global reduction 7 with 1 rules applied. Total rules applied 375 place count 237 transition count 486
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 376 place count 236 transition count 484
Iterating global reduction 7 with 1 rules applied. Total rules applied 377 place count 236 transition count 484
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 378 place count 235 transition count 481
Iterating global reduction 7 with 1 rules applied. Total rules applied 379 place count 235 transition count 481
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 380 place count 234 transition count 479
Iterating global reduction 7 with 1 rules applied. Total rules applied 381 place count 234 transition count 479
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 1 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 7 with 62 rules applied. Total rules applied 443 place count 203 transition count 448
Performed 28 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 7 with 56 rules applied. Total rules applied 499 place count 175 transition count 620
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 7 with 12 rules applied. Total rules applied 511 place count 175 transition count 608
Free-agglomeration rule applied 14 times.
Iterating global reduction 7 with 14 rules applied. Total rules applied 525 place count 175 transition count 594
Reduce places removed 14 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 18 rules applied. Total rules applied 543 place count 161 transition count 590
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 547 place count 157 transition count 586
Iterating global reduction 8 with 4 rules applied. Total rules applied 551 place count 157 transition count 586
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 8 with 12 rules applied. Total rules applied 563 place count 157 transition count 574
Drop transitions (Redundant composition of simpler transitions.) removed 61 transitions
Redundant transition composition rules discarded 61 transitions
Iterating global reduction 9 with 61 rules applied. Total rules applied 624 place count 157 transition count 513
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 625 place count 157 transition count 513
Applied a total of 625 rules in 446 ms. Remains 157 /437 variables (removed 280) and now considering 513/707 (removed 194) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 456 ms. Remains : 157/437 places, 513/707 transitions.
RANDOM walk for 40000 steps (76 resets) in 636 ms. (62 steps per ms) remains 3/4 properties
FORMULA FireWire-PT-18-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40000 steps (63 resets) in 435 ms. (91 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40000 steps (43 resets) in 281 ms. (141 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40000 steps (59 resets) in 298 ms. (133 steps per ms) remains 3/3 properties
[2026-05-27 01:00:01] [INFO ] Flow matrix only has 498 transitions (discarded 15 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4974449777857826897.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-735317311873184306.kers'
[2026-05-27 01:00:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4974449777857826897.kers, --Pflows, --basisKERS=/tmp/petrispot-output-735317311873184306.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 498 rows 157 cols 1787 entries
Finished phase 1 with 150 SingleSign rule and 0 generalized
[2026-05-27 01:00:01] [INFO ] Computed 7 invariants in 7 ms
Computed 7 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-735317311873184306.kers
Total runtime 8 ms.
[2026-05-27 01:00:01] [INFO ] State equation strengthened by 67 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 114/140 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/140 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 8/148 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/148 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 498/646 variables, 148/155 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/646 variables, 67/222 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/646 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 9/655 variables, 9/231 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/655 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/655 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 655/655 variables, and 231 constraints, problems are : Problem set: 0 solved, 3 unsolved in 413 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 157/157 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 3/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 114/140 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/140 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/140 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 8/148 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/148 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/148 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 498/646 variables, 148/159 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/646 variables, 67/226 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/646 variables, 2/228 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/646 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 9/655 variables, 9/237 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/655 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 3 unsolved
SDD proceeding with computation,9 properties remain. new max is 32768
SDD size :1.71508e+06 after 2.41695e+06
At refinement iteration 13 (OVERLAPS) 0/655 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 655/655 variables, and 237 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1424 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 157/157 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 3/2 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1880ms problems are : Problem set: 0 solved, 3 unsolved
FORMULA FireWire-PT-18-ReachabilityFireability-2024-15 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 236 ms.
Support contains 24 out of 157 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 513/513 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 157 transition count 512
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 156 transition count 512
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 156 transition count 511
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 155 transition count 510
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 155 transition count 510
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 154 transition count 514
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 10 place count 154 transition count 511
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 154 transition count 510
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 43 place count 153 transition count 479
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 46 place count 153 transition count 476
Applied a total of 46 rules in 87 ms. Remains 153 /157 variables (removed 4) and now considering 476/513 (removed 37) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 87 ms. Remains : 153/157 places, 476/513 transitions.
RANDOM walk for 40000 steps (35 resets) in 240 ms. (165 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (41 resets) in 212 ms. (187 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (40 resets) in 203 ms. (196 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 889812 steps, run timeout after 3001 ms. (steps per millisecond=296 ) properties seen :1 out of 2
Probabilistic random walk after 889812 steps, saw 225679 distinct states, run finished after 3011 ms. (steps per millisecond=295 ) properties seen :1
FORMULA FireWire-PT-18-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
[2026-05-27 01:00:06] [INFO ] Flow matrix only has 459 transitions (discarded 17 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11456433763439211946.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11128411356931575010.kers'
[2026-05-27 01:00:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11456433763439211946.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11128411356931575010.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 459 rows 153 cols 1643 entries
Finished phase 1 with 146 SingleSign rule and 0 generalized
[2026-05-27 01:00:06] [INFO ] Computed 7 invariants in 3 ms
Computed 7 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-11128411356931575010.kers
Total runtime 4 ms.
[2026-05-27 01:00:06] [INFO ] State equation strengthened by 66 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 123/126 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 17/143 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 456/599 variables, 143/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/599 variables, 66/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/599 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 12/611 variables, 9/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/611 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/612 variables, 1/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/612 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/612 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 612/612 variables, and 226 constraints, problems are : Problem set: 0 solved, 1 unsolved in 289 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 153/153 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 1/1 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 123/126 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 17/143 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 456/599 variables, 143/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/599 variables, 66/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/599 variables, 1/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/599 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 12/611 variables, 9/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/611 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/612 variables, 1/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/612 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/612 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 612/612 variables, and 227 constraints, problems are : Problem set: 0 solved, 1 unsolved in 458 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 153/153 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 773ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 11 ms.
Support contains 3 out of 153 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 153/153 places, 476/476 transitions.
Graph (trivial) has 30 edges and 153 vertex of which 2 / 153 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 1 place count 152 transition count 470
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 9 place count 148 transition count 470
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 10 place count 148 transition count 469
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 12 place count 146 transition count 464
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 146 transition count 464
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 145 transition count 462
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 145 transition count 462
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 1 with 8 rules applied. Total rules applied 24 place count 141 transition count 458
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 140 transition count 457
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 140 transition count 457
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 139 transition count 451
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 139 transition count 451
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 138 transition count 449
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 138 transition count 449
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 137 transition count 446
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 137 transition count 446
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 33 place count 136 transition count 444
Iterating global reduction 1 with 1 rules applied. Total rules applied 34 place count 136 transition count 444
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 35 place count 135 transition count 441
Iterating global reduction 1 with 1 rules applied. Total rules applied 36 place count 135 transition count 441
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 37 place count 134 transition count 439
Iterating global reduction 1 with 1 rules applied. Total rules applied 38 place count 134 transition count 439
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 39 place count 133 transition count 436
Iterating global reduction 1 with 1 rules applied. Total rules applied 40 place count 133 transition count 436
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 41 place count 132 transition count 434
Iterating global reduction 1 with 1 rules applied. Total rules applied 42 place count 132 transition count 434
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 43 place count 131 transition count 431
Iterating global reduction 1 with 1 rules applied. Total rules applied 44 place count 131 transition count 431
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 45 place count 130 transition count 429
Iterating global reduction 1 with 1 rules applied. Total rules applied 46 place count 130 transition count 429
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 47 place count 129 transition count 427
Iterating global reduction 1 with 1 rules applied. Total rules applied 48 place count 129 transition count 427
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 49 place count 128 transition count 425
Iterating global reduction 1 with 1 rules applied. Total rules applied 50 place count 128 transition count 425
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 54 place count 126 transition count 426
Drop transitions (Redundant composition of simpler transitions.) removed 30 transitions
Redundant transition composition rules discarded 30 transitions
Iterating global reduction 1 with 30 rules applied. Total rules applied 84 place count 126 transition count 396
Free-agglomeration rule applied 5 times.
Iterating global reduction 1 with 5 rules applied. Total rules applied 89 place count 126 transition count 391
Reduce places removed 5 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 100 place count 121 transition count 385
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 2 with 11 rules applied. Total rules applied 111 place count 121 transition count 374
Applied a total of 111 rules in 98 ms. Remains 121 /153 variables (removed 32) and now considering 374/476 (removed 102) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 100 ms. Remains : 121/153 places, 374/476 transitions.
RANDOM walk for 40000 steps (2000 resets) in 604 ms. (66 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (11 resets) in 363 ms. (109 steps per ms) remains 1/1 properties
SDD proceeding with computation,9 properties remain. new max is 65536
SDD size :2.41695e+06 after 6.54052e+06
Interrupted probabilistic random walk after 1079306 steps, run timeout after 3001 ms. (steps per millisecond=359 ) properties seen :0 out of 1
Probabilistic random walk after 1079306 steps, saw 290207 distinct states, run finished after 3001 ms. (steps per millisecond=359 ) properties seen :0
[2026-05-27 01:00:10] [INFO ] Flow matrix only has 334 transitions (discarded 40 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13334850201290727789.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5845382677868329042.kers'
[2026-05-27 01:00:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13334850201290727789.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5845382677868329042.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 334 rows 121 cols 1198 entries
Finished phase 1 with 114 SingleSign rule and 0 generalized
[2026-05-27 01:00:10] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5845382677868329042.kers
Total runtime 2 ms.
[2026-05-27 01:00:10] [INFO ] State equation strengthened by 65 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 96/99 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 14/113 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 334/447 variables, 113/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/447 variables, 65/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/447 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 8/455 variables, 8/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/455 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/455 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 455/455 variables, and 193 constraints, problems are : Problem set: 0 solved, 1 unsolved in 210 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 121/121 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 1/1 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 96/99 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 14/113 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 334/447 variables, 113/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/447 variables, 65/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/447 variables, 1/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/447 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 8/455 variables, 8/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/455 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/455 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 455/455 variables, and 194 constraints, problems are : Problem set: 0 solved, 1 unsolved in 301 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 121/121 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 546ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 9 ms.
Support contains 3 out of 121 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 121/121 places, 374/374 transitions.
Applied a total of 0 rules in 15 ms. Remains 121 /121 variables (removed 0) and now considering 374/374 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 121/121 places, 374/374 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 121/121 places, 374/374 transitions.
Applied a total of 0 rules in 16 ms. Remains 121 /121 variables (removed 0) and now considering 374/374 (removed 0) transitions.
[2026-05-27 01:00:11] [INFO ] Flow matrix only has 334 transitions (discarded 40 similar events)
[2026-05-27 01:00:11] [INFO ] Invariant cache hit.
[2026-05-27 01:00:11] [INFO ] Implicit Places using invariants in 183 ms returned []
[2026-05-27 01:00:11] [INFO ] Flow matrix only has 334 transitions (discarded 40 similar events)
[2026-05-27 01:00:11] [INFO ] Invariant cache hit.
[2026-05-27 01:00:11] [INFO ] State equation strengthened by 65 read => feed constraints.
[2026-05-27 01:00:11] [INFO ] Implicit Places using invariants and state equation in 319 ms returned []
Implicit Place search using SMT with State Equation took 521 ms to find 0 implicit places.
[2026-05-27 01:00:11] [INFO ] Redundant transitions in 27 ms returned []
Running 370 sub problems to find dead transitions.
[2026-05-27 01:00:11] [INFO ] Flow matrix only has 334 transitions (discarded 40 similar events)
[2026-05-27 01:00:11] [INFO ] Invariant cache hit.
[2026-05-27 01:00:11] [INFO ] State equation strengthened by 65 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 1 (OVERLAPS) 1/121 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 4 (OVERLAPS) 334/455 variables, 121/135 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/455 variables, 65/200 constraints. Problems are: Problem set: 0 solved, 370 unsolved
SDD proceeding with computation,9 properties remain. new max is 131072
SDD size :6.54052e+06 after 5.83889e+07
At refinement iteration 6 (INCLUDED_ONLY) 0/455 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 7 (OVERLAPS) 0/455 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 370 unsolved
No progress, stopping.
After SMT solving in domain Real declared 455/455 variables, and 200 constraints, problems are : Problem set: 0 solved, 370 unsolved in 19896 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 121/121 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 370/370 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 370 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 1 (OVERLAPS) 1/121 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 4 (OVERLAPS) 334/455 variables, 121/135 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/455 variables, 65/200 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/455 variables, 370/570 constraints. Problems are: Problem set: 0 solved, 370 unsolved
SDD proceeding with computation,9 properties remain. new max is 262144
SDD size :5.83889e+07 after 8.55604e+07
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 455/455 variables, and 571 constraints, problems are : Problem set: 0 solved, 370 unsolved in 30050 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 121/121 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 370/370 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 50268ms problems are : Problem set: 0 solved, 370 unsolved
Search for dead transitions found 0 dead transitions in 50274ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50873 ms. Remains : 121/121 places, 374/374 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 107 edges and 121 vertex of which 16 / 121 are part of one of the 3 SCC in 1 ms
Free SCC test removed 13 places
Drop transitions (Empty/Sink Transition effects.) removed 69 transitions
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 119 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 3 place count 106 transition count 253
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 106 transition count 253
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 15 place count 106 transition count 243
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 1 with 2 rules applied. Total rules applied 17 place count 105 transition count 242
Drop transitions (Redundant composition of simpler transitions.) removed 27 transitions
Redundant transition composition rules discarded 27 transitions
Iterating global reduction 1 with 27 rules applied. Total rules applied 44 place count 105 transition count 215
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 1 with 2 rules applied. Total rules applied 46 place count 104 transition count 216
Free-agglomeration rule applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 48 place count 104 transition count 214
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 50 place count 102 transition count 214
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 52 place count 102 transition count 212
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 58 place count 102 transition count 212
Applied a total of 58 rules in 38 ms. Remains 102 /121 variables (removed 19) and now considering 212/374 (removed 162) transitions.
Running SMT prover for 1 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14897131576885991874.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15195501100441797581.kers'
[2026-05-27 01:01:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14897131576885991874.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15195501100441797581.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 212 rows 102 cols 782 entries
Finished phase 1 with 95 SingleSign rule and 0 generalized
[2026-05-27 01:01:02] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15195501100441797581.kers
Total runtime 2 ms.
[2026-05-27 01:01:02] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-27 01:01:02] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2026-05-27 01:01:02] [INFO ] After 70ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2026-05-27 01:01:02] [INFO ] State equation strengthened by 4 read => feed constraints.
[2026-05-27 01:01:02] [INFO ] After 11ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-27 01:01:02] [INFO ] After 28ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-27 01:01:02] [INFO ] After 157ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2026-05-27 01:01:02] [INFO ] Flatten gal took : 32 ms
[2026-05-27 01:01:02] [INFO ] Flatten gal took : 26 ms
[2026-05-27 01:01:02] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality488699022112720149.gal : 10 ms
[2026-05-27 01:01:02] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2009477337715007128.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/ReachabilityCardinality488699022112720149.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2009477337715007128.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 ...327
Loading property file /tmp/ReachabilityCardinality2009477337715007128.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :7 after 21
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :21 after 28
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :28 after 86
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :86 after 176
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :176 after 538
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :538 after 1078
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1078 after 1547
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1547 after 3332
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :3332 after 19676
Invariant property FireWire-PT-18-ReachabilityFireability-2024-10 does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 2049 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,939664,0.748121,23912,2,2385,16,58971,6,0,623,83774,0
Total reachable state count : 939664

Verifying 1 reachability properties.
Invariant property FireWire-PT-18-ReachabilityFireability-2024-10 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
FireWire-PT-18-ReachabilityFireability-2024-10,78,0.756344,24048,2,282,16,58971,7,0,632,83774,0
Over-approximation ignoring read arcs solved 0 properties in 1116 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-27 01:01:03] [INFO ] Flatten gal took : 53 ms
[2026-05-27 01:01:03] [INFO ] Applying decomposition
[2026-05-27 01:01:03] [INFO ] Flatten gal took : 39 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph12579940561416832317.txt' '-o' '/tmp/graph12579940561416832317.bin' '-w' '/tmp/graph12579940561416832317.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph12579940561416832317.bin' '-l' '-1' '-v' '-w' '/tmp/graph12579940561416832317.weights' '-q' '0' '-e' '0.001'
[2026-05-27 01:01:03] [INFO ] Decomposing Gal with order
[2026-05-27 01:01:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-27 01:01:03] [INFO ] Removed a total of 668 redundant transitions.
[2026-05-27 01:01:04] [INFO ] Flatten gal took : 156 ms
[2026-05-27 01:01:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 47 labels/synchronizations in 36 ms.
[2026-05-27 01:01:04] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14726808010433152635.gal : 20 ms
[2026-05-27 01:01:04] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1966745845183021924.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/ReachabilityCardinality14726808010433152635.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1966745845183021924.prop' '--nowitness'

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 ...308
Loading property file /tmp/ReachabilityCardinality1966745845183021924.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1 after 8366
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :8366 after 95666
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :95666 after 144678
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :144678 after 472866
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :472866 after 673992
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :673992 after 1.13189e+10
Invariant property FireWire-PT-18-ReachabilityFireability-2024-10 does not hold.
FORMULA FireWire-PT-18-ReachabilityFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 4097 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,6.33708e+11,134.057,2501388,9015,411,2.39252e+06,17532,1414,2.19866e+07,165,126041,0
Total reachable state count : 633707986079

Verifying 1 reachability properties.
Invariant property FireWire-PT-18-ReachabilityFireability-2024-10 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
FireWire-PT-18-ReachabilityFireability-2024-10,1.68544e+06,134.573,2501388,369,106,2.39252e+06,17532,1428,2.19866e+07,170,126041,0
All properties solved without resorting to model-checking.
Total runtime 211481 ms.

BK_STOP 1779843799191

--------------------
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//
++ 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 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="FireWire-PT-18"
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 FireWire-PT-18, 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 r130-smll-177955809000287"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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