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

About the Execution of ITS-Tools for DES-PT-30b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
3826.880 2108093.00 2485582.00 6471.60 FTTFTFFTTTFTFTTF 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.r082-smll-177946993700407.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 DES-PT-30b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r082-smll-177946993700407
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 532K
-rw-r--r-- 1 mcc users 5.7K Mar 6 18:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Mar 6 18:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.2K Mar 6 18:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 33K Mar 6 18:26 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Mar 15 08:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 15 08:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 15 08:58 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 08:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Mar 6 18:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 140K Mar 6 18:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Mar 6 18:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Mar 6 18:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 15 08:58 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Mar 15 08:58 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 103K 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 DES-PT-30b-ReachabilityFireability-2024-00
FORMULA_NAME DES-PT-30b-ReachabilityFireability-2024-01
FORMULA_NAME DES-PT-30b-ReachabilityFireability-2024-02
FORMULA_NAME DES-PT-30b-ReachabilityFireability-2024-03
FORMULA_NAME DES-PT-30b-ReachabilityFireability-2024-04
FORMULA_NAME DES-PT-30b-ReachabilityFireability-2024-05
FORMULA_NAME DES-PT-30b-ReachabilityFireability-2024-06
FORMULA_NAME DES-PT-30b-ReachabilityFireability-2024-07
FORMULA_NAME DES-PT-30b-ReachabilityFireability-2024-08
FORMULA_NAME DES-PT-30b-ReachabilityFireability-2024-09
FORMULA_NAME DES-PT-30b-ReachabilityFireability-2024-10
FORMULA_NAME DES-PT-30b-ReachabilityFireability-2024-11
FORMULA_NAME DES-PT-30b-ReachabilityFireability-2024-12
FORMULA_NAME DES-PT-30b-ReachabilityFireability-2024-13
FORMULA_NAME DES-PT-30b-ReachabilityFireability-2024-14
FORMULA_NAME DES-PT-30b-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1779704937103

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-30b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202604301425
[2026-05-25 10:28:59] [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-25 10:28:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 10:28:59] [INFO ] Load time of PNML (sax parser for PT used): 187 ms
[2026-05-25 10:29:00] [INFO ] Transformed 399 places.
[2026-05-25 10:29:00] [INFO ] Transformed 350 transitions.
[2026-05-25 10:29:00] [INFO ] Found NUPN structural information;
[2026-05-25 10:29:00] [INFO ] Parsed PT model containing 399 places and 350 transitions and 1143 arcs in 403 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 23 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (348 resets) in 2206 ms. (18 steps per ms) remains 6/16 properties
FORMULA DES-PT-30b-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30b-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30b-ReachabilityFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30b-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30b-ReachabilityFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30b-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30b-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30b-ReachabilityFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30b-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30b-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2026-05-25 10:29:01] [INFO ] Flatten gal took : 178 ms
BEST_FIRST walk for 40003 steps (47 resets) in 297 ms. (134 steps per ms) remains 6/6 properties
[2026-05-25 10:29:01] [INFO ] Flatten gal took : 76 ms
[2026-05-25 10:29:01] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3692083135288733090.gal : 62 ms
[2026-05-25 10:29:01] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality308384956823038225.prop : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality3692083135288733090.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality308384956823038225.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40003 steps (39 resets) in 479 ms. (83 steps per ms) remains 6/6 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 ...327
Loading property file /tmp/ReachabilityCardinality308384956823038225.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :3 after 4
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :4 after 12
BEST_FIRST walk for 40004 steps (42 resets) in 1698 ms. (23 steps per ms) remains 6/6 properties
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :12 after 21
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :21 after 37
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :37 after 49
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :49 after 211
BEST_FIRST walk for 40003 steps (45 resets) in 238 ms. (167 steps per ms) remains 6/6 properties
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :211 after 1116
BEST_FIRST walk for 40003 steps (58 resets) in 299 ms. (133 steps per ms) remains 6/6 properties
SDD proceeding with computation,6 properties remain. new max is 1024
SDD size :1116 after 25170
BEST_FIRST walk for 40003 steps (58 resets) in 211 ms. (188 steps per ms) remains 6/6 properties
SDD proceeding with computation,6 properties remain. new max is 2048
SDD size :25170 after 753955
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10103263280897481919.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-927030242886192721.kers'
[2026-05-25 10:29:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10103263280897481919.kers, --Pflows, --basisKERS=/tmp/petrispot-output-927030242886192721.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 350 rows 399 cols 1143 entries
Finished phase 1 with 171 SingleSign rule and 163 generalized
[2026-05-25 10:29:02] [INFO ] Computed 65 invariants in 3 ms
Computed 65 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-927030242886192721.kers
Total runtime 4 ms.
Excessive predecessor constraint size, skipping predecessor.
SDD proceeding with computation,6 properties remain. new max is 4096
SDD size :753955 after 2.30969e+07
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 87/87 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 255/342 variables, 39/126 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/342 variables, 255/381 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/342 variables, 3/384 constraints. Problems are: Problem set: 0 solved, 6 unsolved
SDD proceeding with computation,6 properties remain. new max is 8192
SDD size :2.30969e+07 after 1.91391e+08
At refinement iteration 5 (INCLUDED_ONLY) 0/342 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 13/355 variables, 2/386 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/355 variables, 13/399 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/355 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem DES-PT-30b-ReachabilityFireability-2024-06 is UNSAT
FORMULA DES-PT-30b-ReachabilityFireability-2024-06 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 9 (OVERLAPS) 43/398 variables, 20/419 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/398 variables, 43/462 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/398 variables, 0/462 constraints. Problems are: Problem set: 1 solved, 5 unsolved
SDD proceeding with computation,6 properties remain. new max is 16384
SDD size :1.91391e+08 after 5.8765e+08
At refinement iteration 12 (OVERLAPS) 1/399 variables, 1/463 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/399 variables, 1/464 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/399 variables, 0/464 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 350/749 variables, 399/863 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/749 variables, 0/863 constraints. Problems are: Problem set: 1 solved, 5 unsolved
SDD proceeding with computation,6 properties remain. new max is 32768
SDD size :5.8765e+08 after 4.25006e+13
At refinement iteration 17 (OVERLAPS) 0/749 variables, 0/863 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 749/749 variables, and 863 constraints, problems are : Problem set: 1 solved, 5 unsolved in 5037 ms.
Refiners :[Domain max(s): 399/399 constraints, Positive P Invariants (semi-flows): 41/41 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 399/399 constraints, PredecessorRefiner: 6/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 62/62 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 0/62 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 270/332 variables, 38/100 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/332 variables, 270/370 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/332 variables, 2/372 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/332 variables, 5/377 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/332 variables, 2/379 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/332 variables, 3/382 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/332 variables, 0/382 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 20/352 variables, 3/385 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/352 variables, 20/405 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/352 variables, 0/405 constraints. Problems are: Problem set: 1 solved, 5 unsolved
Problem DES-PT-30b-ReachabilityFireability-2024-08 is UNSAT
FORMULA DES-PT-30b-ReachabilityFireability-2024-08 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 12 (OVERLAPS) 46/398 variables, 21/426 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/398 variables, 46/472 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/398 variables, 2/474 constraints. Problems are: Problem set: 2 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 398/749 variables, and 474 constraints, problems are : Problem set: 2 solved, 4 unsolved in 5010 ms.
Refiners :[Domain max(s): 398/399 constraints, Positive P Invariants (semi-flows): 41/41 constraints, Generalized P Invariants (flows): 23/24 constraints, State Equation: 0/399 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10242ms problems are : Problem set: 2 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 47 out of 399 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 399/399 places, 350/350 transitions.
Graph (complete) has 858 edges and 399 vertex of which 388 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.10 ms
Discarding 11 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 388 transition count 327
Reduce places removed 16 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 17 rules applied. Total rules applied 36 place count 372 transition count 326
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 37 place count 371 transition count 326
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 37 place count 371 transition count 318
Deduced a syphon composed of 8 places in 6 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 53 place count 363 transition count 318
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 72 place count 344 transition count 299
Iterating global reduction 3 with 19 rules applied. Total rules applied 91 place count 344 transition count 299
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 91 place count 344 transition count 298
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 93 place count 343 transition count 298
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 106 place count 330 transition count 285
Iterating global reduction 3 with 13 rules applied. Total rules applied 119 place count 330 transition count 285
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 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 3 with 13 rules applied. Total rules applied 132 place count 330 transition count 272
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 133 place count 329 transition count 272
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 133 place count 329 transition count 270
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 137 place count 327 transition count 270
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 1 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 5 with 98 rules applied. Total rules applied 235 place count 278 transition count 221
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 237 place count 277 transition count 222
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 239 place count 277 transition count 220
Free-agglomeration rule applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 241 place count 277 transition count 218
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 243 place count 275 transition count 218
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 244 place count 275 transition count 217
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 245 place count 274 transition count 217
Applied a total of 245 rules in 410 ms. Remains 274 /399 variables (removed 125) and now considering 217/350 (removed 133) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 428 ms. Remains : 274/399 places, 217/350 transitions.
RANDOM walk for 40000 steps (670 resets) in 745 ms. (53 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (112 resets) in 136 ms. (291 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (106 resets) in 165 ms. (240 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (116 resets) in 194 ms. (205 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (161 resets) in 233 ms. (170 steps per ms) remains 4/4 properties
SDD proceeding with computation,6 properties remain. new max is 65536
SDD size :4.25006e+13 after 1.34415e+14
Interrupted probabilistic random walk after 512650 steps, run timeout after 3001 ms. (steps per millisecond=170 ) properties seen :0 out of 4
Probabilistic random walk after 512650 steps, saw 82301 distinct states, run finished after 3011 ms. (steps per millisecond=170 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18229320331416576510.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12737518839650977845.kers'
[2026-05-25 10:29:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18229320331416576510.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12737518839650977845.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 217 rows 274 cols 929 entries
Finished phase 1 with 107 SingleSign rule and 106 generalized
[2026-05-25 10:29:16] [INFO ] Computed 61 invariants in 1 ms
Computed 61 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-12737518839650977845.kers
Total runtime 2 ms.
[2026-05-25 10:29:16] [INFO ] State equation strengthened by 4 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 77/124 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 3/127 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 120/247 variables, 23/61 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/247 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 217/464 variables, 247/308 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/464 variables, 4/312 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/464 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 27/491 variables, 27/339 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/491 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/491 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 491/491 variables, and 339 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1454 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 274/274 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 4/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 77/124 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 3/39 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 3/127 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/127 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 120/247 variables, 23/64 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/247 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 217/464 variables, 247/311 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/464 variables, 4/315 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/464 variables, 2/317 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/464 variables, 1/318 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem DES-PT-30b-ReachabilityFireability-2024-07 is UNSAT
FORMULA DES-PT-30b-ReachabilityFireability-2024-07 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 13 (INCLUDED_ONLY) 0/464 variables, 1/319 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/464 variables, 1/320 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/464 variables, 0/320 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 27/491 variables, 27/347 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/491 variables, 1/348 constraints. Problems are: Problem set: 1 solved, 3 unsolved
SDD proceeding with computation,6 properties remain. new max is 131072
SDD size :1.34415e+14 after 2.13677e+14
At refinement iteration 18 (INCLUDED_ONLY) 0/491 variables, 1/349 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/491 variables, 0/349 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 0/491 variables, 0/349 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 491/491 variables, and 349 constraints, problems are : Problem set: 1 solved, 3 unsolved in 11542 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 274/274 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 4/3 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 13034ms problems are : Problem set: 1 solved, 3 unsolved
Parikh walk visited 0 properties in 8477 ms.
Support contains 36 out of 274 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 274/274 places, 217/217 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 267 transition count 210
Applied a total of 14 rules in 31 ms. Remains 267 /274 variables (removed 7) and now considering 210/217 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 267/274 places, 210/217 transitions.
RANDOM walk for 40000 steps (713 resets) in 269 ms. (148 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (132 resets) in 115 ms. (344 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (124 resets) in 110 ms. (360 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (146 resets) in 239 ms. (166 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 634404 steps, run timeout after 3001 ms. (steps per millisecond=211 ) properties seen :0 out of 3
Probabilistic random walk after 634404 steps, saw 101868 distinct states, run finished after 3001 ms. (steps per millisecond=211 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3660981313002396594.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9974023614365886460.kers'
[2026-05-25 10:29:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3660981313002396594.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9974023614365886460.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 210 rows 266 cols 914 entries
Finished phase 1 with 100 SingleSign rule and 106 generalized
[2026-05-25 10:29:40] [INFO ] Computed 61 invariants in 2 ms
Computed 61 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-9974023614365886460.kers
Total runtime 3 ms.
[2026-05-25 10:29:40] [INFO ] State equation strengthened by 4 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 56/92 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 25/117 variables, 13/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/117 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 123/240 variables, 24/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/240 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 210/450 variables, 240/301 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/450 variables, 4/305 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/450 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 27/477 variables, 27/332 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/477 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/477 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 477/477 variables, and 332 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1729 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 267/267 constraints, ReadFeed: 4/4 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/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 56/92 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 25/117 variables, 13/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/117 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 123/240 variables, 24/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/240 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 210/450 variables, 240/301 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/450 variables, 4/305 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/450 variables, 1/306 constraints. Problems are: Problem set: 0 solved, 3 unsolved
SDD proceeding with computation,6 properties remain. new max is 262144
SDD size :2.13677e+14 after 4.54727e+14
At refinement iteration 11 (INCLUDED_ONLY) 0/450 variables, 2/308 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/450 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 27/477 variables, 27/335 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/477 variables, 1/336 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/477 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 0/477 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 477/477 variables, and 336 constraints, problems are : Problem set: 0 solved, 3 unsolved in 6224 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 267/267 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 3/2 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7983ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 6396 ms.
Support contains 36 out of 267 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 267/267 places, 210/210 transitions.
Applied a total of 0 rules in 13 ms. Remains 267 /267 variables (removed 0) and now considering 210/210 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 267/267 places, 210/210 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 267/267 places, 210/210 transitions.
Applied a total of 0 rules in 14 ms. Remains 267 /267 variables (removed 0) and now considering 210/210 (removed 0) transitions.
[2026-05-25 10:29:55] [INFO ] Invariant cache hit.
[2026-05-25 10:29:55] [INFO ] Implicit Places using invariants in 359 ms returned [137]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 375 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 266/267 places, 210/210 transitions.
Applied a total of 0 rules in 18 ms. Remains 266 /266 variables (removed 0) and now considering 210/210 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 409 ms. Remains : 266/267 places, 210/210 transitions.
RANDOM walk for 40000 steps (707 resets) in 305 ms. (130 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (128 resets) in 134 ms. (296 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (119 resets) in 180 ms. (221 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (159 resets) in 227 ms. (175 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 756933 steps, run timeout after 3001 ms. (steps per millisecond=252 ) properties seen :0 out of 3
Probabilistic random walk after 756933 steps, saw 119881 distinct states, run finished after 3001 ms. (steps per millisecond=252 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-576707854035517936.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8504404212822465547.kers'
[2026-05-25 10:29:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-576707854035517936.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8504404212822465547.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 210 rows 266 cols 914 entries
Finished phase 1 with 100 SingleSign rule and 106 generalized
[2026-05-25 10:29:59] [INFO ] Computed 60 invariants in 1 ms
Computed 60 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-8504404212822465547.kers
Total runtime 2 ms.
[2026-05-25 10:29:59] [INFO ] State equation strengthened by 2 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 56/92 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 24/116 variables, 12/35 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 123/239 variables, 24/60 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/239 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 210/449 variables, 239/299 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/449 variables, 2/301 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/449 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 27/476 variables, 27/328 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/476 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/476 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 476/476 variables, and 328 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1435 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 266/266 constraints, ReadFeed: 2/2 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/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 56/92 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 24/116 variables, 12/35 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 123/239 variables, 24/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/239 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/239 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 210/449 variables, 239/301 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/449 variables, 2/303 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/449 variables, 1/304 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/449 variables, 1/305 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/449 variables, 1/306 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/449 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 27/476 variables, 27/333 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/476 variables, 1/334 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/476 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 0/476 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 476/476 variables, and 334 constraints, problems are : Problem set: 0 solved, 3 unsolved in 4880 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 266/266 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 3/2 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 6343ms problems are : Problem set: 0 solved, 3 unsolved
SDD proceeding with computation,6 properties remain. new max is 524288
SDD size :4.54727e+14 after 6.16276e+14
Parikh walk visited 0 properties in 6206 ms.
Support contains 36 out of 266 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 266/266 places, 210/210 transitions.
Applied a total of 0 rules in 11 ms. Remains 266 /266 variables (removed 0) and now considering 210/210 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 266/266 places, 210/210 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 266/266 places, 210/210 transitions.
Applied a total of 0 rules in 10 ms. Remains 266 /266 variables (removed 0) and now considering 210/210 (removed 0) transitions.
[2026-05-25 10:30:11] [INFO ] Invariant cache hit.
[2026-05-25 10:30:11] [INFO ] Implicit Places using invariants in 251 ms returned []
[2026-05-25 10:30:11] [INFO ] Invariant cache hit.
[2026-05-25 10:30:12] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-25 10:30:12] [INFO ] Implicit Places using invariants and state equation in 464 ms returned []
Implicit Place search using SMT with State Equation took 718 ms to find 0 implicit places.
[2026-05-25 10:30:12] [INFO ] Redundant transitions in 9 ms returned []
Running 209 sub problems to find dead transitions.
[2026-05-25 10:30:12] [INFO ] Invariant cache hit.
[2026-05-25 10:30:12] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/265 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/265 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 2 (OVERLAPS) 1/266 variables, 35/50 constraints. Problems are: Problem set: 0 solved, 209 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/266 variables, 10/60 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/266 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 5 (OVERLAPS) 210/476 variables, 266/326 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/476 variables, 2/328 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/476 variables, 12/340 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/476 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 9 (OVERLAPS) 0/476 variables, 6/346 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/476 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 209 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 476/476 variables, and 346 constraints, problems are : Problem set: 0 solved, 209 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 266/266 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 209/209 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 209 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/265 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/265 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 2 (OVERLAPS) 1/266 variables, 35/50 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/266 variables, 10/60 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/266 variables, 18/78 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/266 variables, 2/80 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/266 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 7 (OVERLAPS) 210/476 variables, 266/346 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/476 variables, 2/348 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/476 variables, 209/557 constraints. Problems are: Problem set: 0 solved, 209 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 476/476 variables, and 557 constraints, problems are : Problem set: 0 solved, 209 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 266/266 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 209/209 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60222ms problems are : Problem set: 0 solved, 209 unsolved
Search for dead transitions found 0 dead transitions in 60228ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61016 ms. Remains : 266/266 places, 210/210 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 19 ms. Remains 266 /266 variables (removed 0) and now considering 210/210 (removed 0) transitions.
Running SMT prover for 3 properties.
[2026-05-25 10:31:12] [INFO ] Invariant cache hit.
[2026-05-25 10:31:12] [INFO ] After 81ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2026-05-25 10:31:12] [INFO ] [Nat]Absence check using 35 positive place invariants in 11 ms returned sat
[2026-05-25 10:31:12] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 28 ms returned sat
[2026-05-25 10:31:13] [INFO ] After 345ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2026-05-25 10:31:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 143 ms
[2026-05-25 10:31:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 135 ms
TRAPS : Iteration 1
[2026-05-25 10:31:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 307 ms
TRAPS : Iteration 2
[2026-05-25 10:31:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 240 ms
TRAPS : Iteration 3
[2026-05-25 10:31:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 155 ms
TRAPS : Iteration 4
[2026-05-25 10:31:15] [INFO ] After 2835ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2026-05-25 10:31:15] [INFO ] After 3182ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2026-05-25 10:31:16] [INFO ] Flatten gal took : 64 ms
[2026-05-25 10:31:16] [INFO ] Flatten gal took : 40 ms
[2026-05-25 10:31:16] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5003288555369835672.gal : 10 ms
[2026-05-25 10:31:16] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18017338924131864528.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/ReachabilityCardinality5003288555369835672.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality18017338924131864528.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 ...329
Loading property file /tmp/ReachabilityCardinality18017338924131864528.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :3 after 6
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :6 after 12
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :12 after 14
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :14 after 42
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :42 after 313
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :313 after 1576
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :1576 after 13018
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :13018 after 41060
SDD proceeding with computation,3 properties remain. new max is 2048
SDD size :41060 after 2.77894e+07
SDD proceeding with computation,3 properties remain. new max is 4096
SDD size :2.77894e+07 after 4.57733e+07
SDD proceeding with computation,3 properties remain. new max is 8192
SDD size :4.57733e+07 after 7.33873e+07
SDD proceeding with computation,3 properties remain. new max is 16384
SDD size :7.33873e+07 after 1.31536e+08
SDD proceeding with computation,3 properties remain. new max is 32768
SDD size :1.31536e+08 after 1.76447e+09
Detected timeout of ITS tools.
[2026-05-25 10:31:31] [INFO ] Flatten gal took : 22 ms
[2026-05-25 10:31:31] [INFO ] Applying decomposition
[2026-05-25 10:31:31] [INFO ] Flatten gal took : 26 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/graph929066957312711562.txt' '-o' '/tmp/graph929066957312711562.bin' '-w' '/tmp/graph929066957312711562.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph929066957312711562.bin' '-l' '-1' '-v' '-w' '/tmp/graph929066957312711562.weights' '-q' '0' '-e' '0.001'
[2026-05-25 10:31:31] [INFO ] Decomposing Gal with order
[2026-05-25 10:31:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 10:31:31] [INFO ] Removed a total of 33 redundant transitions.
[2026-05-25 10:31:31] [INFO ] Flatten gal took : 117 ms
[2026-05-25 10:31:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 17 ms.
[2026-05-25 10:31:31] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8690998977609603272.gal : 12 ms
[2026-05-25 10:31:31] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13375027589344146899.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/ReachabilityCardinality8690998977609603272.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13375027589344146899.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/ReachabilityCardinality13375027589344146899.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 51
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :51 after 55
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :55 after 528
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :528 after 1336
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :1336 after 1.49812e+07
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :1.49812e+07 after 2.122e+11
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :2.122e+11 after 3.76718e+11
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :3.76718e+11 after 5.98254e+11
Invariant property DES-PT-30b-ReachabilityFireability-2024-00 does not hold.
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :5.98254e+11 after 9.49694e+11
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 33994 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-25 10:31:46] [INFO ] Flatten gal took : 27 ms
[2026-05-25 10:31:46] [INFO ] Applying decomposition
[2026-05-25 10:31:46] [INFO ] Flatten gal took : 25 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/graph6809033781239124952.txt' '-o' '/tmp/graph6809033781239124952.bin' '-w' '/tmp/graph6809033781239124952.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph6809033781239124952.bin' '-l' '-1' '-v' '-w' '/tmp/graph6809033781239124952.weights' '-q' '0' '-e' '0.001'
[2026-05-25 10:31:46] [INFO ] Decomposing Gal with order
[2026-05-25 10:31:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 10:31:47] [INFO ] Removed a total of 32 redundant transitions.
[2026-05-25 10:31:47] [INFO ] Flatten gal took : 43 ms
[2026-05-25 10:31:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 9 ms.
[2026-05-25 10:31:47] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1916627876429591805.gal : 17 ms
[2026-05-25 10:31:47] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15080575457133806923.prop : 4 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/ReachabilityCardinality1916627876429591805.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15080575457133806923.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/ReachabilityCardinality15080575457133806923.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :1 after 5
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :5 after 1099
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :1099 after 1.10424e+06
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :1.10424e+06 after 1.47899e+09
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :1.47899e+09 after 8.7385e+11
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :1.99163e+17 after 2.00506e+17
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :1.91404e+20 after 1.91511e+20
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :1.21875e+21 after 1.21905e+21
Invariant property DES-PT-30b-ReachabilityFireability-2024-00 does not hold.
FORMULA DES-PT-30b-ReachabilityFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :4.24692e+21 after 4.2471e+21
Detected timeout of ITS tools.
[2026-05-25 11:01:47] [INFO ] Flatten gal took : 13 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin13948870147675090588
[2026-05-25 11:01:47] [INFO ] Applying decomposition
[2026-05-25 11:01:47] [INFO ] Computing symmetric may disable matrix : 210 transitions.
[2026-05-25 11:01:47] [INFO ] Flatten gal took : 13 ms
[2026-05-25 11:01:47] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 11:01:47] [INFO ] Computing symmetric may enable matrix : 210 transitions.
[2026-05-25 11:01:47] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 11:01:47] [INFO ] Computing Do-Not-Accords matrix : 210 transitions.
[2026-05-25 11:01:47] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
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/graph7394815560019190469.txt' '-o' '/tmp/graph7394815560019190469.bin' '-w' '/tmp/graph7394815560019190469.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph7394815560019190469.bin' '-l' '-1' '-v' '-w' '/tmp/graph7394815560019190469.weights' '-q' '0' '-e' '0.001'
[2026-05-25 11:01:47] [INFO ] Decomposing Gal with order
[2026-05-25 11:01:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 11:01:47] [INFO ] Built C files in 97ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13948870147675090588
Running compilation step : cd /tmp/ltsmin13948870147675090588;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2026-05-25 11:01:47] [INFO ] Removed a total of 31 redundant transitions.
[2026-05-25 11:01:47] [INFO ] Flatten gal took : 29 ms
[2026-05-25 11:01:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 12 ms.
[2026-05-25 11:01:47] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability6577940578850876200.gal : 5 ms
[2026-05-25 11:01:47] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability11102404804625805403.prop : 0 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/ReachabilityFireability6577940578850876200.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability11102404804625805403.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/ReachabilityFireability11102404804625805403.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :3 after 51
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :51 after 102
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :102 after 1258
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :1258 after 1.15899e+07
Compilation finished in 903 ms.
Running link step : cd /tmp/ltsmin13948870147675090588;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin13948870147675090588;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '-i' 'DESPT30bReachabilityFireability202405==true'
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :1.57254e+07 after 1.58934e+11
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :1.58934e+11 after 3.03187e+11
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :3.03187e+11 after 4.83504e+11
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :4.83504e+11 after 7.72011e+11
LTSmin run took 27604 ms.
Found Violation
FORMULA DES-PT-30b-ReachabilityFireability-2024-05 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin13948870147675090588;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '-i' 'DESPT30bReachabilityFireability202413==true'
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1.01427e+15 after 1.15742e+15
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,3.98265e+15,136.129,259460,39743,3412,748409,18356,574,504921,353,104011,0
Total reachable state count : 3982653272333119

Verifying 2 reachability properties.
Invariant property DES-PT-30b-ReachabilityFireability-2024-05 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
DES-PT-30b-ReachabilityFireability-2024-05,1.53032e+09,136.319,259460,440,471,748409,18356,593,504921,362,104011,20681
Reachability property DES-PT-30b-ReachabilityFireability-2024-13 is true.
FORMULA DES-PT-30b-ReachabilityFireability-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DES-PT-30b-ReachabilityFireability-2024-13,2.47738e+07,137.501,259460,240,381,748409,18356,658,504921,377,104011,208319
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 2105563 ms.

BK_STOP 1779707045196

--------------------
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="DES-PT-30b"
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 DES-PT-30b, 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 r082-smll-177946993700407"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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