About the Execution of ITS-Tools for FireWire-PT-15
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 678.531 | 286454.00 | 330438.00 | 957.10 | 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2026-input.r130-smll-177955809000261.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5973
Executing tool itstools
Input is FireWire-PT-15, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r130-smll-177955809000261
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 468K
-rw-r--r-- 1 mcc users 6.9K Mar 7 05:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Mar 7 05:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Mar 7 05:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Mar 7 05:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 15 10:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 10:08 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 10:08 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 10:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.4K Mar 7 05:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K Mar 7 05:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Mar 7 05:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 36K Mar 7 05:17 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 10:08 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 10:08 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 90K 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 positive values
NUM_VECTOR
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME FireWire-PT-15-UpperBounds-00
FORMULA_NAME FireWire-PT-15-UpperBounds-01
FORMULA_NAME FireWire-PT-15-UpperBounds-02
FORMULA_NAME FireWire-PT-15-UpperBounds-03
FORMULA_NAME FireWire-PT-15-UpperBounds-04
FORMULA_NAME FireWire-PT-15-UpperBounds-05
FORMULA_NAME FireWire-PT-15-UpperBounds-06
FORMULA_NAME FireWire-PT-15-UpperBounds-07
FORMULA_NAME FireWire-PT-15-UpperBounds-08
FORMULA_NAME FireWire-PT-15-UpperBounds-09
FORMULA_NAME FireWire-PT-15-UpperBounds-10
FORMULA_NAME FireWire-PT-15-UpperBounds-11
FORMULA_NAME FireWire-PT-15-UpperBounds-12
FORMULA_NAME FireWire-PT-15-UpperBounds-13
FORMULA_NAME FireWire-PT-15-UpperBounds-14
FORMULA_NAME FireWire-PT-15-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1779831827234
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-15
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202604301425
[2026-05-26 21:43:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-26 21:43:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-26 21:43:50] [INFO ] Load time of PNML (sax parser for PT used): 187 ms
[2026-05-26 21:43:50] [INFO ] Transformed 248 places.
[2026-05-26 21:43:50] [INFO ] Transformed 383 transitions.
[2026-05-26 21:43:50] [INFO ] Found NUPN structural information;
[2026-05-26 21:43:50] [INFO ] Parsed PT model containing 248 places and 383 transitions and 1144 arcs in 426 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 14 ms.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1252169956997480455.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18238459645652485428.kers'
[2026-05-26 21:43:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1252169956997480455.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18238459645652485428.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 383 rows 248 cols 1144 entries
Finished phase 1 with 243 SingleSign rule and 0 generalized
[2026-05-26 21:43:50] [INFO ] Computed 5 invariants in 2 ms
Computed 5 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-18238459645652485428.kers
Total runtime 5 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (2 resets) in 70 ms. (140 steps per ms)
FORMULA FireWire-PT-15-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-15-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-15-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-15-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-15-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-15-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-15-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-15-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 80000 steps (28 resets) in 238 ms. (334 steps per ms)
FORMULA FireWire-PT-15-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
[2026-05-26 21:43:50] [INFO ] Invariant cache hit.
[2026-05-26 21:43:51] [INFO ] [Real]Absence check using 5 positive place invariants in 21 ms returned sat
[2026-05-26 21:43:51] [INFO ] [Real]Absence check using state equation in 404 ms returned sat
[2026-05-26 21:43:52] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 21:43:52] [INFO ] [Nat]Absence check using 5 positive place invariants in 20 ms returned sat
[2026-05-26 21:43:53] [INFO ] [Nat]Absence check using state equation in 290 ms returned sat
[2026-05-26 21:43:54] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1635 ms
[2026-05-26 21:43:54] [INFO ] Computed and/alt/rep : 330/889/330 causal constraints (skipped 52 transitions) in 58 ms.
[2026-05-26 21:43:57] [INFO ] Added : 140 causal constraints over 28 iterations in 2876 ms. Result :unknown
[2026-05-26 21:43:57] [INFO ] [Real]Absence check using 5 positive place invariants in 13 ms returned sat
[2026-05-26 21:43:57] [INFO ] [Real]Absence check using state equation in 262 ms returned sat
[2026-05-26 21:43:58] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 21:43:58] [INFO ] [Nat]Absence check using 5 positive place invariants in 14 ms returned sat
[2026-05-26 21:43:58] [INFO ] [Nat]Absence check using state equation in 245 ms returned sat
[2026-05-26 21:43:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 651 ms
[2026-05-26 21:43:59] [INFO ] Computed and/alt/rep : 330/889/330 causal constraints (skipped 52 transitions) in 47 ms.
[2026-05-26 21:44:02] [INFO ] Added : 258 causal constraints over 52 iterations in 3398 ms. Result :sat
Minimization took 451 ms.
[2026-05-26 21:44:03] [INFO ] [Real]Absence check using 5 positive place invariants in 13 ms returned sat
[2026-05-26 21:44:03] [INFO ] [Real]Absence check using state equation in 257 ms returned sat
[2026-05-26 21:44:04] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 21:44:04] [INFO ] [Nat]Absence check using 5 positive place invariants in 14 ms returned sat
[2026-05-26 21:44:04] [INFO ] [Nat]Absence check using state equation in 255 ms returned sat
[2026-05-26 21:44:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 740 ms
[2026-05-26 21:44:05] [INFO ] Computed and/alt/rep : 330/889/330 causal constraints (skipped 52 transitions) in 51 ms.
[2026-05-26 21:44:09] [INFO ] Added : 235 causal constraints over 47 iterations in 3879 ms. Result :unknown
[2026-05-26 21:44:09] [INFO ] [Real]Absence check using 5 positive place invariants in 12 ms returned sat
[2026-05-26 21:44:09] [INFO ] [Real]Absence check using state equation in 252 ms returned sat
[2026-05-26 21:44:09] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 21:44:10] [INFO ] [Nat]Absence check using 5 positive place invariants in 14 ms returned sat
[2026-05-26 21:44:10] [INFO ] [Nat]Absence check using state equation in 251 ms returned sat
[2026-05-26 21:44:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 697 ms
[2026-05-26 21:44:11] [INFO ] Computed and/alt/rep : 330/889/330 causal constraints (skipped 52 transitions) in 47 ms.
[2026-05-26 21:44:14] [INFO ] Added : 262 causal constraints over 53 iterations in 3798 ms. Result :sat
Minimization took 130 ms.
[2026-05-26 21:44:15] [INFO ] [Real]Absence check using 5 positive place invariants in 13 ms returned sat
[2026-05-26 21:44:15] [INFO ] [Real]Absence check using state equation in 242 ms returned sat
[2026-05-26 21:44:15] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 21:44:15] [INFO ] [Nat]Absence check using 5 positive place invariants in 14 ms returned sat
[2026-05-26 21:44:16] [INFO ] [Nat]Absence check using state equation in 244 ms returned sat
[2026-05-26 21:44:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 721 ms
[2026-05-26 21:44:16] [INFO ] Computed and/alt/rep : 330/889/330 causal constraints (skipped 52 transitions) in 41 ms.
[2026-05-26 21:44:20] [INFO ] Added : 135 causal constraints over 27 iterations in 3911 ms. Result :unknown
[2026-05-26 21:44:20] [INFO ] [Real]Absence check using 5 positive place invariants in 13 ms returned sat
[2026-05-26 21:44:21] [INFO ] [Real]Absence check using state equation in 257 ms returned sat
[2026-05-26 21:44:21] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 21:44:21] [INFO ] [Nat]Absence check using 5 positive place invariants in 16 ms returned sat
[2026-05-26 21:44:21] [INFO ] [Nat]Absence check using state equation in 263 ms returned sat
[2026-05-26 21:44:22] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 818 ms
[2026-05-26 21:44:22] [INFO ] Computed and/alt/rep : 330/889/330 causal constraints (skipped 52 transitions) in 44 ms.
[2026-05-26 21:44:26] [INFO ] Added : 254 causal constraints over 51 iterations in 3786 ms. Result :unknown
[2026-05-26 21:44:26] [INFO ] [Real]Absence check using 5 positive place invariants in 8 ms returned sat
[2026-05-26 21:44:26] [INFO ] [Real]Absence check using state equation in 157 ms returned sat
[2026-05-26 21:44:27] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 21:44:27] [INFO ] [Nat]Absence check using 5 positive place invariants in 13 ms returned sat
[2026-05-26 21:44:27] [INFO ] [Nat]Absence check using state equation in 222 ms returned sat
[2026-05-26 21:44:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 656 ms
[2026-05-26 21:44:28] [INFO ] Computed and/alt/rep : 330/889/330 causal constraints (skipped 52 transitions) in 36 ms.
[2026-05-26 21:44:32] [INFO ] Added : 185 causal constraints over 37 iterations in 4020 ms. Result :unknown
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
Support contains 7 out of 248 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 248/248 places, 383/383 transitions.
Graph (trivial) has 183 edges and 248 vertex of which 12 / 248 are part of one of the 3 SCC in 9 ms
Free SCC test removed 9 places
Drop transitions (Empty/Sink Transition effects.) removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Graph (complete) has 667 edges and 239 vertex of which 234 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 46 rules applied. Total rules applied 48 place count 234 transition count 324
Reduce places removed 45 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 47 rules applied. Total rules applied 95 place count 189 transition count 322
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 96 place count 188 transition count 322
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 96 place count 188 transition count 317
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 106 place count 183 transition count 317
Discarding 34 places :
Symmetric choice reduction at 3 with 34 rule applications. Total rules 140 place count 149 transition count 281
Iterating global reduction 3 with 34 rules applied. Total rules applied 174 place count 149 transition count 281
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 175 place count 149 transition count 280
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 175 place count 149 transition count 277
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 181 place count 146 transition count 277
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 191 place count 136 transition count 238
Iterating global reduction 4 with 10 rules applied. Total rules applied 201 place count 136 transition count 238
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 203 place count 136 transition count 236
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 204 place count 135 transition count 235
Iterating global reduction 5 with 1 rules applied. Total rules applied 205 place count 135 transition count 235
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 2 rules applied. Total rules applied 207 place count 135 transition count 233
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 208 place count 134 transition count 233
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 7 with 40 rules applied. Total rules applied 248 place count 114 transition count 213
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: -63
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 7 with 30 rules applied. Total rules applied 278 place count 99 transition count 276
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 281 place count 99 transition count 273
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 8 with 16 rules applied. Total rules applied 297 place count 99 transition count 257
Free-agglomeration rule applied 10 times.
Iterating global reduction 8 with 10 rules applied. Total rules applied 307 place count 99 transition count 247
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 8 with 10 rules applied. Total rules applied 317 place count 89 transition count 247
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 318 place count 88 transition count 246
Iterating global reduction 9 with 1 rules applied. Total rules applied 319 place count 88 transition count 246
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 9 with 5 rules applied. Total rules applied 324 place count 88 transition count 241
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 326 place count 88 transition count 241
Applied a total of 326 rules in 214 ms. Remains 88 /248 variables (removed 160) and now considering 241/383 (removed 142) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 226 ms. Remains : 88/248 places, 241/383 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5361574743603581970.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2113223115919709224.kers'
[2026-05-26 21:44:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5361574743603581970.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2113223115919709224.kers]
Normalized transition count is 238 out of 241 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 238 rows 88 cols 839 entries
Finished phase 1 with 84 SingleSign rule and 0 generalized
[2026-05-26 21:44:33] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-2113223115919709224.kers
Total runtime 2 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (97945 resets) in 1181 ms. (846 steps per ms)
BEST_FIRST walk for 7000006 steps (229742 resets) in 3303 ms. (2118 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
[2026-05-26 21:44:38] [INFO ] Flow matrix only has 238 transitions (discarded 3 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16892749835083402053.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14221146393401353123.kers'
[2026-05-26 21:44:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16892749835083402053.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14221146393401353123.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 238 rows 88 cols 839 entries
Finished phase 1 with 84 SingleSign rule and 0 generalized
[2026-05-26 21:44:38] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-14221146393401353123.kers
Total runtime 1 ms.
[2026-05-26 21:44:38] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2026-05-26 21:44:38] [INFO ] [Real]Absence check using state equation in 70 ms returned sat
[2026-05-26 21:44:38] [INFO ] State equation strengthened by 36 read => feed constraints.
[2026-05-26 21:44:38] [INFO ] [Real]Added 36 Read/Feed constraints in 9 ms returned sat
[2026-05-26 21:44:38] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 21:44:38] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2026-05-26 21:44:38] [INFO ] [Nat]Absence check using state equation in 73 ms returned sat
[2026-05-26 21:44:38] [INFO ] [Nat]Added 36 Read/Feed constraints in 8 ms returned sat
[2026-05-26 21:44:38] [INFO ] Computed and/alt/rep : 132/720/132 causal constraints (skipped 104 transitions) in 19 ms.
[2026-05-26 21:44:39] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 773 ms
[2026-05-26 21:44:39] [INFO ] Added : 58 causal constraints over 12 iterations in 1123 ms. Result :sat
Minimization took 179 ms.
[2026-05-26 21:44:39] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2026-05-26 21:44:39] [INFO ] [Real]Absence check using state equation in 111 ms returned sat
[2026-05-26 21:44:39] [INFO ] [Real]Added 36 Read/Feed constraints in 13 ms returned sat
[2026-05-26 21:44:39] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 21:44:39] [INFO ] [Nat]Absence check using 4 positive place invariants in 5 ms returned sat
[2026-05-26 21:44:39] [INFO ] [Nat]Absence check using state equation in 111 ms returned sat
[2026-05-26 21:44:40] [INFO ] [Nat]Added 36 Read/Feed constraints in 17 ms returned sat
[2026-05-26 21:44:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 158 ms
[2026-05-26 21:44:40] [INFO ] Computed and/alt/rep : 132/720/132 causal constraints (skipped 104 transitions) in 31 ms.
[2026-05-26 21:44:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 200 ms
[2026-05-26 21:44:41] [INFO ] Added : 69 causal constraints over 15 iterations in 851 ms. Result :sat
Minimization took 165 ms.
[2026-05-26 21:44:41] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2026-05-26 21:44:41] [INFO ] [Real]Absence check using state equation in 111 ms returned sat
[2026-05-26 21:44:41] [INFO ] [Real]Added 36 Read/Feed constraints in 12 ms returned sat
[2026-05-26 21:44:41] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 21:44:41] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2026-05-26 21:44:41] [INFO ] [Nat]Absence check using state equation in 112 ms returned sat
[2026-05-26 21:44:41] [INFO ] [Nat]Added 36 Read/Feed constraints in 11 ms returned sat
[2026-05-26 21:44:41] [INFO ] Computed and/alt/rep : 132/720/132 causal constraints (skipped 104 transitions) in 34 ms.
[2026-05-26 21:44:41] [INFO ] Added : 20 causal constraints over 6 iterations in 240 ms. Result :sat
Minimization took 152 ms.
[2026-05-26 21:44:42] [INFO ] [Real]Absence check using 4 positive place invariants in 5 ms returned sat
[2026-05-26 21:44:42] [INFO ] [Real]Absence check using state equation in 114 ms returned sat
[2026-05-26 21:44:42] [INFO ] [Real]Added 36 Read/Feed constraints in 15 ms returned sat
[2026-05-26 21:44:42] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 21:44:42] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2026-05-26 21:44:42] [INFO ] [Nat]Absence check using state equation in 105 ms returned sat
[2026-05-26 21:44:42] [INFO ] [Nat]Added 36 Read/Feed constraints in 17 ms returned sat
[2026-05-26 21:44:42] [INFO ] Computed and/alt/rep : 132/720/132 causal constraints (skipped 104 transitions) in 32 ms.
[2026-05-26 21:44:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 138 ms
[2026-05-26 21:44:42] [INFO ] Added : 49 causal constraints over 11 iterations in 479 ms. Result :sat
Minimization took 116 ms.
[2026-05-26 21:44:43] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2026-05-26 21:44:43] [INFO ] [Real]Absence check using state equation in 77 ms returned sat
[2026-05-26 21:44:43] [INFO ] [Real]Added 36 Read/Feed constraints in 7 ms returned sat
[2026-05-26 21:44:43] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 21:44:43] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2026-05-26 21:44:43] [INFO ] [Nat]Absence check using state equation in 77 ms returned sat
[2026-05-26 21:44:43] [INFO ] [Nat]Added 36 Read/Feed constraints in 10 ms returned sat
[2026-05-26 21:44:43] [INFO ] Computed and/alt/rep : 132/720/132 causal constraints (skipped 104 transitions) in 22 ms.
[2026-05-26 21:44:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 358 ms
[2026-05-26 21:44:44] [INFO ] Added : 58 causal constraints over 13 iterations in 731 ms. Result :sat
Minimization took 143 ms.
[2026-05-26 21:44:44] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2026-05-26 21:44:44] [INFO ] [Real]Absence check using state equation in 73 ms returned sat
[2026-05-26 21:44:44] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 21:44:44] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2026-05-26 21:44:44] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2026-05-26 21:44:44] [INFO ] [Nat]Added 36 Read/Feed constraints in 10 ms returned sat
[2026-05-26 21:44:44] [INFO ] Computed and/alt/rep : 132/720/132 causal constraints (skipped 104 transitions) in 19 ms.
[2026-05-26 21:44:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 273 ms
[2026-05-26 21:44:45] [INFO ] Added : 64 causal constraints over 13 iterations in 669 ms. Result :sat
Minimization took 108 ms.
[2026-05-26 21:44:45] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2026-05-26 21:44:45] [INFO ] [Real]Absence check using state equation in 72 ms returned sat
[2026-05-26 21:44:45] [INFO ] [Real]Added 36 Read/Feed constraints in 6 ms returned sat
[2026-05-26 21:44:45] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 21:44:45] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2026-05-26 21:44:45] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2026-05-26 21:44:45] [INFO ] [Nat]Added 36 Read/Feed constraints in 10 ms returned sat
[2026-05-26 21:44:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 247 ms
[2026-05-26 21:44:45] [INFO ] Computed and/alt/rep : 132/720/132 causal constraints (skipped 104 transitions) in 28 ms.
[2026-05-26 21:44:46] [INFO ] Added : 44 causal constraints over 10 iterations in 389 ms. Result :sat
Minimization took 150 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
FORMULA FireWire-PT-15-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
Support contains 6 out of 88 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 88/88 places, 241/241 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 0 with 1 rules applied. Total rules applied 1 place count 88 transition count 240
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 87 transition count 240
Applied a total of 2 rules in 24 ms. Remains 87 /88 variables (removed 1) and now considering 240/241 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 87/88 places, 240/241 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6943762792036498861.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2980954827611608170.kers'
[2026-05-26 21:44:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6943762792036498861.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2980954827611608170.kers]
Normalized transition count is 237 out of 240 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 237 rows 87 cols 837 entries
Finished phase 1 with 83 SingleSign rule and 0 generalized
[2026-05-26 21:44:46] [INFO ] Computed 4 invariants in 2 ms
Computed 4 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-2980954827611608170.kers
Total runtime 3 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (98128 resets) in 1208 ms. (827 steps per ms)
BEST_FIRST walk for 6000003 steps (197002 resets) in 2766 ms. (2168 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
[2026-05-26 21:44:50] [INFO ] Flow matrix only has 237 transitions (discarded 3 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13224212627171923449.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1430580024023260781.kers'
[2026-05-26 21:44:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13224212627171923449.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1430580024023260781.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 237 rows 87 cols 837 entries
Finished phase 1 with 83 SingleSign rule and 0 generalized
[2026-05-26 21:44:50] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1430580024023260781.kers
Total runtime 1 ms.
[2026-05-26 21:44:50] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2026-05-26 21:44:50] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2026-05-26 21:44:50] [INFO ] State equation strengthened by 36 read => feed constraints.
[2026-05-26 21:44:50] [INFO ] [Real]Added 36 Read/Feed constraints in 9 ms returned sat
[2026-05-26 21:44:50] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 21:44:50] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2026-05-26 21:44:50] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2026-05-26 21:44:50] [INFO ] [Nat]Added 36 Read/Feed constraints in 10 ms returned sat
[2026-05-26 21:44:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 180 ms
[2026-05-26 21:44:50] [INFO ] Computed and/alt/rep : 131/719/131 causal constraints (skipped 104 transitions) in 16 ms.
[2026-05-26 21:44:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 192 ms
[2026-05-26 21:44:51] [INFO ] Added : 57 causal constraints over 12 iterations in 767 ms. Result :sat
Minimization took 181 ms.
[2026-05-26 21:44:51] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2026-05-26 21:44:52] [INFO ] [Real]Absence check using state equation in 108 ms returned sat
[2026-05-26 21:44:52] [INFO ] [Real]Added 36 Read/Feed constraints in 16 ms returned sat
[2026-05-26 21:44:52] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 21:44:52] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2026-05-26 21:44:52] [INFO ] [Nat]Absence check using state equation in 110 ms returned sat
[2026-05-26 21:44:52] [INFO ] [Nat]Added 36 Read/Feed constraints in 13 ms returned sat
[2026-05-26 21:44:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 155 ms
[2026-05-26 21:44:52] [INFO ] Computed and/alt/rep : 131/719/131 causal constraints (skipped 104 transitions) in 26 ms.
[2026-05-26 21:44:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 175 ms
[2026-05-26 21:44:53] [INFO ] Added : 76 causal constraints over 16 iterations in 812 ms. Result :sat
Minimization took 187 ms.
[2026-05-26 21:44:53] [INFO ] [Real]Absence check using 4 positive place invariants in 5 ms returned sat
[2026-05-26 21:44:53] [INFO ] [Real]Absence check using state equation in 108 ms returned sat
[2026-05-26 21:44:53] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 21:44:53] [INFO ] [Nat]Absence check using 4 positive place invariants in 5 ms returned sat
[2026-05-26 21:44:53] [INFO ] [Nat]Absence check using state equation in 109 ms returned sat
[2026-05-26 21:44:53] [INFO ] [Nat]Added 36 Read/Feed constraints in 13 ms returned sat
[2026-05-26 21:44:53] [INFO ] Computed and/alt/rep : 131/719/131 causal constraints (skipped 104 transitions) in 27 ms.
[2026-05-26 21:44:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 380 ms
[2026-05-26 21:44:54] [INFO ] Added : 70 causal constraints over 16 iterations in 970 ms. Result :sat
Minimization took 189 ms.
[2026-05-26 21:44:55] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2026-05-26 21:44:55] [INFO ] [Real]Absence check using state equation in 106 ms returned sat
[2026-05-26 21:44:55] [INFO ] [Real]Added 36 Read/Feed constraints in 15 ms returned sat
[2026-05-26 21:44:55] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 21:44:55] [INFO ] [Nat]Absence check using 4 positive place invariants in 5 ms returned sat
[2026-05-26 21:44:55] [INFO ] [Nat]Absence check using state equation in 110 ms returned sat
[2026-05-26 21:44:55] [INFO ] [Nat]Added 36 Read/Feed constraints in 17 ms returned sat
[2026-05-26 21:44:55] [INFO ] Computed and/alt/rep : 131/719/131 causal constraints (skipped 104 transitions) in 29 ms.
[2026-05-26 21:44:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 199 ms
[2026-05-26 21:44:56] [INFO ] Added : 72 causal constraints over 16 iterations in 818 ms. Result :sat
Minimization took 193 ms.
[2026-05-26 21:44:56] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2026-05-26 21:44:56] [INFO ] [Real]Absence check using state equation in 111 ms returned sat
[2026-05-26 21:44:56] [INFO ] [Real]Added 36 Read/Feed constraints in 13 ms returned sat
[2026-05-26 21:44:56] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 21:44:56] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2026-05-26 21:44:56] [INFO ] [Nat]Absence check using state equation in 106 ms returned sat
[2026-05-26 21:44:56] [INFO ] [Nat]Added 36 Read/Feed constraints in 14 ms returned sat
[2026-05-26 21:44:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 289 ms
[2026-05-26 21:44:57] [INFO ] Computed and/alt/rep : 131/719/131 causal constraints (skipped 104 transitions) in 25 ms.
[2026-05-26 21:44:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 341 ms
[2026-05-26 21:44:58] [INFO ] Added : 69 causal constraints over 15 iterations in 1012 ms. Result :sat
Minimization took 169 ms.
[2026-05-26 21:44:58] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2026-05-26 21:44:58] [INFO ] [Real]Absence check using state equation in 107 ms returned sat
[2026-05-26 21:44:58] [INFO ] [Real]Added 36 Read/Feed constraints in 14 ms returned sat
[2026-05-26 21:44:58] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 21:44:58] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2026-05-26 21:44:58] [INFO ] [Nat]Absence check using state equation in 108 ms returned sat
[2026-05-26 21:44:58] [INFO ] [Nat]Added 36 Read/Feed constraints in 16 ms returned sat
[2026-05-26 21:44:58] [INFO ] Computed and/alt/rep : 131/719/131 causal constraints (skipped 104 transitions) in 27 ms.
[2026-05-26 21:44:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 197 ms
[2026-05-26 21:44:59] [INFO ] Added : 45 causal constraints over 9 iterations in 560 ms. Result :sat
Minimization took 161 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
FORMULA FireWire-PT-15-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
Support contains 5 out of 87 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 240/240 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 86 transition count 239
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 85 transition count 235
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 85 transition count 235
Applied a total of 4 rules in 23 ms. Remains 85 /87 variables (removed 2) and now considering 235/240 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 85/87 places, 235/240 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6473701137019702158.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6391781989371683390.kers'
[2026-05-26 21:44:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6473701137019702158.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6391781989371683390.kers]
Normalized transition count is 232 out of 235 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 232 rows 85 cols 821 entries
Finished phase 1 with 81 SingleSign rule and 0 generalized
[2026-05-26 21:44:59] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-6391781989371683390.kers
Total runtime 2 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (97999 resets) in 1720 ms. (581 steps per ms)
BEST_FIRST walk for 5000004 steps (164011 resets) in 2993 ms. (1670 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
[2026-05-26 21:45:04] [INFO ] Flow matrix only has 232 transitions (discarded 3 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17787280482012351990.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3437062579173301907.kers'
[2026-05-26 21:45:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17787280482012351990.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3437062579173301907.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 232 rows 85 cols 821 entries
Finished phase 1 with 81 SingleSign rule and 0 generalized
[2026-05-26 21:45:04] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-3437062579173301907.kers
Total runtime 2 ms.
[2026-05-26 21:45:04] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2026-05-26 21:45:04] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2026-05-26 21:45:04] [INFO ] State equation strengthened by 35 read => feed constraints.
[2026-05-26 21:45:04] [INFO ] [Real]Added 35 Read/Feed constraints in 11 ms returned sat
[2026-05-26 21:45:04] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 21:45:04] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2026-05-26 21:45:04] [INFO ] [Nat]Absence check using state equation in 108 ms returned sat
[2026-05-26 21:45:04] [INFO ] [Nat]Added 35 Read/Feed constraints in 12 ms returned sat
[2026-05-26 21:45:04] [INFO ] Computed and/alt/rep : 128/713/128 causal constraints (skipped 102 transitions) in 27 ms.
[2026-05-26 21:45:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 335 ms
[2026-05-26 21:45:05] [INFO ] Added : 60 causal constraints over 12 iterations in 779 ms. Result :sat
Minimization took 161 ms.
[2026-05-26 21:45:05] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2026-05-26 21:45:05] [INFO ] [Real]Absence check using state equation in 109 ms returned sat
[2026-05-26 21:45:05] [INFO ] [Real]Added 35 Read/Feed constraints in 13 ms returned sat
[2026-05-26 21:45:05] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 21:45:05] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2026-05-26 21:45:06] [INFO ] [Nat]Absence check using state equation in 108 ms returned sat
[2026-05-26 21:45:06] [INFO ] [Nat]Added 35 Read/Feed constraints in 15 ms returned sat
[2026-05-26 21:45:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 154 ms
[2026-05-26 21:45:06] [INFO ] Computed and/alt/rep : 128/713/128 causal constraints (skipped 102 transitions) in 25 ms.
[2026-05-26 21:45:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 182 ms
[2026-05-26 21:45:06] [INFO ] Added : 53 causal constraints over 14 iterations in 655 ms. Result :sat
Minimization took 168 ms.
[2026-05-26 21:45:07] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2026-05-26 21:45:07] [INFO ] [Real]Absence check using state equation in 110 ms returned sat
[2026-05-26 21:45:07] [INFO ] [Real]Added 35 Read/Feed constraints in 11 ms returned sat
[2026-05-26 21:45:07] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 21:45:07] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2026-05-26 21:45:07] [INFO ] [Nat]Absence check using state equation in 107 ms returned sat
[2026-05-26 21:45:07] [INFO ] [Nat]Added 35 Read/Feed constraints in 16 ms returned sat
[2026-05-26 21:45:07] [INFO ] Computed and/alt/rep : 128/713/128 causal constraints (skipped 102 transitions) in 26 ms.
[2026-05-26 21:45:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 379 ms
[2026-05-26 21:45:08] [INFO ] Added : 74 causal constraints over 15 iterations in 1056 ms. Result :sat
Minimization took 177 ms.
[2026-05-26 21:45:08] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2026-05-26 21:45:08] [INFO ] [Real]Absence check using state equation in 106 ms returned sat
[2026-05-26 21:45:08] [INFO ] [Real]Added 35 Read/Feed constraints in 13 ms returned sat
[2026-05-26 21:45:08] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 21:45:08] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2026-05-26 21:45:09] [INFO ] [Nat]Absence check using state equation in 106 ms returned sat
[2026-05-26 21:45:09] [INFO ] [Nat]Added 35 Read/Feed constraints in 15 ms returned sat
[2026-05-26 21:45:09] [INFO ] Computed and/alt/rep : 128/713/128 causal constraints (skipped 102 transitions) in 26 ms.
[2026-05-26 21:45:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 318 ms
[2026-05-26 21:45:09] [INFO ] Added : 55 causal constraints over 14 iterations in 825 ms. Result :sat
Minimization took 203 ms.
[2026-05-26 21:45:10] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2026-05-26 21:45:10] [INFO ] [Real]Absence check using state equation in 110 ms returned sat
[2026-05-26 21:45:10] [INFO ] [Real]Added 35 Read/Feed constraints in 11 ms returned sat
[2026-05-26 21:45:10] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 21:45:10] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2026-05-26 21:45:10] [INFO ] [Nat]Absence check using state equation in 101 ms returned sat
[2026-05-26 21:45:10] [INFO ] [Nat]Added 35 Read/Feed constraints in 13 ms returned sat
[2026-05-26 21:45:10] [INFO ] Computed and/alt/rep : 128/713/128 causal constraints (skipped 102 transitions) in 25 ms.
[2026-05-26 21:45:10] [INFO ] Added : 49 causal constraints over 10 iterations in 390 ms. Result :sat
Minimization took 164 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
Support contains 5 out of 85 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 235/235 transitions.
Applied a total of 0 rules in 11 ms. Remains 85 /85 variables (removed 0) and now considering 235/235 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 85/85 places, 235/235 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 235/235 transitions.
Applied a total of 0 rules in 10 ms. Remains 85 /85 variables (removed 0) and now considering 235/235 (removed 0) transitions.
[2026-05-26 21:45:11] [INFO ] Flow matrix only has 232 transitions (discarded 3 similar events)
[2026-05-26 21:45:11] [INFO ] Invariant cache hit.
[2026-05-26 21:45:11] [INFO ] Implicit Places using invariants in 168 ms returned []
[2026-05-26 21:45:11] [INFO ] Flow matrix only has 232 transitions (discarded 3 similar events)
[2026-05-26 21:45:11] [INFO ] Invariant cache hit.
[2026-05-26 21:45:11] [INFO ] State equation strengthened by 35 read => feed constraints.
[2026-05-26 21:45:11] [INFO ] Implicit Places using invariants and state equation in 428 ms returned []
Implicit Place search using SMT with State Equation took 608 ms to find 0 implicit places.
[2026-05-26 21:45:11] [INFO ] Redundant transitions in 20 ms returned []
Running 233 sub problems to find dead transitions.
[2026-05-26 21:45:12] [INFO ] Flow matrix only has 232 transitions (discarded 3 similar events)
[2026-05-26 21:45:12] [INFO ] Invariant cache hit.
[2026-05-26 21:45:12] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 1 (OVERLAPS) 1/85 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 233 unsolved
Problem TDEAD31 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD227 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 7/11 constraints. Problems are: Problem set: 18 solved, 215 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 0/11 constraints. Problems are: Problem set: 18 solved, 215 unsolved
At refinement iteration 4 (OVERLAPS) 232/317 variables, 85/96 constraints. Problems are: Problem set: 18 solved, 215 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/317 variables, 35/131 constraints. Problems are: Problem set: 18 solved, 215 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/317 variables, 0/131 constraints. Problems are: Problem set: 18 solved, 215 unsolved
At refinement iteration 7 (OVERLAPS) 0/317 variables, 0/131 constraints. Problems are: Problem set: 18 solved, 215 unsolved
No progress, stopping.
After SMT solving in domain Real declared 317/317 variables, and 131 constraints, problems are : Problem set: 18 solved, 215 unsolved in 14188 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 85/85 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 233/233 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 18 solved, 215 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 0/0 constraints. Problems are: Problem set: 18 solved, 215 unsolved
At refinement iteration 1 (OVERLAPS) 1/85 variables, 4/4 constraints. Problems are: Problem set: 18 solved, 215 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 7/11 constraints. Problems are: Problem set: 18 solved, 215 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 0/11 constraints. Problems are: Problem set: 18 solved, 215 unsolved
At refinement iteration 4 (OVERLAPS) 232/317 variables, 85/96 constraints. Problems are: Problem set: 18 solved, 215 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/317 variables, 35/131 constraints. Problems are: Problem set: 18 solved, 215 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/317 variables, 215/346 constraints. Problems are: Problem set: 18 solved, 215 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/317 variables, 1/347 constraints. Problems are: Problem set: 18 solved, 215 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 317/317 variables, and 347 constraints, problems are : Problem set: 18 solved, 215 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 85/85 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 215/233 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 44567ms problems are : Problem set: 18 solved, 215 unsolved
Search for dead transitions found 18 dead transitions in 44609ms
Found 18 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 18 transitions
Dead transitions reduction (with SMT) removed 18 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 85/85 places, 217/235 transitions.
Applied a total of 0 rules in 6 ms. Remains 85 /85 variables (removed 0) and now considering 217/217 (removed 0) transitions.
[2026-05-26 21:45:56] [INFO ] Redundant transitions in 10 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 45332 ms. Remains : 85/85 places, 217/235 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2215550864908384934.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8258696385032078758.kers'
[2026-05-26 21:45:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2215550864908384934.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8258696385032078758.kers]
Normalized transition count is 214 out of 217 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 214 rows 85 cols 749 entries
Finished phase 1 with 81 SingleSign rule and 0 generalized
[2026-05-26 21:45:56] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8258696385032078758.kers
Total runtime 1 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (97963 resets) in 1186 ms. (842 steps per ms)
BEST_FIRST walk for 5000004 steps (164185 resets) in 2345 ms. (2131 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
[2026-05-26 21:46:00] [INFO ] Flow matrix only has 214 transitions (discarded 3 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10122913980691153341.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1754027473087049892.kers'
[2026-05-26 21:46:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10122913980691153341.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1754027473087049892.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 214 rows 85 cols 749 entries
Finished phase 1 with 81 SingleSign rule and 0 generalized
[2026-05-26 21:46:00] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1754027473087049892.kers
Total runtime 2 ms.
[2026-05-26 21:46:00] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2026-05-26 21:46:00] [INFO ] [Real]Absence check using state equation in 109 ms returned sat
[2026-05-26 21:46:00] [INFO ] State equation strengthened by 35 read => feed constraints.
[2026-05-26 21:46:00] [INFO ] [Real]Added 35 Read/Feed constraints in 12 ms returned sat
[2026-05-26 21:46:00] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 21:46:00] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2026-05-26 21:46:00] [INFO ] [Nat]Absence check using state equation in 107 ms returned sat
[2026-05-26 21:46:00] [INFO ] [Nat]Added 35 Read/Feed constraints in 14 ms returned sat
[2026-05-26 21:46:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 165 ms
[2026-05-26 21:46:00] [INFO ] Computed and/alt/rep : 115/550/115 causal constraints (skipped 97 transitions) in 23 ms.
[2026-05-26 21:46:01] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 739 ms
[2026-05-26 21:46:01] [INFO ] Added : 53 causal constraints over 12 iterations in 1277 ms. Result :sat
Minimization took 153 ms.
[2026-05-26 21:46:02] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2026-05-26 21:46:02] [INFO ] [Real]Absence check using state equation in 101 ms returned sat
[2026-05-26 21:46:02] [INFO ] [Real]Added 35 Read/Feed constraints in 14 ms returned sat
[2026-05-26 21:46:02] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 21:46:02] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2026-05-26 21:46:02] [INFO ] [Nat]Absence check using state equation in 101 ms returned sat
[2026-05-26 21:46:02] [INFO ] [Nat]Added 35 Read/Feed constraints in 14 ms returned sat
[2026-05-26 21:46:02] [INFO ] Computed and/alt/rep : 115/550/115 causal constraints (skipped 97 transitions) in 24 ms.
[2026-05-26 21:46:02] [INFO ] Added : 7 causal constraints over 2 iterations in 99 ms. Result :sat
Minimization took 91 ms.
[2026-05-26 21:46:02] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2026-05-26 21:46:02] [INFO ] [Real]Absence check using state equation in 98 ms returned sat
[2026-05-26 21:46:02] [INFO ] [Real]Added 35 Read/Feed constraints in 12 ms returned sat
[2026-05-26 21:46:02] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 21:46:02] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2026-05-26 21:46:03] [INFO ] [Nat]Absence check using state equation in 100 ms returned sat
[2026-05-26 21:46:03] [INFO ] [Nat]Added 35 Read/Feed constraints in 15 ms returned sat
[2026-05-26 21:46:03] [INFO ] Computed and/alt/rep : 115/550/115 causal constraints (skipped 97 transitions) in 23 ms.
[2026-05-26 21:46:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 203 ms
[2026-05-26 21:46:03] [INFO ] Added : 41 causal constraints over 9 iterations in 525 ms. Result :sat
Minimization took 152 ms.
[2026-05-26 21:46:03] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2026-05-26 21:46:03] [INFO ] [Real]Absence check using state equation in 103 ms returned sat
[2026-05-26 21:46:03] [INFO ] [Real]Added 35 Read/Feed constraints in 12 ms returned sat
[2026-05-26 21:46:03] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 21:46:04] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2026-05-26 21:46:04] [INFO ] [Nat]Absence check using state equation in 99 ms returned sat
[2026-05-26 21:46:04] [INFO ] [Nat]Added 35 Read/Feed constraints in 11 ms returned sat
[2026-05-26 21:46:04] [INFO ] Computed and/alt/rep : 115/550/115 causal constraints (skipped 97 transitions) in 25 ms.
[2026-05-26 21:46:04] [INFO ] Added : 43 causal constraints over 9 iterations in 316 ms. Result :sat
Minimization took 143 ms.
[2026-05-26 21:46:04] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2026-05-26 21:46:04] [INFO ] [Real]Absence check using state equation in 102 ms returned sat
[2026-05-26 21:46:04] [INFO ] [Real]Added 35 Read/Feed constraints in 12 ms returned sat
[2026-05-26 21:46:04] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 21:46:04] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2026-05-26 21:46:04] [INFO ] [Nat]Absence check using state equation in 103 ms returned sat
[2026-05-26 21:46:04] [INFO ] [Nat]Added 35 Read/Feed constraints in 15 ms returned sat
[2026-05-26 21:46:04] [INFO ] Computed and/alt/rep : 115/550/115 causal constraints (skipped 97 transitions) in 23 ms.
[2026-05-26 21:46:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 170 ms
[2026-05-26 21:46:05] [INFO ] Added : 55 causal constraints over 12 iterations in 556 ms. Result :sat
Minimization took 143 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
Support contains 5 out of 85 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 217/217 transitions.
Applied a total of 0 rules in 9 ms. Remains 85 /85 variables (removed 0) and now considering 217/217 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 85/85 places, 217/217 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 217/217 transitions.
Applied a total of 0 rules in 8 ms. Remains 85 /85 variables (removed 0) and now considering 217/217 (removed 0) transitions.
[2026-05-26 21:46:06] [INFO ] Flow matrix only has 214 transitions (discarded 3 similar events)
[2026-05-26 21:46:06] [INFO ] Invariant cache hit.
[2026-05-26 21:46:06] [INFO ] Implicit Places using invariants in 165 ms returned []
[2026-05-26 21:46:06] [INFO ] Flow matrix only has 214 transitions (discarded 3 similar events)
[2026-05-26 21:46:06] [INFO ] Invariant cache hit.
[2026-05-26 21:46:06] [INFO ] State equation strengthened by 35 read => feed constraints.
[2026-05-26 21:46:06] [INFO ] Implicit Places using invariants and state equation in 324 ms returned []
Implicit Place search using SMT with State Equation took 491 ms to find 0 implicit places.
[2026-05-26 21:46:06] [INFO ] Redundant transitions in 6 ms returned []
Running 215 sub problems to find dead transitions.
[2026-05-26 21:46:06] [INFO ] Flow matrix only has 214 transitions (discarded 3 similar events)
[2026-05-26 21:46:06] [INFO ] Invariant cache hit.
[2026-05-26 21:46:06] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (OVERLAPS) 1/85 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 215 unsolved
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD191 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 4/8 constraints. Problems are: Problem set: 40 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 1/9 constraints. Problems are: Problem set: 40 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 0/9 constraints. Problems are: Problem set: 40 solved, 175 unsolved
At refinement iteration 5 (OVERLAPS) 214/299 variables, 85/94 constraints. Problems are: Problem set: 40 solved, 175 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/299 variables, 35/129 constraints. Problems are: Problem set: 40 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/299 variables, 0/129 constraints. Problems are: Problem set: 40 solved, 175 unsolved
At refinement iteration 8 (OVERLAPS) 0/299 variables, 0/129 constraints. Problems are: Problem set: 40 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Real declared 299/299 variables, and 129 constraints, problems are : Problem set: 40 solved, 175 unsolved in 12455 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 85/85 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 40 solved, 175 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 0/0 constraints. Problems are: Problem set: 40 solved, 175 unsolved
At refinement iteration 1 (OVERLAPS) 1/85 variables, 4/4 constraints. Problems are: Problem set: 40 solved, 175 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 5/9 constraints. Problems are: Problem set: 40 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 0/9 constraints. Problems are: Problem set: 40 solved, 175 unsolved
At refinement iteration 4 (OVERLAPS) 214/299 variables, 85/94 constraints. Problems are: Problem set: 40 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/299 variables, 35/129 constraints. Problems are: Problem set: 40 solved, 175 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/299 variables, 175/304 constraints. Problems are: Problem set: 40 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/299 variables, 0/304 constraints. Problems are: Problem set: 40 solved, 175 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 299/299 variables, and 305 constraints, problems are : Problem set: 40 solved, 175 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 85/85 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 175/215 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 42599ms problems are : Problem set: 40 solved, 175 unsolved
Search for dead transitions found 40 dead transitions in 42601ms
Found 40 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 40 transitions
Dead transitions reduction (with SMT) removed 40 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 85/85 places, 177/217 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 84 transition count 182
Applied a total of 2 rules in 12 ms. Remains 84 /85 variables (removed 1) and now considering 182/177 (removed -5) transitions.
[2026-05-26 21:46:49] [INFO ] Flow matrix only has 179 transitions (discarded 3 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8108207441175893688.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9408868273199846178.kers'
[2026-05-26 21:46:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8108207441175893688.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9408868273199846178.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 179 rows 84 cols 639 entries
Finished phase 1 with 80 SingleSign rule and 0 generalized
[2026-05-26 21:46:49] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-9408868273199846178.kers
Total runtime 1 ms.
[2026-05-26 21:46:49] [INFO ] Implicit Places using invariants in 157 ms returned []
[2026-05-26 21:46:49] [INFO ] Flow matrix only has 179 transitions (discarded 3 similar events)
[2026-05-26 21:46:49] [INFO ] Invariant cache hit.
[2026-05-26 21:46:49] [INFO ] State equation strengthened by 23 read => feed constraints.
[2026-05-26 21:46:49] [INFO ] Implicit Places using invariants and state equation in 323 ms returned []
Implicit Place search using SMT with State Equation took 482 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 84/85 places, 182/217 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 43614 ms. Remains : 84/85 places, 182/217 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8880931491913150728.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-183154318655897588.kers'
[2026-05-26 21:46:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8880931491913150728.kers, --Pflows, --basisKERS=/tmp/petrispot-output-183154318655897588.kers]
Normalized transition count is 179 out of 182 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 179 rows 84 cols 639 entries
Finished phase 1 with 80 SingleSign rule and 0 generalized
[2026-05-26 21:46:49] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-183154318655897588.kers
Total runtime 8 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (98016 resets) in 1443 ms. (692 steps per ms)
BEST_FIRST walk for 5000001 steps (164098 resets) in 2035 ms. (2455 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
[2026-05-26 21:46:53] [INFO ] Flow matrix only has 179 transitions (discarded 3 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4055649799604773332.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-87446096381487644.kers'
[2026-05-26 21:46:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4055649799604773332.kers, --Pflows, --basisKERS=/tmp/petrispot-output-87446096381487644.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 179 rows 84 cols 639 entries
Finished phase 1 with 80 SingleSign rule and 0 generalized
[2026-05-26 21:46:53] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-87446096381487644.kers
Total runtime 1 ms.
[2026-05-26 21:46:53] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2026-05-26 21:46:53] [INFO ] [Real]Absence check using state equation in 62 ms returned sat
[2026-05-26 21:46:53] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 21:46:53] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2026-05-26 21:46:53] [INFO ] [Nat]Absence check using state equation in 62 ms returned sat
[2026-05-26 21:46:53] [INFO ] State equation strengthened by 23 read => feed constraints.
[2026-05-26 21:46:53] [INFO ] [Nat]Added 23 Read/Feed constraints in 8 ms returned sat
[2026-05-26 21:46:53] [INFO ] Computed and/alt/rep : 102/595/102 causal constraints (skipped 75 transitions) in 14 ms.
[2026-05-26 21:46:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 141 ms
[2026-05-26 21:46:53] [INFO ] Added : 46 causal constraints over 10 iterations in 359 ms. Result :sat
Minimization took 157 ms.
[2026-05-26 21:46:53] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2026-05-26 21:46:54] [INFO ] [Real]Absence check using state equation in 89 ms returned sat
[2026-05-26 21:46:54] [INFO ] [Real]Added 23 Read/Feed constraints in 12 ms returned sat
[2026-05-26 21:46:54] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 21:46:54] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2026-05-26 21:46:54] [INFO ] [Nat]Absence check using state equation in 88 ms returned sat
[2026-05-26 21:46:54] [INFO ] [Nat]Added 23 Read/Feed constraints in 10 ms returned sat
[2026-05-26 21:46:54] [INFO ] Computed and/alt/rep : 102/595/102 causal constraints (skipped 75 transitions) in 22 ms.
[2026-05-26 21:46:54] [INFO ] Added : 3 causal constraints over 2 iterations in 79 ms. Result :sat
Minimization took 88 ms.
[2026-05-26 21:46:54] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2026-05-26 21:46:54] [INFO ] [Real]Absence check using state equation in 91 ms returned sat
[2026-05-26 21:46:54] [INFO ] [Real]Added 23 Read/Feed constraints in 11 ms returned sat
[2026-05-26 21:46:54] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 21:46:54] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2026-05-26 21:46:54] [INFO ] [Nat]Absence check using state equation in 89 ms returned sat
[2026-05-26 21:46:54] [INFO ] [Nat]Added 23 Read/Feed constraints in 13 ms returned sat
[2026-05-26 21:46:54] [INFO ] Computed and/alt/rep : 102/595/102 causal constraints (skipped 75 transitions) in 21 ms.
[2026-05-26 21:46:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 166 ms
[2026-05-26 21:46:55] [INFO ] Added : 65 causal constraints over 13 iterations in 635 ms. Result :sat
Minimization took 159 ms.
[2026-05-26 21:46:55] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2026-05-26 21:46:55] [INFO ] [Real]Absence check using state equation in 89 ms returned sat
[2026-05-26 21:46:55] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 21:46:55] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2026-05-26 21:46:55] [INFO ] [Nat]Absence check using state equation in 96 ms returned sat
[2026-05-26 21:46:55] [INFO ] [Nat]Added 23 Read/Feed constraints in 12 ms returned sat
[2026-05-26 21:46:55] [INFO ] Computed and/alt/rep : 102/595/102 causal constraints (skipped 75 transitions) in 22 ms.
[2026-05-26 21:46:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 114 ms
[2026-05-26 21:46:56] [INFO ] Added : 45 causal constraints over 10 iterations in 432 ms. Result :sat
Minimization took 138 ms.
[2026-05-26 21:46:56] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2026-05-26 21:46:56] [INFO ] [Real]Absence check using state equation in 90 ms returned sat
[2026-05-26 21:46:56] [INFO ] [Real]Added 23 Read/Feed constraints in 12 ms returned sat
[2026-05-26 21:46:56] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 21:46:56] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2026-05-26 21:46:56] [INFO ] [Nat]Absence check using state equation in 91 ms returned sat
[2026-05-26 21:46:56] [INFO ] [Nat]Added 23 Read/Feed constraints in 13 ms returned sat
[2026-05-26 21:46:56] [INFO ] Computed and/alt/rep : 102/595/102 causal constraints (skipped 75 transitions) in 21 ms.
[2026-05-26 21:46:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 168 ms
[2026-05-26 21:46:57] [INFO ] Added : 64 causal constraints over 13 iterations in 716 ms. Result :sat
Minimization took 197 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
Support contains 5 out of 84 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 182/182 transitions.
Applied a total of 0 rules in 10 ms. Remains 84 /84 variables (removed 0) and now considering 182/182 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 84/84 places, 182/182 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 182/182 transitions.
Applied a total of 0 rules in 7 ms. Remains 84 /84 variables (removed 0) and now considering 182/182 (removed 0) transitions.
[2026-05-26 21:46:57] [INFO ] Flow matrix only has 179 transitions (discarded 3 similar events)
[2026-05-26 21:46:57] [INFO ] Invariant cache hit.
[2026-05-26 21:46:57] [INFO ] Implicit Places using invariants in 162 ms returned []
[2026-05-26 21:46:57] [INFO ] Flow matrix only has 179 transitions (discarded 3 similar events)
[2026-05-26 21:46:57] [INFO ] Invariant cache hit.
[2026-05-26 21:46:58] [INFO ] State equation strengthened by 23 read => feed constraints.
[2026-05-26 21:46:58] [INFO ] Implicit Places using invariants and state equation in 352 ms returned []
Implicit Place search using SMT with State Equation took 519 ms to find 0 implicit places.
[2026-05-26 21:46:58] [INFO ] Redundant transitions in 3 ms returned []
Running 180 sub problems to find dead transitions.
[2026-05-26 21:46:58] [INFO ] Flow matrix only has 179 transitions (discarded 3 similar events)
[2026-05-26 21:46:58] [INFO ] Invariant cache hit.
[2026-05-26 21:46:58] [INFO ] State equation strengthened by 23 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 1 (OVERLAPS) 1/84 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 3/7 constraints. Problems are: Problem set: 3 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 0/7 constraints. Problems are: Problem set: 3 solved, 177 unsolved
At refinement iteration 4 (OVERLAPS) 179/263 variables, 84/91 constraints. Problems are: Problem set: 3 solved, 177 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/263 variables, 23/114 constraints. Problems are: Problem set: 3 solved, 177 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/263 variables, 0/114 constraints. Problems are: Problem set: 3 solved, 177 unsolved
At refinement iteration 7 (OVERLAPS) 0/263 variables, 0/114 constraints. Problems are: Problem set: 3 solved, 177 unsolved
No progress, stopping.
After SMT solving in domain Real declared 263/263 variables, and 114 constraints, problems are : Problem set: 3 solved, 177 unsolved in 11463 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 84/84 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 180/180 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 177 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 177 unsolved
At refinement iteration 1 (OVERLAPS) 1/84 variables, 4/4 constraints. Problems are: Problem set: 3 solved, 177 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 3/7 constraints. Problems are: Problem set: 3 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 0/7 constraints. Problems are: Problem set: 3 solved, 177 unsolved
At refinement iteration 4 (OVERLAPS) 179/263 variables, 84/91 constraints. Problems are: Problem set: 3 solved, 177 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/263 variables, 23/114 constraints. Problems are: Problem set: 3 solved, 177 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/263 variables, 177/291 constraints. Problems are: Problem set: 3 solved, 177 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/263 variables, 1/292 constraints. Problems are: Problem set: 3 solved, 177 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 263/263 variables, and 292 constraints, problems are : Problem set: 3 solved, 177 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 84/84 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 177/180 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41572ms problems are : Problem set: 3 solved, 177 unsolved
Search for dead transitions found 3 dead transitions in 41575ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 84/84 places, 179/182 transitions.
Applied a total of 0 rules in 5 ms. Remains 84 /84 variables (removed 0) and now considering 179/179 (removed 0) transitions.
[2026-05-26 21:47:39] [INFO ] Redundant transitions in 2 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 42127 ms. Remains : 84/84 places, 179/182 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15166441367898005424.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6442730316905894856.kers'
[2026-05-26 21:47:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15166441367898005424.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6442730316905894856.kers]
Normalized transition count is 176 out of 179 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 176 rows 84 cols 627 entries
Finished phase 1 with 80 SingleSign rule and 0 generalized
[2026-05-26 21:47:39] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6442730316905894856.kers
Total runtime 1 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (98055 resets) in 1114 ms. (896 steps per ms)
BEST_FIRST walk for 5000003 steps (163953 resets) in 1981 ms. (2522 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
[2026-05-26 21:47:43] [INFO ] Flow matrix only has 176 transitions (discarded 3 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2591490893144843070.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7712530186548140050.kers'
[2026-05-26 21:47:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2591490893144843070.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7712530186548140050.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 176 rows 84 cols 627 entries
Finished phase 1 with 80 SingleSign rule and 0 generalized
[2026-05-26 21:47:43] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7712530186548140050.kers
Total runtime 1 ms.
[2026-05-26 21:47:43] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2026-05-26 21:47:43] [INFO ] [Real]Absence check using state equation in 87 ms returned sat
[2026-05-26 21:47:43] [INFO ] State equation strengthened by 23 read => feed constraints.
[2026-05-26 21:47:43] [INFO ] [Real]Added 23 Read/Feed constraints in 12 ms returned sat
[2026-05-26 21:47:43] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 21:47:43] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2026-05-26 21:47:43] [INFO ] [Nat]Absence check using state equation in 86 ms returned sat
[2026-05-26 21:47:43] [INFO ] [Nat]Added 23 Read/Feed constraints in 12 ms returned sat
[2026-05-26 21:47:43] [INFO ] Computed and/alt/rep : 99/555/99 causal constraints (skipped 75 transitions) in 20 ms.
[2026-05-26 21:47:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 133 ms
[2026-05-26 21:47:43] [INFO ] Added : 46 causal constraints over 10 iterations in 430 ms. Result :sat
Minimization took 143 ms.
[2026-05-26 21:47:44] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2026-05-26 21:47:44] [INFO ] [Real]Absence check using state equation in 92 ms returned sat
[2026-05-26 21:47:44] [INFO ] [Real]Added 23 Read/Feed constraints in 12 ms returned sat
[2026-05-26 21:47:44] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 21:47:44] [INFO ] [Nat]Absence check using 4 positive place invariants in 5 ms returned sat
[2026-05-26 21:47:44] [INFO ] [Nat]Absence check using state equation in 94 ms returned sat
[2026-05-26 21:47:44] [INFO ] [Nat]Added 23 Read/Feed constraints in 11 ms returned sat
[2026-05-26 21:47:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 129 ms
[2026-05-26 21:47:44] [INFO ] Computed and/alt/rep : 99/555/99 causal constraints (skipped 75 transitions) in 21 ms.
[2026-05-26 21:47:44] [INFO ] Added : 45 causal constraints over 10 iterations in 290 ms. Result :sat
Minimization took 137 ms.
[2026-05-26 21:47:44] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2026-05-26 21:47:45] [INFO ] [Real]Absence check using state equation in 92 ms returned sat
[2026-05-26 21:47:45] [INFO ] [Real]Added 23 Read/Feed constraints in 14 ms returned sat
[2026-05-26 21:47:45] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 21:47:45] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2026-05-26 21:47:45] [INFO ] [Nat]Absence check using state equation in 93 ms returned sat
[2026-05-26 21:47:45] [INFO ] [Nat]Added 23 Read/Feed constraints in 15 ms returned sat
[2026-05-26 21:47:45] [INFO ] Computed and/alt/rep : 99/555/99 causal constraints (skipped 75 transitions) in 20 ms.
[2026-05-26 21:47:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 167 ms
[2026-05-26 21:47:45] [INFO ] Added : 62 causal constraints over 13 iterations in 630 ms. Result :sat
Minimization took 170 ms.
[2026-05-26 21:47:46] [INFO ] [Real]Absence check using 4 positive place invariants in 5 ms returned sat
[2026-05-26 21:47:46] [INFO ] [Real]Absence check using state equation in 96 ms returned sat
[2026-05-26 21:47:46] [INFO ] [Real]Added 23 Read/Feed constraints in 14 ms returned sat
[2026-05-26 21:47:46] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 21:47:46] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2026-05-26 21:47:46] [INFO ] [Nat]Absence check using state equation in 98 ms returned sat
[2026-05-26 21:47:46] [INFO ] [Nat]Added 23 Read/Feed constraints in 18 ms returned sat
[2026-05-26 21:47:46] [INFO ] Computed and/alt/rep : 99/555/99 causal constraints (skipped 75 transitions) in 26 ms.
[2026-05-26 21:47:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 297 ms
[2026-05-26 21:47:47] [INFO ] Added : 48 causal constraints over 11 iterations in 672 ms. Result :sat
Minimization took 143 ms.
[2026-05-26 21:47:47] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2026-05-26 21:47:47] [INFO ] [Real]Absence check using state equation in 94 ms returned sat
[2026-05-26 21:47:47] [INFO ] [Real]Added 23 Read/Feed constraints in 14 ms returned sat
[2026-05-26 21:47:47] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 21:47:47] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2026-05-26 21:47:47] [INFO ] [Nat]Absence check using state equation in 93 ms returned sat
[2026-05-26 21:47:47] [INFO ] [Nat]Added 23 Read/Feed constraints in 15 ms returned sat
[2026-05-26 21:47:47] [INFO ] Computed and/alt/rep : 99/555/99 causal constraints (skipped 75 transitions) in 22 ms.
[2026-05-26 21:47:48] [INFO ] Added : 64 causal constraints over 13 iterations in 509 ms. Result :sat
Minimization took 156 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
Support contains 5 out of 84 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 179/179 transitions.
Applied a total of 0 rules in 6 ms. Remains 84 /84 variables (removed 0) and now considering 179/179 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 84/84 places, 179/179 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 179/179 transitions.
Applied a total of 0 rules in 6 ms. Remains 84 /84 variables (removed 0) and now considering 179/179 (removed 0) transitions.
[2026-05-26 21:47:48] [INFO ] Flow matrix only has 176 transitions (discarded 3 similar events)
[2026-05-26 21:47:48] [INFO ] Invariant cache hit.
[2026-05-26 21:47:48] [INFO ] Implicit Places using invariants in 163 ms returned []
[2026-05-26 21:47:48] [INFO ] Flow matrix only has 176 transitions (discarded 3 similar events)
[2026-05-26 21:47:48] [INFO ] Invariant cache hit.
[2026-05-26 21:47:48] [INFO ] State equation strengthened by 23 read => feed constraints.
[2026-05-26 21:47:48] [INFO ] Implicit Places using invariants and state equation in 305 ms returned []
Implicit Place search using SMT with State Equation took 471 ms to find 0 implicit places.
[2026-05-26 21:47:48] [INFO ] Redundant transitions in 1 ms returned []
Running 177 sub problems to find dead transitions.
[2026-05-26 21:47:48] [INFO ] Flow matrix only has 176 transitions (discarded 3 similar events)
[2026-05-26 21:47:48] [INFO ] Invariant cache hit.
[2026-05-26 21:47:48] [INFO ] State equation strengthened by 23 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (OVERLAPS) 1/84 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 4 (OVERLAPS) 176/260 variables, 84/91 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/260 variables, 23/114 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/260 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 7 (OVERLAPS) 0/260 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 177 unsolved
No progress, stopping.
After SMT solving in domain Real declared 260/260 variables, and 114 constraints, problems are : Problem set: 0 solved, 177 unsolved in 12139 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 84/84 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 177 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (OVERLAPS) 1/84 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 4 (OVERLAPS) 176/260 variables, 84/91 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/260 variables, 23/114 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/260 variables, 177/291 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/260 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 260/260 variables, and 291 constraints, problems are : Problem set: 0 solved, 177 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 84/84 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 42220ms problems are : Problem set: 0 solved, 177 unsolved
Search for dead transitions found 0 dead transitions in 42222ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42708 ms. Remains : 84/84 places, 179/179 transitions.
RANDOM walk for 40000 steps (3938 resets) in 1629 ms. (24 steps per ms) remains 10/10 properties
[2026-05-26 21:48:31] [INFO ] Flatten gal took : 160 ms
[2026-05-26 21:48:31] [INFO ] Flatten gal took : 75 ms
BEST_FIRST walk for 40004 steps (1300 resets) in 529 ms. (75 steps per ms) remains 10/10 properties
[2026-05-26 21:48:31] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8482404122725185779.gal : 38 ms
[2026-05-26 21:48:31] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14152066965584476282.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/ReachabilityCardinality8482404122725185779.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14152066965584476282.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/ReachabilityCardinality14152066965584476282.prop.
SDD proceeding with computation,10 properties remain. new max is 4
BEST_FIRST walk for 40004 steps (1304 resets) in 527 ms. (75 steps per ms) remains 10/10 properties
SDD size :1 after 7
SDD proceeding with computation,10 properties remain. new max is 8
SDD size :7 after 9
SDD proceeding with computation,10 properties remain. new max is 16
SDD size :9 after 47
SDD proceeding with computation,10 properties remain. new max is 32
SDD size :47 after 63
SDD proceeding with computation,10 properties remain. new max is 64
SDD size :63 after 73
SDD proceeding with computation,10 properties remain. new max is 128
SDD size :73 after 349
BEST_FIRST walk for 40004 steps (1326 resets) in 155 ms. (256 steps per ms) remains 10/10 properties
SDD proceeding with computation,10 properties remain. new max is 256
SDD size :349 after 805
BEST_FIRST walk for 40003 steps (1308 resets) in 144 ms. (275 steps per ms) remains 10/10 properties
Invariant property MIN1 does not hold.
Reachability property MAX1 is true.
SDD proceeding with computation,8 properties remain. new max is 256
SDD size :805 after 1817
BEST_FIRST walk for 40003 steps (1313 resets) in 130 ms. (305 steps per ms) remains 10/10 properties
SDD proceeding with computation,8 properties remain. new max is 512
SDD size :1817 after 2801
BEST_FIRST walk for 40002 steps (1317 resets) in 139 ms. (285 steps per ms) remains 10/10 properties
Invariant property MIN0 does not hold.
Reachability property MAX0 is true.
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :2801 after 4601
BEST_FIRST walk for 40004 steps (1319 resets) in 135 ms. (294 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (1328 resets) in 157 ms. (253 steps per ms) remains 10/10 properties
SDD proceeding with computation,6 properties remain. new max is 1024
SDD size :4601 after 5894
BEST_FIRST walk for 40004 steps (1323 resets) in 165 ms. (240 steps per ms) remains 10/10 properties
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,10357,0.338458,12460,2,1663,18,25619,12,0,524,30145,0
Total reachable state count : 10357
Verifying 10 reachability properties.
Reachability property MAX0 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX0,24,0.341256,12496,2,142,18,25619,13,0,527,30145,0
Invariant property MIN0 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
MIN0,24,0.341963,12696,2,142,18,25619,14,0,528,30145,0
Reachability property MAX1 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX1,90,0.3423,12696,2,244,18,25619,15,0,530,30145,0
Invariant property MIN1 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
MIN1,90,0.342578,12696,2,244,18,25619,16,0,531,30145,0
Reachability property MAX2 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX2,344,0.342883,12696,2,362,18,25619,16,0,532,30145,0
Invariant property MIN2 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
MIN2,344,0.343167,12696,2,362,18,25619,16,0,532,30145,0
Reachability property MAX3 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX3,24,0.343404,12696,2,142,18,25619,16,0,533,30145,0
Invariant property MIN3 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
MIN3,24,0.343719,12696,2,142,18,25619,16,0,533,30145,0
Reachability property MAX4 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX4,344,0.344026,12696,2,362,18,25619,16,0,534,30145,0
Invariant property MIN4 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
MIN4,344,0.344318,12696,2,362,18,25619,16,0,534,30145,0
BEST_FIRST walk for 40002 steps (1303 resets) in 95 ms. (416 steps per ms) remains 10/10 properties
Finished probabilistic random walk after 14799 steps, run visited all 10 properties in 176 ms. (steps per millisecond=84 )
Probabilistic random walk after 14799 steps, saw 5143 distinct states, run finished after 181 ms. (steps per millisecond=81 ) properties seen :10
FORMULA FireWire-PT-15-UpperBounds-01 1 TECHNIQUES REACHABILITY_MAX
FORMULA FireWire-PT-15-UpperBounds-05 1 TECHNIQUES REACHABILITY_MAX
FORMULA FireWire-PT-15-UpperBounds-09 1 TECHNIQUES REACHABILITY_MAX
FORMULA FireWire-PT-15-UpperBounds-11 1 TECHNIQUES REACHABILITY_MAX
FORMULA FireWire-PT-15-UpperBounds-15 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (after reachability check) : Max Seen:[] Max Struct:[]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12156384606485312886.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6002398359984919447.kers'
[2026-05-26 21:48:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12156384606485312886.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6002398359984919447.kers]
Normalized transition count is 176 out of 179 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 176 rows 84 cols 627 entries
Finished phase 1 with 80 SingleSign rule and 0 generalized
[2026-05-26 21:48:32] [INFO ] Computed 4 invariants in 3 ms
Computed 4 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-6002398359984919447.kers
Total runtime 4 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[] Max Struct:[]
RANDOM walk for 1000000 steps (97998 resets) in 1056 ms. (946 steps per ms)
BEST_FIRST walk for 0 steps (0 resets) in 0 ms. (0 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 283860 ms.
BK_STOP 1779832113688
--------------------
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
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -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 UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FireWire-PT-15"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5973"
echo " Executing tool itstools"
echo " Input is FireWire-PT-15, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r130-smll-177955809000261"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FireWire-PT-15.tgz
mv FireWire-PT-15 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "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 [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "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 "UpperBounds.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 '
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
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 ;