Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r097-smll-174860111800043.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool gold2024
Input is FireWire-PT-13, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r097-smll-174860111800043
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 552K
-rw-r--r-- 1 mcc users 6.9K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 35K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.6K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 88K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 153K May 29 14:32 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME FireWire-PT-13-UpperBounds-00
FORMULA_NAME FireWire-PT-13-UpperBounds-01
FORMULA_NAME FireWire-PT-13-UpperBounds-02
FORMULA_NAME FireWire-PT-13-UpperBounds-03
FORMULA_NAME FireWire-PT-13-UpperBounds-04
FORMULA_NAME FireWire-PT-13-UpperBounds-05
FORMULA_NAME FireWire-PT-13-UpperBounds-06
FORMULA_NAME FireWire-PT-13-UpperBounds-07
FORMULA_NAME FireWire-PT-13-UpperBounds-08
FORMULA_NAME FireWire-PT-13-UpperBounds-09
FORMULA_NAME FireWire-PT-13-UpperBounds-10
FORMULA_NAME FireWire-PT-13-UpperBounds-11
FORMULA_NAME FireWire-PT-13-UpperBounds-12
FORMULA_NAME FireWire-PT-13-UpperBounds-13
FORMULA_NAME FireWire-PT-13-UpperBounds-14
FORMULA_NAME FireWire-PT-13-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748676397557

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-13
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-05-31 07:26:39] [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]
[2025-05-31 07:26:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-31 07:26:40] [INFO ] Load time of PNML (sax parser for PT used): 172 ms
[2025-05-31 07:26:40] [INFO ] Transformed 205 places.
[2025-05-31 07:26:40] [INFO ] Transformed 610 transitions.
[2025-05-31 07:26:40] [INFO ] Found NUPN structural information;
[2025-05-31 07:26:40] [INFO ] Parsed PT model containing 205 places and 610 transitions and 2309 arcs in 500 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 13 ms.
Ensure Unique test removed 68 transitions
Reduce redundant transitions removed 68 transitions.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-31 07:26:40] [INFO ] Flow matrix only has 504 transitions (discarded 38 similar events)
// Phase 1: matrix 504 rows 205 cols
[2025-05-31 07:26:40] [INFO ] Computed 10 invariants in 44 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (298 resets) in 83 ms. (119 steps per ms)
FORMULA FireWire-PT-13-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-13-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-13-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-13-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-13-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-13-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-13-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-13-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 80008 steps (474 resets) in 210 ms. (379 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-31 07:26:40] [INFO ] Flow matrix only has 504 transitions (discarded 38 similar events)
[2025-05-31 07:26:40] [INFO ] Invariant cache hit.
[2025-05-31 07:26:41] [INFO ] [Real]Absence check using 10 positive place invariants in 23 ms returned sat
[2025-05-31 07:26:41] [INFO ] [Real]Absence check using state equation in 355 ms returned sat
[2025-05-31 07:26:41] [INFO ] State equation strengthened by 73 read => feed constraints.
[2025-05-31 07:26:42] [INFO ] [Real]Added 73 Read/Feed constraints in 83 ms returned sat
[2025-05-31 07:26:42] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:26:42] [INFO ] [Nat]Absence check using 10 positive place invariants in 13 ms returned sat
[2025-05-31 07:26:42] [INFO ] [Nat]Absence check using state equation in 226 ms returned sat
[2025-05-31 07:26:42] [INFO ] [Nat]Added 73 Read/Feed constraints in 131 ms returned sat
[2025-05-31 07:26:42] [INFO ] Computed and/alt/rep : 211/821/211 causal constraints (skipped 292 transitions) in 124 ms.
[2025-05-31 07:26:43] [INFO ] Deduced a trap composed of 17 places in 246 ms of which 30 ms to minimize.
[2025-05-31 07:26:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 342 ms
[2025-05-31 07:26:43] [INFO ] Added : 24 causal constraints over 5 iterations in 811 ms. Result :sat
Minimization took 340 ms.
[2025-05-31 07:26:43] [INFO ] [Real]Absence check using 10 positive place invariants in 13 ms returned sat
[2025-05-31 07:26:44] [INFO ] [Real]Absence check using state equation in 239 ms returned sat
[2025-05-31 07:26:44] [INFO ] [Real]Added 73 Read/Feed constraints in 90 ms returned sat
[2025-05-31 07:26:44] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:26:44] [INFO ] [Nat]Absence check using 10 positive place invariants in 12 ms returned sat
[2025-05-31 07:26:44] [INFO ] [Nat]Absence check using state equation in 216 ms returned sat
[2025-05-31 07:26:44] [INFO ] [Nat]Added 73 Read/Feed constraints in 93 ms returned sat
[2025-05-31 07:26:44] [INFO ] Computed and/alt/rep : 211/821/211 causal constraints (skipped 292 transitions) in 107 ms.
[2025-05-31 07:26:45] [INFO ] Added : 17 causal constraints over 4 iterations in 350 ms. Result :sat
Minimization took 228 ms.
[2025-05-31 07:26:45] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2025-05-31 07:26:45] [INFO ] [Real]Absence check using state equation in 208 ms returned sat
[2025-05-31 07:26:45] [INFO ] [Real]Added 73 Read/Feed constraints in 102 ms returned sat
[2025-05-31 07:26:45] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:26:45] [INFO ] [Nat]Absence check using 10 positive place invariants in 14 ms returned sat
[2025-05-31 07:26:46] [INFO ] [Nat]Absence check using state equation in 244 ms returned sat
[2025-05-31 07:26:46] [INFO ] [Nat]Added 73 Read/Feed constraints in 95 ms returned sat
[2025-05-31 07:26:46] [INFO ] Computed and/alt/rep : 211/821/211 causal constraints (skipped 292 transitions) in 88 ms.
[2025-05-31 07:26:46] [INFO ] Added : 20 causal constraints over 4 iterations in 375 ms. Result :sat
Minimization took 294 ms.
[2025-05-31 07:26:47] [INFO ] [Real]Absence check using 10 positive place invariants in 13 ms returned sat
[2025-05-31 07:26:47] [INFO ] [Real]Absence check using state equation in 240 ms returned sat
[2025-05-31 07:26:47] [INFO ] [Real]Added 73 Read/Feed constraints in 93 ms returned sat
[2025-05-31 07:26:47] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:26:47] [INFO ] [Nat]Absence check using 10 positive place invariants in 14 ms returned sat
[2025-05-31 07:26:47] [INFO ] [Nat]Absence check using state equation in 249 ms returned sat
[2025-05-31 07:26:48] [INFO ] [Nat]Added 73 Read/Feed constraints in 120 ms returned sat
[2025-05-31 07:26:48] [INFO ] Computed and/alt/rep : 211/821/211 causal constraints (skipped 292 transitions) in 70 ms.
[2025-05-31 07:26:48] [INFO ] Deduced a trap composed of 15 places in 331 ms of which 4 ms to minimize.
[2025-05-31 07:26:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 398 ms
[2025-05-31 07:26:48] [INFO ] Added : 35 causal constraints over 9 iterations in 925 ms. Result :sat
Minimization took 227 ms.
[2025-05-31 07:26:49] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2025-05-31 07:26:49] [INFO ] [Real]Absence check using state equation in 240 ms returned sat
[2025-05-31 07:26:49] [INFO ] [Real]Added 73 Read/Feed constraints in 69 ms returned sat
[2025-05-31 07:26:49] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:26:49] [INFO ] [Nat]Absence check using 10 positive place invariants in 11 ms returned sat
[2025-05-31 07:26:49] [INFO ] [Nat]Absence check using state equation in 188 ms returned sat
[2025-05-31 07:26:50] [INFO ] [Nat]Added 73 Read/Feed constraints in 100 ms returned sat
[2025-05-31 07:26:50] [INFO ] Computed and/alt/rep : 211/821/211 causal constraints (skipped 292 transitions) in 52 ms.
[2025-05-31 07:26:50] [INFO ] Added : 14 causal constraints over 4 iterations in 246 ms. Result :sat
Minimization took 197 ms.
[2025-05-31 07:26:50] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2025-05-31 07:26:50] [INFO ] [Real]Absence check using state equation in 197 ms returned sat
[2025-05-31 07:26:50] [INFO ] [Real]Added 73 Read/Feed constraints in 90 ms returned sat
[2025-05-31 07:26:50] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:26:51] [INFO ] [Nat]Absence check using 10 positive place invariants in 11 ms returned sat
[2025-05-31 07:26:51] [INFO ] [Nat]Absence check using state equation in 196 ms returned sat
[2025-05-31 07:26:51] [INFO ] [Nat]Added 73 Read/Feed constraints in 72 ms returned sat
[2025-05-31 07:26:51] [INFO ] Computed and/alt/rep : 211/821/211 causal constraints (skipped 292 transitions) in 52 ms.
[2025-05-31 07:26:51] [INFO ] Deduced a trap composed of 15 places in 175 ms of which 3 ms to minimize.
[2025-05-31 07:26:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 229 ms
[2025-05-31 07:26:51] [INFO ] Added : 33 causal constraints over 8 iterations in 617 ms. Result :sat
Minimization took 202 ms.
[2025-05-31 07:26:52] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2025-05-31 07:26:52] [INFO ] [Real]Absence check using state equation in 228 ms returned sat
[2025-05-31 07:26:52] [INFO ] [Real]Added 73 Read/Feed constraints in 29 ms returned sat
[2025-05-31 07:26:52] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:26:52] [INFO ] [Nat]Absence check using 10 positive place invariants in 13 ms returned sat
[2025-05-31 07:26:52] [INFO ] [Nat]Absence check using state equation in 247 ms returned sat
[2025-05-31 07:26:52] [INFO ] [Nat]Added 73 Read/Feed constraints in 41 ms returned sat
[2025-05-31 07:26:53] [INFO ] Computed and/alt/rep : 211/821/211 causal constraints (skipped 292 transitions) in 70 ms.
[2025-05-31 07:26:53] [INFO ] Added : 60 causal constraints over 13 iterations in 763 ms. Result :sat
Minimization took 265 ms.
[2025-05-31 07:26:54] [INFO ] [Real]Absence check using 10 positive place invariants in 9 ms returned sat
[2025-05-31 07:26:54] [INFO ] [Real]Absence check using state equation in 215 ms returned sat
[2025-05-31 07:26:54] [INFO ] [Real]Added 73 Read/Feed constraints in 68 ms returned sat
[2025-05-31 07:26:54] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:26:54] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2025-05-31 07:26:54] [INFO ] [Nat]Absence check using state equation in 162 ms returned sat
[2025-05-31 07:26:54] [INFO ] [Nat]Added 73 Read/Feed constraints in 82 ms returned sat
[2025-05-31 07:26:54] [INFO ] Computed and/alt/rep : 211/821/211 causal constraints (skipped 292 transitions) in 76 ms.
[2025-05-31 07:26:55] [INFO ] Deduced a trap composed of 17 places in 230 ms of which 4 ms to minimize.
[2025-05-31 07:26:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 314 ms
[2025-05-31 07:26:55] [INFO ] Added : 24 causal constraints over 7 iterations in 812 ms. Result :sat
Minimization took 260 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
Support contains 8 out of 205 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 205/205 places, 542/542 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 205 transition count 539
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 3 place count 205 transition count 536
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 9 place count 202 transition count 536
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 15 place count 196 transition count 524
Iterating global reduction 1 with 6 rules applied. Total rules applied 21 place count 196 transition count 524
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 24 place count 196 transition count 521
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 27 place count 193 transition count 512
Iterating global reduction 2 with 3 rules applied. Total rules applied 30 place count 193 transition count 512
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 33 place count 190 transition count 506
Iterating global reduction 2 with 3 rules applied. Total rules applied 36 place count 190 transition count 506
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 39 place count 187 transition count 497
Iterating global reduction 2 with 3 rules applied. Total rules applied 42 place count 187 transition count 497
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 43 place count 186 transition count 495
Iterating global reduction 2 with 1 rules applied. Total rules applied 44 place count 186 transition count 495
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 45 place count 185 transition count 492
Iterating global reduction 2 with 1 rules applied. Total rules applied 46 place count 185 transition count 492
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 52 place count 182 transition count 489
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 58 place count 179 transition count 495
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 64 place count 179 transition count 489
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 3 with 9 rules applied. Total rules applied 73 place count 179 transition count 480
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 76 place count 179 transition count 486
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 85 place count 176 transition count 480
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 91 place count 176 transition count 474
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 92 place count 175 transition count 473
Applied a total of 92 rules in 289 ms. Remains 175 /205 variables (removed 30) and now considering 473/542 (removed 69) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 315 ms. Remains : 175/205 places, 473/542 transitions.
[2025-05-31 07:26:56] [INFO ] Flow matrix only has 436 transitions (discarded 37 similar events)
// Phase 1: matrix 436 rows 175 cols
[2025-05-31 07:26:56] [INFO ] Computed 10 invariants in 6 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (31881 resets) in 2686 ms. (372 steps per ms)
FORMULA FireWire-PT-13-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-13-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 6000003 steps (40804 resets) in 3781 ms. (1586 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
[2025-05-31 07:27:02] [INFO ] Flow matrix only has 436 transitions (discarded 37 similar events)
[2025-05-31 07:27:02] [INFO ] Invariant cache hit.
[2025-05-31 07:27:03] [INFO ] [Real]Absence check using 10 positive place invariants in 7 ms returned sat
[2025-05-31 07:27:03] [INFO ] [Real]Absence check using state equation in 141 ms returned sat
[2025-05-31 07:27:03] [INFO ] State equation strengthened by 64 read => feed constraints.
[2025-05-31 07:27:03] [INFO ] [Real]Added 64 Read/Feed constraints in 62 ms returned sat
[2025-05-31 07:27:03] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:27:03] [INFO ] [Nat]Absence check using 10 positive place invariants in 8 ms returned sat
[2025-05-31 07:27:03] [INFO ] [Nat]Absence check using state equation in 225 ms returned sat
[2025-05-31 07:27:03] [INFO ] [Nat]Added 64 Read/Feed constraints in 61 ms returned sat
[2025-05-31 07:27:03] [INFO ] Computed and/alt/rep : 176/644/176 causal constraints (skipped 254 transitions) in 62 ms.
[2025-05-31 07:27:04] [INFO ] Added : 30 causal constraints over 7 iterations in 435 ms. Result :sat
Minimization took 401 ms.
[2025-05-31 07:27:04] [INFO ] [Real]Absence check using 10 positive place invariants in 9 ms returned sat
[2025-05-31 07:27:04] [INFO ] [Real]Absence check using state equation in 199 ms returned sat
[2025-05-31 07:27:04] [INFO ] [Real]Added 64 Read/Feed constraints in 28 ms returned sat
[2025-05-31 07:27:04] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:27:04] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2025-05-31 07:27:05] [INFO ] [Nat]Absence check using state equation in 139 ms returned sat
[2025-05-31 07:27:05] [INFO ] [Nat]Added 64 Read/Feed constraints in 61 ms returned sat
[2025-05-31 07:27:05] [INFO ] Deduced a trap composed of 17 places in 126 ms of which 3 ms to minimize.
[2025-05-31 07:27:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 164 ms
[2025-05-31 07:27:05] [INFO ] Computed and/alt/rep : 176/644/176 causal constraints (skipped 254 transitions) in 58 ms.
[2025-05-31 07:27:05] [INFO ] Deduced a trap composed of 40 places in 80 ms of which 3 ms to minimize.
[2025-05-31 07:27:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 158 ms
[2025-05-31 07:27:06] [INFO ] Added : 50 causal constraints over 12 iterations in 811 ms. Result :sat
Minimization took 425 ms.
[2025-05-31 07:27:06] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2025-05-31 07:27:06] [INFO ] [Real]Absence check using state equation in 208 ms returned sat
[2025-05-31 07:27:06] [INFO ] [Real]Added 64 Read/Feed constraints in 46 ms returned sat
[2025-05-31 07:27:06] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:27:06] [INFO ] [Nat]Absence check using 10 positive place invariants in 9 ms returned sat
[2025-05-31 07:27:07] [INFO ] [Nat]Absence check using state equation in 154 ms returned sat
[2025-05-31 07:27:07] [INFO ] [Nat]Added 64 Read/Feed constraints in 31 ms returned sat
[2025-05-31 07:27:07] [INFO ] Computed and/alt/rep : 176/644/176 causal constraints (skipped 254 transitions) in 36 ms.
[2025-05-31 07:27:07] [INFO ] Deduced a trap composed of 40 places in 110 ms of which 2 ms to minimize.
[2025-05-31 07:27:07] [INFO ] Deduced a trap composed of 40 places in 67 ms of which 15 ms to minimize.
[2025-05-31 07:27:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 255 ms
[2025-05-31 07:27:07] [INFO ] Added : 33 causal constraints over 8 iterations in 578 ms. Result :sat
Minimization took 288 ms.
[2025-05-31 07:27:08] [INFO ] [Real]Absence check using 10 positive place invariants in 7 ms returned sat
[2025-05-31 07:27:08] [INFO ] [Real]Absence check using state equation in 139 ms returned sat
[2025-05-31 07:27:08] [INFO ] [Real]Added 64 Read/Feed constraints in 59 ms returned sat
[2025-05-31 07:27:08] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:27:08] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2025-05-31 07:27:08] [INFO ] [Nat]Absence check using state equation in 146 ms returned sat
[2025-05-31 07:27:08] [INFO ] [Nat]Added 64 Read/Feed constraints in 27 ms returned sat
[2025-05-31 07:27:08] [INFO ] Deduced a trap composed of 32 places in 132 ms of which 7 ms to minimize.
[2025-05-31 07:27:08] [INFO ] Deduced a trap composed of 17 places in 251 ms of which 4 ms to minimize.
[2025-05-31 07:27:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 441 ms
[2025-05-31 07:27:09] [INFO ] Computed and/alt/rep : 176/644/176 causal constraints (skipped 254 transitions) in 58 ms.
[2025-05-31 07:27:09] [INFO ] Deduced a trap composed of 40 places in 73 ms of which 2 ms to minimize.
[2025-05-31 07:27:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 137 ms
[2025-05-31 07:27:09] [INFO ] Added : 31 causal constraints over 8 iterations in 588 ms. Result :sat
Minimization took 382 ms.
[2025-05-31 07:27:10] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2025-05-31 07:27:10] [INFO ] [Real]Absence check using state equation in 213 ms returned sat
[2025-05-31 07:27:10] [INFO ] [Real]Added 64 Read/Feed constraints in 33 ms returned sat
[2025-05-31 07:27:10] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:27:10] [INFO ] [Nat]Absence check using 10 positive place invariants in 9 ms returned sat
[2025-05-31 07:27:10] [INFO ] [Nat]Absence check using state equation in 190 ms returned sat
[2025-05-31 07:27:10] [INFO ] [Nat]Added 64 Read/Feed constraints in 47 ms returned sat
[2025-05-31 07:27:10] [INFO ] Computed and/alt/rep : 176/644/176 causal constraints (skipped 254 transitions) in 47 ms.
[2025-05-31 07:27:10] [INFO ] Added : 15 causal constraints over 3 iterations in 215 ms. Result :sat
Minimization took 364 ms.
[2025-05-31 07:27:11] [INFO ] [Real]Absence check using 10 positive place invariants in 9 ms returned sat
[2025-05-31 07:27:11] [INFO ] [Real]Absence check using state equation in 195 ms returned sat
[2025-05-31 07:27:11] [INFO ] [Real]Added 64 Read/Feed constraints in 65 ms returned sat
[2025-05-31 07:27:11] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:27:11] [INFO ] [Nat]Absence check using 10 positive place invariants in 10 ms returned sat
[2025-05-31 07:27:11] [INFO ] [Nat]Absence check using state equation in 208 ms returned sat
[2025-05-31 07:27:12] [INFO ] [Nat]Added 64 Read/Feed constraints in 143 ms returned sat
[2025-05-31 07:27:12] [INFO ] Computed and/alt/rep : 176/644/176 causal constraints (skipped 254 transitions) in 55 ms.
[2025-05-31 07:27:12] [INFO ] Deduced a trap composed of 38 places in 81 ms of which 1 ms to minimize.
[2025-05-31 07:27:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 144 ms
[2025-05-31 07:27:12] [INFO ] Deduced a trap composed of 40 places in 66 ms of which 2 ms to minimize.
[2025-05-31 07:27:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 138 ms
[2025-05-31 07:27:13] [INFO ] Added : 31 causal constraints over 11 iterations in 862 ms. Result :sat
Minimization took 381 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
Support contains 6 out of 175 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 175/175 places, 473/473 transitions.
Applied a total of 0 rules in 24 ms. Remains 175 /175 variables (removed 0) and now considering 473/473 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 175/175 places, 473/473 transitions.
[2025-05-31 07:27:13] [INFO ] Flow matrix only has 436 transitions (discarded 37 similar events)
[2025-05-31 07:27:13] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (32102 resets) in 2268 ms. (440 steps per ms)
BEST_FIRST walk for 6000006 steps (41363 resets) in 4055 ms. (1479 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
[2025-05-31 07:27:20] [INFO ] Flow matrix only has 436 transitions (discarded 37 similar events)
[2025-05-31 07:27:20] [INFO ] Invariant cache hit.
[2025-05-31 07:27:20] [INFO ] [Real]Absence check using 10 positive place invariants in 8 ms returned sat
[2025-05-31 07:27:20] [INFO ] [Real]Absence check using state equation in 147 ms returned sat
[2025-05-31 07:27:20] [INFO ] State equation strengthened by 64 read => feed constraints.
[2025-05-31 07:27:20] [INFO ] [Real]Added 64 Read/Feed constraints in 94 ms returned sat
[2025-05-31 07:27:20] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:27:20] [INFO ] [Nat]Absence check using 10 positive place invariants in 9 ms returned sat
[2025-05-31 07:27:20] [INFO ] [Nat]Absence check using state equation in 207 ms returned sat
[2025-05-31 07:27:20] [INFO ] [Nat]Added 64 Read/Feed constraints in 73 ms returned sat
[2025-05-31 07:27:20] [INFO ] Computed and/alt/rep : 176/644/176 causal constraints (skipped 254 transitions) in 36 ms.
[2025-05-31 07:27:21] [INFO ] Added : 30 causal constraints over 7 iterations in 275 ms. Result :sat
Minimization took 278 ms.
[2025-05-31 07:27:21] [INFO ] [Real]Absence check using 10 positive place invariants in 7 ms returned sat
[2025-05-31 07:27:21] [INFO ] [Real]Absence check using state equation in 144 ms returned sat
[2025-05-31 07:27:21] [INFO ] [Real]Added 64 Read/Feed constraints in 23 ms returned sat
[2025-05-31 07:27:21] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:27:21] [INFO ] [Nat]Absence check using 10 positive place invariants in 8 ms returned sat
[2025-05-31 07:27:21] [INFO ] [Nat]Absence check using state equation in 154 ms returned sat
[2025-05-31 07:27:21] [INFO ] [Nat]Added 64 Read/Feed constraints in 62 ms returned sat
[2025-05-31 07:27:21] [INFO ] Deduced a trap composed of 17 places in 120 ms of which 2 ms to minimize.
[2025-05-31 07:27:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 152 ms
[2025-05-31 07:27:22] [INFO ] Computed and/alt/rep : 176/644/176 causal constraints (skipped 254 transitions) in 35 ms.
[2025-05-31 07:27:22] [INFO ] Deduced a trap composed of 40 places in 46 ms of which 1 ms to minimize.
[2025-05-31 07:27:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 91 ms
[2025-05-31 07:27:22] [INFO ] Added : 50 causal constraints over 12 iterations in 512 ms. Result :sat
Minimization took 278 ms.
[2025-05-31 07:27:22] [INFO ] [Real]Absence check using 10 positive place invariants in 7 ms returned sat
[2025-05-31 07:27:23] [INFO ] [Real]Absence check using state equation in 154 ms returned sat
[2025-05-31 07:27:23] [INFO ] [Real]Added 64 Read/Feed constraints in 46 ms returned sat
[2025-05-31 07:27:23] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:27:23] [INFO ] [Nat]Absence check using 10 positive place invariants in 8 ms returned sat
[2025-05-31 07:27:23] [INFO ] [Nat]Absence check using state equation in 149 ms returned sat
[2025-05-31 07:27:23] [INFO ] [Nat]Added 64 Read/Feed constraints in 28 ms returned sat
[2025-05-31 07:27:23] [INFO ] Computed and/alt/rep : 176/644/176 causal constraints (skipped 254 transitions) in 34 ms.
[2025-05-31 07:27:23] [INFO ] Deduced a trap composed of 40 places in 84 ms of which 2 ms to minimize.
[2025-05-31 07:27:23] [INFO ] Deduced a trap composed of 40 places in 53 ms of which 2 ms to minimize.
[2025-05-31 07:27:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 203 ms
[2025-05-31 07:27:23] [INFO ] Added : 33 causal constraints over 8 iterations in 503 ms. Result :sat
Minimization took 282 ms.
[2025-05-31 07:27:24] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2025-05-31 07:27:24] [INFO ] [Real]Absence check using state equation in 171 ms returned sat
[2025-05-31 07:27:24] [INFO ] [Real]Added 64 Read/Feed constraints in 92 ms returned sat
[2025-05-31 07:27:24] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:27:24] [INFO ] [Nat]Absence check using 10 positive place invariants in 9 ms returned sat
[2025-05-31 07:27:24] [INFO ] [Nat]Absence check using state equation in 198 ms returned sat
[2025-05-31 07:27:24] [INFO ] [Nat]Added 64 Read/Feed constraints in 40 ms returned sat
[2025-05-31 07:27:25] [INFO ] Deduced a trap composed of 32 places in 241 ms of which 3 ms to minimize.
[2025-05-31 07:27:25] [INFO ] Deduced a trap composed of 17 places in 221 ms of which 3 ms to minimize.
[2025-05-31 07:27:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 526 ms
[2025-05-31 07:27:25] [INFO ] Computed and/alt/rep : 176/644/176 causal constraints (skipped 254 transitions) in 55 ms.
[2025-05-31 07:27:25] [INFO ] Deduced a trap composed of 40 places in 64 ms of which 1 ms to minimize.
[2025-05-31 07:27:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 125 ms
[2025-05-31 07:27:25] [INFO ] Added : 31 causal constraints over 8 iterations in 553 ms. Result :sat
Minimization took 350 ms.
[2025-05-31 07:27:26] [INFO ] [Real]Absence check using 10 positive place invariants in 9 ms returned sat
[2025-05-31 07:27:26] [INFO ] [Real]Absence check using state equation in 202 ms returned sat
[2025-05-31 07:27:26] [INFO ] [Real]Added 64 Read/Feed constraints in 34 ms returned sat
[2025-05-31 07:27:26] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:27:26] [INFO ] [Nat]Absence check using 10 positive place invariants in 9 ms returned sat
[2025-05-31 07:27:26] [INFO ] [Nat]Absence check using state equation in 197 ms returned sat
[2025-05-31 07:27:26] [INFO ] [Nat]Added 64 Read/Feed constraints in 47 ms returned sat
[2025-05-31 07:27:27] [INFO ] Computed and/alt/rep : 176/644/176 causal constraints (skipped 254 transitions) in 54 ms.
[2025-05-31 07:27:27] [INFO ] Added : 15 causal constraints over 3 iterations in 223 ms. Result :sat
Minimization took 357 ms.
[2025-05-31 07:27:27] [INFO ] [Real]Absence check using 10 positive place invariants in 9 ms returned sat
[2025-05-31 07:27:27] [INFO ] [Real]Absence check using state equation in 200 ms returned sat
[2025-05-31 07:27:27] [INFO ] [Real]Added 64 Read/Feed constraints in 59 ms returned sat
[2025-05-31 07:27:27] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:27:28] [INFO ] [Nat]Absence check using 10 positive place invariants in 9 ms returned sat
[2025-05-31 07:27:28] [INFO ] [Nat]Absence check using state equation in 196 ms returned sat
[2025-05-31 07:27:28] [INFO ] [Nat]Added 64 Read/Feed constraints in 138 ms returned sat
[2025-05-31 07:27:28] [INFO ] Computed and/alt/rep : 176/644/176 causal constraints (skipped 254 transitions) in 53 ms.
[2025-05-31 07:27:28] [INFO ] Deduced a trap composed of 38 places in 68 ms of which 1 ms to minimize.
[2025-05-31 07:27:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 128 ms
[2025-05-31 07:27:29] [INFO ] Deduced a trap composed of 40 places in 57 ms of which 2 ms to minimize.
[2025-05-31 07:27:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 120 ms
[2025-05-31 07:27:29] [INFO ] Added : 31 causal constraints over 11 iterations in 793 ms. Result :sat
Minimization took 348 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
Support contains 6 out of 175 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 175/175 places, 473/473 transitions.
Applied a total of 0 rules in 23 ms. Remains 175 /175 variables (removed 0) and now considering 473/473 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 175/175 places, 473/473 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 175/175 places, 473/473 transitions.
Applied a total of 0 rules in 21 ms. Remains 175 /175 variables (removed 0) and now considering 473/473 (removed 0) transitions.
[2025-05-31 07:27:29] [INFO ] Flow matrix only has 436 transitions (discarded 37 similar events)
[2025-05-31 07:27:29] [INFO ] Invariant cache hit.
[2025-05-31 07:27:30] [INFO ] Implicit Places using invariants in 280 ms returned []
[2025-05-31 07:27:30] [INFO ] Flow matrix only has 436 transitions (discarded 37 similar events)
[2025-05-31 07:27:30] [INFO ] Invariant cache hit.
[2025-05-31 07:27:30] [INFO ] State equation strengthened by 64 read => feed constraints.
[2025-05-31 07:27:30] [INFO ] Implicit Places using invariants and state equation in 906 ms returned [18, 73, 126]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 1198 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 172/175 places, 473/473 transitions.
Applied a total of 0 rules in 19 ms. Remains 172 /172 variables (removed 0) and now considering 473/473 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1246 ms. Remains : 172/175 places, 473/473 transitions.
[2025-05-31 07:27:31] [INFO ] Flow matrix only has 436 transitions (discarded 37 similar events)
// Phase 1: matrix 436 rows 172 cols
[2025-05-31 07:27:31] [INFO ] Computed 7 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (31941 resets) in 2228 ms. (448 steps per ms)
BEST_FIRST walk for 6000005 steps (41057 resets) in 4022 ms. (1491 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
[2025-05-31 07:27:37] [INFO ] Flow matrix only has 436 transitions (discarded 37 similar events)
[2025-05-31 07:27:37] [INFO ] Invariant cache hit.
[2025-05-31 07:27:37] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned sat
[2025-05-31 07:27:37] [INFO ] [Real]Absence check using state equation in 149 ms returned sat
[2025-05-31 07:27:37] [INFO ] State equation strengthened by 64 read => feed constraints.
[2025-05-31 07:27:37] [INFO ] [Real]Added 64 Read/Feed constraints in 33 ms returned sat
[2025-05-31 07:27:37] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:27:37] [INFO ] [Nat]Absence check using 7 positive place invariants in 6 ms returned sat
[2025-05-31 07:27:37] [INFO ] [Nat]Absence check using state equation in 147 ms returned sat
[2025-05-31 07:27:37] [INFO ] [Nat]Added 64 Read/Feed constraints in 50 ms returned sat
[2025-05-31 07:27:37] [INFO ] Deduced a trap composed of 69 places in 120 ms of which 2 ms to minimize.
[2025-05-31 07:27:38] [INFO ] Deduced a trap composed of 23 places in 146 ms of which 3 ms to minimize.
[2025-05-31 07:27:38] [INFO ] Deduced a trap composed of 16 places in 168 ms of which 3 ms to minimize.
[2025-05-31 07:27:38] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 501 ms
[2025-05-31 07:27:38] [INFO ] Computed and/alt/rep : 176/644/176 causal constraints (skipped 254 transitions) in 33 ms.
[2025-05-31 07:27:38] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 2 ms to minimize.
[2025-05-31 07:27:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 84 ms
[2025-05-31 07:27:38] [INFO ] Added : 18 causal constraints over 5 iterations in 303 ms. Result :sat
Minimization took 305 ms.
[2025-05-31 07:27:38] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned sat
[2025-05-31 07:27:39] [INFO ] [Real]Absence check using state equation in 154 ms returned sat
[2025-05-31 07:27:39] [INFO ] [Real]Added 64 Read/Feed constraints in 51 ms returned sat
[2025-05-31 07:27:39] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:27:39] [INFO ] [Nat]Absence check using 7 positive place invariants in 7 ms returned sat
[2025-05-31 07:27:39] [INFO ] [Nat]Absence check using state equation in 152 ms returned sat
[2025-05-31 07:27:39] [INFO ] [Nat]Added 64 Read/Feed constraints in 106 ms returned sat
[2025-05-31 07:27:39] [INFO ] Computed and/alt/rep : 176/644/176 causal constraints (skipped 254 transitions) in 36 ms.
[2025-05-31 07:27:39] [INFO ] Added : 19 causal constraints over 4 iterations in 181 ms. Result :sat
Minimization took 271 ms.
[2025-05-31 07:27:40] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned sat
[2025-05-31 07:27:40] [INFO ] [Real]Absence check using state equation in 149 ms returned sat
[2025-05-31 07:27:40] [INFO ] [Real]Added 64 Read/Feed constraints in 21 ms returned sat
[2025-05-31 07:27:40] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:27:40] [INFO ] [Nat]Absence check using 7 positive place invariants in 6 ms returned sat
[2025-05-31 07:27:40] [INFO ] [Nat]Absence check using state equation in 145 ms returned sat
[2025-05-31 07:27:40] [INFO ] [Nat]Added 64 Read/Feed constraints in 103 ms returned sat
[2025-05-31 07:27:40] [INFO ] Deduced a trap composed of 27 places in 114 ms of which 2 ms to minimize.
[2025-05-31 07:27:40] [INFO ] Deduced a trap composed of 23 places in 233 ms of which 3 ms to minimize.
[2025-05-31 07:27:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 403 ms
[2025-05-31 07:27:41] [INFO ] Computed and/alt/rep : 176/644/176 causal constraints (skipped 254 transitions) in 54 ms.
[2025-05-31 07:27:41] [INFO ] Deduced a trap composed of 32 places in 57 ms of which 1 ms to minimize.
[2025-05-31 07:27:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 119 ms
[2025-05-31 07:27:41] [INFO ] Added : 22 causal constraints over 6 iterations in 519 ms. Result :sat
Minimization took 420 ms.
[2025-05-31 07:27:42] [INFO ] [Real]Absence check using 7 positive place invariants in 9 ms returned sat
[2025-05-31 07:27:42] [INFO ] [Real]Absence check using state equation in 215 ms returned sat
[2025-05-31 07:27:42] [INFO ] [Real]Added 64 Read/Feed constraints in 49 ms returned sat
[2025-05-31 07:27:42] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:27:42] [INFO ] [Nat]Absence check using 7 positive place invariants in 7 ms returned sat
[2025-05-31 07:27:42] [INFO ] [Nat]Absence check using state equation in 199 ms returned sat
[2025-05-31 07:27:42] [INFO ] [Nat]Added 64 Read/Feed constraints in 62 ms returned sat
[2025-05-31 07:27:42] [INFO ] Deduced a trap composed of 32 places in 75 ms of which 3 ms to minimize.
[2025-05-31 07:27:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 120 ms
[2025-05-31 07:27:42] [INFO ] Computed and/alt/rep : 176/644/176 causal constraints (skipped 254 transitions) in 55 ms.
[2025-05-31 07:27:43] [INFO ] Deduced a trap composed of 38 places in 243 ms of which 3 ms to minimize.
[2025-05-31 07:27:43] [INFO ] Deduced a trap composed of 17 places in 262 ms of which 4 ms to minimize.
[2025-05-31 07:27:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 620 ms
[2025-05-31 07:27:44] [INFO ] Added : 51 causal constraints over 12 iterations in 1268 ms. Result :sat
Minimization took 437 ms.
[2025-05-31 07:27:44] [INFO ] [Real]Absence check using 7 positive place invariants in 8 ms returned sat
[2025-05-31 07:27:44] [INFO ] [Real]Absence check using state equation in 212 ms returned sat
[2025-05-31 07:27:44] [INFO ] [Real]Added 64 Read/Feed constraints in 50 ms returned sat
[2025-05-31 07:27:44] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:27:44] [INFO ] [Nat]Absence check using 7 positive place invariants in 7 ms returned sat
[2025-05-31 07:27:45] [INFO ] [Nat]Absence check using state equation in 188 ms returned sat
[2025-05-31 07:27:45] [INFO ] [Nat]Added 64 Read/Feed constraints in 92 ms returned sat
[2025-05-31 07:27:45] [INFO ] Computed and/alt/rep : 176/644/176 causal constraints (skipped 254 transitions) in 48 ms.
[2025-05-31 07:27:45] [INFO ] Deduced a trap composed of 38 places in 64 ms of which 10 ms to minimize.
[2025-05-31 07:27:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 120 ms
[2025-05-31 07:27:45] [INFO ] Added : 29 causal constraints over 8 iterations in 546 ms. Result :sat
Minimization took 394 ms.
[2025-05-31 07:27:46] [INFO ] [Real]Absence check using 7 positive place invariants in 15 ms returned sat
[2025-05-31 07:27:46] [INFO ] [Real]Absence check using state equation in 224 ms returned sat
[2025-05-31 07:27:46] [INFO ] [Real]Added 64 Read/Feed constraints in 45 ms returned sat
[2025-05-31 07:27:46] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:27:46] [INFO ] [Nat]Absence check using 7 positive place invariants in 8 ms returned sat
[2025-05-31 07:27:46] [INFO ] [Nat]Absence check using state equation in 214 ms returned sat
[2025-05-31 07:27:47] [INFO ] [Nat]Added 64 Read/Feed constraints in 167 ms returned sat
[2025-05-31 07:27:47] [INFO ] Computed and/alt/rep : 176/644/176 causal constraints (skipped 254 transitions) in 54 ms.
[2025-05-31 07:27:47] [INFO ] Deduced a trap composed of 32 places in 109 ms of which 6 ms to minimize.
[2025-05-31 07:27:47] [INFO ] Deduced a trap composed of 40 places in 76 ms of which 2 ms to minimize.
[2025-05-31 07:27:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 291 ms
[2025-05-31 07:27:48] [INFO ] Deduced a trap composed of 16 places in 286 ms of which 3 ms to minimize.
[2025-05-31 07:27:48] [INFO ] Deduced a trap composed of 14 places in 256 ms of which 3 ms to minimize.
[2025-05-31 07:27:48] [INFO ] Deduced a trap composed of 40 places in 68 ms of which 2 ms to minimize.
[2025-05-31 07:27:48] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 759 ms
[2025-05-31 07:27:48] [INFO ] Added : 51 causal constraints over 14 iterations in 1815 ms. Result :sat
Minimization took 365 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
Support contains 6 out of 172 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 172/172 places, 473/473 transitions.
Applied a total of 0 rules in 18 ms. Remains 172 /172 variables (removed 0) and now considering 473/473 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 172/172 places, 473/473 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 172/172 places, 473/473 transitions.
Applied a total of 0 rules in 15 ms. Remains 172 /172 variables (removed 0) and now considering 473/473 (removed 0) transitions.
[2025-05-31 07:27:49] [INFO ] Flow matrix only has 436 transitions (discarded 37 similar events)
[2025-05-31 07:27:49] [INFO ] Invariant cache hit.
[2025-05-31 07:27:49] [INFO ] Implicit Places using invariants in 302 ms returned []
[2025-05-31 07:27:49] [INFO ] Flow matrix only has 436 transitions (discarded 37 similar events)
[2025-05-31 07:27:49] [INFO ] Invariant cache hit.
[2025-05-31 07:27:50] [INFO ] State equation strengthened by 64 read => feed constraints.
[2025-05-31 07:27:50] [INFO ] Implicit Places using invariants and state equation in 733 ms returned []
Implicit Place search using SMT with State Equation took 1040 ms to find 0 implicit places.
[2025-05-31 07:27:50] [INFO ] Redundant transitions in 34 ms returned []
Running 467 sub problems to find dead transitions.
[2025-05-31 07:27:50] [INFO ] Flow matrix only has 436 transitions (discarded 37 similar events)
[2025-05-31 07:27:50] [INFO ] Invariant cache hit.
[2025-05-31 07:27:50] [INFO ] State equation strengthened by 64 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 467 unsolved
[2025-05-31 07:27:55] [INFO ] Deduced a trap composed of 65 places in 153 ms of which 2 ms to minimize.
[2025-05-31 07:27:55] [INFO ] Deduced a trap composed of 17 places in 134 ms of which 2 ms to minimize.
[2025-05-31 07:27:55] [INFO ] Deduced a trap composed of 27 places in 207 ms of which 3 ms to minimize.
[2025-05-31 07:27:55] [INFO ] Deduced a trap composed of 32 places in 63 ms of which 1 ms to minimize.
[2025-05-31 07:27:56] [INFO ] Deduced a trap composed of 23 places in 141 ms of which 2 ms to minimize.
[2025-05-31 07:27:57] [INFO ] Deduced a trap composed of 27 places in 204 ms of which 3 ms to minimize.
[2025-05-31 07:27:57] [INFO ] Deduced a trap composed of 32 places in 59 ms of which 2 ms to minimize.
[2025-05-31 07:27:58] [INFO ] Deduced a trap composed of 25 places in 159 ms of which 3 ms to minimize.
[2025-05-31 07:27:58] [INFO ] Deduced a trap composed of 32 places in 61 ms of which 1 ms to minimize.
[2025-05-31 07:27:59] [INFO ] Deduced a trap composed of 108 places in 227 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/172 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 467 unsolved
[2025-05-31 07:28:02] [INFO ] Deduced a trap composed of 17 places in 176 ms of which 3 ms to minimize.
[2025-05-31 07:28:03] [INFO ] Deduced a trap composed of 63 places in 234 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 467 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/172 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 467 unsolved
At refinement iteration 4 (OVERLAPS) 436/608 variables, 172/191 constraints. Problems are: Problem set: 0 solved, 467 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/608 variables, 64/255 constraints. Problems are: Problem set: 0 solved, 467 unsolved
[2025-05-31 07:28:13] [INFO ] Deduced a trap composed of 109 places in 158 ms of which 4 ms to minimize.
[2025-05-31 07:28:13] [INFO ] Deduced a trap composed of 40 places in 51 ms of which 1 ms to minimize.
[2025-05-31 07:28:16] [INFO ] Deduced a trap composed of 40 places in 59 ms of which 2 ms to minimize.
[2025-05-31 07:28:17] [INFO ] Deduced a trap composed of 40 places in 53 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/608 variables, 4/259 constraints. Problems are: Problem set: 0 solved, 467 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 608/608 variables, and 259 constraints, problems are : Problem set: 0 solved, 467 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 172/172 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 467/467 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 467 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 467 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/172 variables, 16/23 constraints. Problems are: Problem set: 0 solved, 467 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 467 unsolved
At refinement iteration 3 (OVERLAPS) 436/608 variables, 172/195 constraints. Problems are: Problem set: 0 solved, 467 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/608 variables, 64/259 constraints. Problems are: Problem set: 0 solved, 467 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/608 variables, 467/726 constraints. Problems are: Problem set: 0 solved, 467 unsolved
[2025-05-31 07:28:46] [INFO ] Deduced a trap composed of 40 places in 78 ms of which 2 ms to minimize.
[2025-05-31 07:28:46] [INFO ] Deduced a trap composed of 38 places in 63 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/608 variables, 2/728 constraints. Problems are: Problem set: 0 solved, 467 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 608/608 variables, and 728 constraints, problems are : Problem set: 0 solved, 467 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 172/172 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 467/467 constraints, Known Traps: 18/18 constraints]
After SMT, in 60963ms problems are : Problem set: 0 solved, 467 unsolved
Search for dead transitions found 0 dead transitions in 60992ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62106 ms. Remains : 172/172 places, 473/473 transitions.
RANDOM walk for 40000 steps (1302 resets) in 2012 ms. (19 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (272 resets) in 341 ms. (116 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (251 resets) in 219 ms. (181 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (273 resets) in 215 ms. (185 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (259 resets) in 288 ms. (138 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (276 resets) in 274 ms. (145 steps per ms) remains 12/12 properties
[2025-05-31 07:28:52] [INFO ] Flatten gal took : 373 ms
BEST_FIRST walk for 40004 steps (296 resets) in 281 ms. (141 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (282 resets) in 226 ms. (176 steps per ms) remains 12/12 properties
[2025-05-31 07:28:53] [INFO ] Flatten gal took : 156 ms
BEST_FIRST walk for 40004 steps (289 resets) in 232 ms. (171 steps per ms) remains 12/12 properties
[2025-05-31 07:28:53] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12157857610607328738.gal : 35 ms
[2025-05-31 07:28:53] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8758114398617483776.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12157857610607328738.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8758114398617483776.prop' '--nowitness' '--gen-order' 'FOLLOW'

BEST_FIRST walk for 40003 steps (262 resets) in 230 ms. (173 steps per ms) remains 12/12 properties
its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
BEST_FIRST walk for 40004 steps (272 resets) in 305 ms. (130 steps per ms) remains 12/12 properties
Loading property file /tmp/ReachabilityCardinality8758114398617483776.prop.
SDD proceeding with computation,12 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,12 properties remain. new max is 8
SDD size :2 after 3
SDD proceeding with computation,12 properties remain. new max is 16
SDD size :3 after 18
SDD proceeding with computation,12 properties remain. new max is 32
SDD size :18 after 33
SDD proceeding with computation,12 properties remain. new max is 64
SDD size :33 after 63
SDD proceeding with computation,12 properties remain. new max is 128
SDD size :63 after 97
BEST_FIRST walk for 40002 steps (264 resets) in 347 ms. (114 steps per ms) remains 12/12 properties
SDD proceeding with computation,12 properties remain. new max is 256
SDD size :97 after 134
BEST_FIRST walk for 40002 steps (289 resets) in 338 ms. (118 steps per ms) remains 12/12 properties
SDD proceeding with computation,12 properties remain. new max is 512
SDD size :134 after 224
SDD proceeding with computation,12 properties remain. new max is 1024
SDD size :224 after 954
SDD proceeding with computation,12 properties remain. new max is 2048
SDD size :954 after 5582
Invariant property MIN5 does not hold.
Reachability property MAX5 is true.
Invariant property MIN1 does not hold.
Reachability property MAX1 is true.
SDD proceeding with computation,8 properties remain. new max is 2048
SDD size :5582 after 15479
Interrupted probabilistic random walk after 238501 steps, run timeout after 3001 ms. (steps per millisecond=79 ) properties seen :0 out of 12
Probabilistic random walk after 238501 steps, saw 67227 distinct states, run finished after 3009 ms. (steps per millisecond=79 ) properties seen :0
[2025-05-31 07:28:56] [INFO ] Flow matrix only has 436 transitions (discarded 37 similar events)
[2025-05-31 07:28:56] [INFO ] Invariant cache hit.
[2025-05-31 07:28:56] [INFO ] State equation strengthened by 64 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 90/94 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 275/369 variables, 94/96 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/369 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 135/504 variables, 21/117 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/504 variables, 2/119 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/504 variables, 41/160 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/504 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 8 unsolved
SDD proceeding with computation,8 properties remain. new max is 4096
SDD size :15479 after 18843
At refinement iteration 9 (OVERLAPS) 1/505 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/505 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/505 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 93/598 variables, 50/212 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/598 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/598 variables, 23/236 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2025-05-31 07:28:57] [INFO ] Deduced a trap composed of 51 places in 203 ms of which 3 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/598 variables, 1/237 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/598 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (OVERLAPS) 9/607 variables, 5/242 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/607 variables, 1/243 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/607 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 20 (OVERLAPS) 1/608 variables, 1/244 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/608 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 22 (OVERLAPS) 0/608 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 608/608 variables, and 244 constraints, problems are : Problem set: 0 solved, 8 unsolved in 2171 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 172/172 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 90/94 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 275/369 variables, 94/96 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/369 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 8 unsolved
SDD proceeding with computation,8 properties remain. new max is 8192
SDD size :18843 after 42992
At refinement iteration 5 (OVERLAPS) 135/504 variables, 21/117 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/504 variables, 2/119 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/504 variables, 41/160 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/504 variables, 8/168 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/504 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 1/505 variables, 1/169 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/505 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/505 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 93/598 variables, 50/220 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/598 variables, 1/221 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/598 variables, 23/244 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/598 variables, 1/245 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/598 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (OVERLAPS) 9/607 variables, 5/250 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/607 variables, 1/251 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/607 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 21 (OVERLAPS) 1/608 variables, 1/252 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/608 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 23 (OVERLAPS) 0/608 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 608/608 variables, and 252 constraints, problems are : Problem set: 0 solved, 8 unsolved in 1582 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 172/172 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 1/1 constraints]
After SMT, in 3770ms problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 726 ms.
Support contains 4 out of 172 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 172/172 places, 473/473 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 171 transition count 471
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 171 transition count 471
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 170 transition count 468
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 170 transition count 468
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 169 transition count 466
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 169 transition count 466
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 168 transition count 463
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 168 transition count 463
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 167 transition count 461
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 167 transition count 461
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 166 transition count 458
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 166 transition count 458
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 165 transition count 456
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 165 transition count 456
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 164 transition count 454
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 164 transition count 454
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 163 transition count 452
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 163 transition count 452
Applied a total of 18 rules in 56 ms. Remains 163 /172 variables (removed 9) and now considering 452/473 (removed 21) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 163/172 places, 452/473 transitions.
RANDOM walk for 40000 steps (1279 resets) in 424 ms. (94 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (253 resets) in 150 ms. (264 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (289 resets) in 133 ms. (298 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (277 resets) in 146 ms. (272 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (259 resets) in 131 ms. (303 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (288 resets) in 134 ms. (296 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (281 resets) in 144 ms. (275 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (256 resets) in 133 ms. (298 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (277 resets) in 177 ms. (224 steps per ms) remains 8/8 properties
SDD proceeding with computation,8 properties remain. new max is 16384
SDD size :42992 after 242606
Interrupted probabilistic random walk after 281015 steps, run timeout after 3001 ms. (steps per millisecond=93 ) properties seen :0 out of 8
Probabilistic random walk after 281015 steps, saw 77406 distinct states, run finished after 3001 ms. (steps per millisecond=93 ) properties seen :0
[2025-05-31 07:29:04] [INFO ] Flow matrix only has 415 transitions (discarded 37 similar events)
// Phase 1: matrix 415 rows 163 cols
[2025-05-31 07:29:04] [INFO ] Computed 7 invariants in 17 ms
[2025-05-31 07:29:04] [INFO ] State equation strengthened by 61 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 90/94 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 275/369 variables, 94/96 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/369 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 117/486 variables, 21/117 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/486 variables, 2/119 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/486 variables, 41/160 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/486 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 1/487 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/487 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/487 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 81/568 variables, 41/203 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/568 variables, 1/204 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/568 variables, 20/224 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2025-05-31 07:29:05] [INFO ] Deduced a trap composed of 17 places in 138 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/568 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/568 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (OVERLAPS) 9/577 variables, 5/230 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/577 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/577 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 20 (OVERLAPS) 1/578 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/578 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 22 (OVERLAPS) 0/578 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 578/578 variables, and 232 constraints, problems are : Problem set: 0 solved, 8 unsolved in 1713 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 163/163 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 90/94 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 275/369 variables, 94/96 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/369 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 117/486 variables, 21/117 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/486 variables, 2/119 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/486 variables, 41/160 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/486 variables, 8/168 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/486 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 1/487 variables, 1/169 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/487 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/487 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 81/568 variables, 41/211 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/568 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/568 variables, 20/232 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/568 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/568 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (OVERLAPS) 9/577 variables, 5/238 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/577 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/577 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 21 (OVERLAPS) 1/578 variables, 1/240 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/578 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 23 (OVERLAPS) 0/578 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 578/578 variables, and 240 constraints, problems are : Problem set: 0 solved, 8 unsolved in 1189 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 163/163 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 1/1 constraints]
After SMT, in 2949ms problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 720 ms.
Support contains 4 out of 163 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 163/163 places, 452/452 transitions.
Applied a total of 0 rules in 9 ms. Remains 163 /163 variables (removed 0) and now considering 452/452 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 163/163 places, 452/452 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 163/163 places, 452/452 transitions.
Applied a total of 0 rules in 9 ms. Remains 163 /163 variables (removed 0) and now considering 452/452 (removed 0) transitions.
[2025-05-31 07:29:08] [INFO ] Flow matrix only has 415 transitions (discarded 37 similar events)
[2025-05-31 07:29:08] [INFO ] Invariant cache hit.
[2025-05-31 07:29:08] [INFO ] Implicit Places using invariants in 149 ms returned []
[2025-05-31 07:29:08] [INFO ] Flow matrix only has 415 transitions (discarded 37 similar events)
[2025-05-31 07:29:08] [INFO ] Invariant cache hit.
[2025-05-31 07:29:08] [INFO ] State equation strengthened by 61 read => feed constraints.
[2025-05-31 07:29:08] [INFO ] Implicit Places using invariants and state equation in 558 ms returned []
Implicit Place search using SMT with State Equation took 712 ms to find 0 implicit places.
[2025-05-31 07:29:08] [INFO ] Redundant transitions in 10 ms returned []
Running 446 sub problems to find dead transitions.
[2025-05-31 07:29:08] [INFO ] Flow matrix only has 415 transitions (discarded 37 similar events)
[2025-05-31 07:29:09] [INFO ] Invariant cache hit.
[2025-05-31 07:29:09] [INFO ] State equation strengthened by 61 read => feed constraints.
SDD proceeding with computation,8 properties remain. new max is 32768
SDD size :242606 after 773629
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 446 unsolved
[2025-05-31 07:29:12] [INFO ] Deduced a trap composed of 57 places in 171 ms of which 3 ms to minimize.
[2025-05-31 07:29:12] [INFO ] Deduced a trap composed of 32 places in 43 ms of which 1 ms to minimize.
[2025-05-31 07:29:12] [INFO ] Deduced a trap composed of 17 places in 133 ms of which 3 ms to minimize.
[2025-05-31 07:29:12] [INFO ] Deduced a trap composed of 32 places in 53 ms of which 2 ms to minimize.
[2025-05-31 07:29:12] [INFO ] Deduced a trap composed of 23 places in 133 ms of which 2 ms to minimize.
[2025-05-31 07:29:13] [INFO ] Deduced a trap composed of 17 places in 151 ms of which 2 ms to minimize.
[2025-05-31 07:29:14] [INFO ] Deduced a trap composed of 17 places in 112 ms of which 2 ms to minimize.
[2025-05-31 07:29:14] [INFO ] Deduced a trap composed of 32 places in 140 ms of which 1 ms to minimize.
[2025-05-31 07:29:16] [INFO ] Deduced a trap composed of 51 places in 142 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/163 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 3 (OVERLAPS) 415/578 variables, 163/179 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/578 variables, 61/240 constraints. Problems are: Problem set: 0 solved, 446 unsolved
[2025-05-31 07:29:25] [INFO ] Deduced a trap composed of 40 places in 61 ms of which 2 ms to minimize.
SDD proceeding with computation,8 properties remain. new max is 65536
SDD size :773629 after 2.05507e+06
[2025-05-31 07:29:28] [INFO ] Deduced a trap composed of 40 places in 74 ms of which 2 ms to minimize.
[2025-05-31 07:29:29] [INFO ] Deduced a trap composed of 38 places in 65 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/578 variables, 3/243 constraints. Problems are: Problem set: 0 solved, 446 unsolved
[2025-05-31 07:29:35] [INFO ] Deduced a trap composed of 31 places in 59 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (INCLUDED_ONLY) 0/578 variables, 1/244 constraints. Problems are: Problem set: 0 solved, 446 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 578/578 variables, and 244 constraints, problems are : Problem set: 0 solved, 446 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 163/163 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 446/446 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 446 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 13/20 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/163 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 446 unsolved
Detected timeout of ITS tools.
[2025-05-31 07:29:43] [INFO ] Flatten gal took : 77 ms
[2025-05-31 07:29:43] [INFO ] Applying decomposition
[2025-05-31 07:29:43] [INFO ] Flatten gal took : 68 ms
At refinement iteration 3 (OVERLAPS) 415/578 variables, 163/183 constraints. Problems are: Problem set: 0 solved, 446 unsolved
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph12818346631342148928.txt' '-o' '/tmp/graph12818346631342148928.bin' '-w' '/tmp/graph12818346631342148928.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12818346631342148928.bin' '-l' '-1' '-v' '-w' '/tmp/graph12818346631342148928.weights' '-q' '0' '-e' '0.001'
[2025-05-31 07:29:43] [INFO ] Decomposing Gal with order
[2025-05-31 07:29:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 07:29:43] [INFO ] Removed a total of 741 redundant transitions.
[2025-05-31 07:29:44] [INFO ] Flatten gal took : 175 ms
[2025-05-31 07:29:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 128 labels/synchronizations in 32 ms.
[2025-05-31 07:29:44] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14073106269437786972.gal : 17 ms
[2025-05-31 07:29:44] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1054954525809955643.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14073106269437786972.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1054954525809955643.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality1054954525809955643.prop.
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :1 after 2
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :2 after 10
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :10 after 912
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :912 after 1594
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :1594 after 4360
At refinement iteration 4 (INCLUDED_ONLY) 0/578 variables, 61/244 constraints. Problems are: Problem set: 0 solved, 446 unsolved
SDD proceeding with computation,8 properties remain. new max is 256
SDD size :4360 after 15881
SDD proceeding with computation,8 properties remain. new max is 512
SDD size :15881 after 314781
At refinement iteration 5 (INCLUDED_ONLY) 0/578 variables, 446/690 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/578 variables, 0/690 constraints. Problems are: Problem set: 0 solved, 446 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 1)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 1)
(s13 0)
(s14 1)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 1)
(s57 0)
(s58 0)
(s59 1)
(s60 0)
(s61 0)
(s62 0)
(s63 1)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 578/578 variables, and 690 constraints, problems are : Problem set: 0 solved, 446 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 163/163 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 446/446 constraints, Known Traps: 13/13 constraints]
After SMT, in 60659ms problems are : Problem set: 0 solved, 446 unsolved
Search for dead transitions found 0 dead transitions in 60666ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61409 ms. Remains : 163/163 places, 452/452 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 141 edges and 163 vertex of which 29 / 163 are part of one of the 4 SCC in 4 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 123 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 144 transitions.
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 0 with 2 rules applied. Total rules applied 3 place count 137 transition count 307
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 12 place count 137 transition count 298
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 0 with 2 rules applied. Total rules applied 14 place count 136 transition count 297
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 136 transition count 296
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 0 with 2 rules applied. Total rules applied 17 place count 135 transition count 295
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 18 place count 134 transition count 249
Iterating global reduction 0 with 1 rules applied. Total rules applied 19 place count 134 transition count 249
Free-agglomeration rule applied 9 times with reduction of 6 identical transitions.
Iterating global reduction 0 with 9 rules applied. Total rules applied 28 place count 134 transition count 234
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 40 place count 125 transition count 231
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 46 place count 125 transition count 231
Applied a total of 46 rules in 110 ms. Remains 125 /163 variables (removed 38) and now considering 231/452 (removed 221) transitions.
Running SMT prover for 8 properties.
[2025-05-31 07:30:09] [INFO ] Flow matrix only has 229 transitions (discarded 2 similar events)
// Phase 1: matrix 229 rows 125 cols
[2025-05-31 07:30:09] [INFO ] Computed 7 invariants in 2 ms
[2025-05-31 07:30:09] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2025-05-31 07:30:10] [INFO ] After 215ms SMT Verify possible using state equation in real domain returned unsat :0 sat :5 real:3
TRAPS : Iteration 0
[2025-05-31 07:30:10] [INFO ] After 323ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :4 real:4
[2025-05-31 07:30:10] [INFO ] After 501ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :4 real:4
[2025-05-31 07:30:10] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2025-05-31 07:30:10] [INFO ] After 163ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
TRAPS : Iteration 0
[2025-05-31 07:30:10] [INFO ] After 308ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
[2025-05-31 07:30:10] [INFO ] After 508ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
[2025-05-31 07:30:10] [INFO ] Flatten gal took : 22 ms
[2025-05-31 07:30:10] [INFO ] Flatten gal took : 22 ms
[2025-05-31 07:30:10] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16091761502128040722.gal : 4 ms
[2025-05-31 07:30:10] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7554236230177510454.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16091761502128040722.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7554236230177510454.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.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality7554236230177510454.prop.
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :2 after 10
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :10 after 25
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :25 after 42
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :42 after 120
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :120 after 216
SDD proceeding with computation,8 properties remain. new max is 256
SDD size :216 after 341
SDD proceeding with computation,8 properties remain. new max is 512
SDD size :341 after 1716
SDD proceeding with computation,8 properties remain. new max is 1024
SDD size :1716 after 8146
SDD proceeding with computation,8 properties remain. new max is 2048
SDD size :8146 after 37141
SDD proceeding with computation,8 properties remain. new max is 4096
SDD size :37141 after 492593
Invariant property MIN2 does not hold.
Reachability property MAX2 is true.
SDD proceeding with computation,6 properties remain. new max is 4096
SDD size :492593 after 3.78228e+06
Invariant property MIN4 does not hold.
Reachability property MAX4 is true.
Invariant property MIN3 does not hold.
Reachability property MAX3 is true.
Invariant property MIN0 does not hold.
Reachability property MAX0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 4097 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,3.11004e+07,2.91078,46696,2,3655,22,119698,6,0,731,161982,0
Total reachable state count : 31100411

Verifying 8 reachability properties.
Reachability property MAX0 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX0,16197,2.91287,46696,2,546,22,119698,7,0,734,161982,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,16197,2.91404,46696,2,546,22,119698,8,0,735,161982,0
Reachability property MAX2 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX2,186,2.91486,46696,2,236,22,119698,9,0,737,161982,0
Invariant property MIN2 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN2,186,2.91553,46696,2,236,22,119698,10,0,738,161982,0
Reachability property MAX3 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX3,30807,2.91658,46696,2,991,22,119698,11,0,740,161982,0
Invariant property MIN3 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN3,30807,2.91761,46696,2,991,22,119698,12,0,741,161982,0
Reachability property MAX4 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX4,35524,2.91859,46696,2,752,22,119698,13,0,743,161982,0
Invariant property MIN4 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN4,35524,2.91944,46696,2,752,22,119698,14,0,744,161982,0
Over-approximation ignoring read arcs solved 0 properties in 4138 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
FORMULA FireWire-PT-13-UpperBounds-12 1 TECHNIQUES REACHABILITY_MAX
FORMULA FireWire-PT-13-UpperBounds-02 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 2 queries.) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Starting property specific reduction for FireWire-PT-13-UpperBounds-00
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1]
[2025-05-31 07:30:13] [INFO ] Flow matrix only has 436 transitions (discarded 37 similar events)
// Phase 1: matrix 436 rows 172 cols
[2025-05-31 07:30:13] [INFO ] Computed 7 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (304 resets) in 26 ms. (370 steps per ms)
BEST_FIRST walk for 10001 steps (59 resets) in 9 ms. (1000 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-05-31 07:30:13] [INFO ] Flow matrix only has 436 transitions (discarded 37 similar events)
[2025-05-31 07:30:13] [INFO ] Invariant cache hit.
[2025-05-31 07:30:13] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned sat
[2025-05-31 07:30:14] [INFO ] [Real]Absence check using state equation in 187 ms returned sat
[2025-05-31 07:30:14] [INFO ] State equation strengthened by 64 read => feed constraints.
[2025-05-31 07:30:14] [INFO ] [Real]Added 64 Read/Feed constraints in 37 ms returned sat
[2025-05-31 07:30:14] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:30:14] [INFO ] [Nat]Absence check using 7 positive place invariants in 8 ms returned sat
[2025-05-31 07:30:14] [INFO ] [Nat]Absence check using state equation in 214 ms returned sat
[2025-05-31 07:30:14] [INFO ] [Nat]Added 64 Read/Feed constraints in 72 ms returned sat
[2025-05-31 07:30:14] [INFO ] Deduced a trap composed of 69 places in 157 ms of which 3 ms to minimize.
[2025-05-31 07:30:14] [INFO ] Deduced a trap composed of 23 places in 218 ms of which 3 ms to minimize.
[2025-05-31 07:30:15] [INFO ] Deduced a trap composed of 16 places in 220 ms of which 7 ms to minimize.
[2025-05-31 07:30:15] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 680 ms
[2025-05-31 07:30:15] [INFO ] Computed and/alt/rep : 176/644/176 causal constraints (skipped 254 transitions) in 49 ms.
[2025-05-31 07:30:15] [INFO ] Deduced a trap composed of 32 places in 59 ms of which 1 ms to minimize.
[2025-05-31 07:30:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 110 ms
[2025-05-31 07:30:15] [INFO ] Added : 18 causal constraints over 5 iterations in 385 ms. Result :sat
Minimization took 366 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 172 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p162) removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 172/172 places, 471/471 transitions.
Reduce places removed 1 places and 3 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 171 transition count 468
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 170 transition count 466
Reduce places removed 1 places and 3 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3 place count 169 transition count 463
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 4 place count 168 transition count 461
Reduce places removed 1 places and 3 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 5 place count 167 transition count 458
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 6 place count 166 transition count 456
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 8 place count 164 transition count 452
Iterating global reduction 6 with 2 rules applied. Total rules applied 10 place count 164 transition count 452
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 12 place count 162 transition count 446
Iterating global reduction 6 with 2 rules applied. Total rules applied 14 place count 162 transition count 446
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 16 place count 160 transition count 442
Iterating global reduction 6 with 2 rules applied. Total rules applied 18 place count 160 transition count 442
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 20 place count 158 transition count 436
Iterating global reduction 6 with 2 rules applied. Total rules applied 22 place count 158 transition count 436
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 24 place count 156 transition count 432
Iterating global reduction 6 with 2 rules applied. Total rules applied 26 place count 156 transition count 432
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 28 place count 154 transition count 427
Iterating global reduction 6 with 2 rules applied. Total rules applied 30 place count 154 transition count 427
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 32 place count 152 transition count 423
Iterating global reduction 6 with 2 rules applied. Total rules applied 34 place count 152 transition count 423
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 35 place count 151 transition count 421
Iterating global reduction 6 with 1 rules applied. Total rules applied 36 place count 151 transition count 421
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 37 place count 150 transition count 419
Iterating global reduction 6 with 1 rules applied. Total rules applied 38 place count 150 transition count 419
Applied a total of 38 rules in 61 ms. Remains 150 /172 variables (removed 22) and now considering 419/471 (removed 52) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62 ms. Remains : 150/172 places, 419/471 transitions.
[2025-05-31 07:30:16] [INFO ] Flow matrix only has 382 transitions (discarded 37 similar events)
// Phase 1: matrix 382 rows 150 cols
[2025-05-31 07:30:16] [INFO ] Computed 7 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (32250 resets) in 1969 ms. (507 steps per ms)
BEST_FIRST walk for 1000001 steps (6762 resets) in 575 ms. (1736 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-05-31 07:30:18] [INFO ] Flow matrix only has 382 transitions (discarded 37 similar events)
[2025-05-31 07:30:18] [INFO ] Invariant cache hit.
[2025-05-31 07:30:18] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned sat
[2025-05-31 07:30:18] [INFO ] [Real]Absence check using state equation in 189 ms returned sat
[2025-05-31 07:30:18] [INFO ] State equation strengthened by 56 read => feed constraints.
[2025-05-31 07:30:19] [INFO ] [Real]Added 56 Read/Feed constraints in 105 ms returned sat
[2025-05-31 07:30:19] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:30:19] [INFO ] [Nat]Absence check using 7 positive place invariants in 7 ms returned sat
[2025-05-31 07:30:19] [INFO ] [Nat]Absence check using state equation in 171 ms returned sat
[2025-05-31 07:30:19] [INFO ] [Nat]Added 56 Read/Feed constraints in 88 ms returned sat
[2025-05-31 07:30:19] [INFO ] Computed and/alt/rep : 158/578/158 causal constraints (skipped 218 transitions) in 41 ms.
[2025-05-31 07:30:19] [INFO ] Deduced a trap composed of 14 places in 171 ms of which 3 ms to minimize.
[2025-05-31 07:30:20] [INFO ] Deduced a trap composed of 48 places in 163 ms of which 3 ms to minimize.
[2025-05-31 07:30:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 418 ms
[2025-05-31 07:30:20] [INFO ] Added : 38 causal constraints over 9 iterations in 818 ms. Result :sat
Minimization took 197 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 150 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 150/150 places, 419/419 transitions.
Applied a total of 0 rules in 10 ms. Remains 150 /150 variables (removed 0) and now considering 419/419 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 150/150 places, 419/419 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 150/150 places, 419/419 transitions.
Applied a total of 0 rules in 9 ms. Remains 150 /150 variables (removed 0) and now considering 419/419 (removed 0) transitions.
[2025-05-31 07:30:20] [INFO ] Flow matrix only has 382 transitions (discarded 37 similar events)
[2025-05-31 07:30:20] [INFO ] Invariant cache hit.
[2025-05-31 07:30:20] [INFO ] Implicit Places using invariants in 205 ms returned []
[2025-05-31 07:30:20] [INFO ] Flow matrix only has 382 transitions (discarded 37 similar events)
[2025-05-31 07:30:20] [INFO ] Invariant cache hit.
[2025-05-31 07:30:20] [INFO ] State equation strengthened by 56 read => feed constraints.
[2025-05-31 07:30:21] [INFO ] Implicit Places using invariants and state equation in 609 ms returned []
Implicit Place search using SMT with State Equation took 829 ms to find 0 implicit places.
[2025-05-31 07:30:21] [INFO ] Redundant transitions in 4 ms returned []
Running 413 sub problems to find dead transitions.
[2025-05-31 07:30:21] [INFO ] Flow matrix only has 382 transitions (discarded 37 similar events)
[2025-05-31 07:30:21] [INFO ] Invariant cache hit.
[2025-05-31 07:30:21] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 413 unsolved
[2025-05-31 07:30:25] [INFO ] Deduced a trap composed of 32 places in 55 ms of which 1 ms to minimize.
[2025-05-31 07:30:26] [INFO ] Deduced a trap composed of 32 places in 67 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 3 (OVERLAPS) 1/150 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 413 unsolved
[2025-05-31 07:30:33] [INFO ] Deduced a trap composed of 55 places in 122 ms of which 2 ms to minimize.
[2025-05-31 07:30:33] [INFO ] Deduced a trap composed of 87 places in 117 ms of which 2 ms to minimize.
[2025-05-31 07:30:33] [INFO ] Deduced a trap composed of 55 places in 117 ms of which 2 ms to minimize.
[2025-05-31 07:30:33] [INFO ] Deduced a trap composed of 51 places in 121 ms of which 2 ms to minimize.
[2025-05-31 07:30:33] [INFO ] Deduced a trap composed of 23 places in 159 ms of which 3 ms to minimize.
[2025-05-31 07:30:33] [INFO ] Deduced a trap composed of 32 places in 49 ms of which 1 ms to minimize.
[2025-05-31 07:30:34] [INFO ] Deduced a trap composed of 17 places in 195 ms of which 3 ms to minimize.
[2025-05-31 07:30:36] [INFO ] Deduced a trap composed of 17 places in 156 ms of which 3 ms to minimize.
[2025-05-31 07:30:37] [INFO ] Deduced a trap composed of 51 places in 218 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/150 variables, 9/18 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/150 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 6 (OVERLAPS) 382/532 variables, 150/168 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/532 variables, 56/224 constraints. Problems are: Problem set: 0 solved, 413 unsolved
[2025-05-31 07:30:46] [INFO ] Deduced a trap composed of 40 places in 65 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/532 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 413 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 532/532 variables, and 225 constraints, problems are : Problem set: 0 solved, 413 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 150/150 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 413/413 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 413 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 3 (OVERLAPS) 1/150 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/150 variables, 4/19 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/150 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 6 (OVERLAPS) 382/532 variables, 150/169 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/532 variables, 56/225 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/532 variables, 413/638 constraints. Problems are: Problem set: 0 solved, 413 unsolved
[2025-05-31 07:31:15] [INFO ] Deduced a trap composed of 31 places in 50 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/532 variables, 1/639 constraints. Problems are: Problem set: 0 solved, 413 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 532/532 variables, and 639 constraints, problems are : Problem set: 0 solved, 413 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 150/150 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 413/413 constraints, Known Traps: 13/13 constraints]
After SMT, in 60469ms problems are : Problem set: 0 solved, 413 unsolved
Search for dead transitions found 0 dead transitions in 60475ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61325 ms. Remains : 150/150 places, 419/419 transitions.
[2025-05-31 07:31:21] [INFO ] Flatten gal took : 61 ms
[2025-05-31 07:31:21] [INFO ] Flatten gal took : 30 ms
[2025-05-31 07:31:21] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality137170071386483092.gal : 12 ms
[2025-05-31 07:31:21] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16410995575783162252.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality137170071386483092.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16410995575783162252.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.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality16410995575783162252.prop.
RANDOM walk for 40000 steps (1284 resets) in 305 ms. (130 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (271 resets) in 64 ms. (615 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 3
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :3 after 18
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :18 after 33
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :33 after 63
BEST_FIRST walk for 40003 steps (258 resets) in 96 ms. (412 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :63 after 102
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :102 after 142
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :142 after 261
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :261 after 1042
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1042 after 9005
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :9005 after 18351
Interrupted probabilistic random walk after 488210 steps, run timeout after 3001 ms. (steps per millisecond=162 ) properties seen :0 out of 2
Probabilistic random walk after 488210 steps, saw 122620 distinct states, run finished after 3001 ms. (steps per millisecond=162 ) properties seen :0
[2025-05-31 07:31:25] [INFO ] Flow matrix only has 382 transitions (discarded 37 similar events)
[2025-05-31 07:31:25] [INFO ] Invariant cache hit.
[2025-05-31 07:31:25] [INFO ] State equation strengthened by 56 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) 41/42 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 123/165 variables, 42/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 187/352 variables, 16/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/352 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/352 variables, 18/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/352 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/353 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/353 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/353 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 159/512 variables, 79/159 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/512 variables, 2/161 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/512 variables, 38/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/512 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 18/530 variables, 10/209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/530 variables, 2/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/530 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 2/532 variables, 2/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/532 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/532 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 532/532 variables, and 213 constraints, problems are : Problem set: 0 solved, 2 unsolved in 359 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 150/150 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
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) 41/42 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 123/165 variables, 42/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 187/352 variables, 16/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/352 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/352 variables, 18/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/352 variables, 2/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/352 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/353 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/353 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/353 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 159/512 variables, 79/161 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/512 variables, 2/163 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/512 variables, 38/201 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/512 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 18/530 variables, 10/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/530 variables, 2/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/530 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 2/532 variables, 2/215 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/532 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/532 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 532/532 variables, and 215 constraints, problems are : Problem set: 0 solved, 2 unsolved in 371 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 150/150 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 741ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 23 ms.
Support contains 1 out of 150 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 150/150 places, 419/419 transitions.
Applied a total of 0 rules in 6 ms. Remains 150 /150 variables (removed 0) and now considering 419/419 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 150/150 places, 419/419 transitions.
RANDOM walk for 40000 steps (1279 resets) in 161 ms. (246 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (276 resets) in 59 ms. (666 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (279 resets) in 73 ms. (540 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :18351 after 51632
Interrupted probabilistic random walk after 533399 steps, run timeout after 3001 ms. (steps per millisecond=177 ) properties seen :0 out of 2
Probabilistic random walk after 533399 steps, saw 133748 distinct states, run finished after 3001 ms. (steps per millisecond=177 ) properties seen :0
[2025-05-31 07:31:29] [INFO ] Flow matrix only has 382 transitions (discarded 37 similar events)
[2025-05-31 07:31:29] [INFO ] Invariant cache hit.
[2025-05-31 07:31:29] [INFO ] State equation strengthened by 56 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) 41/42 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 123/165 variables, 42/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 187/352 variables, 16/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/352 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/352 variables, 18/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/352 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/353 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/353 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/353 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 159/512 variables, 79/159 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/512 variables, 2/161 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/512 variables, 38/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/512 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 18/530 variables, 10/209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/530 variables, 2/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/530 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 2/532 variables, 2/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/532 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/532 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 532/532 variables, and 213 constraints, problems are : Problem set: 0 solved, 2 unsolved in 425 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 150/150 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
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) 41/42 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 123/165 variables, 42/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 187/352 variables, 16/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/352 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/352 variables, 18/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/352 variables, 2/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/352 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/353 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/353 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/353 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 159/512 variables, 79/161 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/512 variables, 2/163 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/512 variables, 38/201 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/512 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 18/530 variables, 10/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/530 variables, 2/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/530 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 2/532 variables, 2/215 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/532 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/532 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 532/532 variables, and 215 constraints, problems are : Problem set: 0 solved, 2 unsolved in 423 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 150/150 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 864ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 48 ms.
Support contains 1 out of 150 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 150/150 places, 419/419 transitions.
Applied a total of 0 rules in 7 ms. Remains 150 /150 variables (removed 0) and now considering 419/419 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 150/150 places, 419/419 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 150/150 places, 419/419 transitions.
Applied a total of 0 rules in 7 ms. Remains 150 /150 variables (removed 0) and now considering 419/419 (removed 0) transitions.
[2025-05-31 07:31:29] [INFO ] Flow matrix only has 382 transitions (discarded 37 similar events)
[2025-05-31 07:31:29] [INFO ] Invariant cache hit.
[2025-05-31 07:31:30] [INFO ] Implicit Places using invariants in 158 ms returned []
[2025-05-31 07:31:30] [INFO ] Flow matrix only has 382 transitions (discarded 37 similar events)
[2025-05-31 07:31:30] [INFO ] Invariant cache hit.
[2025-05-31 07:31:30] [INFO ] State equation strengthened by 56 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :51632 after 413936
[2025-05-31 07:31:30] [INFO ] Implicit Places using invariants and state equation in 602 ms returned []
Implicit Place search using SMT with State Equation took 770 ms to find 0 implicit places.
[2025-05-31 07:31:30] [INFO ] Redundant transitions in 5 ms returned []
Running 413 sub problems to find dead transitions.
[2025-05-31 07:31:30] [INFO ] Flow matrix only has 382 transitions (discarded 37 similar events)
[2025-05-31 07:31:30] [INFO ] Invariant cache hit.
[2025-05-31 07:31:30] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 413 unsolved
[2025-05-31 07:31:34] [INFO ] Deduced a trap composed of 32 places in 57 ms of which 2 ms to minimize.
[2025-05-31 07:31:35] [INFO ] Deduced a trap composed of 32 places in 54 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 413 unsolved
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :413936 after 996966
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 3 (OVERLAPS) 1/150 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 413 unsolved
[2025-05-31 07:31:41] [INFO ] Deduced a trap composed of 55 places in 154 ms of which 3 ms to minimize.
[2025-05-31 07:31:41] [INFO ] Deduced a trap composed of 87 places in 145 ms of which 2 ms to minimize.
[2025-05-31 07:31:41] [INFO ] Deduced a trap composed of 55 places in 143 ms of which 2 ms to minimize.
[2025-05-31 07:31:41] [INFO ] Deduced a trap composed of 51 places in 156 ms of which 2 ms to minimize.
[2025-05-31 07:31:41] [INFO ] Deduced a trap composed of 23 places in 131 ms of which 2 ms to minimize.
[2025-05-31 07:31:41] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 1 ms to minimize.
[2025-05-31 07:31:42] [INFO ] Deduced a trap composed of 17 places in 140 ms of which 2 ms to minimize.
[2025-05-31 07:31:43] [INFO ] Deduced a trap composed of 17 places in 121 ms of which 2 ms to minimize.
[2025-05-31 07:31:44] [INFO ] Deduced a trap composed of 51 places in 135 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/150 variables, 9/18 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/150 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 6 (OVERLAPS) 382/532 variables, 150/168 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/532 variables, 56/224 constraints. Problems are: Problem set: 0 solved, 413 unsolved
[2025-05-31 07:31:52] [INFO ] Deduced a trap composed of 40 places in 52 ms of which 1 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :996966 after 3.08674e+06
At refinement iteration 8 (INCLUDED_ONLY) 0/532 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 413 unsolved
[2025-05-31 07:32:00] [INFO ] Deduced a trap composed of 31 places in 56 ms of which 1 ms to minimize.
[2025-05-31 07:32:01] [INFO ] Deduced a trap composed of 31 places in 49 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 532/532 variables, and 227 constraints, problems are : Problem set: 0 solved, 413 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 150/150 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 413/413 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 413 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 10/16 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 3 (OVERLAPS) 1/150 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/150 variables, 4/21 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/150 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 6 (OVERLAPS) 382/532 variables, 150/171 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/532 variables, 56/227 constraints. Problems are: Problem set: 0 solved, 413 unsolved
Detected timeout of ITS tools.
[2025-05-31 07:32:12] [INFO ] Flatten gal took : 25 ms
[2025-05-31 07:32:12] [INFO ] Applying decomposition
[2025-05-31 07:32:12] [INFO ] Flatten gal took : 22 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph6503150539093465577.txt' '-o' '/tmp/graph6503150539093465577.bin' '-w' '/tmp/graph6503150539093465577.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6503150539093465577.bin' '-l' '-1' '-v' '-w' '/tmp/graph6503150539093465577.weights' '-q' '0' '-e' '0.001'
[2025-05-31 07:32:12] [INFO ] Decomposing Gal with order
[2025-05-31 07:32:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 07:32:12] [INFO ] Removed a total of 634 redundant transitions.
[2025-05-31 07:32:12] [INFO ] Flatten gal took : 54 ms
[2025-05-31 07:32:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 129 labels/synchronizations in 16 ms.
[2025-05-31 07:32:12] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6925176628630277292.gal : 7 ms
[2025-05-31 07:32:12] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7878678657628655885.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6925176628630277292.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7878678657628655885.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality7878678657628655885.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 117
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :117 after 147
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :147 after 165
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :165 after 255
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :255 after 675
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :675 after 3498
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :3498 after 4470
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :4470 after 21222
At refinement iteration 8 (INCLUDED_ONLY) 0/532 variables, 413/640 constraints. Problems are: Problem set: 0 solved, 413 unsolved
[2025-05-31 07:32:15] [INFO ] Deduced a trap composed of 28 places in 117 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/532 variables, 1/641 constraints. Problems are: Problem set: 0 solved, 413 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 532/532 variables, and 641 constraints, problems are : Problem set: 0 solved, 413 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 150/150 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 413/413 constraints, Known Traps: 15/15 constraints]
After SMT, in 60520ms problems are : Problem set: 0 solved, 413 unsolved
Search for dead transitions found 0 dead transitions in 60528ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61321 ms. Remains : 150/150 places, 419/419 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 139 edges and 150 vertex of which 29 / 150 are part of one of the 4 SCC in 2 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 123 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 144 transitions.
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 0 with 2 rules applied. Total rules applied 3 place count 124 transition count 274
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 12 place count 124 transition count 265
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 0 with 2 rules applied. Total rules applied 14 place count 123 transition count 264
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 123 transition count 263
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 0 with 2 rules applied. Total rules applied 17 place count 122 transition count 262
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 18 place count 121 transition count 222
Iterating global reduction 0 with 1 rules applied. Total rules applied 19 place count 121 transition count 222
Free-agglomeration rule applied 9 times with reduction of 6 identical transitions.
Iterating global reduction 0 with 9 rules applied. Total rules applied 28 place count 121 transition count 207
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 40 place count 112 transition count 204
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 46 place count 112 transition count 204
Applied a total of 46 rules in 46 ms. Remains 112 /150 variables (removed 38) and now considering 204/419 (removed 215) transitions.
Running SMT prover for 2 properties.
[2025-05-31 07:32:31] [INFO ] Flow matrix only has 202 transitions (discarded 2 similar events)
// Phase 1: matrix 202 rows 112 cols
[2025-05-31 07:32:31] [INFO ] Computed 7 invariants in 1 ms
[2025-05-31 07:32:31] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2025-05-31 07:32:31] [INFO ] After 116ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2025-05-31 07:32:31] [INFO ] After 161ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2
[2025-05-31 07:32:31] [INFO ] After 261ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2
[2025-05-31 07:32:31] [INFO ] Flatten gal took : 14 ms
[2025-05-31 07:32:31] [INFO ] Flatten gal took : 11 ms
[2025-05-31 07:32:31] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2192426131942762684.gal : 3 ms
[2025-05-31 07:32:31] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1040008817666986956.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2192426131942762684.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1040008817666986956.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.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality1040008817666986956.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 10
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :10 after 25
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :25 after 86
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :86 after 170
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :170 after 283
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :283 after 454
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :454 after 1859
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1859 after 9962
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :9962 after 69709
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :69709 after 674030
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :674030 after 4.82392e+06
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,3.14398e+07,1.66305,32760,2,3252,17,90006,8,0,651,122316,0
Total reachable state count : 31439829

Verifying 2 reachability properties.
Reachability property MAX0 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX0,6080,1.66505,33024,2,284,17,90006,8,0,653,122316,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,6080,1.66648,33024,2,284,17,90006,8,0,653,122316,0
ITS tools runner thread asked to quit. Dying gracefully.
Over-approximation ignoring read arcs solved 0 properties in 2049 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Ending property specific reduction for FireWire-PT-13-UpperBounds-00 in 139495 ms.
Starting property specific reduction for FireWire-PT-13-UpperBounds-03
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1]
[2025-05-31 07:32:33] [INFO ] Flow matrix only has 436 transitions (discarded 37 similar events)
// Phase 1: matrix 436 rows 172 cols
[2025-05-31 07:32:33] [INFO ] Computed 7 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (337 resets) in 20 ms. (476 steps per ms)
BEST_FIRST walk for 10001 steps (79 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-05-31 07:32:33] [INFO ] Flow matrix only has 436 transitions (discarded 37 similar events)
[2025-05-31 07:32:33] [INFO ] Invariant cache hit.
[2025-05-31 07:32:33] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2025-05-31 07:32:33] [INFO ] [Real]Absence check using state equation in 139 ms returned sat
[2025-05-31 07:32:33] [INFO ] State equation strengthened by 64 read => feed constraints.
[2025-05-31 07:32:33] [INFO ] [Real]Added 64 Read/Feed constraints in 21 ms returned sat
[2025-05-31 07:32:33] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:32:33] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2025-05-31 07:32:33] [INFO ] [Nat]Absence check using state equation in 154 ms returned sat
[2025-05-31 07:32:33] [INFO ] [Nat]Added 64 Read/Feed constraints in 148 ms returned sat
[2025-05-31 07:32:34] [INFO ] Deduced a trap composed of 27 places in 154 ms of which 2 ms to minimize.
[2025-05-31 07:32:34] [INFO ] Deduced a trap composed of 23 places in 198 ms of which 3 ms to minimize.
[2025-05-31 07:32:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 416 ms
[2025-05-31 07:32:34] [INFO ] Computed and/alt/rep : 176/644/176 causal constraints (skipped 254 transitions) in 47 ms.
[2025-05-31 07:32:34] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 1 ms to minimize.
[2025-05-31 07:32:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 100 ms
[2025-05-31 07:32:34] [INFO ] Added : 22 causal constraints over 6 iterations in 433 ms. Result :sat
Minimization took 340 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 172 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p94) removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 172/172 places, 471/471 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 170 transition count 467
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 170 transition count 467
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 168 transition count 461
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 168 transition count 461
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 166 transition count 457
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 166 transition count 457
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 164 transition count 451
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 164 transition count 451
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 162 transition count 447
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 162 transition count 447
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 160 transition count 441
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 160 transition count 441
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 26 place count 158 transition count 437
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 158 transition count 437
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 30 place count 156 transition count 433
Iterating global reduction 0 with 2 rules applied. Total rules applied 32 place count 156 transition count 433
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 34 place count 154 transition count 429
Iterating global reduction 0 with 2 rules applied. Total rules applied 36 place count 154 transition count 429
Applied a total of 36 rules in 47 ms. Remains 154 /172 variables (removed 18) and now considering 429/471 (removed 42) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 154/172 places, 429/471 transitions.
[2025-05-31 07:32:35] [INFO ] Flow matrix only has 392 transitions (discarded 37 similar events)
// Phase 1: matrix 392 rows 154 cols
[2025-05-31 07:32:35] [INFO ] Computed 7 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (32135 resets) in 1897 ms. (526 steps per ms)
BEST_FIRST walk for 1000001 steps (6800 resets) in 559 ms. (1785 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-05-31 07:32:37] [INFO ] Flow matrix only has 392 transitions (discarded 37 similar events)
[2025-05-31 07:32:37] [INFO ] Invariant cache hit.
[2025-05-31 07:32:37] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2025-05-31 07:32:37] [INFO ] [Real]Absence check using state equation in 127 ms returned sat
[2025-05-31 07:32:37] [INFO ] State equation strengthened by 58 read => feed constraints.
[2025-05-31 07:32:37] [INFO ] [Real]Added 58 Read/Feed constraints in 43 ms returned sat
[2025-05-31 07:32:37] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:32:38] [INFO ] [Nat]Absence check using 7 positive place invariants in 6 ms returned sat
[2025-05-31 07:32:38] [INFO ] [Nat]Absence check using state equation in 120 ms returned sat
[2025-05-31 07:32:38] [INFO ] [Nat]Added 58 Read/Feed constraints in 63 ms returned sat
[2025-05-31 07:32:38] [INFO ] Computed and/alt/rep : 162/590/162 causal constraints (skipped 224 transitions) in 35 ms.
[2025-05-31 07:32:38] [INFO ] Deduced a trap composed of 31 places in 71 ms of which 1 ms to minimize.
[2025-05-31 07:32:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 129 ms
[2025-05-31 07:32:38] [INFO ] Added : 30 causal constraints over 8 iterations in 519 ms. Result :sat
Minimization took 277 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 154 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 154/154 places, 429/429 transitions.
Applied a total of 0 rules in 9 ms. Remains 154 /154 variables (removed 0) and now considering 429/429 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 154/154 places, 429/429 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 154/154 places, 429/429 transitions.
Applied a total of 0 rules in 9 ms. Remains 154 /154 variables (removed 0) and now considering 429/429 (removed 0) transitions.
[2025-05-31 07:32:39] [INFO ] Flow matrix only has 392 transitions (discarded 37 similar events)
[2025-05-31 07:32:39] [INFO ] Invariant cache hit.
[2025-05-31 07:32:39] [INFO ] Implicit Places using invariants in 245 ms returned []
[2025-05-31 07:32:39] [INFO ] Flow matrix only has 392 transitions (discarded 37 similar events)
[2025-05-31 07:32:39] [INFO ] Invariant cache hit.
[2025-05-31 07:32:39] [INFO ] State equation strengthened by 58 read => feed constraints.
[2025-05-31 07:32:39] [INFO ] Implicit Places using invariants and state equation in 554 ms returned []
Implicit Place search using SMT with State Equation took 801 ms to find 0 implicit places.
[2025-05-31 07:32:39] [INFO ] Redundant transitions in 4 ms returned []
Running 423 sub problems to find dead transitions.
[2025-05-31 07:32:39] [INFO ] Flow matrix only has 392 transitions (discarded 37 similar events)
[2025-05-31 07:32:39] [INFO ] Invariant cache hit.
[2025-05-31 07:32:39] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 423 unsolved
[2025-05-31 07:32:43] [INFO ] Deduced a trap composed of 32 places in 57 ms of which 2 ms to minimize.
[2025-05-31 07:32:44] [INFO ] Deduced a trap composed of 32 places in 71 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/153 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 3 (OVERLAPS) 1/154 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 423 unsolved
[2025-05-31 07:32:52] [INFO ] Deduced a trap composed of 57 places in 253 ms of which 3 ms to minimize.
[2025-05-31 07:32:53] [INFO ] Deduced a trap composed of 17 places in 219 ms of which 2 ms to minimize.
[2025-05-31 07:32:53] [INFO ] Deduced a trap composed of 65 places in 232 ms of which 3 ms to minimize.
[2025-05-31 07:32:53] [INFO ] Deduced a trap composed of 32 places in 224 ms of which 3 ms to minimize.
[2025-05-31 07:32:53] [INFO ] Deduced a trap composed of 23 places in 225 ms of which 3 ms to minimize.
[2025-05-31 07:32:56] [INFO ] Deduced a trap composed of 62 places in 135 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 423 unsolved
[2025-05-31 07:32:58] [INFO ] Deduced a trap composed of 17 places in 133 ms of which 2 ms to minimize.
[2025-05-31 07:32:58] [INFO ] Deduced a trap composed of 17 places in 109 ms of which 2 ms to minimize.
[2025-05-31 07:32:58] [INFO ] Deduced a trap composed of 62 places in 154 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/154 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 7 (OVERLAPS) 392/546 variables, 154/172 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/546 variables, 58/230 constraints. Problems are: Problem set: 0 solved, 423 unsolved
[2025-05-31 07:33:07] [INFO ] Deduced a trap composed of 40 places in 49 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/546 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 423 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 546/546 variables, and 231 constraints, problems are : Problem set: 0 solved, 423 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 154/154 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 423/423 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 423 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/153 variables, 11/17 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 3 (OVERLAPS) 1/154 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/154 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 6 (OVERLAPS) 392/546 variables, 154/173 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/546 variables, 58/231 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/546 variables, 423/654 constraints. Problems are: Problem set: 0 solved, 423 unsolved
[2025-05-31 07:33:33] [INFO ] Deduced a trap composed of 54 places in 153 ms of which 3 ms to minimize.
[2025-05-31 07:33:33] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/546 variables, 2/656 constraints. Problems are: Problem set: 0 solved, 423 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 546/546 variables, and 656 constraints, problems are : Problem set: 0 solved, 423 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 154/154 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 423/423 constraints, Known Traps: 14/14 constraints]
After SMT, in 60552ms problems are : Problem set: 0 solved, 423 unsolved
Search for dead transitions found 0 dead transitions in 60558ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61391 ms. Remains : 154/154 places, 429/429 transitions.
RANDOM walk for 40000 steps (1311 resets) in 161 ms. (246 steps per ms) remains 2/2 properties
[2025-05-31 07:33:40] [INFO ] Flatten gal took : 71 ms
[2025-05-31 07:33:40] [INFO ] Flatten gal took : 21 ms
[2025-05-31 07:33:40] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7225440401680236885.gal : 19 ms
BEST_FIRST walk for 40004 steps (277 resets) in 98 ms. (404 steps per ms) remains 2/2 properties
[2025-05-31 07:33:40] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality793137565104937421.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality7225440401680236885.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality793137565104937421.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.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...327
BEST_FIRST walk for 40002 steps (275 resets) in 69 ms. (571 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality793137565104937421.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 3
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :3 after 18
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :18 after 33
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :33 after 63
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :63 after 97
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :97 after 138
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :138 after 257
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :257 after 1040
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1040 after 5927
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :5927 after 17528
Interrupted probabilistic random walk after 504545 steps, run timeout after 3001 ms. (steps per millisecond=168 ) properties seen :0 out of 2
Probabilistic random walk after 504545 steps, saw 126135 distinct states, run finished after 3001 ms. (steps per millisecond=168 ) properties seen :0
[2025-05-31 07:33:43] [INFO ] Flow matrix only has 392 transitions (discarded 37 similar events)
[2025-05-31 07:33:43] [INFO ] Invariant cache hit.
[2025-05-31 07:33:43] [INFO ] State equation strengthened by 58 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) 45/46 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 133/179 variables, 46/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 187/366 variables, 16/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/366 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/366 variables, 20/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/366 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 1/367 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/367 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/367 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 159/526 variables, 79/165 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/526 variables, 2/167 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/526 variables, 38/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/526 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 18/544 variables, 10/215 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/544 variables, 2/217 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/544 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 2/546 variables, 2/219 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/546 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/546 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 546/546 variables, and 219 constraints, problems are : Problem set: 0 solved, 2 unsolved in 375 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 154/154 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
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) 45/46 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 133/179 variables, 46/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 187/366 variables, 16/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/366 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/366 variables, 20/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/366 variables, 2/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/366 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/367 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/367 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/367 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 159/526 variables, 79/167 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/526 variables, 2/169 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/526 variables, 38/207 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/526 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 18/544 variables, 10/217 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/544 variables, 2/219 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/544 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 2/546 variables, 2/221 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/546 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/546 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 546/546 variables, and 221 constraints, problems are : Problem set: 0 solved, 2 unsolved in 390 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 154/154 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 780ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 51 ms.
Support contains 1 out of 154 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 154/154 places, 429/429 transitions.
Applied a total of 0 rules in 7 ms. Remains 154 /154 variables (removed 0) and now considering 429/429 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 154/154 places, 429/429 transitions.
RANDOM walk for 40000 steps (1325 resets) in 414 ms. (96 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (247 resets) in 110 ms. (360 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (276 resets) in 74 ms. (533 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :17528 after 72037
Interrupted probabilistic random walk after 484363 steps, run timeout after 3001 ms. (steps per millisecond=161 ) properties seen :0 out of 2
Probabilistic random walk after 484363 steps, saw 121959 distinct states, run finished after 3006 ms. (steps per millisecond=161 ) properties seen :0
[2025-05-31 07:33:47] [INFO ] Flow matrix only has 392 transitions (discarded 37 similar events)
[2025-05-31 07:33:47] [INFO ] Invariant cache hit.
[2025-05-31 07:33:47] [INFO ] State equation strengthened by 58 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) 45/46 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 133/179 variables, 46/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 187/366 variables, 16/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/366 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/366 variables, 20/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/366 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 1/367 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/367 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/367 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 159/526 variables, 79/165 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/526 variables, 2/167 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/526 variables, 38/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/526 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 18/544 variables, 10/215 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/544 variables, 2/217 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/544 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 2/546 variables, 2/219 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/546 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/546 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 546/546 variables, and 219 constraints, problems are : Problem set: 0 solved, 2 unsolved in 343 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 154/154 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
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) 45/46 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 133/179 variables, 46/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 187/366 variables, 16/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/366 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/366 variables, 20/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/366 variables, 2/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/366 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/367 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/367 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/367 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 159/526 variables, 79/167 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/526 variables, 2/169 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/526 variables, 38/207 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/526 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 18/544 variables, 10/217 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/544 variables, 2/219 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/544 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 2/546 variables, 2/221 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/546 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/546 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 546/546 variables, and 221 constraints, problems are : Problem set: 0 solved, 2 unsolved in 365 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 154/154 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 722ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 51 ms.
Support contains 1 out of 154 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 154/154 places, 429/429 transitions.
Applied a total of 0 rules in 10 ms. Remains 154 /154 variables (removed 0) and now considering 429/429 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 154/154 places, 429/429 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 154/154 places, 429/429 transitions.
Applied a total of 0 rules in 6 ms. Remains 154 /154 variables (removed 0) and now considering 429/429 (removed 0) transitions.
[2025-05-31 07:33:48] [INFO ] Flow matrix only has 392 transitions (discarded 37 similar events)
[2025-05-31 07:33:48] [INFO ] Invariant cache hit.
[2025-05-31 07:33:48] [INFO ] Implicit Places using invariants in 136 ms returned []
[2025-05-31 07:33:48] [INFO ] Flow matrix only has 392 transitions (discarded 37 similar events)
[2025-05-31 07:33:48] [INFO ] Invariant cache hit.
[2025-05-31 07:33:48] [INFO ] State equation strengthened by 58 read => feed constraints.
Invariant property MIN0 does not hold.
Reachability property MAX0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 8193 fixpoint passes
[2025-05-31 07:33:49] [INFO ] Implicit Places using invariants and state equation in 421 ms returned []
Implicit Place search using SMT with State Equation took 562 ms to find 0 implicit places.
[2025-05-31 07:33:49] [INFO ] Redundant transitions in 4 ms returned []
Running 423 sub problems to find dead transitions.
[2025-05-31 07:33:49] [INFO ] Flow matrix only has 392 transitions (discarded 37 similar events)
[2025-05-31 07:33:49] [INFO ] Invariant cache hit.
[2025-05-31 07:33:49] [INFO ] State equation strengthened by 58 read => feed constraints.
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,224984,8.93192,149712,2,4994,18,264009,6,0,1042,343928,0
Total reachable state count : 224984

Verifying 2 reachability properties.
Reachability property MAX0 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX0,53,8.93488,149712,2,220,18,264009,7,0,1045,343928,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,53,8.93711,149712,2,220,18,264009,8,0,1046,343928,0
ITS tools runner thread asked to quit. Dying gracefully.
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 423 unsolved
[2025-05-31 07:33:52] [INFO ] Deduced a trap composed of 32 places in 43 ms of which 2 ms to minimize.
[2025-05-31 07:33:53] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/153 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 3 (OVERLAPS) 1/154 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 423 unsolved
[2025-05-31 07:33:59] [INFO ] Deduced a trap composed of 57 places in 146 ms of which 3 ms to minimize.
[2025-05-31 07:33:59] [INFO ] Deduced a trap composed of 17 places in 161 ms of which 2 ms to minimize.
[2025-05-31 07:33:59] [INFO ] Deduced a trap composed of 65 places in 161 ms of which 3 ms to minimize.
[2025-05-31 07:33:59] [INFO ] Deduced a trap composed of 32 places in 141 ms of which 2 ms to minimize.
[2025-05-31 07:34:00] [INFO ] Deduced a trap composed of 23 places in 145 ms of which 3 ms to minimize.
[2025-05-31 07:34:02] [INFO ] Deduced a trap composed of 62 places in 174 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 423 unsolved
[2025-05-31 07:34:04] [INFO ] Deduced a trap composed of 17 places in 152 ms of which 3 ms to minimize.
[2025-05-31 07:34:05] [INFO ] Deduced a trap composed of 17 places in 172 ms of which 3 ms to minimize.
[2025-05-31 07:34:05] [INFO ] Deduced a trap composed of 62 places in 147 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/154 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 7 (OVERLAPS) 392/546 variables, 154/172 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/546 variables, 58/230 constraints. Problems are: Problem set: 0 solved, 423 unsolved
[2025-05-31 07:34:15] [INFO ] Deduced a trap composed of 40 places in 61 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/546 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 423 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 546/546 variables, and 231 constraints, problems are : Problem set: 0 solved, 423 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 154/154 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 423/423 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 423 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/153 variables, 11/17 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 3 (OVERLAPS) 1/154 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/154 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 6 (OVERLAPS) 392/546 variables, 154/173 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/546 variables, 58/231 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/546 variables, 423/654 constraints. Problems are: Problem set: 0 solved, 423 unsolved
[2025-05-31 07:34:41] [INFO ] Deduced a trap composed of 54 places in 130 ms of which 2 ms to minimize.
[2025-05-31 07:34:42] [INFO ] Deduced a trap composed of 31 places in 62 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/546 variables, 2/656 constraints. Problems are: Problem set: 0 solved, 423 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 546/546 variables, and 656 constraints, problems are : Problem set: 0 solved, 423 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 154/154 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 423/423 constraints, Known Traps: 14/14 constraints]
After SMT, in 60485ms problems are : Problem set: 0 solved, 423 unsolved
Search for dead transitions found 0 dead transitions in 60490ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61071 ms. Remains : 154/154 places, 429/429 transitions.
FORMULA FireWire-PT-13-UpperBounds-03 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for FireWire-PT-13-UpperBounds-03 in 136291 ms.
Starting property specific reduction for FireWire-PT-13-UpperBounds-08
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1]
[2025-05-31 07:34:49] [INFO ] Flow matrix only has 436 transitions (discarded 37 similar events)
// Phase 1: matrix 436 rows 172 cols
[2025-05-31 07:34:49] [INFO ] Computed 7 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (327 resets) in 21 ms. (454 steps per ms)
BEST_FIRST walk for 10001 steps (84 resets) in 8 ms. (1111 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-05-31 07:34:49] [INFO ] Flow matrix only has 436 transitions (discarded 37 similar events)
[2025-05-31 07:34:49] [INFO ] Invariant cache hit.
[2025-05-31 07:34:49] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned sat
[2025-05-31 07:34:49] [INFO ] [Real]Absence check using state equation in 197 ms returned sat
[2025-05-31 07:34:49] [INFO ] State equation strengthened by 64 read => feed constraints.
[2025-05-31 07:34:49] [INFO ] [Real]Added 64 Read/Feed constraints in 53 ms returned sat
[2025-05-31 07:34:50] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:34:50] [INFO ] [Nat]Absence check using 7 positive place invariants in 7 ms returned sat
[2025-05-31 07:34:50] [INFO ] [Nat]Absence check using state equation in 206 ms returned sat
[2025-05-31 07:34:50] [INFO ] [Nat]Added 64 Read/Feed constraints in 35 ms returned sat
[2025-05-31 07:34:50] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 1 ms to minimize.
[2025-05-31 07:34:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 81 ms
[2025-05-31 07:34:50] [INFO ] Computed and/alt/rep : 176/644/176 causal constraints (skipped 254 transitions) in 35 ms.
[2025-05-31 07:34:50] [INFO ] Deduced a trap composed of 38 places in 165 ms of which 2 ms to minimize.
[2025-05-31 07:34:51] [INFO ] Deduced a trap composed of 17 places in 153 ms of which 2 ms to minimize.
[2025-05-31 07:34:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 384 ms
[2025-05-31 07:34:51] [INFO ] Added : 51 causal constraints over 12 iterations in 804 ms. Result :sat
Minimization took 417 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 172 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p161) removed 3 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 172/172 places, 470/470 transitions.
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 171 transition count 468
Reduce places removed 1 places and 3 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 170 transition count 465
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3 place count 169 transition count 463
Reduce places removed 1 places and 3 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 4 place count 168 transition count 460
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 5 place count 167 transition count 458
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 7 place count 165 transition count 454
Iterating global reduction 5 with 2 rules applied. Total rules applied 9 place count 165 transition count 454
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 11 place count 163 transition count 448
Iterating global reduction 5 with 2 rules applied. Total rules applied 13 place count 163 transition count 448
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 15 place count 161 transition count 444
Iterating global reduction 5 with 2 rules applied. Total rules applied 17 place count 161 transition count 444
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 19 place count 159 transition count 438
Iterating global reduction 5 with 2 rules applied. Total rules applied 21 place count 159 transition count 438
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 23 place count 157 transition count 434
Iterating global reduction 5 with 2 rules applied. Total rules applied 25 place count 157 transition count 434
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 27 place count 155 transition count 429
Iterating global reduction 5 with 2 rules applied. Total rules applied 29 place count 155 transition count 429
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 31 place count 153 transition count 425
Iterating global reduction 5 with 2 rules applied. Total rules applied 33 place count 153 transition count 425
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 34 place count 152 transition count 423
Iterating global reduction 5 with 1 rules applied. Total rules applied 35 place count 152 transition count 423
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 36 place count 151 transition count 421
Iterating global reduction 5 with 1 rules applied. Total rules applied 37 place count 151 transition count 421
Applied a total of 37 rules in 54 ms. Remains 151 /172 variables (removed 21) and now considering 421/470 (removed 49) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 151/172 places, 421/470 transitions.
[2025-05-31 07:34:51] [INFO ] Flow matrix only has 384 transitions (discarded 37 similar events)
// Phase 1: matrix 384 rows 151 cols
[2025-05-31 07:34:51] [INFO ] Computed 7 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (32207 resets) in 1970 ms. (507 steps per ms)
BEST_FIRST walk for 1000001 steps (6825 resets) in 558 ms. (1788 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-05-31 07:34:54] [INFO ] Flow matrix only has 384 transitions (discarded 37 similar events)
[2025-05-31 07:34:54] [INFO ] Invariant cache hit.
[2025-05-31 07:34:54] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned sat
[2025-05-31 07:34:54] [INFO ] [Real]Absence check using state equation in 132 ms returned sat
[2025-05-31 07:34:54] [INFO ] State equation strengthened by 56 read => feed constraints.
[2025-05-31 07:34:54] [INFO ] [Real]Added 56 Read/Feed constraints in 53 ms returned sat
[2025-05-31 07:34:54] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:34:54] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2025-05-31 07:34:54] [INFO ] [Nat]Absence check using state equation in 125 ms returned sat
[2025-05-31 07:34:54] [INFO ] [Nat]Added 56 Read/Feed constraints in 59 ms returned sat
[2025-05-31 07:34:54] [INFO ] Deduced a trap composed of 17 places in 121 ms of which 2 ms to minimize.
[2025-05-31 07:34:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 159 ms
[2025-05-31 07:34:55] [INFO ] Computed and/alt/rep : 158/578/158 causal constraints (skipped 220 transitions) in 35 ms.
[2025-05-31 07:34:55] [INFO ] Deduced a trap composed of 14 places in 144 ms of which 1 ms to minimize.
[2025-05-31 07:34:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 183 ms
[2025-05-31 07:34:55] [INFO ] Added : 36 causal constraints over 8 iterations in 497 ms. Result :sat
Minimization took 178 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 151 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 151/151 places, 421/421 transitions.
Applied a total of 0 rules in 6 ms. Remains 151 /151 variables (removed 0) and now considering 421/421 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 151/151 places, 421/421 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 151/151 places, 421/421 transitions.
Applied a total of 0 rules in 6 ms. Remains 151 /151 variables (removed 0) and now considering 421/421 (removed 0) transitions.
[2025-05-31 07:34:55] [INFO ] Flow matrix only has 384 transitions (discarded 37 similar events)
[2025-05-31 07:34:55] [INFO ] Invariant cache hit.
[2025-05-31 07:34:55] [INFO ] Implicit Places using invariants in 190 ms returned []
[2025-05-31 07:34:55] [INFO ] Flow matrix only has 384 transitions (discarded 37 similar events)
[2025-05-31 07:34:55] [INFO ] Invariant cache hit.
[2025-05-31 07:34:56] [INFO ] State equation strengthened by 56 read => feed constraints.
[2025-05-31 07:34:56] [INFO ] Implicit Places using invariants and state equation in 608 ms returned []
Implicit Place search using SMT with State Equation took 809 ms to find 0 implicit places.
[2025-05-31 07:34:56] [INFO ] Redundant transitions in 3 ms returned []
Running 415 sub problems to find dead transitions.
[2025-05-31 07:34:56] [INFO ] Flow matrix only has 384 transitions (discarded 37 similar events)
[2025-05-31 07:34:56] [INFO ] Invariant cache hit.
[2025-05-31 07:34:56] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 415 unsolved
[2025-05-31 07:35:00] [INFO ] Deduced a trap composed of 32 places in 51 ms of which 2 ms to minimize.
[2025-05-31 07:35:01] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 3 (OVERLAPS) 1/151 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 415 unsolved
[2025-05-31 07:35:07] [INFO ] Deduced a trap composed of 54 places in 197 ms of which 2 ms to minimize.
[2025-05-31 07:35:07] [INFO ] Deduced a trap composed of 17 places in 198 ms of which 3 ms to minimize.
[2025-05-31 07:35:07] [INFO ] Deduced a trap composed of 23 places in 227 ms of which 3 ms to minimize.
[2025-05-31 07:35:07] [INFO ] Deduced a trap composed of 32 places in 58 ms of which 2 ms to minimize.
[2025-05-31 07:35:08] [INFO ] Deduced a trap composed of 17 places in 184 ms of which 3 ms to minimize.
[2025-05-31 07:35:08] [INFO ] Deduced a trap composed of 17 places in 188 ms of which 2 ms to minimize.
[2025-05-31 07:35:10] [INFO ] Deduced a trap composed of 50 places in 153 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/151 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 415 unsolved
[2025-05-31 07:35:11] [INFO ] Deduced a trap composed of 55 places in 135 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/151 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 415 unsolved
[2025-05-31 07:35:16] [INFO ] Deduced a trap composed of 16 places in 123 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/151 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/151 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 8 (OVERLAPS) 384/535 variables, 151/169 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/535 variables, 56/225 constraints. Problems are: Problem set: 0 solved, 415 unsolved
[2025-05-31 07:35:26] [INFO ] Deduced a trap composed of 40 places in 61 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 535/535 variables, and 226 constraints, problems are : Problem set: 0 solved, 415 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 151/151 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 415/415 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 415 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 12/18 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 3 (OVERLAPS) 1/151 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/151 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 5 (OVERLAPS) 384/535 variables, 151/170 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/535 variables, 56/226 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/535 variables, 415/641 constraints. Problems are: Problem set: 0 solved, 415 unsolved
[2025-05-31 07:35:50] [INFO ] Deduced a trap composed of 31 places in 45 ms of which 1 ms to minimize.
[2025-05-31 07:35:50] [INFO ] Deduced a trap composed of 31 places in 58 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/535 variables, 2/643 constraints. Problems are: Problem set: 0 solved, 415 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 535/535 variables, and 643 constraints, problems are : Problem set: 0 solved, 415 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 151/151 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 415/415 constraints, Known Traps: 14/14 constraints]
After SMT, in 60489ms problems are : Problem set: 0 solved, 415 unsolved
Search for dead transitions found 0 dead transitions in 60497ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61324 ms. Remains : 151/151 places, 421/421 transitions.
[2025-05-31 07:35:57] [INFO ] Flatten gal took : 19 ms
[2025-05-31 07:35:57] [INFO ] Flatten gal took : 27 ms
RANDOM walk for 40000 steps (1278 resets) in 188 ms. (211 steps per ms) remains 2/2 properties
[2025-05-31 07:35:57] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1543102603127500971.gal : 36 ms
[2025-05-31 07:35:57] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1072445176631832067.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality1543102603127500971.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1072445176631832067.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40002 steps (277 resets) in 34 ms. (1142 steps per ms) remains 2/2 properties

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
BEST_FIRST walk for 40002 steps (270 resets) in 41 ms. (952 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality1072445176631832067.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 3
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :3 after 18
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :18 after 36
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :36 after 69
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :69 after 110
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :110 after 145
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :145 after 297
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :297 after 2142
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :2142 after 10817
Interrupted probabilistic random walk after 500261 steps, run timeout after 3001 ms. (steps per millisecond=166 ) properties seen :0 out of 2
Probabilistic random walk after 500261 steps, saw 125252 distinct states, run finished after 3001 ms. (steps per millisecond=166 ) properties seen :0
[2025-05-31 07:36:00] [INFO ] Flow matrix only has 384 transitions (discarded 37 similar events)
[2025-05-31 07:36:00] [INFO ] Invariant cache hit.
[2025-05-31 07:36:00] [INFO ] State equation strengthened by 56 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) 42/43 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 125/168 variables, 43/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 187/355 variables, 16/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/355 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/355 variables, 18/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/355 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 1/356 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/356 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/356 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 159/515 variables, 79/160 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/515 variables, 2/162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/515 variables, 38/200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/515 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 18/533 variables, 10/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/533 variables, 2/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/533 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 2/535 variables, 2/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/535 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/535 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 535/535 variables, and 214 constraints, problems are : Problem set: 0 solved, 2 unsolved in 358 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 151/151 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
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) 42/43 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 125/168 variables, 43/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 187/355 variables, 16/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/355 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/355 variables, 18/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/355 variables, 2/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/355 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/356 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/356 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/356 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 159/515 variables, 79/162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/515 variables, 2/164 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/515 variables, 38/202 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/515 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 18/533 variables, 10/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/533 variables, 2/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/533 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 2/535 variables, 2/216 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/535 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :10817 after 20060
At refinement iteration 22 (OVERLAPS) 0/535 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 535/535 variables, and 216 constraints, problems are : Problem set: 0 solved, 2 unsolved in 407 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 151/151 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 776ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 45 ms.
Support contains 1 out of 151 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 151/151 places, 421/421 transitions.
Applied a total of 0 rules in 10 ms. Remains 151 /151 variables (removed 0) and now considering 421/421 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 151/151 places, 421/421 transitions.
RANDOM walk for 40000 steps (1289 resets) in 147 ms. (270 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (278 resets) in 60 ms. (655 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (273 resets) in 139 ms. (285 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :20060 after 137039
Interrupted probabilistic random walk after 392191 steps, run timeout after 3001 ms. (steps per millisecond=130 ) properties seen :0 out of 2
Probabilistic random walk after 392191 steps, saw 105165 distinct states, run finished after 3001 ms. (steps per millisecond=130 ) properties seen :0
[2025-05-31 07:36:04] [INFO ] Flow matrix only has 384 transitions (discarded 37 similar events)
[2025-05-31 07:36:04] [INFO ] Invariant cache hit.
[2025-05-31 07:36:04] [INFO ] State equation strengthened by 56 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) 42/43 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 125/168 variables, 43/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 187/355 variables, 16/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/355 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/355 variables, 18/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/355 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 1/356 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/356 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/356 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 159/515 variables, 79/160 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/515 variables, 2/162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/515 variables, 38/200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/515 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 18/533 variables, 10/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/533 variables, 2/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/533 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 2/535 variables, 2/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/535 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/535 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 535/535 variables, and 214 constraints, problems are : Problem set: 0 solved, 2 unsolved in 415 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 151/151 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
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) 42/43 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 125/168 variables, 43/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 187/355 variables, 16/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/355 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/355 variables, 18/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/355 variables, 2/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/355 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/356 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/356 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/356 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 159/515 variables, 79/162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/515 variables, 2/164 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/515 variables, 38/202 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/515 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 18/533 variables, 10/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/533 variables, 2/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/533 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 2/535 variables, 2/216 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/535 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/535 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 535/535 variables, and 216 constraints, problems are : Problem set: 0 solved, 2 unsolved in 480 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 151/151 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 903ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 74 ms.
Support contains 1 out of 151 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 151/151 places, 421/421 transitions.
Applied a total of 0 rules in 8 ms. Remains 151 /151 variables (removed 0) and now considering 421/421 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 151/151 places, 421/421 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 151/151 places, 421/421 transitions.
Applied a total of 0 rules in 7 ms. Remains 151 /151 variables (removed 0) and now considering 421/421 (removed 0) transitions.
[2025-05-31 07:36:05] [INFO ] Flow matrix only has 384 transitions (discarded 37 similar events)
[2025-05-31 07:36:05] [INFO ] Invariant cache hit.
[2025-05-31 07:36:05] [INFO ] Implicit Places using invariants in 233 ms returned []
[2025-05-31 07:36:05] [INFO ] Flow matrix only has 384 transitions (discarded 37 similar events)
[2025-05-31 07:36:05] [INFO ] Invariant cache hit.
[2025-05-31 07:36:05] [INFO ] State equation strengthened by 56 read => feed constraints.
[2025-05-31 07:36:05] [INFO ] Implicit Places using invariants and state equation in 596 ms returned []
Implicit Place search using SMT with State Equation took 832 ms to find 0 implicit places.
[2025-05-31 07:36:05] [INFO ] Redundant transitions in 5 ms returned []
Running 415 sub problems to find dead transitions.
[2025-05-31 07:36:05] [INFO ] Flow matrix only has 384 transitions (discarded 37 similar events)
[2025-05-31 07:36:05] [INFO ] Invariant cache hit.
[2025-05-31 07:36:05] [INFO ] State equation strengthened by 56 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :137039 after 314942
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 415 unsolved
[2025-05-31 07:36:10] [INFO ] Deduced a trap composed of 32 places in 51 ms of which 2 ms to minimize.
[2025-05-31 07:36:11] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 3 (OVERLAPS) 1/151 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 415 unsolved
[2025-05-31 07:36:17] [INFO ] Deduced a trap composed of 54 places in 217 ms of which 3 ms to minimize.
[2025-05-31 07:36:18] [INFO ] Deduced a trap composed of 17 places in 171 ms of which 3 ms to minimize.
[2025-05-31 07:36:18] [INFO ] Deduced a trap composed of 23 places in 167 ms of which 3 ms to minimize.
[2025-05-31 07:36:18] [INFO ] Deduced a trap composed of 32 places in 52 ms of which 1 ms to minimize.
[2025-05-31 07:36:19] [INFO ] Deduced a trap composed of 17 places in 118 ms of which 2 ms to minimize.
[2025-05-31 07:36:19] [INFO ] Deduced a trap composed of 17 places in 95 ms of which 2 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :314942 after 1.67475e+06
[2025-05-31 07:36:20] [INFO ] Deduced a trap composed of 50 places in 118 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/151 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 415 unsolved
[2025-05-31 07:36:21] [INFO ] Deduced a trap composed of 55 places in 199 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/151 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 415 unsolved
[2025-05-31 07:36:27] [INFO ] Deduced a trap composed of 16 places in 177 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/151 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/151 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 8 (OVERLAPS) 384/535 variables, 151/169 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/535 variables, 56/225 constraints. Problems are: Problem set: 0 solved, 415 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 535/535 variables, and 225 constraints, problems are : Problem set: 0 solved, 415 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 151/151 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 415/415 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 415 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 11/17 constraints. Problems are: Problem set: 0 solved, 415 unsolved
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :1.67475e+06 after 1.07713e+07
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 3 (OVERLAPS) 1/151 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/151 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 5 (OVERLAPS) 384/535 variables, 151/169 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/535 variables, 56/225 constraints. Problems are: Problem set: 0 solved, 415 unsolved
Detected timeout of ITS tools.
[2025-05-31 07:36:47] [INFO ] Flatten gal took : 18 ms
[2025-05-31 07:36:47] [INFO ] Applying decomposition
[2025-05-31 07:36:47] [INFO ] Flatten gal took : 16 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph6241777989893043004.txt' '-o' '/tmp/graph6241777989893043004.bin' '-w' '/tmp/graph6241777989893043004.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6241777989893043004.bin' '-l' '-1' '-v' '-w' '/tmp/graph6241777989893043004.weights' '-q' '0' '-e' '0.001'
[2025-05-31 07:36:47] [INFO ] Decomposing Gal with order
[2025-05-31 07:36:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 07:36:47] [INFO ] Removed a total of 638 redundant transitions.
[2025-05-31 07:36:47] [INFO ] Flatten gal took : 38 ms
[2025-05-31 07:36:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 122 labels/synchronizations in 14 ms.
[2025-05-31 07:36:47] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6140760234349779729.gal : 5 ms
[2025-05-31 07:36:47] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15823996022143390414.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6140760234349779729.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15823996022143390414.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality15823996022143390414.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :9 after 9
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :9 after 9
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :9 after 9
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :9 after 414
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :414 after 1795
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :1795 after 2103
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :2103 after 100284
At refinement iteration 7 (INCLUDED_ONLY) 0/535 variables, 415/640 constraints. Problems are: Problem set: 0 solved, 415 unsolved
[2025-05-31 07:36:50] [INFO ] Deduced a trap composed of 40 places in 62 ms of which 2 ms to minimize.
[2025-05-31 07:36:54] [INFO ] Deduced a trap composed of 31 places in 62 ms of which 2 ms to minimize.
[2025-05-31 07:36:58] [INFO ] Deduced a trap composed of 31 places in 44 ms of which 1 ms to minimize.
[2025-05-31 07:36:58] [INFO ] Deduced a trap composed of 52 places in 197 ms of which 3 ms to minimize.
[2025-05-31 07:36:59] [INFO ] Deduced a trap composed of 54 places in 190 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/535 variables, 5/645 constraints. Problems are: Problem set: 0 solved, 415 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 535/535 variables, and 645 constraints, problems are : Problem set: 0 solved, 415 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 151/151 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 415/415 constraints, Known Traps: 16/16 constraints]
After SMT, in 60630ms problems are : Problem set: 0 solved, 415 unsolved
Search for dead transitions found 0 dead transitions in 60638ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61496 ms. Remains : 151/151 places, 421/421 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 139 edges and 151 vertex of which 29 / 151 are part of one of the 4 SCC in 1 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 123 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 144 transitions.
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 0 with 2 rules applied. Total rules applied 3 place count 125 transition count 276
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 12 place count 125 transition count 267
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 0 with 2 rules applied. Total rules applied 14 place count 124 transition count 266
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 124 transition count 265
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 0 with 2 rules applied. Total rules applied 17 place count 123 transition count 264
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 18 place count 122 transition count 224
Iterating global reduction 0 with 1 rules applied. Total rules applied 19 place count 122 transition count 224
Free-agglomeration rule applied 9 times with reduction of 6 identical transitions.
Iterating global reduction 0 with 9 rules applied. Total rules applied 28 place count 122 transition count 209
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 40 place count 113 transition count 206
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 46 place count 113 transition count 206
Applied a total of 46 rules in 28 ms. Remains 113 /151 variables (removed 38) and now considering 206/421 (removed 215) transitions.
Running SMT prover for 2 properties.
[2025-05-31 07:37:06] [INFO ] Flow matrix only has 204 transitions (discarded 2 similar events)
// Phase 1: matrix 204 rows 113 cols
[2025-05-31 07:37:06] [INFO ] Computed 7 invariants in 1 ms
[2025-05-31 07:37:06] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2025-05-31 07:37:06] [INFO ] After 89ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2025-05-31 07:37:06] [INFO ] After 118ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2
[2025-05-31 07:37:06] [INFO ] After 194ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2
[2025-05-31 07:37:06] [INFO ] Flatten gal took : 8 ms
[2025-05-31 07:37:06] [INFO ] Flatten gal took : 8 ms
[2025-05-31 07:37:06] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1793995617505947826.gal : 2 ms
[2025-05-31 07:37:06] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13995548238188464869.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality1793995617505947826.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13995548238188464869.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.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality13995548238188464869.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 10
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :10 after 25
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :25 after 86
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :86 after 170
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :170 after 283
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :283 after 454
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :454 after 1841
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1841 after 9962
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :9962 after 140749
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :140749 after 1.12276e+06
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :1.12276e+06 after 6.00783e+06
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,3.15892e+07,1.38755,33336,2,3216,17,87067,8,0,657,123411,0
Total reachable state count : 31589201

