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.r111-smll-174867015800010.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 FunctionPointer-PT-b008, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r111-smll-174867015800010
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 892K
-rw-r--r-- 1 mcc users 6.2K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 171K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 88K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K 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 5 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 391K 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 FunctionPointer-PT-b008-UpperBounds-00
FORMULA_NAME FunctionPointer-PT-b008-UpperBounds-01
FORMULA_NAME FunctionPointer-PT-b008-UpperBounds-02
FORMULA_NAME FunctionPointer-PT-b008-UpperBounds-03
FORMULA_NAME FunctionPointer-PT-b008-UpperBounds-04
FORMULA_NAME FunctionPointer-PT-b008-UpperBounds-05
FORMULA_NAME FunctionPointer-PT-b008-UpperBounds-06
FORMULA_NAME FunctionPointer-PT-b008-UpperBounds-07
FORMULA_NAME FunctionPointer-PT-b008-UpperBounds-08
FORMULA_NAME FunctionPointer-PT-b008-UpperBounds-09
FORMULA_NAME FunctionPointer-PT-b008-UpperBounds-10
FORMULA_NAME FunctionPointer-PT-b008-UpperBounds-11
FORMULA_NAME FunctionPointer-PT-b008-UpperBounds-12
FORMULA_NAME FunctionPointer-PT-b008-UpperBounds-13
FORMULA_NAME FunctionPointer-PT-b008-UpperBounds-14
FORMULA_NAME FunctionPointer-PT-b008-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748762463282

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-b008
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-06-01 07:21:05] [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-06-01 07:21:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 07:21:06] [INFO ] Load time of PNML (sax parser for PT used): 531 ms
[2025-06-01 07:21:06] [INFO ] Transformed 306 places.
[2025-06-01 07:21:06] [INFO ] Transformed 840 transitions.
[2025-06-01 07:21:06] [INFO ] Parsed PT model containing 306 places and 840 transitions and 3392 arcs in 814 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 36 ms.
Reduction of identical properties reduced properties to check from 16 to 15
Deduced a syphon composed of 84 places in 23 ms
Reduce places removed 84 places and 192 transitions.
FORMULA FunctionPointer-PT-b008-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b008-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b008-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b008-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2025-06-01 07:21:06] [INFO ] Flow matrix only has 414 transitions (discarded 234 similar events)
// Phase 1: matrix 414 rows 222 cols
[2025-06-01 07:21:06] [INFO ] Computed 4 invariants in 26 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, 8, +inf, +inf, +inf, 8, 8, +inf, +inf, +inf]
RANDOM walk for 10000 steps (14 resets) in 91 ms. (108 steps per ms)
FORMULA FunctionPointer-PT-b008-UpperBounds-11 8 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FunctionPointer-PT-b008-UpperBounds-05 8 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 90009 steps (22 resets) in 196 ms. (456 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 9, 4, 9, 9, 4, 9, 7, 2] Max Struct:[+inf, +inf, +inf, +inf, +inf, 8, +inf, +inf, +inf]
[2025-06-01 07:21:07] [INFO ] Flow matrix only has 414 transitions (discarded 234 similar events)
[2025-06-01 07:21:07] [INFO ] Invariant cache hit.
[2025-06-01 07:21:07] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2025-06-01 07:21:07] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned sat
[2025-06-01 07:21:07] [INFO ] [Real]Absence check using state equation in 267 ms returned sat
[2025-06-01 07:21:07] [INFO ] State equation strengthened by 65 read => feed constraints.
[2025-06-01 07:21:07] [INFO ] [Real]Added 65 Read/Feed constraints in 29 ms returned sat
[2025-06-01 07:21:08] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 07:21:08] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-01 07:21:08] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 07:21:08] [INFO ] [Nat]Absence check using state equation in 207 ms returned sat
[2025-06-01 07:21:08] [INFO ] [Nat]Added 65 Read/Feed constraints in 33 ms returned sat
[2025-06-01 07:21:08] [INFO ] Deduced a trap composed of 26 places in 318 ms of which 46 ms to minimize.
[2025-06-01 07:21:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 393 ms
[2025-06-01 07:21:08] [INFO ] Computed and/alt/rep : 57/91/57 causal constraints (skipped 355 transitions) in 115 ms.
[2025-06-01 07:21:08] [INFO ] Added : 2 causal constraints over 1 iterations in 232 ms. Result :sat
Minimization took 165 ms.
[2025-06-01 07:21:09] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2025-06-01 07:21:09] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 07:21:09] [INFO ] [Real]Absence check using state equation in 206 ms returned sat
[2025-06-01 07:21:09] [INFO ] [Real]Added 65 Read/Feed constraints in 19 ms returned sat
[2025-06-01 07:21:09] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 07:21:09] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2025-06-01 07:21:09] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-01 07:21:09] [INFO ] [Nat]Absence check using state equation in 199 ms returned sat
[2025-06-01 07:21:09] [INFO ] [Nat]Added 65 Read/Feed constraints in 23 ms returned sat
[2025-06-01 07:21:10] [INFO ] Deduced a trap composed of 28 places in 320 ms of which 4 ms to minimize.
[2025-06-01 07:21:10] [INFO ] Deduced a trap composed of 55 places in 269 ms of which 4 ms to minimize.
[2025-06-01 07:21:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 686 ms
[2025-06-01 07:21:10] [INFO ] Computed and/alt/rep : 57/91/57 causal constraints (skipped 355 transitions) in 113 ms.
[2025-06-01 07:21:10] [INFO ] Added : 2 causal constraints over 1 iterations in 220 ms. Result :sat
Minimization took 175 ms.
[2025-06-01 07:21:11] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2025-06-01 07:21:11] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 07:21:11] [INFO ] [Real]Absence check using state equation in 213 ms returned sat
[2025-06-01 07:21:11] [INFO ] [Real]Added 65 Read/Feed constraints in 27 ms returned sat
[2025-06-01 07:21:11] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 07:21:11] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2025-06-01 07:21:11] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 07:21:11] [INFO ] [Nat]Absence check using state equation in 209 ms returned sat
[2025-06-01 07:21:11] [INFO ] [Nat]Added 65 Read/Feed constraints in 31 ms returned sat
[2025-06-01 07:21:11] [INFO ] Computed and/alt/rep : 57/91/57 causal constraints (skipped 355 transitions) in 72 ms.
[2025-06-01 07:21:11] [INFO ] Added : 2 causal constraints over 1 iterations in 169 ms. Result :sat
Minimization took 166 ms.
[2025-06-01 07:21:12] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2025-06-01 07:21:12] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned sat
[2025-06-01 07:21:12] [INFO ] [Real]Absence check using state equation in 223 ms returned sat
[2025-06-01 07:21:12] [INFO ] [Real]Added 65 Read/Feed constraints in 30 ms returned sat
[2025-06-01 07:21:12] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 07:21:12] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2025-06-01 07:21:12] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned sat
[2025-06-01 07:21:12] [INFO ] [Nat]Absence check using state equation in 224 ms returned sat
[2025-06-01 07:21:12] [INFO ] [Nat]Added 65 Read/Feed constraints in 32 ms returned sat
[2025-06-01 07:21:13] [INFO ] Deduced a trap composed of 35 places in 340 ms of which 4 ms to minimize.
[2025-06-01 07:21:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 396 ms
[2025-06-01 07:21:13] [INFO ] Computed and/alt/rep : 57/91/57 causal constraints (skipped 355 transitions) in 69 ms.
[2025-06-01 07:21:13] [INFO ] Added : 2 causal constraints over 1 iterations in 172 ms. Result :sat
Minimization took 170 ms.
[2025-06-01 07:21:13] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2025-06-01 07:21:13] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 6 ms returned sat
[2025-06-01 07:21:13] [INFO ] [Real]Absence check using state equation in 202 ms returned sat
[2025-06-01 07:21:13] [INFO ] [Real]Added 65 Read/Feed constraints in 20 ms returned sat
[2025-06-01 07:21:13] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 07:21:13] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-01 07:21:13] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 07:21:14] [INFO ] [Nat]Absence check using state equation in 183 ms returned sat
[2025-06-01 07:21:14] [INFO ] [Nat]Added 65 Read/Feed constraints in 23 ms returned sat
[2025-06-01 07:21:14] [INFO ] Deduced a trap composed of 29 places in 256 ms of which 4 ms to minimize.
[2025-06-01 07:21:14] [INFO ] Deduced a trap composed of 34 places in 185 ms of which 3 ms to minimize.
[2025-06-01 07:21:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 502 ms
[2025-06-01 07:21:14] [INFO ] Computed and/alt/rep : 57/91/57 causal constraints (skipped 355 transitions) in 41 ms.
[2025-06-01 07:21:14] [INFO ] Added : 2 causal constraints over 1 iterations in 120 ms. Result :sat
Minimization took 161 ms.
[2025-06-01 07:21:15] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2025-06-01 07:21:15] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 07:21:15] [INFO ] [Real]Absence check using state equation in 200 ms returned sat
[2025-06-01 07:21:15] [INFO ] [Real]Added 65 Read/Feed constraints in 19 ms returned sat
[2025-06-01 07:21:15] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 07:21:15] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2025-06-01 07:21:15] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 07:21:15] [INFO ] [Nat]Absence check using state equation in 183 ms returned sat
[2025-06-01 07:21:15] [INFO ] [Nat]Added 65 Read/Feed constraints in 24 ms returned sat
[2025-06-01 07:21:15] [INFO ] Computed and/alt/rep : 57/91/57 causal constraints (skipped 355 transitions) in 51 ms.
[2025-06-01 07:21:15] [INFO ] Added : 2 causal constraints over 1 iterations in 131 ms. Result :sat
Minimization took 174 ms.
[2025-06-01 07:21:16] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 07:21:16] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 07:21:16] [INFO ] [Real]Absence check using state equation in 190 ms returned sat
[2025-06-01 07:21:16] [INFO ] [Real]Added 65 Read/Feed constraints in 37 ms returned sat
[2025-06-01 07:21:16] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 07:21:16] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2025-06-01 07:21:16] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned sat
[2025-06-01 07:21:16] [INFO ] [Nat]Absence check using state equation in 196 ms returned sat
[2025-06-01 07:21:16] [INFO ] [Nat]Added 65 Read/Feed constraints in 28 ms returned sat
[2025-06-01 07:21:17] [INFO ] Deduced a trap composed of 51 places in 347 ms of which 6 ms to minimize.
[2025-06-01 07:21:17] [INFO ] Deduced a trap composed of 29 places in 304 ms of which 4 ms to minimize.
[2025-06-01 07:21:17] [INFO ] Deduced a trap composed of 30 places in 302 ms of which 5 ms to minimize.
[2025-06-01 07:21:17] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1084 ms
[2025-06-01 07:21:17] [INFO ] Computed and/alt/rep : 57/91/57 causal constraints (skipped 355 transitions) in 64 ms.
[2025-06-01 07:21:17] [INFO ] Added : 2 causal constraints over 1 iterations in 163 ms. Result :sat
Minimization took 191 ms.
[2025-06-01 07:21:18] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2025-06-01 07:21:18] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 07:21:18] [INFO ] [Real]Absence check using state equation in 196 ms returned sat
[2025-06-01 07:21:18] [INFO ] [Real]Added 65 Read/Feed constraints in 19 ms returned sat
[2025-06-01 07:21:18] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 07:21:18] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2025-06-01 07:21:18] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 07:21:18] [INFO ] [Nat]Absence check using state equation in 186 ms returned sat
[2025-06-01 07:21:18] [INFO ] [Nat]Added 65 Read/Feed constraints in 17 ms returned sat
[2025-06-01 07:21:18] [INFO ] Computed and/alt/rep : 57/91/57 causal constraints (skipped 355 transitions) in 49 ms.
[2025-06-01 07:21:18] [INFO ] Added : 1 causal constraints over 1 iterations in 126 ms. Result :sat
Minimization took 164 ms.
[2025-06-01 07:21:19] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2025-06-01 07:21:19] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 6 ms returned sat
[2025-06-01 07:21:19] [INFO ] [Real]Absence check using state equation in 184 ms returned sat
[2025-06-01 07:21:19] [INFO ] [Real]Added 65 Read/Feed constraints in 23 ms returned sat
[2025-06-01 07:21:19] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 07:21:19] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2025-06-01 07:21:19] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 07:21:19] [INFO ] [Nat]Absence check using state equation in 201 ms returned sat
[2025-06-01 07:21:19] [INFO ] [Nat]Added 65 Read/Feed constraints in 23 ms returned sat
[2025-06-01 07:21:20] [INFO ] Deduced a trap composed of 26 places in 266 ms of which 4 ms to minimize.
[2025-06-01 07:21:20] [INFO ] Deduced a trap composed of 21 places in 286 ms of which 4 ms to minimize.
[2025-06-01 07:21:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 617 ms
[2025-06-01 07:21:20] [INFO ] Computed and/alt/rep : 57/91/57 causal constraints (skipped 355 transitions) in 57 ms.
[2025-06-01 07:21:20] [INFO ] Added : 1 causal constraints over 1 iterations in 145 ms. Result :sat
Minimization took 184 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 9, 4, 9, 9, 4, 9, 7, 2] Max Struct:[+inf, +inf, +inf, +inf, +inf, 8, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 9, 4, 9, 9, 4, 9, 7, 2] Max Struct:[+inf, +inf, +inf, +inf, +inf, 8, +inf, +inf, +inf]
Support contains 9 out of 222 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 222/222 places, 648/648 transitions.
Graph (complete) has 932 edges and 222 vertex of which 197 are kept as prefixes of interest. Removing 25 places using SCC suffix rule.6 ms
Discarding 25 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 0 with 32 rules applied. Total rules applied 33 place count 197 transition count 616
Discarding 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 61 place count 169 transition count 454
Iterating global reduction 1 with 28 rules applied. Total rules applied 89 place count 169 transition count 454
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 117 place count 169 transition count 426
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 133 place count 153 transition count 394
Iterating global reduction 2 with 16 rules applied. Total rules applied 149 place count 153 transition count 394
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 153 place count 153 transition count 390
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 160 place count 146 transition count 376
Iterating global reduction 3 with 7 rules applied. Total rules applied 167 place count 146 transition count 376
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 173 place count 140 transition count 352
Iterating global reduction 3 with 6 rules applied. Total rules applied 179 place count 140 transition count 352
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 184 place count 135 transition count 342
Iterating global reduction 3 with 5 rules applied. Total rules applied 189 place count 135 transition count 342
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 194 place count 130 transition count 322
Iterating global reduction 3 with 5 rules applied. Total rules applied 199 place count 130 transition count 322
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 203 place count 126 transition count 306
Iterating global reduction 3 with 4 rules applied. Total rules applied 207 place count 126 transition count 306
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 211 place count 122 transition count 298
Iterating global reduction 3 with 4 rules applied. Total rules applied 215 place count 122 transition count 298
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 219 place count 118 transition count 290
Iterating global reduction 3 with 4 rules applied. Total rules applied 223 place count 118 transition count 290
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 227 place count 114 transition count 282
Iterating global reduction 3 with 4 rules applied. Total rules applied 231 place count 114 transition count 282
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 235 place count 110 transition count 274
Iterating global reduction 3 with 4 rules applied. Total rules applied 239 place count 110 transition count 274
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 242 place count 107 transition count 268
Iterating global reduction 3 with 3 rules applied. Total rules applied 245 place count 107 transition count 268
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 3 with 8 rules applied. Total rules applied 253 place count 107 transition count 260
Applied a total of 253 rules in 237 ms. Remains 107 /222 variables (removed 115) and now considering 260/648 (removed 388) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 255 ms. Remains : 107/222 places, 260/648 transitions.
[2025-06-01 07:21:21] [INFO ] Flow matrix only has 172 transitions (discarded 88 similar events)
Found an invariant !
This invariant on transitions {25=1, 35=1, 83=1, 97=1, 119=1, 156=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {31=1, 79=1, 115=1, 157=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 9) seen :[2, 2, 4, 4, 0, 2, 0, 3, 3]
Current structural bounds on expressions (after cover walk) : Max Seen:[2, 9, 4, 9, 9, 4, 9, 7, 3] Max Struct:[+inf, +inf, +inf, +inf, +inf, 8, +inf, +inf, +inf]
[2025-06-01 07:21:21] [INFO ] Flow matrix only has 172 transitions (discarded 88 similar events)
// Phase 1: matrix 172 rows 107 cols
[2025-06-01 07:21:21] [INFO ] Computed 2 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[2, 9, 4, 9, 9, 4, 9, 7, 3] Max Struct:[+inf, +inf, +inf, +inf, +inf, 8, +inf, +inf, +inf]
RANDOM walk for 1000001 steps (2 resets) in 1619 ms. (617 steps per ms)
FORMULA FunctionPointer-PT-b008-UpperBounds-10 8 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 8000008 steps (17 resets) in 6787 ms. (1178 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[225, 9, 445, 9, 9, 9, 582, 485] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2025-06-01 07:21:30] [INFO ] Flow matrix only has 172 transitions (discarded 88 similar events)
[2025-06-01 07:21:30] [INFO ] Invariant cache hit.
[2025-06-01 07:21:30] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2025-06-01 07:21:30] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 07:21:30] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2025-06-01 07:21:30] [INFO ] State equation strengthened by 35 read => feed constraints.
[2025-06-01 07:21:30] [INFO ] [Real]Added 35 Read/Feed constraints in 15 ms returned sat
[2025-06-01 07:21:30] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 07:21:30] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2025-06-01 07:21:30] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 07:21:30] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2025-06-01 07:21:30] [INFO ] [Nat]Added 35 Read/Feed constraints in 8 ms returned sat
[2025-06-01 07:21:30] [INFO ] Computed and/alt/rep : 38/99/35 causal constraints (skipped 135 transitions) in 15 ms.
[2025-06-01 07:21:30] [INFO ] Added : 14 causal constraints over 4 iterations in 113 ms. Result :sat
Minimization took 61 ms.
[2025-06-01 07:21:30] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2025-06-01 07:21:30] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2025-06-01 07:21:30] [INFO ] [Real]Absence check using state equation in 101 ms returned sat
[2025-06-01 07:21:30] [INFO ] [Real]Added 35 Read/Feed constraints in 16 ms returned sat
[2025-06-01 07:21:30] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 07:21:30] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2025-06-01 07:21:30] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 07:21:30] [INFO ] [Nat]Absence check using state equation in 85 ms returned sat
[2025-06-01 07:21:30] [INFO ] [Nat]Added 35 Read/Feed constraints in 10 ms returned sat
[2025-06-01 07:21:30] [INFO ] Computed and/alt/rep : 38/99/35 causal constraints (skipped 135 transitions) in 49 ms.
[2025-06-01 07:21:30] [INFO ] Added : 2 causal constraints over 1 iterations in 82 ms. Result :sat
Minimization took 36 ms.
[2025-06-01 07:21:31] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2025-06-01 07:21:31] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 9 ms returned sat
[2025-06-01 07:21:31] [INFO ] [Real]Absence check using state equation in 87 ms returned sat
[2025-06-01 07:21:31] [INFO ] [Real]Added 35 Read/Feed constraints in 11 ms returned sat
[2025-06-01 07:21:31] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 07:21:31] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2025-06-01 07:21:31] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 07:21:31] [INFO ] [Nat]Absence check using state equation in 77 ms returned sat
[2025-06-01 07:21:31] [INFO ] [Nat]Added 35 Read/Feed constraints in 9 ms returned sat
[2025-06-01 07:21:31] [INFO ] Computed and/alt/rep : 38/99/35 causal constraints (skipped 135 transitions) in 17 ms.
[2025-06-01 07:21:31] [INFO ] Added : 12 causal constraints over 5 iterations in 117 ms. Result :sat
Minimization took 63 ms.
[2025-06-01 07:21:31] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2025-06-01 07:21:31] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 07:21:31] [INFO ] [Real]Absence check using state equation in 82 ms returned sat
[2025-06-01 07:21:31] [INFO ] [Real]Added 35 Read/Feed constraints in 10 ms returned sat
[2025-06-01 07:21:31] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 07:21:31] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2025-06-01 07:21:31] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2025-06-01 07:21:31] [INFO ] [Nat]Absence check using state equation in 83 ms returned sat
[2025-06-01 07:21:31] [INFO ] [Nat]Added 35 Read/Feed constraints in 13 ms returned sat
[2025-06-01 07:21:31] [INFO ] Computed and/alt/rep : 38/99/35 causal constraints (skipped 135 transitions) in 24 ms.
[2025-06-01 07:21:31] [INFO ] Added : 2 causal constraints over 1 iterations in 67 ms. Result :sat
Minimization took 59 ms.
[2025-06-01 07:21:32] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2025-06-01 07:21:32] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 07:21:32] [INFO ] [Real]Absence check using state equation in 92 ms returned sat
[2025-06-01 07:21:32] [INFO ] [Real]Added 35 Read/Feed constraints in 11 ms returned sat
[2025-06-01 07:21:32] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 07:21:32] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2025-06-01 07:21:32] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 07:21:32] [INFO ] [Nat]Absence check using state equation in 87 ms returned sat
[2025-06-01 07:21:32] [INFO ] [Nat]Added 35 Read/Feed constraints in 12 ms returned sat
[2025-06-01 07:21:32] [INFO ] Computed and/alt/rep : 38/99/35 causal constraints (skipped 135 transitions) in 16 ms.
[2025-06-01 07:21:32] [INFO ] Added : 2 causal constraints over 1 iterations in 53 ms. Result :sat
Minimization took 61 ms.
[2025-06-01 07:21:32] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2025-06-01 07:21:32] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 07:21:32] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2025-06-01 07:21:32] [INFO ] [Real]Added 35 Read/Feed constraints in 8 ms returned sat
[2025-06-01 07:21:32] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 07:21:32] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2025-06-01 07:21:32] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 07:21:32] [INFO ] [Nat]Absence check using state equation in 64 ms returned sat
[2025-06-01 07:21:32] [INFO ] [Nat]Added 35 Read/Feed constraints in 10 ms returned sat
[2025-06-01 07:21:32] [INFO ] Computed and/alt/rep : 38/99/35 causal constraints (skipped 135 transitions) in 20 ms.
[2025-06-01 07:21:32] [INFO ] Added : 2 causal constraints over 1 iterations in 55 ms. Result :sat
Minimization took 52 ms.
[2025-06-01 07:21:32] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2025-06-01 07:21:32] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2025-06-01 07:21:32] [INFO ] [Real]Absence check using state equation in 92 ms returned sat
[2025-06-01 07:21:32] [INFO ] [Real]Added 35 Read/Feed constraints in 10 ms returned sat
[2025-06-01 07:21:33] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 07:21:33] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2025-06-01 07:21:33] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 07:21:33] [INFO ] [Nat]Absence check using state equation in 98 ms returned sat
[2025-06-01 07:21:33] [INFO ] [Nat]Added 35 Read/Feed constraints in 10 ms returned sat
[2025-06-01 07:21:33] [INFO ] Computed and/alt/rep : 38/99/35 causal constraints (skipped 135 transitions) in 25 ms.
[2025-06-01 07:21:33] [INFO ] Added : 1 causal constraints over 1 iterations in 68 ms. Result :sat
Minimization took 54 ms.
[2025-06-01 07:21:33] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2025-06-01 07:21:33] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 07:21:33] [INFO ] [Real]Absence check using state equation in 95 ms returned sat
[2025-06-01 07:21:33] [INFO ] [Real]Added 35 Read/Feed constraints in 12 ms returned sat
[2025-06-01 07:21:33] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 07:21:33] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2025-06-01 07:21:33] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 07:21:33] [INFO ] [Nat]Absence check using state equation in 90 ms returned sat
[2025-06-01 07:21:33] [INFO ] [Nat]Added 35 Read/Feed constraints in 11 ms returned sat
[2025-06-01 07:21:33] [INFO ] Computed and/alt/rep : 38/99/35 causal constraints (skipped 135 transitions) in 23 ms.
[2025-06-01 07:21:33] [INFO ] Added : 9 causal constraints over 3 iterations in 100 ms. Result :sat
Minimization took 57 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[225, 9, 445, 9, 9, 9, 582, 485] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[225, 9, 445, 9, 9, 9, 582, 485] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Support contains 8 out of 107 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 107/107 places, 260/260 transitions.
Applied a total of 0 rules in 23 ms. Remains 107 /107 variables (removed 0) and now considering 260/260 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 107/107 places, 260/260 transitions.
[2025-06-01 07:21:33] [INFO ] Flow matrix only has 172 transitions (discarded 88 similar events)
Found an invariant !
This invariant on transitions {25=1, 35=1, 83=1, 97=1, 119=1, 156=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {31=1, 79=1, 115=1, 157=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 151 ms. (steps per millisecond=66 ) properties (out of 8) seen :[2, 1, 7, 0, 3, 2, 4, 2]
Current structural bounds on expressions (after cover walk) : Max Seen:[225, 9, 445, 9, 9, 9, 582, 485] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2025-06-01 07:21:34] [INFO ] Flow matrix only has 172 transitions (discarded 88 similar events)
[2025-06-01 07:21:34] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[225, 9, 445, 9, 9, 9, 582, 485] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000002 steps (2 resets) in 1702 ms. (587 steps per ms)
BEST_FIRST walk for 8000008 steps (20 resets) in 6134 ms. (1303 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[227, 11, 678, 9, 9, 9, 909, 1031] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2025-06-01 07:21:42] [INFO ] Flow matrix only has 172 transitions (discarded 88 similar events)
[2025-06-01 07:21:42] [INFO ] Invariant cache hit.
[2025-06-01 07:21:42] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2025-06-01 07:21:42] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 07:21:42] [INFO ] [Real]Absence check using state equation in 79 ms returned sat
[2025-06-01 07:21:42] [INFO ] State equation strengthened by 35 read => feed constraints.
[2025-06-01 07:21:42] [INFO ] [Real]Added 35 Read/Feed constraints in 12 ms returned sat
[2025-06-01 07:21:42] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 07:21:42] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-01 07:21:42] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 07:21:42] [INFO ] [Nat]Absence check using state equation in 64 ms returned sat
[2025-06-01 07:21:42] [INFO ] [Nat]Added 35 Read/Feed constraints in 10 ms returned sat
[2025-06-01 07:21:42] [INFO ] Computed and/alt/rep : 38/99/35 causal constraints (skipped 135 transitions) in 20 ms.
[2025-06-01 07:21:42] [INFO ] Added : 14 causal constraints over 4 iterations in 99 ms. Result :sat
Minimization took 38 ms.
[2025-06-01 07:21:42] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2025-06-01 07:21:42] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-01 07:21:42] [INFO ] [Real]Absence check using state equation in 78 ms returned sat
[2025-06-01 07:21:42] [INFO ] [Real]Added 35 Read/Feed constraints in 9 ms returned sat
[2025-06-01 07:21:42] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 07:21:42] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2025-06-01 07:21:42] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 07:21:42] [INFO ] [Nat]Absence check using state equation in 73 ms returned sat
[2025-06-01 07:21:42] [INFO ] [Nat]Added 35 Read/Feed constraints in 9 ms returned sat
[2025-06-01 07:21:42] [INFO ] Computed and/alt/rep : 38/99/35 causal constraints (skipped 135 transitions) in 22 ms.
[2025-06-01 07:21:42] [INFO ] Added : 2 causal constraints over 1 iterations in 56 ms. Result :sat
Minimization took 37 ms.
[2025-06-01 07:21:42] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2025-06-01 07:21:42] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2025-06-01 07:21:43] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2025-06-01 07:21:43] [INFO ] [Real]Added 35 Read/Feed constraints in 8 ms returned sat
[2025-06-01 07:21:43] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 07:21:43] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2025-06-01 07:21:43] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 3 ms returned sat
[2025-06-01 07:21:43] [INFO ] [Nat]Absence check using state equation in 79 ms returned sat
[2025-06-01 07:21:43] [INFO ] [Nat]Added 35 Read/Feed constraints in 10 ms returned sat
[2025-06-01 07:21:43] [INFO ] Computed and/alt/rep : 38/99/35 causal constraints (skipped 135 transitions) in 16 ms.
[2025-06-01 07:21:43] [INFO ] Added : 12 causal constraints over 5 iterations in 111 ms. Result :sat
Minimization took 58 ms.
[2025-06-01 07:21:43] [INFO ] [Real]Absence check using 1 positive place invariants in 6 ms returned sat
[2025-06-01 07:21:43] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-01 07:21:43] [INFO ] [Real]Absence check using state equation in 77 ms returned sat
[2025-06-01 07:21:43] [INFO ] [Real]Added 35 Read/Feed constraints in 10 ms returned sat
[2025-06-01 07:21:43] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 07:21:43] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2025-06-01 07:21:43] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 07:21:43] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2025-06-01 07:21:43] [INFO ] [Nat]Added 35 Read/Feed constraints in 7 ms returned sat
[2025-06-01 07:21:43] [INFO ] Computed and/alt/rep : 38/99/35 causal constraints (skipped 135 transitions) in 24 ms.
[2025-06-01 07:21:43] [INFO ] Added : 2 causal constraints over 1 iterations in 59 ms. Result :sat
Minimization took 35 ms.
[2025-06-01 07:21:43] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2025-06-01 07:21:43] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 07:21:43] [INFO ] [Real]Absence check using state equation in 75 ms returned sat
[2025-06-01 07:21:43] [INFO ] [Real]Added 35 Read/Feed constraints in 8 ms returned sat
[2025-06-01 07:21:43] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 07:21:43] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2025-06-01 07:21:43] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 07:21:44] [INFO ] [Nat]Absence check using state equation in 84 ms returned sat
[2025-06-01 07:21:44] [INFO ] [Nat]Added 35 Read/Feed constraints in 12 ms returned sat
[2025-06-01 07:21:44] [INFO ] Computed and/alt/rep : 38/99/35 causal constraints (skipped 135 transitions) in 22 ms.
[2025-06-01 07:21:44] [INFO ] Added : 2 causal constraints over 1 iterations in 64 ms. Result :sat
Minimization took 52 ms.
[2025-06-01 07:21:44] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2025-06-01 07:21:44] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 07:21:44] [INFO ] [Real]Absence check using state equation in 75 ms returned sat
[2025-06-01 07:21:44] [INFO ] [Real]Added 35 Read/Feed constraints in 9 ms returned sat
[2025-06-01 07:21:44] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 07:21:44] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2025-06-01 07:21:44] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 07:21:44] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2025-06-01 07:21:44] [INFO ] [Nat]Added 35 Read/Feed constraints in 8 ms returned sat
[2025-06-01 07:21:44] [INFO ] Computed and/alt/rep : 38/99/35 causal constraints (skipped 135 transitions) in 13 ms.
[2025-06-01 07:21:44] [INFO ] Added : 2 causal constraints over 1 iterations in 40 ms. Result :sat
Minimization took 37 ms.
[2025-06-01 07:21:44] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2025-06-01 07:21:44] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 07:21:44] [INFO ] [Real]Absence check using state equation in 76 ms returned sat
[2025-06-01 07:21:44] [INFO ] [Real]Added 35 Read/Feed constraints in 10 ms returned sat
[2025-06-01 07:21:44] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 07:21:44] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2025-06-01 07:21:44] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 07:21:44] [INFO ] [Nat]Absence check using state equation in 85 ms returned sat
[2025-06-01 07:21:44] [INFO ] [Nat]Added 35 Read/Feed constraints in 10 ms returned sat
[2025-06-01 07:21:44] [INFO ] Computed and/alt/rep : 38/99/35 causal constraints (skipped 135 transitions) in 20 ms.
[2025-06-01 07:21:44] [INFO ] Added : 1 causal constraints over 1 iterations in 61 ms. Result :sat
Minimization took 50 ms.
[2025-06-01 07:21:45] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2025-06-01 07:21:45] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 07:21:45] [INFO ] [Real]Absence check using state equation in 88 ms returned sat
[2025-06-01 07:21:45] [INFO ] [Real]Added 35 Read/Feed constraints in 10 ms returned sat
[2025-06-01 07:21:45] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 07:21:45] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2025-06-01 07:21:45] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 07:21:45] [INFO ] [Nat]Absence check using state equation in 77 ms returned sat
[2025-06-01 07:21:45] [INFO ] [Nat]Added 35 Read/Feed constraints in 7 ms returned sat
[2025-06-01 07:21:45] [INFO ] Computed and/alt/rep : 38/99/35 causal constraints (skipped 135 transitions) in 19 ms.
[2025-06-01 07:21:45] [INFO ] Added : 9 causal constraints over 3 iterations in 79 ms. Result :sat
Minimization took 35 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[227, 11, 678, 9, 9, 9, 909, 1031] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[227, 11, 678, 9, 9, 9, 909, 1031] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Support contains 8 out of 107 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 107/107 places, 260/260 transitions.
Applied a total of 0 rules in 21 ms. Remains 107 /107 variables (removed 0) and now considering 260/260 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 107/107 places, 260/260 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 107/107 places, 260/260 transitions.
Applied a total of 0 rules in 16 ms. Remains 107 /107 variables (removed 0) and now considering 260/260 (removed 0) transitions.
[2025-06-01 07:21:45] [INFO ] Flow matrix only has 172 transitions (discarded 88 similar events)
[2025-06-01 07:21:45] [INFO ] Invariant cache hit.
[2025-06-01 07:21:45] [INFO ] Implicit Places using invariants in 163 ms returned []
[2025-06-01 07:21:45] [INFO ] Flow matrix only has 172 transitions (discarded 88 similar events)
[2025-06-01 07:21:45] [INFO ] Invariant cache hit.
[2025-06-01 07:21:45] [INFO ] State equation strengthened by 35 read => feed constraints.
[2025-06-01 07:21:46] [INFO ] Implicit Places using invariants and state equation in 393 ms returned []
Implicit Place search using SMT with State Equation took 564 ms to find 0 implicit places.
[2025-06-01 07:21:46] [INFO ] Redundant transitions in 24 ms returned []
Running 258 sub problems to find dead transitions.
[2025-06-01 07:21:46] [INFO ] Flow matrix only has 172 transitions (discarded 88 similar events)
[2025-06-01 07:21:46] [INFO ] Invariant cache hit.
[2025-06-01 07:21:46] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (OVERLAPS) 172/279 variables, 107/109 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/279 variables, 35/144 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/279 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 258 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/279 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 258 unsolved
No progress, stopping.
After SMT solving in domain Real declared 279/279 variables, and 144 constraints, problems are : Problem set: 0 solved, 258 unsolved in 10815 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 107/107 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 258 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (OVERLAPS) 172/279 variables, 107/109 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/279 variables, 35/144 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/279 variables, 258/402 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/279 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 7 (OVERLAPS) 0/279 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 258 unsolved
No progress, stopping.
After SMT solving in domain Int declared 279/279 variables, and 402 constraints, problems are : Problem set: 0 solved, 258 unsolved in 12329 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 107/107 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 0/0 constraints]
After SMT, in 23752ms problems are : Problem set: 0 solved, 258 unsolved
Search for dead transitions found 0 dead transitions in 23780ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24422 ms. Remains : 107/107 places, 260/260 transitions.
[2025-06-01 07:22:09] [INFO ] Flow matrix only has 172 transitions (discarded 88 similar events)
Found an invariant !
This invariant on transitions {25=1, 35=1, 83=1, 97=1, 119=1, 156=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {31=1, 79=1, 115=1, 157=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 8) seen :[0, 2, 3, 1, 2, 0, 4, 3]
Current structural bounds on expressions (after cover walk) : Max Seen:[227, 11, 678, 9, 9, 9, 909, 1031] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2025-06-01 07:22:10] [INFO ] Flow matrix only has 172 transitions (discarded 88 similar events)
[2025-06-01 07:22:10] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[227, 11, 678, 9, 9, 9, 909, 1031] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000001 steps (2 resets) in 1810 ms. (552 steps per ms)
BEST_FIRST walk for 8000007 steps (23 resets) in 6420 ms. (1245 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[227, 11, 678, 9, 9, 9, 909, 1031] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2025-06-01 07:22:18] [INFO ] Flow matrix only has 172 transitions (discarded 88 similar events)
[2025-06-01 07:22:18] [INFO ] Invariant cache hit.
[2025-06-01 07:22:18] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2025-06-01 07:22:18] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 07:22:18] [INFO ] [Real]Absence check using state equation in 72 ms returned sat
[2025-06-01 07:22:18] [INFO ] State equation strengthened by 35 read => feed constraints.
[2025-06-01 07:22:18] [INFO ] [Real]Added 35 Read/Feed constraints in 10 ms returned sat
[2025-06-01 07:22:18] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 07:22:18] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2025-06-01 07:22:18] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 07:22:18] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2025-06-01 07:22:18] [INFO ] [Nat]Added 35 Read/Feed constraints in 6 ms returned sat
[2025-06-01 07:22:18] [INFO ] Computed and/alt/rep : 38/99/35 causal constraints (skipped 135 transitions) in 14 ms.
[2025-06-01 07:22:18] [INFO ] Added : 14 causal constraints over 4 iterations in 74 ms. Result :sat
Minimization took 34 ms.
[2025-06-01 07:22:18] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2025-06-01 07:22:18] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 07:22:18] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2025-06-01 07:22:18] [INFO ] [Real]Added 35 Read/Feed constraints in 7 ms returned sat
[2025-06-01 07:22:18] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 07:22:18] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2025-06-01 07:22:18] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 07:22:18] [INFO ] [Nat]Absence check using state equation in 74 ms returned sat
[2025-06-01 07:22:18] [INFO ] [Nat]Added 35 Read/Feed constraints in 10 ms returned sat
[2025-06-01 07:22:18] [INFO ] Computed and/alt/rep : 38/99/35 causal constraints (skipped 135 transitions) in 18 ms.
[2025-06-01 07:22:18] [INFO ] Added : 2 causal constraints over 1 iterations in 51 ms. Result :sat
Minimization took 33 ms.
[2025-06-01 07:22:19] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2025-06-01 07:22:19] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2025-06-01 07:22:19] [INFO ] [Real]Absence check using state equation in 88 ms returned sat
[2025-06-01 07:22:19] [INFO ] [Real]Added 35 Read/Feed constraints in 11 ms returned sat
[2025-06-01 07:22:19] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 07:22:19] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2025-06-01 07:22:19] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 07:22:19] [INFO ] [Nat]Absence check using state equation in 74 ms returned sat
[2025-06-01 07:22:19] [INFO ] [Nat]Added 35 Read/Feed constraints in 9 ms returned sat
[2025-06-01 07:22:19] [INFO ] Computed and/alt/rep : 38/99/35 causal constraints (skipped 135 transitions) in 17 ms.
[2025-06-01 07:22:19] [INFO ] Added : 12 causal constraints over 5 iterations in 103 ms. Result :sat
Minimization took 37 ms.
[2025-06-01 07:22:19] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2025-06-01 07:22:19] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 07:22:19] [INFO ] [Real]Absence check using state equation in 84 ms returned sat
[2025-06-01 07:22:19] [INFO ] [Real]Added 35 Read/Feed constraints in 11 ms returned sat
[2025-06-01 07:22:19] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 07:22:19] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2025-06-01 07:22:19] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 07:22:19] [INFO ] [Nat]Absence check using state equation in 71 ms returned sat
[2025-06-01 07:22:19] [INFO ] [Nat]Added 35 Read/Feed constraints in 9 ms returned sat
[2025-06-01 07:22:19] [INFO ] Computed and/alt/rep : 38/99/35 causal constraints (skipped 135 transitions) in 18 ms.
[2025-06-01 07:22:19] [INFO ] Added : 2 causal constraints over 1 iterations in 53 ms. Result :sat
Minimization took 38 ms.
[2025-06-01 07:22:19] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2025-06-01 07:22:19] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-01 07:22:19] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2025-06-01 07:22:19] [INFO ] [Real]Added 35 Read/Feed constraints in 8 ms returned sat
[2025-06-01 07:22:20] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 07:22:20] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2025-06-01 07:22:20] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2025-06-01 07:22:20] [INFO ] [Nat]Absence check using state equation in 73 ms returned sat
[2025-06-01 07:22:20] [INFO ] [Nat]Added 35 Read/Feed constraints in 10 ms returned sat
[2025-06-01 07:22:20] [INFO ] Computed and/alt/rep : 38/99/35 causal constraints (skipped 135 transitions) in 20 ms.
[2025-06-01 07:22:20] [INFO ] Added : 2 causal constraints over 1 iterations in 55 ms. Result :sat
Minimization took 53 ms.
[2025-06-01 07:22:20] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2025-06-01 07:22:20] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 07:22:20] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2025-06-01 07:22:20] [INFO ] [Real]Added 35 Read/Feed constraints in 7 ms returned sat
[2025-06-01 07:22:20] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 07:22:20] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2025-06-01 07:22:20] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 07:22:20] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2025-06-01 07:22:20] [INFO ] [Nat]Added 35 Read/Feed constraints in 7 ms returned sat
[2025-06-01 07:22:20] [INFO ] Computed and/alt/rep : 38/99/35 causal constraints (skipped 135 transitions) in 13 ms.
[2025-06-01 07:22:20] [INFO ] Added : 2 causal constraints over 1 iterations in 38 ms. Result :sat
Minimization took 32 ms.
[2025-06-01 07:22:20] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2025-06-01 07:22:20] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 07:22:20] [INFO ] [Real]Absence check using state equation in 75 ms returned sat
[2025-06-01 07:22:20] [INFO ] [Real]Added 35 Read/Feed constraints in 9 ms returned sat
[2025-06-01 07:22:20] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 07:22:20] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2025-06-01 07:22:20] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-01 07:22:20] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2025-06-01 07:22:20] [INFO ] [Nat]Added 35 Read/Feed constraints in 6 ms returned sat
[2025-06-01 07:22:20] [INFO ] Computed and/alt/rep : 38/99/35 causal constraints (skipped 135 transitions) in 12 ms.
[2025-06-01 07:22:20] [INFO ] Added : 1 causal constraints over 1 iterations in 45 ms. Result :sat
Minimization took 52 ms.
[2025-06-01 07:22:20] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2025-06-01 07:22:20] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-01 07:22:21] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2025-06-01 07:22:21] [INFO ] [Real]Added 35 Read/Feed constraints in 7 ms returned sat
[2025-06-01 07:22:21] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 07:22:21] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2025-06-01 07:22:21] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 07:22:21] [INFO ] [Nat]Absence check using state equation in 77 ms returned sat
[2025-06-01 07:22:21] [INFO ] [Nat]Added 35 Read/Feed constraints in 10 ms returned sat
[2025-06-01 07:22:21] [INFO ] Computed and/alt/rep : 38/99/35 causal constraints (skipped 135 transitions) in 17 ms.
[2025-06-01 07:22:21] [INFO ] Added : 9 causal constraints over 3 iterations in 81 ms. Result :sat
Minimization took 57 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[227, 11, 678, 9, 9, 9, 909, 1031] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[227, 11, 678, 9, 9, 9, 909, 1031] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Support contains 8 out of 107 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 107/107 places, 260/260 transitions.
Applied a total of 0 rules in 11 ms. Remains 107 /107 variables (removed 0) and now considering 260/260 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 107/107 places, 260/260 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 107/107 places, 260/260 transitions.
Applied a total of 0 rules in 11 ms. Remains 107 /107 variables (removed 0) and now considering 260/260 (removed 0) transitions.
[2025-06-01 07:22:21] [INFO ] Flow matrix only has 172 transitions (discarded 88 similar events)
[2025-06-01 07:22:21] [INFO ] Invariant cache hit.
[2025-06-01 07:22:21] [INFO ] Implicit Places using invariants in 218 ms returned []
[2025-06-01 07:22:21] [INFO ] Flow matrix only has 172 transitions (discarded 88 similar events)
[2025-06-01 07:22:21] [INFO ] Invariant cache hit.
[2025-06-01 07:22:21] [INFO ] State equation strengthened by 35 read => feed constraints.
[2025-06-01 07:22:21] [INFO ] Implicit Places using invariants and state equation in 223 ms returned []
Implicit Place search using SMT with State Equation took 443 ms to find 0 implicit places.
[2025-06-01 07:22:21] [INFO ] Redundant transitions in 3 ms returned []
Running 258 sub problems to find dead transitions.
[2025-06-01 07:22:21] [INFO ] Flow matrix only has 172 transitions (discarded 88 similar events)
[2025-06-01 07:22:21] [INFO ] Invariant cache hit.
[2025-06-01 07:22:21] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (OVERLAPS) 172/279 variables, 107/109 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/279 variables, 35/144 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/279 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 258 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/279 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 258 unsolved
No progress, stopping.
After SMT solving in domain Real declared 279/279 variables, and 144 constraints, problems are : Problem set: 0 solved, 258 unsolved in 11600 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 107/107 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 258 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (OVERLAPS) 172/279 variables, 107/109 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/279 variables, 35/144 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/279 variables, 258/402 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/279 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 7 (OVERLAPS) 0/279 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 258 unsolved
No progress, stopping.
After SMT solving in domain Int declared 279/279 variables, and 402 constraints, problems are : Problem set: 0 solved, 258 unsolved in 13206 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 107/107 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 0/0 constraints]
After SMT, in 25072ms problems are : Problem set: 0 solved, 258 unsolved
Search for dead transitions found 0 dead transitions in 25077ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25541 ms. Remains : 107/107 places, 260/260 transitions.
[2025-06-01 07:22:46] [INFO ] Flow matrix only has 172 transitions (discarded 88 similar events)
Found an invariant !
This invariant on transitions {25=1, 35=1, 83=1, 97=1, 119=1, 156=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {31=1, 79=1, 115=1, 157=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 3 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 8) seen :[1, 1, 5, 3, 2, 2, 4, 2]
Current structural bounds on expressions (after cover walk) : Max Seen:[227, 11, 678, 9, 9, 9, 909, 1031] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 40009 steps (8 resets) in 1754 ms. (22 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (9 resets) in 405 ms. (98 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 282 ms. (141 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (9 resets) in 215 ms. (185 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 241 ms. (165 steps per ms) remains 8/8 properties
[2025-06-01 07:22:48] [INFO ] Flatten gal took : 331 ms
BEST_FIRST walk for 40003 steps (8 resets) in 316 ms. (126 steps per ms) remains 8/8 properties
[2025-06-01 07:22:48] [INFO ] Flatten gal took : 149 ms
BEST_FIRST walk for 40004 steps (8 resets) in 172 ms. (231 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (9 resets) in 110 ms. (360 steps per ms) remains 8/8 properties
[2025-06-01 07:22:48] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4647003531475643577.gal : 24 ms
BEST_FIRST walk for 40004 steps (10 resets) in 121 ms. (327 steps per ms) remains 8/8 properties
[2025-06-01 07:22:48] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10162741232047218608.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/ReachabilityCardinality4647003531475643577.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10162741232047218608.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/ReachabilityCardinality10162741232047218608.prop.
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 31
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :31 after 1062
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :1062 after 183440
Interrupted probabilistic random walk after 241183 steps, run timeout after 3001 ms. (steps per millisecond=80 ) properties seen :0 out of 8
Probabilistic random walk after 241183 steps, saw 151208 distinct states, run finished after 3005 ms. (steps per millisecond=80 ) properties seen :0
[2025-06-01 07:22:51] [INFO ] Flow matrix only has 172 transitions (discarded 88 similar events)
[2025-06-01 07:22:51] [INFO ] Invariant cache hit.
[2025-06-01 07:22:51] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 21/29 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 112/141 variables, 19/27 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 4/31 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/141 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 8 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 9/150 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/150 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/150 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 109/259 variables, 66/99 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/259 variables, 31/130 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/259 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 6/265 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/265 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (OVERLAPS) 11/276 variables, 11/142 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/276 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (OVERLAPS) 3/279 variables, 2/144 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/279 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (OVERLAPS) 0/279 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 279/279 variables, and 144 constraints, problems are : Problem set: 0 solved, 8 unsolved in 674 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 107/107 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 21/29 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 112/141 variables, 19/27 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 4/31 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/141 variables, 7/38 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/141 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 9/150 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/150 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/150 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 109/259 variables, 66/106 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/259 variables, 31/137 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/259 variables, 1/138 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/259 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (OVERLAPS) 6/265 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/265 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (OVERLAPS) 11/276 variables, 11/150 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/276 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (OVERLAPS) 3/279 variables, 2/152 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/279 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 20 (OVERLAPS) 0/279 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 279/279 variables, and 152 constraints, problems are : Problem set: 0 solved, 8 unsolved in 661 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 107/107 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 1347ms problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 3 different solutions.
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :183440 after 3.45776e+08
Parikh walk visited 0 properties in 30001 ms.
Support contains 8 out of 107 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 107/107 places, 260/260 transitions.
Applied a total of 0 rules in 11 ms. Remains 107 /107 variables (removed 0) and now considering 260/260 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 107/107 places, 260/260 transitions.
RANDOM walk for 40001 steps (9 resets) in 219 ms. (181 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (9 resets) in 79 ms. (500 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (10 resets) in 149 ms. (266 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (12 resets) in 88 ms. (449 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (9 resets) in 91 ms. (434 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 87 ms. (454 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 98 ms. (404 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (9 resets) in 98 ms. (404 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 98 ms. (404 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 208390 steps, run timeout after 3001 ms. (steps per millisecond=69 ) properties seen :0 out of 8
Probabilistic random walk after 208390 steps, saw 130548 distinct states, run finished after 3001 ms. (steps per millisecond=69 ) properties seen :0
[2025-06-01 07:23:26] [INFO ] Flow matrix only has 172 transitions (discarded 88 similar events)
[2025-06-01 07:23:26] [INFO ] Invariant cache hit.
[2025-06-01 07:23:26] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 21/29 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 112/141 variables, 19/27 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 4/31 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/141 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 8 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 9/150 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/150 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/150 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 109/259 variables, 66/99 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/259 variables, 31/130 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/259 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 6/265 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/265 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (OVERLAPS) 11/276 variables, 11/142 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/276 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (OVERLAPS) 3/279 variables, 2/144 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/279 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (OVERLAPS) 0/279 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 279/279 variables, and 144 constraints, problems are : Problem set: 0 solved, 8 unsolved in 474 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 107/107 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 21/29 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 112/141 variables, 19/27 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 4/31 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/141 variables, 7/38 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/141 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 9/150 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/150 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/150 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 109/259 variables, 66/106 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/259 variables, 31/137 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/259 variables, 1/138 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/259 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (OVERLAPS) 6/265 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/265 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (OVERLAPS) 11/276 variables, 11/150 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/276 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (OVERLAPS) 3/279 variables, 2/152 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/279 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 20 (OVERLAPS) 0/279 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 279/279 variables, and 152 constraints, problems are : Problem set: 0 solved, 8 unsolved in 530 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 107/107 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 1016ms problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 3 different solutions.
Detected timeout of ITS tools.
[2025-06-01 07:23:38] [INFO ] Flatten gal took : 29 ms
[2025-06-01 07:23:38] [INFO ] Applying decomposition
[2025-06-01 07:23:38] [INFO ] Flatten gal took : 27 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/graph11756898398048347262.txt' '-o' '/tmp/graph11756898398048347262.bin' '-w' '/tmp/graph11756898398048347262.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11756898398048347262.bin' '-l' '-1' '-v' '-w' '/tmp/graph11756898398048347262.weights' '-q' '0' '-e' '0.001'
[2025-06-01 07:23:38] [INFO ] Decomposing Gal with order
[2025-06-01 07:23:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 07:23:39] [INFO ] Removed a total of 437 redundant transitions.
[2025-06-01 07:23:39] [INFO ] Flatten gal took : 212 ms
[2025-06-01 07:23:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 149 labels/synchronizations in 107 ms.
[2025-06-01 07:23:39] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13868792676998690953.gal : 20 ms
[2025-06-01 07:23:39] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4422462211238261146.prop : 2 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/ReachabilityCardinality13868792676998690953.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4422462211238261146.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/ReachabilityCardinality4422462211238261146.prop.
Parikh walk visited 0 properties in 30000 ms.
Support contains 8 out of 107 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 107/107 places, 260/260 transitions.
Applied a total of 0 rules in 9 ms. Remains 107 /107 variables (removed 0) and now considering 260/260 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 107/107 places, 260/260 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 107/107 places, 260/260 transitions.
Applied a total of 0 rules in 7 ms. Remains 107 /107 variables (removed 0) and now considering 260/260 (removed 0) transitions.
[2025-06-01 07:23:57] [INFO ] Flow matrix only has 172 transitions (discarded 88 similar events)
[2025-06-01 07:23:57] [INFO ] Invariant cache hit.
[2025-06-01 07:23:57] [INFO ] Implicit Places using invariants in 110 ms returned []
[2025-06-01 07:23:57] [INFO ] Flow matrix only has 172 transitions (discarded 88 similar events)
[2025-06-01 07:23:57] [INFO ] Invariant cache hit.
[2025-06-01 07:23:57] [INFO ] State equation strengthened by 35 read => feed constraints.
[2025-06-01 07:23:57] [INFO ] Implicit Places using invariants and state equation in 227 ms returned []
Implicit Place search using SMT with State Equation took 340 ms to find 0 implicit places.
[2025-06-01 07:23:57] [INFO ] Redundant transitions in 3 ms returned []
Running 258 sub problems to find dead transitions.
[2025-06-01 07:23:57] [INFO ] Flow matrix only has 172 transitions (discarded 88 similar events)
[2025-06-01 07:23:57] [INFO ] Invariant cache hit.
[2025-06-01 07:23:57] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (OVERLAPS) 172/279 variables, 107/109 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/279 variables, 35/144 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/279 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 258 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/279 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 258 unsolved
No progress, stopping.
After SMT solving in domain Real declared 279/279 variables, and 144 constraints, problems are : Problem set: 0 solved, 258 unsolved in 8996 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 107/107 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 258 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (OVERLAPS) 172/279 variables, 107/109 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/279 variables, 35/144 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/279 variables, 258/402 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/279 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 7 (OVERLAPS) 0/279 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 258 unsolved
No progress, stopping.
After SMT solving in domain Int declared 279/279 variables, and 402 constraints, problems are : Problem set: 0 solved, 258 unsolved in 8960 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 107/107 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 0/0 constraints]
After SMT, in 18201ms problems are : Problem set: 0 solved, 258 unsolved
Search for dead transitions found 0 dead transitions in 18214ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18571 ms. Remains : 107/107 places, 260/260 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 88 transitions
Reduce isomorphic transitions removed 88 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 96 rules applied. Total rules applied 96 place count 107 transition count 164
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 9 rules applied. Total rules applied 105 place count 99 transition count 163
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 106 place count 98 transition count 163
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 20 Pre rules applied. Total rules applied 106 place count 98 transition count 143
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 146 place count 78 transition count 143
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 182 place count 60 transition count 125
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 189 place count 53 transition count 111
Iterating global reduction 3 with 7 rules applied. Total rules applied 196 place count 53 transition count 111
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 203 place count 46 transition count 97
Iterating global reduction 3 with 7 rules applied. Total rules applied 210 place count 46 transition count 97
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 217 place count 39 transition count 83
Iterating global reduction 3 with 7 rules applied. Total rules applied 224 place count 39 transition count 83
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 231 place count 39 transition count 76
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 231 place count 39 transition count 75
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 233 place count 38 transition count 75
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 237 place count 36 transition count 76
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 240 place count 36 transition count 73
Applied a total of 240 rules in 31 ms. Remains 36 /107 variables (removed 71) and now considering 73/260 (removed 187) transitions.
Running SMT prover for 8 properties.
// Phase 1: matrix 73 rows 36 cols
[2025-06-01 07:24:15] [INFO ] Computed 2 invariants in 1 ms
[2025-06-01 07:24:15] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2025-06-01 07:24:15] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 07:24:15] [INFO ] After 164ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2025-06-01 07:24:16] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-01 07:24:16] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 07:24:16] [INFO ] After 79ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2025-06-01 07:24:16] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-06-01 07:24:16] [INFO ] After 44ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :8
TRAPS : Iteration 0
[2025-06-01 07:24:16] [INFO ] After 111ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
[2025-06-01 07:24:16] [INFO ] After 306ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
[2025-06-01 07:24:16] [INFO ] Flatten gal took : 9 ms
[2025-06-01 07:24:16] [INFO ] Flatten gal took : 8 ms
[2025-06-01 07:24:16] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12547333748361570197.gal : 3 ms
[2025-06-01 07:24:16] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality644481357319916045.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/ReachabilityCardinality12547333748361570197.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality644481357319916045.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/ReachabilityCardinality644481357319916045.prop.
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :5 after 17
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :17 after 406
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :406 after 585
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :585 after 29641
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :29641 after 5.63344e+06
Invariant property MIN5 does not hold.
Invariant property MIN4 does not hold.
Invariant property MIN3 does not hold.
Invariant property MIN1 does not hold.
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :5.63344e+06 after 2.89228e+08
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :2.89228e+08 after 8.29312e+09
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :8.29312e+09 after 6.22942e+11
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :6.22942e+11 after 1.52288e+14
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :1.52288e+14 after 8.05973e+16
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :8.05973e+16 after 7.83074e+19
Detected timeout of ITS tools.
Detected timeout of ITS tools.
[2025-06-01 07:24:31] [INFO ] Flatten gal took : 8 ms
[2025-06-01 07:24:31] [INFO ] Applying decomposition
[2025-06-01 07:24:31] [INFO ] Flatten gal took : 8 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/graph7203708669813142783.txt' '-o' '/tmp/graph7203708669813142783.bin' '-w' '/tmp/graph7203708669813142783.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7203708669813142783.bin' '-l' '-1' '-v' '-w' '/tmp/graph7203708669813142783.weights' '-q' '0' '-e' '0.001'
[2025-06-01 07:24:31] [INFO ] Decomposing Gal with order
[2025-06-01 07:24:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 07:24:31] [INFO ] Removed a total of 76 redundant transitions.
[2025-06-01 07:24:31] [INFO ] Flatten gal took : 17 ms
[2025-06-01 07:24:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 3 ms.
[2025-06-01 07:24:31] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10994895134227502716.gal : 3 ms
[2025-06-01 07:24:31] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8061854799385707073.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/ReachabilityCardinality10994895134227502716.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8061854799385707073.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/ReachabilityCardinality8061854799385707073.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :5 after 17
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :17 after 90
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :90 after 3869
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :3869 after 666683
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :666683 after 6.32525e+07
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :6.32525e+07 after 8.16228e+09
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :8.16228e+09 after 8.67802e+11
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 30755 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[227, 11, 678, 9, 9, 9, 909, 1031] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Starting property specific reduction for FunctionPointer-PT-b008-UpperBounds-01
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:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2025-06-01 07:24:46] [INFO ] Flow matrix only has 172 transitions (discarded 88 similar events)
// Phase 1: matrix 172 rows 107 cols
[2025-06-01 07:24:46] [INFO ] Computed 2 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (2 resets) in 33 ms. (294 steps per ms)
BEST_FIRST walk for 10001 steps (3 resets) in 17 ms. (555 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5] Max Struct:[+inf]
[2025-06-01 07:24:46] [INFO ] Flow matrix only has 172 transitions (discarded 88 similar events)
[2025-06-01 07:24:46] [INFO ] Invariant cache hit.
[2025-06-01 07:24:46] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2025-06-01 07:24:46] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 07:24:46] [INFO ] [Real]Absence check using state equation in 88 ms returned sat
[2025-06-01 07:24:46] [INFO ] State equation strengthened by 35 read => feed constraints.
[2025-06-01 07:24:46] [INFO ] [Real]Added 35 Read/Feed constraints in 15 ms returned sat
[2025-06-01 07:24:46] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 07:24:46] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2025-06-01 07:24:46] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 07:24:46] [INFO ] [Nat]Absence check using state equation in 73 ms returned sat
[2025-06-01 07:24:46] [INFO ] [Nat]Added 35 Read/Feed constraints in 10 ms returned sat
[2025-06-01 07:24:46] [INFO ] Computed and/alt/rep : 38/99/35 causal constraints (skipped 135 transitions) in 18 ms.
[2025-06-01 07:24:46] [INFO ] Added : 9 causal constraints over 4 iterations in 98 ms. Result :sat
Minimization took 37 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[5] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5] Max Struct:[+inf]
Support contains 1 out of 107 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 107/107 places, 260/260 transitions.
Graph (complete) has 444 edges and 107 vertex of which 98 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 98 transition count 244
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 20 place count 95 transition count 238
Iterating global reduction 1 with 3 rules applied. Total rules applied 23 place count 95 transition count 238
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 25 place count 95 transition count 236
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 28 place count 92 transition count 228
Iterating global reduction 2 with 3 rules applied. Total rules applied 31 place count 92 transition count 228
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 33 place count 90 transition count 224
Iterating global reduction 2 with 2 rules applied. Total rules applied 35 place count 90 transition count 224
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 37 place count 88 transition count 220
Iterating global reduction 2 with 2 rules applied. Total rules applied 39 place count 88 transition count 220
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 41 place count 86 transition count 216
Iterating global reduction 2 with 2 rules applied. Total rules applied 43 place count 86 transition count 216
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 45 place count 84 transition count 212
Iterating global reduction 2 with 2 rules applied. Total rules applied 47 place count 84 transition count 212
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 48 place count 83 transition count 210
Iterating global reduction 2 with 1 rules applied. Total rules applied 49 place count 83 transition count 210
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 50 place count 82 transition count 208
Iterating global reduction 2 with 1 rules applied. Total rules applied 51 place count 82 transition count 208
Applied a total of 51 rules in 49 ms. Remains 82 /107 variables (removed 25) and now considering 208/260 (removed 52) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 82/107 places, 208/260 transitions.
[2025-06-01 07:24:47] [INFO ] Flow matrix only has 128 transitions (discarded 80 similar events)
Found an invariant !
This invariant on transitions {29=1, 32=1, 34=1, 63=1, 94=1, 123=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {26=1, 60=1, 91=1, 123=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[5] Max Struct:[+inf]
[2025-06-01 07:24:47] [INFO ] Flow matrix only has 128 transitions (discarded 80 similar events)
// Phase 1: matrix 128 rows 82 cols
[2025-06-01 07:24:47] [INFO ] Computed 3 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[5] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 1498 ms. (667 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 640 ms. (1560 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[224] Max Struct:[+inf]
[2025-06-01 07:24:49] [INFO ] Flow matrix only has 128 transitions (discarded 80 similar events)
[2025-06-01 07:24:49] [INFO ] Invariant cache hit.
[2025-06-01 07:24:49] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 07:24:49] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2025-06-01 07:24:49] [INFO ] State equation strengthened by 18 read => feed constraints.
[2025-06-01 07:24:49] [INFO ] [Real]Added 18 Read/Feed constraints in 5 ms returned sat
[2025-06-01 07:24:49] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 07:24:49] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 07:24:49] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2025-06-01 07:24:49] [INFO ] [Nat]Added 18 Read/Feed constraints in 4 ms returned sat
[2025-06-01 07:24:49] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 2 ms to minimize.
[2025-06-01 07:24:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 72 ms
[2025-06-01 07:24:49] [INFO ] Computed and/alt/rep : 60/196/54 causal constraints (skipped 72 transitions) in 10 ms.
[2025-06-01 07:24:49] [INFO ] Added : 16 causal constraints over 4 iterations in 62 ms. Result :sat
Minimization took 33 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[224] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[224] Max Struct:[+inf]
Support contains 1 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 208/208 transitions.
Applied a total of 0 rules in 6 ms. Remains 82 /82 variables (removed 0) and now considering 208/208 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 82/82 places, 208/208 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 208/208 transitions.
Applied a total of 0 rules in 5 ms. Remains 82 /82 variables (removed 0) and now considering 208/208 (removed 0) transitions.
[2025-06-01 07:24:49] [INFO ] Flow matrix only has 128 transitions (discarded 80 similar events)
[2025-06-01 07:24:49] [INFO ] Invariant cache hit.
[2025-06-01 07:24:49] [INFO ] Implicit Places using invariants in 107 ms returned []
[2025-06-01 07:24:49] [INFO ] Flow matrix only has 128 transitions (discarded 80 similar events)
[2025-06-01 07:24:49] [INFO ] Invariant cache hit.
[2025-06-01 07:24:49] [INFO ] State equation strengthened by 18 read => feed constraints.
[2025-06-01 07:24:50] [INFO ] Implicit Places using invariants and state equation in 201 ms returned []
Implicit Place search using SMT with State Equation took 333 ms to find 0 implicit places.
[2025-06-01 07:24:50] [INFO ] Redundant transitions in 2 ms returned []
Running 206 sub problems to find dead transitions.
[2025-06-01 07:24:50] [INFO ] Flow matrix only has 128 transitions (discarded 80 similar events)
[2025-06-01 07:24:50] [INFO ] Invariant cache hit.
[2025-06-01 07:24:50] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 2 (OVERLAPS) 128/210 variables, 82/85 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/210 variables, 18/103 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/210 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 5 (OVERLAPS) 0/210 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 206 unsolved
No progress, stopping.
After SMT solving in domain Real declared 210/210 variables, and 103 constraints, problems are : Problem set: 0 solved, 206 unsolved in 6441 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 82/82 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 206/206 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 206 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 2 (OVERLAPS) 128/210 variables, 82/85 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/210 variables, 18/103 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/210 variables, 206/309 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/210 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 6 (OVERLAPS) 0/210 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 206 unsolved
No progress, stopping.
After SMT solving in domain Int declared 210/210 variables, and 309 constraints, problems are : Problem set: 0 solved, 206 unsolved in 8469 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 82/82 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 206/206 constraints, Known Traps: 0/0 constraints]
After SMT, in 15054ms problems are : Problem set: 0 solved, 206 unsolved
Search for dead transitions found 0 dead transitions in 15061ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15409 ms. Remains : 82/82 places, 208/208 transitions.
[2025-06-01 07:25:05] [INFO ] Flow matrix only has 128 transitions (discarded 80 similar events)
Found an invariant !
This invariant on transitions {29=1, 32=1, 34=1, 63=1, 94=1, 123=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {26=1, 60=1, 91=1, 123=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[224] Max Struct:[+inf]
[2025-06-01 07:25:05] [INFO ] Flow matrix only has 128 transitions (discarded 80 similar events)
[2025-06-01 07:25:05] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[224] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 1340 ms. (745 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 676 ms. (1477 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[224] Max Struct:[+inf]
[2025-06-01 07:25:07] [INFO ] Flow matrix only has 128 transitions (discarded 80 similar events)
[2025-06-01 07:25:07] [INFO ] Invariant cache hit.
[2025-06-01 07:25:07] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-01 07:25:07] [INFO ] [Real]Absence check using state equation in 70 ms returned sat
[2025-06-01 07:25:07] [INFO ] State equation strengthened by 18 read => feed constraints.
[2025-06-01 07:25:07] [INFO ] [Real]Added 18 Read/Feed constraints in 11 ms returned sat
[2025-06-01 07:25:07] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 07:25:07] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 07:25:07] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2025-06-01 07:25:07] [INFO ] [Nat]Added 18 Read/Feed constraints in 7 ms returned sat
[2025-06-01 07:25:07] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 2 ms to minimize.
[2025-06-01 07:25:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 80 ms
[2025-06-01 07:25:07] [INFO ] Computed and/alt/rep : 60/196/54 causal constraints (skipped 72 transitions) in 13 ms.
[2025-06-01 07:25:07] [INFO ] Added : 16 causal constraints over 4 iterations in 87 ms. Result :sat
Minimization took 52 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[224] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[224] Max Struct:[+inf]
Support contains 1 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 208/208 transitions.
Applied a total of 0 rules in 11 ms. Remains 82 /82 variables (removed 0) and now considering 208/208 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 82/82 places, 208/208 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 208/208 transitions.
Applied a total of 0 rules in 7 ms. Remains 82 /82 variables (removed 0) and now considering 208/208 (removed 0) transitions.
[2025-06-01 07:25:07] [INFO ] Flow matrix only has 128 transitions (discarded 80 similar events)
[2025-06-01 07:25:07] [INFO ] Invariant cache hit.
[2025-06-01 07:25:08] [INFO ] Implicit Places using invariants in 156 ms returned []
[2025-06-01 07:25:08] [INFO ] Flow matrix only has 128 transitions (discarded 80 similar events)
[2025-06-01 07:25:08] [INFO ] Invariant cache hit.
[2025-06-01 07:25:08] [INFO ] State equation strengthened by 18 read => feed constraints.
[2025-06-01 07:25:08] [INFO ] Implicit Places using invariants and state equation in 275 ms returned []
Implicit Place search using SMT with State Equation took 441 ms to find 0 implicit places.
[2025-06-01 07:25:08] [INFO ] Redundant transitions in 1 ms returned []
Running 206 sub problems to find dead transitions.
[2025-06-01 07:25:08] [INFO ] Flow matrix only has 128 transitions (discarded 80 similar events)
[2025-06-01 07:25:08] [INFO ] Invariant cache hit.
[2025-06-01 07:25:08] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 2 (OVERLAPS) 128/210 variables, 82/85 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/210 variables, 18/103 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/210 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 5 (OVERLAPS) 0/210 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 206 unsolved
No progress, stopping.
After SMT solving in domain Real declared 210/210 variables, and 103 constraints, problems are : Problem set: 0 solved, 206 unsolved in 6079 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 82/82 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 206/206 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 206 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 2 (OVERLAPS) 128/210 variables, 82/85 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/210 variables, 18/103 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/210 variables, 206/309 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/210 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 6 (OVERLAPS) 0/210 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 206 unsolved
No progress, stopping.
After SMT solving in domain Int declared 210/210 variables, and 309 constraints, problems are : Problem set: 0 solved, 206 unsolved in 7717 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 82/82 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 206/206 constraints, Known Traps: 0/0 constraints]
After SMT, in 13963ms problems are : Problem set: 0 solved, 206 unsolved
Search for dead transitions found 0 dead transitions in 13966ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14423 ms. Remains : 82/82 places, 208/208 transitions.
[2025-06-01 07:25:22] [INFO ] Flow matrix only has 128 transitions (discarded 80 similar events)
Found an invariant !
This invariant on transitions {29=1, 32=1, 34=1, 63=1, 94=1, 123=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {26=1, 60=1, 91=1, 123=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[224] Max Struct:[+inf]
[2025-06-01 07:25:22] [INFO ] Flatten gal took : 19 ms
[2025-06-01 07:25:22] [INFO ] Flatten gal took : 28 ms
RANDOM walk for 40001 steps (8 resets) in 138 ms. (287 steps per ms) remains 1/1 properties
[2025-06-01 07:25:22] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8021255925942676654.gal : 13 ms
[2025-06-01 07:25:22] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10256152555761669770.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/ReachabilityCardinality8021255925942676654.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10256152555761669770.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
BEST_FIRST walk for 40004 steps (8 resets) in 33 ms. (1176 steps per ms) remains 1/1 properties
Loading property file /tmp/ReachabilityCardinality10256152555761669770.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 31
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :31 after 1046
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1046 after 151212
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :151212 after 4.71441e+07
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :4.71441e+07 after 2.16778e+08
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :2.16778e+08 after 5.21523e+08
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :5.21523e+08 after 3.13018e+10
Interrupted probabilistic random walk after 1535222 steps, run timeout after 3001 ms. (steps per millisecond=511 ) properties seen :0 out of 1
Probabilistic random walk after 1535222 steps, saw 955495 distinct states, run finished after 3001 ms. (steps per millisecond=511 ) properties seen :0
[2025-06-01 07:25:25] [INFO ] Flow matrix only has 128 transitions (discarded 80 similar events)
[2025-06-01 07:25:25] [INFO ] Invariant cache hit.
[2025-06-01 07:25:25] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 70/75 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/85 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/85 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/85 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 100/185 variables, 58/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/185 variables, 18/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/185 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 6/191 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/191 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 14/205 variables, 12/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/205 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 4/209 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/209 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1/210 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/210 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/210 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 210/210 variables, and 103 constraints, problems are : Problem set: 0 solved, 1 unsolved in 155 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 82/82 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 70/75 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 10/85 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/85 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/85 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 100/185 variables, 58/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/185 variables, 18/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/185 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 6/191 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/191 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 14/205 variables, 12/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/205 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 4/209 variables, 2/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/209 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 1/210 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/210 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/210 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 210/210 variables, and 104 constraints, problems are : Problem set: 0 solved, 1 unsolved in 221 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 82/82 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 381ms problems are : Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :3.13018e+10 after 9.988e+10
Parikh walk visited 0 properties in 533 ms.
Support contains 1 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 208/208 transitions.
Applied a total of 0 rules in 5 ms. Remains 82 /82 variables (removed 0) and now considering 208/208 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 82/82 places, 208/208 transitions.
RANDOM walk for 40004 steps (8 resets) in 119 ms. (333 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 34 ms. (1142 steps per ms) remains 1/1 properties
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :9.988e+10 after 2.3677e+11
Interrupted probabilistic random walk after 1633272 steps, run timeout after 3001 ms. (steps per millisecond=544 ) properties seen :0 out of 1
Probabilistic random walk after 1633272 steps, saw 1016524 distinct states, run finished after 3001 ms. (steps per millisecond=544 ) properties seen :0
[2025-06-01 07:25:29] [INFO ] Flow matrix only has 128 transitions (discarded 80 similar events)
[2025-06-01 07:25:29] [INFO ] Invariant cache hit.
[2025-06-01 07:25:29] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 70/75 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/85 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/85 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/85 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 100/185 variables, 58/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/185 variables, 18/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/185 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 6/191 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/191 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 14/205 variables, 12/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/205 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 4/209 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/209 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1/210 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/210 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/210 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 210/210 variables, and 103 constraints, problems are : Problem set: 0 solved, 1 unsolved in 115 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 82/82 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 70/75 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 10/85 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/85 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/85 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 100/185 variables, 58/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/185 variables, 18/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/185 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 6/191 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/191 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 14/205 variables, 12/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/205 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 4/209 variables, 2/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/209 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 1/210 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/210 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/210 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 210/210 variables, and 104 constraints, problems are : Problem set: 0 solved, 1 unsolved in 123 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 82/82 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 248ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 499 ms.
Support contains 1 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 208/208 transitions.
Applied a total of 0 rules in 5 ms. Remains 82 /82 variables (removed 0) and now considering 208/208 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 82/82 places, 208/208 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 208/208 transitions.
Applied a total of 0 rules in 3 ms. Remains 82 /82 variables (removed 0) and now considering 208/208 (removed 0) transitions.
[2025-06-01 07:25:30] [INFO ] Flow matrix only has 128 transitions (discarded 80 similar events)
[2025-06-01 07:25:30] [INFO ] Invariant cache hit.
[2025-06-01 07:25:30] [INFO ] Implicit Places using invariants in 85 ms returned []
[2025-06-01 07:25:30] [INFO ] Flow matrix only has 128 transitions (discarded 80 similar events)
[2025-06-01 07:25:30] [INFO ] Invariant cache hit.
[2025-06-01 07:25:30] [INFO ] State equation strengthened by 18 read => feed constraints.
[2025-06-01 07:25:30] [INFO ] Implicit Places using invariants and state equation in 186 ms returned []
Implicit Place search using SMT with State Equation took 277 ms to find 0 implicit places.
[2025-06-01 07:25:30] [INFO ] Redundant transitions in 1 ms returned []
Running 206 sub problems to find dead transitions.
[2025-06-01 07:25:30] [INFO ] Flow matrix only has 128 transitions (discarded 80 similar events)
[2025-06-01 07:25:30] [INFO ] Invariant cache hit.
[2025-06-01 07:25:30] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 2 (OVERLAPS) 128/210 variables, 82/85 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/210 variables, 18/103 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/210 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 5 (OVERLAPS) 0/210 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 206 unsolved
No progress, stopping.
After SMT solving in domain Real declared 210/210 variables, and 103 constraints, problems are : Problem set: 0 solved, 206 unsolved in 5057 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 82/82 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 206/206 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 206 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 2 (OVERLAPS) 128/210 variables, 82/85 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/210 variables, 18/103 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/210 variables, 206/309 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/210 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 6 (OVERLAPS) 0/210 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 206 unsolved
No progress, stopping.
After SMT solving in domain Int declared 210/210 variables, and 309 constraints, problems are : Problem set: 0 solved, 206 unsolved in 7479 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 82/82 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 206/206 constraints, Known Traps: 0/0 constraints]
After SMT, in 12680ms problems are : Problem set: 0 solved, 206 unsolved
Search for dead transitions found 0 dead transitions in 12683ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12971 ms. Remains : 82/82 places, 208/208 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 87 rules applied. Total rules applied 87 place count 82 transition count 121
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 94 place count 75 transition count 121
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 94 place count 75 transition count 105
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 126 place count 59 transition count 105
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 156 place count 44 transition count 90
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 163 place count 37 transition count 76
Iterating global reduction 2 with 7 rules applied. Total rules applied 170 place count 37 transition count 76
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 177 place count 30 transition count 62
Iterating global reduction 2 with 7 rules applied. Total rules applied 184 place count 30 transition count 62
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 191 place count 23 transition count 48
Iterating global reduction 2 with 7 rules applied. Total rules applied 198 place count 23 transition count 48
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 205 place count 23 transition count 41
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 205 place count 23 transition count 40
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 207 place count 22 transition count 40
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 211 place count 20 transition count 40
Applied a total of 211 rules in 33 ms. Remains 20 /82 variables (removed 62) and now considering 40/208 (removed 168) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 40 rows 20 cols
[2025-06-01 07:25:43] [INFO ] Computed 3 invariants in 1 ms
[2025-06-01 07:25:43] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 07:25:43] [INFO ] After 22ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2025-06-01 07:25:43] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-06-01 07:25:43] [INFO ] After 7ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2025-06-01 07:25:43] [INFO ] After 55ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-06-01 07:25:43] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-01 07:25:43] [INFO ] After 14ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2025-06-01 07:25:43] [INFO ] After 4ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-01 07:25:43] [INFO ] After 7ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-01 07:25:43] [INFO ] After 47ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2025-06-01 07:25:43] [INFO ] Flatten gal took : 4 ms
[2025-06-01 07:25:43] [INFO ] Flatten gal took : 3 ms
[2025-06-01 07:25:43] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13925977741385301710.gal : 1 ms
[2025-06-01 07:25:43] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6638469374300084174.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/ReachabilityCardinality13925977741385301710.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6638469374300084174.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/ReachabilityCardinality6638469374300084174.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 17
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :17 after 288
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :288 after 14700
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :14700 after 90900
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :90900 after 432180
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :432180 after 1.86018e+06
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1.86018e+06 after 7.68126e+06
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :7.68126e+06 after 3.1151e+07
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :2.3677e+11 after 5.10282e+11
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :3.1151e+07 after 1.25338e+08
Detected timeout of ITS tools.
[2025-06-01 07:25:58] [INFO ] Flatten gal took : 3 ms
[2025-06-01 07:25:58] [INFO ] Applying decomposition
[2025-06-01 07:25:58] [INFO ] Flatten gal took : 2 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/graph5275043606308781309.txt' '-o' '/tmp/graph5275043606308781309.bin' '-w' '/tmp/graph5275043606308781309.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5275043606308781309.bin' '-l' '-1' '-v' '-w' '/tmp/graph5275043606308781309.weights' '-q' '0' '-e' '0.001'
[2025-06-01 07:25:58] [INFO ] Decomposing Gal with order
[2025-06-01 07:25:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 07:25:58] [INFO ] Removed a total of 47 redundant transitions.
[2025-06-01 07:25:58] [INFO ] Flatten gal took : 6 ms
[2025-06-01 07:25:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 1 ms.
[2025-06-01 07:25:58] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14666195471713813074.gal : 1 ms
[2025-06-01 07:25:58] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8264723518030123036.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/ReachabilityCardinality14666195471713813074.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8264723518030123036.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/ReachabilityCardinality8264723518030123036.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 17
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :17 after 90
Detected timeout of ITS tools.
[2025-06-01 07:26:12] [INFO ] Flatten gal took : 18 ms
[2025-06-01 07:26:12] [INFO ] Applying decomposition
[2025-06-01 07:26:12] [INFO ] Flatten gal took : 12 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/graph2452952650838318565.txt' '-o' '/tmp/graph2452952650838318565.bin' '-w' '/tmp/graph2452952650838318565.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2452952650838318565.bin' '-l' '-1' '-v' '-w' '/tmp/graph2452952650838318565.weights' '-q' '0' '-e' '0.001'
[2025-06-01 07:26:12] [INFO ] Decomposing Gal with order
[2025-06-01 07:26:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 07:26:12] [INFO ] Removed a total of 355 redundant transitions.
[2025-06-01 07:26:12] [INFO ] Flatten gal took : 24 ms
[2025-06-01 07:26:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 114 labels/synchronizations in 13 ms.
[2025-06-01 07:26:12] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13557424086774657651.gal : 6 ms
[2025-06-01 07:26:12] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6228040621587735014.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/ReachabilityCardinality13557424086774657651.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6228040621587735014.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/ReachabilityCardinality6228040621587735014.prop.
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 30252 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:[224] Max Struct:[+inf]
Ending property specific reduction for FunctionPointer-PT-b008-UpperBounds-01 in 86962 ms.
Starting property specific reduction for FunctionPointer-PT-b008-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:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2025-06-01 07:26:13] [INFO ] Flow matrix only has 172 transitions (discarded 88 similar events)
// Phase 1: matrix 172 rows 107 cols
[2025-06-01 07:26:13] [INFO ] Computed 2 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (2 resets) in 15 ms. (625 steps per ms)
BEST_FIRST walk for 10000 steps (2 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[+inf]
[2025-06-01 07:26:13] [INFO ] Flow matrix only has 172 transitions (discarded 88 similar events)
[2025-06-01 07:26:13] [INFO ] Invariant cache hit.
[2025-06-01 07:26:13] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-01 07:26:13] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-01 07:26:13] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2025-06-01 07:26:13] [INFO ] State equation strengthened by 35 read => feed constraints.
[2025-06-01 07:26:13] [INFO ] [Real]Added 35 Read/Feed constraints in 10 ms returned sat
[2025-06-01 07:26:13] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 07:26:13] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2025-06-01 07:26:13] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 07:26:13] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2025-06-01 07:26:13] [INFO ] [Nat]Added 35 Read/Feed constraints in 14 ms returned sat
[2025-06-01 07:26:13] [INFO ] Computed and/alt/rep : 38/99/35 causal constraints (skipped 135 transitions) in 16 ms.
[2025-06-01 07:26:13] [INFO ] Added : 2 causal constraints over 1 iterations in 49 ms. Result :sat
Minimization took 53 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[+inf]
Support contains 1 out of 107 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 107/107 places, 260/260 transitions.
Graph (complete) has 444 edges and 107 vertex of which 101 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 101 transition count 249
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 16 place count 97 transition count 239
Iterating global reduction 1 with 4 rules applied. Total rules applied 20 place count 97 transition count 239
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 22 place count 97 transition count 237
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 26 place count 93 transition count 227
Iterating global reduction 2 with 4 rules applied. Total rules applied 30 place count 93 transition count 227
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 33 place count 90 transition count 219
Iterating global reduction 2 with 3 rules applied. Total rules applied 36 place count 90 transition count 219
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 39 place count 87 transition count 213
Iterating global reduction 2 with 3 rules applied. Total rules applied 42 place count 87 transition count 213
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 45 place count 84 transition count 207
Iterating global reduction 2 with 3 rules applied. Total rules applied 48 place count 84 transition count 207
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 51 place count 81 transition count 201
Iterating global reduction 2 with 3 rules applied. Total rules applied 54 place count 81 transition count 201
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 56 place count 79 transition count 197
Iterating global reduction 2 with 2 rules applied. Total rules applied 58 place count 79 transition count 197
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 60 place count 77 transition count 193
Iterating global reduction 2 with 2 rules applied. Total rules applied 62 place count 77 transition count 193
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 63 place count 76 transition count 191
Iterating global reduction 2 with 1 rules applied. Total rules applied 64 place count 76 transition count 191
Applied a total of 64 rules in 32 ms. Remains 76 /107 variables (removed 31) and now considering 191/260 (removed 69) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 76/107 places, 191/260 transitions.
[2025-06-01 07:26:13] [INFO ] Flow matrix only has 117 transitions (discarded 74 similar events)
Found an invariant !
This invariant on transitions {31=1, 56=1, 102=1, 115=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {31=1, 56=1, 86=1, 112=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 1) seen :[7]
Current structural bounds on expressions (after cover walk) : Max Seen:[7] Max Struct:[+inf]
[2025-06-01 07:26:14] [INFO ] Flow matrix only has 117 transitions (discarded 74 similar events)
// Phase 1: matrix 117 rows 76 cols
[2025-06-01 07:26:14] [INFO ] Computed 3 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[7] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 1432 ms. (697 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 575 ms. (1736 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[7] Max Struct:[+inf]
[2025-06-01 07:26:16] [INFO ] Flow matrix only has 117 transitions (discarded 74 similar events)
[2025-06-01 07:26:16] [INFO ] Invariant cache hit.
[2025-06-01 07:26:16] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 07:26:16] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2025-06-01 07:26:16] [INFO ] State equation strengthened by 18 read => feed constraints.
[2025-06-01 07:26:16] [INFO ] [Real]Added 18 Read/Feed constraints in 5 ms returned sat
[2025-06-01 07:26:16] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 07:26:16] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 07:26:16] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2025-06-01 07:26:16] [INFO ] [Nat]Added 18 Read/Feed constraints in 10 ms returned sat
[2025-06-01 07:26:16] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 2 ms to minimize.
[2025-06-01 07:26:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 86 ms
[2025-06-01 07:26:16] [INFO ] Computed and/alt/rep : 61/197/52 causal constraints (skipped 63 transitions) in 13 ms.
[2025-06-01 07:26:16] [INFO ] Added : 13 causal constraints over 7 iterations in 102 ms. Result :sat
Minimization took 41 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[7] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[7] Max Struct:[+inf]
Support contains 1 out of 76 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 76/76 places, 191/191 transitions.
Applied a total of 0 rules in 4 ms. Remains 76 /76 variables (removed 0) and now considering 191/191 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 76/76 places, 191/191 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 76/76 places, 191/191 transitions.
Applied a total of 0 rules in 3 ms. Remains 76 /76 variables (removed 0) and now considering 191/191 (removed 0) transitions.
[2025-06-01 07:26:16] [INFO ] Flow matrix only has 117 transitions (discarded 74 similar events)
[2025-06-01 07:26:16] [INFO ] Invariant cache hit.
[2025-06-01 07:26:16] [INFO ] Implicit Places using invariants in 137 ms returned []
[2025-06-01 07:26:16] [INFO ] Flow matrix only has 117 transitions (discarded 74 similar events)
[2025-06-01 07:26:16] [INFO ] Invariant cache hit.
[2025-06-01 07:26:16] [INFO ] State equation strengthened by 18 read => feed constraints.
[2025-06-01 07:26:16] [INFO ] Implicit Places using invariants and state equation in 266 ms returned []
Implicit Place search using SMT with State Equation took 405 ms to find 0 implicit places.
[2025-06-01 07:26:16] [INFO ] Redundant transitions in 1 ms returned []
Running 189 sub problems to find dead transitions.
[2025-06-01 07:26:16] [INFO ] Flow matrix only has 117 transitions (discarded 74 similar events)
[2025-06-01 07:26:16] [INFO ] Invariant cache hit.
[2025-06-01 07:26:16] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 2 (OVERLAPS) 117/193 variables, 76/79 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 18/97 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 5 (OVERLAPS) 0/193 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 189 unsolved
No progress, stopping.
After SMT solving in domain Real declared 193/193 variables, and 97 constraints, problems are : Problem set: 0 solved, 189 unsolved in 5483 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 76/76 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 189/189 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 189 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 2 (OVERLAPS) 117/193 variables, 76/79 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 18/97 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 189/286 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 6 (OVERLAPS) 0/193 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 189 unsolved
No progress, stopping.
After SMT solving in domain Int declared 193/193 variables, and 286 constraints, problems are : Problem set: 0 solved, 189 unsolved in 7469 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 76/76 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 189/189 constraints, Known Traps: 0/0 constraints]
After SMT, in 13134ms problems are : Problem set: 0 solved, 189 unsolved
Search for dead transitions found 0 dead transitions in 13137ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13555 ms. Remains : 76/76 places, 191/191 transitions.
[2025-06-01 07:26:30] [INFO ] Flow matrix only has 117 transitions (discarded 74 similar events)
Found an invariant !
This invariant on transitions {31=1, 56=1, 102=1, 115=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {31=1, 56=1, 86=1, 112=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[7] Max Struct:[+inf]
[2025-06-01 07:26:30] [INFO ] Flatten gal took : 9 ms
[2025-06-01 07:26:30] [INFO ] Flatten gal took : 26 ms
[2025-06-01 07:26:30] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1344672132930674646.gal : 1 ms
[2025-06-01 07:26:30] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18031208363376636114.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/ReachabilityCardinality1344672132930674646.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality18031208363376636114.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/ReachabilityCardinality18031208363376636114.prop.
RANDOM walk for 30265 steps (6 resets) in 131 ms. (229 steps per ms) remains 0/1 properties
ITS runner timed out or was interrupted.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 31
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[7] Max Struct:[+inf]
Ending property specific reduction for FunctionPointer-PT-b008-UpperBounds-03 in 16788 ms.
Starting property specific reduction for FunctionPointer-PT-b008-UpperBounds-06
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:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2025-06-01 07:26:30] [INFO ] Flow matrix only has 172 transitions (discarded 88 similar events)
// Phase 1: matrix 172 rows 107 cols
[2025-06-01 07:26:30] [INFO ] Computed 2 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (2 resets) in 15 ms. (625 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5] Max Struct:[+inf]
[2025-06-01 07:26:30] [INFO ] Flow matrix only has 172 transitions (discarded 88 similar events)
[2025-06-01 07:26:30] [INFO ] Invariant cache hit.
[2025-06-01 07:26:30] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2025-06-01 07:26:30] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 07:26:30] [INFO ] [Real]Absence check using state equation in 77 ms returned sat
[2025-06-01 07:26:30] [INFO ] State equation strengthened by 35 read => feed constraints.
[2025-06-01 07:26:30] [INFO ] [Real]Added 35 Read/Feed constraints in 9 ms returned sat
[2025-06-01 07:26:30] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 07:26:30] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2025-06-01 07:26:30] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 07:26:30] [INFO ] [Nat]Absence check using state equation in 78 ms returned sat
[2025-06-01 07:26:30] [INFO ] [Nat]Added 35 Read/Feed constraints in 11 ms returned sat
[2025-06-01 07:26:30] [INFO ] Computed and/alt/rep : 38/99/35 causal constraints (skipped 135 transitions) in 15 ms.
[2025-06-01 07:26:30] [INFO ] Added : 9 causal constraints over 4 iterations in 92 ms. Result :sat
Minimization took 57 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[5] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5] Max Struct:[+inf]
Support contains 1 out of 107 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 107/107 places, 260/260 transitions.
Graph (complete) has 444 edges and 107 vertex of which 98 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.0 ms
Discarding 9 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 98 transition count 244
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 20 place count 95 transition count 236
Iterating global reduction 1 with 3 rules applied. Total rules applied 23 place count 95 transition count 236
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 25 place count 95 transition count 234
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 28 place count 92 transition count 226
Iterating global reduction 2 with 3 rules applied. Total rules applied 31 place count 92 transition count 226
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 33 place count 90 transition count 220
Iterating global reduction 2 with 2 rules applied. Total rules applied 35 place count 90 transition count 220
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 37 place count 88 transition count 216
Iterating global reduction 2 with 2 rules applied. Total rules applied 39 place count 88 transition count 216
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 41 place count 86 transition count 212
Iterating global reduction 2 with 2 rules applied. Total rules applied 43 place count 86 transition count 212
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 45 place count 84 transition count 208
Iterating global reduction 2 with 2 rules applied. Total rules applied 47 place count 84 transition count 208
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 49 place count 82 transition count 204
Iterating global reduction 2 with 2 rules applied. Total rules applied 51 place count 82 transition count 204
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 53 place count 80 transition count 200
Iterating global reduction 2 with 2 rules applied. Total rules applied 55 place count 80 transition count 200
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 56 place count 79 transition count 198
Iterating global reduction 2 with 1 rules applied. Total rules applied 57 place count 79 transition count 198
Applied a total of 57 rules in 20 ms. Remains 79 /107 variables (removed 28) and now considering 198/260 (removed 62) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 79/107 places, 198/260 transitions.
[2025-06-01 07:26:30] [INFO ] Flow matrix only has 122 transitions (discarded 76 similar events)
Found an invariant !
This invariant on transitions {31=1, 60=1, 106=1, 121=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {30=1, 59=1, 105=1, 120=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 1) seen :[4]
Current structural bounds on expressions (after cover walk) : Max Seen:[5] Max Struct:[+inf]
[2025-06-01 07:26:30] [INFO ] Flow matrix only has 122 transitions (discarded 76 similar events)
// Phase 1: matrix 122 rows 79 cols
[2025-06-01 07:26:30] [INFO ] Computed 3 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[5] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 1547 ms. (645 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 626 ms. (1594 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[583] Max Struct:[+inf]
[2025-06-01 07:26:33] [INFO ] Flow matrix only has 122 transitions (discarded 76 similar events)
[2025-06-01 07:26:33] [INFO ] Invariant cache hit.
[2025-06-01 07:26:33] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 07:26:33] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2025-06-01 07:26:33] [INFO ] State equation strengthened by 18 read => feed constraints.
[2025-06-01 07:26:33] [INFO ] [Real]Added 18 Read/Feed constraints in 5 ms returned sat
[2025-06-01 07:26:33] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 07:26:33] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 07:26:33] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2025-06-01 07:26:33] [INFO ] [Nat]Added 18 Read/Feed constraints in 5 ms returned sat
[2025-06-01 07:26:33] [INFO ] Computed and/alt/rep : 59/192/53 causal constraints (skipped 67 transitions) in 10 ms.
[2025-06-01 07:26:33] [INFO ] Added : 15 causal constraints over 4 iterations in 78 ms. Result :sat
Minimization took 48 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[583] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[583] Max Struct:[+inf]
Support contains 1 out of 79 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 79/79 places, 198/198 transitions.
Applied a total of 0 rules in 2 ms. Remains 79 /79 variables (removed 0) and now considering 198/198 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 79/79 places, 198/198 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 79/79 places, 198/198 transitions.
Applied a total of 0 rules in 2 ms. Remains 79 /79 variables (removed 0) and now considering 198/198 (removed 0) transitions.
[2025-06-01 07:26:34] [INFO ] Flow matrix only has 122 transitions (discarded 76 similar events)
[2025-06-01 07:26:34] [INFO ] Invariant cache hit.
[2025-06-01 07:26:35] [INFO ] Implicit Places using invariants in 140 ms returned []
[2025-06-01 07:26:35] [INFO ] Flow matrix only has 122 transitions (discarded 76 similar events)
[2025-06-01 07:26:35] [INFO ] Invariant cache hit.
[2025-06-01 07:26:35] [INFO ] State equation strengthened by 18 read => feed constraints.
[2025-06-01 07:26:35] [INFO ] Implicit Places using invariants and state equation in 290 ms returned []
Implicit Place search using SMT with State Equation took 432 ms to find 0 implicit places.
[2025-06-01 07:26:35] [INFO ] Redundant transitions in 1 ms returned []
Running 196 sub problems to find dead transitions.
[2025-06-01 07:26:35] [INFO ] Flow matrix only has 122 transitions (discarded 76 similar events)
[2025-06-01 07:26:35] [INFO ] Invariant cache hit.
[2025-06-01 07:26:35] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/79 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (OVERLAPS) 122/201 variables, 79/82 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/201 variables, 18/100 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (OVERLAPS) 0/201 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Real declared 201/201 variables, and 100 constraints, problems are : Problem set: 0 solved, 196 unsolved in 5845 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 79/79 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 196 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/79 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (OVERLAPS) 122/201 variables, 79/82 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/201 variables, 18/100 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 196/296 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/201 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (OVERLAPS) 0/201 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Int declared 201/201 variables, and 296 constraints, problems are : Problem set: 0 solved, 196 unsolved in 6493 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 79/79 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 0/0 constraints]
After SMT, in 12548ms problems are : Problem set: 0 solved, 196 unsolved
Search for dead transitions found 0 dead transitions in 12552ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13002 ms. Remains : 79/79 places, 198/198 transitions.
[2025-06-01 07:26:47] [INFO ] Flow matrix only has 122 transitions (discarded 76 similar events)
Found an invariant !
This invariant on transitions {31=1, 60=1, 106=1, 121=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {30=1, 59=1, 105=1, 120=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :[11]
Current structural bounds on expressions (after cover walk) : Max Seen:[583] Max Struct:[+inf]
[2025-06-01 07:26:47] [INFO ] Flow matrix only has 122 transitions (discarded 76 similar events)
[2025-06-01 07:26:47] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[583] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 1256 ms. (795 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 623 ms. (1602 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[695] Max Struct:[+inf]
[2025-06-01 07:26:49] [INFO ] Flow matrix only has 122 transitions (discarded 76 similar events)
[2025-06-01 07:26:49] [INFO ] Invariant cache hit.
[2025-06-01 07:26:49] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-01 07:26:49] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2025-06-01 07:26:49] [INFO ] State equation strengthened by 18 read => feed constraints.
[2025-06-01 07:26:49] [INFO ] [Real]Added 18 Read/Feed constraints in 8 ms returned sat
[2025-06-01 07:26:49] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 07:26:50] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 07:26:50] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2025-06-01 07:26:50] [INFO ] [Nat]Added 18 Read/Feed constraints in 8 ms returned sat
[2025-06-01 07:26:50] [INFO ] Computed and/alt/rep : 59/192/53 causal constraints (skipped 67 transitions) in 11 ms.
[2025-06-01 07:26:50] [INFO ] Added : 15 causal constraints over 4 iterations in 80 ms. Result :sat
Minimization took 48 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[695] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[695] Max Struct:[+inf]
Support contains 1 out of 79 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 79/79 places, 198/198 transitions.
Applied a total of 0 rules in 5 ms. Remains 79 /79 variables (removed 0) and now considering 198/198 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 79/79 places, 198/198 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 79/79 places, 198/198 transitions.
Applied a total of 0 rules in 3 ms. Remains 79 /79 variables (removed 0) and now considering 198/198 (removed 0) transitions.
[2025-06-01 07:26:51] [INFO ] Flow matrix only has 122 transitions (discarded 76 similar events)
[2025-06-01 07:26:51] [INFO ] Invariant cache hit.
[2025-06-01 07:26:52] [INFO ] Implicit Places using invariants in 133 ms returned []
[2025-06-01 07:26:52] [INFO ] Flow matrix only has 122 transitions (discarded 76 similar events)
[2025-06-01 07:26:52] [INFO ] Invariant cache hit.
[2025-06-01 07:26:52] [INFO ] State equation strengthened by 18 read => feed constraints.
[2025-06-01 07:26:52] [INFO ] Implicit Places using invariants and state equation in 238 ms returned []
Implicit Place search using SMT with State Equation took 373 ms to find 0 implicit places.
[2025-06-01 07:26:52] [INFO ] Redundant transitions in 1 ms returned []
Running 196 sub problems to find dead transitions.
[2025-06-01 07:26:52] [INFO ] Flow matrix only has 122 transitions (discarded 76 similar events)
[2025-06-01 07:26:52] [INFO ] Invariant cache hit.
[2025-06-01 07:26:52] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/79 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (OVERLAPS) 122/201 variables, 79/82 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/201 variables, 18/100 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (OVERLAPS) 0/201 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Real declared 201/201 variables, and 100 constraints, problems are : Problem set: 0 solved, 196 unsolved in 6601 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 79/79 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 196 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/79 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (OVERLAPS) 122/201 variables, 79/82 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/201 variables, 18/100 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 196/296 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/201 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (OVERLAPS) 0/201 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Int declared 201/201 variables, and 296 constraints, problems are : Problem set: 0 solved, 196 unsolved in 7586 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 79/79 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 0/0 constraints]
After SMT, in 14402ms problems are : Problem set: 0 solved, 196 unsolved
Search for dead transitions found 0 dead transitions in 14407ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14791 ms. Remains : 79/79 places, 198/198 transitions.
[2025-06-01 07:27:06] [INFO ] Flow matrix only has 122 transitions (discarded 76 similar events)
Found an invariant !
This invariant on transitions {31=1, 60=1, 106=1, 121=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {30=1, 59=1, 105=1, 120=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 1) seen :[5]
Current structural bounds on expressions (after cover walk) : Max Seen:[695] Max Struct:[+inf]
[2025-06-01 07:27:06] [INFO ] Flow matrix only has 122 transitions (discarded 76 similar events)
[2025-06-01 07:27:06] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[695] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 1598 ms. (625 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 621 ms. (1607 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[751] Max Struct:[+inf]
[2025-06-01 07:27:09] [INFO ] Flow matrix only has 122 transitions (discarded 76 similar events)
[2025-06-01 07:27:09] [INFO ] Invariant cache hit.
[2025-06-01 07:27:09] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 07:27:09] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2025-06-01 07:27:09] [INFO ] State equation strengthened by 18 read => feed constraints.
[2025-06-01 07:27:09] [INFO ] [Real]Added 18 Read/Feed constraints in 8 ms returned sat
[2025-06-01 07:27:09] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 07:27:09] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 07:27:09] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2025-06-01 07:27:09] [INFO ] [Nat]Added 18 Read/Feed constraints in 6 ms returned sat
[2025-06-01 07:27:09] [INFO ] Computed and/alt/rep : 59/192/53 causal constraints (skipped 67 transitions) in 12 ms.
[2025-06-01 07:27:09] [INFO ] Added : 15 causal constraints over 4 iterations in 86 ms. Result :sat
Minimization took 48 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[751] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[751] Max Struct:[+inf]
Support contains 1 out of 79 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 79/79 places, 198/198 transitions.
Applied a total of 0 rules in 3 ms. Remains 79 /79 variables (removed 0) and now considering 198/198 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 79/79 places, 198/198 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 79/79 places, 198/198 transitions.
Applied a total of 0 rules in 3 ms. Remains 79 /79 variables (removed 0) and now considering 198/198 (removed 0) transitions.
[2025-06-01 07:27:11] [INFO ] Flow matrix only has 122 transitions (discarded 76 similar events)
[2025-06-01 07:27:11] [INFO ] Invariant cache hit.
[2025-06-01 07:27:12] [INFO ] Implicit Places using invariants in 103 ms returned []
[2025-06-01 07:27:12] [INFO ] Flow matrix only has 122 transitions (discarded 76 similar events)
[2025-06-01 07:27:12] [INFO ] Invariant cache hit.
[2025-06-01 07:27:12] [INFO ] State equation strengthened by 18 read => feed constraints.
[2025-06-01 07:27:12] [INFO ] Implicit Places using invariants and state equation in 266 ms returned []
Implicit Place search using SMT with State Equation took 371 ms to find 0 implicit places.
[2025-06-01 07:27:12] [INFO ] Redundant transitions in 0 ms returned []
Running 196 sub problems to find dead transitions.
[2025-06-01 07:27:12] [INFO ] Flow matrix only has 122 transitions (discarded 76 similar events)
[2025-06-01 07:27:12] [INFO ] Invariant cache hit.
[2025-06-01 07:27:12] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/79 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (OVERLAPS) 122/201 variables, 79/82 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/201 variables, 18/100 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (OVERLAPS) 0/201 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Real declared 201/201 variables, and 100 constraints, problems are : Problem set: 0 solved, 196 unsolved in 5082 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 79/79 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 196 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/79 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (OVERLAPS) 122/201 variables, 79/82 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/201 variables, 18/100 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 196/296 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/201 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (OVERLAPS) 0/201 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Int declared 201/201 variables, and 296 constraints, problems are : Problem set: 0 solved, 196 unsolved in 7510 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 79/79 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 0/0 constraints]
After SMT, in 12719ms problems are : Problem set: 0 solved, 196 unsolved
Search for dead transitions found 0 dead transitions in 12722ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13103 ms. Remains : 79/79 places, 198/198 transitions.
[2025-06-01 07:27:25] [INFO ] Flow matrix only has 122 transitions (discarded 76 similar events)
Found an invariant !
This invariant on transitions {31=1, 60=1, 106=1, 121=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {30=1, 59=1, 105=1, 120=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :[5]
Current structural bounds on expressions (after cover walk) : Max Seen:[751] Max Struct:[+inf]
[2025-06-01 07:27:25] [INFO ] Flow matrix only has 122 transitions (discarded 76 similar events)
[2025-06-01 07:27:25] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[751] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 1289 ms. (775 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 756 ms. (1321 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[751] Max Struct:[+inf]
[2025-06-01 07:27:27] [INFO ] Flow matrix only has 122 transitions (discarded 76 similar events)
[2025-06-01 07:27:27] [INFO ] Invariant cache hit.
[2025-06-01 07:27:27] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 07:27:27] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2025-06-01 07:27:27] [INFO ] State equation strengthened by 18 read => feed constraints.
[2025-06-01 07:27:27] [INFO ] [Real]Added 18 Read/Feed constraints in 5 ms returned sat
[2025-06-01 07:27:27] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 07:27:27] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 07:27:27] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2025-06-01 07:27:27] [INFO ] [Nat]Added 18 Read/Feed constraints in 8 ms returned sat
[2025-06-01 07:27:27] [INFO ] Computed and/alt/rep : 59/192/53 causal constraints (skipped 67 transitions) in 11 ms.
[2025-06-01 07:27:27] [INFO ] Added : 15 causal constraints over 4 iterations in 75 ms. Result :sat
Minimization took 30 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[751] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[751] Max Struct:[+inf]
Support contains 1 out of 79 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 79/79 places, 198/198 transitions.
Applied a total of 0 rules in 3 ms. Remains 79 /79 variables (removed 0) and now considering 198/198 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 79/79 places, 198/198 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 79/79 places, 198/198 transitions.
Applied a total of 0 rules in 3 ms. Remains 79 /79 variables (removed 0) and now considering 198/198 (removed 0) transitions.
[2025-06-01 07:27:29] [INFO ] Flow matrix only has 122 transitions (discarded 76 similar events)
[2025-06-01 07:27:29] [INFO ] Invariant cache hit.
[2025-06-01 07:27:29] [INFO ] Implicit Places using invariants in 133 ms returned []
[2025-06-01 07:27:29] [INFO ] Flow matrix only has 122 transitions (discarded 76 similar events)
[2025-06-01 07:27:29] [INFO ] Invariant cache hit.
[2025-06-01 07:27:29] [INFO ] State equation strengthened by 18 read => feed constraints.
[2025-06-01 07:27:29] [INFO ] Implicit Places using invariants and state equation in 190 ms returned []
Implicit Place search using SMT with State Equation took 325 ms to find 0 implicit places.
[2025-06-01 07:27:29] [INFO ] Redundant transitions in 1 ms returned []
Running 196 sub problems to find dead transitions.
[2025-06-01 07:27:29] [INFO ] Flow matrix only has 122 transitions (discarded 76 similar events)
[2025-06-01 07:27:29] [INFO ] Invariant cache hit.
[2025-06-01 07:27:29] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/79 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (OVERLAPS) 122/201 variables, 79/82 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/201 variables, 18/100 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (OVERLAPS) 0/201 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Real declared 201/201 variables, and 100 constraints, problems are : Problem set: 0 solved, 196 unsolved in 4648 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 79/79 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 196 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/79 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (OVERLAPS) 122/201 variables, 79/82 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/201 variables, 18/100 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 196/296 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/201 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (OVERLAPS) 0/201 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Int declared 201/201 variables, and 296 constraints, problems are : Problem set: 0 solved, 196 unsolved in 7084 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 79/79 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 0/0 constraints]
After SMT, in 11942ms problems are : Problem set: 0 solved, 196 unsolved
Search for dead transitions found 0 dead transitions in 11944ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12280 ms. Remains : 79/79 places, 198/198 transitions.
[2025-06-01 07:27:41] [INFO ] Flow matrix only has 122 transitions (discarded 76 similar events)
Found an invariant !
This invariant on transitions {31=1, 60=1, 106=1, 121=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {30=1, 59=1, 105=1, 120=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[751] Max Struct:[+inf]
[2025-06-01 07:27:41] [INFO ] Flatten gal took : 22 ms
RANDOM walk for 40001 steps (8 resets) in 115 ms. (344 steps per ms) remains 1/1 properties
[2025-06-01 07:27:41] [INFO ] Flatten gal took : 27 ms
[2025-06-01 07:27:41] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality570424271505595241.gal : 3 ms
[2025-06-01 07:27:41] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4936164830081215410.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/ReachabilityCardinality570424271505595241.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4936164830081215410.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 40003 steps (8 resets) in 47 ms. (833 steps per ms) remains 1/1 properties
Loading property file /tmp/ReachabilityCardinality4936164830081215410.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 31
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :31 after 1042
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1042 after 147135
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :147135 after 3.74715e+07
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :3.74715e+07 after 1.1456e+08
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1.1456e+08 after 2.91137e+08
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :2.91137e+08 after 1.90699e+10
Interrupted probabilistic random walk after 1505093 steps, run timeout after 3001 ms. (steps per millisecond=501 ) properties seen :0 out of 1
Probabilistic random walk after 1505093 steps, saw 936741 distinct states, run finished after 3001 ms. (steps per millisecond=501 ) properties seen :0
[2025-06-01 07:27:44] [INFO ] Flow matrix only has 122 transitions (discarded 76 similar events)
[2025-06-01 07:27:44] [INFO ] Invariant cache hit.
[2025-06-01 07:27:44] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 71/75 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 7/82 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/82 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/82 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1.90699e+10 after 1.03061e+11
At refinement iteration 9 (OVERLAPS) 100/182 variables, 57/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/182 variables, 17/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/182 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 6/188 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/188 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 10/198 variables, 10/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/198 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 3/201 variables, 2/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/201 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/201 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 201/201 variables, and 100 constraints, problems are : Problem set: 0 solved, 1 unsolved in 103 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 79/79 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 71/75 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/82 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/82 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/82 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 100/182 variables, 57/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/182 variables, 17/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/182 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 6/188 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/188 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 10/198 variables, 10/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/198 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 3/201 variables, 2/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/201 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/201 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 201/201 variables, and 101 constraints, problems are : Problem set: 0 solved, 1 unsolved in 103 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 79/79 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 233ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1417 ms.
Support contains 1 out of 79 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 79/79 places, 198/198 transitions.
Applied a total of 0 rules in 3 ms. Remains 79 /79 variables (removed 0) and now considering 198/198 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 79/79 places, 198/198 transitions.
RANDOM walk for 40000 steps (8 resets) in 101 ms. (392 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 34 ms. (1142 steps per ms) remains 1/1 properties
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1.03061e+11 after 2.70718e+11
Interrupted probabilistic random walk after 1554040 steps, run timeout after 3001 ms. (steps per millisecond=517 ) properties seen :0 out of 1
Probabilistic random walk after 1554040 steps, saw 967209 distinct states, run finished after 3001 ms. (steps per millisecond=517 ) properties seen :0
[2025-06-01 07:27:49] [INFO ] Flow matrix only has 122 transitions (discarded 76 similar events)
[2025-06-01 07:27:49] [INFO ] Invariant cache hit.
[2025-06-01 07:27:49] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 71/75 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 7/82 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/82 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/82 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 100/182 variables, 57/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/182 variables, 17/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/182 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 6/188 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/188 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 10/198 variables, 10/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/198 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 3/201 variables, 2/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/201 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/201 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 201/201 variables, and 100 constraints, problems are : Problem set: 0 solved, 1 unsolved in 111 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 79/79 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 71/75 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/82 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/82 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/82 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 100/182 variables, 57/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/182 variables, 17/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/182 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 6/188 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/188 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 10/198 variables, 10/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/198 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 3/201 variables, 2/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/201 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/201 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 201/201 variables, and 101 constraints, problems are : Problem set: 0 solved, 1 unsolved in 110 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 79/79 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 225ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1419 ms.
Support contains 1 out of 79 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 79/79 places, 198/198 transitions.
Applied a total of 0 rules in 3 ms. Remains 79 /79 variables (removed 0) and now considering 198/198 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 79/79 places, 198/198 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 79/79 places, 198/198 transitions.
Applied a total of 0 rules in 3 ms. Remains 79 /79 variables (removed 0) and now considering 198/198 (removed 0) transitions.
[2025-06-01 07:27:51] [INFO ] Flow matrix only has 122 transitions (discarded 76 similar events)
[2025-06-01 07:27:51] [INFO ] Invariant cache hit.
[2025-06-01 07:27:51] [INFO ] Implicit Places using invariants in 86 ms returned []
[2025-06-01 07:27:51] [INFO ] Flow matrix only has 122 transitions (discarded 76 similar events)
[2025-06-01 07:27:51] [INFO ] Invariant cache hit.
[2025-06-01 07:27:51] [INFO ] State equation strengthened by 18 read => feed constraints.
[2025-06-01 07:27:51] [INFO ] Implicit Places using invariants and state equation in 171 ms returned []
Implicit Place search using SMT with State Equation took 259 ms to find 0 implicit places.
[2025-06-01 07:27:51] [INFO ] Redundant transitions in 0 ms returned []
Running 196 sub problems to find dead transitions.
[2025-06-01 07:27:51] [INFO ] Flow matrix only has 122 transitions (discarded 76 similar events)
[2025-06-01 07:27:51] [INFO ] Invariant cache hit.
[2025-06-01 07:27:51] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/79 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (OVERLAPS) 122/201 variables, 79/82 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/201 variables, 18/100 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (OVERLAPS) 0/201 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Real declared 201/201 variables, and 100 constraints, problems are : Problem set: 0 solved, 196 unsolved in 4019 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 79/79 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 196 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/79 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (OVERLAPS) 122/201 variables, 79/82 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/201 variables, 18/100 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 196/296 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/201 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (OVERLAPS) 0/201 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Int declared 201/201 variables, and 296 constraints, problems are : Problem set: 0 solved, 196 unsolved in 6205 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 79/79 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 0/0 constraints]
After SMT, in 10351ms problems are : Problem set: 0 solved, 196 unsolved
Search for dead transitions found 0 dead transitions in 10354ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10621 ms. Remains : 79/79 places, 198/198 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 76 transitions
Reduce isomorphic transitions removed 76 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 84 rules applied. Total rules applied 84 place count 79 transition count 114
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 92 place count 71 transition count 114
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 92 place count 71 transition count 101
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 118 place count 58 transition count 101
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 150 place count 42 transition count 85
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 157 place count 35 transition count 71
Iterating global reduction 2 with 7 rules applied. Total rules applied 164 place count 35 transition count 71
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 171 place count 28 transition count 57
Iterating global reduction 2 with 7 rules applied. Total rules applied 178 place count 28 transition count 57
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 185 place count 21 transition count 43
Iterating global reduction 2 with 7 rules applied. Total rules applied 192 place count 21 transition count 43
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 199 place count 21 transition count 36
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 199 place count 21 transition count 35
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 201 place count 20 transition count 35
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 3 with 2 rules applied. Total rules applied 203 place count 19 transition count 36
Applied a total of 203 rules in 19 ms. Remains 19 /79 variables (removed 60) and now considering 36/198 (removed 162) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 36 rows 19 cols
[2025-06-01 07:28:01] [INFO ] Computed 3 invariants in 1 ms
[2025-06-01 07:28:01] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 07:28:01] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-06-01 07:28:01] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 07:28:01] [INFO ] After 14ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2025-06-01 07:28:01] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-06-01 07:28:01] [INFO ] After 3ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-01 07:28:01] [INFO ] After 8ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-01 07:28:01] [INFO ] After 48ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2025-06-01 07:28:01] [INFO ] Flatten gal took : 2 ms
[2025-06-01 07:28:01] [INFO ] Flatten gal took : 2 ms
[2025-06-01 07:28:01] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16053986173514003670.gal : 1 ms
[2025-06-01 07:28:01] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1743497707170737296.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/ReachabilityCardinality16053986173514003670.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1743497707170737296.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/ReachabilityCardinality1743497707170737296.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 17
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :17 after 288
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :288 after 14700
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :14700 after 90900
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :90900 after 432180
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :432180 after 1.86018e+06
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1.86018e+06 after 7.68126e+06
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :7.68126e+06 after 3.1151e+07
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :2.70718e+11 after 6.05703e+11
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :3.1151e+07 after 1.25338e+08
Detected timeout of ITS tools.
[2025-06-01 07:28:16] [INFO ] Flatten gal took : 4 ms
[2025-06-01 07:28:16] [INFO ] Applying decomposition
[2025-06-01 07:28:16] [INFO ] Flatten gal took : 2 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/graph15885267819742489772.txt' '-o' '/tmp/graph15885267819742489772.bin' '-w' '/tmp/graph15885267819742489772.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15885267819742489772.bin' '-l' '-1' '-v' '-w' '/tmp/graph15885267819742489772.weights' '-q' '0' '-e' '0.001'
[2025-06-01 07:28:16] [INFO ] Decomposing Gal with order
[2025-06-01 07:28:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 07:28:16] [INFO ] Removed a total of 29 redundant transitions.
[2025-06-01 07:28:16] [INFO ] Flatten gal took : 5 ms
[2025-06-01 07:28:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 0 ms.
[2025-06-01 07:28:16] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17961058186630132052.gal : 1 ms
[2025-06-01 07:28:16] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4671157052533118433.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/ReachabilityCardinality17961058186630132052.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4671157052533118433.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/ReachabilityCardinality4671157052533118433.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 17
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :17 after 90
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :90 after 1594
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :1594 after 5000
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :5000 after 10760
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :10760 after 22280
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :22280 after 45320
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :45320 after 91400
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :91400 after 183560
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :183560 after 367880
Detected timeout of ITS tools.
[2025-06-01 07:28:31] [INFO ] Flatten gal took : 9 ms
[2025-06-01 07:28:31] [INFO ] Applying decomposition
[2025-06-01 07:28:31] [INFO ] Flatten gal took : 8 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/graph15333069197178953765.txt' '-o' '/tmp/graph15333069197178953765.bin' '-w' '/tmp/graph15333069197178953765.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15333069197178953765.bin' '-l' '-1' '-v' '-w' '/tmp/graph15333069197178953765.weights' '-q' '0' '-e' '0.001'
[2025-06-01 07:28:31] [INFO ] Decomposing Gal with order
[2025-06-01 07:28:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 07:28:31] [INFO ] Removed a total of 334 redundant transitions.
[2025-06-01 07:28:31] [INFO ] Flatten gal took : 18 ms
[2025-06-01 07:28:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 103 labels/synchronizations in 9 ms.
[2025-06-01 07:28:31] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16291597314633273561.gal : 2 ms
[2025-06-01 07:28:31] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8792171125723402915.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/ReachabilityCardinality16291597314633273561.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8792171125723402915.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/ReachabilityCardinality8792171125723402915.prop.
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 30195 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:[751] Max Struct:[+inf]
Ending property specific reduction for FunctionPointer-PT-b008-UpperBounds-06 in 121699 ms.
Starting property specific reduction for FunctionPointer-PT-b008-UpperBounds-07
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:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2025-06-01 07:28:31] [INFO ] Flow matrix only has 172 transitions (discarded 88 similar events)
// Phase 1: matrix 172 rows 107 cols
[2025-06-01 07:28:31] [INFO ] Computed 2 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (4 resets) in 14 ms. (666 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[7] Max Struct:[+inf]
[2025-06-01 07:28:31] [INFO ] Flow matrix only has 172 transitions (discarded 88 similar events)
[2025-06-01 07:28:31] [INFO ] Invariant cache hit.
[2025-06-01 07:28:32] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2025-06-01 07:28:32] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 07:28:32] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2025-06-01 07:28:32] [INFO ] State equation strengthened by 35 read => feed constraints.
[2025-06-01 07:28:32] [INFO ] [Real]Added 35 Read/Feed constraints in 7 ms returned sat
[2025-06-01 07:28:32] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 07:28:32] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2025-06-01 07:28:32] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2025-06-01 07:28:32] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2025-06-01 07:28:32] [INFO ] [Nat]Added 35 Read/Feed constraints in 8 ms returned sat
[2025-06-01 07:28:32] [INFO ] Computed and/alt/rep : 38/99/35 causal constraints (skipped 135 transitions) in 12 ms.
[2025-06-01 07:28:32] [INFO ] Added : 2 causal constraints over 1 iterations in 38 ms. Result :sat
Minimization took 37 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[7] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[7] Max Struct:[+inf]
Support contains 1 out of 107 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 107/107 places, 260/260 transitions.
Graph (complete) has 444 edges and 107 vertex of which 101 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 101 transition count 249
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 16 place count 97 transition count 239
Iterating global reduction 1 with 4 rules applied. Total rules applied 20 place count 97 transition count 239
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 22 place count 97 transition count 237
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 26 place count 93 transition count 227
Iterating global reduction 2 with 4 rules applied. Total rules applied 30 place count 93 transition count 227
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 33 place count 90 transition count 219
Iterating global reduction 2 with 3 rules applied. Total rules applied 36 place count 90 transition count 219
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 39 place count 87 transition count 213
Iterating global reduction 2 with 3 rules applied. Total rules applied 42 place count 87 transition count 213
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 45 place count 84 transition count 207
Iterating global reduction 2 with 3 rules applied. Total rules applied 48 place count 84 transition count 207
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 51 place count 81 transition count 201
Iterating global reduction 2 with 3 rules applied. Total rules applied 54 place count 81 transition count 201
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 56 place count 79 transition count 197
Iterating global reduction 2 with 2 rules applied. Total rules applied 58 place count 79 transition count 197
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 60 place count 77 transition count 193
Iterating global reduction 2 with 2 rules applied. Total rules applied 62 place count 77 transition count 193
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 63 place count 76 transition count 191
Iterating global reduction 2 with 1 rules applied. Total rules applied 64 place count 76 transition count 191
Applied a total of 64 rules in 21 ms. Remains 76 /107 variables (removed 31) and now considering 191/260 (removed 69) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 76/107 places, 191/260 transitions.
[2025-06-01 07:28:32] [INFO ] Flow matrix only has 117 transitions (discarded 74 similar events)
Found an invariant !
This invariant on transitions {31=1, 56=1, 102=1, 115=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {31=1, 56=1, 86=1, 112=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[7] Max Struct:[+inf]
[2025-06-01 07:28:32] [INFO ] Flow matrix only has 117 transitions (discarded 74 similar events)
// Phase 1: matrix 117 rows 76 cols
[2025-06-01 07:28:32] [INFO ] Computed 3 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[7] Max Struct:[+inf]
RANDOM walk for 1000001 steps (2 resets) in 1191 ms. (838 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 570 ms. (1751 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[7] Max Struct:[+inf]
[2025-06-01 07:28:34] [INFO ] Flow matrix only has 117 transitions (discarded 74 similar events)
[2025-06-01 07:28:34] [INFO ] Invariant cache hit.
[2025-06-01 07:28:34] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 07:28:34] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2025-06-01 07:28:34] [INFO ] State equation strengthened by 18 read => feed constraints.
[2025-06-01 07:28:34] [INFO ] [Real]Added 18 Read/Feed constraints in 9 ms returned sat
[2025-06-01 07:28:34] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 07:28:34] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 07:28:34] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2025-06-01 07:28:34] [INFO ] [Nat]Added 18 Read/Feed constraints in 6 ms returned sat
[2025-06-01 07:28:34] [INFO ] Deduced a trap composed of 22 places in 71 ms of which 2 ms to minimize.
[2025-06-01 07:28:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 82 ms
[2025-06-01 07:28:34] [INFO ] Computed and/alt/rep : 61/197/52 causal constraints (skipped 63 transitions) in 10 ms.
[2025-06-01 07:28:34] [INFO ] Added : 3 causal constraints over 1 iterations in 31 ms. Result :sat
Minimization took 25 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[7] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[7] Max Struct:[+inf]
Support contains 1 out of 76 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 76/76 places, 191/191 transitions.
Applied a total of 0 rules in 3 ms. Remains 76 /76 variables (removed 0) and now considering 191/191 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 76/76 places, 191/191 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 76/76 places, 191/191 transitions.
Applied a total of 0 rules in 3 ms. Remains 76 /76 variables (removed 0) and now considering 191/191 (removed 0) transitions.
[2025-06-01 07:28:34] [INFO ] Flow matrix only has 117 transitions (discarded 74 similar events)
[2025-06-01 07:28:34] [INFO ] Invariant cache hit.
[2025-06-01 07:28:34] [INFO ] Implicit Places using invariants in 95 ms returned []
[2025-06-01 07:28:34] [INFO ] Flow matrix only has 117 transitions (discarded 74 similar events)
[2025-06-01 07:28:34] [INFO ] Invariant cache hit.
[2025-06-01 07:28:34] [INFO ] State equation strengthened by 18 read => feed constraints.
[2025-06-01 07:28:34] [INFO ] Implicit Places using invariants and state equation in 283 ms returned []
Implicit Place search using SMT with State Equation took 380 ms to find 0 implicit places.
[2025-06-01 07:28:34] [INFO ] Redundant transitions in 1 ms returned []
Running 189 sub problems to find dead transitions.
[2025-06-01 07:28:34] [INFO ] Flow matrix only has 117 transitions (discarded 74 similar events)
[2025-06-01 07:28:34] [INFO ] Invariant cache hit.
[2025-06-01 07:28:34] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 2 (OVERLAPS) 117/193 variables, 76/79 constraints. Problems are: Problem set: 0 solved, 189 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 18/97 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 5 (OVERLAPS) 0/193 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 189 unsolved
No progress, stopping.
After SMT solving in domain Real declared 193/193 variables, and 97 constraints, problems are : Problem set: 0 solved, 189 unsolved in 4823 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 76/76 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 189/189 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 189 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 2 (OVERLAPS) 117/193 variables, 76/79 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 18/97 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 189/286 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 6 (OVERLAPS) 0/193 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 189 unsolved
No progress, stopping.
After SMT solving in domain Int declared 193/193 variables, and 286 constraints, problems are : Problem set: 0 solved, 189 unsolved in 5349 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 76/76 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 189/189 constraints, Known Traps: 0/0 constraints]
After SMT, in 10374ms problems are : Problem set: 0 solved, 189 unsolved
Search for dead transitions found 0 dead transitions in 10378ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10769 ms. Remains : 76/76 places, 191/191 transitions.
[2025-06-01 07:28:45] [INFO ] Flow matrix only has 117 transitions (discarded 74 similar events)
Found an invariant !
This invariant on transitions {31=1, 56=1, 102=1, 115=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {31=1, 56=1, 86=1, 112=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[7] Max Struct:[+inf]
[2025-06-01 07:28:45] [INFO ] Flatten gal took : 12 ms
RANDOM walk for 40007 steps (8 resets) in 92 ms. (430 steps per ms) remains 1/1 properties
[2025-06-01 07:28:45] [INFO ] Flatten gal took : 11 ms
[2025-06-01 07:28:45] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13883920190929223465.gal : 3 ms
BEST_FIRST walk for 30984 steps (6 resets) in 33 ms. (911 steps per ms) remains 0/1 properties
[2025-06-01 07:28:45] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12813340854899035944.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/ReachabilityCardinality13883920190929223465.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12813340854899035944.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :
ITS runner timed out or was interrupted.

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[7] Max Struct:[+inf]
Ending property specific reduction for FunctionPointer-PT-b008-UpperBounds-07 in 13547 ms.
Starting property specific reduction for FunctionPointer-PT-b008-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:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2025-06-01 07:28:45] [INFO ] Flow matrix only has 172 transitions (discarded 88 similar events)
// Phase 1: matrix 172 rows 107 cols
[2025-06-01 07:28:45] [INFO ] Computed 2 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (2 resets) in 15 ms. (625 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[+inf]
[2025-06-01 07:28:45] [INFO ] Flow matrix only has 172 transitions (discarded 88 similar events)
[2025-06-01 07:28:45] [INFO ] Invariant cache hit.
[2025-06-01 07:28:45] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2025-06-01 07:28:45] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 07:28:45] [INFO ] [Real]Absence check using state equation in 78 ms returned sat
[2025-06-01 07:28:45] [INFO ] State equation strengthened by 35 read => feed constraints.
[2025-06-01 07:28:45] [INFO ] [Real]Added 35 Read/Feed constraints in 9 ms returned sat
[2025-06-01 07:28:45] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 07:28:45] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2025-06-01 07:28:45] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 07:28:45] [INFO ] [Nat]Absence check using state equation in 76 ms returned sat
[2025-06-01 07:28:45] [INFO ] [Nat]Added 35 Read/Feed constraints in 13 ms returned sat
[2025-06-01 07:28:45] [INFO ] Computed and/alt/rep : 38/99/35 causal constraints (skipped 135 transitions) in 16 ms.
[2025-06-01 07:28:45] [INFO ] Added : 2 causal constraints over 1 iterations in 51 ms. Result :sat
Minimization took 61 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[7] Max Struct:[+inf]
Support contains 1 out of 107 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 107/107 places, 260/260 transitions.
Graph (complete) has 444 edges and 107 vertex of which 101 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 101 transition count 250
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 15 place count 97 transition count 240
Iterating global reduction 1 with 4 rules applied. Total rules applied 19 place count 97 transition count 240
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 21 place count 97 transition count 238
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 25 place count 93 transition count 228
Iterating global reduction 2 with 4 rules applied. Total rules applied 29 place count 93 transition count 228
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 32 place count 90 transition count 220
Iterating global reduction 2 with 3 rules applied. Total rules applied 35 place count 90 transition count 220
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 38 place count 87 transition count 214
Iterating global reduction 2 with 3 rules applied. Total rules applied 41 place count 87 transition count 214
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 44 place count 84 transition count 208
Iterating global reduction 2 with 3 rules applied. Total rules applied 47 place count 84 transition count 208
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 50 place count 81 transition count 202
Iterating global reduction 2 with 3 rules applied. Total rules applied 53 place count 81 transition count 202
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 55 place count 79 transition count 198
Iterating global reduction 2 with 2 rules applied. Total rules applied 57 place count 79 transition count 198
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 59 place count 77 transition count 194
Iterating global reduction 2 with 2 rules applied. Total rules applied 61 place count 77 transition count 194
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 62 place count 76 transition count 192
Iterating global reduction 2 with 1 rules applied. Total rules applied 63 place count 76 transition count 192
Applied a total of 63 rules in 31 ms. Remains 76 /107 variables (removed 31) and now considering 192/260 (removed 68) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 76/107 places, 192/260 transitions.
[2025-06-01 07:28:45] [INFO ] Flow matrix only has 118 transitions (discarded 74 similar events)
Found an invariant !
This invariant on transitions {32=1, 57=1, 103=1, 116=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {29=1, 54=1, 84=1, 113=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 11 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 1) seen :[4]
Current structural bounds on expressions (after cover walk) : Max Seen:[7] Max Struct:[+inf]
[2025-06-01 07:28:46] [INFO ] Flow matrix only has 118 transitions (discarded 74 similar events)
// Phase 1: matrix 118 rows 76 cols
[2025-06-01 07:28:46] [INFO ] Computed 2 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[7] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 1446 ms. (691 steps per ms)
BEST_FIRST walk for 1000000 steps (2 resets) in 570 ms. (1751 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[7] Max Struct:[+inf]
[2025-06-01 07:28:48] [INFO ] Flow matrix only has 118 transitions (discarded 74 similar events)
[2025-06-01 07:28:48] [INFO ] Invariant cache hit.
[2025-06-01 07:28:48] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2025-06-01 07:28:48] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 07:28:48] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2025-06-01 07:28:48] [INFO ] State equation strengthened by 18 read => feed constraints.
[2025-06-01 07:28:48] [INFO ] [Real]Added 18 Read/Feed constraints in 6 ms returned sat
[2025-06-01 07:28:48] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 07:28:48] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-01 07:28:48] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-01 07:28:48] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2025-06-01 07:28:48] [INFO ] [Nat]Added 18 Read/Feed constraints in 6 ms returned sat
[2025-06-01 07:28:48] [INFO ] Computed and/alt/rep : 62/198/53 causal constraints (skipped 63 transitions) in 11 ms.
[2025-06-01 07:28:48] [INFO ] Added : 6 causal constraints over 3 iterations in 52 ms. Result :sat
Minimization took 24 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[7] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[7] Max Struct:[+inf]
Support contains 1 out of 76 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 76/76 places, 192/192 transitions.
Applied a total of 0 rules in 5 ms. Remains 76 /76 variables (removed 0) and now considering 192/192 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 76/76 places, 192/192 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 76/76 places, 192/192 transitions.
Applied a total of 0 rules in 4 ms. Remains 76 /76 variables (removed 0) and now considering 192/192 (removed 0) transitions.
[2025-06-01 07:28:48] [INFO ] Flow matrix only has 118 transitions (discarded 74 similar events)
[2025-06-01 07:28:48] [INFO ] Invariant cache hit.
[2025-06-01 07:28:48] [INFO ] Implicit Places using invariants in 120 ms returned []
[2025-06-01 07:28:48] [INFO ] Flow matrix only has 118 transitions (discarded 74 similar events)
[2025-06-01 07:28:48] [INFO ] Invariant cache hit.
[2025-06-01 07:28:48] [INFO ] State equation strengthened by 18 read => feed constraints.
[2025-06-01 07:28:48] [INFO ] Implicit Places using invariants and state equation in 216 ms returned []
Implicit Place search using SMT with State Equation took 342 ms to find 0 implicit places.
[2025-06-01 07:28:48] [INFO ] Redundant transitions in 1 ms returned []
Running 190 sub problems to find dead transitions.
[2025-06-01 07:28:48] [INFO ] Flow matrix only has 118 transitions (discarded 74 similar events)
[2025-06-01 07:28:48] [INFO ] Invariant cache hit.
[2025-06-01 07:28:48] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (OVERLAPS) 118/194 variables, 76/78 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/194 variables, 18/96 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/194 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 6 (OVERLAPS) 0/194 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Real declared 194/194 variables, and 96 constraints, problems are : Problem set: 0 solved, 190 unsolved in 6147 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 76/76 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 190 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (OVERLAPS) 118/194 variables, 76/78 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/194 variables, 18/96 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/194 variables, 190/286 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/194 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 7 (OVERLAPS) 0/194 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Int declared 194/194 variables, and 286 constraints, problems are : Problem set: 0 solved, 190 unsolved in 7299 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 76/76 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 0/0 constraints]
After SMT, in 13652ms problems are : Problem set: 0 solved, 190 unsolved
Search for dead transitions found 0 dead transitions in 13656ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14010 ms. Remains : 76/76 places, 192/192 transitions.
[2025-06-01 07:29:02] [INFO ] Flow matrix only has 118 transitions (discarded 74 similar events)
Found an invariant !
This invariant on transitions {32=1, 57=1, 103=1, 116=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {29=1, 54=1, 84=1, 113=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 4 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[7] Max Struct:[+inf]
RANDOM walk for 23646 steps (5 resets) in 46 ms. (503 steps per ms) remains 0/1 properties
[2025-06-01 07:29:02] [INFO ] Flatten gal took : 11 ms
[2025-06-01 07:29:02] [INFO ] Flatten gal took : 12 ms
[2025-06-01 07:29:02] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7586753413683923874.gal : 2 ms
[2025-06-01 07:29:02] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8090764654033140572.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/ReachabilityCardinality7586753413683923874.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8090764654033140572.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
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
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[7] Max Struct:[+inf]
Ending property specific reduction for FunctionPointer-PT-b008-UpperBounds-09 in 17111 ms.
Starting property specific reduction for FunctionPointer-PT-b008-UpperBounds-12
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:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2025-06-01 07:29:02] [INFO ] Flow matrix only has 172 transitions (discarded 88 similar events)
// Phase 1: matrix 172 rows 107 cols
[2025-06-01 07:29:02] [INFO ] Computed 2 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (3 resets) in 14 ms. (666 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[7] Max Struct:[+inf]
[2025-06-01 07:29:02] [INFO ] Flow matrix only has 172 transitions (discarded 88 similar events)
[2025-06-01 07:29:02] [INFO ] Invariant cache hit.
[2025-06-01 07:29:02] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2025-06-01 07:29:02] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 07:29:02] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2025-06-01 07:29:02] [INFO ] State equation strengthened by 35 read => feed constraints.
[2025-06-01 07:29:02] [INFO ] [Real]Added 35 Read/Feed constraints in 6 ms returned sat
[2025-06-01 07:29:02] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 07:29:02] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2025-06-01 07:29:02] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 07:29:02] [INFO ] [Nat]Absence check using state equation in 76 ms returned sat
[2025-06-01 07:29:02] [INFO ] [Nat]Added 35 Read/Feed constraints in 11 ms returned sat
[2025-06-01 07:29:02] [INFO ] Computed and/alt/rep : 38/99/35 causal constraints (skipped 135 transitions) in 15 ms.
[2025-06-01 07:29:02] [INFO ] Added : 2 causal constraints over 1 iterations in 49 ms. Result :sat
Minimization took 59 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[7] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[7] Max Struct:[+inf]
Support contains 1 out of 107 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 107/107 places, 260/260 transitions.
Graph (complete) has 444 edges and 107 vertex of which 101 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 101 transition count 249
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 16 place count 97 transition count 239
Iterating global reduction 1 with 4 rules applied. Total rules applied 20 place count 97 transition count 239
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 22 place count 97 transition count 237
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 26 place count 93 transition count 227
Iterating global reduction 2 with 4 rules applied. Total rules applied 30 place count 93 transition count 227
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 33 place count 90 transition count 219
Iterating global reduction 2 with 3 rules applied. Total rules applied 36 place count 90 transition count 219
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 39 place count 87 transition count 213
Iterating global reduction 2 with 3 rules applied. Total rules applied 42 place count 87 transition count 213
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 45 place count 84 transition count 207
Iterating global reduction 2 with 3 rules applied. Total rules applied 48 place count 84 transition count 207
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 51 place count 81 transition count 201
Iterating global reduction 2 with 3 rules applied. Total rules applied 54 place count 81 transition count 201
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 56 place count 79 transition count 197
Iterating global reduction 2 with 2 rules applied. Total rules applied 58 place count 79 transition count 197
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 60 place count 77 transition count 193
Iterating global reduction 2 with 2 rules applied. Total rules applied 62 place count 77 transition count 193
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 63 place count 76 transition count 191
Iterating global reduction 2 with 1 rules applied. Total rules applied 64 place count 76 transition count 191
Applied a total of 64 rules in 14 ms. Remains 76 /107 variables (removed 31) and now considering 191/260 (removed 69) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 76/107 places, 191/260 transitions.
[2025-06-01 07:29:03] [INFO ] Flow matrix only has 117 transitions (discarded 74 similar events)
Found an invariant !
This invariant on transitions {31=1, 56=1, 102=1, 115=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {31=1, 56=1, 86=1, 112=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[7] Max Struct:[+inf]
[2025-06-01 07:29:03] [INFO ] Flow matrix only has 117 transitions (discarded 74 similar events)
// Phase 1: matrix 117 rows 76 cols
[2025-06-01 07:29:03] [INFO ] Computed 3 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[7] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 1342 ms. (744 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 710 ms. (1406 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[7] Max Struct:[+inf]
[2025-06-01 07:29:05] [INFO ] Flow matrix only has 117 transitions (discarded 74 similar events)
[2025-06-01 07:29:05] [INFO ] Invariant cache hit.
[2025-06-01 07:29:05] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 07:29:05] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2025-06-01 07:29:05] [INFO ] State equation strengthened by 18 read => feed constraints.
[2025-06-01 07:29:05] [INFO ] [Real]Added 18 Read/Feed constraints in 10 ms returned sat
[2025-06-01 07:29:05] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 07:29:05] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 07:29:05] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2025-06-01 07:29:05] [INFO ] [Nat]Added 18 Read/Feed constraints in 9 ms returned sat
[2025-06-01 07:29:05] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 2 ms to minimize.
[2025-06-01 07:29:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 91 ms
[2025-06-01 07:29:05] [INFO ] Computed and/alt/rep : 61/197/52 causal constraints (skipped 63 transitions) in 13 ms.
[2025-06-01 07:29:05] [INFO ] Added : 4 causal constraints over 2 iterations in 52 ms. Result :sat
Minimization took 37 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[7] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[7] Max Struct:[+inf]
Support contains 1 out of 76 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 76/76 places, 191/191 transitions.
Applied a total of 0 rules in 4 ms. Remains 76 /76 variables (removed 0) and now considering 191/191 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 76/76 places, 191/191 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 76/76 places, 191/191 transitions.
Applied a total of 0 rules in 4 ms. Remains 76 /76 variables (removed 0) and now considering 191/191 (removed 0) transitions.
[2025-06-01 07:29:05] [INFO ] Flow matrix only has 117 transitions (discarded 74 similar events)
[2025-06-01 07:29:05] [INFO ] Invariant cache hit.
[2025-06-01 07:29:05] [INFO ] Implicit Places using invariants in 152 ms returned []
[2025-06-01 07:29:05] [INFO ] Flow matrix only has 117 transitions (discarded 74 similar events)
[2025-06-01 07:29:05] [INFO ] Invariant cache hit.
[2025-06-01 07:29:05] [INFO ] State equation strengthened by 18 read => feed constraints.
[2025-06-01 07:29:06] [INFO ] Implicit Places using invariants and state equation in 273 ms returned []
Implicit Place search using SMT with State Equation took 433 ms to find 0 implicit places.
[2025-06-01 07:29:06] [INFO ] Redundant transitions in 1 ms returned []
Running 189 sub problems to find dead transitions.
[2025-06-01 07:29:06] [INFO ] Flow matrix only has 117 transitions (discarded 74 similar events)
[2025-06-01 07:29:06] [INFO ] Invariant cache hit.
[2025-06-01 07:29:06] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 2 (OVERLAPS) 117/193 variables, 76/79 constraints. Problems are: Problem set: 0 solved, 189 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 18/97 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 5 (OVERLAPS) 0/193 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 189 unsolved
No progress, stopping.
After SMT solving in domain Real declared 193/193 variables, and 97 constraints, problems are : Problem set: 0 solved, 189 unsolved in 5101 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 76/76 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 189/189 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 189 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 2 (OVERLAPS) 117/193 variables, 76/79 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 18/97 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 189/286 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 6 (OVERLAPS) 0/193 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 189 unsolved
No progress, stopping.
After SMT solving in domain Int declared 193/193 variables, and 286 constraints, problems are : Problem set: 0 solved, 189 unsolved in 7091 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 76/76 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 189/189 constraints, Known Traps: 0/0 constraints]
After SMT, in 12401ms problems are : Problem set: 0 solved, 189 unsolved
Search for dead transitions found 0 dead transitions in 12408ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12858 ms. Remains : 76/76 places, 191/191 transitions.
[2025-06-01 07:29:18] [INFO ] Flow matrix only has 117 transitions (discarded 74 similar events)
Found an invariant !
This invariant on transitions {31=1, 56=1, 102=1, 115=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {31=1, 56=1, 86=1, 112=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :[3]
Current structural bounds on expressions (after cover walk) : Max Seen:[7] Max Struct:[+inf]
[2025-06-01 07:29:18] [INFO ] Flatten gal took : 18 ms
RANDOM walk for 40000 steps (8 resets) in 91 ms. (434 steps per ms) remains 1/1 properties
[2025-06-01 07:29:18] [INFO ] Flatten gal took : 13 ms
[2025-06-01 07:29:18] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9191054384443642197.gal : 2 ms
BEST_FIRST walk for 38502 steps (8 resets) in 40 ms. (939 steps per ms) remains 0/1 properties
[2025-06-01 07:29:18] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality170684890637074081.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/ReachabilityCardinality9191054384443642197.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality170684890637074081.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
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:[7] Max Struct:[+inf]
Ending property specific reduction for FunctionPointer-PT-b008-UpperBounds-12 in 16055 ms.
Starting property specific reduction for FunctionPointer-PT-b008-UpperBounds-13
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:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2025-06-01 07:29:18] [INFO ] Flow matrix only has 172 transitions (discarded 88 similar events)
// Phase 1: matrix 172 rows 107 cols
[2025-06-01 07:29:18] [INFO ] Computed 2 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10001 steps (2 resets) in 15 ms. (625 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[8] Max Struct:[+inf]
[2025-06-01 07:29:18] [INFO ] Flow matrix only has 172 transitions (discarded 88 similar events)
[2025-06-01 07:29:18] [INFO ] Invariant cache hit.
[2025-06-01 07:29:18] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2025-06-01 07:29:18] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 07:29:18] [INFO ] [Real]Absence check using state equation in 64 ms returned sat
[2025-06-01 07:29:18] [INFO ] State equation strengthened by 35 read => feed constraints.
[2025-06-01 07:29:18] [INFO ] [Real]Added 35 Read/Feed constraints in 8 ms returned sat
[2025-06-01 07:29:18] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 07:29:18] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2025-06-01 07:29:18] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 07:29:18] [INFO ] [Nat]Absence check using state equation in 83 ms returned sat
[2025-06-01 07:29:18] [INFO ] [Nat]Added 35 Read/Feed constraints in 9 ms returned sat
[2025-06-01 07:29:18] [INFO ] Computed and/alt/rep : 38/99/35 causal constraints (skipped 135 transitions) in 15 ms.
[2025-06-01 07:29:19] [INFO ] Added : 1 causal constraints over 1 iterations in 48 ms. Result :sat
Minimization took 54 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[8] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[8] Max Struct:[+inf]
Support contains 1 out of 107 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 107/107 places, 260/260 transitions.
Graph (complete) has 444 edges and 107 vertex of which 98 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 98 transition count 244
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 20 place count 95 transition count 236
Iterating global reduction 1 with 3 rules applied. Total rules applied 23 place count 95 transition count 236
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 26 place count 92 transition count 228
Iterating global reduction 1 with 3 rules applied. Total rules applied 29 place count 92 transition count 228
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 32 place count 89 transition count 220
Iterating global reduction 1 with 3 rules applied. Total rules applied 35 place count 89 transition count 220
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 38 place count 86 transition count 214
Iterating global reduction 1 with 3 rules applied. Total rules applied 41 place count 86 transition count 214
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 44 place count 83 transition count 208
Iterating global reduction 1 with 3 rules applied. Total rules applied 47 place count 83 transition count 208
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 50 place count 80 transition count 202
Iterating global reduction 1 with 3 rules applied. Total rules applied 53 place count 80 transition count 202
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 55 place count 78 transition count 198
Iterating global reduction 1 with 2 rules applied. Total rules applied 57 place count 78 transition count 198
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 59 place count 76 transition count 194
Iterating global reduction 1 with 2 rules applied. Total rules applied 61 place count 76 transition count 194
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 62 place count 75 transition count 192
Iterating global reduction 1 with 1 rules applied. Total rules applied 63 place count 75 transition count 192
Applied a total of 63 rules in 15 ms. Remains 75 /107 variables (removed 32) and now considering 192/260 (removed 68) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 75/107 places, 192/260 transitions.
[2025-06-01 07:29:19] [INFO ] Flow matrix only has 117 transitions (discarded 75 similar events)
Found an invariant !
This invariant on transitions {27=1, 55=1, 100=1, 116=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {25=1, 53=1, 98=1, 115=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 1) seen :[3]
Current structural bounds on expressions (after cover walk) : Max Seen:[8] Max Struct:[+inf]
[2025-06-01 07:29:19] [INFO ] Flow matrix only has 117 transitions (discarded 75 similar events)
// Phase 1: matrix 117 rows 75 cols
[2025-06-01 07:29:19] [INFO ] Computed 3 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[8] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 1513 ms. (660 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 614 ms. (1626 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[805] Max Struct:[+inf]
[2025-06-01 07:29:21] [INFO ] Flow matrix only has 117 transitions (discarded 75 similar events)
[2025-06-01 07:29:21] [INFO ] Invariant cache hit.
[2025-06-01 07:29:21] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 07:29:21] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2025-06-01 07:29:21] [INFO ] State equation strengthened by 17 read => feed constraints.
[2025-06-01 07:29:21] [INFO ] [Real]Added 17 Read/Feed constraints in 4 ms returned sat
[2025-06-01 07:29:21] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 07:29:21] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 07:29:21] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2025-06-01 07:29:21] [INFO ] [Nat]Added 17 Read/Feed constraints in 4 ms returned sat
[2025-06-01 07:29:21] [INFO ] Computed and/alt/rep : 60/196/52 causal constraints (skipped 63 transitions) in 9 ms.
[2025-06-01 07:29:21] [INFO ] Added : 6 causal constraints over 4 iterations in 48 ms. Result :sat
Minimization took 23 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[805] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[805] Max Struct:[+inf]
Support contains 1 out of 75 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 192/192 transitions.
Applied a total of 0 rules in 2 ms. Remains 75 /75 variables (removed 0) and now considering 192/192 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 75/75 places, 192/192 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 192/192 transitions.
Applied a total of 0 rules in 3 ms. Remains 75 /75 variables (removed 0) and now considering 192/192 (removed 0) transitions.
[2025-06-01 07:29:22] [INFO ] Flow matrix only has 117 transitions (discarded 75 similar events)
[2025-06-01 07:29:22] [INFO ] Invariant cache hit.
[2025-06-01 07:29:22] [INFO ] Implicit Places using invariants in 96 ms returned []
[2025-06-01 07:29:22] [INFO ] Flow matrix only has 117 transitions (discarded 75 similar events)
[2025-06-01 07:29:22] [INFO ] Invariant cache hit.
[2025-06-01 07:29:23] [INFO ] State equation strengthened by 17 read => feed constraints.
[2025-06-01 07:29:23] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 249 ms to find 0 implicit places.
[2025-06-01 07:29:23] [INFO ] Redundant transitions in 0 ms returned []
Running 190 sub problems to find dead transitions.
[2025-06-01 07:29:23] [INFO ] Flow matrix only has 117 transitions (discarded 75 similar events)
[2025-06-01 07:29:23] [INFO ] Invariant cache hit.
[2025-06-01 07:29:23] [INFO ] State equation strengthened by 17 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (OVERLAPS) 117/192 variables, 75/78 constraints. Problems are: Problem set: 0 solved, 190 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/192 variables, 17/95 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2025-06-01 07:29:26] [INFO ] Deduced a trap composed of 35 places in 74 ms of which 1 ms to minimize.
At refinement iteration 5 (OVERLAPS) 0/192 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 7 (OVERLAPS) 0/192 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 96 constraints, problems are : Problem set: 0 solved, 190 unsolved in 5894 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 75/75 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 190 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (OVERLAPS) 117/192 variables, 75/79 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 17/96 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/192 variables, 190/286 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 7 (OVERLAPS) 0/192 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/192 variables, and 286 constraints, problems are : Problem set: 0 solved, 190 unsolved in 6175 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 75/75 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 1/1 constraints]
After SMT, in 12186ms problems are : Problem set: 0 solved, 190 unsolved
Search for dead transitions found 0 dead transitions in 12188ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12446 ms. Remains : 75/75 places, 192/192 transitions.
[2025-06-01 07:29:35] [INFO ] Flow matrix only has 117 transitions (discarded 75 similar events)
Found an invariant !
This invariant on transitions {27=1, 55=1, 100=1, 116=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {25=1, 53=1, 98=1, 115=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :[5]
Current structural bounds on expressions (after cover walk) : Max Seen:[805] Max Struct:[+inf]
[2025-06-01 07:29:35] [INFO ] Flow matrix only has 117 transitions (discarded 75 similar events)
[2025-06-01 07:29:35] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[805] Max Struct:[+inf]
RANDOM walk for 1000004 steps (2 resets) in 1215 ms. (822 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 563 ms. (1773 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[857] Max Struct:[+inf]
[2025-06-01 07:29:37] [INFO ] Flow matrix only has 117 transitions (discarded 75 similar events)
[2025-06-01 07:29:37] [INFO ] Invariant cache hit.
[2025-06-01 07:29:37] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-01 07:29:37] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2025-06-01 07:29:37] [INFO ] State equation strengthened by 17 read => feed constraints.
[2025-06-01 07:29:37] [INFO ] [Real]Added 17 Read/Feed constraints in 4 ms returned sat
[2025-06-01 07:29:37] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 07:29:37] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 07:29:37] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2025-06-01 07:29:37] [INFO ] [Nat]Added 17 Read/Feed constraints in 7 ms returned sat
[2025-06-01 07:29:37] [INFO ] Computed and/alt/rep : 60/196/52 causal constraints (skipped 63 transitions) in 11 ms.
[2025-06-01 07:29:37] [INFO ] Added : 6 causal constraints over 4 iterations in 65 ms. Result :sat
Minimization took 38 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[857] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[857] Max Struct:[+inf]
Support contains 1 out of 75 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 192/192 transitions.
Applied a total of 0 rules in 3 ms. Remains 75 /75 variables (removed 0) and now considering 192/192 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 75/75 places, 192/192 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 192/192 transitions.
Applied a total of 0 rules in 2 ms. Remains 75 /75 variables (removed 0) and now considering 192/192 (removed 0) transitions.
[2025-06-01 07:29:38] [INFO ] Flow matrix only has 117 transitions (discarded 75 similar events)
[2025-06-01 07:29:38] [INFO ] Invariant cache hit.
[2025-06-01 07:29:38] [INFO ] Implicit Places using invariants in 98 ms returned []
[2025-06-01 07:29:38] [INFO ] Flow matrix only has 117 transitions (discarded 75 similar events)
[2025-06-01 07:29:38] [INFO ] Invariant cache hit.
[2025-06-01 07:29:38] [INFO ] State equation strengthened by 17 read => feed constraints.
[2025-06-01 07:29:38] [INFO ] Implicit Places using invariants and state equation in 292 ms returned []
Implicit Place search using SMT with State Equation took 392 ms to find 0 implicit places.
[2025-06-01 07:29:38] [INFO ] Redundant transitions in 1 ms returned []
Running 190 sub problems to find dead transitions.
[2025-06-01 07:29:38] [INFO ] Flow matrix only has 117 transitions (discarded 75 similar events)
[2025-06-01 07:29:38] [INFO ] Invariant cache hit.
[2025-06-01 07:29:38] [INFO ] State equation strengthened by 17 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (OVERLAPS) 117/192 variables, 75/78 constraints. Problems are: Problem set: 0 solved, 190 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/192 variables, 17/95 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2025-06-01 07:29:43] [INFO ] Deduced a trap composed of 35 places in 82 ms of which 2 ms to minimize.
At refinement iteration 5 (OVERLAPS) 0/192 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 7 (OVERLAPS) 0/192 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 96 constraints, problems are : Problem set: 0 solved, 190 unsolved in 8336 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 75/75 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 190 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (OVERLAPS) 117/192 variables, 75/79 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 17/96 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/192 variables, 190/286 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 7 (OVERLAPS) 0/192 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/192 variables, and 286 constraints, problems are : Problem set: 0 solved, 190 unsolved in 7793 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 75/75 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 1/1 constraints]
After SMT, in 16327ms problems are : Problem set: 0 solved, 190 unsolved
Search for dead transitions found 0 dead transitions in 16330ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16733 ms. Remains : 75/75 places, 192/192 transitions.
[2025-06-01 07:29:55] [INFO ] Flow matrix only has 117 transitions (discarded 75 similar events)
Found an invariant !
This invariant on transitions {27=1, 55=1, 100=1, 116=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {25=1, 53=1, 98=1, 115=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :[3]
Current structural bounds on expressions (after cover walk) : Max Seen:[857] Max Struct:[+inf]
[2025-06-01 07:29:55] [INFO ] Flow matrix only has 117 transitions (discarded 75 similar events)
[2025-06-01 07:29:55] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[857] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 1603 ms. (623 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 1023 ms. (976 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[857] Max Struct:[+inf]
[2025-06-01 07:29:58] [INFO ] Flow matrix only has 117 transitions (discarded 75 similar events)
[2025-06-01 07:29:58] [INFO ] Invariant cache hit.
[2025-06-01 07:29:58] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 07:29:58] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2025-06-01 07:29:58] [INFO ] State equation strengthened by 17 read => feed constraints.
[2025-06-01 07:29:58] [INFO ] [Real]Added 17 Read/Feed constraints in 5 ms returned sat
[2025-06-01 07:29:58] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 07:29:58] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 07:29:58] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2025-06-01 07:29:58] [INFO ] [Nat]Added 17 Read/Feed constraints in 4 ms returned sat
[2025-06-01 07:29:58] [INFO ] Computed and/alt/rep : 60/196/52 causal constraints (skipped 63 transitions) in 10 ms.
[2025-06-01 07:29:58] [INFO ] Added : 6 causal constraints over 4 iterations in 50 ms. Result :sat
Minimization took 23 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[857] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[857] Max Struct:[+inf]
Support contains 1 out of 75 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 192/192 transitions.
Applied a total of 0 rules in 3 ms. Remains 75 /75 variables (removed 0) and now considering 192/192 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 75/75 places, 192/192 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 192/192 transitions.
Applied a total of 0 rules in 3 ms. Remains 75 /75 variables (removed 0) and now considering 192/192 (removed 0) transitions.
[2025-06-01 07:29:59] [INFO ] Flow matrix only has 117 transitions (discarded 75 similar events)
[2025-06-01 07:29:59] [INFO ] Invariant cache hit.
[2025-06-01 07:29:59] [INFO ] Implicit Places using invariants in 94 ms returned []
[2025-06-01 07:29:59] [INFO ] Flow matrix only has 117 transitions (discarded 75 similar events)
[2025-06-01 07:29:59] [INFO ] Invariant cache hit.
[2025-06-01 07:29:59] [INFO ] State equation strengthened by 17 read => feed constraints.
[2025-06-01 07:29:59] [INFO ] Implicit Places using invariants and state equation in 250 ms returned []
Implicit Place search using SMT with State Equation took 359 ms to find 0 implicit places.
[2025-06-01 07:30:00] [INFO ] Redundant transitions in 1 ms returned []
Running 190 sub problems to find dead transitions.
[2025-06-01 07:30:00] [INFO ] Flow matrix only has 117 transitions (discarded 75 similar events)
[2025-06-01 07:30:00] [INFO ] Invariant cache hit.
[2025-06-01 07:30:00] [INFO ] State equation strengthened by 17 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (OVERLAPS) 117/192 variables, 75/78 constraints. Problems are: Problem set: 0 solved, 190 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/192 variables, 17/95 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2025-06-01 07:30:04] [INFO ] Deduced a trap composed of 35 places in 81 ms of which 2 ms to minimize.
At refinement iteration 5 (OVERLAPS) 0/192 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 7 (OVERLAPS) 0/192 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 96 constraints, problems are : Problem set: 0 solved, 190 unsolved in 7955 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 75/75 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 190 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (OVERLAPS) 117/192 variables, 75/79 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 17/96 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/192 variables, 190/286 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 7 (OVERLAPS) 0/192 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/192 variables, and 286 constraints, problems are : Problem set: 0 solved, 190 unsolved in 5507 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 75/75 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 1/1 constraints]
After SMT, in 13662ms problems are : Problem set: 0 solved, 190 unsolved
Search for dead transitions found 0 dead transitions in 13666ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14048 ms. Remains : 75/75 places, 192/192 transitions.
[2025-06-01 07:30:13] [INFO ] Flow matrix only has 117 transitions (discarded 75 similar events)
Found an invariant !
This invariant on transitions {27=1, 55=1, 100=1, 116=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {25=1, 53=1, 98=1, 115=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :[3]
Current structural bounds on expressions (after cover walk) : Max Seen:[857] Max Struct:[+inf]
[2025-06-01 07:30:13] [INFO ] Flatten gal took : 11 ms
RANDOM walk for 40003 steps (8 resets) in 88 ms. (449 steps per ms) remains 1/1 properties
[2025-06-01 07:30:13] [INFO ] Flatten gal took : 11 ms
[2025-06-01 07:30:13] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7116946596479482211.gal : 8 ms
[2025-06-01 07:30:13] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6985495266378704825.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/ReachabilityCardinality7116946596479482211.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6985495266378704825.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
BEST_FIRST walk for 40004 steps (8 resets) in 36 ms. (1081 steps per ms) remains 1/1 properties
Loading property file /tmp/ReachabilityCardinality6985495266378704825.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 31
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :31 after 1037
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1037 after 143587
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :143587 after 3.29101e+07
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :3.29101e+07 after 9.13562e+07
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :9.13562e+07 after 1.42209e+08
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1.42209e+08 after 5.597e+08
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :5.597e+08 after 7.2014e+10
Interrupted probabilistic random walk after 1757109 steps, run timeout after 3001 ms. (steps per millisecond=585 ) properties seen :0 out of 1
Probabilistic random walk after 1757109 steps, saw 1101352 distinct states, run finished after 3001 ms. (steps per millisecond=585 ) properties seen :0
[2025-06-01 07:30:16] [INFO ] Flow matrix only has 117 transitions (discarded 75 similar events)
[2025-06-01 07:30:16] [INFO ] Invariant cache hit.
[2025-06-01 07:30:16] [INFO ] State equation strengthened by 17 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/11 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 65/76 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/76 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/76 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 3/79 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/79 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/79 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 90/169 variables, 50/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/169 variables, 16/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/169 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 6/175 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/175 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 10/185 variables, 9/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/185 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 4/189 variables, 2/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/189 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 3/192 variables, 2/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/192 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/192 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 95 constraints, problems are : Problem set: 0 solved, 1 unsolved in 119 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 75/75 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/11 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 65/76 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/76 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/76 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/76 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 3/79 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/79 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/79 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 90/169 variables, 50/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/169 variables, 16/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/169 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 6/175 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/175 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 10/185 variables, 9/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/185 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 4/189 variables, 2/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/189 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 3/192 variables, 2/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/192 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/192 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/192 variables, and 96 constraints, problems are : Problem set: 0 solved, 1 unsolved in 121 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 75/75 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 245ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 710 ms.
Support contains 1 out of 75 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 192/192 transitions.
Applied a total of 0 rules in 3 ms. Remains 75 /75 variables (removed 0) and now considering 192/192 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 75/75 places, 192/192 transitions.
RANDOM walk for 40000 steps (8 resets) in 60 ms. (655 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 27 ms. (1428 steps per ms) remains 1/1 properties
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :7.2014e+10 after 2.3967e+11
Interrupted probabilistic random walk after 1801514 steps, run timeout after 3001 ms. (steps per millisecond=600 ) properties seen :0 out of 1
Probabilistic random walk after 1801514 steps, saw 1128992 distinct states, run finished after 3001 ms. (steps per millisecond=600 ) properties seen :0
[2025-06-01 07:30:20] [INFO ] Flow matrix only has 117 transitions (discarded 75 similar events)
[2025-06-01 07:30:20] [INFO ] Invariant cache hit.
[2025-06-01 07:30:20] [INFO ] State equation strengthened by 17 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/11 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 65/76 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/76 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/76 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 3/79 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/79 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/79 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 90/169 variables, 50/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/169 variables, 16/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/169 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 6/175 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/175 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 10/185 variables, 9/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/185 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 4/189 variables, 2/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/189 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 3/192 variables, 2/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/192 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/192 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 95 constraints, problems are : Problem set: 0 solved, 1 unsolved in 132 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 75/75 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/11 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 65/76 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/76 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/76 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/76 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 3/79 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/79 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/79 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 90/169 variables, 50/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/169 variables, 16/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/169 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 6/175 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/175 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 10/185 variables, 9/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/185 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 4/189 variables, 2/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/189 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 3/192 variables, 2/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/192 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/192 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/192 variables, and 96 constraints, problems are : Problem set: 0 solved, 1 unsolved in 99 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 75/75 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 235ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 683 ms.
Support contains 1 out of 75 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 192/192 transitions.
Applied a total of 0 rules in 2 ms. Remains 75 /75 variables (removed 0) and now considering 192/192 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 75/75 places, 192/192 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 192/192 transitions.
Applied a total of 0 rules in 3 ms. Remains 75 /75 variables (removed 0) and now considering 192/192 (removed 0) transitions.
[2025-06-01 07:30:21] [INFO ] Flow matrix only has 117 transitions (discarded 75 similar events)
[2025-06-01 07:30:21] [INFO ] Invariant cache hit.
[2025-06-01 07:30:21] [INFO ] Implicit Places using invariants in 101 ms returned []
[2025-06-01 07:30:21] [INFO ] Flow matrix only has 117 transitions (discarded 75 similar events)
[2025-06-01 07:30:21] [INFO ] Invariant cache hit.
[2025-06-01 07:30:21] [INFO ] State equation strengthened by 17 read => feed constraints.
[2025-06-01 07:30:22] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 273 ms to find 0 implicit places.
[2025-06-01 07:30:22] [INFO ] Redundant transitions in 1 ms returned []
Running 190 sub problems to find dead transitions.
[2025-06-01 07:30:22] [INFO ] Flow matrix only has 117 transitions (discarded 75 similar events)
[2025-06-01 07:30:22] [INFO ] Invariant cache hit.
[2025-06-01 07:30:22] [INFO ] State equation strengthened by 17 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (OVERLAPS) 117/192 variables, 75/78 constraints. Problems are: Problem set: 0 solved, 190 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/192 variables, 17/95 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2025-06-01 07:30:25] [INFO ] Deduced a trap composed of 35 places in 48 ms of which 1 ms to minimize.
At refinement iteration 5 (OVERLAPS) 0/192 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 7 (OVERLAPS) 0/192 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 96 constraints, problems are : Problem set: 0 solved, 190 unsolved in 5867 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 75/75 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 190 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (OVERLAPS) 117/192 variables, 75/79 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 17/96 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/192 variables, 190/286 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 7 (OVERLAPS) 0/192 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/192 variables, and 286 constraints, problems are : Problem set: 0 solved, 190 unsolved in 6482 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 75/75 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 1/1 constraints]
After SMT, in 12466ms problems are : Problem set: 0 solved, 190 unsolved
Search for dead transitions found 0 dead transitions in 12469ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12750 ms. Remains : 75/75 places, 192/192 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 75 transitions
Reduce isomorphic transitions removed 75 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 81 rules applied. Total rules applied 81 place count 75 transition count 111
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 87 place count 69 transition count 111
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 87 place count 69 transition count 100
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 109 place count 58 transition count 100
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 143 place count 41 transition count 83
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 150 place count 34 transition count 69
Iterating global reduction 2 with 7 rules applied. Total rules applied 157 place count 34 transition count 69
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 164 place count 27 transition count 55
Iterating global reduction 2 with 7 rules applied. Total rules applied 171 place count 27 transition count 55
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 178 place count 20 transition count 41
Iterating global reduction 2 with 7 rules applied. Total rules applied 185 place count 20 transition count 41
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 192 place count 20 transition count 34
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 192 place count 20 transition count 33
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 194 place count 19 transition count 33
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 196 place count 18 transition count 33
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 199 place count 18 transition count 30
Applied a total of 199 rules in 29 ms. Remains 18 /75 variables (removed 57) and now considering 30/192 (removed 162) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 30 rows 18 cols
[2025-06-01 07:30:34] [INFO ] Computed 3 invariants in 0 ms
[2025-06-01 07:30:34] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-01 07:30:34] [INFO ] After 20ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2025-06-01 07:30:34] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-06-01 07:30:34] [INFO ] After 5ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2025-06-01 07:30:34] [INFO ] After 60ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-06-01 07:30:34] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 07:30:34] [INFO ] After 14ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2025-06-01 07:30:34] [INFO ] After 3ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-01 07:30:34] [INFO ] After 8ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-01 07:30:34] [INFO ] After 51ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2025-06-01 07:30:34] [INFO ] Flatten gal took : 3 ms
[2025-06-01 07:30:34] [INFO ] Flatten gal took : 2 ms
[2025-06-01 07:30:34] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10831088963980043439.gal : 21 ms
[2025-06-01 07:30:34] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality222426184190286320.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/ReachabilityCardinality10831088963980043439.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality222426184190286320.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/ReachabilityCardinality222426184190286320.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 17
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :17 after 126
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :126 after 615
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :615 after 8175
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :8175 after 23775
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :23775 after 54735
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :54735 after 116415
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :116415 after 239535
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :239535 after 485535
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :2.3967e+11 after 5.74656e+11
Detected timeout of ITS tools.
[2025-06-01 07:30:49] [INFO ] Flatten gal took : 2 ms
[2025-06-01 07:30:49] [INFO ] Applying decomposition
[2025-06-01 07:30:49] [INFO ] Flatten gal took : 1 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/graph4132188512381775530.txt' '-o' '/tmp/graph4132188512381775530.bin' '-w' '/tmp/graph4132188512381775530.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4132188512381775530.bin' '-l' '-1' '-v' '-w' '/tmp/graph4132188512381775530.weights' '-q' '0' '-e' '0.001'
[2025-06-01 07:30:49] [INFO ] Decomposing Gal with order
[2025-06-01 07:30:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 07:30:49] [INFO ] Removed a total of 22 redundant transitions.
[2025-06-01 07:30:49] [INFO ] Flatten gal took : 13 ms
[2025-06-01 07:30:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 2 ms.
[2025-06-01 07:30:49] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16136140572229653853.gal : 1 ms
[2025-06-01 07:30:49] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15166733550777783940.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/ReachabilityCardinality16136140572229653853.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15166733550777783940.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 ...309
Loading property file /tmp/ReachabilityCardinality15166733550777783940.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 17
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :17 after 90
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :90 after 651
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :651 after 34045
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :34045 after 1.17572e+06
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1.17572e+06 after 1.44276e+07
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1.44276e+07 after 1.39973e+08
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1.39973e+08 after 1.22763e+09
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1.22763e+09 after 1.02724e+10
Detected timeout of ITS tools.
[2025-06-01 07:31:03] [INFO ] Flatten gal took : 7 ms
[2025-06-01 07:31:03] [INFO ] Applying decomposition
[2025-06-01 07:31:03] [INFO ] Flatten gal took : 6 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/graph12424337911275084026.txt' '-o' '/tmp/graph12424337911275084026.bin' '-w' '/tmp/graph12424337911275084026.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12424337911275084026.bin' '-l' '-1' '-v' '-w' '/tmp/graph12424337911275084026.weights' '-q' '0' '-e' '0.001'
[2025-06-01 07:31:03] [INFO ] Decomposing Gal with order
[2025-06-01 07:31:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 07:31:03] [INFO ] Removed a total of 322 redundant transitions.
[2025-06-01 07:31:03] [INFO ] Flatten gal took : 24 ms
[2025-06-01 07:31:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 104 labels/synchronizations in 11 ms.
[2025-06-01 07:31:04] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15046684192307552536.gal : 8 ms
[2025-06-01 07:31:04] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17947135076176270638.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/ReachabilityCardinality15046684192307552536.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17947135076176270638.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 ...309
Loading property file /tmp/ReachabilityCardinality17947135076176270638.prop.
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 30280 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:[857] Max Struct:[+inf]
Ending property specific reduction for FunctionPointer-PT-b008-UpperBounds-13 in 106156 ms.
Starting property specific reduction for FunctionPointer-PT-b008-UpperBounds-14
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:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2025-06-01 07:31:04] [INFO ] Flow matrix only has 172 transitions (discarded 88 similar events)
// Phase 1: matrix 172 rows 107 cols
[2025-06-01 07:31:04] [INFO ] Computed 2 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (3 resets) in 16 ms. (588 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[7] Max Struct:[+inf]
[2025-06-01 07:31:04] [INFO ] Flow matrix only has 172 transitions (discarded 88 similar events)
[2025-06-01 07:31:04] [INFO ] Invariant cache hit.
[2025-06-01 07:31:04] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2025-06-01 07:31:04] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 07:31:04] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2025-06-01 07:31:04] [INFO ] State equation strengthened by 35 read => feed constraints.
[2025-06-01 07:31:04] [INFO ] [Real]Added 35 Read/Feed constraints in 7 ms returned sat
[2025-06-01 07:31:04] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 07:31:05] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-01 07:31:05] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-01 07:31:05] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2025-06-01 07:31:05] [INFO ] [Nat]Added 35 Read/Feed constraints in 7 ms returned sat
[2025-06-01 07:31:05] [INFO ] Computed and/alt/rep : 38/99/35 causal constraints (skipped 135 transitions) in 13 ms.
[2025-06-01 07:31:05] [INFO ] Added : 9 causal constraints over 3 iterations in 60 ms. Result :sat
Minimization took 35 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[7] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[7] Max Struct:[+inf]
Support contains 1 out of 107 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 107/107 places, 260/260 transitions.
Graph (complete) has 444 edges and 107 vertex of which 98 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.0 ms
Discarding 9 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 98 transition count 244
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 20 place count 95 transition count 236
Iterating global reduction 1 with 3 rules applied. Total rules applied 23 place count 95 transition count 236
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 25 place count 95 transition count 234
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 28 place count 92 transition count 228
Iterating global reduction 2 with 3 rules applied. Total rules applied 31 place count 92 transition count 228
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 33 place count 90 transition count 222
Iterating global reduction 2 with 2 rules applied. Total rules applied 35 place count 90 transition count 222
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 37 place count 88 transition count 218
Iterating global reduction 2 with 2 rules applied. Total rules applied 39 place count 88 transition count 218
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 41 place count 86 transition count 214
Iterating global reduction 2 with 2 rules applied. Total rules applied 43 place count 86 transition count 214
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 45 place count 84 transition count 210
Iterating global reduction 2 with 2 rules applied. Total rules applied 47 place count 84 transition count 210
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 48 place count 83 transition count 208
Iterating global reduction 2 with 1 rules applied. Total rules applied 49 place count 83 transition count 208
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 50 place count 82 transition count 206
Iterating global reduction 2 with 1 rules applied. Total rules applied 51 place count 82 transition count 206
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 52 place count 81 transition count 204
Iterating global reduction 2 with 1 rules applied. Total rules applied 53 place count 81 transition count 204
Applied a total of 53 rules in 17 ms. Remains 81 /107 variables (removed 26) and now considering 204/260 (removed 56) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 81/107 places, 204/260 transitions.
[2025-06-01 07:31:05] [INFO ] Flow matrix only has 125 transitions (discarded 79 similar events)
Found an invariant !
This invariant on transitions {31=1, 63=1, 109=1, 123=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {31=1, 63=1, 109=1, 123=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 1) seen :[4]
Current structural bounds on expressions (after cover walk) : Max Seen:[7] Max Struct:[+inf]
[2025-06-01 07:31:05] [INFO ] Flow matrix only has 125 transitions (discarded 79 similar events)
// Phase 1: matrix 125 rows 81 cols
[2025-06-01 07:31:05] [INFO ] Computed 3 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[7] Max Struct:[+inf]
RANDOM walk for 1000002 steps (2 resets) in 1624 ms. (615 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 635 ms. (1572 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[559] Max Struct:[+inf]
[2025-06-01 07:31:07] [INFO ] Flow matrix only has 125 transitions (discarded 79 similar events)
[2025-06-01 07:31:07] [INFO ] Invariant cache hit.
[2025-06-01 07:31:07] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 07:31:07] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2025-06-01 07:31:07] [INFO ] State equation strengthened by 18 read => feed constraints.
[2025-06-01 07:31:07] [INFO ] [Real]Added 18 Read/Feed constraints in 5 ms returned sat
[2025-06-01 07:31:07] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 07:31:07] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 07:31:07] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2025-06-01 07:31:07] [INFO ] [Nat]Added 18 Read/Feed constraints in 7 ms returned sat
[2025-06-01 07:31:07] [INFO ] Deduced a trap composed of 19 places in 87 ms of which 2 ms to minimize.
[2025-06-01 07:31:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 103 ms
[2025-06-01 07:31:07] [INFO ] Computed and/alt/rep : 59/193/53 causal constraints (skipped 70 transitions) in 15 ms.
[2025-06-01 07:31:08] [INFO ] Added : 18 causal constraints over 4 iterations in 101 ms. Result :sat
Minimization took 55 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[559] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[559] Max Struct:[+inf]
Support contains 1 out of 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 204/204 transitions.
Applied a total of 0 rules in 3 ms. Remains 81 /81 variables (removed 0) and now considering 204/204 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 81/81 places, 204/204 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 204/204 transitions.
Applied a total of 0 rules in 2 ms. Remains 81 /81 variables (removed 0) and now considering 204/204 (removed 0) transitions.
[2025-06-01 07:31:10] [INFO ] Flow matrix only has 125 transitions (discarded 79 similar events)
[2025-06-01 07:31:10] [INFO ] Invariant cache hit.
[2025-06-01 07:31:10] [INFO ] Implicit Places using invariants in 142 ms returned []
[2025-06-01 07:31:10] [INFO ] Flow matrix only has 125 transitions (discarded 79 similar events)
[2025-06-01 07:31:10] [INFO ] Invariant cache hit.
[2025-06-01 07:31:10] [INFO ] State equation strengthened by 18 read => feed constraints.
[2025-06-01 07:31:10] [INFO ] Implicit Places using invariants and state equation in 231 ms returned []
Implicit Place search using SMT with State Equation took 374 ms to find 0 implicit places.
[2025-06-01 07:31:10] [INFO ] Redundant transitions in 1 ms returned []
Running 202 sub problems to find dead transitions.
[2025-06-01 07:31:10] [INFO ] Flow matrix only has 125 transitions (discarded 79 similar events)
[2025-06-01 07:31:10] [INFO ] Invariant cache hit.
[2025-06-01 07:31:10] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 2 (OVERLAPS) 125/206 variables, 81/84 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 18/102 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 5 (OVERLAPS) 0/206 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 202 unsolved
No progress, stopping.
After SMT solving in domain Real declared 206/206 variables, and 102 constraints, problems are : Problem set: 0 solved, 202 unsolved in 6596 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 81/81 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 202/202 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 202 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 2 (OVERLAPS) 125/206 variables, 81/84 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 18/102 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 202/304 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/206 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 6 (OVERLAPS) 0/206 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 202 unsolved
No progress, stopping.
After SMT solving in domain Int declared 206/206 variables, and 304 constraints, problems are : Problem set: 0 solved, 202 unsolved in 8002 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 81/81 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 202/202 constraints, Known Traps: 0/0 constraints]
After SMT, in 14813ms problems are : Problem set: 0 solved, 202 unsolved
Search for dead transitions found 0 dead transitions in 14817ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15201 ms. Remains : 81/81 places, 204/204 transitions.
[2025-06-01 07:31:25] [INFO ] Flow matrix only has 125 transitions (discarded 79 similar events)
Found an invariant !
This invariant on transitions {31=1, 63=1, 109=1, 123=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {31=1, 63=1, 109=1, 123=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :[3]
Current structural bounds on expressions (after cover walk) : Max Seen:[559] Max Struct:[+inf]
[2025-06-01 07:31:25] [INFO ] Flow matrix only has 125 transitions (discarded 79 similar events)
[2025-06-01 07:31:25] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[559] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 1479 ms. (675 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 621 ms. (1607 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[619] Max Struct:[+inf]
[2025-06-01 07:31:27] [INFO ] Flow matrix only has 125 transitions (discarded 79 similar events)
[2025-06-01 07:31:27] [INFO ] Invariant cache hit.
[2025-06-01 07:31:27] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 07:31:27] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2025-06-01 07:31:27] [INFO ] State equation strengthened by 18 read => feed constraints.
[2025-06-01 07:31:27] [INFO ] [Real]Added 18 Read/Feed constraints in 13 ms returned sat
[2025-06-01 07:31:27] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 07:31:27] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 07:31:27] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2025-06-01 07:31:27] [INFO ] [Nat]Added 18 Read/Feed constraints in 6 ms returned sat
[2025-06-01 07:31:27] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 3 ms to minimize.
[2025-06-01 07:31:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 87 ms
[2025-06-01 07:31:27] [INFO ] Computed and/alt/rep : 59/193/53 causal constraints (skipped 70 transitions) in 11 ms.
[2025-06-01 07:31:27] [INFO ] Added : 18 causal constraints over 4 iterations in 85 ms. Result :sat
Minimization took 49 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[619] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[619] Max Struct:[+inf]
Support contains 1 out of 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 204/204 transitions.
Applied a total of 0 rules in 4 ms. Remains 81 /81 variables (removed 0) and now considering 204/204 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 81/81 places, 204/204 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 204/204 transitions.
Applied a total of 0 rules in 3 ms. Remains 81 /81 variables (removed 0) and now considering 204/204 (removed 0) transitions.
[2025-06-01 07:31:29] [INFO ] Flow matrix only has 125 transitions (discarded 79 similar events)
[2025-06-01 07:31:29] [INFO ] Invariant cache hit.
[2025-06-01 07:31:29] [INFO ] Implicit Places using invariants in 131 ms returned []
[2025-06-01 07:31:29] [INFO ] Flow matrix only has 125 transitions (discarded 79 similar events)
[2025-06-01 07:31:29] [INFO ] Invariant cache hit.
[2025-06-01 07:31:29] [INFO ] State equation strengthened by 18 read => feed constraints.
[2025-06-01 07:31:29] [INFO ] Implicit Places using invariants and state equation in 200 ms returned []
Implicit Place search using SMT with State Equation took 333 ms to find 0 implicit places.
[2025-06-01 07:31:29] [INFO ] Redundant transitions in 0 ms returned []
Running 202 sub problems to find dead transitions.
[2025-06-01 07:31:29] [INFO ] Flow matrix only has 125 transitions (discarded 79 similar events)
[2025-06-01 07:31:29] [INFO ] Invariant cache hit.
[2025-06-01 07:31:29] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 2 (OVERLAPS) 125/206 variables, 81/84 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 18/102 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 5 (OVERLAPS) 0/206 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 202 unsolved
No progress, stopping.
After SMT solving in domain Real declared 206/206 variables, and 102 constraints, problems are : Problem set: 0 solved, 202 unsolved in 6507 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 81/81 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 202/202 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 202 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 2 (OVERLAPS) 125/206 variables, 81/84 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 18/102 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 202/304 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/206 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 6 (OVERLAPS) 0/206 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 202 unsolved
No progress, stopping.
After SMT solving in domain Int declared 206/206 variables, and 304 constraints, problems are : Problem set: 0 solved, 202 unsolved in 6659 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 81/81 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 202/202 constraints, Known Traps: 0/0 constraints]
After SMT, in 13293ms problems are : Problem set: 0 solved, 202 unsolved
Search for dead transitions found 0 dead transitions in 13296ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13638 ms. Remains : 81/81 places, 204/204 transitions.
[2025-06-01 07:31:43] [INFO ] Flow matrix only has 125 transitions (discarded 79 similar events)
Found an invariant !
This invariant on transitions {31=1, 63=1, 109=1, 123=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {31=1, 63=1, 109=1, 123=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 1) seen :[3]
Current structural bounds on expressions (after cover walk) : Max Seen:[619] Max Struct:[+inf]
[2025-06-01 07:31:43] [INFO ] Flow matrix only has 125 transitions (discarded 79 similar events)
[2025-06-01 07:31:43] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[619] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 1393 ms. (717 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 596 ms. (1675 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[666] Max Struct:[+inf]
[2025-06-01 07:31:45] [INFO ] Flow matrix only has 125 transitions (discarded 79 similar events)
[2025-06-01 07:31:45] [INFO ] Invariant cache hit.
[2025-06-01 07:31:45] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 07:31:45] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2025-06-01 07:31:45] [INFO ] State equation strengthened by 18 read => feed constraints.
[2025-06-01 07:31:45] [INFO ] [Real]Added 18 Read/Feed constraints in 5 ms returned sat
[2025-06-01 07:31:45] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 07:31:45] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 07:31:45] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2025-06-01 07:31:45] [INFO ] [Nat]Added 18 Read/Feed constraints in 4 ms returned sat
[2025-06-01 07:31:45] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 2 ms to minimize.
[2025-06-01 07:31:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 69 ms
[2025-06-01 07:31:45] [INFO ] Computed and/alt/rep : 59/193/53 causal constraints (skipped 70 transitions) in 9 ms.
[2025-06-01 07:31:45] [INFO ] Added : 18 causal constraints over 4 iterations in 61 ms. Result :sat
Minimization took 29 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[666] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[666] Max Struct:[+inf]
Support contains 1 out of 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 204/204 transitions.
Applied a total of 0 rules in 3 ms. Remains 81 /81 variables (removed 0) and now considering 204/204 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 81/81 places, 204/204 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 204/204 transitions.
Applied a total of 0 rules in 3 ms. Remains 81 /81 variables (removed 0) and now considering 204/204 (removed 0) transitions.
[2025-06-01 07:31:47] [INFO ] Flow matrix only has 125 transitions (discarded 79 similar events)
[2025-06-01 07:31:47] [INFO ] Invariant cache hit.
[2025-06-01 07:31:47] [INFO ] Implicit Places using invariants in 108 ms returned []
[2025-06-01 07:31:47] [INFO ] Flow matrix only has 125 transitions (discarded 79 similar events)
[2025-06-01 07:31:47] [INFO ] Invariant cache hit.
[2025-06-01 07:31:48] [INFO ] State equation strengthened by 18 read => feed constraints.
[2025-06-01 07:31:48] [INFO ] Implicit Places using invariants and state equation in 193 ms returned []
Implicit Place search using SMT with State Equation took 304 ms to find 0 implicit places.
[2025-06-01 07:31:48] [INFO ] Redundant transitions in 0 ms returned []
Running 202 sub problems to find dead transitions.
[2025-06-01 07:31:48] [INFO ] Flow matrix only has 125 transitions (discarded 79 similar events)
[2025-06-01 07:31:48] [INFO ] Invariant cache hit.
[2025-06-01 07:31:48] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 2 (OVERLAPS) 125/206 variables, 81/84 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 18/102 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 5 (OVERLAPS) 0/206 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 202 unsolved
No progress, stopping.
After SMT solving in domain Real declared 206/206 variables, and 102 constraints, problems are : Problem set: 0 solved, 202 unsolved in 6206 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 81/81 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 202/202 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 202 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 2 (OVERLAPS) 125/206 variables, 81/84 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 18/102 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 202/304 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/206 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 6 (OVERLAPS) 0/206 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 202 unsolved
No progress, stopping.
After SMT solving in domain Int declared 206/206 variables, and 304 constraints, problems are : Problem set: 0 solved, 202 unsolved in 8332 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 81/81 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 202/202 constraints, Known Traps: 0/0 constraints]
After SMT, in 14685ms problems are : Problem set: 0 solved, 202 unsolved
Search for dead transitions found 0 dead transitions in 14689ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15002 ms. Remains : 81/81 places, 204/204 transitions.
[2025-06-01 07:32:02] [INFO ] Flow matrix only has 125 transitions (discarded 79 similar events)
Found an invariant !
This invariant on transitions {31=1, 63=1, 109=1, 123=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {31=1, 63=1, 109=1, 123=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 1) seen :[4]
Current structural bounds on expressions (after cover walk) : Max Seen:[666] Max Struct:[+inf]
[2025-06-01 07:32:03] [INFO ] Flow matrix only has 125 transitions (discarded 79 similar events)
[2025-06-01 07:32:03] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[666] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 1805 ms. (553 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 619 ms. (1612 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[666] Max Struct:[+inf]
[2025-06-01 07:32:05] [INFO ] Flow matrix only has 125 transitions (discarded 79 similar events)
[2025-06-01 07:32:05] [INFO ] Invariant cache hit.
[2025-06-01 07:32:05] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-01 07:32:05] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2025-06-01 07:32:05] [INFO ] State equation strengthened by 18 read => feed constraints.
[2025-06-01 07:32:05] [INFO ] [Real]Added 18 Read/Feed constraints in 7 ms returned sat
[2025-06-01 07:32:05] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 07:32:05] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 07:32:05] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2025-06-01 07:32:05] [INFO ] [Nat]Added 18 Read/Feed constraints in 4 ms returned sat
[2025-06-01 07:32:05] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 2 ms to minimize.
[2025-06-01 07:32:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 72 ms
[2025-06-01 07:32:05] [INFO ] Computed and/alt/rep : 59/193/53 causal constraints (skipped 70 transitions) in 13 ms.
[2025-06-01 07:32:05] [INFO ] Added : 18 causal constraints over 4 iterations in 82 ms. Result :sat
Minimization took 49 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[666] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[666] Max Struct:[+inf]
Support contains 1 out of 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 204/204 transitions.
Applied a total of 0 rules in 3 ms. Remains 81 /81 variables (removed 0) and now considering 204/204 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 81/81 places, 204/204 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 204/204 transitions.
Applied a total of 0 rules in 3 ms. Remains 81 /81 variables (removed 0) and now considering 204/204 (removed 0) transitions.
[2025-06-01 07:32:07] [INFO ] Flow matrix only has 125 transitions (discarded 79 similar events)
[2025-06-01 07:32:07] [INFO ] Invariant cache hit.
[2025-06-01 07:32:08] [INFO ] Implicit Places using invariants in 141 ms returned []
[2025-06-01 07:32:08] [INFO ] Flow matrix only has 125 transitions (discarded 79 similar events)
[2025-06-01 07:32:08] [INFO ] Invariant cache hit.
[2025-06-01 07:32:08] [INFO ] State equation strengthened by 18 read => feed constraints.
[2025-06-01 07:32:08] [INFO ] Implicit Places using invariants and state equation in 261 ms returned []
Implicit Place search using SMT with State Equation took 404 ms to find 0 implicit places.
[2025-06-01 07:32:08] [INFO ] Redundant transitions in 0 ms returned []
Running 202 sub problems to find dead transitions.
[2025-06-01 07:32:08] [INFO ] Flow matrix only has 125 transitions (discarded 79 similar events)
[2025-06-01 07:32:08] [INFO ] Invariant cache hit.
[2025-06-01 07:32:08] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 2 (OVERLAPS) 125/206 variables, 81/84 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 18/102 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 5 (OVERLAPS) 0/206 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 202 unsolved
No progress, stopping.
After SMT solving in domain Real declared 206/206 variables, and 102 constraints, problems are : Problem set: 0 solved, 202 unsolved in 6083 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 81/81 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 202/202 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 202 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 2 (OVERLAPS) 125/206 variables, 81/84 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 18/102 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 202/304 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/206 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 6 (OVERLAPS) 0/206 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 202 unsolved
No progress, stopping.
After SMT solving in domain Int declared 206/206 variables, and 304 constraints, problems are : Problem set: 0 solved, 202 unsolved in 7064 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 81/81 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 202/202 constraints, Known Traps: 0/0 constraints]
After SMT, in 13371ms problems are : Problem set: 0 solved, 202 unsolved
Search for dead transitions found 0 dead transitions in 13375ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13790 ms. Remains : 81/81 places, 204/204 transitions.
[2025-06-01 07:32:21] [INFO ] Flow matrix only has 125 transitions (discarded 79 similar events)
Found an invariant !
This invariant on transitions {31=1, 63=1, 109=1, 123=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {31=1, 63=1, 109=1, 123=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[666] Max Struct:[+inf]
[2025-06-01 07:32:21] [INFO ] Flatten gal took : 12 ms
[2025-06-01 07:32:21] [INFO ] Flatten gal took : 11 ms
[2025-06-01 07:32:21] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4179748027217454062.gal : 3 ms
[2025-06-01 07:32:21] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality935872640044487907.prop : 10 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/ReachabilityCardinality4179748027217454062.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality935872640044487907.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
RANDOM walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 40 ms. (975 steps per ms) remains 1/1 properties
Loading property file /tmp/ReachabilityCardinality935872640044487907.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 31
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :31 after 1039
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1039 after 145682
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :145682 after 3.82074e+07
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :3.82074e+07 after 1.42186e+08
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1.42186e+08 after 3.10189e+08
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :3.10189e+08 after 6.03608e+08
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :6.03608e+08 after 6.57604e+10
Interrupted probabilistic random walk after 1556052 steps, run timeout after 3001 ms. (steps per millisecond=518 ) properties seen :0 out of 1
Probabilistic random walk after 1556052 steps, saw 968582 distinct states, run finished after 3001 ms. (steps per millisecond=518 ) properties seen :0
[2025-06-01 07:32:24] [INFO ] Flow matrix only has 125 transitions (discarded 79 similar events)
[2025-06-01 07:32:24] [INFO ] Invariant cache hit.
[2025-06-01 07:32:24] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/11 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 71/82 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/82 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 10/92 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/92 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/92 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 97/189 variables, 57/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/189 variables, 18/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/189 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 6/195 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/195 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 10/205 variables, 10/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/205 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1/206 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/206 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/206 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 206/206 variables, and 102 constraints, problems are : Problem set: 0 solved, 1 unsolved in 106 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 81/81 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/11 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 71/82 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/82 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/82 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 10/92 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/92 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/92 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 97/189 variables, 57/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/189 variables, 18/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/189 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 6/195 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/195 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 10/205 variables, 10/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/205 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 1/206 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/206 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/206 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 206/206 variables, and 103 constraints, problems are : Problem set: 0 solved, 1 unsolved in 108 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 81/81 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 218ms problems are : Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :6.57604e+10 after 2.1747e+11
Parikh walk visited 0 properties in 1351 ms.
Support contains 1 out of 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 204/204 transitions.
Applied a total of 0 rules in 3 ms. Remains 81 /81 variables (removed 0) and now considering 204/204 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 81/81 places, 204/204 transitions.
RANDOM walk for 40003 steps (8 resets) in 79 ms. (500 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (8 resets) in 26 ms. (1481 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1622715 steps, run timeout after 3001 ms. (steps per millisecond=540 ) properties seen :0 out of 1
Probabilistic random walk after 1622715 steps, saw 1010078 distinct states, run finished after 3001 ms. (steps per millisecond=540 ) properties seen :0
[2025-06-01 07:32:29] [INFO ] Flow matrix only has 125 transitions (discarded 79 similar events)
[2025-06-01 07:32:29] [INFO ] Invariant cache hit.
[2025-06-01 07:32:29] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/11 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 71/82 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/82 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 10/92 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/92 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/92 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 97/189 variables, 57/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/189 variables, 18/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/189 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 6/195 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/195 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 10/205 variables, 10/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/205 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1/206 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/206 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/206 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 206/206 variables, and 102 constraints, problems are : Problem set: 0 solved, 1 unsolved in 164 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 81/81 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/11 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 71/82 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/82 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/82 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 10/92 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/92 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/92 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 97/189 variables, 57/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/189 variables, 18/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/189 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 6/195 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/195 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 10/205 variables, 10/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/205 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 1/206 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/206 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/206 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 206/206 variables, and 103 constraints, problems are : Problem set: 0 solved, 1 unsolved in 100 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 81/81 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 284ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1258 ms.
Support contains 1 out of 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 204/204 transitions.
Applied a total of 0 rules in 3 ms. Remains 81 /81 variables (removed 0) and now considering 204/204 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 81/81 places, 204/204 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 204/204 transitions.
Applied a total of 0 rules in 2 ms. Remains 81 /81 variables (removed 0) and now considering 204/204 (removed 0) transitions.
[2025-06-01 07:32:31] [INFO ] Flow matrix only has 125 transitions (discarded 79 similar events)
[2025-06-01 07:32:31] [INFO ] Invariant cache hit.
[2025-06-01 07:32:31] [INFO ] Implicit Places using invariants in 153 ms returned []
[2025-06-01 07:32:31] [INFO ] Flow matrix only has 125 transitions (discarded 79 similar events)
[2025-06-01 07:32:31] [INFO ] Invariant cache hit.
[2025-06-01 07:32:31] [INFO ] State equation strengthened by 18 read => feed constraints.
[2025-06-01 07:32:31] [INFO ] Implicit Places using invariants and state equation in 266 ms returned []
Implicit Place search using SMT with State Equation took 422 ms to find 0 implicit places.
[2025-06-01 07:32:31] [INFO ] Redundant transitions in 1 ms returned []
Running 202 sub problems to find dead transitions.
[2025-06-01 07:32:31] [INFO ] Flow matrix only has 125 transitions (discarded 79 similar events)
[2025-06-01 07:32:31] [INFO ] Invariant cache hit.
[2025-06-01 07:32:31] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 2 (OVERLAPS) 125/206 variables, 81/84 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 18/102 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 5 (OVERLAPS) 0/206 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 202 unsolved
No progress, stopping.
After SMT solving in domain Real declared 206/206 variables, and 102 constraints, problems are : Problem set: 0 solved, 202 unsolved in 4385 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 81/81 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 202/202 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 202 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 2 (OVERLAPS) 125/206 variables, 81/84 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 18/102 constraints. Problems are: Problem set: 0 solved, 202 unsolved
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :2.1747e+11 after 5.20592e+11
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 202/304 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/206 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 6 (OVERLAPS) 0/206 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 202 unsolved
No progress, stopping.
After SMT solving in domain Int declared 206/206 variables, and 304 constraints, problems are : Problem set: 0 solved, 202 unsolved in 7864 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 81/81 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 202/202 constraints, Known Traps: 0/0 constraints]
After SMT, in 12376ms problems are : Problem set: 0 solved, 202 unsolved
Search for dead transitions found 0 dead transitions in 12378ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12809 ms. Remains : 81/81 places, 204/204 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 79 transitions
Reduce isomorphic transitions removed 79 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 86 rules applied. Total rules applied 86 place count 81 transition count 118
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 93 place count 74 transition count 118
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 93 place count 74 transition count 102
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 125 place count 58 transition count 102
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 155 place count 43 transition count 87
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 162 place count 36 transition count 73
Iterating global reduction 2 with 7 rules applied. Total rules applied 169 place count 36 transition count 73
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 176 place count 29 transition count 59
Iterating global reduction 2 with 7 rules applied. Total rules applied 183 place count 29 transition count 59
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 190 place count 22 transition count 45
Iterating global reduction 2 with 7 rules applied. Total rules applied 197 place count 22 transition count 45
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 204 place count 22 transition count 38
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 204 place count 22 transition count 37
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 206 place count 21 transition count 37
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 208 place count 20 transition count 37
Applied a total of 208 rules in 6 ms. Remains 20 /81 variables (removed 61) and now considering 37/204 (removed 167) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 37 rows 20 cols
[2025-06-01 07:32:43] [INFO ] Computed 3 invariants in 0 ms
[2025-06-01 07:32:43] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-01 07:32:43] [INFO ] After 15ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2025-06-01 07:32:43] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-06-01 07:32:43] [INFO ] After 5ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2025-06-01 07:32:43] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-06-01 07:32:43] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-01 07:32:43] [INFO ] After 13ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2025-06-01 07:32:43] [INFO ] After 3ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-01 07:32:43] [INFO ] After 6ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-01 07:32:43] [INFO ] After 42ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2025-06-01 07:32:43] [INFO ] Flatten gal took : 2 ms
[2025-06-01 07:32:43] [INFO ] Flatten gal took : 1 ms
[2025-06-01 07:32:43] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16638303763710445070.gal : 1 ms
[2025-06-01 07:32:43] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13777116249255177074.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/ReachabilityCardinality16638303763710445070.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13777116249255177074.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 ...330
Loading property file /tmp/ReachabilityCardinality13777116249255177074.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 17
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :17 after 288
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :288 after 14700
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :14700 after 90900
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :90900 after 432180
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :432180 after 1.86018e+06
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1.86018e+06 after 7.68126e+06
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :7.68126e+06 after 3.1151e+07
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :3.1151e+07 after 1.25338e+08
Detected timeout of ITS tools.
[2025-06-01 07:32:58] [INFO ] Flatten gal took : 2 ms
[2025-06-01 07:32:58] [INFO ] Applying decomposition
[2025-06-01 07:32:58] [INFO ] Flatten gal took : 11 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/graph2019240998211468908.txt' '-o' '/tmp/graph2019240998211468908.bin' '-w' '/tmp/graph2019240998211468908.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2019240998211468908.bin' '-l' '-1' '-v' '-w' '/tmp/graph2019240998211468908.weights' '-q' '0' '-e' '0.001'
[2025-06-01 07:32:59] [INFO ] Decomposing Gal with order
[2025-06-01 07:32:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 07:32:59] [INFO ] Removed a total of 30 redundant transitions.
[2025-06-01 07:32:59] [INFO ] Flatten gal took : 5 ms
[2025-06-01 07:32:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 1 ms.
[2025-06-01 07:32:59] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11917237155305612882.gal : 1 ms
[2025-06-01 07:32:59] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17398683678273215676.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/ReachabilityCardinality11917237155305612882.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17398683678273215676.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 ...309
Loading property file /tmp/ReachabilityCardinality17398683678273215676.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 17
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :17 after 135
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :135 after 3110
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :3110 after 13153
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :13153 after 37689
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :37689 after 174477
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :174477 after 734504
Detected timeout of ITS tools.
[2025-06-01 07:33:11] [INFO ] Flatten gal took : 7 ms
[2025-06-01 07:33:11] [INFO ] Applying decomposition
[2025-06-01 07:33:11] [INFO ] Flatten gal took : 9 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/graph3623348551665346492.txt' '-o' '/tmp/graph3623348551665346492.bin' '-w' '/tmp/graph3623348551665346492.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3623348551665346492.bin' '-l' '-1' '-v' '-w' '/tmp/graph3623348551665346492.weights' '-q' '0' '-e' '0.001'
[2025-06-01 07:33:11] [INFO ] Decomposing Gal with order
[2025-06-01 07:33:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 07:33:11] [INFO ] Removed a total of 346 redundant transitions.
[2025-06-01 07:33:11] [INFO ] Flatten gal took : 31 ms
[2025-06-01 07:33:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 109 labels/synchronizations in 3 ms.
[2025-06-01 07:33:12] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8701628423373293166.gal : 2 ms
[2025-06-01 07:33:12] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18039523390123032646.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/ReachabilityCardinality8701628423373293166.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality18039523390123032646.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/ReachabilityCardinality18039523390123032646.prop.
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 30204 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:[666] Max Struct:[+inf]
Ending property specific reduction for FunctionPointer-PT-b008-UpperBounds-14 in 129250 ms.
[2025-06-01 07:33:14] [INFO ] Flatten gal took : 8 ms
[2025-06-01 07:33:14] [INFO ] Applying decomposition
[2025-06-01 07:33:14] [INFO ] Flatten gal took : 7 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/graph13700794667507011244.txt' '-o' '/tmp/graph13700794667507011244.bin' '-w' '/tmp/graph13700794667507011244.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13700794667507011244.bin' '-l' '-1' '-v' '-w' '/tmp/graph13700794667507011244.weights' '-q' '0' '-e' '0.001'
[2025-06-01 07:33:14] [INFO ] Decomposing Gal with order
[2025-06-01 07:33:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 07:33:14] [INFO ] Removed a total of 437 redundant transitions.
[2025-06-01 07:33:14] [INFO ] Flatten gal took : 16 ms
[2025-06-01 07:33:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 152 labels/synchronizations in 3 ms.
[2025-06-01 07:33:14] [INFO ] Time to serialize gal into /tmp/UpperBounds747880062102831432.gal : 3 ms
[2025-06-01 07:33:14] [INFO ] Time to serialize properties into /tmp/UpperBounds7866301317355105661.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/UpperBounds747880062102831432.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds7866301317355105661.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 ...282
Loading property file /tmp/UpperBounds7866301317355105661.prop.
Detected timeout of ITS tools.
[2025-06-01 07:57:16] [INFO ] Flatten gal took : 9 ms
[2025-06-01 07:57:16] [INFO ] Time to serialize gal into /tmp/UpperBounds2927102776930396487.gal : 7 ms
[2025-06-01 07:57:16] [INFO ] Time to serialize properties into /tmp/UpperBounds6334429677065768996.prop : 2 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/UpperBounds2927102776930396487.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds6334429677065768996.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 ...304
Loading property file /tmp/UpperBounds6334429677065768996.prop.

BK_TIME_CONFINEMENT_REACHED

--------------------
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="FunctionPointer-PT-b008"
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 FunctionPointer-PT-b008, 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 r111-smll-174867015800010"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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