About the Execution of 2024-gold for PolyORBLF-PT-S02J06T08
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15684.780 | 3012200.00 | 3668718.00 | 10941.30 | 2 ? 1 1 1 1 1 1 1 1 1 ? 1 8 1 ? | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r167-tall-174881266100056.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 PolyORBLF-PT-S02J06T08, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r167-tall-174881266100056
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.7M
-rw-r--r-- 1 mcc users 13K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 33K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 180K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 47K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 7.5K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 36K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 35K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 168K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 40K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 209K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.3K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 10 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 807K 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 PolyORBLF-PT-S02J06T08-UpperBounds-00
FORMULA_NAME PolyORBLF-PT-S02J06T08-UpperBounds-01
FORMULA_NAME PolyORBLF-PT-S02J06T08-UpperBounds-02
FORMULA_NAME PolyORBLF-PT-S02J06T08-UpperBounds-03
FORMULA_NAME PolyORBLF-PT-S02J06T08-UpperBounds-04
FORMULA_NAME PolyORBLF-PT-S02J06T08-UpperBounds-05
FORMULA_NAME PolyORBLF-PT-S02J06T08-UpperBounds-06
FORMULA_NAME PolyORBLF-PT-S02J06T08-UpperBounds-07
FORMULA_NAME PolyORBLF-PT-S02J06T08-UpperBounds-08
FORMULA_NAME PolyORBLF-PT-S02J06T08-UpperBounds-09
FORMULA_NAME PolyORBLF-PT-S02J06T08-UpperBounds-10
FORMULA_NAME PolyORBLF-PT-S02J06T08-UpperBounds-11
FORMULA_NAME PolyORBLF-PT-S02J06T08-UpperBounds-12
FORMULA_NAME PolyORBLF-PT-S02J06T08-UpperBounds-13
FORMULA_NAME PolyORBLF-PT-S02J06T08-UpperBounds-14
FORMULA_NAME PolyORBLF-PT-S02J06T08-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1748892708176
Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S02J06T08
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-06-02 19:31:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-02 19:31:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 19:31:49] [INFO ] Load time of PNML (sax parser for PT used): 129 ms
[2025-06-02 19:31:49] [INFO ] Transformed 690 places.
[2025-06-02 19:31:49] [INFO ] Transformed 1434 transitions.
[2025-06-02 19:31:49] [INFO ] Parsed PT model containing 690 places and 1434 transitions and 6564 arcs in 238 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Ensure Unique test removed 128 transitions
Reduce redundant transitions removed 128 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 1, 0, 0, 1, 1, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 1, 0, 0, 1, 1, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2025-06-02 19:31:49] [INFO ] Flow matrix only has 1290 transitions (discarded 16 similar events)
// Phase 1: matrix 1290 rows 690 cols
[2025-06-02 19:31:49] [INFO ] Computed 54 invariants in 110 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 1, 0, 0, 1, 1, 0] Max Struct:[256, 288, 1, 363, 32, 72, 64, 64, 1, 1, 1, 36, 90, 8, 9, 36]
FORMULA PolyORBLF-PT-S02J06T08-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J06T08-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 10000 steps (3 resets) in 102 ms. (97 steps per ms)
FORMULA PolyORBLF-PT-S02J06T08-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-PT-S02J06T08-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 120007 steps (27 resets) in 509 ms. (235 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2, 2, 1, 1, 1, 1, 1, 2, 1, 7, 1, 2] Max Struct:[256, 288, 363, 32, 72, 64, 64, 36, 90, 8, 9, 36]
[2025-06-02 19:31:50] [INFO ] Flow matrix only has 1290 transitions (discarded 16 similar events)
[2025-06-02 19:31:50] [INFO ] Invariant cache hit.
[2025-06-02 19:31:50] [INFO ] [Real]Absence check using 13 positive place invariants in 17 ms returned sat
[2025-06-02 19:31:50] [INFO ] [Real]Absence check using 13 positive and 41 generalized place invariants in 27 ms returned unsat
[2025-06-02 19:31:50] [INFO ] [Real]Absence check using 13 positive place invariants in 14 ms returned sat
[2025-06-02 19:31:50] [INFO ] [Real]Absence check using 13 positive and 41 generalized place invariants in 28 ms returned sat
[2025-06-02 19:31:51] [INFO ] [Real]Absence check using state equation in 773 ms returned sat
[2025-06-02 19:31:51] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:31:51] [INFO ] [Nat]Absence check using 13 positive place invariants in 10 ms returned sat
[2025-06-02 19:31:51] [INFO ] [Nat]Absence check using 13 positive and 41 generalized place invariants in 46 ms returned sat
[2025-06-02 19:31:53] [INFO ] [Nat]Absence check using state equation in 1678 ms returned unknown
[2025-06-02 19:31:53] [INFO ] [Real]Absence check using 13 positive place invariants in 10 ms returned sat
[2025-06-02 19:31:53] [INFO ] [Real]Absence check using 13 positive and 41 generalized place invariants in 13 ms returned unsat
[2025-06-02 19:31:53] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2025-06-02 19:31:53] [INFO ] [Real]Absence check using 13 positive and 41 generalized place invariants in 20 ms returned unsat
[2025-06-02 19:31:53] [INFO ] [Real]Absence check using 13 positive place invariants in 9 ms returned sat
[2025-06-02 19:31:53] [INFO ] [Real]Absence check using 13 positive and 41 generalized place invariants in 10 ms returned unsat
[2025-06-02 19:31:54] [INFO ] [Real]Absence check using 13 positive place invariants in 9 ms returned sat
[2025-06-02 19:31:54] [INFO ] [Real]Absence check using 13 positive and 41 generalized place invariants in 14 ms returned unsat
[2025-06-02 19:31:54] [INFO ] [Real]Absence check using 13 positive place invariants in 11 ms returned sat
[2025-06-02 19:31:54] [INFO ] [Real]Absence check using 13 positive and 41 generalized place invariants in 13 ms returned unsat
[2025-06-02 19:31:54] [INFO ] [Real]Absence check using 13 positive place invariants in 9 ms returned sat
[2025-06-02 19:31:54] [INFO ] [Real]Absence check using 13 positive and 41 generalized place invariants in 37 ms returned sat
[2025-06-02 19:31:55] [INFO ] [Real]Absence check using state equation in 1280 ms returned sat
[2025-06-02 19:31:55] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:31:55] [INFO ] [Nat]Absence check using 13 positive place invariants in 9 ms returned sat
[2025-06-02 19:31:55] [INFO ] [Nat]Absence check using 13 positive and 41 generalized place invariants in 57 ms returned sat
[2025-06-02 19:31:57] [INFO ] [Nat]Absence check using state equation in 1481 ms returned sat
[2025-06-02 19:31:57] [INFO ] State equation strengthened by 96 read => feed constraints.
[2025-06-02 19:31:57] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-02 19:31:58] [INFO ] [Nat]Added 96 Read/Feed constraints in 1026 ms returned unknown
[2025-06-02 19:31:58] [INFO ] [Real]Absence check using 13 positive place invariants in 20 ms returned sat
[2025-06-02 19:31:58] [INFO ] [Real]Absence check using 13 positive and 41 generalized place invariants in 24 ms returned unsat
[2025-06-02 19:31:58] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2025-06-02 19:31:58] [INFO ] [Real]Absence check using 13 positive and 41 generalized place invariants in 33 ms returned sat
[2025-06-02 19:32:00] [INFO ] [Real]Absence check using state equation in 2157 ms returned sat
[2025-06-02 19:32:00] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:32:00] [INFO ] [Nat]Absence check using 13 positive place invariants in 20 ms returned sat
[2025-06-02 19:32:00] [INFO ] [Nat]Absence check using 13 positive and 41 generalized place invariants in 32 ms returned sat
[2025-06-02 19:32:03] [INFO ] [Nat]Absence check using state equation in 2159 ms returned unknown
[2025-06-02 19:32:03] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2025-06-02 19:32:03] [INFO ] [Real]Absence check using 13 positive and 41 generalized place invariants in 36 ms returned unsat
[2025-06-02 19:32:03] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2025-06-02 19:32:03] [INFO ] [Real]Absence check using 13 positive and 41 generalized place invariants in 42 ms returned sat
[2025-06-02 19:32:04] [INFO ] [Real]Absence check using state equation in 840 ms returned sat
[2025-06-02 19:32:04] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:32:04] [INFO ] [Nat]Absence check using 13 positive place invariants in 8 ms returned sat
[2025-06-02 19:32:04] [INFO ] [Nat]Absence check using 13 positive and 41 generalized place invariants in 42 ms returned sat
[2025-06-02 19:32:06] [INFO ] [Nat]Absence check using state equation in 2284 ms returned sat
[2025-06-02 19:32:07] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-02 19:32:07] [INFO ] [Nat]Added 96 Read/Feed constraints in 1031 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[2, 2, 1, 1, 1, 1, 1, 2, 1, 7, 1, 2] Max Struct:[2, 288, 1, 1, 1, 1, 1, 36, 1, 8, 1, 36]
FORMULA PolyORBLF-PT-S02J06T08-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T08-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T08-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T08-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T08-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T08-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T08-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T08-UpperBounds-00 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2, 2, 7, 2] Max Struct:[288, 36, 8, 36]
Support contains 11 out of 690 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 690/690 places, 1306/1306 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 0 with 65 rules applied. Total rules applied 65 place count 688 transition count 1243
Reduce places removed 63 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 64 rules applied. Total rules applied 129 place count 625 transition count 1242
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 130 place count 624 transition count 1242
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 80 Pre rules applied. Total rules applied 130 place count 624 transition count 1162
Deduced a syphon composed of 80 places in 2 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 3 with 160 rules applied. Total rules applied 290 place count 544 transition count 1162
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 2 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 3 with 128 rules applied. Total rules applied 418 place count 480 transition count 1098
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 3 with 8 rules applied. Total rules applied 426 place count 480 transition count 1090
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 434 place count 472 transition count 1090
Applied a total of 434 rules in 253 ms. Remains 472 /690 variables (removed 218) and now considering 1090/1306 (removed 216) transitions.
Running 1088 sub problems to find dead transitions.
[2025-06-02 19:32:07] [INFO ] Flow matrix only has 1074 transitions (discarded 16 similar events)
// Phase 1: matrix 1074 rows 472 cols
[2025-06-02 19:32:08] [INFO ] Computed 52 invariants in 32 ms
[2025-06-02 19:32:08] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/470 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1088 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/470 variables, 33/50 constraints. Problems are: Problem set: 0 solved, 1088 unsolved
[2025-06-02 19:32:19] [INFO ] Deduced a trap composed of 47 places in 91 ms of which 11 ms to minimize.
[2025-06-02 19:32:19] [INFO ] Deduced a trap composed of 46 places in 86 ms of which 1 ms to minimize.
[2025-06-02 19:32:19] [INFO ] Deduced a trap composed of 46 places in 56 ms of which 1 ms to minimize.
[2025-06-02 19:32:19] [INFO ] Deduced a trap composed of 46 places in 52 ms of which 1 ms to minimize.
[2025-06-02 19:32:19] [INFO ] Deduced a trap composed of 46 places in 43 ms of which 1 ms to minimize.
[2025-06-02 19:32:19] [INFO ] Deduced a trap composed of 46 places in 40 ms of which 4 ms to minimize.
[2025-06-02 19:32:19] [INFO ] Deduced a trap composed of 46 places in 46 ms of which 1 ms to minimize.
[2025-06-02 19:32:19] [INFO ] Deduced a trap composed of 46 places in 41 ms of which 1 ms to minimize.
[2025-06-02 19:32:20] [INFO ] Deduced a trap composed of 171 places in 218 ms of which 3 ms to minimize.
[2025-06-02 19:32:20] [INFO ] Deduced a trap composed of 183 places in 212 ms of which 3 ms to minimize.
[2025-06-02 19:32:20] [INFO ] Deduced a trap composed of 167 places in 223 ms of which 3 ms to minimize.
[2025-06-02 19:32:21] [INFO ] Deduced a trap composed of 143 places in 227 ms of which 3 ms to minimize.
[2025-06-02 19:32:23] [INFO ] Deduced a trap composed of 63 places in 239 ms of which 3 ms to minimize.
[2025-06-02 19:32:26] [INFO ] Deduced a trap composed of 19 places in 174 ms of which 3 ms to minimize.
[2025-06-02 19:32:29] [INFO ] Deduced a trap composed of 200 places in 226 ms of which 2 ms to minimize.
[2025-06-02 19:32:29] [INFO ] Deduced a trap composed of 191 places in 245 ms of which 3 ms to minimize.
[2025-06-02 19:32:29] [INFO ] Deduced a trap composed of 177 places in 248 ms of which 2 ms to minimize.
[2025-06-02 19:32:29] [INFO ] Deduced a trap composed of 200 places in 225 ms of which 3 ms to minimize.
[2025-06-02 19:32:30] [INFO ] Deduced a trap composed of 210 places in 229 ms of which 3 ms to minimize.
SMT process timed out in 22151ms, After SMT, problems are : Problem set: 0 solved, 1088 unsolved
Search for dead transitions found 0 dead transitions in 22201ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22492 ms. Remains : 472/690 places, 1090/1306 transitions.
[2025-06-02 19:32:30] [INFO ] Flow matrix only has 1074 transitions (discarded 16 similar events)
[2025-06-02 19:32:30] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2, 2, 7, 2] Max Struct:[32, 4, 8, 4]
RANDOM walk for 1000000 steps (406 resets) in 5119 ms. (195 steps per ms)
FORMULA PolyORBLF-PT-S02J06T08-UpperBounds-13 8 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 4000003 steps (455 resets) in 9027 ms. (443 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2, 2, 2] Max Struct:[32, 4, 4]
[2025-06-02 19:32:44] [INFO ] Flow matrix only has 1074 transitions (discarded 16 similar events)
[2025-06-02 19:32:44] [INFO ] Invariant cache hit.
[2025-06-02 19:32:44] [INFO ] [Real]Absence check using 17 positive place invariants in 10 ms returned sat
[2025-06-02 19:32:44] [INFO ] [Real]Absence check using 17 positive and 35 generalized place invariants in 17 ms returned sat
[2025-06-02 19:32:44] [INFO ] [Real]Absence check using state equation in 489 ms returned sat
[2025-06-02 19:32:44] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:32:44] [INFO ] [Nat]Absence check using 17 positive place invariants in 11 ms returned sat
[2025-06-02 19:32:44] [INFO ] [Nat]Absence check using 17 positive and 35 generalized place invariants in 16 ms returned sat
[2025-06-02 19:32:48] [INFO ] [Nat]Absence check using state equation in 3333 ms returned sat
[2025-06-02 19:32:48] [INFO ] State equation strengthened by 96 read => feed constraints.
[2025-06-02 19:32:48] [INFO ] [Nat]Added 96 Read/Feed constraints in 258 ms returned sat
[2025-06-02 19:32:48] [INFO ] Computed and/alt/rep : 424/1534/416 causal constraints (skipped 656 transitions) in 99 ms.
[2025-06-02 19:32:50] [INFO ] Deduced a trap composed of 186 places in 217 ms of which 3 ms to minimize.
[2025-06-02 19:32:50] [INFO ] Deduced a trap composed of 201 places in 273 ms of which 3 ms to minimize.
[2025-06-02 19:32:50] [INFO ] Deduced a trap composed of 174 places in 218 ms of which 3 ms to minimize.
[2025-06-02 19:32:51] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1094 ms
[2025-06-02 19:32:51] [INFO ] Added : 50 causal constraints over 11 iterations in 2627 ms. Result :sat
Minimization took 4507 ms.
[2025-06-02 19:32:55] [INFO ] [Real]Absence check using 17 positive place invariants in 16 ms returned sat
[2025-06-02 19:32:55] [INFO ] [Real]Absence check using 17 positive and 35 generalized place invariants in 15 ms returned sat
[2025-06-02 19:32:56] [INFO ] [Real]Absence check using state equation in 782 ms returned sat
[2025-06-02 19:32:56] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:32:56] [INFO ] [Nat]Absence check using 17 positive place invariants in 12 ms returned sat
[2025-06-02 19:32:56] [INFO ] [Nat]Absence check using 17 positive and 35 generalized place invariants in 14 ms returned sat
[2025-06-02 19:33:00] [INFO ] [Nat]Absence check using state equation in 4078 ms returned sat
[2025-06-02 19:33:01] [INFO ] [Nat]Added 96 Read/Feed constraints in 210 ms returned sat
[2025-06-02 19:33:01] [INFO ] Deduced a trap composed of 192 places in 218 ms of which 3 ms to minimize.
[2025-06-02 19:33:01] [INFO ] Deduced a trap composed of 194 places in 215 ms of which 2 ms to minimize.
[2025-06-02 19:33:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 556 ms
[2025-06-02 19:33:01] [INFO ] Computed and/alt/rep : 424/1534/416 causal constraints (skipped 656 transitions) in 63 ms.
[2025-06-02 19:33:05] [INFO ] Deduced a trap composed of 19 places in 221 ms of which 2 ms to minimize.
[2025-06-02 19:33:05] [INFO ] Deduced a trap composed of 47 places in 218 ms of which 3 ms to minimize.
[2025-06-02 19:33:06] [INFO ] Deduced a trap composed of 46 places in 231 ms of which 3 ms to minimize.
[2025-06-02 19:33:06] [INFO ] Deduced a trap composed of 169 places in 234 ms of which 3 ms to minimize.
[2025-06-02 19:33:06] [INFO ] Deduced a trap composed of 187 places in 231 ms of which 3 ms to minimize.
[2025-06-02 19:33:07] [INFO ] Deduced a trap composed of 46 places in 39 ms of which 0 ms to minimize.
[2025-06-02 19:33:07] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1663 ms
[2025-06-02 19:33:07] [INFO ] Added : 131 causal constraints over 27 iterations in 5695 ms. Result :sat
Minimization took 4505 ms.
[2025-06-02 19:33:11] [INFO ] [Real]Absence check using 17 positive place invariants in 12 ms returned sat
[2025-06-02 19:33:11] [INFO ] [Real]Absence check using 17 positive and 35 generalized place invariants in 21 ms returned sat
[2025-06-02 19:33:12] [INFO ] [Real]Absence check using state equation in 636 ms returned sat
[2025-06-02 19:33:12] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:33:12] [INFO ] [Nat]Absence check using 17 positive place invariants in 10 ms returned sat
[2025-06-02 19:33:12] [INFO ] [Nat]Absence check using 17 positive and 35 generalized place invariants in 20 ms returned sat
[2025-06-02 19:33:13] [INFO ] [Nat]Absence check using state equation in 685 ms returned sat
[2025-06-02 19:33:13] [INFO ] [Nat]Added 96 Read/Feed constraints in 287 ms returned sat
[2025-06-02 19:33:13] [INFO ] Deduced a trap composed of 226 places in 221 ms of which 3 ms to minimize.
[2025-06-02 19:33:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 300 ms
[2025-06-02 19:33:14] [INFO ] Computed and/alt/rep : 424/1534/416 causal constraints (skipped 656 transitions) in 62 ms.
[2025-06-02 19:33:15] [INFO ] Deduced a trap composed of 19 places in 232 ms of which 2 ms to minimize.
[2025-06-02 19:33:16] [INFO ] Deduced a trap composed of 46 places in 232 ms of which 2 ms to minimize.
[2025-06-02 19:33:16] [INFO ] Deduced a trap composed of 175 places in 238 ms of which 3 ms to minimize.
[2025-06-02 19:33:16] [INFO ] Deduced a trap composed of 46 places in 241 ms of which 5 ms to minimize.
[2025-06-02 19:33:17] [INFO ] Deduced a trap composed of 182 places in 217 ms of which 3 ms to minimize.
[2025-06-02 19:33:17] [INFO ] Deduced a trap composed of 201 places in 238 ms of which 3 ms to minimize.
[2025-06-02 19:33:17] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1913 ms
[2025-06-02 19:33:17] [INFO ] Added : 112 causal constraints over 23 iterations in 3767 ms. Result :sat
Minimization took 4503 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2, 2, 2] Max Struct:[32, 4, 4]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2, 2, 2] Max Struct:[32, 4, 4]
Support contains 10 out of 472 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 472/472 places, 1090/1090 transitions.
Applied a total of 0 rules in 45 ms. Remains 472 /472 variables (removed 0) and now considering 1090/1090 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 472/472 places, 1090/1090 transitions.
[2025-06-02 19:33:22] [INFO ] Flow matrix only has 1074 transitions (discarded 16 similar events)
[2025-06-02 19:33:22] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2, 2, 2] Max Struct:[32, 4, 4]
RANDOM walk for 1000000 steps (381 resets) in 4858 ms. (205 steps per ms)
BEST_FIRST walk for 3000003 steps (472 resets) in 6720 ms. (446 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2, 2, 2] Max Struct:[32, 4, 4]
[2025-06-02 19:33:33] [INFO ] Flow matrix only has 1074 transitions (discarded 16 similar events)
[2025-06-02 19:33:33] [INFO ] Invariant cache hit.
[2025-06-02 19:33:33] [INFO ] [Real]Absence check using 17 positive place invariants in 10 ms returned sat
[2025-06-02 19:33:33] [INFO ] [Real]Absence check using 17 positive and 35 generalized place invariants in 17 ms returned sat
[2025-06-02 19:33:34] [INFO ] [Real]Absence check using state equation in 516 ms returned sat
[2025-06-02 19:33:34] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:33:34] [INFO ] [Nat]Absence check using 17 positive place invariants in 10 ms returned sat
[2025-06-02 19:33:34] [INFO ] [Nat]Absence check using 17 positive and 35 generalized place invariants in 16 ms returned sat
[2025-06-02 19:33:37] [INFO ] [Nat]Absence check using state equation in 3337 ms returned sat
[2025-06-02 19:33:37] [INFO ] State equation strengthened by 96 read => feed constraints.
[2025-06-02 19:33:38] [INFO ] [Nat]Added 96 Read/Feed constraints in 255 ms returned sat
[2025-06-02 19:33:38] [INFO ] Computed and/alt/rep : 424/1534/416 causal constraints (skipped 656 transitions) in 61 ms.
[2025-06-02 19:33:39] [INFO ] Deduced a trap composed of 186 places in 220 ms of which 3 ms to minimize.
[2025-06-02 19:33:40] [INFO ] Deduced a trap composed of 201 places in 223 ms of which 3 ms to minimize.
[2025-06-02 19:33:40] [INFO ] Deduced a trap composed of 174 places in 221 ms of which 2 ms to minimize.
[2025-06-02 19:33:40] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1047 ms
[2025-06-02 19:33:40] [INFO ] Added : 50 causal constraints over 11 iterations in 2515 ms. Result :sat
Minimization took 4502 ms.
[2025-06-02 19:33:45] [INFO ] [Real]Absence check using 17 positive place invariants in 10 ms returned sat
[2025-06-02 19:33:45] [INFO ] [Real]Absence check using 17 positive and 35 generalized place invariants in 16 ms returned sat
[2025-06-02 19:33:46] [INFO ] [Real]Absence check using state equation in 794 ms returned sat
[2025-06-02 19:33:46] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:33:46] [INFO ] [Nat]Absence check using 17 positive place invariants in 10 ms returned sat
[2025-06-02 19:33:46] [INFO ] [Nat]Absence check using 17 positive and 35 generalized place invariants in 14 ms returned sat
[2025-06-02 19:33:50] [INFO ] [Nat]Absence check using state equation in 4109 ms returned sat
[2025-06-02 19:33:50] [INFO ] [Nat]Added 96 Read/Feed constraints in 208 ms returned sat
[2025-06-02 19:33:50] [INFO ] Deduced a trap composed of 192 places in 221 ms of which 3 ms to minimize.
[2025-06-02 19:33:51] [INFO ] Deduced a trap composed of 194 places in 214 ms of which 3 ms to minimize.
[2025-06-02 19:33:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 561 ms
[2025-06-02 19:33:51] [INFO ] Computed and/alt/rep : 424/1534/416 causal constraints (skipped 656 transitions) in 49 ms.
[2025-06-02 19:33:55] [INFO ] Deduced a trap composed of 19 places in 217 ms of which 3 ms to minimize.
[2025-06-02 19:33:55] [INFO ] Deduced a trap composed of 47 places in 216 ms of which 3 ms to minimize.
[2025-06-02 19:33:55] [INFO ] Deduced a trap composed of 46 places in 225 ms of which 3 ms to minimize.
[2025-06-02 19:33:55] [INFO ] Deduced a trap composed of 169 places in 209 ms of which 3 ms to minimize.
[2025-06-02 19:33:56] [INFO ] Deduced a trap composed of 187 places in 215 ms of which 3 ms to minimize.
[2025-06-02 19:33:56] [INFO ] Deduced a trap composed of 46 places in 38 ms of which 1 ms to minimize.
[2025-06-02 19:33:56] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1586 ms
[2025-06-02 19:33:56] [INFO ] Added : 131 causal constraints over 27 iterations in 5493 ms. Result :sat
Minimization took 4505 ms.
[2025-06-02 19:34:01] [INFO ] [Real]Absence check using 17 positive place invariants in 11 ms returned sat
[2025-06-02 19:34:01] [INFO ] [Real]Absence check using 17 positive and 35 generalized place invariants in 15 ms returned sat
[2025-06-02 19:34:01] [INFO ] [Real]Absence check using state equation in 649 ms returned sat
[2025-06-02 19:34:01] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:34:01] [INFO ] [Nat]Absence check using 17 positive place invariants in 10 ms returned sat
[2025-06-02 19:34:01] [INFO ] [Nat]Absence check using 17 positive and 35 generalized place invariants in 15 ms returned sat
[2025-06-02 19:34:02] [INFO ] [Nat]Absence check using state equation in 693 ms returned sat
[2025-06-02 19:34:02] [INFO ] [Nat]Added 96 Read/Feed constraints in 293 ms returned sat
[2025-06-02 19:34:03] [INFO ] Deduced a trap composed of 226 places in 219 ms of which 3 ms to minimize.
[2025-06-02 19:34:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 276 ms
[2025-06-02 19:34:03] [INFO ] Computed and/alt/rep : 424/1534/416 causal constraints (skipped 656 transitions) in 57 ms.
[2025-06-02 19:34:05] [INFO ] Deduced a trap composed of 19 places in 228 ms of which 3 ms to minimize.
[2025-06-02 19:34:05] [INFO ] Deduced a trap composed of 46 places in 226 ms of which 4 ms to minimize.
[2025-06-02 19:34:05] [INFO ] Deduced a trap composed of 175 places in 226 ms of which 2 ms to minimize.
[2025-06-02 19:34:06] [INFO ] Deduced a trap composed of 46 places in 239 ms of which 3 ms to minimize.
[2025-06-02 19:34:06] [INFO ] Deduced a trap composed of 182 places in 214 ms of which 3 ms to minimize.
[2025-06-02 19:34:06] [INFO ] Deduced a trap composed of 201 places in 214 ms of which 3 ms to minimize.
[2025-06-02 19:34:06] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1843 ms
[2025-06-02 19:34:06] [INFO ] Added : 112 causal constraints over 23 iterations in 3712 ms. Result :sat
Minimization took 4512 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2, 2, 2] Max Struct:[32, 4, 4]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2, 2, 2] Max Struct:[32, 4, 4]
Support contains 10 out of 472 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 472/472 places, 1090/1090 transitions.
Applied a total of 0 rules in 36 ms. Remains 472 /472 variables (removed 0) and now considering 1090/1090 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 472/472 places, 1090/1090 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 472/472 places, 1090/1090 transitions.
Applied a total of 0 rules in 25 ms. Remains 472 /472 variables (removed 0) and now considering 1090/1090 (removed 0) transitions.
[2025-06-02 19:34:11] [INFO ] Flow matrix only has 1074 transitions (discarded 16 similar events)
[2025-06-02 19:34:11] [INFO ] Invariant cache hit.
[2025-06-02 19:34:12] [INFO ] Implicit Places using invariants in 590 ms returned [46, 123, 204, 243, 322, 338, 395, 401]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 599 ms to find 8 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 464/472 places, 1090/1090 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 460 transition count 1086
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 460 transition count 1086
Applied a total of 8 rules in 62 ms. Remains 460 /464 variables (removed 4) and now considering 1086/1090 (removed 4) transitions.
[2025-06-02 19:34:12] [INFO ] Flow matrix only has 1070 transitions (discarded 16 similar events)
// Phase 1: matrix 1070 rows 460 cols
[2025-06-02 19:34:12] [INFO ] Computed 44 invariants in 28 ms
[2025-06-02 19:34:12] [INFO ] Implicit Places using invariants in 561 ms returned []
[2025-06-02 19:34:12] [INFO ] Flow matrix only has 1070 transitions (discarded 16 similar events)
[2025-06-02 19:34:12] [INFO ] Invariant cache hit.
[2025-06-02 19:34:13] [INFO ] State equation strengthened by 96 read => feed constraints.
[2025-06-02 19:34:21] [INFO ] Implicit Places using invariants and state equation in 8649 ms returned []
Implicit Place search using SMT with State Equation took 9213 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 460/472 places, 1086/1090 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 9904 ms. Remains : 460/472 places, 1086/1090 transitions.
[2025-06-02 19:34:21] [INFO ] Flow matrix only has 1070 transitions (discarded 16 similar events)
[2025-06-02 19:34:21] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2, 2, 2] Max Struct:[32, 4, 4]
RANDOM walk for 1000000 steps (415 resets) in 4606 ms. (217 steps per ms)
BEST_FIRST walk for 3000002 steps (456 resets) in 6316 ms. (474 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2, 2, 2] Max Struct:[32, 4, 4]
[2025-06-02 19:34:32] [INFO ] Flow matrix only has 1070 transitions (discarded 16 similar events)
[2025-06-02 19:34:32] [INFO ] Invariant cache hit.
[2025-06-02 19:34:32] [INFO ] [Real]Absence check using 18 positive place invariants in 6 ms returned sat
[2025-06-02 19:34:32] [INFO ] [Real]Absence check using 18 positive and 26 generalized place invariants in 13 ms returned sat
[2025-06-02 19:34:33] [INFO ] [Real]Absence check using state equation in 758 ms returned sat
[2025-06-02 19:34:33] [INFO ] State equation strengthened by 96 read => feed constraints.
[2025-06-02 19:34:33] [INFO ] [Real]Added 96 Read/Feed constraints in 296 ms returned sat
[2025-06-02 19:34:33] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:34:33] [INFO ] [Nat]Absence check using 18 positive place invariants in 6 ms returned sat
[2025-06-02 19:34:33] [INFO ] [Nat]Absence check using 18 positive and 26 generalized place invariants in 12 ms returned sat
[2025-06-02 19:34:34] [INFO ] [Nat]Absence check using state equation in 1011 ms returned sat
[2025-06-02 19:34:34] [INFO ] [Nat]Added 96 Read/Feed constraints in 333 ms returned sat
[2025-06-02 19:34:35] [INFO ] Computed and/alt/rep : 416/1493/408 causal constraints (skipped 660 transitions) in 54 ms.
[2025-06-02 19:34:36] [INFO ] Deduced a trap composed of 219 places in 222 ms of which 6 ms to minimize.
[2025-06-02 19:34:36] [INFO ] Deduced a trap composed of 19 places in 207 ms of which 3 ms to minimize.
[2025-06-02 19:34:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 706 ms
[2025-06-02 19:34:36] [INFO ] Added : 52 causal constraints over 12 iterations in 1839 ms. Result :sat
Minimization took 4509 ms.
[2025-06-02 19:34:41] [INFO ] [Real]Absence check using 18 positive place invariants in 8 ms returned sat
[2025-06-02 19:34:41] [INFO ] [Real]Absence check using 18 positive and 26 generalized place invariants in 11 ms returned sat
[2025-06-02 19:34:42] [INFO ] [Real]Absence check using state equation in 686 ms returned sat
[2025-06-02 19:34:42] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:34:42] [INFO ] [Nat]Absence check using 18 positive place invariants in 7 ms returned sat
[2025-06-02 19:34:42] [INFO ] [Nat]Absence check using 18 positive and 26 generalized place invariants in 11 ms returned sat
[2025-06-02 19:34:43] [INFO ] [Nat]Absence check using state equation in 1186 ms returned sat
[2025-06-02 19:34:43] [INFO ] [Nat]Added 96 Read/Feed constraints in 304 ms returned sat
[2025-06-02 19:34:43] [INFO ] Computed and/alt/rep : 416/1493/408 causal constraints (skipped 660 transitions) in 56 ms.
[2025-06-02 19:34:46] [INFO ] Deduced a trap composed of 170 places in 218 ms of which 3 ms to minimize.
[2025-06-02 19:34:46] [INFO ] Deduced a trap composed of 48 places in 215 ms of which 3 ms to minimize.
[2025-06-02 19:34:46] [INFO ] Deduced a trap composed of 46 places in 215 ms of which 3 ms to minimize.
[2025-06-02 19:34:46] [INFO ] Deduced a trap composed of 19 places in 212 ms of which 3 ms to minimize.
[2025-06-02 19:34:47] [INFO ] Deduced a trap composed of 47 places in 208 ms of which 2 ms to minimize.
[2025-06-02 19:34:47] [INFO ] Deduced a trap composed of 47 places in 209 ms of which 3 ms to minimize.
[2025-06-02 19:34:47] [INFO ] Deduced a trap composed of 186 places in 213 ms of which 2 ms to minimize.
[2025-06-02 19:34:48] [INFO ] Deduced a trap composed of 167 places in 213 ms of which 2 ms to minimize.
[2025-06-02 19:34:48] [INFO ] Deduced a trap composed of 46 places in 212 ms of which 3 ms to minimize.
[2025-06-02 19:34:48] [INFO ] Deduced a trap composed of 182 places in 225 ms of which 3 ms to minimize.
[2025-06-02 19:34:48] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 3038 ms
[2025-06-02 19:34:48] [INFO ] Added : 155 causal constraints over 31 iterations in 5248 ms. Result :sat
Minimization took 4572 ms.
[2025-06-02 19:34:53] [INFO ] [Real]Absence check using 18 positive place invariants in 7 ms returned sat
[2025-06-02 19:34:53] [INFO ] [Real]Absence check using 18 positive and 26 generalized place invariants in 12 ms returned sat
[2025-06-02 19:34:54] [INFO ] [Real]Absence check using state equation in 496 ms returned sat
[2025-06-02 19:34:54] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:34:54] [INFO ] [Nat]Absence check using 18 positive place invariants in 7 ms returned sat
[2025-06-02 19:34:54] [INFO ] [Nat]Absence check using 18 positive and 26 generalized place invariants in 12 ms returned sat
[2025-06-02 19:34:57] [INFO ] [Nat]Absence check using state equation in 3174 ms returned sat
[2025-06-02 19:34:57] [INFO ] [Nat]Added 96 Read/Feed constraints in 283 ms returned sat
[2025-06-02 19:34:57] [INFO ] Computed and/alt/rep : 416/1493/408 causal constraints (skipped 660 transitions) in 55 ms.
[2025-06-02 19:34:59] [INFO ] Deduced a trap composed of 204 places in 212 ms of which 3 ms to minimize.
[2025-06-02 19:34:59] [INFO ] Deduced a trap composed of 204 places in 223 ms of which 3 ms to minimize.
[2025-06-02 19:34:59] [INFO ] Deduced a trap composed of 46 places in 221 ms of which 3 ms to minimize.
[2025-06-02 19:35:00] [INFO ] Deduced a trap composed of 195 places in 219 ms of which 3 ms to minimize.
[2025-06-02 19:35:00] [INFO ] Deduced a trap composed of 19 places in 231 ms of which 3 ms to minimize.
[2025-06-02 19:35:00] [INFO ] Deduced a trap composed of 47 places in 210 ms of which 3 ms to minimize.
[2025-06-02 19:35:01] [INFO ] Deduced a trap composed of 188 places in 214 ms of which 3 ms to minimize.
[2025-06-02 19:35:01] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2127 ms
[2025-06-02 19:35:01] [INFO ] Added : 90 causal constraints over 19 iterations in 3671 ms. Result :sat
Minimization took 4561 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2, 2, 2] Max Struct:[32, 4, 4]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2, 2, 2] Max Struct:[32, 4, 4]
Support contains 10 out of 460 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 460/460 places, 1086/1086 transitions.
Applied a total of 0 rules in 27 ms. Remains 460 /460 variables (removed 0) and now considering 1086/1086 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 460/460 places, 1086/1086 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 460/460 places, 1086/1086 transitions.
Applied a total of 0 rules in 18 ms. Remains 460 /460 variables (removed 0) and now considering 1086/1086 (removed 0) transitions.
[2025-06-02 19:35:06] [INFO ] Flow matrix only has 1070 transitions (discarded 16 similar events)
[2025-06-02 19:35:06] [INFO ] Invariant cache hit.
[2025-06-02 19:35:06] [INFO ] Implicit Places using invariants in 603 ms returned []
[2025-06-02 19:35:06] [INFO ] Flow matrix only has 1070 transitions (discarded 16 similar events)
[2025-06-02 19:35:06] [INFO ] Invariant cache hit.
[2025-06-02 19:35:07] [INFO ] State equation strengthened by 96 read => feed constraints.
[2025-06-02 19:35:15] [INFO ] Implicit Places using invariants and state equation in 8675 ms returned []
Implicit Place search using SMT with State Equation took 9280 ms to find 0 implicit places.
[2025-06-02 19:35:15] [INFO ] Redundant transitions in 56 ms returned []
Running 1084 sub problems to find dead transitions.
[2025-06-02 19:35:15] [INFO ] Flow matrix only has 1070 transitions (discarded 16 similar events)
[2025-06-02 19:35:15] [INFO ] Invariant cache hit.
[2025-06-02 19:35:15] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/458 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1084 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/458 variables, 24/42 constraints. Problems are: Problem set: 0 solved, 1084 unsolved
[2025-06-02 19:35:25] [INFO ] Deduced a trap composed of 46 places in 76 ms of which 1 ms to minimize.
[2025-06-02 19:35:25] [INFO ] Deduced a trap composed of 47 places in 67 ms of which 2 ms to minimize.
[2025-06-02 19:35:25] [INFO ] Deduced a trap composed of 47 places in 46 ms of which 1 ms to minimize.
[2025-06-02 19:35:25] [INFO ] Deduced a trap composed of 46 places in 35 ms of which 1 ms to minimize.
[2025-06-02 19:35:25] [INFO ] Deduced a trap composed of 46 places in 33 ms of which 0 ms to minimize.
[2025-06-02 19:35:25] [INFO ] Deduced a trap composed of 31 places in 114 ms of which 2 ms to minimize.
[2025-06-02 19:35:25] [INFO ] Deduced a trap composed of 46 places in 38 ms of which 1 ms to minimize.
[2025-06-02 19:35:25] [INFO ] Deduced a trap composed of 47 places in 48 ms of which 0 ms to minimize.
[2025-06-02 19:35:25] [INFO ] Deduced a trap composed of 47 places in 42 ms of which 1 ms to minimize.
[2025-06-02 19:35:26] [INFO ] Deduced a trap composed of 154 places in 220 ms of which 3 ms to minimize.
[2025-06-02 19:35:26] [INFO ] Deduced a trap composed of 151 places in 216 ms of which 2 ms to minimize.
[2025-06-02 19:35:28] [INFO ] Deduced a trap composed of 25 places in 133 ms of which 2 ms to minimize.
[2025-06-02 19:35:29] [INFO ] Deduced a trap composed of 19 places in 140 ms of which 2 ms to minimize.
[2025-06-02 19:35:30] [INFO ] Deduced a trap composed of 34 places in 215 ms of which 2 ms to minimize.
[2025-06-02 19:35:30] [INFO ] Deduced a trap composed of 66 places in 202 ms of which 3 ms to minimize.
[2025-06-02 19:35:34] [INFO ] Deduced a trap composed of 173 places in 205 ms of which 3 ms to minimize.
[2025-06-02 19:35:35] [INFO ] Deduced a trap composed of 211 places in 208 ms of which 3 ms to minimize.
[2025-06-02 19:35:36] [INFO ] Deduced a trap composed of 199 places in 204 ms of which 2 ms to minimize.
[2025-06-02 19:35:37] [INFO ] Deduced a trap composed of 216 places in 216 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/458 variables, 19/61 constraints. Problems are: Problem set: 0 solved, 1084 unsolved
[2025-06-02 19:35:40] [INFO ] Deduced a trap composed of 284 places in 205 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 458/1530 variables, and 62 constraints, problems are : Problem set: 0 solved, 1084 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 24/26 constraints, State Equation: 0/460 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1084/1084 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1084 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/458 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1084 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/458 variables, 24/42 constraints. Problems are: Problem set: 0 solved, 1084 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/458 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1084 unsolved
[2025-06-02 19:36:08] [INFO ] Deduced a trap composed of 220 places in 218 ms of which 3 ms to minimize.
[2025-06-02 19:36:08] [INFO ] Deduced a trap composed of 186 places in 207 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/458 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 1084 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 458/1530 variables, and 64 constraints, problems are : Problem set: 0 solved, 1084 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 24/26 constraints, State Equation: 0/460 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1084 constraints, Known Traps: 22/22 constraints]
After SMT, in 61860ms problems are : Problem set: 0 solved, 1084 unsolved
Search for dead transitions found 0 dead transitions in 61873ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71246 ms. Remains : 460/460 places, 1086/1086 transitions.
RANDOM walk for 40000 steps (18 resets) in 990 ms. (40 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (11 resets) in 563 ms. (70 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (12 resets) in 251 ms. (158 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (13 resets) in 329 ms. (121 steps per ms) remains 6/6 properties
[2025-06-02 19:36:18] [INFO ] Flatten gal took : 328 ms
[2025-06-02 19:36:18] [INFO ] Flatten gal took : 129 ms
BEST_FIRST walk for 40004 steps (13 resets) in 358 ms. (111 steps per ms) remains 6/6 properties
[2025-06-02 19:36:18] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4200334103643833026.gal : 96 ms
[2025-06-02 19:36:18] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14975703254252531074.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/ReachabilityCardinality4200334103643833026.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14975703254252531074.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
BEST_FIRST walk for 40004 steps (11 resets) in 359 ms. (111 steps per ms) remains 6/6 properties
/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/ReachabilityCardinality14975703254252531074.prop.
BEST_FIRST walk for 40004 steps (11 resets) in 591 ms. (67 steps per ms) remains 6/6 properties
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 14
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :14 after 22
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :22 after 80
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :80 after 234
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :234 after 1638
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :1638 after 1666
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :1666 after 1714
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :1714 after 1798
SDD proceeding with computation,6 properties remain. new max is 1024
SDD size :1798 after 1970
SDD proceeding with computation,6 properties remain. new max is 2048
SDD size :1970 after 2372
SDD proceeding with computation,6 properties remain. new max is 4096
SDD size :2372 after 5420
Interrupted probabilistic random walk after 131646 steps, run timeout after 3001 ms. (steps per millisecond=43 ) properties seen :0 out of 6
Probabilistic random walk after 131646 steps, saw 82354 distinct states, run finished after 3003 ms. (steps per millisecond=43 ) properties seen :0
[2025-06-02 19:36:21] [INFO ] Flow matrix only has 1070 transitions (discarded 16 similar events)
[2025-06-02 19:36:21] [INFO ] Invariant cache hit.
[2025-06-02 19:36:21] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 191/201 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/201 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 90/291 variables, 12/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/291 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem MAX0 is UNSAT
At refinement iteration 5 (OVERLAPS) 152/443 variables, 20/35 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/443 variables, 0/35 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 5/448 variables, 5/40 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/448 variables, 0/40 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 10/458 variables, 3/43 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2025-06-02 19:36:22] [INFO ] Deduced a trap composed of 47 places in 291 ms of which 2 ms to minimize.
[2025-06-02 19:36:23] [INFO ] Deduced a trap composed of 46 places in 268 ms of which 1 ms to minimize.
[2025-06-02 19:36:24] [INFO ] Deduced a trap composed of 47 places in 1132 ms of which 2 ms to minimize.
[2025-06-02 19:36:24] [INFO ] Deduced a trap composed of 93 places in 224 ms of which 2 ms to minimize.
SDD proceeding with computation,6 properties remain. new max is 8192
SDD size :5420 after 12080
[2025-06-02 19:36:25] [INFO ] Deduced a trap composed of 47 places in 1017 ms of which 1 ms to minimize.
[2025-06-02 19:36:25] [INFO ] Deduced a trap composed of 46 places in 57 ms of which 1 ms to minimize.
[2025-06-02 19:36:25] [INFO ] Deduced a trap composed of 46 places in 45 ms of which 1 ms to minimize.
[2025-06-02 19:36:25] [INFO ] Deduced a trap composed of 46 places in 46 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/458 variables, 8/51 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/458 variables, 0/51 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 1070/1528 variables, 458/509 constraints. Problems are: Problem set: 1 solved, 5 unsolved
SMT process timed out in 5075ms, After SMT, problems are : Problem set: 1 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 10 out of 460 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 460/460 places, 1086/1086 transitions.
Applied a total of 0 rules in 36 ms. Remains 460 /460 variables (removed 0) and now considering 1086/1086 (removed 0) transitions.
Running 1084 sub problems to find dead transitions.
[2025-06-02 19:36:26] [INFO ] Flow matrix only has 1070 transitions (discarded 16 similar events)
[2025-06-02 19:36:26] [INFO ] Invariant cache hit.
[2025-06-02 19:36:26] [INFO ] State equation strengthened by 96 read => feed constraints.
SDD proceeding with computation,6 properties remain. new max is 16384
SDD size :12080 after 28452
At refinement iteration 0 (INCLUDED_ONLY) 0/458 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1084 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/458 variables, 24/42 constraints. Problems are: Problem set: 0 solved, 1084 unsolved
[2025-06-02 19:36:36] [INFO ] Deduced a trap composed of 46 places in 72 ms of which 1 ms to minimize.
[2025-06-02 19:36:36] [INFO ] Deduced a trap composed of 47 places in 74 ms of which 1 ms to minimize.
[2025-06-02 19:36:36] [INFO ] Deduced a trap composed of 47 places in 60 ms of which 0 ms to minimize.
[2025-06-02 19:36:37] [INFO ] Deduced a trap composed of 46 places in 39 ms of which 1 ms to minimize.
[2025-06-02 19:36:37] [INFO ] Deduced a trap composed of 46 places in 42 ms of which 1 ms to minimize.
[2025-06-02 19:36:37] [INFO ] Deduced a trap composed of 31 places in 123 ms of which 2 ms to minimize.
[2025-06-02 19:36:37] [INFO ] Deduced a trap composed of 46 places in 29 ms of which 1 ms to minimize.
[2025-06-02 19:36:37] [INFO ] Deduced a trap composed of 47 places in 43 ms of which 1 ms to minimize.
[2025-06-02 19:36:37] [INFO ] Deduced a trap composed of 47 places in 46 ms of which 0 ms to minimize.
[2025-06-02 19:36:37] [INFO ] Deduced a trap composed of 154 places in 208 ms of which 3 ms to minimize.
[2025-06-02 19:36:38] [INFO ] Deduced a trap composed of 151 places in 214 ms of which 2 ms to minimize.
SDD proceeding with computation,6 properties remain. new max is 32768
SDD size :28452 after 95000
[2025-06-02 19:36:40] [INFO ] Deduced a trap composed of 25 places in 150 ms of which 2 ms to minimize.
[2025-06-02 19:36:40] [INFO ] Deduced a trap composed of 19 places in 148 ms of which 2 ms to minimize.
[2025-06-02 19:36:41] [INFO ] Deduced a trap composed of 34 places in 206 ms of which 2 ms to minimize.
[2025-06-02 19:36:41] [INFO ] Deduced a trap composed of 66 places in 237 ms of which 4 ms to minimize.
[2025-06-02 19:36:45] [INFO ] Deduced a trap composed of 173 places in 205 ms of which 3 ms to minimize.
[2025-06-02 19:36:46] [INFO ] Deduced a trap composed of 211 places in 210 ms of which 2 ms to minimize.
[2025-06-02 19:36:48] [INFO ] Deduced a trap composed of 199 places in 209 ms of which 3 ms to minimize.
[2025-06-02 19:36:48] [INFO ] Deduced a trap composed of 216 places in 221 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 9.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 1.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 1.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 1.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 1.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 1.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 1.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 1.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 9.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 1.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 1.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 1.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 458/1530 variables, and 61 constraints, problems are : Problem set: 0 solved, 1084 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 24/26 constraints, State Equation: 0/460 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1084/1084 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1084 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/458 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1084 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/458 variables, 24/42 constraints. Problems are: Problem set: 0 solved, 1084 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/458 variables, 19/61 constraints. Problems are: Problem set: 0 solved, 1084 unsolved
[2025-06-02 19:36:54] [INFO ] Deduced a trap composed of 195 places in 213 ms of which 3 ms to minimize.
[2025-06-02 19:36:55] [INFO ] Deduced a trap composed of 305 places in 264 ms of which 3 ms to minimize.
[2025-06-02 19:36:57] [INFO ] Deduced a trap composed of 284 places in 206 ms of which 2 ms to minimize.
SDD proceeding with computation,6 properties remain. new max is 65536
SDD size :95000 after 257870
Detected timeout of ITS tools.
[2025-06-02 19:37:08] [INFO ] Flatten gal took : 59 ms
[2025-06-02 19:37:08] [INFO ] Applying decomposition
[2025-06-02 19:37:08] [INFO ] Flatten gal took : 121 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 458/1530 variables, and 64 constraints, problems are : Problem set: 0 solved, 1084 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 24/26 constraints, State Equation: 0/460 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1084 constraints, Known Traps: 22/22 constraints]
After SMT, in 42045ms problems are : Problem set: 0 solved, 1084 unsolved
Search for dead transitions found 0 dead transitions in 42072ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42111 ms. Remains : 460/460 places, 1086/1086 transitions.
RANDOM walk for 40000 steps (27 resets) in 466 ms. (85 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 320 ms. (124 steps per ms) remains 5/5 properties
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/graph6703063192925828913.txt' '-o' '/tmp/graph6703063192925828913.bin' '-w' '/tmp/graph6703063192925828913.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6703063192925828913.bin' '-l' '-1' '-v' '-w' '/tmp/graph6703063192925828913.weights' '-q' '0' '-e' '0.001'
BEST_FIRST walk for 40003 steps (9 resets) in 174 ms. (228 steps per ms) remains 5/5 properties
[2025-06-02 19:37:09] [INFO ] Decomposing Gal with order
[2025-06-02 19:37:09] [INFO ] Rewriting arrays to variables to allow decomposition.
BEST_FIRST walk for 40003 steps (10 resets) in 318 ms. (125 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (10 resets) in 353 ms. (113 steps per ms) remains 5/5 properties
[2025-06-02 19:37:09] [INFO ] Removed a total of 734 redundant transitions.
BEST_FIRST walk for 40002 steps (14 resets) in 321 ms. (124 steps per ms) remains 5/5 properties
[2025-06-02 19:37:10] [INFO ] Flatten gal took : 648 ms
[2025-06-02 19:37:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 524 labels/synchronizations in 78 ms.
[2025-06-02 19:37:10] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9310604144463419741.gal : 24 ms
[2025-06-02 19:37:10] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7253862992262622940.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/ReachabilityCardinality9310604144463419741.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7253862992262622940.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/ReachabilityCardinality7253862992262622940.prop.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :3 after 4
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :4 after 7
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :7 after 9
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :9 after 10
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :10 after 114
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :114 after 462
SDD proceeding with computation,5 properties remain. new max is 512
SDD size :2474 after 2532
SDD proceeding with computation,5 properties remain. new max is 1024
SDD size :2532 after 2594
SDD proceeding with computation,5 properties remain. new max is 2048
SDD size :2594 after 3702
Interrupted probabilistic random walk after 95754 steps, run timeout after 3002 ms. (steps per millisecond=31 ) properties seen :0 out of 5
Probabilistic random walk after 95754 steps, saw 60676 distinct states, run finished after 3003 ms. (steps per millisecond=31 ) properties seen :0
[2025-06-02 19:37:12] [INFO ] Flow matrix only has 1070 transitions (discarded 16 similar events)
[2025-06-02 19:37:12] [INFO ] Invariant cache hit.
[2025-06-02 19:37:12] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 191/201 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/201 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 90/291 variables, 12/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/291 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
SDD proceeding with computation,5 properties remain. new max is 4096
SDD size :3702 after 7334
At refinement iteration 5 (OVERLAPS) 152/443 variables, 20/35 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/443 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 5/448 variables, 5/40 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/448 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 10/458 variables, 3/43 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2025-06-02 19:37:13] [INFO ] Deduced a trap composed of 46 places in 192 ms of which 13 ms to minimize.
[2025-06-02 19:37:13] [INFO ] Deduced a trap composed of 47 places in 144 ms of which 2 ms to minimize.
[2025-06-02 19:37:13] [INFO ] Deduced a trap composed of 47 places in 79 ms of which 2 ms to minimize.
[2025-06-02 19:37:13] [INFO ] Deduced a trap composed of 47 places in 98 ms of which 2 ms to minimize.
[2025-06-02 19:37:13] [INFO ] Deduced a trap composed of 46 places in 47 ms of which 1 ms to minimize.
[2025-06-02 19:37:14] [INFO ] Deduced a trap composed of 47 places in 43 ms of which 1 ms to minimize.
[2025-06-02 19:37:14] [INFO ] Deduced a trap composed of 46 places in 47 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/458 variables, 7/50 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/458 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 5 unsolved
SDD proceeding with computation,5 properties remain. new max is 8192
SDD size :7334 after 11504
At refinement iteration 12 (OVERLAPS) 1070/1528 variables, 458/508 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1528 variables, 96/604 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1528 variables, 0/604 constraints. Problems are: Problem set: 0 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 2/1530 variables, 2/606 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1530 variables, 1/607 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1530 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (OVERLAPS) 0/1530 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1530/1530 variables, and 607 constraints, problems are : Problem set: 0 solved, 5 unsolved in 4117 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 460/460 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 191/201 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/201 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 90/291 variables, 12/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/291 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 152/443 variables, 20/35 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/443 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 5/448 variables, 5/40 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/448 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 10/458 variables, 3/43 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/458 variables, 7/50 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2025-06-02 19:37:17] [INFO ] Deduced a trap composed of 47 places in 42 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/458 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 5 unsolved
SDD proceeding with computation,5 properties remain. new max is 16384
SDD size :25420 after 25648
At refinement iteration 12 (INCLUDED_ONLY) 0/458 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 1070/1528 variables, 458/509 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1528 variables, 96/605 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1528 variables, 5/610 constraints. Problems are: Problem set: 0 solved, 5 unsolved
SDD proceeding with computation,5 properties remain. new max is 32768
SDD size :25648 after 48810
[2025-06-02 19:37:21] [INFO ] Deduced a trap composed of 167 places in 253 ms of which 3 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1528 variables, 1/611 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1528 variables, 0/611 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (OVERLAPS) 2/1530 variables, 2/613 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1530 variables, 1/614 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1530 variables, 0/614 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2025-06-02 19:37:25] [INFO ] Deduced a trap composed of 181 places in 200 ms of which 2 ms to minimize.
[2025-06-02 19:37:27] [INFO ] Deduced a trap composed of 166 places in 200 ms of which 3 ms to minimize.
At refinement iteration 21 (OVERLAPS) 0/1530 variables, 2/616 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1530 variables, 0/616 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 23 (OVERLAPS) 0/1530 variables, 0/616 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1530/1530 variables, and 616 constraints, problems are : Problem set: 0 solved, 5 unsolved in 12982 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 460/460 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 11/11 constraints]
After SMT, in 17135ms problems are : Problem set: 0 solved, 5 unsolved
SDD proceeding with computation,5 properties remain. new max is 65536
SDD size :48810 after 64732
Parikh walk visited 0 properties in 6847 ms.
Support contains 10 out of 460 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 460/460 places, 1086/1086 transitions.
Applied a total of 0 rules in 18 ms. Remains 460 /460 variables (removed 0) and now considering 1086/1086 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 460/460 places, 1086/1086 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 460/460 places, 1086/1086 transitions.
Applied a total of 0 rules in 18 ms. Remains 460 /460 variables (removed 0) and now considering 1086/1086 (removed 0) transitions.
[2025-06-02 19:37:36] [INFO ] Flow matrix only has 1070 transitions (discarded 16 similar events)
[2025-06-02 19:37:36] [INFO ] Invariant cache hit.
[2025-06-02 19:37:37] [INFO ] Implicit Places using invariants in 559 ms returned []
[2025-06-02 19:37:37] [INFO ] Flow matrix only has 1070 transitions (discarded 16 similar events)
[2025-06-02 19:37:37] [INFO ] Invariant cache hit.
[2025-06-02 19:37:38] [INFO ] State equation strengthened by 96 read => feed constraints.
[2025-06-02 19:37:45] [INFO ] Implicit Places using invariants and state equation in 8456 ms returned []
Implicit Place search using SMT with State Equation took 9021 ms to find 0 implicit places.
[2025-06-02 19:37:45] [INFO ] Redundant transitions in 42 ms returned []
Running 1084 sub problems to find dead transitions.
[2025-06-02 19:37:45] [INFO ] Flow matrix only has 1070 transitions (discarded 16 similar events)
[2025-06-02 19:37:45] [INFO ] Invariant cache hit.
[2025-06-02 19:37:45] [INFO ] State equation strengthened by 96 read => feed constraints.
SDD proceeding with computation,5 properties remain. new max is 131072
SDD size :64732 after 115178
At refinement iteration 0 (INCLUDED_ONLY) 0/458 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1084 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/458 variables, 24/42 constraints. Problems are: Problem set: 0 solved, 1084 unsolved
[2025-06-02 19:37:55] [INFO ] Deduced a trap composed of 46 places in 72 ms of which 2 ms to minimize.
[2025-06-02 19:37:56] [INFO ] Deduced a trap composed of 47 places in 68 ms of which 1 ms to minimize.
[2025-06-02 19:37:56] [INFO ] Deduced a trap composed of 47 places in 57 ms of which 1 ms to minimize.
[2025-06-02 19:37:56] [INFO ] Deduced a trap composed of 46 places in 45 ms of which 0 ms to minimize.
[2025-06-02 19:37:56] [INFO ] Deduced a trap composed of 46 places in 34 ms of which 5 ms to minimize.
[2025-06-02 19:37:56] [INFO ] Deduced a trap composed of 31 places in 181 ms of which 1 ms to minimize.
[2025-06-02 19:37:56] [INFO ] Deduced a trap composed of 46 places in 49 ms of which 0 ms to minimize.
[2025-06-02 19:37:56] [INFO ] Deduced a trap composed of 47 places in 44 ms of which 0 ms to minimize.
[2025-06-02 19:37:56] [INFO ] Deduced a trap composed of 47 places in 45 ms of which 0 ms to minimize.
[2025-06-02 19:37:57] [INFO ] Deduced a trap composed of 154 places in 237 ms of which 3 ms to minimize.
[2025-06-02 19:37:57] [INFO ] Deduced a trap composed of 151 places in 218 ms of which 6 ms to minimize.
[2025-06-02 19:37:59] [INFO ] Deduced a trap composed of 25 places in 157 ms of which 2 ms to minimize.
[2025-06-02 19:37:59] [INFO ] Deduced a trap composed of 19 places in 209 ms of which 3 ms to minimize.
Detected timeout of ITS tools.
[2025-06-02 19:38:00] [INFO ] Deduced a trap composed of 34 places in 207 ms of which 3 ms to minimize.
[2025-06-02 19:38:01] [INFO ] Deduced a trap composed of 66 places in 199 ms of which 5 ms to minimize.
[2025-06-02 19:38:04] [INFO ] Deduced a trap composed of 173 places in 211 ms of which 2 ms to minimize.
[2025-06-02 19:38:05] [INFO ] Deduced a trap composed of 211 places in 200 ms of which 3 ms to minimize.
[2025-06-02 19:38:07] [INFO ] Deduced a trap composed of 199 places in 197 ms of which 2 ms to minimize.
[2025-06-02 19:38:07] [INFO ] Deduced a trap composed of 216 places in 211 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/458 variables, 19/61 constraints. Problems are: Problem set: 0 solved, 1084 unsolved
[2025-06-02 19:38:11] [INFO ] Deduced a trap composed of 284 places in 197 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 458/1530 variables, and 62 constraints, problems are : Problem set: 0 solved, 1084 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 24/26 constraints, State Equation: 0/460 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1084/1084 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1084 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/458 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1084 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/458 variables, 24/42 constraints. Problems are: Problem set: 0 solved, 1084 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/458 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1084 unsolved
[2025-06-02 19:38:38] [INFO ] Deduced a trap composed of 220 places in 211 ms of which 3 ms to minimize.
[2025-06-02 19:38:39] [INFO ] Deduced a trap composed of 186 places in 209 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/458 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 1084 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 458/1530 variables, and 64 constraints, problems are : Problem set: 0 solved, 1084 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 24/26 constraints, State Equation: 0/460 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1084 constraints, Known Traps: 22/22 constraints]
After SMT, in 62005ms problems are : Problem set: 0 solved, 1084 unsolved
Search for dead transitions found 0 dead transitions in 62015ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71129 ms. Remains : 460/460 places, 1086/1086 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[2, 2, 2] Max Struct:[32, 4, 4]
Starting property specific reduction for PolyORBLF-PT-S02J06T08-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:[32]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[32]
[2025-06-02 19:38:47] [INFO ] Flow matrix only has 1070 transitions (discarded 16 similar events)
[2025-06-02 19:38:47] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[32]
RANDOM walk for 10000 steps (3 resets) in 46 ms. (212 steps per ms)
BEST_FIRST walk for 10000 steps (2 resets) in 23 ms. (416 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[32]
[2025-06-02 19:38:47] [INFO ] Flow matrix only has 1070 transitions (discarded 16 similar events)
[2025-06-02 19:38:47] [INFO ] Invariant cache hit.
[2025-06-02 19:38:48] [INFO ] [Real]Absence check using 18 positive place invariants in 6 ms returned sat
[2025-06-02 19:38:48] [INFO ] [Real]Absence check using 18 positive and 26 generalized place invariants in 13 ms returned sat
[2025-06-02 19:38:48] [INFO ] [Real]Absence check using state equation in 761 ms returned sat
[2025-06-02 19:38:48] [INFO ] State equation strengthened by 96 read => feed constraints.
[2025-06-02 19:38:49] [INFO ] [Real]Added 96 Read/Feed constraints in 294 ms returned sat
[2025-06-02 19:38:49] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:38:49] [INFO ] [Nat]Absence check using 18 positive place invariants in 6 ms returned sat
[2025-06-02 19:38:49] [INFO ] [Nat]Absence check using 18 positive and 26 generalized place invariants in 12 ms returned sat
[2025-06-02 19:38:50] [INFO ] [Nat]Absence check using state equation in 989 ms returned sat
[2025-06-02 19:38:50] [INFO ] [Nat]Added 96 Read/Feed constraints in 329 ms returned sat
[2025-06-02 19:38:50] [INFO ] Computed and/alt/rep : 416/1493/408 causal constraints (skipped 660 transitions) in 55 ms.
[2025-06-02 19:38:51] [INFO ] Deduced a trap composed of 219 places in 225 ms of which 2 ms to minimize.
[2025-06-02 19:38:52] [INFO ] Deduced a trap composed of 19 places in 221 ms of which 3 ms to minimize.
[2025-06-02 19:38:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 736 ms
[2025-06-02 19:38:52] [INFO ] Added : 52 causal constraints over 12 iterations in 1870 ms. Result :sat
Minimization took 551 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[32]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[32]
Support contains 8 out of 460 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 460/460 places, 1086/1086 transitions.
Applied a total of 0 rules in 23 ms. Remains 460 /460 variables (removed 0) and now considering 1086/1086 (removed 0) transitions.
Running 1084 sub problems to find dead transitions.
[2025-06-02 19:38:53] [INFO ] Flow matrix only has 1070 transitions (discarded 16 similar events)
[2025-06-02 19:38:53] [INFO ] Invariant cache hit.
[2025-06-02 19:38:53] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/458 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1084 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/458 variables, 24/42 constraints. Problems are: Problem set: 0 solved, 1084 unsolved
[2025-06-02 19:39:02] [INFO ] Deduced a trap composed of 46 places in 78 ms of which 2 ms to minimize.
[2025-06-02 19:39:02] [INFO ] Deduced a trap composed of 47 places in 62 ms of which 1 ms to minimize.
[2025-06-02 19:39:02] [INFO ] Deduced a trap composed of 47 places in 45 ms of which 1 ms to minimize.
[2025-06-02 19:39:02] [INFO ] Deduced a trap composed of 46 places in 32 ms of which 0 ms to minimize.
[2025-06-02 19:39:02] [INFO ] Deduced a trap composed of 46 places in 35 ms of which 1 ms to minimize.
[2025-06-02 19:39:02] [INFO ] Deduced a trap composed of 31 places in 112 ms of which 2 ms to minimize.
[2025-06-02 19:39:02] [INFO ] Deduced a trap composed of 46 places in 39 ms of which 1 ms to minimize.
[2025-06-02 19:39:03] [INFO ] Deduced a trap composed of 47 places in 32 ms of which 1 ms to minimize.
[2025-06-02 19:39:03] [INFO ] Deduced a trap composed of 47 places in 44 ms of which 0 ms to minimize.
[2025-06-02 19:39:03] [INFO ] Deduced a trap composed of 154 places in 192 ms of which 2 ms to minimize.
[2025-06-02 19:39:03] [INFO ] Deduced a trap composed of 151 places in 200 ms of which 2 ms to minimize.
[2025-06-02 19:39:05] [INFO ] Deduced a trap composed of 25 places in 132 ms of which 2 ms to minimize.
[2025-06-02 19:39:06] [INFO ] Deduced a trap composed of 19 places in 158 ms of which 3 ms to minimize.
[2025-06-02 19:39:07] [INFO ] Deduced a trap composed of 34 places in 202 ms of which 2 ms to minimize.
[2025-06-02 19:39:07] [INFO ] Deduced a trap composed of 66 places in 192 ms of which 2 ms to minimize.
[2025-06-02 19:39:11] [INFO ] Deduced a trap composed of 173 places in 188 ms of which 2 ms to minimize.
[2025-06-02 19:39:12] [INFO ] Deduced a trap composed of 211 places in 205 ms of which 2 ms to minimize.
[2025-06-02 19:39:13] [INFO ] Deduced a trap composed of 199 places in 202 ms of which 3 ms to minimize.
[2025-06-02 19:39:14] [INFO ] Deduced a trap composed of 216 places in 231 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 458/1530 variables, and 61 constraints, problems are : Problem set: 0 solved, 1084 unsolved in 20016 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 24/26 constraints, State Equation: 0/460 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1084/1084 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1084 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/458 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1084 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/458 variables, 24/42 constraints. Problems are: Problem set: 0 solved, 1084 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/458 variables, 19/61 constraints. Problems are: Problem set: 0 solved, 1084 unsolved
[2025-06-02 19:39:20] [INFO ] Deduced a trap composed of 195 places in 205 ms of which 3 ms to minimize.
[2025-06-02 19:39:21] [INFO ] Deduced a trap composed of 305 places in 204 ms of which 3 ms to minimize.
[2025-06-02 19:39:22] [INFO ] Deduced a trap composed of 284 places in 189 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 458/1530 variables, and 64 constraints, problems are : Problem set: 0 solved, 1084 unsolved in 20016 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 24/26 constraints, State Equation: 0/460 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1084 constraints, Known Traps: 22/22 constraints]
After SMT, in 41760ms problems are : Problem set: 0 solved, 1084 unsolved
Search for dead transitions found 0 dead transitions in 41769ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41794 ms. Remains : 460/460 places, 1086/1086 transitions.
[2025-06-02 19:39:34] [INFO ] Flow matrix only has 1070 transitions (discarded 16 similar events)
[2025-06-02 19:39:34] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2] Max Struct:[32]
RANDOM walk for 1000000 steps (395 resets) in 4698 ms. (212 steps per ms)
BEST_FIRST walk for 1000000 steps (150 resets) in 2164 ms. (461 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[32]
[2025-06-02 19:39:41] [INFO ] Flow matrix only has 1070 transitions (discarded 16 similar events)
[2025-06-02 19:39:41] [INFO ] Invariant cache hit.
[2025-06-02 19:39:41] [INFO ] [Real]Absence check using 18 positive place invariants in 6 ms returned sat
[2025-06-02 19:39:41] [INFO ] [Real]Absence check using 18 positive and 26 generalized place invariants in 12 ms returned sat
[2025-06-02 19:39:42] [INFO ] [Real]Absence check using state equation in 738 ms returned sat
[2025-06-02 19:39:42] [INFO ] State equation strengthened by 96 read => feed constraints.
[2025-06-02 19:39:42] [INFO ] [Real]Added 96 Read/Feed constraints in 290 ms returned sat
[2025-06-02 19:39:42] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:39:42] [INFO ] [Nat]Absence check using 18 positive place invariants in 6 ms returned sat
[2025-06-02 19:39:42] [INFO ] [Nat]Absence check using 18 positive and 26 generalized place invariants in 12 ms returned sat
[2025-06-02 19:39:43] [INFO ] [Nat]Absence check using state equation in 997 ms returned sat
[2025-06-02 19:39:44] [INFO ] [Nat]Added 96 Read/Feed constraints in 330 ms returned sat
[2025-06-02 19:39:44] [INFO ] Computed and/alt/rep : 416/1493/408 causal constraints (skipped 660 transitions) in 52 ms.
[2025-06-02 19:39:45] [INFO ] Deduced a trap composed of 219 places in 206 ms of which 3 ms to minimize.
[2025-06-02 19:39:45] [INFO ] Deduced a trap composed of 19 places in 207 ms of which 3 ms to minimize.
[2025-06-02 19:39:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 695 ms
[2025-06-02 19:39:46] [INFO ] Added : 52 causal constraints over 12 iterations in 1811 ms. Result :sat
Minimization took 4505 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[32]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[32]
Support contains 8 out of 460 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 460/460 places, 1086/1086 transitions.
Applied a total of 0 rules in 22 ms. Remains 460 /460 variables (removed 0) and now considering 1086/1086 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 460/460 places, 1086/1086 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 460/460 places, 1086/1086 transitions.
Applied a total of 0 rules in 17 ms. Remains 460 /460 variables (removed 0) and now considering 1086/1086 (removed 0) transitions.
[2025-06-02 19:39:50] [INFO ] Flow matrix only has 1070 transitions (discarded 16 similar events)
[2025-06-02 19:39:50] [INFO ] Invariant cache hit.
[2025-06-02 19:39:51] [INFO ] Implicit Places using invariants in 498 ms returned []
[2025-06-02 19:39:51] [INFO ] Flow matrix only has 1070 transitions (discarded 16 similar events)
[2025-06-02 19:39:51] [INFO ] Invariant cache hit.
[2025-06-02 19:39:52] [INFO ] State equation strengthened by 96 read => feed constraints.
[2025-06-02 19:39:59] [INFO ] Implicit Places using invariants and state equation in 8090 ms returned []
Implicit Place search using SMT with State Equation took 8590 ms to find 0 implicit places.
[2025-06-02 19:39:59] [INFO ] Redundant transitions in 20 ms returned []
Running 1084 sub problems to find dead transitions.
[2025-06-02 19:39:59] [INFO ] Flow matrix only has 1070 transitions (discarded 16 similar events)
[2025-06-02 19:39:59] [INFO ] Invariant cache hit.
[2025-06-02 19:39:59] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/458 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1084 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/458 variables, 24/42 constraints. Problems are: Problem set: 0 solved, 1084 unsolved
[2025-06-02 19:40:08] [INFO ] Deduced a trap composed of 46 places in 73 ms of which 2 ms to minimize.
[2025-06-02 19:40:09] [INFO ] Deduced a trap composed of 47 places in 66 ms of which 1 ms to minimize.
[2025-06-02 19:40:09] [INFO ] Deduced a trap composed of 47 places in 49 ms of which 1 ms to minimize.
[2025-06-02 19:40:09] [INFO ] Deduced a trap composed of 46 places in 31 ms of which 1 ms to minimize.
[2025-06-02 19:40:09] [INFO ] Deduced a trap composed of 46 places in 33 ms of which 0 ms to minimize.
[2025-06-02 19:40:09] [INFO ] Deduced a trap composed of 31 places in 110 ms of which 2 ms to minimize.
[2025-06-02 19:40:09] [INFO ] Deduced a trap composed of 46 places in 37 ms of which 0 ms to minimize.
[2025-06-02 19:40:09] [INFO ] Deduced a trap composed of 47 places in 39 ms of which 1 ms to minimize.
[2025-06-02 19:40:09] [INFO ] Deduced a trap composed of 47 places in 38 ms of which 0 ms to minimize.
[2025-06-02 19:40:09] [INFO ] Deduced a trap composed of 154 places in 200 ms of which 3 ms to minimize.
[2025-06-02 19:40:10] [INFO ] Deduced a trap composed of 151 places in 203 ms of which 3 ms to minimize.
[2025-06-02 19:40:12] [INFO ] Deduced a trap composed of 25 places in 135 ms of which 2 ms to minimize.
[2025-06-02 19:40:12] [INFO ] Deduced a trap composed of 19 places in 138 ms of which 2 ms to minimize.
[2025-06-02 19:40:13] [INFO ] Deduced a trap composed of 34 places in 202 ms of which 3 ms to minimize.
[2025-06-02 19:40:13] [INFO ] Deduced a trap composed of 66 places in 206 ms of which 3 ms to minimize.
[2025-06-02 19:40:17] [INFO ] Deduced a trap composed of 173 places in 198 ms of which 3 ms to minimize.
[2025-06-02 19:40:18] [INFO ] Deduced a trap composed of 211 places in 201 ms of which 2 ms to minimize.
[2025-06-02 19:40:20] [INFO ] Deduced a trap composed of 199 places in 193 ms of which 2 ms to minimize.
[2025-06-02 19:40:20] [INFO ] Deduced a trap composed of 216 places in 213 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/458 variables, 19/61 constraints. Problems are: Problem set: 0 solved, 1084 unsolved
[2025-06-02 19:40:24] [INFO ] Deduced a trap composed of 284 places in 196 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 10.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 1.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 1.0)
(s103 0.0)
(s104 0.0)
(s105 1.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 10.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 1.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 1.0)
(s145 0.0)
(s146 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 458/1530 variables, and 62 constraints, problems are : Problem set: 0 solved, 1084 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 24/26 constraints, State Equation: 0/460 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1084/1084 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1084 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/458 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1084 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/458 variables, 24/42 constraints. Problems are: Problem set: 0 solved, 1084 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/458 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1084 unsolved
[2025-06-02 19:40:52] [INFO ] Deduced a trap composed of 220 places in 221 ms of which 2 ms to minimize.
[2025-06-02 19:40:52] [INFO ] Deduced a trap composed of 186 places in 214 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/458 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 1084 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 458/1530 variables, and 64 constraints, problems are : Problem set: 0 solved, 1084 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 24/26 constraints, State Equation: 0/460 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1084 constraints, Known Traps: 22/22 constraints]
After SMT, in 61600ms problems are : Problem set: 0 solved, 1084 unsolved
Search for dead transitions found 0 dead transitions in 61609ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70248 ms. Remains : 460/460 places, 1086/1086 transitions.
[2025-06-02 19:41:01] [INFO ] Flatten gal took : 146 ms
RANDOM walk for 40000 steps (13 resets) in 641 ms. (62 steps per ms) remains 2/2 properties
[2025-06-02 19:41:01] [INFO ] Flatten gal took : 117 ms
[2025-06-02 19:41:01] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6807361522548098462.gal : 9 ms
[2025-06-02 19:41:01] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5691079607534356338.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/ReachabilityCardinality6807361522548098462.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5691079607534356338.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 40003 steps (9 resets) in 249 ms. (160 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality5691079607534356338.prop.
BEST_FIRST walk for 40001 steps (10 resets) in 355 ms. (112 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 14
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :14 after 22
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :22 after 80
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :80 after 234
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :234 after 1638
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :1638 after 1666
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :1666 after 1714
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1714 after 1798
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1798 after 1970
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1970 after 2372
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :2372 after 5420
Interrupted probabilistic random walk after 132117 steps, run timeout after 3001 ms. (steps per millisecond=44 ) properties seen :0 out of 2
Probabilistic random walk after 132117 steps, saw 82632 distinct states, run finished after 3001 ms. (steps per millisecond=44 ) properties seen :0
[2025-06-02 19:41:04] [INFO ] Flow matrix only has 1070 transitions (discarded 16 similar events)
[2025-06-02 19:41:04] [INFO ] Invariant cache hit.
[2025-06-02 19:41:04] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 192/200 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 90/290 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/290 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
At refinement iteration 5 (OVERLAPS) 153/443 variables, 21/35 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/443 variables, 0/35 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 5/448 variables, 5/40 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/448 variables, 0/40 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 10/458 variables, 3/43 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2025-06-02 19:41:04] [INFO ] Deduced a trap composed of 46 places in 122 ms of which 2 ms to minimize.
[2025-06-02 19:41:04] [INFO ] Deduced a trap composed of 46 places in 105 ms of which 2 ms to minimize.
[2025-06-02 19:41:04] [INFO ] Deduced a trap composed of 47 places in 90 ms of which 1 ms to minimize.
[2025-06-02 19:41:05] [INFO ] Deduced a trap composed of 47 places in 72 ms of which 1 ms to minimize.
[2025-06-02 19:41:05] [INFO ] Deduced a trap composed of 47 places in 71 ms of which 1 ms to minimize.
[2025-06-02 19:41:05] [INFO ] Deduced a trap composed of 47 places in 57 ms of which 1 ms to minimize.
[2025-06-02 19:41:05] [INFO ] Deduced a trap composed of 46 places in 43 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/458 variables, 7/50 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/458 variables, 0/50 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1528/1530 variables, and 508 constraints, problems are : Problem set: 1 solved, 1 unsolved in 2543 ms.
Refiners :[Positive P Invariants (semi-flows): 17/18 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 458/460 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 192/200 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 90/290 variables, 12/14 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2025-06-02 19:41:07] [INFO ] Deduced a trap composed of 31 places in 81 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/290 variables, 1/15 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/290 variables, 0/15 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 153/443 variables, 21/36 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/443 variables, 0/36 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 5/448 variables, 5/41 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/448 variables, 0/41 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 10/458 variables, 3/44 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/458 variables, 7/51 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/458 variables, 0/51 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Solver is answering 'unknown', stopping.
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :5420 after 12080
After SMT solving in domain Int declared 1528/1530 variables, and 509 constraints, problems are : Problem set: 1 solved, 1 unsolved in 1386 ms.
Refiners :[Positive P Invariants (semi-flows): 17/18 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 458/460 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 8/8 constraints]
After SMT, in 3948ms problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 8 out of 460 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 460/460 places, 1086/1086 transitions.
Applied a total of 0 rules in 22 ms. Remains 460 /460 variables (removed 0) and now considering 1086/1086 (removed 0) transitions.
Running 1084 sub problems to find dead transitions.
[2025-06-02 19:41:08] [INFO ] Flow matrix only has 1070 transitions (discarded 16 similar events)
[2025-06-02 19:41:08] [INFO ] Invariant cache hit.
[2025-06-02 19:41:08] [INFO ] State equation strengthened by 96 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :12080 after 28452
At refinement iteration 0 (INCLUDED_ONLY) 0/458 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1084 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/458 variables, 24/42 constraints. Problems are: Problem set: 0 solved, 1084 unsolved
[2025-06-02 19:41:18] [INFO ] Deduced a trap composed of 46 places in 93 ms of which 2 ms to minimize.
[2025-06-02 19:41:18] [INFO ] Deduced a trap composed of 47 places in 66 ms of which 1 ms to minimize.
[2025-06-02 19:41:18] [INFO ] Deduced a trap composed of 47 places in 57 ms of which 1 ms to minimize.
[2025-06-02 19:41:18] [INFO ] Deduced a trap composed of 46 places in 42 ms of which 0 ms to minimize.
[2025-06-02 19:41:18] [INFO ] Deduced a trap composed of 46 places in 43 ms of which 1 ms to minimize.
[2025-06-02 19:41:18] [INFO ] Deduced a trap composed of 31 places in 120 ms of which 1 ms to minimize.
[2025-06-02 19:41:18] [INFO ] Deduced a trap composed of 46 places in 40 ms of which 1 ms to minimize.
[2025-06-02 19:41:18] [INFO ] Deduced a trap composed of 47 places in 37 ms of which 1 ms to minimize.
[2025-06-02 19:41:18] [INFO ] Deduced a trap composed of 47 places in 45 ms of which 1 ms to minimize.
[2025-06-02 19:41:19] [INFO ] Deduced a trap composed of 154 places in 206 ms of which 3 ms to minimize.
[2025-06-02 19:41:19] [INFO ] Deduced a trap composed of 151 places in 203 ms of which 2 ms to minimize.
[2025-06-02 19:41:21] [INFO ] Deduced a trap composed of 25 places in 139 ms of which 2 ms to minimize.
[2025-06-02 19:41:22] [INFO ] Deduced a trap composed of 19 places in 147 ms of which 2 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :28452 after 95000
[2025-06-02 19:41:23] [INFO ] Deduced a trap composed of 34 places in 205 ms of which 2 ms to minimize.
[2025-06-02 19:41:23] [INFO ] Deduced a trap composed of 66 places in 204 ms of which 3 ms to minimize.
[2025-06-02 19:41:27] [INFO ] Deduced a trap composed of 173 places in 189 ms of which 2 ms to minimize.
[2025-06-02 19:41:28] [INFO ] Deduced a trap composed of 211 places in 195 ms of which 2 ms to minimize.
[2025-06-02 19:41:29] [INFO ] Deduced a trap composed of 199 places in 214 ms of which 2 ms to minimize.
[2025-06-02 19:41:30] [INFO ] Deduced a trap composed of 216 places in 221 ms of which 3 ms to minimize.
SMT process timed out in 21686ms, After SMT, problems are : Problem set: 0 solved, 1084 unsolved
Search for dead transitions found 0 dead transitions in 21696ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21720 ms. Remains : 460/460 places, 1086/1086 transitions.
RANDOM walk for 40000 steps (16 resets) in 332 ms. (120 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (13 resets) in 141 ms. (281 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 176220 steps, run timeout after 3001 ms. (steps per millisecond=58 ) properties seen :0 out of 1
Probabilistic random walk after 176220 steps, saw 108840 distinct states, run finished after 3001 ms. (steps per millisecond=58 ) properties seen :0
[2025-06-02 19:41:33] [INFO ] Flow matrix only has 1070 transitions (discarded 16 similar events)
[2025-06-02 19:41:33] [INFO ] Invariant cache hit.
[2025-06-02 19:41:33] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 192/200 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 90/290 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/290 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 153/443 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/443 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 5/448 variables, 5/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/448 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 10/458 variables, 3/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/458 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :95000 after 257870
Detected timeout of ITS tools.
[2025-06-02 19:41:51] [INFO ] Flatten gal took : 41 ms
[2025-06-02 19:41:51] [INFO ] Applying decomposition
[2025-06-02 19:41:51] [INFO ] Flatten gal took : 41 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/graph10248575853356373895.txt' '-o' '/tmp/graph10248575853356373895.bin' '-w' '/tmp/graph10248575853356373895.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10248575853356373895.bin' '-l' '-1' '-v' '-w' '/tmp/graph10248575853356373895.weights' '-q' '0' '-e' '0.001'
[2025-06-02 19:41:51] [INFO ] Decomposing Gal with order
[2025-06-02 19:41:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 19:41:51] [INFO ] Removed a total of 1017 redundant transitions.
[2025-06-02 19:41:51] [INFO ] Flatten gal took : 216 ms
[2025-06-02 19:41:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 354 labels/synchronizations in 55 ms.
[2025-06-02 19:41:52] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5284417409789801252.gal : 8 ms
[2025-06-02 19:41:52] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4861977230120962087.prop : 17 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/ReachabilityCardinality5284417409789801252.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4861977230120962087.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/ReachabilityCardinality4861977230120962087.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 11
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :11 after 71
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :71 after 80
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :80 after 156
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :156 after 234
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :234 after 2883
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :2883 after 2919
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :2919 after 2973
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :2973 after 3156
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :3156 after 3280
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :3280 after 3946
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :3946 after 25406
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :25406 after 39856
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1528/1530 variables, and 501 constraints, problems are : Problem set: 0 solved, 1 unsolved in 45022 ms.
Refiners :[Positive P Invariants (semi-flows): 17/18 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 458/460 constraints, ReadFeed: 0/96 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/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 192/200 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 90/290 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 19:42:18] [INFO ] Deduced a trap composed of 31 places in 76 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/290 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/290 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 153/443 variables, 21/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/443 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 5/448 variables, 5/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/448 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 10/458 variables, 3/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 19:42:18] [INFO ] Deduced a trap composed of 47 places in 117 ms of which 2 ms to minimize.
[2025-06-02 19:42:18] [INFO ] Deduced a trap composed of 46 places in 103 ms of which 2 ms to minimize.
[2025-06-02 19:42:18] [INFO ] Deduced a trap composed of 47 places in 87 ms of which 1 ms to minimize.
[2025-06-02 19:42:18] [INFO ] Deduced a trap composed of 47 places in 69 ms of which 1 ms to minimize.
[2025-06-02 19:42:18] [INFO ] Deduced a trap composed of 47 places in 58 ms of which 1 ms to minimize.
[2025-06-02 19:42:18] [INFO ] Deduced a trap composed of 46 places in 41 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/458 variables, 6/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/458 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1070/1528 variables, 458/508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1528 variables, 96/604 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1528 variables, 1/605 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1528 variables, 0/605 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/1530 variables, 2/607 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1530 variables, 1/608 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 19:42:20] [INFO ] Deduced a trap composed of 19 places in 204 ms of which 3 ms to minimize.
[2025-06-02 19:42:20] [INFO ] Deduced a trap composed of 195 places in 216 ms of which 3 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/1530 variables, 2/610 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1530 variables, 0/610 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/1530 variables, 0/610 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1530/1530 variables, and 610 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2471 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 460/460 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 9/9 constraints]
After SMT, in 47511ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 27 ms.
Support contains 8 out of 460 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 460/460 places, 1086/1086 transitions.
Applied a total of 0 rules in 19 ms. Remains 460 /460 variables (removed 0) and now considering 1086/1086 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 460/460 places, 1086/1086 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 460/460 places, 1086/1086 transitions.
Applied a total of 0 rules in 16 ms. Remains 460 /460 variables (removed 0) and now considering 1086/1086 (removed 0) transitions.
[2025-06-02 19:42:20] [INFO ] Flow matrix only has 1070 transitions (discarded 16 similar events)
[2025-06-02 19:42:20] [INFO ] Invariant cache hit.
[2025-06-02 19:42:21] [INFO ] Implicit Places using invariants in 623 ms returned []
[2025-06-02 19:42:21] [INFO ] Flow matrix only has 1070 transitions (discarded 16 similar events)
[2025-06-02 19:42:21] [INFO ] Invariant cache hit.
[2025-06-02 19:42:22] [INFO ] State equation strengthened by 96 read => feed constraints.
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :39856 after 80698
[2025-06-02 19:42:29] [INFO ] Implicit Places using invariants and state equation in 8446 ms returned []
Implicit Place search using SMT with State Equation took 9082 ms to find 0 implicit places.
[2025-06-02 19:42:29] [INFO ] Redundant transitions in 18 ms returned []
Running 1084 sub problems to find dead transitions.
[2025-06-02 19:42:29] [INFO ] Flow matrix only has 1070 transitions (discarded 16 similar events)
[2025-06-02 19:42:29] [INFO ] Invariant cache hit.
[2025-06-02 19:42:29] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/458 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1084 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/458 variables, 24/42 constraints. Problems are: Problem set: 0 solved, 1084 unsolved
[2025-06-02 19:42:39] [INFO ] Deduced a trap composed of 46 places in 89 ms of which 1 ms to minimize.
[2025-06-02 19:42:39] [INFO ] Deduced a trap composed of 47 places in 72 ms of which 1 ms to minimize.
[2025-06-02 19:42:39] [INFO ] Deduced a trap composed of 47 places in 53 ms of which 1 ms to minimize.
[2025-06-02 19:42:39] [INFO ] Deduced a trap composed of 46 places in 42 ms of which 1 ms to minimize.
[2025-06-02 19:42:39] [INFO ] Deduced a trap composed of 46 places in 31 ms of which 1 ms to minimize.
[2025-06-02 19:42:39] [INFO ] Deduced a trap composed of 31 places in 115 ms of which 2 ms to minimize.
[2025-06-02 19:42:39] [INFO ] Deduced a trap composed of 46 places in 46 ms of which 1 ms to minimize.
[2025-06-02 19:42:40] [INFO ] Deduced a trap composed of 47 places in 42 ms of which 0 ms to minimize.
[2025-06-02 19:42:40] [INFO ] Deduced a trap composed of 47 places in 42 ms of which 0 ms to minimize.
[2025-06-02 19:42:40] [INFO ] Deduced a trap composed of 154 places in 215 ms of which 3 ms to minimize.
[2025-06-02 19:42:40] [INFO ] Deduced a trap composed of 151 places in 208 ms of which 2 ms to minimize.
Detected timeout of ITS tools.
[2025-06-02 19:42:43] [INFO ] Deduced a trap composed of 25 places in 135 ms of which 2 ms to minimize.
[2025-06-02 19:42:43] [INFO ] Deduced a trap composed of 19 places in 145 ms of which 5 ms to minimize.
[2025-06-02 19:42:44] [INFO ] Deduced a trap composed of 34 places in 189 ms of which 2 ms to minimize.
[2025-06-02 19:42:44] [INFO ] Deduced a trap composed of 66 places in 194 ms of which 3 ms to minimize.
[2025-06-02 19:42:48] [INFO ] Deduced a trap composed of 173 places in 196 ms of which 2 ms to minimize.
[2025-06-02 19:42:49] [INFO ] Deduced a trap composed of 211 places in 196 ms of which 3 ms to minimize.
[2025-06-02 19:42:50] [INFO ] Deduced a trap composed of 199 places in 200 ms of which 2 ms to minimize.
[2025-06-02 19:42:51] [INFO ] Deduced a trap composed of 216 places in 213 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/458 variables, 19/61 constraints. Problems are: Problem set: 0 solved, 1084 unsolved
[2025-06-02 19:42:54] [INFO ] Deduced a trap composed of 284 places in 199 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 458/1530 variables, and 62 constraints, problems are : Problem set: 0 solved, 1084 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 24/26 constraints, State Equation: 0/460 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1084/1084 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1084 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/458 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1084 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/458 variables, 24/42 constraints. Problems are: Problem set: 0 solved, 1084 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/458 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1084 unsolved
[2025-06-02 19:43:22] [INFO ] Deduced a trap composed of 220 places in 216 ms of which 3 ms to minimize.
[2025-06-02 19:43:22] [INFO ] Deduced a trap composed of 186 places in 207 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/458 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 1084 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 458/1530 variables, and 64 constraints, problems are : Problem set: 0 solved, 1084 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 24/26 constraints, State Equation: 0/460 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1084 constraints, Known Traps: 22/22 constraints]
After SMT, in 61784ms problems are : Problem set: 0 solved, 1084 unsolved
Search for dead transitions found 0 dead transitions in 61794ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70928 ms. Remains : 460/460 places, 1086/1086 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[2] Max Struct:[32]
Ending property specific reduction for PolyORBLF-PT-S02J06T08-UpperBounds-01 in 283798 ms.
Starting property specific reduction for PolyORBLF-PT-S02J06T08-UpperBounds-11
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:[4]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[4]
[2025-06-02 19:43:31] [INFO ] Flow matrix only has 1070 transitions (discarded 16 similar events)
[2025-06-02 19:43:31] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[4]
RANDOM walk for 10000 steps (4 resets) in 44 ms. (222 steps per ms)
BEST_FIRST walk for 10000 steps (4 resets) in 21 ms. (454 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[4]
[2025-06-02 19:43:31] [INFO ] Flow matrix only has 1070 transitions (discarded 16 similar events)
[2025-06-02 19:43:31] [INFO ] Invariant cache hit.
[2025-06-02 19:43:31] [INFO ] [Real]Absence check using 18 positive place invariants in 6 ms returned sat
[2025-06-02 19:43:31] [INFO ] [Real]Absence check using 18 positive and 26 generalized place invariants in 11 ms returned sat
[2025-06-02 19:43:32] [INFO ] [Real]Absence check using state equation in 686 ms returned sat
[2025-06-02 19:43:32] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:43:32] [INFO ] [Nat]Absence check using 18 positive place invariants in 6 ms returned sat
[2025-06-02 19:43:32] [INFO ] [Nat]Absence check using 18 positive and 26 generalized place invariants in 11 ms returned sat
[2025-06-02 19:43:33] [INFO ] [Nat]Absence check using state equation in 1163 ms returned sat
[2025-06-02 19:43:33] [INFO ] State equation strengthened by 96 read => feed constraints.
[2025-06-02 19:43:34] [INFO ] [Nat]Added 96 Read/Feed constraints in 309 ms returned sat
[2025-06-02 19:43:34] [INFO ] Computed and/alt/rep : 416/1493/408 causal constraints (skipped 660 transitions) in 48 ms.
[2025-06-02 19:43:36] [INFO ] Deduced a trap composed of 170 places in 219 ms of which 3 ms to minimize.
[2025-06-02 19:43:36] [INFO ] Deduced a trap composed of 48 places in 208 ms of which 3 ms to minimize.
[2025-06-02 19:43:37] [INFO ] Deduced a trap composed of 46 places in 210 ms of which 2 ms to minimize.
[2025-06-02 19:43:37] [INFO ] Deduced a trap composed of 19 places in 211 ms of which 2 ms to minimize.
[2025-06-02 19:43:37] [INFO ] Deduced a trap composed of 47 places in 211 ms of which 2 ms to minimize.
[2025-06-02 19:43:37] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1128)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:929)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[4]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[4]
Support contains 1 out of 460 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 460/460 places, 1086/1086 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 7 rules applied. Total rules applied 7 place count 460 transition count 1079
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 8 rules applied. Total rules applied 15 place count 453 transition count 1078
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 16 place count 452 transition count 1078
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 3 with 7 rules applied. Total rules applied 23 place count 452 transition count 1071
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 30 place count 445 transition count 1071
Applied a total of 30 rules in 64 ms. Remains 445 /460 variables (removed 15) and now considering 1071/1086 (removed 15) transitions.
Running 1069 sub problems to find dead transitions.
[2025-06-02 19:43:37] [INFO ] Flow matrix only has 1055 transitions (discarded 16 similar events)
// Phase 1: matrix 1055 rows 445 cols
[2025-06-02 19:43:37] [INFO ] Computed 44 invariants in 32 ms
[2025-06-02 19:43:37] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/443 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1069 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/443 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1069 unsolved
[2025-06-02 19:43:47] [INFO ] Deduced a trap composed of 45 places in 130 ms of which 2 ms to minimize.
[2025-06-02 19:43:47] [INFO ] Deduced a trap composed of 31 places in 116 ms of which 1 ms to minimize.
[2025-06-02 19:43:47] [INFO ] Deduced a trap composed of 45 places in 33 ms of which 1 ms to minimize.
[2025-06-02 19:43:47] [INFO ] Deduced a trap composed of 44 places in 31 ms of which 1 ms to minimize.
[2025-06-02 19:43:47] [INFO ] Deduced a trap composed of 44 places in 36 ms of which 0 ms to minimize.
[2025-06-02 19:43:47] [INFO ] Deduced a trap composed of 45 places in 35 ms of which 1 ms to minimize.
[2025-06-02 19:43:47] [INFO ] Deduced a trap composed of 44 places in 34 ms of which 1 ms to minimize.
[2025-06-02 19:43:47] [INFO ] Deduced a trap composed of 45 places in 39 ms of which 1 ms to minimize.
[2025-06-02 19:43:47] [INFO ] Deduced a trap composed of 45 places in 40 ms of which 0 ms to minimize.
[2025-06-02 19:43:47] [INFO ] Deduced a trap composed of 151 places in 202 ms of which 2 ms to minimize.
[2025-06-02 19:43:49] [INFO ] Deduced a trap composed of 19 places in 120 ms of which 2 ms to minimize.
[2025-06-02 19:43:51] [INFO ] Deduced a trap composed of 34 places in 195 ms of which 3 ms to minimize.
[2025-06-02 19:43:51] [INFO ] Deduced a trap composed of 67 places in 191 ms of which 2 ms to minimize.
[2025-06-02 19:43:55] [INFO ] Deduced a trap composed of 173 places in 206 ms of which 3 ms to minimize.
[2025-06-02 19:43:55] [INFO ] Deduced a trap composed of 204 places in 213 ms of which 2 ms to minimize.
[2025-06-02 19:43:56] [INFO ] Deduced a trap composed of 197 places in 215 ms of which 2 ms to minimize.
[2025-06-02 19:43:57] [INFO ] Deduced a trap composed of 203 places in 206 ms of which 2 ms to minimize.
[2025-06-02 19:43:57] [INFO ] Deduced a trap composed of 162 places in 192 ms of which 3 ms to minimize.
[2025-06-02 19:43:57] [INFO ] Deduced a trap composed of 170 places in 197 ms of which 2 ms to minimize.
[2025-06-02 19:43:58] [INFO ] Deduced a trap composed of 208 places in 212 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/443 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1069 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 443/1500 variables, and 62 constraints, problems are : Problem set: 0 solved, 1069 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 28/30 constraints, State Equation: 0/445 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1069/1069 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1069 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/443 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1069 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/443 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1069 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/443 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1069 unsolved
[2025-06-02 19:44:06] [INFO ] Deduced a trap composed of 163 places in 198 ms of which 3 ms to minimize.
[2025-06-02 19:44:06] [INFO ] Deduced a trap composed of 269 places in 200 ms of which 3 ms to minimize.
[2025-06-02 19:44:18] [INFO ] Deduced a trap composed of 197 places in 184 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 443/1500 variables, and 65 constraints, problems are : Problem set: 0 solved, 1069 unsolved in 20016 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 28/30 constraints, State Equation: 0/445 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1069 constraints, Known Traps: 23/23 constraints]
After SMT, in 41735ms problems are : Problem set: 0 solved, 1069 unsolved
Search for dead transitions found 0 dead transitions in 41744ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41810 ms. Remains : 445/460 places, 1071/1086 transitions.
[2025-06-02 19:44:19] [INFO ] Flow matrix only has 1055 transitions (discarded 16 similar events)
[2025-06-02 19:44:19] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2] Max Struct:[4]
RANDOM walk for 1000000 steps (441 resets) in 4649 ms. (215 steps per ms)
BEST_FIRST walk for 1000000 steps (176 resets) in 2062 ms. (484 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[4]
[2025-06-02 19:44:26] [INFO ] Flow matrix only has 1055 transitions (discarded 16 similar events)
[2025-06-02 19:44:26] [INFO ] Invariant cache hit.
[2025-06-02 19:44:26] [INFO ] [Real]Absence check using 14 positive place invariants in 5 ms returned sat
[2025-06-02 19:44:26] [INFO ] [Real]Absence check using 14 positive and 30 generalized place invariants in 20 ms returned sat
[2025-06-02 19:44:27] [INFO ] [Real]Absence check using state equation in 1503 ms returned sat
[2025-06-02 19:44:27] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:44:27] [INFO ] [Nat]Absence check using 14 positive place invariants in 5 ms returned sat
[2025-06-02 19:44:27] [INFO ] [Nat]Absence check using 14 positive and 30 generalized place invariants in 21 ms returned sat
[2025-06-02 19:44:31] [INFO ] [Nat]Absence check using state equation in 3502 ms returned sat
[2025-06-02 19:44:31] [INFO ] State equation strengthened by 96 read => feed constraints.
[2025-06-02 19:44:31] [INFO ] [Nat]Added 96 Read/Feed constraints in 315 ms returned sat
[2025-06-02 19:44:31] [INFO ] Computed and/alt/rep : 408/1485/400 causal constraints (skipped 653 transitions) in 53 ms.
[2025-06-02 19:44:33] [INFO ] Deduced a trap composed of 45 places in 208 ms of which 3 ms to minimize.
[2025-06-02 19:44:33] [INFO ] Deduced a trap composed of 45 places in 205 ms of which 3 ms to minimize.
[2025-06-02 19:44:33] [INFO ] Deduced a trap composed of 177 places in 213 ms of which 2 ms to minimize.
[2025-06-02 19:44:34] [INFO ] Deduced a trap composed of 178 places in 213 ms of which 2 ms to minimize.
[2025-06-02 19:44:34] [INFO ] Deduced a trap composed of 191 places in 203 ms of which 2 ms to minimize.
[2025-06-02 19:44:34] [INFO ] Deduced a trap composed of 202 places in 208 ms of which 3 ms to minimize.
[2025-06-02 19:44:34] [INFO ] Deduced a trap composed of 179 places in 209 ms of which 2 ms to minimize.
[2025-06-02 19:44:35] [INFO ] Deduced a trap composed of 45 places in 39 ms of which 0 ms to minimize.
[2025-06-02 19:44:35] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2281 ms
[2025-06-02 19:44:35] [INFO ] Added : 95 causal constraints over 20 iterations in 3752 ms. Result :sat
Minimization took 4037 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[4]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[4]
Support contains 1 out of 445 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 445/445 places, 1071/1071 transitions.
Applied a total of 0 rules in 17 ms. Remains 445 /445 variables (removed 0) and now considering 1071/1071 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 445/445 places, 1071/1071 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 445/445 places, 1071/1071 transitions.
Applied a total of 0 rules in 15 ms. Remains 445 /445 variables (removed 0) and now considering 1071/1071 (removed 0) transitions.
[2025-06-02 19:44:40] [INFO ] Flow matrix only has 1055 transitions (discarded 16 similar events)
[2025-06-02 19:44:40] [INFO ] Invariant cache hit.
[2025-06-02 19:44:40] [INFO ] Implicit Places using invariants in 464 ms returned []
[2025-06-02 19:44:40] [INFO ] Flow matrix only has 1055 transitions (discarded 16 similar events)
[2025-06-02 19:44:40] [INFO ] Invariant cache hit.
[2025-06-02 19:44:41] [INFO ] State equation strengthened by 96 read => feed constraints.
[2025-06-02 19:44:49] [INFO ] Implicit Places using invariants and state equation in 8491 ms returned []
Implicit Place search using SMT with State Equation took 8956 ms to find 0 implicit places.
[2025-06-02 19:44:49] [INFO ] Redundant transitions in 14 ms returned []
Running 1069 sub problems to find dead transitions.
[2025-06-02 19:44:49] [INFO ] Flow matrix only has 1055 transitions (discarded 16 similar events)
[2025-06-02 19:44:49] [INFO ] Invariant cache hit.
[2025-06-02 19:44:49] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/443 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1069 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/443 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1069 unsolved
[2025-06-02 19:44:58] [INFO ] Deduced a trap composed of 45 places in 58 ms of which 1 ms to minimize.
[2025-06-02 19:44:58] [INFO ] Deduced a trap composed of 45 places in 51 ms of which 1 ms to minimize.
[2025-06-02 19:44:58] [INFO ] Deduced a trap composed of 44 places in 32 ms of which 1 ms to minimize.
[2025-06-02 19:44:58] [INFO ] Deduced a trap composed of 45 places in 34 ms of which 1 ms to minimize.
[2025-06-02 19:44:58] [INFO ] Deduced a trap composed of 35 places in 106 ms of which 2 ms to minimize.
[2025-06-02 19:44:58] [INFO ] Deduced a trap composed of 44 places in 34 ms of which 1 ms to minimize.
[2025-06-02 19:44:58] [INFO ] Deduced a trap composed of 45 places in 31 ms of which 0 ms to minimize.
[2025-06-02 19:44:58] [INFO ] Deduced a trap composed of 45 places in 44 ms of which 0 ms to minimize.
[2025-06-02 19:44:58] [INFO ] Deduced a trap composed of 45 places in 40 ms of which 0 ms to minimize.
[2025-06-02 19:44:59] [INFO ] Deduced a trap composed of 176 places in 197 ms of which 2 ms to minimize.
[2025-06-02 19:44:59] [INFO ] Deduced a trap composed of 265 places in 188 ms of which 3 ms to minimize.
[2025-06-02 19:45:01] [INFO ] Deduced a trap composed of 66 places in 189 ms of which 2 ms to minimize.
[2025-06-02 19:45:01] [INFO ] Deduced a trap composed of 19 places in 135 ms of which 2 ms to minimize.
[2025-06-02 19:45:04] [INFO ] Deduced a trap composed of 170 places in 184 ms of which 3 ms to minimize.
[2025-06-02 19:45:04] [INFO ] Deduced a trap composed of 150 places in 197 ms of which 2 ms to minimize.
[2025-06-02 19:45:06] [INFO ] Deduced a trap composed of 186 places in 200 ms of which 2 ms to minimize.
[2025-06-02 19:45:07] [INFO ] Deduced a trap composed of 200 places in 217 ms of which 2 ms to minimize.
[2025-06-02 19:45:07] [INFO ] Deduced a trap composed of 193 places in 217 ms of which 2 ms to minimize.
[2025-06-02 19:45:07] [INFO ] Deduced a trap composed of 160 places in 215 ms of which 3 ms to minimize.
[2025-06-02 19:45:09] [INFO ] Deduced a trap composed of 162 places in 217 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/443 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1069 unsolved
[2025-06-02 19:45:11] [INFO ] Deduced a trap composed of 167 places in 191 ms of which 3 ms to minimize.
[2025-06-02 19:45:11] [INFO ] Deduced a trap composed of 167 places in 196 ms of which 3 ms to minimize.
[2025-06-02 19:45:11] [INFO ] Deduced a trap composed of 158 places in 195 ms of which 3 ms to minimize.
[2025-06-02 19:45:18] [INFO ] Deduced a trap composed of 154 places in 196 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 443/1500 variables, and 66 constraints, problems are : Problem set: 0 solved, 1069 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 28/30 constraints, State Equation: 0/445 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1069/1069 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1069 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/443 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1069 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/443 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1069 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/443 variables, 24/66 constraints. Problems are: Problem set: 0 solved, 1069 unsolved
[2025-06-02 19:45:36] [INFO ] Deduced a trap composed of 283 places in 203 ms of which 3 ms to minimize.
[2025-06-02 19:45:36] [INFO ] Deduced a trap composed of 269 places in 195 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 443/1500 variables, and 68 constraints, problems are : Problem set: 0 solved, 1069 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 28/30 constraints, State Equation: 0/445 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1069 constraints, Known Traps: 26/26 constraints]
After SMT, in 61697ms problems are : Problem set: 0 solved, 1069 unsolved
Search for dead transitions found 0 dead transitions in 61706ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70706 ms. Remains : 445/445 places, 1071/1071 transitions.
[2025-06-02 19:45:51] [INFO ] Flatten gal took : 74 ms
[2025-06-02 19:45:51] [INFO ] Flatten gal took : 40 ms
[2025-06-02 19:45:51] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14499737416094686583.gal : 7 ms
[2025-06-02 19:45:51] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6573884413030260356.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/ReachabilityCardinality14499737416094686583.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6573884413030260356.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
RANDOM walk for 40000 steps (18 resets) in 470 ms. (84 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (15 resets) in 175 ms. (227 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality6573884413030260356.prop.
BEST_FIRST walk for 40001 steps (11 resets) in 229 ms. (173 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 15
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :15 after 22
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :22 after 80
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :80 after 206
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :206 after 234
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :234 after 1806
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :1806 after 1816
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1816 after 1948
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1948 after 2096
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :2096 after 3708
Interrupted probabilistic random walk after 136189 steps, run timeout after 3001 ms. (steps per millisecond=45 ) properties seen :0 out of 2
Probabilistic random walk after 136189 steps, saw 85054 distinct states, run finished after 3001 ms. (steps per millisecond=45 ) properties seen :0
[2025-06-02 19:45:54] [INFO ] Flow matrix only has 1055 transitions (discarded 16 similar events)
[2025-06-02 19:45:54] [INFO ] Invariant cache hit.
[2025-06-02 19:45:54] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 328/329 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/329 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 21/350 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/350 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 6/356 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/356 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 82/438 variables, 23/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/438 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 4/442 variables, 4/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/442 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/443 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/443 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :3708 after 7980
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1498/1500 variables, and 486 constraints, problems are : Problem set: 0 solved, 2 unsolved in 5010 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 443/445 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 328/329 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/329 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 21/350 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/350 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 6/356 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/356 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 82/438 variables, 23/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :7980 after 13792
[2025-06-02 19:45:59] [INFO ] Deduced a trap composed of 45 places in 122 ms of which 2 ms to minimize.
[2025-06-02 19:45:59] [INFO ] Deduced a trap composed of 44 places in 103 ms of which 1 ms to minimize.
[2025-06-02 19:45:59] [INFO ] Deduced a trap composed of 45 places in 88 ms of which 2 ms to minimize.
[2025-06-02 19:45:59] [INFO ] Deduced a trap composed of 45 places in 73 ms of which 1 ms to minimize.
[2025-06-02 19:45:59] [INFO ] Deduced a trap composed of 45 places in 56 ms of which 1 ms to minimize.
[2025-06-02 19:46:00] [INFO ] Deduced a trap composed of 44 places in 38 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/438 variables, 6/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/438 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 4/442 variables, 4/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/442 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 1/443 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/443 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1498/1500 variables, and 492 constraints, problems are : Problem set: 0 solved, 2 unsolved in 5013 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 443/445 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 6/6 constraints]
After SMT, in 10030ms problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 445 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 445/445 places, 1071/1071 transitions.
Applied a total of 0 rules in 19 ms. Remains 445 /445 variables (removed 0) and now considering 1071/1071 (removed 0) transitions.
Running 1069 sub problems to find dead transitions.
[2025-06-02 19:46:04] [INFO ] Flow matrix only has 1055 transitions (discarded 16 similar events)
[2025-06-02 19:46:04] [INFO ] Invariant cache hit.
[2025-06-02 19:46:04] [INFO ] State equation strengthened by 96 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :13792 after 87200
At refinement iteration 0 (INCLUDED_ONLY) 0/443 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1069 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/443 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1069 unsolved
[2025-06-02 19:46:13] [INFO ] Deduced a trap composed of 45 places in 56 ms of which 1 ms to minimize.
[2025-06-02 19:46:13] [INFO ] Deduced a trap composed of 45 places in 52 ms of which 1 ms to minimize.
[2025-06-02 19:46:13] [INFO ] Deduced a trap composed of 44 places in 38 ms of which 1 ms to minimize.
[2025-06-02 19:46:13] [INFO ] Deduced a trap composed of 45 places in 41 ms of which 0 ms to minimize.
[2025-06-02 19:46:13] [INFO ] Deduced a trap composed of 35 places in 112 ms of which 1 ms to minimize.
[2025-06-02 19:46:13] [INFO ] Deduced a trap composed of 44 places in 45 ms of which 0 ms to minimize.
[2025-06-02 19:46:14] [INFO ] Deduced a trap composed of 45 places in 45 ms of which 0 ms to minimize.
[2025-06-02 19:46:14] [INFO ] Deduced a trap composed of 45 places in 43 ms of which 1 ms to minimize.
[2025-06-02 19:46:14] [INFO ] Deduced a trap composed of 45 places in 42 ms of which 1 ms to minimize.
[2025-06-02 19:46:14] [INFO ] Deduced a trap composed of 176 places in 203 ms of which 3 ms to minimize.
[2025-06-02 19:46:14] [INFO ] Deduced a trap composed of 265 places in 203 ms of which 2 ms to minimize.
[2025-06-02 19:46:16] [INFO ] Deduced a trap composed of 66 places in 202 ms of which 3 ms to minimize.
[2025-06-02 19:46:17] [INFO ] Deduced a trap composed of 19 places in 142 ms of which 2 ms to minimize.
[2025-06-02 19:46:19] [INFO ] Deduced a trap composed of 170 places in 197 ms of which 3 ms to minimize.
[2025-06-02 19:46:20] [INFO ] Deduced a trap composed of 150 places in 202 ms of which 2 ms to minimize.
[2025-06-02 19:46:22] [INFO ] Deduced a trap composed of 186 places in 203 ms of which 2 ms to minimize.
[2025-06-02 19:46:22] [INFO ] Deduced a trap composed of 200 places in 216 ms of which 2 ms to minimize.
[2025-06-02 19:46:22] [INFO ] Deduced a trap composed of 193 places in 220 ms of which 3 ms to minimize.
[2025-06-02 19:46:23] [INFO ] Deduced a trap composed of 160 places in 228 ms of which 2 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :87200 after 145820
[2025-06-02 19:46:25] [INFO ] Deduced a trap composed of 162 places in 218 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/443 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1069 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 443/1500 variables, and 62 constraints, problems are : Problem set: 0 solved, 1069 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 28/30 constraints, State Equation: 0/445 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1069/1069 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1069 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/443 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1069 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/443 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1069 unsolved
Detected timeout of ITS tools.
[2025-06-02 19:46:41] [INFO ] Flatten gal took : 37 ms
[2025-06-02 19:46:41] [INFO ] Applying decomposition
[2025-06-02 19:46:41] [INFO ] Flatten gal took : 42 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/graph16843603175369942292.txt' '-o' '/tmp/graph16843603175369942292.bin' '-w' '/tmp/graph16843603175369942292.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16843603175369942292.bin' '-l' '-1' '-v' '-w' '/tmp/graph16843603175369942292.weights' '-q' '0' '-e' '0.001'
[2025-06-02 19:46:41] [INFO ] Decomposing Gal with order
[2025-06-02 19:46:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 19:46:41] [INFO ] Removed a total of 1044 redundant transitions.
[2025-06-02 19:46:41] [INFO ] Flatten gal took : 139 ms
[2025-06-02 19:46:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 573 labels/synchronizations in 44 ms.
[2025-06-02 19:46:41] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16246656313677771053.gal : 19 ms
[2025-06-02 19:46:41] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16413894029291989261.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/ReachabilityCardinality16246656313677771053.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16413894029291989261.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/ReachabilityCardinality16413894029291989261.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1 after 36
At refinement iteration 2 (INCLUDED_ONLY) 0/443 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1069 unsolved
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :36 after 422
[2025-06-02 19:46:43] [INFO ] Deduced a trap composed of 161 places in 204 ms of which 3 ms to minimize.
[2025-06-02 19:46:44] [INFO ] Deduced a trap composed of 272 places in 195 ms of which 2 ms to minimize.
[2025-06-02 19:46:44] [INFO ] Deduced a trap composed of 281 places in 187 ms of which 2 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :422 after 1718
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 443/1500 variables, and 65 constraints, problems are : Problem set: 0 solved, 1069 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 28/30 constraints, State Equation: 0/445 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1069 constraints, Known Traps: 23/23 constraints]
After SMT, in 41910ms problems are : Problem set: 0 solved, 1069 unsolved
Search for dead transitions found 0 dead transitions in 41919ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41940 ms. Remains : 445/445 places, 1071/1071 transitions.
RANDOM walk for 40000 steps (18 resets) in 509 ms. (78 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (10 resets) in 232 ms. (171 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (10 resets) in 199 ms. (200 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :1718 after 4070
Interrupted probabilistic random walk after 138176 steps, run timeout after 3001 ms. (steps per millisecond=46 ) properties seen :0 out of 2
Probabilistic random walk after 138176 steps, saw 86197 distinct states, run finished after 3001 ms. (steps per millisecond=46 ) properties seen :0
[2025-06-02 19:46:49] [INFO ] Flow matrix only has 1055 transitions (discarded 16 similar events)
[2025-06-02 19:46:49] [INFO ] Invariant cache hit.
[2025-06-02 19:46:49] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 328/329 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/329 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 21/350 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/350 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 6/356 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/356 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 82/438 variables, 23/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/438 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 4/442 variables, 4/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/442 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/443 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/443 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :4070 after 8733
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :8733 after 16959
SDD proceeding with computation,2 properties remain. new max is 131072
SDD size :16959 after 23022
Detected timeout of ITS tools.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1498/1500 variables, and 486 constraints, problems are : Problem set: 0 solved, 2 unsolved in 45009 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 443/445 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 328/329 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/329 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 21/350 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/350 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 6/356 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/356 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 82/438 variables, 23/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-02 19:47:34] [INFO ] Deduced a trap composed of 45 places in 111 ms of which 1 ms to minimize.
[2025-06-02 19:47:35] [INFO ] Deduced a trap composed of 44 places in 88 ms of which 1 ms to minimize.
[2025-06-02 19:47:35] [INFO ] Deduced a trap composed of 45 places in 73 ms of which 1 ms to minimize.
[2025-06-02 19:47:35] [INFO ] Deduced a trap composed of 45 places in 60 ms of which 1 ms to minimize.
[2025-06-02 19:47:35] [INFO ] Deduced a trap composed of 45 places in 47 ms of which 1 ms to minimize.
[2025-06-02 19:47:35] [INFO ] Deduced a trap composed of 44 places in 30 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/438 variables, 6/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/438 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 4/442 variables, 4/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/442 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 1/443 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/443 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 1055/1498 variables, 443/492 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1498 variables, 96/588 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1498 variables, 2/590 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-02 19:47:52] [INFO ] Deduced a trap composed of 185 places in 204 ms of which 3 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/1498 variables, 1/591 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1498 variables, 0/591 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 2/1500 variables, 2/593 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1500 variables, 1/594 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-02 19:47:53] [INFO ] Deduced a trap composed of 19 places in 204 ms of which 3 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/1500 variables, 1/595 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1500 variables, 0/595 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/1500 variables, 0/595 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1500/1500 variables, and 595 constraints, problems are : Problem set: 0 solved, 2 unsolved in 18662 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 445/445 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 8/8 constraints]
After SMT, in 63677ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 342 ms.
Support contains 1 out of 445 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 445/445 places, 1071/1071 transitions.
Applied a total of 0 rules in 15 ms. Remains 445 /445 variables (removed 0) and now considering 1071/1071 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 445/445 places, 1071/1071 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 445/445 places, 1071/1071 transitions.
Applied a total of 0 rules in 16 ms. Remains 445 /445 variables (removed 0) and now considering 1071/1071 (removed 0) transitions.
[2025-06-02 19:47:53] [INFO ] Flow matrix only has 1055 transitions (discarded 16 similar events)
[2025-06-02 19:47:53] [INFO ] Invariant cache hit.
[2025-06-02 19:47:54] [INFO ] Implicit Places using invariants in 459 ms returned []
[2025-06-02 19:47:54] [INFO ] Flow matrix only has 1055 transitions (discarded 16 similar events)
[2025-06-02 19:47:54] [INFO ] Invariant cache hit.
[2025-06-02 19:47:54] [INFO ] State equation strengthened by 96 read => feed constraints.
[2025-06-02 19:48:02] [INFO ] Implicit Places using invariants and state equation in 8473 ms returned []
Implicit Place search using SMT with State Equation took 8932 ms to find 0 implicit places.
[2025-06-02 19:48:02] [INFO ] Redundant transitions in 14 ms returned []
Running 1069 sub problems to find dead transitions.
[2025-06-02 19:48:02] [INFO ] Flow matrix only has 1055 transitions (discarded 16 similar events)
[2025-06-02 19:48:02] [INFO ] Invariant cache hit.
[2025-06-02 19:48:02] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/443 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1069 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/443 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1069 unsolved
[2025-06-02 19:48:12] [INFO ] Deduced a trap composed of 45 places in 120 ms of which 1 ms to minimize.
[2025-06-02 19:48:12] [INFO ] Deduced a trap composed of 45 places in 50 ms of which 1 ms to minimize.
[2025-06-02 19:48:12] [INFO ] Deduced a trap composed of 44 places in 34 ms of which 1 ms to minimize.
[2025-06-02 19:48:12] [INFO ] Deduced a trap composed of 45 places in 33 ms of which 1 ms to minimize.
[2025-06-02 19:48:12] [INFO ] Deduced a trap composed of 35 places in 110 ms of which 2 ms to minimize.
[2025-06-02 19:48:12] [INFO ] Deduced a trap composed of 44 places in 37 ms of which 0 ms to minimize.
[2025-06-02 19:48:12] [INFO ] Deduced a trap composed of 45 places in 30 ms of which 1 ms to minimize.
[2025-06-02 19:48:12] [INFO ] Deduced a trap composed of 45 places in 38 ms of which 0 ms to minimize.
[2025-06-02 19:48:12] [INFO ] Deduced a trap composed of 45 places in 36 ms of which 0 ms to minimize.
[2025-06-02 19:48:13] [INFO ] Deduced a trap composed of 176 places in 186 ms of which 2 ms to minimize.
[2025-06-02 19:48:13] [INFO ] Deduced a trap composed of 265 places in 190 ms of which 2 ms to minimize.
[2025-06-02 19:48:15] [INFO ] Deduced a trap composed of 66 places in 188 ms of which 2 ms to minimize.
[2025-06-02 19:48:15] [INFO ] Deduced a trap composed of 19 places in 136 ms of which 2 ms to minimize.
[2025-06-02 19:48:18] [INFO ] Deduced a trap composed of 170 places in 193 ms of which 2 ms to minimize.
[2025-06-02 19:48:18] [INFO ] Deduced a trap composed of 150 places in 184 ms of which 3 ms to minimize.
[2025-06-02 19:48:20] [INFO ] Deduced a trap composed of 186 places in 243 ms of which 3 ms to minimize.
[2025-06-02 19:48:20] [INFO ] Deduced a trap composed of 200 places in 217 ms of which 3 ms to minimize.
[2025-06-02 19:48:21] [INFO ] Deduced a trap composed of 193 places in 202 ms of which 3 ms to minimize.
[2025-06-02 19:48:21] [INFO ] Deduced a trap composed of 160 places in 202 ms of which 2 ms to minimize.
[2025-06-02 19:48:23] [INFO ] Deduced a trap composed of 162 places in 207 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/443 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1069 unsolved
[2025-06-02 19:48:25] [INFO ] Deduced a trap composed of 167 places in 224 ms of which 2 ms to minimize.
[2025-06-02 19:48:25] [INFO ] Deduced a trap composed of 167 places in 219 ms of which 2 ms to minimize.
[2025-06-02 19:48:25] [INFO ] Deduced a trap composed of 158 places in 205 ms of which 2 ms to minimize.
[2025-06-02 19:48:32] [INFO ] Deduced a trap composed of 154 places in 195 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 443/1500 variables, and 66 constraints, problems are : Problem set: 0 solved, 1069 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 28/30 constraints, State Equation: 0/445 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1069/1069 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1069 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/443 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1069 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/443 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1069 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/443 variables, 24/66 constraints. Problems are: Problem set: 0 solved, 1069 unsolved
[2025-06-02 19:48:50] [INFO ] Deduced a trap composed of 283 places in 220 ms of which 2 ms to minimize.
[2025-06-02 19:48:50] [INFO ] Deduced a trap composed of 269 places in 196 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 443/1500 variables, and 68 constraints, problems are : Problem set: 0 solved, 1069 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 28/30 constraints, State Equation: 0/445 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1069 constraints, Known Traps: 26/26 constraints]
After SMT, in 62014ms problems are : Problem set: 0 solved, 1069 unsolved
Search for dead transitions found 0 dead transitions in 62023ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70997 ms. Remains : 445/445 places, 1071/1071 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[2] Max Struct:[4]
Ending property specific reduction for PolyORBLF-PT-S02J06T08-UpperBounds-11 in 332959 ms.
Starting property specific reduction for PolyORBLF-PT-S02J06T08-UpperBounds-15
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:[4]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[4]
[2025-06-02 19:49:04] [INFO ] Flow matrix only has 1070 transitions (discarded 16 similar events)
// Phase 1: matrix 1070 rows 460 cols
[2025-06-02 19:49:04] [INFO ] Computed 44 invariants in 24 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[4]
RANDOM walk for 10000 steps (4 resets) in 49 ms. (200 steps per ms)
BEST_FIRST walk for 10000 steps (3 resets) in 28 ms. (344 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[4]
[2025-06-02 19:49:04] [INFO ] Flow matrix only has 1070 transitions (discarded 16 similar events)
[2025-06-02 19:49:04] [INFO ] Invariant cache hit.
[2025-06-02 19:49:04] [INFO ] [Real]Absence check using 18 positive place invariants in 6 ms returned sat
[2025-06-02 19:49:04] [INFO ] [Real]Absence check using 18 positive and 26 generalized place invariants in 11 ms returned sat
[2025-06-02 19:49:05] [INFO ] [Real]Absence check using state equation in 477 ms returned sat
[2025-06-02 19:49:05] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:49:05] [INFO ] [Nat]Absence check using 18 positive place invariants in 6 ms returned sat
[2025-06-02 19:49:05] [INFO ] [Nat]Absence check using 18 positive and 26 generalized place invariants in 11 ms returned sat
[2025-06-02 19:49:06] [INFO ] [Nat]Absence check using state equation in 940 ms returned sat
[2025-06-02 19:49:06] [INFO ] State equation strengthened by 96 read => feed constraints.
[2025-06-02 19:49:06] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-02 19:49:06] [INFO ] [Nat]Added 96 Read/Feed constraints in 616 ms returned sat
[2025-06-02 19:49:07] [INFO ] Deduced a trap composed of 46 places in 212 ms of which 3 ms to minimize.
[2025-06-02 19:49:07] [INFO ] Deduced a trap composed of 47 places in 66 ms of which 1 ms to minimize.
[2025-06-02 19:49:07] [INFO ] Deduced a trap composed of 46 places in 36 ms of which 0 ms to minimize.
[2025-06-02 19:49:07] [INFO ] Deduced a trap composed of 47 places in 38 ms of which 0 ms to minimize.
[2025-06-02 19:49:07] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 523 ms
[2025-06-02 19:49:07] [INFO ] Computed and/alt/rep : 416/1493/408 causal constraints (skipped 660 transitions) in 53 ms.
[2025-06-02 19:49:08] [INFO ] Added : 5 causal constraints over 1 iterations in 736 ms. Result :sat
Minimization took 607 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[4]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[4]
Support contains 1 out of 460 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 460/460 places, 1086/1086 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 7 rules applied. Total rules applied 7 place count 460 transition count 1079
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 453 transition count 1079
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 2 with 8 rules applied. Total rules applied 22 place count 453 transition count 1071
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 30 place count 445 transition count 1071
Applied a total of 30 rules in 47 ms. Remains 445 /460 variables (removed 15) and now considering 1071/1086 (removed 15) transitions.
Running 1069 sub problems to find dead transitions.
[2025-06-02 19:49:08] [INFO ] Flow matrix only has 1055 transitions (discarded 16 similar events)
// Phase 1: matrix 1055 rows 445 cols
[2025-06-02 19:49:08] [INFO ] Computed 44 invariants in 17 ms
[2025-06-02 19:49:08] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/443 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1069 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/443 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1069 unsolved
[2025-06-02 19:49:18] [INFO ] Deduced a trap composed of 45 places in 69 ms of which 1 ms to minimize.
[2025-06-02 19:49:18] [INFO ] Deduced a trap composed of 46 places in 53 ms of which 1 ms to minimize.
[2025-06-02 19:49:18] [INFO ] Deduced a trap composed of 45 places in 51 ms of which 0 ms to minimize.
[2025-06-02 19:49:18] [INFO ] Deduced a trap composed of 45 places in 55 ms of which 1 ms to minimize.
[2025-06-02 19:49:18] [INFO ] Deduced a trap composed of 45 places in 62 ms of which 1 ms to minimize.
[2025-06-02 19:49:18] [INFO ] Deduced a trap composed of 44 places in 33 ms of which 1 ms to minimize.
[2025-06-02 19:49:18] [INFO ] Deduced a trap composed of 44 places in 41 ms of which 1 ms to minimize.
[2025-06-02 19:49:18] [INFO ] Deduced a trap composed of 44 places in 230 ms of which 2 ms to minimize.
[2025-06-02 19:49:19] [INFO ] Deduced a trap composed of 150 places in 227 ms of which 2 ms to minimize.
[2025-06-02 19:49:21] [INFO ] Deduced a trap composed of 65 places in 225 ms of which 2 ms to minimize.
[2025-06-02 19:49:21] [INFO ] Deduced a trap composed of 162 places in 218 ms of which 3 ms to minimize.
[2025-06-02 19:49:24] [INFO ] Deduced a trap composed of 19 places in 147 ms of which 2 ms to minimize.
[2025-06-02 19:49:25] [INFO ] Deduced a trap composed of 270 places in 200 ms of which 2 ms to minimize.
[2025-06-02 19:49:26] [INFO ] Deduced a trap composed of 199 places in 191 ms of which 2 ms to minimize.
[2025-06-02 19:49:27] [INFO ] Deduced a trap composed of 161 places in 211 ms of which 3 ms to minimize.
[2025-06-02 19:49:27] [INFO ] Deduced a trap composed of 192 places in 207 ms of which 3 ms to minimize.
[2025-06-02 19:49:27] [INFO ] Deduced a trap composed of 207 places in 204 ms of which 3 ms to minimize.
[2025-06-02 19:49:27] [INFO ] Deduced a trap composed of 197 places in 209 ms of which 2 ms to minimize.
[2025-06-02 19:49:28] [INFO ] Deduced a trap composed of 201 places in 207 ms of which 3 ms to minimize.
[2025-06-02 19:49:28] [INFO ] Deduced a trap composed of 188 places in 107 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/443 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1069 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 443/1500 variables, and 62 constraints, problems are : Problem set: 0 solved, 1069 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 28/30 constraints, State Equation: 0/445 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1069/1069 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1069 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/443 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1069 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/443 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1069 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/443 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1069 unsolved
[2025-06-02 19:49:49] [INFO ] Deduced a trap composed of 150 places in 204 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 443/1500 variables, and 63 constraints, problems are : Problem set: 0 solved, 1069 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 28/30 constraints, State Equation: 0/445 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1069 constraints, Known Traps: 21/21 constraints]
After SMT, in 41834ms problems are : Problem set: 0 solved, 1069 unsolved
Search for dead transitions found 0 dead transitions in 41843ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41893 ms. Remains : 445/460 places, 1071/1086 transitions.
[2025-06-02 19:49:50] [INFO ] Flow matrix only has 1055 transitions (discarded 16 similar events)
[2025-06-02 19:49:50] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2] Max Struct:[4]
RANDOM walk for 1000000 steps (404 resets) in 4657 ms. (214 steps per ms)
BEST_FIRST walk for 1000000 steps (185 resets) in 2113 ms. (473 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[4]
[2025-06-02 19:49:57] [INFO ] Flow matrix only has 1055 transitions (discarded 16 similar events)
[2025-06-02 19:49:57] [INFO ] Invariant cache hit.
[2025-06-02 19:49:57] [INFO ] [Real]Absence check using 14 positive place invariants in 5 ms returned sat
[2025-06-02 19:49:57] [INFO ] [Real]Absence check using 14 positive and 30 generalized place invariants in 30 ms returned sat
[2025-06-02 19:49:58] [INFO ] [Real]Absence check using state equation in 948 ms returned sat
[2025-06-02 19:49:58] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:49:58] [INFO ] [Nat]Absence check using 14 positive place invariants in 5 ms returned sat
[2025-06-02 19:49:58] [INFO ] [Nat]Absence check using 14 positive and 30 generalized place invariants in 17 ms returned sat
[2025-06-02 19:50:00] [INFO ] [Nat]Absence check using state equation in 1456 ms returned sat
[2025-06-02 19:50:00] [INFO ] State equation strengthened by 96 read => feed constraints.
[2025-06-02 19:50:00] [INFO ] [Nat]Added 96 Read/Feed constraints in 237 ms returned sat
[2025-06-02 19:50:00] [INFO ] Computed and/alt/rep : 408/1485/400 causal constraints (skipped 653 transitions) in 65 ms.
[2025-06-02 19:50:02] [INFO ] Deduced a trap composed of 45 places in 55 ms of which 1 ms to minimize.
[2025-06-02 19:50:02] [INFO ] Deduced a trap composed of 44 places in 48 ms of which 1 ms to minimize.
[2025-06-02 19:50:02] [INFO ] Deduced a trap composed of 45 places in 39 ms of which 1 ms to minimize.
[2025-06-02 19:50:02] [INFO ] Deduced a trap composed of 44 places in 35 ms of which 0 ms to minimize.
[2025-06-02 19:50:02] [INFO ] Deduced a trap composed of 44 places in 36 ms of which 1 ms to minimize.
[2025-06-02 19:50:02] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 600 ms
[2025-06-02 19:50:02] [INFO ] Added : 92 causal constraints over 19 iterations in 2370 ms. Result :sat
Minimization took 4671 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[4]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[4]
Support contains 1 out of 445 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 445/445 places, 1071/1071 transitions.
Applied a total of 0 rules in 23 ms. Remains 445 /445 variables (removed 0) and now considering 1071/1071 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 445/445 places, 1071/1071 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 445/445 places, 1071/1071 transitions.
Applied a total of 0 rules in 15 ms. Remains 445 /445 variables (removed 0) and now considering 1071/1071 (removed 0) transitions.
[2025-06-02 19:50:07] [INFO ] Flow matrix only has 1055 transitions (discarded 16 similar events)
[2025-06-02 19:50:07] [INFO ] Invariant cache hit.
[2025-06-02 19:50:07] [INFO ] Implicit Places using invariants in 477 ms returned []
[2025-06-02 19:50:07] [INFO ] Flow matrix only has 1055 transitions (discarded 16 similar events)
[2025-06-02 19:50:07] [INFO ] Invariant cache hit.
[2025-06-02 19:50:09] [INFO ] State equation strengthened by 96 read => feed constraints.
[2025-06-02 19:50:16] [INFO ] Implicit Places using invariants and state equation in 8835 ms returned []
Implicit Place search using SMT with State Equation took 9313 ms to find 0 implicit places.
[2025-06-02 19:50:16] [INFO ] Redundant transitions in 13 ms returned []
Running 1069 sub problems to find dead transitions.
[2025-06-02 19:50:16] [INFO ] Flow matrix only has 1055 transitions (discarded 16 similar events)
[2025-06-02 19:50:16] [INFO ] Invariant cache hit.
[2025-06-02 19:50:16] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/443 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1069 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/443 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1069 unsolved
[2025-06-02 19:50:26] [INFO ] Deduced a trap composed of 45 places in 53 ms of which 0 ms to minimize.
[2025-06-02 19:50:26] [INFO ] Deduced a trap composed of 46 places in 51 ms of which 1 ms to minimize.
[2025-06-02 19:50:26] [INFO ] Deduced a trap composed of 45 places in 47 ms of which 1 ms to minimize.
[2025-06-02 19:50:26] [INFO ] Deduced a trap composed of 44 places in 35 ms of which 0 ms to minimize.
[2025-06-02 19:50:26] [INFO ] Deduced a trap composed of 55 places in 116 ms of which 1 ms to minimize.
[2025-06-02 19:50:26] [INFO ] Deduced a trap composed of 45 places in 36 ms of which 0 ms to minimize.
[2025-06-02 19:50:26] [INFO ] Deduced a trap composed of 44 places in 45 ms of which 0 ms to minimize.
[2025-06-02 19:50:26] [INFO ] Deduced a trap composed of 44 places in 31 ms of which 0 ms to minimize.
[2025-06-02 19:50:26] [INFO ] Deduced a trap composed of 45 places in 34 ms of which 1 ms to minimize.
[2025-06-02 19:50:26] [INFO ] Deduced a trap composed of 150 places in 195 ms of which 2 ms to minimize.
[2025-06-02 19:50:27] [INFO ] Deduced a trap composed of 163 places in 202 ms of which 2 ms to minimize.
[2025-06-02 19:50:27] [INFO ] Deduced a trap composed of 170 places in 196 ms of which 3 ms to minimize.
[2025-06-02 19:50:30] [INFO ] Deduced a trap composed of 44 places in 195 ms of which 2 ms to minimize.
[2025-06-02 19:50:30] [INFO ] Deduced a trap composed of 65 places in 208 ms of which 3 ms to minimize.
[2025-06-02 19:50:32] [INFO ] Deduced a trap composed of 19 places in 140 ms of which 2 ms to minimize.
[2025-06-02 19:50:34] [INFO ] Deduced a trap composed of 188 places in 189 ms of which 3 ms to minimize.
[2025-06-02 19:50:35] [INFO ] Deduced a trap composed of 227 places in 236 ms of which 2 ms to minimize.
[2025-06-02 19:50:36] [INFO ] Deduced a trap composed of 177 places in 218 ms of which 3 ms to minimize.
[2025-06-02 19:50:36] [INFO ] Deduced a trap composed of 181 places in 217 ms of which 3 ms to minimize.
[2025-06-02 19:50:37] [INFO ] Deduced a trap composed of 208 places in 233 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/443 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1069 unsolved
[2025-06-02 19:50:45] [INFO ] Deduced a trap composed of 178 places in 189 ms of which 3 ms to minimize.
[2025-06-02 19:50:46] [INFO ] Deduced a trap composed of 232 places in 238 ms of which 3 ms to minimize.
[2025-06-02 19:50:46] [INFO ] Deduced a trap composed of 199 places in 209 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 443/1500 variables, and 65 constraints, problems are : Problem set: 0 solved, 1069 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 28/30 constraints, State Equation: 0/445 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1069/1069 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1069 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/443 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1069 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/443 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1069 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/443 variables, 23/65 constraints. Problems are: Problem set: 0 solved, 1069 unsolved
[2025-06-02 19:50:58] [INFO ] Deduced a trap composed of 285 places in 218 ms of which 3 ms to minimize.
[2025-06-02 19:51:09] [INFO ] Deduced a trap composed of 265 places in 197 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 443/1500 variables, and 67 constraints, problems are : Problem set: 0 solved, 1069 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 28/30 constraints, State Equation: 0/445 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1069 constraints, Known Traps: 25/25 constraints]
After SMT, in 62064ms problems are : Problem set: 0 solved, 1069 unsolved
Search for dead transitions found 0 dead transitions in 62073ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71426 ms. Remains : 445/445 places, 1071/1071 transitions.
[2025-06-02 19:51:18] [INFO ] Flatten gal took : 38 ms
[2025-06-02 19:51:18] [INFO ] Flatten gal took : 36 ms
[2025-06-02 19:51:19] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17563594418007741111.gal : 7 ms
[2025-06-02 19:51:19] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3209349484327967583.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/ReachabilityCardinality17563594418007741111.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3209349484327967583.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
RANDOM walk for 40000 steps (24 resets) in 513 ms. (77 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality3209349484327967583.prop.
BEST_FIRST walk for 40003 steps (8 resets) in 285 ms. (139 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (10 resets) in 439 ms. (90 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 15
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :15 after 22
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :22 after 80
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :80 after 206
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :206 after 234
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :234 after 1650
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :1650 after 1682
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1682 after 1746
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1746 after 1892
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1892 after 2196
Interrupted probabilistic random walk after 131416 steps, run timeout after 3001 ms. (steps per millisecond=43 ) properties seen :0 out of 2
Probabilistic random walk after 131416 steps, saw 82092 distinct states, run finished after 3001 ms. (steps per millisecond=43 ) properties seen :0
[2025-06-02 19:51:22] [INFO ] Flow matrix only has 1055 transitions (discarded 16 similar events)
[2025-06-02 19:51:22] [INFO ] Invariant cache hit.
[2025-06-02 19:51:22] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 251/252 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/252 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :2196 after 4872
At refinement iteration 3 (OVERLAPS) 75/327 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/327 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 4/331 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/331 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 110/441 variables, 25/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-02 19:51:22] [INFO ] Deduced a trap composed of 46 places in 116 ms of which 2 ms to minimize.
[2025-06-02 19:51:22] [INFO ] Deduced a trap composed of 44 places in 90 ms of which 2 ms to minimize.
[2025-06-02 19:51:22] [INFO ] Deduced a trap composed of 45 places in 76 ms of which 1 ms to minimize.
[2025-06-02 19:51:22] [INFO ] Deduced a trap composed of 44 places in 59 ms of which 1 ms to minimize.
[2025-06-02 19:51:22] [INFO ] Deduced a trap composed of 45 places in 45 ms of which 1 ms to minimize.
[2025-06-02 19:51:22] [INFO ] Deduced a trap composed of 44 places in 41 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/441 variables, 6/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/441 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 2/443 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/443 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 1055/1498 variables, 443/492 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1498 variables, 96/588 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-02 19:51:24] [INFO ] Deduced a trap composed of 181 places in 206 ms of which 3 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1498 variables, 1/589 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/1498 variables, 0/589 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 2/1500 variables, 2/591 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1500 variables, 1/592 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1500 variables, 0/592 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/1500 variables, 0/592 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1500/1500 variables, and 592 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2764 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 445/445 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 251/252 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/252 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 75/327 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/327 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 4/331 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/331 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 110/441 variables, 25/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/441 variables, 7/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-02 19:51:25] [INFO ] Deduced a trap composed of 44 places in 43 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/441 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/441 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 2/443 variables, 2/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/443 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :4872 after 10174
At refinement iteration 13 (OVERLAPS) 1055/1498 variables, 443/494 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1498 variables, 96/590 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1498 variables, 2/592 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1498 variables, 0/592 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 2/1500 variables, 2/594 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1500 variables, 1/595 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1500 variables, 0/595 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/1500 variables, 0/595 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1500/1500 variables, and 595 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3124 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 445/445 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 8/8 constraints]
After SMT, in 5895ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 202 ms.
Support contains 1 out of 445 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 445/445 places, 1071/1071 transitions.
Applied a total of 0 rules in 15 ms. Remains 445 /445 variables (removed 0) and now considering 1071/1071 (removed 0) transitions.
Running 1069 sub problems to find dead transitions.
[2025-06-02 19:51:28] [INFO ] Flow matrix only has 1055 transitions (discarded 16 similar events)
[2025-06-02 19:51:28] [INFO ] Invariant cache hit.
[2025-06-02 19:51:28] [INFO ] State equation strengthened by 96 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :10174 after 45696
At refinement iteration 0 (INCLUDED_ONLY) 0/443 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1069 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/443 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1069 unsolved
[2025-06-02 19:51:37] [INFO ] Deduced a trap composed of 45 places in 53 ms of which 0 ms to minimize.
[2025-06-02 19:51:37] [INFO ] Deduced a trap composed of 46 places in 49 ms of which 1 ms to minimize.
[2025-06-02 19:51:37] [INFO ] Deduced a trap composed of 45 places in 44 ms of which 1 ms to minimize.
[2025-06-02 19:51:37] [INFO ] Deduced a trap composed of 44 places in 33 ms of which 0 ms to minimize.
[2025-06-02 19:51:37] [INFO ] Deduced a trap composed of 55 places in 114 ms of which 1 ms to minimize.
[2025-06-02 19:51:37] [INFO ] Deduced a trap composed of 45 places in 34 ms of which 1 ms to minimize.
[2025-06-02 19:51:37] [INFO ] Deduced a trap composed of 44 places in 51 ms of which 1 ms to minimize.
[2025-06-02 19:51:37] [INFO ] Deduced a trap composed of 44 places in 37 ms of which 1 ms to minimize.
[2025-06-02 19:51:38] [INFO ] Deduced a trap composed of 45 places in 39 ms of which 0 ms to minimize.
[2025-06-02 19:51:38] [INFO ] Deduced a trap composed of 150 places in 198 ms of which 3 ms to minimize.
[2025-06-02 19:51:38] [INFO ] Deduced a trap composed of 163 places in 198 ms of which 2 ms to minimize.
[2025-06-02 19:51:39] [INFO ] Deduced a trap composed of 170 places in 190 ms of which 2 ms to minimize.
[2025-06-02 19:51:41] [INFO ] Deduced a trap composed of 44 places in 183 ms of which 2 ms to minimize.
[2025-06-02 19:51:42] [INFO ] Deduced a trap composed of 65 places in 183 ms of which 2 ms to minimize.
[2025-06-02 19:51:43] [INFO ] Deduced a trap composed of 19 places in 141 ms of which 2 ms to minimize.
[2025-06-02 19:51:45] [INFO ] Deduced a trap composed of 188 places in 190 ms of which 2 ms to minimize.
[2025-06-02 19:51:46] [INFO ] Deduced a trap composed of 227 places in 206 ms of which 2 ms to minimize.
[2025-06-02 19:51:47] [INFO ] Deduced a trap composed of 177 places in 188 ms of which 3 ms to minimize.
[2025-06-02 19:51:47] [INFO ] Deduced a trap composed of 181 places in 188 ms of which 2 ms to minimize.
[2025-06-02 19:51:48] [INFO ] Deduced a trap composed of 208 places in 206 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/443 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1069 unsolved
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :45696 after 114900
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 443/1500 variables, and 62 constraints, problems are : Problem set: 0 solved, 1069 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 28/30 constraints, State Equation: 0/445 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1069/1069 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1069 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/443 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1069 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/443 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1069 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/443 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1069 unsolved
[2025-06-02 19:51:58] [INFO ] Deduced a trap composed of 269 places in 208 ms of which 2 ms to minimize.
Detected timeout of ITS tools.
[2025-06-02 19:52:09] [INFO ] Flatten gal took : 34 ms
[2025-06-02 19:52:09] [INFO ] Applying decomposition
[2025-06-02 19:52:09] [INFO ] Flatten gal took : 34 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/graph17213945895502334480.txt' '-o' '/tmp/graph17213945895502334480.bin' '-w' '/tmp/graph17213945895502334480.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17213945895502334480.bin' '-l' '-1' '-v' '-w' '/tmp/graph17213945895502334480.weights' '-q' '0' '-e' '0.001'
[2025-06-02 19:52:09] [INFO ] Decomposing Gal with order
[2025-06-02 19:52:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 19:52:09] [INFO ] Removed a total of 1145 redundant transitions.
[2025-06-02 19:52:09] [INFO ] Flatten gal took : 80 ms
[2025-06-02 19:52:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 730 labels/synchronizations in 22 ms.
[2025-06-02 19:52:09] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5492885711572339634.gal : 7 ms
[2025-06-02 19:52:09] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4073271977955403697.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/ReachabilityCardinality5492885711572339634.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4073271977955403697.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality4073271977955403697.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :4 after 10
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :10 after 20
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :20 after 20
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :20 after 20
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :20 after 20
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :20 after 20
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :20 after 1807
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1807 after 1951
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1951 after 2960
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :2960 after 3204
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 443/1500 variables, and 63 constraints, problems are : Problem set: 0 solved, 1069 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 28/30 constraints, State Equation: 0/445 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1069 constraints, Known Traps: 21/21 constraints]
After SMT, in 42049ms problems are : Problem set: 0 solved, 1069 unsolved
Search for dead transitions found 0 dead transitions in 42058ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42075 ms. Remains : 445/445 places, 1071/1071 transitions.
RANDOM walk for 40000 steps (19 resets) in 716 ms. (55 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (10 resets) in 248 ms. (160 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (10 resets) in 290 ms. (137 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :3204 after 18557
Interrupted probabilistic random walk after 137038 steps, run timeout after 3001 ms. (steps per millisecond=45 ) properties seen :0 out of 2
Probabilistic random walk after 137038 steps, saw 85432 distinct states, run finished after 3001 ms. (steps per millisecond=45 ) properties seen :0
[2025-06-02 19:52:13] [INFO ] Flow matrix only has 1055 transitions (discarded 16 similar events)
[2025-06-02 19:52:13] [INFO ] Invariant cache hit.
[2025-06-02 19:52:13] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 251/252 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/252 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 75/327 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/327 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 4/331 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/331 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 110/441 variables, 25/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-02 19:52:14] [INFO ] Deduced a trap composed of 46 places in 117 ms of which 2 ms to minimize.
[2025-06-02 19:52:14] [INFO ] Deduced a trap composed of 44 places in 92 ms of which 2 ms to minimize.
[2025-06-02 19:52:14] [INFO ] Deduced a trap composed of 45 places in 80 ms of which 2 ms to minimize.
[2025-06-02 19:52:14] [INFO ] Deduced a trap composed of 44 places in 60 ms of which 1 ms to minimize.
[2025-06-02 19:52:14] [INFO ] Deduced a trap composed of 45 places in 46 ms of which 1 ms to minimize.
[2025-06-02 19:52:14] [INFO ] Deduced a trap composed of 44 places in 34 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/441 variables, 6/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/441 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 2/443 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/443 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 1055/1498 variables, 443/492 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1498 variables, 96/588 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1498 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 2/1500 variables, 2/590 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1500 variables, 1/591 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1500 variables, 0/591 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/1500 variables, 0/591 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1500/1500 variables, and 591 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2286 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 445/445 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 251/252 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/252 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 75/327 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/327 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 4/331 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/331 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 110/441 variables, 25/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/441 variables, 6/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-02 19:52:16] [INFO ] Deduced a trap composed of 44 places in 33 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/441 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/441 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 2/443 variables, 2/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/443 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :18557 after 33898
At refinement iteration 13 (OVERLAPS) 1055/1498 variables, 443/493 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1498 variables, 96/589 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1498 variables, 2/591 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1498 variables, 0/591 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 2/1500 variables, 2/593 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1500 variables, 1/594 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1500 variables, 0/594 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/1500 variables, 0/594 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1500/1500 variables, and 594 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1881 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 445/445 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 7/7 constraints]
After SMT, in 4174ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 218 ms.
Support contains 1 out of 445 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 445/445 places, 1071/1071 transitions.
Applied a total of 0 rules in 15 ms. Remains 445 /445 variables (removed 0) and now considering 1071/1071 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 445/445 places, 1071/1071 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 445/445 places, 1071/1071 transitions.
Applied a total of 0 rules in 14 ms. Remains 445 /445 variables (removed 0) and now considering 1071/1071 (removed 0) transitions.
[2025-06-02 19:52:18] [INFO ] Flow matrix only has 1055 transitions (discarded 16 similar events)
[2025-06-02 19:52:18] [INFO ] Invariant cache hit.
[2025-06-02 19:52:18] [INFO ] Implicit Places using invariants in 481 ms returned []
[2025-06-02 19:52:18] [INFO ] Flow matrix only has 1055 transitions (discarded 16 similar events)
[2025-06-02 19:52:18] [INFO ] Invariant cache hit.
[2025-06-02 19:52:20] [INFO ] State equation strengthened by 96 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :33898 after 92856
[2025-06-02 19:52:27] [INFO ] Implicit Places using invariants and state equation in 8922 ms returned []
Implicit Place search using SMT with State Equation took 9414 ms to find 0 implicit places.
[2025-06-02 19:52:27] [INFO ] Redundant transitions in 13 ms returned []
Running 1069 sub problems to find dead transitions.
[2025-06-02 19:52:27] [INFO ] Flow matrix only has 1055 transitions (discarded 16 similar events)
[2025-06-02 19:52:27] [INFO ] Invariant cache hit.
[2025-06-02 19:52:27] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/443 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1069 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/443 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1069 unsolved
[2025-06-02 19:52:37] [INFO ] Deduced a trap composed of 45 places in 52 ms of which 1 ms to minimize.
[2025-06-02 19:52:37] [INFO ] Deduced a trap composed of 46 places in 49 ms of which 1 ms to minimize.
[2025-06-02 19:52:37] [INFO ] Deduced a trap composed of 45 places in 49 ms of which 0 ms to minimize.
[2025-06-02 19:52:37] [INFO ] Deduced a trap composed of 44 places in 41 ms of which 0 ms to minimize.
[2025-06-02 19:52:37] [INFO ] Deduced a trap composed of 55 places in 124 ms of which 2 ms to minimize.
[2025-06-02 19:52:38] [INFO ] Deduced a trap composed of 45 places in 37 ms of which 1 ms to minimize.
[2025-06-02 19:52:38] [INFO ] Deduced a trap composed of 44 places in 57 ms of which 2 ms to minimize.
[2025-06-02 19:52:38] [INFO ] Deduced a trap composed of 44 places in 36 ms of which 0 ms to minimize.
[2025-06-02 19:52:38] [INFO ] Deduced a trap composed of 45 places in 37 ms of which 0 ms to minimize.
[2025-06-02 19:52:38] [INFO ] Deduced a trap composed of 150 places in 217 ms of which 3 ms to minimize.
[2025-06-02 19:52:39] [INFO ] Deduced a trap composed of 163 places in 220 ms of which 3 ms to minimize.
[2025-06-02 19:52:39] [INFO ] Deduced a trap composed of 170 places in 218 ms of which 2 ms to minimize.
[2025-06-02 19:52:42] [INFO ] Deduced a trap composed of 44 places in 217 ms of which 3 ms to minimize.
[2025-06-02 19:52:42] [INFO ] Deduced a trap composed of 65 places in 205 ms of which 2 ms to minimize.
[2025-06-02 19:52:44] [INFO ] Deduced a trap composed of 19 places in 151 ms of which 2 ms to minimize.
[2025-06-02 19:52:46] [INFO ] Deduced a trap composed of 188 places in 210 ms of which 3 ms to minimize.
[2025-06-02 19:52:47] [INFO ] Deduced a trap composed of 227 places in 239 ms of which 2 ms to minimize.
[2025-06-02 19:52:48] [INFO ] Deduced a trap composed of 177 places in 211 ms of which 3 ms to minimize.
[2025-06-02 19:52:48] [INFO ] Deduced a trap composed of 181 places in 209 ms of which 2 ms to minimize.
[2025-06-02 19:52:49] [INFO ] Deduced a trap composed of 208 places in 228 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/443 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1069 unsolved
[2025-06-02 19:52:57] [INFO ] Deduced a trap composed of 178 places in 209 ms of which 2 ms to minimize.
[2025-06-02 19:52:58] [INFO ] Deduced a trap composed of 232 places in 234 ms of which 2 ms to minimize.
[2025-06-02 19:52:58] [INFO ] Deduced a trap composed of 199 places in 220 ms of which 3 ms to minimize.
Detected timeout of ITS tools.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 443/1500 variables, and 65 constraints, problems are : Problem set: 0 solved, 1069 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 28/30 constraints, State Equation: 0/445 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1069/1069 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1069 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/443 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1069 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/443 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1069 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/443 variables, 23/65 constraints. Problems are: Problem set: 0 solved, 1069 unsolved
[2025-06-02 19:53:09] [INFO ] Deduced a trap composed of 285 places in 198 ms of which 3 ms to minimize.
[2025-06-02 19:53:20] [INFO ] Deduced a trap composed of 265 places in 213 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 443/1500 variables, and 67 constraints, problems are : Problem set: 0 solved, 1069 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 28/30 constraints, State Equation: 0/445 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1069 constraints, Known Traps: 25/25 constraints]
After SMT, in 62246ms problems are : Problem set: 0 solved, 1069 unsolved
Search for dead transitions found 0 dead transitions in 62254ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71705 ms. Remains : 445/445 places, 1071/1071 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[2] Max Struct:[4]
Ending property specific reduction for PolyORBLF-PT-S02J06T08-UpperBounds-15 in 265321 ms.
[2025-06-02 19:53:30] [INFO ] Flatten gal took : 32 ms
[2025-06-02 19:53:30] [INFO ] Applying decomposition
[2025-06-02 19:53:30] [INFO ] Flatten gal took : 31 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/graph2469170671025332674.txt' '-o' '/tmp/graph2469170671025332674.bin' '-w' '/tmp/graph2469170671025332674.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2469170671025332674.bin' '-l' '-1' '-v' '-w' '/tmp/graph2469170671025332674.weights' '-q' '0' '-e' '0.001'
[2025-06-02 19:53:30] [INFO ] Decomposing Gal with order
[2025-06-02 19:53:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 19:53:30] [INFO ] Removed a total of 1134 redundant transitions.
[2025-06-02 19:53:30] [INFO ] Flatten gal took : 88 ms
[2025-06-02 19:53:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 451 labels/synchronizations in 16 ms.
[2025-06-02 19:53:30] [INFO ] Time to serialize gal into /tmp/UpperBounds2568686220968747584.gal : 7 ms
[2025-06-02 19:53:30] [INFO ] Time to serialize properties into /tmp/UpperBounds9162751481899323316.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/UpperBounds2568686220968747584.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds9162751481899323316.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/UpperBounds9162751481899323316.prop.
ITS-tools command line returned an error code 137
[2025-06-02 20:02:26] [INFO ] Flatten gal took : 33 ms
[2025-06-02 20:02:26] [INFO ] Time to serialize gal into /tmp/UpperBounds209762588113292063.gal : 7 ms
[2025-06-02 20:02:26] [INFO ] Time to serialize properties into /tmp/UpperBounds9040769848478723456.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/UpperBounds209762588113292063.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds9040769848478723456.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 ...303
Loading property file /tmp/UpperBounds9040769848478723456.prop.
ITS-tools command line returned an error code 137
[2025-06-02 20:11:20] [INFO ] Flatten gal took : 48 ms
[2025-06-02 20:11:21] [INFO ] Input system was already deterministic with 1086 transitions.
[2025-06-02 20:11:21] [INFO ] Transformed 460 places.
[2025-06-02 20:11:21] [INFO ] Transformed 1086 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2025-06-02 20:11:51] [INFO ] Time to serialize gal into /tmp/UpperBounds7652174858374000199.gal : 9 ms
[2025-06-02 20:11:51] [INFO ] Time to serialize properties into /tmp/UpperBounds10786773440197050147.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/UpperBounds7652174858374000199.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds10786773440197050147.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--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 ...350
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds10786773440197050147.prop.
ITS-tools command line returned an error code 137
Total runtime 3010834 ms.
BK_STOP 1748895720376
--------------------
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="PolyORBLF-PT-S02J06T08"
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 PolyORBLF-PT-S02J06T08, 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 r167-tall-174881266100056"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-PT-S02J06T08.tgz
mv PolyORBLF-PT-S02J06T08 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;