Verifying 2 reachability properties.
Reachability property MAX0 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX0,5240,1.38902,33336,2,395,17,87067,8,0,659,123411,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,5240,1.39007,33600,2,395,17,87067,8,0,659,123411,0
Over-approximation ignoring read arcs solved 0 properties in 1658 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Ending property specific reduction for FireWire-PT-13-UpperBounds-08 in 138640 ms.
Starting property specific reduction for FireWire-PT-13-UpperBounds-09
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1]
[2025-05-31 07:37:08] [INFO ] Flow matrix only has 436 transitions (discarded 37 similar events)
// Phase 1: matrix 436 rows 172 cols
[2025-05-31 07:37:08] [INFO ] Computed 7 invariants in 6 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (316 resets) in 20 ms. (476 steps per ms)
BEST_FIRST walk for 10001 steps (70 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-05-31 07:37:08] [INFO ] Flow matrix only has 436 transitions (discarded 37 similar events)
[2025-05-31 07:37:08] [INFO ] Invariant cache hit.
[2025-05-31 07:37:08] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned sat
[2025-05-31 07:37:08] [INFO ] [Real]Absence check using state equation in 133 ms returned sat
[2025-05-31 07:37:08] [INFO ] State equation strengthened by 64 read => feed constraints.
[2025-05-31 07:37:08] [INFO ] [Real]Added 64 Read/Feed constraints in 33 ms returned sat
[2025-05-31 07:37:08] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:37:08] [INFO ] [Nat]Absence check using 7 positive place invariants in 6 ms returned sat
[2025-05-31 07:37:08] [INFO ] [Nat]Absence check using state equation in 148 ms returned sat
[2025-05-31 07:37:08] [INFO ] [Nat]Added 64 Read/Feed constraints in 67 ms returned sat
[2025-05-31 07:37:08] [INFO ] Computed and/alt/rep : 176/644/176 causal constraints (skipped 254 transitions) in 39 ms.
[2025-05-31 07:37:09] [INFO ] Deduced a trap composed of 38 places in 47 ms of which 1 ms to minimize.
[2025-05-31 07:37:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 90 ms
[2025-05-31 07:37:09] [INFO ] Added : 29 causal constraints over 8 iterations in 400 ms. Result :sat
Minimization took 309 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 172 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p156) removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 172/172 places, 471/471 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 170 transition count 467
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 170 transition count 467
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 168 transition count 461
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 168 transition count 461
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 166 transition count 457
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 166 transition count 457
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 164 transition count 451
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 164 transition count 451
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 162 transition count 447
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 162 transition count 447
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 160 transition count 442
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 160 transition count 442
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 26 place count 158 transition count 438
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 158 transition count 438
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 157 transition count 436
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 157 transition count 436
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 156 transition count 434
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 156 transition count 434
Applied a total of 32 rules in 38 ms. Remains 156 /172 variables (removed 16) and now considering 434/471 (removed 37) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 156/172 places, 434/471 transitions.
[2025-05-31 07:37:09] [INFO ] Flow matrix only has 397 transitions (discarded 37 similar events)
// Phase 1: matrix 397 rows 156 cols
[2025-05-31 07:37:09] [INFO ] Computed 7 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (32109 resets) in 1855 ms. (538 steps per ms)
BEST_FIRST walk for 1000001 steps (6870 resets) in 575 ms. (1736 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-05-31 07:37:12] [INFO ] Flow matrix only has 397 transitions (discarded 37 similar events)
[2025-05-31 07:37:12] [INFO ] Invariant cache hit.
[2025-05-31 07:37:12] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2025-05-31 07:37:12] [INFO ] [Real]Absence check using state equation in 143 ms returned sat
[2025-05-31 07:37:12] [INFO ] State equation strengthened by 59 read => feed constraints.
[2025-05-31 07:37:12] [INFO ] [Real]Added 59 Read/Feed constraints in 36 ms returned sat
[2025-05-31 07:37:12] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:37:12] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2025-05-31 07:37:12] [INFO ] [Nat]Absence check using state equation in 125 ms returned sat
[2025-05-31 07:37:12] [INFO ] [Nat]Added 59 Read/Feed constraints in 28 ms returned sat
[2025-05-31 07:37:12] [INFO ] Deduced a trap composed of 40 places in 112 ms of which 2 ms to minimize.
[2025-05-31 07:37:12] [INFO ] Deduced a trap composed of 23 places in 114 ms of which 2 ms to minimize.
[2025-05-31 07:37:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 264 ms
[2025-05-31 07:37:12] [INFO ] Computed and/alt/rep : 164/596/164 causal constraints (skipped 227 transitions) in 31 ms.
[2025-05-31 07:37:13] [INFO ] Deduced a trap composed of 27 places in 140 ms of which 2 ms to minimize.
[2025-05-31 07:37:13] [INFO ] Deduced a trap composed of 16 places in 134 ms of which 2 ms to minimize.
[2025-05-31 07:37:13] [INFO ] Deduced a trap composed of 14 places in 140 ms of which 2 ms to minimize.
[2025-05-31 07:37:13] [INFO ] Deduced a trap composed of 51 places in 133 ms of which 2 ms to minimize.
[2025-05-31 07:37:13] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 653 ms
[2025-05-31 07:37:13] [INFO ] Added : 52 causal constraints over 12 iterations in 1015 ms. Result :sat
Minimization took 189 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 156 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 434/434 transitions.
Applied a total of 0 rules in 6 ms. Remains 156 /156 variables (removed 0) and now considering 434/434 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 156/156 places, 434/434 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 434/434 transitions.
Applied a total of 0 rules in 6 ms. Remains 156 /156 variables (removed 0) and now considering 434/434 (removed 0) transitions.
[2025-05-31 07:37:14] [INFO ] Flow matrix only has 397 transitions (discarded 37 similar events)
[2025-05-31 07:37:14] [INFO ] Invariant cache hit.
[2025-05-31 07:37:14] [INFO ] Implicit Places using invariants in 170 ms returned []
[2025-05-31 07:37:14] [INFO ] Flow matrix only has 397 transitions (discarded 37 similar events)
[2025-05-31 07:37:14] [INFO ] Invariant cache hit.
[2025-05-31 07:37:14] [INFO ] State equation strengthened by 59 read => feed constraints.
[2025-05-31 07:37:14] [INFO ] Implicit Places using invariants and state equation in 533 ms returned []
Implicit Place search using SMT with State Equation took 718 ms to find 0 implicit places.
[2025-05-31 07:37:14] [INFO ] Redundant transitions in 4 ms returned []
Running 428 sub problems to find dead transitions.
[2025-05-31 07:37:14] [INFO ] Flow matrix only has 397 transitions (discarded 37 similar events)
[2025-05-31 07:37:14] [INFO ] Invariant cache hit.
[2025-05-31 07:37:14] [INFO ] State equation strengthened by 59 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 428 unsolved
[2025-05-31 07:37:18] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 1 ms to minimize.
[2025-05-31 07:37:18] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 3 (OVERLAPS) 1/156 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 428 unsolved
[2025-05-31 07:37:23] [INFO ] Deduced a trap composed of 58 places in 134 ms of which 3 ms to minimize.
[2025-05-31 07:37:24] [INFO ] Deduced a trap composed of 23 places in 143 ms of which 3 ms to minimize.
[2025-05-31 07:37:24] [INFO ] Deduced a trap composed of 32 places in 45 ms of which 1 ms to minimize.
[2025-05-31 07:37:24] [INFO ] Deduced a trap composed of 17 places in 125 ms of which 2 ms to minimize.
[2025-05-31 07:37:26] [INFO ] Deduced a trap composed of 51 places in 123 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 428 unsolved
[2025-05-31 07:37:29] [INFO ] Deduced a trap composed of 28 places in 151 ms of which 3 ms to minimize.
[2025-05-31 07:37:29] [INFO ] Deduced a trap composed of 17 places in 213 ms of which 3 ms to minimize.
[2025-05-31 07:37:29] [INFO ] Deduced a trap composed of 17 places in 123 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 428 unsolved
[2025-05-31 07:37:32] [INFO ] Deduced a trap composed of 14 places in 150 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/156 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/156 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 8 (OVERLAPS) 397/553 variables, 156/174 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/553 variables, 59/233 constraints. Problems are: Problem set: 0 solved, 428 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 553/553 variables, and 233 constraints, problems are : Problem set: 0 solved, 428 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 156/156 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 428/428 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 428 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 10/16 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 3 (OVERLAPS) 1/156 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 6 (OVERLAPS) 397/553 variables, 156/174 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/553 variables, 59/233 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/553 variables, 428/661 constraints. Problems are: Problem set: 0 solved, 428 unsolved
[2025-05-31 07:37:59] [INFO ] Deduced a trap composed of 40 places in 47 ms of which 2 ms to minimize.
[2025-05-31 07:38:07] [INFO ] Deduced a trap composed of 31 places in 55 ms of which 1 ms to minimize.
[2025-05-31 07:38:07] [INFO ] Deduced a trap composed of 31 places in 50 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/553 variables, 3/664 constraints. Problems are: Problem set: 0 solved, 428 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 553/553 variables, and 664 constraints, problems are : Problem set: 0 solved, 428 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 156/156 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 428/428 constraints, Known Traps: 14/14 constraints]
After SMT, in 60561ms problems are : Problem set: 0 solved, 428 unsolved
Search for dead transitions found 0 dead transitions in 60567ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61301 ms. Remains : 156/156 places, 434/434 transitions.
[2025-05-31 07:38:15] [INFO ] Flatten gal took : 20 ms
[2025-05-31 07:38:15] [INFO ] Flatten gal took : 19 ms
[2025-05-31 07:38:15] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2529789907137895527.gal : 5 ms
[2025-05-31 07:38:15] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10590754280374909742.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2529789907137895527.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10590754280374909742.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.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
RANDOM walk for 40000 steps (1282 resets) in 321 ms. (124 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (273 resets) in 48 ms. (816 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (260 resets) in 69 ms. (571 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality10590754280374909742.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 3
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :3 after 18
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :18 after 33
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :33 after 63
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :63 after 106
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :106 after 142
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :142 after 261
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :261 after 3169
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :3169 after 8505
Interrupted probabilistic random walk after 485248 steps, run timeout after 3001 ms. (steps per millisecond=161 ) properties seen :0 out of 2
Probabilistic random walk after 485248 steps, saw 122097 distinct states, run finished after 3001 ms. (steps per millisecond=161 ) properties seen :0
[2025-05-31 07:38:18] [INFO ] Flow matrix only has 397 transitions (discarded 37 similar events)
[2025-05-31 07:38:18] [INFO ] Invariant cache hit.
[2025-05-31 07:38:18] [INFO ] State equation strengthened by 59 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) 47/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 138/186 variables, 48/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/186 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 187/373 variables, 16/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/373 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/373 variables, 21/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/373 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 1/374 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/374 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/374 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :8505 after 18168
At refinement iteration 12 (OVERLAPS) 159/533 variables, 79/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/533 variables, 2/170 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/533 variables, 38/208 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/533 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 18/551 variables, 10/218 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/551 variables, 2/220 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/551 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 2/553 variables, 2/222 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/553 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/553 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 553/553 variables, and 222 constraints, problems are : Problem set: 0 solved, 2 unsolved in 395 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 156/156 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
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) 47/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 138/186 variables, 48/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/186 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 187/373 variables, 16/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/373 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/373 variables, 21/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/373 variables, 2/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/373 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/374 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/374 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/374 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 159/533 variables, 79/170 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/533 variables, 2/172 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/533 variables, 38/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/533 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 18/551 variables, 10/220 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/551 variables, 2/222 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/551 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 2/553 variables, 2/224 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/553 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/553 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 553/553 variables, and 224 constraints, problems are : Problem set: 0 solved, 2 unsolved in 458 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 156/156 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 883ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 74 ms.
Support contains 1 out of 156 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 434/434 transitions.
Applied a total of 0 rules in 7 ms. Remains 156 /156 variables (removed 0) and now considering 434/434 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 156/156 places, 434/434 transitions.
RANDOM walk for 40000 steps (1320 resets) in 410 ms. (97 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (280 resets) in 35 ms. (1111 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (250 resets) in 102 ms. (388 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :18168 after 42550
Interrupted probabilistic random walk after 467526 steps, run timeout after 3001 ms. (steps per millisecond=155 ) properties seen :0 out of 2
Probabilistic random walk after 467526 steps, saw 118310 distinct states, run finished after 3001 ms. (steps per millisecond=155 ) properties seen :0
[2025-05-31 07:38:22] [INFO ] Flow matrix only has 397 transitions (discarded 37 similar events)
[2025-05-31 07:38:22] [INFO ] Invariant cache hit.
[2025-05-31 07:38:22] [INFO ] State equation strengthened by 59 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) 47/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 138/186 variables, 48/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/186 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 187/373 variables, 16/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/373 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/373 variables, 21/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/373 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 1/374 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/374 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/374 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 159/533 variables, 79/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/533 variables, 2/170 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/533 variables, 38/208 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/533 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 18/551 variables, 10/218 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/551 variables, 2/220 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/551 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 2/553 variables, 2/222 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/553 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/553 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 553/553 variables, and 222 constraints, problems are : Problem set: 0 solved, 2 unsolved in 422 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 156/156 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
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) 47/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 138/186 variables, 48/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/186 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 187/373 variables, 16/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/373 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/373 variables, 21/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/373 variables, 2/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/373 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/374 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/374 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/374 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 159/533 variables, 79/170 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/533 variables, 2/172 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/533 variables, 38/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/533 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 18/551 variables, 10/220 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/551 variables, 2/222 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/551 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 2/553 variables, 2/224 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/553 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/553 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 553/553 variables, and 224 constraints, problems are : Problem set: 0 solved, 2 unsolved in 441 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 156/156 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 886ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 71 ms.
Support contains 1 out of 156 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 434/434 transitions.
Applied a total of 0 rules in 6 ms. Remains 156 /156 variables (removed 0) and now considering 434/434 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 156/156 places, 434/434 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 434/434 transitions.
Applied a total of 0 rules in 9 ms. Remains 156 /156 variables (removed 0) and now considering 434/434 (removed 0) transitions.
[2025-05-31 07:38:23] [INFO ] Flow matrix only has 397 transitions (discarded 37 similar events)
[2025-05-31 07:38:23] [INFO ] Invariant cache hit.
[2025-05-31 07:38:24] [INFO ] Implicit Places using invariants in 293 ms returned []
[2025-05-31 07:38:24] [INFO ] Flow matrix only has 397 transitions (discarded 37 similar events)
[2025-05-31 07:38:24] [INFO ] Invariant cache hit.
[2025-05-31 07:38:24] [INFO ] State equation strengthened by 59 read => feed constraints.
[2025-05-31 07:38:24] [INFO ] Implicit Places using invariants and state equation in 714 ms returned []
Implicit Place search using SMT with State Equation took 1009 ms to find 0 implicit places.
[2025-05-31 07:38:24] [INFO ] Redundant transitions in 4 ms returned []
Running 428 sub problems to find dead transitions.
[2025-05-31 07:38:24] [INFO ] Flow matrix only has 397 transitions (discarded 37 similar events)
[2025-05-31 07:38:24] [INFO ] Invariant cache hit.
[2025-05-31 07:38:24] [INFO ] State equation strengthened by 59 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :42550 after 235331
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 428 unsolved
[2025-05-31 07:38:28] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 1 ms to minimize.
[2025-05-31 07:38:29] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 428 unsolved
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :235331 after 1.23461e+06
At refinement iteration 3 (OVERLAPS) 1/156 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 428 unsolved
[2025-05-31 07:38:35] [INFO ] Deduced a trap composed of 58 places in 150 ms of which 3 ms to minimize.
[2025-05-31 07:38:35] [INFO ] Deduced a trap composed of 23 places in 165 ms of which 3 ms to minimize.
[2025-05-31 07:38:35] [INFO ] Deduced a trap composed of 32 places in 45 ms of which 2 ms to minimize.
[2025-05-31 07:38:36] [INFO ] Deduced a trap composed of 17 places in 146 ms of which 3 ms to minimize.
[2025-05-31 07:38:38] [INFO ] Deduced a trap composed of 51 places in 170 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 428 unsolved
[2025-05-31 07:38:40] [INFO ] Deduced a trap composed of 28 places in 134 ms of which 2 ms to minimize.
[2025-05-31 07:38:40] [INFO ] Deduced a trap composed of 17 places in 155 ms of which 3 ms to minimize.
[2025-05-31 07:38:40] [INFO ] Deduced a trap composed of 17 places in 140 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 428 unsolved
[2025-05-31 07:38:43] [INFO ] Deduced a trap composed of 14 places in 112 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/156 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/156 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 8 (OVERLAPS) 397/553 variables, 156/174 constraints. Problems are: Problem set: 0 solved, 428 unsolved
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :1.23461e+06 after 6.96321e+06
At refinement iteration 9 (INCLUDED_ONLY) 0/553 variables, 59/233 constraints. Problems are: Problem set: 0 solved, 428 unsolved
[2025-05-31 07:38:53] [INFO ] Deduced a trap composed of 56 places in 143 ms of which 2 ms to minimize.
[2025-05-31 07:38:54] [INFO ] Deduced a trap composed of 40 places in 51 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 553/553 variables, and 235 constraints, problems are : Problem set: 0 solved, 428 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 156/156 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 428/428 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 428 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 11/17 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 3 (OVERLAPS) 1/156 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 6 (OVERLAPS) 397/553 variables, 156/176 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/553 variables, 59/235 constraints. Problems are: Problem set: 0 solved, 428 unsolved
Detected timeout of ITS tools.
[2025-05-31 07:39:05] [INFO ] Flatten gal took : 17 ms
[2025-05-31 07:39:05] [INFO ] Applying decomposition
[2025-05-31 07:39:05] [INFO ] Flatten gal took : 16 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph14566111343554009937.txt' '-o' '/tmp/graph14566111343554009937.bin' '-w' '/tmp/graph14566111343554009937.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14566111343554009937.bin' '-l' '-1' '-v' '-w' '/tmp/graph14566111343554009937.weights' '-q' '0' '-e' '0.001'
[2025-05-31 07:39:05] [INFO ] Decomposing Gal with order
[2025-05-31 07:39:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 07:39:05] [INFO ] Removed a total of 664 redundant transitions.
[2025-05-31 07:39:05] [INFO ] Flatten gal took : 62 ms
[2025-05-31 07:39:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 117 labels/synchronizations in 26 ms.
[2025-05-31 07:39:05] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17806947470326246113.gal : 10 ms
[2025-05-31 07:39:05] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8345751594386825834.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17806947470326246113.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8345751594386825834.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality8345751594386825834.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 27
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :27 after 27
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :27 after 27
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :27 after 27
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :27 after 483
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :483 after 722
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :722 after 3372
At refinement iteration 8 (INCLUDED_ONLY) 0/553 variables, 428/663 constraints. Problems are: Problem set: 0 solved, 428 unsolved
[2025-05-31 07:39:08] [INFO ] Deduced a trap composed of 31 places in 46 ms of which 1 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :3372 after 1.68958e+06
At refinement iteration 9 (INCLUDED_ONLY) 0/553 variables, 1/664 constraints. Problems are: Problem set: 0 solved, 428 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 553/553 variables, and 664 constraints, problems are : Problem set: 0 solved, 428 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 156/156 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 428/428 constraints, Known Traps: 14/14 constraints]
After SMT, in 60561ms problems are : Problem set: 0 solved, 428 unsolved
Search for dead transitions found 0 dead transitions in 60567ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61598 ms. Remains : 156/156 places, 434/434 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 141 edges and 156 vertex of which 29 / 156 are part of one of the 4 SCC in 0 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 123 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 144 transitions.
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 0 with 2 rules applied. Total rules applied 3 place count 130 transition count 289
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 12 place count 130 transition count 280
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 0 with 2 rules applied. Total rules applied 14 place count 129 transition count 279
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 129 transition count 278
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 0 with 2 rules applied. Total rules applied 17 place count 128 transition count 277
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 18 place count 127 transition count 234
Iterating global reduction 0 with 1 rules applied. Total rules applied 19 place count 127 transition count 234
Free-agglomeration rule applied 9 times with reduction of 6 identical transitions.
Iterating global reduction 0 with 9 rules applied. Total rules applied 28 place count 127 transition count 219
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 40 place count 118 transition count 216
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 46 place count 118 transition count 216
Applied a total of 46 rules in 37 ms. Remains 118 /156 variables (removed 38) and now considering 216/434 (removed 218) transitions.
Running SMT prover for 2 properties.
[2025-05-31 07:39:25] [INFO ] Flow matrix only has 214 transitions (discarded 2 similar events)
// Phase 1: matrix 214 rows 118 cols
[2025-05-31 07:39:25] [INFO ] Computed 7 invariants in 2 ms
[2025-05-31 07:39:25] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2025-05-31 07:39:25] [INFO ] After 97ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2025-05-31 07:39:25] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 1 ms to minimize.
TRAPS : Iteration 1
[2025-05-31 07:39:25] [INFO ] After 191ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:2
[2025-05-31 07:39:25] [INFO ] After 285ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2025-05-31 07:39:25] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2025-05-31 07:39:25] [INFO ] After 97ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2025-05-31 07:39:25] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 2 ms to minimize.
[2025-05-31 07:39:25] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 5 ms to minimize.
[2025-05-31 07:39:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 126 ms
TRAPS : Iteration 1
[2025-05-31 07:39:25] [INFO ] After 273ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2025-05-31 07:39:26] [INFO ] After 356ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2025-05-31 07:39:26] [INFO ] Flatten gal took : 7 ms
[2025-05-31 07:39:26] [INFO ] Flatten gal took : 8 ms
[2025-05-31 07:39:26] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6793750059037615804.gal : 2 ms
[2025-05-31 07:39:26] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10216113022161175876.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6793750059037615804.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10216113022161175876.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.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality10216113022161175876.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 10
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :10 after 25
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :25 after 42
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :42 after 144
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :144 after 237
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :237 after 350
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :350 after 1757
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1757 after 9842
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :9842 after 91076
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :91076 after 654684
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :654684 after 4.64e+06
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,3.24021e+07,1.71197,36696,2,3104,17,100228,8,0,687,128380,0
Total reachable state count : 32402118

