About the Execution of ITS-Tools for DBSingleClientW-PT-d0m10
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 801.380 | 95378.00 | 196920.00 | 306.30 | 8 0 0 0 0 0 1 0 0 0 0 0 7 0 0 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.r082-smll-177946993500133.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 DBSingleClientW-PT-d0m10, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r082-smll-177946993500133
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 564K
-rw-r--r-- 1 mcc users 6.8K Mar 6 18:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Mar 6 18:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Mar 6 18:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K Mar 6 18:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Mar 15 08:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 15 08:46 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 08:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 15 08:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Mar 6 18:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 107K Mar 6 18:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.8K Mar 6 18:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K Mar 6 18:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 08:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 08:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 119K 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 DBSingleClientW-PT-d0m10-UpperBounds-00
FORMULA_NAME DBSingleClientW-PT-d0m10-UpperBounds-01
FORMULA_NAME DBSingleClientW-PT-d0m10-UpperBounds-02
FORMULA_NAME DBSingleClientW-PT-d0m10-UpperBounds-03
FORMULA_NAME DBSingleClientW-PT-d0m10-UpperBounds-04
FORMULA_NAME DBSingleClientW-PT-d0m10-UpperBounds-05
FORMULA_NAME DBSingleClientW-PT-d0m10-UpperBounds-06
FORMULA_NAME DBSingleClientW-PT-d0m10-UpperBounds-07
FORMULA_NAME DBSingleClientW-PT-d0m10-UpperBounds-08
FORMULA_NAME DBSingleClientW-PT-d0m10-UpperBounds-09
FORMULA_NAME DBSingleClientW-PT-d0m10-UpperBounds-10
FORMULA_NAME DBSingleClientW-PT-d0m10-UpperBounds-11
FORMULA_NAME DBSingleClientW-PT-d0m10-UpperBounds-12
FORMULA_NAME DBSingleClientW-PT-d0m10-UpperBounds-13
FORMULA_NAME DBSingleClientW-PT-d0m10-UpperBounds-14
FORMULA_NAME DBSingleClientW-PT-d0m10-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1779562265764
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d0m10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202604301425
[2026-05-23 18:51:07] [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-23 18:51:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 18:51:08] [INFO ] Load time of PNML (sax parser for PT used): 170 ms
[2026-05-23 18:51:08] [INFO ] Transformed 553 places.
[2026-05-23 18:51:08] [INFO ] Transformed 150 transitions.
[2026-05-23 18:51:08] [INFO ] Parsed PT model containing 553 places and 150 transitions and 600 arcs in 384 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 15 ms.
Deduced a syphon composed of 444 places in 3 ms
Reduce places removed 444 places and 0 transitions.
FORMULA DBSingleClientW-PT-d0m10-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m10-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m10-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m10-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m10-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m10-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m10-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m10-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m10-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m10-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m10-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m10-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17774908308377660553.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9472555259910106065.kers'
[2026-05-23 18:51:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17774908308377660553.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9472555259910106065.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 150 rows 109 cols 450 entries
Finished phase 1 with 59 SingleSign rule and 44 generalized
[2026-05-23 18:51:08] [INFO ] Computed 6 invariants in 1 ms
Computed 6 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-9472555259910106065.kers
Total runtime 3 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0] Max Struct:[28, 1, 28, 1]
RANDOM walk for 10000 steps (2279 resets) in 107 ms. (92 steps per ms)
FORMULA DBSingleClientW-PT-d0m10-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 30001 steps (3033 resets) in 176 ms. (169 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2, 0, 0] Max Struct:[28, 1, 28]
[2026-05-23 18:51:08] [INFO ] Invariant cache hit.
[2026-05-23 18:51:09] [INFO ] [Real]Absence check using 3 positive place invariants in 11 ms returned sat
[2026-05-23 18:51:09] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 6 ms returned sat
[2026-05-23 18:51:09] [INFO ] [Real]Absence check using state equation in 129 ms returned sat
[2026-05-23 18:51:09] [INFO ] State equation strengthened by 74 read => feed constraints.
[2026-05-23 18:51:09] [INFO ] [Real]Added 74 Read/Feed constraints in 23 ms returned sat
[2026-05-23 18:51:09] [INFO ] Solution in real domain found non-integer solution.
[2026-05-23 18:51:09] [INFO ] [Nat]Absence check using 3 positive place invariants in 7 ms returned sat
[2026-05-23 18:51:09] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 7 ms returned sat
[2026-05-23 18:51:09] [INFO ] [Nat]Absence check using state equation in 89 ms returned sat
[2026-05-23 18:51:09] [INFO ] [Nat]Added 74 Read/Feed constraints in 22 ms returned sat
[2026-05-23 18:51:09] [INFO ] Computed and/alt/rep : 39/69/39 causal constraints (skipped 110 transitions) in 37 ms.
[2026-05-23 18:51:09] [INFO ] Added : 1 causal constraints over 1 iterations in 88 ms. Result :sat
Minimization took 53 ms.
[2026-05-23 18:51:09] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2026-05-23 18:51:09] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2026-05-23 18:51:09] [INFO ] [Real]Absence check using state equation in 83 ms returned sat
[2026-05-23 18:51:09] [INFO ] [Real]Added 74 Read/Feed constraints in 20 ms returned sat
[2026-05-23 18:51:09] [INFO ] Solution in real domain found non-integer solution.
[2026-05-23 18:51:10] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2026-05-23 18:51:10] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 3 ms returned sat
[2026-05-23 18:51:10] [INFO ] [Nat]Absence check using state equation in 93 ms returned sat
[2026-05-23 18:51:10] [INFO ] [Nat]Added 74 Read/Feed constraints in 17 ms returned sat
[2026-05-23 18:51:10] [INFO ] Computed and/alt/rep : 39/69/39 causal constraints (skipped 110 transitions) in 29 ms.
[2026-05-23 18:51:10] [INFO ] Added : 5 causal constraints over 1 iterations in 76 ms. Result :sat
Minimization took 46 ms.
[2026-05-23 18:51:10] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2026-05-23 18:51:10] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 3 ms returned sat
[2026-05-23 18:51:10] [INFO ] [Real]Absence check using state equation in 77 ms returned sat
[2026-05-23 18:51:10] [INFO ] [Real]Added 74 Read/Feed constraints in 19 ms returned sat
[2026-05-23 18:51:10] [INFO ] Solution in real domain found non-integer solution.
[2026-05-23 18:51:10] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2026-05-23 18:51:10] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 5 ms returned sat
[2026-05-23 18:51:10] [INFO ] [Nat]Absence check using state equation in 79 ms returned sat
[2026-05-23 18:51:10] [INFO ] [Nat]Added 74 Read/Feed constraints in 16 ms returned sat
[2026-05-23 18:51:10] [INFO ] Computed and/alt/rep : 39/69/39 causal constraints (skipped 110 transitions) in 29 ms.
[2026-05-23 18:51:10] [INFO ] Added : 8 causal constraints over 3 iterations in 88 ms. Result :sat
Minimization took 198 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2, 0, 0] Max Struct:[28, 1, 28]
FORMULA DBSingleClientW-PT-d0m10-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2, 0] Max Struct:[28, 28]
Support contains 2 out of 109 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 109/109 places, 150/150 transitions.
Graph (complete) has 332 edges and 109 vertex of which 101 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 ms
Discarding 8 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 101 transition count 137
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 37 place count 78 transition count 96
Iterating global reduction 1 with 23 rules applied. Total rules applied 60 place count 78 transition count 96
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 61 place count 78 transition count 95
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 71 place count 68 transition count 85
Iterating global reduction 2 with 10 rules applied. Total rules applied 81 place count 68 transition count 85
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 83 place count 68 transition count 83
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 85 place count 66 transition count 80
Iterating global reduction 3 with 2 rules applied. Total rules applied 87 place count 66 transition count 80
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 88 place count 66 transition count 79
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 89 place count 65 transition count 77
Iterating global reduction 4 with 1 rules applied. Total rules applied 90 place count 65 transition count 77
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 91 place count 64 transition count 76
Iterating global reduction 4 with 1 rules applied. Total rules applied 92 place count 64 transition count 76
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 93 place count 63 transition count 75
Iterating global reduction 4 with 1 rules applied. Total rules applied 94 place count 63 transition count 75
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 96 place count 63 transition count 73
Applied a total of 96 rules in 125 ms. Remains 63 /109 variables (removed 46) and now considering 73/150 (removed 77) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 143 ms. Remains : 63/109 places, 73/150 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14209898578552682195.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18286480623762185824.kers'
[2026-05-23 18:51:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14209898578552682195.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18286480623762185824.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 73 rows 63 cols 244 entries
Finished phase 1 with 58 SingleSign rule and 3 generalized
[2026-05-23 18:51:11] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-18286480623762185824.kers
Total runtime 1 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[2, 0] Max Struct:[28, 28]
RANDOM walk for 1000000 steps (229178 resets) in 1463 ms. (683 steps per ms)
BEST_FIRST walk for 2000001 steps (202400 resets) in 1261 ms. (1584 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4, 0] Max Struct:[28, 28]
[2026-05-23 18:51:13] [INFO ] Invariant cache hit.
[2026-05-23 18:51:13] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-23 18:51:13] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2026-05-23 18:51:13] [INFO ] State equation strengthened by 21 read => feed constraints.
[2026-05-23 18:51:13] [INFO ] [Real]Added 21 Read/Feed constraints in 7 ms returned sat
[2026-05-23 18:51:13] [INFO ] Solution in real domain found non-integer solution.
[2026-05-23 18:51:14] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-23 18:51:14] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2026-05-23 18:51:14] [INFO ] [Nat]Added 21 Read/Feed constraints in 15 ms returned sat
[2026-05-23 18:51:14] [INFO ] Computed and/alt/rep : 21/44/21 causal constraints (skipped 51 transitions) in 11 ms.
[2026-05-23 18:51:14] [INFO ] Added : 1 causal constraints over 1 iterations in 28 ms. Result :sat
Minimization took 29 ms.
[2026-05-23 18:51:14] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-23 18:51:14] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2026-05-23 18:51:14] [INFO ] [Real]Added 21 Read/Feed constraints in 6 ms returned sat
[2026-05-23 18:51:14] [INFO ] Solution in real domain found non-integer solution.
[2026-05-23 18:51:14] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-23 18:51:14] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2026-05-23 18:51:14] [INFO ] [Nat]Added 21 Read/Feed constraints in 6 ms returned sat
[2026-05-23 18:51:14] [INFO ] Computed and/alt/rep : 21/44/21 causal constraints (skipped 51 transitions) in 11 ms.
[2026-05-23 18:51:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 108 ms
[2026-05-23 18:51:14] [INFO ] Added : 13 causal constraints over 4 iterations in 194 ms. Result :sat
Minimization took 78 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[4, 0] Max Struct:[28, 28]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4, 0] Max Struct:[28, 28]
Support contains 2 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 73/73 transitions.
Applied a total of 0 rules in 10 ms. Remains 63 /63 variables (removed 0) and now considering 73/73 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 63/63 places, 73/73 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 73/73 transitions.
Applied a total of 0 rules in 7 ms. Remains 63 /63 variables (removed 0) and now considering 73/73 (removed 0) transitions.
[2026-05-23 18:51:14] [INFO ] Invariant cache hit.
[2026-05-23 18:51:14] [INFO ] Implicit Places using invariants in 98 ms returned []
[2026-05-23 18:51:14] [INFO ] Invariant cache hit.
[2026-05-23 18:51:14] [INFO ] State equation strengthened by 21 read => feed constraints.
[2026-05-23 18:51:14] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 269 ms to find 0 implicit places.
[2026-05-23 18:51:14] [INFO ] Redundant transitions in 1 ms returned []
Running 72 sub problems to find dead transitions.
[2026-05-23 18:51:14] [INFO ] Invariant cache hit.
[2026-05-23 18:51:14] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (OVERLAPS) 1/63 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (OVERLAPS) 73/136 variables, 63/65 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/136 variables, 21/86 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/136 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/136 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 8 (OVERLAPS) 0/136 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Real declared 136/136 variables, and 87 constraints, problems are : Problem set: 0 solved, 72 unsolved in 4177 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 63/63 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 72 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (OVERLAPS) 1/63 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (OVERLAPS) 73/136 variables, 63/66 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/136 variables, 21/87 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/136 variables, 72/159 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/136 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 9 (OVERLAPS) 0/136 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Int declared 136/136 variables, and 159 constraints, problems are : Problem set: 0 solved, 72 unsolved in 10188 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 63/63 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 14545ms problems are : Problem set: 0 solved, 72 unsolved
Search for dead transitions found 0 dead transitions in 14560ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14877 ms. Remains : 63/63 places, 73/73 transitions.
[2026-05-23 18:51:29] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[4, 0] Max Struct:[28, 28]
RANDOM walk for 1000000 steps (229381 resets) in 1152 ms. (867 steps per ms)
BEST_FIRST walk for 2000000 steps (202828 resets) in 921 ms. (2169 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4, 1] Max Struct:[28, 28]
[2026-05-23 18:51:31] [INFO ] Invariant cache hit.
[2026-05-23 18:51:31] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-23 18:51:31] [INFO ] [Real]Absence check using state equation in 70 ms returned sat
[2026-05-23 18:51:31] [INFO ] State equation strengthened by 21 read => feed constraints.
[2026-05-23 18:51:31] [INFO ] [Real]Added 21 Read/Feed constraints in 4 ms returned sat
[2026-05-23 18:51:31] [INFO ] Solution in real domain found non-integer solution.
[2026-05-23 18:51:31] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-23 18:51:31] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2026-05-23 18:51:31] [INFO ] [Nat]Added 21 Read/Feed constraints in 4 ms returned sat
[2026-05-23 18:51:31] [INFO ] Computed and/alt/rep : 21/44/21 causal constraints (skipped 51 transitions) in 10 ms.
[2026-05-23 18:51:31] [INFO ] Added : 1 causal constraints over 1 iterations in 24 ms. Result :sat
Minimization took 26 ms.
[2026-05-23 18:51:31] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-23 18:51:31] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2026-05-23 18:51:31] [INFO ] [Real]Added 21 Read/Feed constraints in 6 ms returned sat
[2026-05-23 18:51:31] [INFO ] Solution in real domain found non-integer solution.
[2026-05-23 18:51:31] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-23 18:51:31] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2026-05-23 18:51:31] [INFO ] [Nat]Added 21 Read/Feed constraints in 5 ms returned sat
[2026-05-23 18:51:31] [INFO ] Computed and/alt/rep : 21/44/21 causal constraints (skipped 51 transitions) in 9 ms.
[2026-05-23 18:51:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 100 ms
[2026-05-23 18:51:32] [INFO ] Added : 13 causal constraints over 4 iterations in 191 ms. Result :sat
Minimization took 61 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[4, 1] Max Struct:[28, 28]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4, 1] Max Struct:[28, 28]
Support contains 2 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 73/73 transitions.
Applied a total of 0 rules in 7 ms. Remains 63 /63 variables (removed 0) and now considering 73/73 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 63/63 places, 73/73 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 73/73 transitions.
Applied a total of 0 rules in 6 ms. Remains 63 /63 variables (removed 0) and now considering 73/73 (removed 0) transitions.
[2026-05-23 18:51:32] [INFO ] Invariant cache hit.
[2026-05-23 18:51:32] [INFO ] Implicit Places using invariants in 115 ms returned []
[2026-05-23 18:51:32] [INFO ] Invariant cache hit.
[2026-05-23 18:51:32] [INFO ] State equation strengthened by 21 read => feed constraints.
[2026-05-23 18:51:32] [INFO ] Implicit Places using invariants and state equation in 195 ms returned []
Implicit Place search using SMT with State Equation took 313 ms to find 0 implicit places.
[2026-05-23 18:51:32] [INFO ] Redundant transitions in 2 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 326 ms. Remains : 63/63 places, 73/73 transitions.
[2026-05-23 18:51:32] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[4, 1] Max Struct:[28, 28]
RANDOM walk for 1000000 steps (228908 resets) in 947 ms. (1054 steps per ms)
BEST_FIRST walk for 2000002 steps (202369 resets) in 1237 ms. (1615 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4, 1] Max Struct:[28, 28]
[2026-05-23 18:51:34] [INFO ] Invariant cache hit.
[2026-05-23 18:51:34] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2026-05-23 18:51:34] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2026-05-23 18:51:34] [INFO ] State equation strengthened by 21 read => feed constraints.
[2026-05-23 18:51:34] [INFO ] [Real]Added 21 Read/Feed constraints in 9 ms returned sat
[2026-05-23 18:51:34] [INFO ] Solution in real domain found non-integer solution.
[2026-05-23 18:51:34] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2026-05-23 18:51:34] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2026-05-23 18:51:34] [INFO ] [Nat]Added 21 Read/Feed constraints in 6 ms returned sat
[2026-05-23 18:51:35] [INFO ] Computed and/alt/rep : 21/44/21 causal constraints (skipped 51 transitions) in 13 ms.
[2026-05-23 18:51:35] [INFO ] Added : 1 causal constraints over 1 iterations in 35 ms. Result :sat
Minimization took 28 ms.
[2026-05-23 18:51:35] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2026-05-23 18:51:35] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2026-05-23 18:51:35] [INFO ] [Real]Added 21 Read/Feed constraints in 8 ms returned sat
[2026-05-23 18:51:35] [INFO ] Solution in real domain found non-integer solution.
[2026-05-23 18:51:35] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-23 18:51:35] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2026-05-23 18:51:35] [INFO ] [Nat]Added 21 Read/Feed constraints in 8 ms returned sat
[2026-05-23 18:51:35] [INFO ] Computed and/alt/rep : 21/44/21 causal constraints (skipped 51 transitions) in 13 ms.
[2026-05-23 18:51:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 98 ms
[2026-05-23 18:51:35] [INFO ] Added : 13 causal constraints over 4 iterations in 181 ms. Result :sat
Minimization took 63 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[4, 1] Max Struct:[28, 28]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4, 1] Max Struct:[28, 28]
Support contains 2 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 73/73 transitions.
Applied a total of 0 rules in 6 ms. Remains 63 /63 variables (removed 0) and now considering 73/73 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 63/63 places, 73/73 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 73/73 transitions.
Applied a total of 0 rules in 6 ms. Remains 63 /63 variables (removed 0) and now considering 73/73 (removed 0) transitions.
[2026-05-23 18:51:35] [INFO ] Invariant cache hit.
[2026-05-23 18:51:35] [INFO ] Implicit Places using invariants in 68 ms returned []
[2026-05-23 18:51:35] [INFO ] Invariant cache hit.
[2026-05-23 18:51:35] [INFO ] State equation strengthened by 21 read => feed constraints.
[2026-05-23 18:51:35] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 249 ms to find 0 implicit places.
[2026-05-23 18:51:35] [INFO ] Redundant transitions in 2 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 262 ms. Remains : 63/63 places, 73/73 transitions.
RANDOM walk for 40000 steps (9119 resets) in 1271 ms. (31 steps per ms) remains 4/4 properties
[2026-05-23 18:51:36] [INFO ] Flatten gal took : 108 ms
[2026-05-23 18:51:36] [INFO ] Flatten gal took : 42 ms
[2026-05-23 18:51:36] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10166199382688918398.gal : 12 ms
BEST_FIRST walk for 40003 steps (4085 resets) in 406 ms. (98 steps per ms) remains 4/4 properties
[2026-05-23 18:51:36] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14740962317710864523.prop : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality10166199382688918398.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14740962317710864523.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
BEST_FIRST walk for 40002 steps (4049 resets) in 175 ms. (227 steps per ms) remains 4/4 properties
Loading property file /tmp/ReachabilityCardinality14740962317710864523.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :7 after 22
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :22 after 48
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :48 after 126
SDD proceeding with computation,4 properties remain. new max is 64
BEST_FIRST walk for 40003 steps (4085 resets) in 171 ms. (232 steps per ms) remains 4/4 properties
SDD size :126 after 262
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :262 after 510
BEST_FIRST walk for 40003 steps (4184 resets) in 181 ms. (219 steps per ms) remains 4/4 properties
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :510 after 1024
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :1024 after 11826
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :11826 after 52322
Invariant property MIN0 does not hold.
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :52322 after 209124
SDD proceeding with computation,3 properties remain. new max is 2048
SDD size :209124 after 360491
SDD proceeding with computation,3 properties remain. new max is 4096
SDD size :360491 after 712867
SDD proceeding with computation,3 properties remain. new max is 8192
SDD size :712867 after 3.09771e+06
SDD proceeding with computation,3 properties remain. new max is 16384
SDD size :3.09771e+06 after 5.31396e+06
Interrupted probabilistic random walk after 575812 steps, run timeout after 3001 ms. (steps per millisecond=191 ) properties seen :1 out of 4
Probabilistic random walk after 575812 steps, saw 231464 distinct states, run finished after 3008 ms. (steps per millisecond=191 ) properties seen :1
[2026-05-23 18:51:39] [INFO ] Invariant cache hit.
[2026-05-23 18:51:39] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 6/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 60/68 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 33/101 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/101 variables, 21/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/101 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 5/106 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/106 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/106 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
Problem MAX1 is UNSAT
After SMT solving in domain Real declared 136/136 variables, and 70 constraints, problems are : Problem set: 2 solved, 0 unsolved in 133 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 63/63 constraints, ReadFeed: 5/21 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 137ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (after reachability check) : Max Seen:[5, 2] Max Struct:[27, 27]
[2026-05-23 18:51:39] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[5, 2] Max Struct:[27, 27]
RANDOM walk for 1000000 steps (228554 resets) in 956 ms. (1044 steps per ms)
BEST_FIRST walk for 2000001 steps (202484 resets) in 987 ms. (2024 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5, 2] Max Struct:[27, 27]
[2026-05-23 18:51:41] [INFO ] Invariant cache hit.
[2026-05-23 18:51:41] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-23 18:51:41] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2026-05-23 18:51:41] [INFO ] State equation strengthened by 21 read => feed constraints.
[2026-05-23 18:51:41] [INFO ] [Real]Added 21 Read/Feed constraints in 10 ms returned sat
[2026-05-23 18:51:41] [INFO ] Solution in real domain found non-integer solution.
[2026-05-23 18:51:41] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-23 18:51:41] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2026-05-23 18:51:41] [INFO ] [Nat]Added 21 Read/Feed constraints in 5 ms returned sat
[2026-05-23 18:51:41] [INFO ] Computed and/alt/rep : 21/44/21 causal constraints (skipped 51 transitions) in 10 ms.
[2026-05-23 18:51:41] [INFO ] Added : 1 causal constraints over 1 iterations in 27 ms. Result :sat
Minimization took 29 ms.
[2026-05-23 18:51:42] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-23 18:51:42] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2026-05-23 18:51:42] [INFO ] [Real]Added 21 Read/Feed constraints in 5 ms returned sat
[2026-05-23 18:51:42] [INFO ] Solution in real domain found non-integer solution.
[2026-05-23 18:51:42] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-23 18:51:42] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2026-05-23 18:51:42] [INFO ] [Nat]Added 21 Read/Feed constraints in 7 ms returned sat
[2026-05-23 18:51:42] [INFO ] Computed and/alt/rep : 21/44/21 causal constraints (skipped 51 transitions) in 9 ms.
[2026-05-23 18:51:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 88 ms
[2026-05-23 18:51:42] [INFO ] Added : 13 causal constraints over 5 iterations in 174 ms. Result :sat
Minimization took 132 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[5, 2] Max Struct:[27, 27]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5, 2] Max Struct:[27, 27]
Support contains 2 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 73/73 transitions.
Applied a total of 0 rules in 6 ms. Remains 63 /63 variables (removed 0) and now considering 73/73 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 63/63 places, 73/73 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 73/73 transitions.
Applied a total of 0 rules in 6 ms. Remains 63 /63 variables (removed 0) and now considering 73/73 (removed 0) transitions.
[2026-05-23 18:51:42] [INFO ] Invariant cache hit.
[2026-05-23 18:51:42] [INFO ] Implicit Places using invariants in 80 ms returned []
[2026-05-23 18:51:42] [INFO ] Invariant cache hit.
[2026-05-23 18:51:42] [INFO ] State equation strengthened by 21 read => feed constraints.
[2026-05-23 18:51:42] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 220 ms to find 0 implicit places.
[2026-05-23 18:51:42] [INFO ] Redundant transitions in 1 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 233 ms. Remains : 63/63 places, 73/73 transitions.
[2026-05-23 18:51:42] [INFO ] Flatten gal took : 33 ms
[2026-05-23 18:51:42] [INFO ] Flatten gal took : 17 ms
RANDOM walk for 40000 steps (9123 resets) in 192 ms. (207 steps per ms) remains 4/4 properties
[2026-05-23 18:51:42] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2320934794154175764.gal : 10 ms
[2026-05-23 18:51:42] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2152892219677604445.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/ReachabilityCardinality2320934794154175764.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2152892219677604445.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 ...328
Loading property file /tmp/ReachabilityCardinality2152892219677604445.prop.
BEST_FIRST walk for 40002 steps (4099 resets) in 162 ms. (245 steps per ms) remains 4/4 properties
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :7 after 22
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :22 after 48
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :48 after 126
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :126 after 262
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :262 after 510
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :510 after 1024
BEST_FIRST walk for 40001 steps (4125 resets) in 170 ms. (233 steps per ms) remains 4/4 properties
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :1024 after 11826
BEST_FIRST walk for 40002 steps (3958 resets) in 123 ms. (322 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (4088 resets) in 141 ms. (281 steps per ms) remains 4/4 properties
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :11826 after 52322
Invariant property MIN0 does not hold.
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :52322 after 209124
SDD proceeding with computation,3 properties remain. new max is 2048
SDD size :209124 after 360491
SDD proceeding with computation,3 properties remain. new max is 4096
SDD size :360491 after 712867
SDD proceeding with computation,3 properties remain. new max is 8192
SDD size :712867 after 3.09771e+06
SDD proceeding with computation,3 properties remain. new max is 16384
SDD size :3.09771e+06 after 5.31396e+06
Interrupted probabilistic random walk after 757358 steps, run timeout after 3001 ms. (steps per millisecond=252 ) properties seen :1 out of 4
Probabilistic random walk after 757358 steps, saw 304336 distinct states, run finished after 3001 ms. (steps per millisecond=252 ) properties seen :1
[2026-05-23 18:51:46] [INFO ] Invariant cache hit.
[2026-05-23 18:51:46] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 6/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 60/68 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 33/101 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/101 variables, 21/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/101 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 5/106 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/106 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/106 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
Problem MAX1 is UNSAT
After SMT solving in domain Real declared 136/136 variables, and 70 constraints, problems are : Problem set: 2 solved, 0 unsolved in 123 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 63/63 constraints, ReadFeed: 5/21 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 126ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (after reachability check) : Max Seen:[6, 3] Max Struct:[26, 26]
[2026-05-23 18:51:46] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[6, 3] Max Struct:[26, 26]
RANDOM walk for 1000000 steps (228952 resets) in 1185 ms. (843 steps per ms)
BEST_FIRST walk for 2000001 steps (202155 resets) in 1144 ms. (1746 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[6, 3] Max Struct:[26, 26]
[2026-05-23 18:51:48] [INFO ] Invariant cache hit.
[2026-05-23 18:51:48] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-23 18:51:48] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2026-05-23 18:51:48] [INFO ] State equation strengthened by 21 read => feed constraints.
[2026-05-23 18:51:48] [INFO ] [Real]Added 21 Read/Feed constraints in 6 ms returned sat
[2026-05-23 18:51:48] [INFO ] Solution in real domain found non-integer solution.
[2026-05-23 18:51:48] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-23 18:51:48] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2026-05-23 18:51:48] [INFO ] [Nat]Added 21 Read/Feed constraints in 5 ms returned sat
[2026-05-23 18:51:48] [INFO ] Computed and/alt/rep : 21/44/21 causal constraints (skipped 51 transitions) in 9 ms.
[2026-05-23 18:51:48] [INFO ] Added : 1 causal constraints over 1 iterations in 29 ms. Result :sat
Minimization took 28 ms.
[2026-05-23 18:51:48] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-23 18:51:48] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2026-05-23 18:51:48] [INFO ] [Real]Added 21 Read/Feed constraints in 6 ms returned sat
[2026-05-23 18:51:48] [INFO ] Solution in real domain found non-integer solution.
[2026-05-23 18:51:48] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-23 18:51:48] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2026-05-23 18:51:48] [INFO ] [Nat]Added 21 Read/Feed constraints in 4 ms returned sat
[2026-05-23 18:51:48] [INFO ] Computed and/alt/rep : 21/44/21 causal constraints (skipped 51 transitions) in 8 ms.
[2026-05-23 18:51:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 94 ms
[2026-05-23 18:51:49] [INFO ] Added : 10 causal constraints over 2 iterations in 148 ms. Result :sat
Minimization took 103 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[6, 3] Max Struct:[26, 26]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[6, 3] Max Struct:[26, 26]
Support contains 2 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 73/73 transitions.
Applied a total of 0 rules in 6 ms. Remains 63 /63 variables (removed 0) and now considering 73/73 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 63/63 places, 73/73 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 73/73 transitions.
Applied a total of 0 rules in 6 ms. Remains 63 /63 variables (removed 0) and now considering 73/73 (removed 0) transitions.
[2026-05-23 18:51:49] [INFO ] Invariant cache hit.
[2026-05-23 18:51:49] [INFO ] Implicit Places using invariants in 105 ms returned []
[2026-05-23 18:51:49] [INFO ] Invariant cache hit.
[2026-05-23 18:51:49] [INFO ] State equation strengthened by 21 read => feed constraints.
[2026-05-23 18:51:49] [INFO ] Implicit Places using invariants and state equation in 200 ms returned []
Implicit Place search using SMT with State Equation took 307 ms to find 0 implicit places.
[2026-05-23 18:51:49] [INFO ] Redundant transitions in 1 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 321 ms. Remains : 63/63 places, 73/73 transitions.
[2026-05-23 18:51:49] [INFO ] Flatten gal took : 35 ms
RANDOM walk for 40000 steps (9182 resets) in 154 ms. (258 steps per ms) remains 4/4 properties
[2026-05-23 18:51:49] [INFO ] Flatten gal took : 38 ms
[2026-05-23 18:51:49] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14165578513842810012.gal : 13 ms
[2026-05-23 18:51:49] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2094155197481580498.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14165578513842810012.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2094155197481580498.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40002 steps (4014 resets) in 95 ms. (416 steps per ms) remains 4/4 properties
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality2094155197481580498.prop.
BEST_FIRST walk for 40001 steps (4080 resets) in 66 ms. (597 steps per ms) remains 4/4 properties
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :7 after 22
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :22 after 48
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :48 after 126
BEST_FIRST walk for 40001 steps (3972 resets) in 56 ms. (701 steps per ms) remains 4/4 properties
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :126 after 262
BEST_FIRST walk for 40000 steps (4032 resets) in 61 ms. (645 steps per ms) remains 4/4 properties
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :262 after 510
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :510 after 1024
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :1024 after 11826
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :11826 after 52322
Invariant property MIN0 does not hold.
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :52322 after 209124
SDD proceeding with computation,3 properties remain. new max is 2048
SDD size :209124 after 360491
SDD proceeding with computation,3 properties remain. new max is 4096
SDD size :360491 after 712867
SDD proceeding with computation,3 properties remain. new max is 8192
SDD size :712867 after 3.09771e+06
SDD proceeding with computation,3 properties remain. new max is 16384
SDD size :3.09771e+06 after 5.31396e+06
Interrupted probabilistic random walk after 560826 steps, run timeout after 3001 ms. (steps per millisecond=186 ) properties seen :0 out of 4
Probabilistic random walk after 560826 steps, saw 225655 distinct states, run finished after 3001 ms. (steps per millisecond=186 ) properties seen :0
[2026-05-23 18:51:52] [INFO ] Invariant cache hit.
[2026-05-23 18:51:52] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 6/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 60/68 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 33/101 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/101 variables, 21/38 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/101 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 5/106 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/106 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/106 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem MAX0 is UNSAT
Problem MAX1 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 30/136 variables, 29/70 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/136 variables, 16/86 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/136 variables, 0/86 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/136 variables, 0/86 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 136/136 variables, and 86 constraints, problems are : Problem set: 2 solved, 1 unsolved in 175 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 63/63 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 60/64 variables, 6/7 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 5/12 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 1/13 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/64 variables, 0/13 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 36/100 variables, 1/14 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/100 variables, 24/38 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/100 variables, 0/38 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 5/105 variables, 1/39 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/105 variables, 2/41 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/105 variables, 0/41 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 31/136 variables, 30/71 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/136 variables, 16/87 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/136 variables, 0/87 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/136 variables, 0/87 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 136/136 variables, and 87 constraints, problems are : Problem set: 2 solved, 1 unsolved in 122 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 63/63 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 1/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 308ms problems are : Problem set: 2 solved, 1 unsolved
Parikh walk visited 0 properties in 16 ms.
Support contains 1 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 73/73 transitions.
Applied a total of 0 rules in 5 ms. Remains 63 /63 variables (removed 0) and now considering 73/73 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 63/63 places, 73/73 transitions.
RANDOM walk for 40000 steps (9185 resets) in 102 ms. (388 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (4021 resets) in 35 ms. (1111 steps per ms) remains 1/1 properties
SDD proceeding with computation,3 properties remain. new max is 32768
SDD size :5.31396e+06 after 2.53824e+07
Finished probabilistic random walk after 1277493 steps, run visited all 1 properties in 1387 ms. (steps per millisecond=921 )
Probabilistic random walk after 1277493 steps, saw 514090 distinct states, run finished after 1392 ms. (steps per millisecond=917 ) properties seen :1
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (after reachability check) : Max Seen:[7, 4] Max Struct:[25, 25]
[2026-05-23 18:51:54] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[7, 4] Max Struct:[25, 25]
RANDOM walk for 1000000 steps (229042 resets) in 1002 ms. (997 steps per ms)
BEST_FIRST walk for 2000000 steps (202463 resets) in 941 ms. (2123 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[7, 4] Max Struct:[25, 25]
[2026-05-23 18:51:56] [INFO ] Invariant cache hit.
[2026-05-23 18:51:56] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2026-05-23 18:51:56] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2026-05-23 18:51:56] [INFO ] State equation strengthened by 21 read => feed constraints.
[2026-05-23 18:51:56] [INFO ] [Real]Added 21 Read/Feed constraints in 8 ms returned sat
[2026-05-23 18:51:56] [INFO ] Solution in real domain found non-integer solution.
[2026-05-23 18:51:56] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-23 18:51:56] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2026-05-23 18:51:56] [INFO ] [Nat]Added 21 Read/Feed constraints in 4 ms returned sat
[2026-05-23 18:51:56] [INFO ] Computed and/alt/rep : 21/44/21 causal constraints (skipped 51 transitions) in 8 ms.
[2026-05-23 18:51:56] [INFO ] Added : 1 causal constraints over 1 iterations in 30 ms. Result :sat
Minimization took 33 ms.
[2026-05-23 18:51:56] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-23 18:51:56] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2026-05-23 18:51:56] [INFO ] [Real]Added 21 Read/Feed constraints in 6 ms returned sat
[2026-05-23 18:51:56] [INFO ] Solution in real domain found non-integer solution.
[2026-05-23 18:51:56] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-23 18:51:56] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2026-05-23 18:51:56] [INFO ] [Nat]Added 21 Read/Feed constraints in 6 ms returned sat
[2026-05-23 18:51:56] [INFO ] Computed and/alt/rep : 21/44/21 causal constraints (skipped 51 transitions) in 11 ms.
[2026-05-23 18:51:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 111 ms
[2026-05-23 18:51:57] [INFO ] Added : 9 causal constraints over 2 iterations in 166 ms. Result :sat
Minimization took 46 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[7, 4] Max Struct:[25, 25]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[7, 4] Max Struct:[25, 25]
Support contains 2 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 73/73 transitions.
Applied a total of 0 rules in 12 ms. Remains 63 /63 variables (removed 0) and now considering 73/73 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 63/63 places, 73/73 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 73/73 transitions.
Applied a total of 0 rules in 8 ms. Remains 63 /63 variables (removed 0) and now considering 73/73 (removed 0) transitions.
[2026-05-23 18:51:57] [INFO ] Invariant cache hit.
[2026-05-23 18:51:57] [INFO ] Implicit Places using invariants in 88 ms returned []
[2026-05-23 18:51:57] [INFO ] Invariant cache hit.
[2026-05-23 18:51:57] [INFO ] State equation strengthened by 21 read => feed constraints.
[2026-05-23 18:51:57] [INFO ] Implicit Places using invariants and state equation in 215 ms returned []
Implicit Place search using SMT with State Equation took 306 ms to find 0 implicit places.
[2026-05-23 18:51:57] [INFO ] Redundant transitions in 3 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 325 ms. Remains : 63/63 places, 73/73 transitions.
[2026-05-23 18:51:57] [INFO ] Flatten gal took : 26 ms
[2026-05-23 18:51:57] [INFO ] Flatten gal took : 19 ms
[2026-05-23 18:51:57] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12682688906920460804.gal : 13 ms
[2026-05-23 18:51:57] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6726572752226306804.prop : 3 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/ReachabilityCardinality12682688906920460804.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6726572752226306804.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/ReachabilityCardinality6726572752226306804.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :7 after 22
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :22 after 48
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :48 after 126
RANDOM walk for 40000 steps (9159 resets) in 318 ms. (125 steps per ms) remains 4/4 properties
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :126 after 262
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :262 after 510
BEST_FIRST walk for 40002 steps (4145 resets) in 165 ms. (240 steps per ms) remains 4/4 properties
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :510 after 1024
BEST_FIRST walk for 40003 steps (4042 resets) in 79 ms. (500 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (4014 resets) in 67 ms. (588 steps per ms) remains 4/4 properties
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :1024 after 11826
BEST_FIRST walk for 40003 steps (4032 resets) in 70 ms. (563 steps per ms) remains 4/4 properties
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :11826 after 52322
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :52322 after 209124
Invariant property MIN0 does not hold.
SDD proceeding with computation,3 properties remain. new max is 2048
SDD size :209124 after 534232
SDD proceeding with computation,3 properties remain. new max is 4096
SDD size :534232 after 1.40549e+06
SDD proceeding with computation,3 properties remain. new max is 8192
SDD size :1.40549e+06 after 3.57852e+06
SDD proceeding with computation,3 properties remain. new max is 16384
SDD size :3.57852e+06 after 8.18211e+06
Interrupted probabilistic random walk after 533589 steps, run timeout after 3001 ms. (steps per millisecond=177 ) properties seen :0 out of 4
Probabilistic random walk after 533589 steps, saw 215326 distinct states, run finished after 3001 ms. (steps per millisecond=177 ) properties seen :0
[2026-05-23 18:52:00] [INFO ] Invariant cache hit.
[2026-05-23 18:52:00] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 6/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 60/68 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 33/101 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/101 variables, 21/38 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/101 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 5/106 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/106 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/106 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem MAX0 is UNSAT
Problem MAX1 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 30/136 variables, 29/70 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/136 variables, 16/86 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/136 variables, 0/86 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/136 variables, 0/86 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 136/136 variables, and 86 constraints, problems are : Problem set: 2 solved, 1 unsolved in 165 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 63/63 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 60/64 variables, 6/7 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 5/12 constraints. Problems are: Problem set: 2 solved, 1 unsolved
SDD proceeding with computation,3 properties remain. new max is 32768
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 1/13 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/64 variables, 0/13 constraints. Problems are: Problem set: 2 solved, 1 unsolved
SDD size :8.18211e+06 after 2.62987e+07
At refinement iteration 7 (OVERLAPS) 36/100 variables, 1/14 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/100 variables, 24/38 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/100 variables, 0/38 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 5/105 variables, 1/39 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/105 variables, 2/41 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/105 variables, 0/41 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 31/136 variables, 30/71 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/136 variables, 16/87 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/136 variables, 0/87 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/136 variables, 0/87 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 136/136 variables, and 87 constraints, problems are : Problem set: 2 solved, 1 unsolved in 134 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 63/63 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 1/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 304ms problems are : Problem set: 2 solved, 1 unsolved
Parikh walk visited 0 properties in 19 ms.
Support contains 1 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 73/73 transitions.
Applied a total of 0 rules in 7 ms. Remains 63 /63 variables (removed 0) and now considering 73/73 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 63/63 places, 73/73 transitions.
RANDOM walk for 40000 steps (9148 resets) in 93 ms. (425 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (3995 resets) in 62 ms. (634 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2487654 steps, run timeout after 3001 ms. (steps per millisecond=828 ) properties seen :0 out of 1
Probabilistic random walk after 2487654 steps, saw 991829 distinct states, run finished after 3001 ms. (steps per millisecond=828 ) properties seen :0
[2026-05-23 18:52:04] [INFO ] Invariant cache hit.
[2026-05-23 18:52:04] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 60/64 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 36/100 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/100 variables, 24/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/100 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 5/105 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/105 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/105 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 31/136 variables, 30/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/136 variables, 16/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/136 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/136 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 136/136 variables, and 86 constraints, problems are : Problem set: 0 solved, 1 unsolved in 111 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 63/63 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
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,9.16227e+07,6.6598,133188,2,20360,21,502475,9,0,331,622545,0
Total reachable state count : 91622714
Verifying 4 reachability properties.
Reachability property MAX0 does not hold.
No reachable states exhibit your property : MAX0
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
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,0,6.66261,133188,1,0,21,502475,9,0,332,622545,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,20,6.66404,133188,2,124,21,502475,10,0,334,622545,0
Reachability property MAX1 does not hold.
No reachable states exhibit your property : MAX1
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,0,6.66448,133188,1,0,21,502475,10,0,334,622545,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,16118,6.66551,133188,2,2237,21,502475,10,0,335,622545,0
After SMT solving in domain Int declared 64/136 variables, and 7 constraints, problems are : Problem set: 1 solved, 0 unsolved in 49 ms.
Refiners :[Generalized P Invariants (flows): 0/2 constraints, State Equation: 7/63 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 164ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Current structural bounds on expressions (after reachability check) : Max Seen:[8, 5] Max Struct:[24, 24]
[2026-05-23 18:52:04] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[8, 5] Max Struct:[24, 24]
RANDOM walk for 1000000 steps (229042 resets) in 995 ms. (1004 steps per ms)
BEST_FIRST walk for 2000002 steps (203132 resets) in 941 ms. (2123 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[8, 5] Max Struct:[24, 24]
[2026-05-23 18:52:06] [INFO ] Invariant cache hit.
[2026-05-23 18:52:06] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2026-05-23 18:52:06] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2026-05-23 18:52:06] [INFO ] State equation strengthened by 21 read => feed constraints.
[2026-05-23 18:52:06] [INFO ] [Real]Added 21 Read/Feed constraints in 5 ms returned sat
[2026-05-23 18:52:06] [INFO ] Solution in real domain found non-integer solution.
[2026-05-23 18:52:06] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-23 18:52:06] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2026-05-23 18:52:06] [INFO ] [Nat]Added 21 Read/Feed constraints in 5 ms returned sat
[2026-05-23 18:52:06] [INFO ] Computed and/alt/rep : 21/44/21 causal constraints (skipped 51 transitions) in 8 ms.
[2026-05-23 18:52:06] [INFO ] Added : 1 causal constraints over 1 iterations in 23 ms. Result :sat
Minimization took 27 ms.
[2026-05-23 18:52:06] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-23 18:52:06] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2026-05-23 18:52:06] [INFO ] [Real]Added 21 Read/Feed constraints in 7 ms returned sat
[2026-05-23 18:52:06] [INFO ] Solution in real domain found non-integer solution.
[2026-05-23 18:52:06] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-23 18:52:06] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2026-05-23 18:52:06] [INFO ] [Nat]Added 21 Read/Feed constraints in 5 ms returned sat
[2026-05-23 18:52:06] [INFO ] Computed and/alt/rep : 21/44/21 causal constraints (skipped 51 transitions) in 9 ms.
[2026-05-23 18:52:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 97 ms
[2026-05-23 18:52:06] [INFO ] Added : 10 causal constraints over 2 iterations in 157 ms. Result :sat
Minimization took 50 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[8, 5] Max Struct:[24, 24]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[8, 5] Max Struct:[24, 24]
Support contains 2 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 73/73 transitions.
Applied a total of 0 rules in 6 ms. Remains 63 /63 variables (removed 0) and now considering 73/73 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 63/63 places, 73/73 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 73/73 transitions.
Applied a total of 0 rules in 6 ms. Remains 63 /63 variables (removed 0) and now considering 73/73 (removed 0) transitions.
[2026-05-23 18:52:06] [INFO ] Invariant cache hit.
[2026-05-23 18:52:06] [INFO ] Implicit Places using invariants in 77 ms returned []
[2026-05-23 18:52:06] [INFO ] Invariant cache hit.
[2026-05-23 18:52:06] [INFO ] State equation strengthened by 21 read => feed constraints.
[2026-05-23 18:52:07] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 239 ms to find 0 implicit places.
[2026-05-23 18:52:07] [INFO ] Redundant transitions in 2 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 252 ms. Remains : 63/63 places, 73/73 transitions.
[2026-05-23 18:52:07] [INFO ] Flatten gal took : 23 ms
[2026-05-23 18:52:07] [INFO ] Flatten gal took : 20 ms
[2026-05-23 18:52:07] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7878467531580705035.gal : 6 ms
[2026-05-23 18:52:07] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6186066051500417152.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality7878467531580705035.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6186066051500417152.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 ...328
RANDOM walk for 40000 steps (9159 resets) in 204 ms. (195 steps per ms) remains 4/4 properties
Loading property file /tmp/ReachabilityCardinality6186066051500417152.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :7 after 22
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :22 after 48
BEST_FIRST walk for 40001 steps (3922 resets) in 122 ms. (325 steps per ms) remains 4/4 properties
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :48 after 126
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :126 after 262
BEST_FIRST walk for 40002 steps (4091 resets) in 112 ms. (354 steps per ms) remains 4/4 properties
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :262 after 510
BEST_FIRST walk for 40003 steps (4033 resets) in 89 ms. (444 steps per ms) remains 4/4 properties
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :510 after 1024
BEST_FIRST walk for 40001 steps (4048 resets) in 117 ms. (338 steps per ms) remains 4/4 properties
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :1024 after 11826
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :11826 after 52322
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :52322 after 209124
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :209124 after 534232
SDD proceeding with computation,4 properties remain. new max is 8192
SDD size :534232 after 2.9044e+06
SDD proceeding with computation,4 properties remain. new max is 16384
SDD size :2.9044e+06 after 5.19469e+06
Interrupted probabilistic random walk after 529189 steps, run timeout after 3001 ms. (steps per millisecond=176 ) properties seen :0 out of 4
Probabilistic random walk after 529189 steps, saw 213565 distinct states, run finished after 3001 ms. (steps per millisecond=176 ) properties seen :0
[2026-05-23 18:52:10] [INFO ] Invariant cache hit.
[2026-05-23 18:52:10] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 6/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 60/68 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 33/101 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/101 variables, 21/38 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/101 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 5/106 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/106 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/106 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem MAX0 is UNSAT
Problem MAX1 is UNSAT
At refinement iteration 12 (OVERLAPS) 30/136 variables, 29/70 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/136 variables, 16/86 constraints. Problems are: Problem set: 2 solved, 2 unsolved
SDD proceeding with computation,4 properties remain. new max is 32768
SDD size :5.19469e+06 after 2.2536e+07
At refinement iteration 14 (INCLUDED_ONLY) 0/136 variables, 2/88 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/136 variables, 0/88 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/136 variables, 0/88 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 136/136 variables, and 88 constraints, problems are : Problem set: 2 solved, 2 unsolved in 360 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 63/63 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 6/8 variables, 2/2 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 60/68 variables, 9/11 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 5/16 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 2/18 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 0/18 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 33/101 variables, 1/19 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/101 variables, 21/40 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/101 variables, 0/40 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 5/106 variables, 1/41 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/106 variables, 2/43 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/106 variables, 0/43 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 30/136 variables, 29/72 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/136 variables, 16/88 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/136 variables, 2/90 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/136 variables, 0/90 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/136 variables, 0/90 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 136/136 variables, and 90 constraints, problems are : Problem set: 2 solved, 2 unsolved in 149 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 63/63 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 2/4 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 512ms problems are : Problem set: 2 solved, 2 unsolved
Parikh walk visited 0 properties in 127 ms.
Support contains 2 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 73/73 transitions.
Applied a total of 0 rules in 4 ms. Remains 63 /63 variables (removed 0) and now considering 73/73 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 63/63 places, 73/73 transitions.
RANDOM walk for 40000 steps (9089 resets) in 158 ms. (251 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (4080 resets) in 77 ms. (512 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (4078 resets) in 88 ms. (449 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 821909 steps, run timeout after 3001 ms. (steps per millisecond=273 ) properties seen :0 out of 2
Probabilistic random walk after 821909 steps, saw 333358 distinct states, run finished after 3001 ms. (steps per millisecond=273 ) properties seen :0
[2026-05-23 18:52:14] [INFO ] Invariant cache hit.
[2026-05-23 18:52:14] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 6/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 60/68 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 33/101 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/101 variables, 21/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/101 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 5/106 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/106 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/106 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
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,9.16227e+07,6.94869,133104,2,20360,19,501557,10,0,332,622545,0
Total reachable state count : 91622714
Verifying 4 reachability properties.
Reachability property MAX0 does not hold.
No reachable states exhibit your property : MAX0
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,0,6.95169,133104,1,0,19,501557,10,0,333,622545,0
Invariant property MIN0 is true.
At refinement iteration 12 (OVERLAPS) 30/136 variables, 29/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
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,0,6.95468,133104,1,0,19,501557,10,0,333,622545,0
Reachability property MAX1 does not hold.
No reachable states exhibit your property : MAX1
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,0,6.95518,133104,1,0,19,501557,10,0,333,622545,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,3168,6.95581,133104,2,1239,19,501557,10,0,334,622545,0
After SMT solving in domain Real declared 136/136 variables, and 86 constraints, problems are : Problem set: 2 solved, 0 unsolved in 131 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 63/63 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 136ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
ITS runner timed out or was interrupted.
FORMULA DBSingleClientW-PT-d0m10-UpperBounds-00 8 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (after reachability check) : Max Seen:[6] Max Struct:[23]
[2026-05-23 18:52:14] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[6] Max Struct:[23]
RANDOM walk for 1000000 steps (229173 resets) in 919 ms. (1086 steps per ms)
BEST_FIRST walk for 1000001 steps (101556 resets) in 480 ms. (2079 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[6] Max Struct:[23]
[2026-05-23 18:52:15] [INFO ] Invariant cache hit.
[2026-05-23 18:52:15] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2026-05-23 18:52:15] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2026-05-23 18:52:15] [INFO ] State equation strengthened by 21 read => feed constraints.
[2026-05-23 18:52:15] [INFO ] [Real]Added 21 Read/Feed constraints in 11 ms returned sat
[2026-05-23 18:52:15] [INFO ] Solution in real domain found non-integer solution.
[2026-05-23 18:52:15] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2026-05-23 18:52:15] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2026-05-23 18:52:15] [INFO ] [Nat]Added 21 Read/Feed constraints in 7 ms returned sat
[2026-05-23 18:52:15] [INFO ] Computed and/alt/rep : 21/44/21 causal constraints (skipped 51 transitions) in 6 ms.
[2026-05-23 18:52:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 108 ms
[2026-05-23 18:52:15] [INFO ] Added : 10 causal constraints over 3 iterations in 165 ms. Result :sat
Minimization took 60 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[6] Max Struct:[23]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[6] Max Struct:[23]
Support contains 1 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 73/73 transitions.
Applied a total of 0 rules in 6 ms. Remains 63 /63 variables (removed 0) and now considering 73/73 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 63/63 places, 73/73 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 73/73 transitions.
Applied a total of 0 rules in 6 ms. Remains 63 /63 variables (removed 0) and now considering 73/73 (removed 0) transitions.
[2026-05-23 18:52:16] [INFO ] Invariant cache hit.
[2026-05-23 18:52:16] [INFO ] Implicit Places using invariants in 86 ms returned []
[2026-05-23 18:52:16] [INFO ] Invariant cache hit.
[2026-05-23 18:52:16] [INFO ] State equation strengthened by 21 read => feed constraints.
[2026-05-23 18:52:16] [INFO ] Implicit Places using invariants and state equation in 182 ms returned []
Implicit Place search using SMT with State Equation took 270 ms to find 0 implicit places.
[2026-05-23 18:52:16] [INFO ] Redundant transitions in 2 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 284 ms. Remains : 63/63 places, 73/73 transitions.
[2026-05-23 18:52:16] [INFO ] Flatten gal took : 11 ms
[2026-05-23 18:52:16] [INFO ] Flatten gal took : 9 ms
[2026-05-23 18:52:16] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3880738848480895096.gal : 2 ms
[2026-05-23 18:52:16] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10264887938972008128.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality3880738848480895096.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10264887938972008128.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
RANDOM walk for 40000 steps (9088 resets) in 166 ms. (239 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality10264887938972008128.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :7 after 22
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :22 after 48
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :48 after 126
BEST_FIRST walk for 40003 steps (4031 resets) in 63 ms. (625 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :126 after 262
BEST_FIRST walk for 40003 steps (4124 resets) in 48 ms. (816 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :262 after 510
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :510 after 1024
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1024 after 11826
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :11826 after 52322
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :52322 after 209124
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :209124 after 534232
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :534232 after 2.9044e+06
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :2.9044e+06 after 5.19469e+06
Interrupted probabilistic random walk after 972928 steps, run timeout after 3001 ms. (steps per millisecond=324 ) properties seen :0 out of 2
Probabilistic random walk after 972928 steps, saw 396587 distinct states, run finished after 3001 ms. (steps per millisecond=324 ) properties seen :0
[2026-05-23 18:52:19] [INFO ] Invariant cache hit.
[2026-05-23 18:52:19] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 60/64 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 36/100 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/100 variables, 24/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/100 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 5/105 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/105 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/105 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 31/136 variables, 30/70 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/136 variables, 16/86 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/136 variables, 0/86 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/136 variables, 0/86 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 136/136 variables, and 86 constraints, problems are : Problem set: 1 solved, 1 unsolved in 142 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 63/63 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 60/64 variables, 6/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 5/12 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 1/13 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/64 variables, 0/13 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 36/100 variables, 1/14 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/100 variables, 24/38 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/100 variables, 0/38 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 5/105 variables, 1/39 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/105 variables, 2/41 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/105 variables, 0/41 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 31/136 variables, 30/71 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/136 variables, 16/87 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/136 variables, 0/87 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/136 variables, 0/87 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 136/136 variables, and 87 constraints, problems are : Problem set: 1 solved, 1 unsolved in 111 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 63/63 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 256ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 15 ms.
Support contains 1 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 73/73 transitions.
Applied a total of 0 rules in 4 ms. Remains 63 /63 variables (removed 0) and now considering 73/73 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 63/63 places, 73/73 transitions.
RANDOM walk for 40000 steps (9153 resets) in 68 ms. (579 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (4043 resets) in 38 ms. (1025 steps per ms) remains 1/1 properties
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :5.19469e+06 after 2.2536e+07
Interrupted probabilistic random walk after 2778971 steps, run timeout after 3001 ms. (steps per millisecond=926 ) properties seen :0 out of 1
Probabilistic random walk after 2778971 steps, saw 1095194 distinct states, run finished after 3001 ms. (steps per millisecond=926 ) properties seen :0
[2026-05-23 18:52:22] [INFO ] Invariant cache hit.
[2026-05-23 18:52:22] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 60/64 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 36/100 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/100 variables, 24/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/100 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 5/105 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/105 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/105 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 31/136 variables, 30/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/136 variables, 16/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/136 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 0/136 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 136/136 variables, and 86 constraints, problems are : Problem set: 0 solved, 1 unsolved in 117 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 63/63 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 60/64 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/64 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 36/100 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/100 variables, 24/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/100 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 5/105 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/105 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/105 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 31/136 variables, 30/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/136 variables, 16/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/136 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/136 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 136/136 variables, and 87 constraints, problems are : Problem set: 0 solved, 1 unsolved in 105 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 63/63 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 227ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 13 ms.
Support contains 1 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 73/73 transitions.
Applied a total of 0 rules in 3 ms. Remains 63 /63 variables (removed 0) and now considering 73/73 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 63/63 places, 73/73 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 73/73 transitions.
Applied a total of 0 rules in 3 ms. Remains 63 /63 variables (removed 0) and now considering 73/73 (removed 0) transitions.
[2026-05-23 18:52:23] [INFO ] Invariant cache hit.
[2026-05-23 18:52:23] [INFO ] Implicit Places using invariants in 61 ms returned []
[2026-05-23 18:52:23] [INFO ] Invariant cache hit.
[2026-05-23 18:52:23] [INFO ] State equation strengthened by 21 read => feed constraints.
[2026-05-23 18:52:23] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 199 ms to find 0 implicit places.
[2026-05-23 18:52:23] [INFO ] Redundant transitions in 2 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 210 ms. Remains : 63/63 places, 73/73 transitions.
Attempting over-approximation, by ignoring read arcs.
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 63 transition count 68
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 6 place count 62 transition count 68
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 6 place count 62 transition count 60
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 22 place count 54 transition count 60
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 23 place count 53 transition count 59
Iterating global reduction 2 with 1 rules applied. Total rules applied 24 place count 53 transition count 59
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 25 place count 52 transition count 58
Iterating global reduction 2 with 1 rules applied. Total rules applied 26 place count 52 transition count 58
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 28 place count 51 transition count 57
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 32 place count 49 transition count 70
Applied a total of 32 rules in 25 ms. Remains 49 /63 variables (removed 14) and now considering 70/73 (removed 3) transitions.
Running SMT prover for 1 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9033597531756533384.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3283196274648600005.kers'
[2026-05-23 18:52:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9033597531756533384.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3283196274648600005.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 70 rows 49 cols 276 entries
Finished phase 1 with 13 SingleSign rule and 30 generalized
[2026-05-23 18:52:23] [INFO ] Computed 6 invariants in 3 ms
Computed 6 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-3283196274648600005.kers
Total runtime 5 ms.
[2026-05-23 18:52:23] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2026-05-23 18:52:23] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2026-05-23 18:52:23] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-23 18:52:23] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2026-05-23 18:52:23] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2026-05-23 18:52:23] [INFO ] After 34ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-23 18:52:23] [INFO ] After 43ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-23 18:52:23] [INFO ] After 82ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2026-05-23 18:52:23] [INFO ] Flatten gal took : 6 ms
[2026-05-23 18:52:23] [INFO ] Flatten gal took : 6 ms
[2026-05-23 18:52:23] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16252320761461247135.gal : 1 ms
[2026-05-23 18:52:23] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10855516301088476987.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16252320761461247135.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10855516301088476987.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality10855516301088476987.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :8 after 14
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :14 after 37
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :37 after 55
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :55 after 65
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :65 after 129
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :129 after 355
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :355 after 1015
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1015 after 2805
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :2805 after 6348
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :6348 after 28588
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,9.16227e+07,7.7354,132928,2,20360,19,501557,8,0,330,622545,0
Total reachable state count : 91622714
Verifying 2 reachability properties.
Reachability property MAX0 does not hold.
No reachable states exhibit your property : MAX0
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,0,7.7374,132928,1,0,19,501557,8,0,331,622545,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,98,7.74032,132928,2,209,19,501557,8,0,332,622545,0
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :28588 after 83350
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :83350 after 410923
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,1.41457e+06,3.44966,77328,2,13062,18,224586,7,0,270,287471,0
Total reachable state count : 1414572
Verifying 1 reachability properties.
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,26,3.45068,77328,2,205,18,224586,7,0,272,287471,0
Over-approximation ignoring read arcs solved -1 properties in 3645 ms.
Current structural bounds on expressions (after reachability check) : Max Seen:[7] Max Struct:[22]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16550756017519497937.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16018899943769765131.kers'
[2026-05-23 18:52:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16550756017519497937.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16018899943769765131.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 73 rows 63 cols 244 entries
Finished phase 1 with 58 SingleSign rule and 3 generalized
[2026-05-23 18:52:26] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-16018899943769765131.kers
Total runtime 2 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[7] Max Struct:[22]
RANDOM walk for 1000000 steps (229407 resets) in 924 ms. (1081 steps per ms)
BEST_FIRST walk for 1000000 steps (101553 resets) in 476 ms. (2096 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[7] Max Struct:[22]
[2026-05-23 18:52:28] [INFO ] Invariant cache hit.
[2026-05-23 18:52:28] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2026-05-23 18:52:28] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2026-05-23 18:52:28] [INFO ] State equation strengthened by 21 read => feed constraints.
[2026-05-23 18:52:28] [INFO ] [Real]Added 21 Read/Feed constraints in 9 ms returned sat
[2026-05-23 18:52:28] [INFO ] Solution in real domain found non-integer solution.
[2026-05-23 18:52:28] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-23 18:52:28] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2026-05-23 18:52:28] [INFO ] [Nat]Added 21 Read/Feed constraints in 5 ms returned sat
[2026-05-23 18:52:28] [INFO ] Computed and/alt/rep : 21/44/21 causal constraints (skipped 51 transitions) in 7 ms.
[2026-05-23 18:52:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 92 ms
[2026-05-23 18:52:28] [INFO ] Added : 9 causal constraints over 3 iterations in 146 ms. Result :sat
Minimization took 46 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[7] Max Struct:[22]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[7] Max Struct:[22]
Support contains 1 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 73/73 transitions.
Applied a total of 0 rules in 5 ms. Remains 63 /63 variables (removed 0) and now considering 73/73 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 63/63 places, 73/73 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 73/73 transitions.
Applied a total of 0 rules in 4 ms. Remains 63 /63 variables (removed 0) and now considering 73/73 (removed 0) transitions.
[2026-05-23 18:52:28] [INFO ] Invariant cache hit.
[2026-05-23 18:52:28] [INFO ] Implicit Places using invariants in 112 ms returned []
[2026-05-23 18:52:28] [INFO ] Invariant cache hit.
[2026-05-23 18:52:28] [INFO ] State equation strengthened by 21 read => feed constraints.
[2026-05-23 18:52:28] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 289 ms to find 0 implicit places.
[2026-05-23 18:52:28] [INFO ] Redundant transitions in 2 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 302 ms. Remains : 63/63 places, 73/73 transitions.
[2026-05-23 18:52:29] [INFO ] Flatten gal took : 14 ms
[2026-05-23 18:52:29] [INFO ] Flatten gal took : 9 ms
[2026-05-23 18:52:29] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15546270304532696098.gal : 1 ms
[2026-05-23 18:52:29] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9335710598253038669.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/ReachabilityCardinality15546270304532696098.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9335710598253038669.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/ReachabilityCardinality9335710598253038669.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :7 after 22
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :22 after 48
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :48 after 126
RANDOM walk for 40000 steps (9231 resets) in 186 ms. (213 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :126 after 262
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :262 after 510
BEST_FIRST walk for 40003 steps (4061 resets) in 88 ms. (449 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :510 after 1024
BEST_FIRST walk for 40002 steps (4138 resets) in 115 ms. (344 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1024 after 11826
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :11826 after 52322
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :52322 after 209124
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :209124 after 534232
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :534232 after 2.9044e+06
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :2.9044e+06 after 5.19469e+06
Interrupted probabilistic random walk after 885872 steps, run timeout after 3001 ms. (steps per millisecond=295 ) properties seen :0 out of 2
Probabilistic random walk after 885872 steps, saw 360968 distinct states, run finished after 3001 ms. (steps per millisecond=295 ) properties seen :0
[2026-05-23 18:52:32] [INFO ] Invariant cache hit.
[2026-05-23 18:52:32] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 60/64 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 36/100 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/100 variables, 24/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/100 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 5/105 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/105 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/105 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 31/136 variables, 30/70 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/136 variables, 16/86 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/136 variables, 0/86 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/136 variables, 0/86 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 136/136 variables, and 86 constraints, problems are : Problem set: 1 solved, 1 unsolved in 150 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 63/63 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 60/64 variables, 6/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 5/12 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 1/13 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/64 variables, 0/13 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 36/100 variables, 1/14 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/100 variables, 24/38 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/100 variables, 0/38 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 5/105 variables, 1/39 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/105 variables, 2/41 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/105 variables, 0/41 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 31/136 variables, 30/71 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/136 variables, 16/87 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/136 variables, 0/87 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/136 variables, 0/87 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 136/136 variables, and 87 constraints, problems are : Problem set: 1 solved, 1 unsolved in 117 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 63/63 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 269ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 17 ms.
Support contains 1 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 73/73 transitions.
Applied a total of 0 rules in 4 ms. Remains 63 /63 variables (removed 0) and now considering 73/73 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 63/63 places, 73/73 transitions.
RANDOM walk for 40000 steps (9103 resets) in 93 ms. (425 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (4139 resets) in 36 ms. (1081 steps per ms) remains 1/1 properties
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :5.19469e+06 after 2.2536e+07
Interrupted probabilistic random walk after 2656348 steps, run timeout after 3001 ms. (steps per millisecond=885 ) properties seen :0 out of 1
Probabilistic random walk after 2656348 steps, saw 1052780 distinct states, run finished after 3005 ms. (steps per millisecond=883 ) properties seen :0
[2026-05-23 18:52:35] [INFO ] Invariant cache hit.
[2026-05-23 18:52:35] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 60/64 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 36/100 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/100 variables, 24/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/100 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 5/105 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/105 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/105 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 31/136 variables, 30/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/136 variables, 16/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/136 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/136 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 136/136 variables, and 86 constraints, problems are : Problem set: 0 solved, 1 unsolved in 123 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 63/63 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 60/64 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/64 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 36/100 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/100 variables, 24/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/100 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 5/105 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/105 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/105 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 31/136 variables, 30/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/136 variables, 16/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/136 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/136 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 136/136 variables, and 87 constraints, problems are : Problem set: 0 solved, 1 unsolved in 126 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 63/63 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 275ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 16 ms.
Support contains 1 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 73/73 transitions.
Applied a total of 0 rules in 3 ms. Remains 63 /63 variables (removed 0) and now considering 73/73 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 63/63 places, 73/73 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 73/73 transitions.
Applied a total of 0 rules in 3 ms. Remains 63 /63 variables (removed 0) and now considering 73/73 (removed 0) transitions.
[2026-05-23 18:52:35] [INFO ] Invariant cache hit.
[2026-05-23 18:52:35] [INFO ] Implicit Places using invariants in 69 ms returned []
[2026-05-23 18:52:35] [INFO ] Invariant cache hit.
[2026-05-23 18:52:35] [INFO ] State equation strengthened by 21 read => feed constraints.
[2026-05-23 18:52:35] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 207 ms to find 0 implicit places.
[2026-05-23 18:52:35] [INFO ] Redundant transitions in 1 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 218 ms. Remains : 63/63 places, 73/73 transitions.
Attempting over-approximation, by ignoring read arcs.
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 63 transition count 68
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 6 place count 62 transition count 68
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 6 place count 62 transition count 60
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 22 place count 54 transition count 60
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 23 place count 53 transition count 59
Iterating global reduction 2 with 1 rules applied. Total rules applied 24 place count 53 transition count 59
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 25 place count 52 transition count 58
Iterating global reduction 2 with 1 rules applied. Total rules applied 26 place count 52 transition count 58
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 28 place count 51 transition count 57
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 32 place count 49 transition count 70
Applied a total of 32 rules in 13 ms. Remains 49 /63 variables (removed 14) and now considering 70/73 (removed 3) transitions.
Running SMT prover for 1 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12127389742469330085.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11479034072244675527.kers'
[2026-05-23 18:52:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12127389742469330085.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11479034072244675527.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 70 rows 49 cols 276 entries
Finished phase 1 with 13 SingleSign rule and 30 generalized
[2026-05-23 18:52:36] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-11479034072244675527.kers
Total runtime 2 ms.
[2026-05-23 18:52:36] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2026-05-23 18:52:36] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2026-05-23 18:52:36] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-23 18:52:36] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2026-05-23 18:52:36] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
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,9.16227e+07,7.05766,132924,2,20360,19,501557,8,0,330,622545,0
Total reachable state count : 91622714
Verifying 2 reachability properties.
Reachability property MAX0 does not hold.
No reachable states exhibit your property : MAX0
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,0,7.05936,132924,1,0,19,501557,8,0,331,622545,0
Invariant property MIN0 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
MIN0,0,7.06097,132924,1,0,19,501557,8,0,331,622545,0
[2026-05-23 18:52:36] [INFO ] After 37ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-23 18:52:36] [INFO ] After 45ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-23 18:52:36] [INFO ] After 83ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2026-05-23 18:52:36] [INFO ] Flatten gal took : 8 ms
[2026-05-23 18:52:36] [INFO ] Flatten gal took : 6 ms
[2026-05-23 18:52:36] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1175099756738069454.gal : 2 ms
[2026-05-23 18:52:36] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17024333298415637361.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality1175099756738069454.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17024333298415637361.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/ReachabilityCardinality17024333298415637361.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :8 after 14
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :14 after 37
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :37 after 55
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :55 after 65
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :65 after 129
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :129 after 355
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :355 after 1015
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1015 after 2805
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :2805 after 6348
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :6348 after 28588
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :28588 after 83350
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :83350 after 410923
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,1.41457e+06,3.54136,77280,2,13062,18,224586,7,0,270,287471,0
Total reachable state count : 1414572
Verifying 1 reachability properties.
Invariant property MIN0 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
MIN0,0,3.54249,77280,1,0,18,224586,7,0,271,287471,0
Over-approximation ignoring read arcs solved -1 properties in 3721 ms.
FORMULA DBSingleClientW-PT-d0m10-UpperBounds-12 7 TECHNIQUES REACHABILITY_MIN
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-13839773450557884963.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14875872092932817130.kers'
[2026-05-23 18:52:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13839773450557884963.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14875872092932817130.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 73 rows 63 cols 244 entries
Finished phase 1 with 58 SingleSign rule and 3 generalized
[2026-05-23 18:52:39] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-14875872092932817130.kers
Total runtime 1 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[] Max Struct:[]
RANDOM walk for 1000000 steps (229358 resets) in 1298 ms. (769 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 93144 ms.
BK_STOP 1779562361142
--------------------
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="DBSingleClientW-PT-d0m10"
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 DBSingleClientW-PT-d0m10, 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 r082-smll-177946993500133"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DBSingleClientW-PT-d0m10.tgz
mv DBSingleClientW-PT-d0m10 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 ;