Verifying 2 reachability properties.
Reachability property MAX0 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX0,60219,1.71337,36696,2,671,17,100228,8,0,689,128380,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,60219,1.71409,36696,2,671,17,100228,8,0,689,128380,0
ITS tools runner thread asked to quit. Dying gracefully.
Over-approximation ignoring read arcs solved 0 properties in 2441 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Ending property specific reduction for FireWire-PT-13-UpperBounds-09 in 139540 ms.
[2025-05-31 07:39:27] [INFO ] Flatten gal took : 14 ms
[2025-05-31 07:39:27] [INFO ] Applying decomposition
[2025-05-31 07:39:27] [INFO ] Flatten gal took : 15 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph10647382616504238965.txt' '-o' '/tmp/graph10647382616504238965.bin' '-w' '/tmp/graph10647382616504238965.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10647382616504238965.bin' '-l' '-1' '-v' '-w' '/tmp/graph10647382616504238965.weights' '-q' '0' '-e' '0.001'
[2025-05-31 07:39:27] [INFO ] Decomposing Gal with order
[2025-05-31 07:39:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 07:39:28] [INFO ] Removed a total of 741 redundant transitions.
[2025-05-31 07:39:28] [INFO ] Flatten gal took : 48 ms
[2025-05-31 07:39:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 130 labels/synchronizations in 7 ms.
[2025-05-31 07:39:28] [INFO ] Time to serialize gal into /tmp/UpperBounds1285404026308563734.gal : 5 ms
[2025-05-31 07:39:28] [INFO ] Time to serialize properties into /tmp/UpperBounds13539880535528961795.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds1285404026308563734.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds13539880535528961795.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...284
Loading property file /tmp/UpperBounds13539880535528961795.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,2.94878e+08,92.7141,1301868,6734,409,1.41362e+06,26520,742,8.40879e+06,133,236106,0
Total reachable state count : 294878174

Verifying 3 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property FireWire-PT-13-UpperBounds-00 :0 <= i0.u48.p162 <= 1
FORMULA FireWire-PT-13-UpperBounds-00 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
FireWire-PT-13-UpperBounds-00,0,94.0998,1301868,1,0,1.41362e+06,26520,968,8.40879e+06,158,236106,3270
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property FireWire-PT-13-UpperBounds-08 :0 <= i0.u47.p161 <= 1
FORMULA FireWire-PT-13-UpperBounds-08 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
FireWire-PT-13-UpperBounds-08,0,94.1237,1301868,1,0,1.41362e+06,26520,1004,8.40879e+06,163,236106,3576
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property FireWire-PT-13-UpperBounds-09 :0 <= i0.u45.p156 <= 1
FORMULA FireWire-PT-13-UpperBounds-09 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
FireWire-PT-13-UpperBounds-09,0,94.1267,1301868,1,0,1.41362e+06,26520,1039,8.40879e+06,163,236106,3825
Total runtime 862560 ms.

BK_STOP 1748677262515

--------------------
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
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ 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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FireWire-PT-13"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2024"
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-5832"
echo " Executing tool gold2024"
echo " Input is FireWire-PT-13, 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 r097-smll-174860111800043"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FireWire-PT-13.tgz
mv FireWire-PT-13 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 '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;